Sciweavers

17 search results - page 1 / 4
» tlca 2005
Sort
View
77
Voted
TLCA
2005
Springer
15 years 6 months ago
Higher-Order Abstract Non-interference
Damiano Zanardini
84
Voted
TLCA
2005
Springer
15 years 6 months ago
Reducibility and TT-Lifting for Computation Types
Sam Lindley, Ian Stark
TLCA
2005
Springer
15 years 6 months ago
A Lambda Calculus for Quantum Computation with Classical Control
The objective of this paper is to develop a functional programming language for quantum computers. We develop a lambda calculus for the classical control model, following the firs...
Peter Selinger, Benoît Valiron
103
Voted
TLCA
2005
Springer
15 years 6 months ago
Semantic Cut Elimination in the Intuitionistic Sequent Calculus
Cut elimination is a central result of the proof theory. This paper proposes a new approach for proving the theorem for Gentzen’s intuitionistic sequent calculus LJ, that relies ...
Olivier Hermant