Linear realizability and full completeness for typed lambda-calculi

Annals of Pure and Applied Logic

Volumn 134, Issue 2-3, 2005, Pages 122-168

  Abramsky, Samson ^a   Lenisa, Marina ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF UDINE   (Italy)

Author keywords

(Axiomatic) Full completeness; Geometry of Interaction; Hyperdoctrines; Linear logic; ML polymorphic types; PER models; Typed lambda calculi

Indexed keywords

EID: 19144365316     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apal.2004.08.003     Document Type: Article

References (35)

1. S. Abramsky Retracing some paths in Process Algebra in: U. Montanari V. Sassone (Eds.), Concur'96, Lecture Notes in Computer Science vol. 1119 1996 Springer Berlin 1-17
2. S. Abramsky, Interaction, Combinators, and Complexity, Notes, Siena, Italy 1997
3. S. Abramsky Axioms for definability and full completeness in: G. Plotkin C. Stirling M. Tofte (Eds.), Proof, Language and Interaction: Essays in Honour of Robin Milner 2000 MIT Press 55-75
4. S. Abramsky A structural approach to reversible computation in: D. Beauquier Y. Matiyasevich (Eds.), LCCS 2001: Proceedings of the International Workshop on Logic and Complexity in Computer Science, LACL 2001 1-16
5. S. Abramsky R. Jagadeesan New foundations for the geometry of interaction Inform. and Comput. 111 1 1994 53-119
6. S. Abramsky R. Jagadeesan Games and full completeness for multiplicative linear logic J. Symbolic Logic 59 2 1994 543-574
7. S. Abramsky R. Jagadeesan P. Malacaria Full abstraction for PCF Inform. and Comput. 163 2000 409-470
8. S. Abramsky, M. Lenisa, Fully Complete Models for ML Polymorphic Types, Technical Report ECS-LFCS-99-414, LFCS, 1999
9. S. Abramsky M. Lenisa A fully-complete PER model for ML polymorphic types in: P. Clote H. Schwichtenberg (Eds.), CSL'00, Lecture Notes in Computer Science vol. 1862 2000 Springer Berlin 140-155
10. S. Abramsky M. Lenisa Axiomatizing fully complete models for ML polymorphic types in: M. Nielsen B. Rovan (Eds.), MFCS'00, Lecture Notes in Computer Science vol. 1893 2000 Springer Berlin 141-151
11. S. Abramsky M. Lenisa A fully complete minimal PER model for the simply typed λ-calculus in: Fribourg (Ed.) CSL'01, Lecture Notes in Computer Science vol. 2142 2001 Springer Berlin 443-457
12. S. Abramsky, J. Longley, Realizability models based on hystory-free strategies, Draft paper, 1999
13. S. Abramsky E. Haghverdi P. Scott Geometry of interaction and linear combinatory algebras Math. Structures Comput. Sci. 12 5 2002 625-665
14. A. Asperti, G. Longo, Categories, types ad structures: An introduction to category theory for the working computer scientist, in: Foundations of Computing Series, The MIT Press, 1991
15. H. Barendregt The Lambda Calculus, its Syntax and Semantics 1984 North-Holland Amsterdam
16. N. Benton, P. Wadler, Linear logic, monads and the lambda calculus, in: LICS'96, 1996
17. G. Bierman What is a categorical model of intuitionistic linear logic? in: M. Dezani (Eds.) TLCA'95, Lecture Notes in Computer Science vol. 902 1995 Springer Berlin 78-93
18. V. Breazu-Tannen T. Coquand Extensional models for polymorphism Theoret. Comput. Sci. 59 1988 85-114
19. R. Crole, Categories for Types, Cambridge University Press, 1993
20. P. Di Gianantonio G. Franco F. Honsell Game semantics for untyped λ-calculus in: J.Y. Girard (Eds.) TLCA'99, Lecture Notes in Computer Science vol. 1581 1999 Springer Berlin 114-128
21. J.Y. Girard, Interprétation functionelle et élimunation des coupures de l'arithmètique d'ordre supérieur, Thèse d'Etat, Université Paris VII, 1972
22. J.Y. Girard Towards a geometry of interaction Contemp. Math. 92 1989 69-108
23. D.J.D. Hughes, Hypergame semantics: Full completeness for System F, Ph.D. Thesis, University of Oxford, 1999
24. M. Hyland L. Ong On full abstraction for PCF Inform. and Comput. 163 2000 285-408
25. J. Hyland E. Robinson G. Rosolini Algebraic types in PER models in: M. Main et al. (Eds.) MFPS'90, Lecture Notes in Computer Science vol. 442 1990 Springer Berlin 333-350
26. A. Joyal R. Street D. Verity Traced monoidal categories Math. Proc. Camb. Phil. Soc. 119 1996 447-468
27. A. Ker H. Nickau L. Ong More universal game models of untyped λ-calculus: The Böhm tree strikes back in: J. Flum M. Rodriquez-Artalejo (Eds.) CSL'99, Lecture Notes in Computer Science vol. 1683 1999 Springer Berlin 405-419
28. J. Laird, Games, control and full abstraction, Ph.D. Thesis, University of Edinburgh, 2000
29. F. Lawvere Equality in hyperdoctrines and the comprehension schema as an adjoint functor in: Proc. Symp. on Applications of Categorical Logic 1970
30. R. Loader, An Algorithm for the Minimal Model, Note, 1997
31. V. Padovani Decidability of all minimal models in: S. Berardi M. Coppo (Eds.) TYPES'95, Lecture Notes in Computer Science vol. 1158 1996 Springer Berlin 201-215
32. A. Pitts Polymorphism is set-theoretic constructively in: D. Pitt et al. (Eds.) CTCS'88, Lecture Notes in Computer Science vol. 283 1988 Springer Berlin 12-39
33. R. Seely, Polymorphic linear logic and topos models, in: Math. Reports, Academy of Science (Canada) XII, 1990
34. R. Statman Completeness, invariance and λ-definability J. Symbolic Logic 47 1 1982
35. R. Statman λ-definable functionals and βη-conversion Arch. Math. Logic 23 1983 21-26