Theoretical Computer Science
A characterization of lambda definability in categorical models of implicit polymorphism
Theoretical Computer Science
A New Characterization of Lambda Definability
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
A Term Calculus for Intuitionistic Linear Logic
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
What is a Categorical Model of Intuitionistic Linear Logic?
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Linear Lambda-Calculus and Categorial Models Revisited
CSL '92 Selected Papers from the Workshop on Computer Science Logic
CSL '92 Selected Papers from the Workshop on Computer Science Logic
A Mixed Linear and Non-Linear Logic: Proofs, Terms and Models (Extended Abstract)
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
The Girard Translation Extended with Recursion
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
From Action Calculi to Linear Logic
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Linear Logic, Monads and the Lambda Calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Linearly Used Effects: Monadic and CPS Transformations into the Linear Lambda Calculus
FLOPS '02 Proceedings of the 6th International Symposium on Functional and Logic Programming
Classical Linear Logic of Implications
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Classical linear logic of implications
Mathematical Structures in Computer Science
Proving noninterference by a fully complete translation to the simply typed λ-calculus
ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
A terminating and confluent linear lambda calculus
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
| Hi-index | 0.00 |
We present a short proof of a folklore result: the Girard translation from the simply typed lambda calculus to the linear lambda calculus is fully complete. The proof makes use of a notion of logical predicates for intuitionistic linear logic. While the main result is of independent interest, this paper can be read as a tutorial on this proof technique for reasoning about relations between type theories.