Girard translation and logical predicates

Journal of Functional Programming

Volumn 10, Issue 1, 2000, Pages 77-89

  Hasegawa, Masahito ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347898804     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796899003615     Document Type: Article

References (23)

1. Alimohamed, M. (1995) A characterization of lambda definability in categorical models of implicit polymorphism. Theoret. Comp. Sci. 146, 5-23.
2. Barber, A., Gardner, P., Hasegawa, M. and Plotkin, G. (1998) From action calculi to linear logic. In Computer Science Logic (CSL'97), Lecture Notes in Computer Science 1414, pp. 78-97, Springer-Verlag.
3. Barber, A. and Plotkin, G. (1997) Dual intuitionistic linear logic. Submitted for publication. Available from http://www.dcs.ed.ac.uk/home/agb/research.html.
4. Benton, N. (1995) A mixed linear non-linear logic: proofs, terms and models. In Computer Science Logic (CSL'94), Lecture Notes in Computer Science 933, pp. 121-135. Springer-Verlag.
5. Benton, N., Bierman, G. M., de Paiva, V. and Hyland, J. M. E. (1993a) Linear lambda-calculus and categorical models revisited. In Computer Science Logic (CSL'92), Lecture Notes in Computer Science 702, 61-84. Springer-Verlag.
6. Benton, N., Bierman, G. M., de Paiva, V. and Hyland, J. M. E. (1993b) A term calculus for intuitionistic linear logic. In Typed Lambda Calculi and Applications (TLCA'93). Lecture Notes in Computer Science 664, pp. 75-90. Springer-Verlag.
7. Benton, N. and Wadler, P. (1996) Linear logic, monads, and the lambda calculus. In Logic in Computer Science (LICS'96), pp. 420-431. IEEE Computer Society Press.
8. Bierman, G. M. (1995) What is a categorical model of intuitionistic linear logic? In Typed Lambda Calculi and Applications (TLCA '95), Lecture Notes in Computer Science 902, pp. 78-93. Springer-Verlag.
9. Braüner, T. (1995) The Girard translation extended with recursion, In Computer Science Logic (CSL'94), Lecture Notes in Computer Science 933, pp. 31-45. Springer-Verlag.
10. Braüner, T. (1996) An Axiomatic Approach to Adequacy. PhD thesis, University of Aarhus. Technical report BRICS-DS-96-4, BRICS.
11. Danos, V., Joinet, J.-B. and Schellinx, H. (1995) On the linear decoration of intuitionistic derivations. Arch. Math. Logic 33, 387-412.
12. Fiore, M. and Simpson, A. (1999) Lambda definability with sums via Grothendieck logical relations. In Typed Lambda Calculi and Applications (TLCA'99), Lecture Notes in Computer Science 1581, pp. 147-161. Springer-Verlag.
13. Girard, J.-Y. (1972) Interprétation Fonctionelle et Elimination des Coupures dans L'Alithmétique D'Ordre Supérieur. Thèse D'Etat, Université Paris VII.
14. Girard, J.-Y. (1987) Linear logic. Theoret. Comp. Sci. 50, 1-102.
15. Hasegawa, M. (1999a) Logical predicates for intuitionistic linear type theories. In Typed Lambda Calculi and Applications (TLCA'99), Lecture Notes in Computer Science 1581, pp. 198-212. Springer-Verlag.
16. Hasegawa, M. (1999b) Categorical glueing and logical predicates for models of linear logic. Preprint RIMS-1223, Kyoto University.
17. Jung, A. and Tiuryn, J. (1993) A new characterisation of lambda definability. In Typed Lambda Calculi and Applications (TLCA'93). Lecture Notes in Computer Science 664, pp. 230-244. Springer-Verlag.
18. Loader, R. (1994) Models of Lambda Calculi and Linear Logic: Structural, Equational and Proof-Theoretic Characterisations. PhD thesis, St. Hugh's College, Oxford.
19. Mitchell, J. C. and Scedrov, A. (1992) Notes on sconing and relators. In Computer Science Logic (CSL'92). Lecture Notes in Computer Science 702, pp. 352-378. Springer-Verlag.
20. Plotkin, G. D. (1980) Lambda-definability in the full type hierarchy. In To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pp. 363-373. Academic Press.
21. Streicher, T. (1999) Denotational completeness revisited. In Category Theory and Computer Science (CTCS'99), Electron. Notes Theor. Comput. Sci.
22. Tait, W. W. (1967) Intensional interpretation of functionals of finite type I. J. Symbolic Logic 32, 198-212.
23. Tan, A. M. (1997) Full Completeness for Models of Linear Logic. PhD thesis, University of Cambridge.