BibTeX
@MISC{Hasegawa00girardtranslation,
author = {Masahito Hasegawa},
title = {Girard Translation and Logical Predicates},
year = {2000}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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.
Citations
| 79 | Dual intuitionistic linear logic - Barber - 1996 |
| 34 | Linear logic,” Theoret - Girard - 1987 |
| 26 | An Axiomatic Approach to Adequacy - Bräuner - 1996 |
| 11 | A characterization of lambda definability in categorical models of implicit polymorphism - Alimohamed - 1995 |
| 11 | Logical predicates for intuitionistic linear type theories, Typed Lambda Calculi and Applications - Hasegawa - 1999 |
| 5 | Categorical glueing and logical predicates for models of linear logic - Hasegawa - 1999 |
| 5 | A New Characterisation of Lambda Definability - Jung, Tiuryn - 1993 |
