A game semantics for generic polymorphism

Annals of Pure and Applied Logic

Volumn 133, Issue 1-3 SPEC. ISS., 2005, Pages 3-37

  Abramsky, Samson ^a,b,c   Jagadeesan, Radha ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b DEPAUL UNIVERSITY   (United States)

^c UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (25)

1. M. Abadi L. Cardelli P.-L. Curien Formal parametric polymorphism in: Proc. 20th ACM Symposium on Principles of Programming Languages 1993
2. S. Abramsky Semantics of interaction In: A. Pitts P. Dybjer (Eds.) Semantics and Logics of Computation 1997 Cambridge University Press pp. 1-32
3. S. Abramsky E. Haghverdi P. Scott Geometry of interaction and linear combinatory algebras Math. Struct. Comput. Sci. 12 2002 625-665
4. S. Abramsky R. Jagadeesan Games and full completeness for multiplicative linear logic J. Symbolic Logic 59 2 1994 543-574
5. S. Abramsky R. Jagadeesan P. Malacaria Full abstraction for PCF Inform. Comput. 163 2000 409-470
6. S. Abramsky M. Lenisa A fully-complete PER model for ML polymorphic types In: P. Clote H. Schwichtenberg (Eds.) CSL'00 Conf. Proc. LNCS vol. 1862 2000 pp. 140-155
7. S. Abramsky, M. Lenisa, A fully complete minimal PER model for the simply typed λ-calculus, in: CSL'01 Conf. Proc., LNCS, 2001
8. S. Abramsky G. McCusker Games for recursive types in: C. Hankin I. Mackie R. Nagarajan (Eds.) Theory and Formal Methods of Computing 1994 1995 Imperial College Press
9. G. Berry The foundations of esterel In: G. Plotkin C. Stirling M. Tofte Proof, (Eds.) Language and Interaction: Essays in Honour of Robin Milner 2000 MIT Press 425-454
10. R. Crole Categories for Types 1993 Cambridge University Press
11. 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
12. J.-Y. Girard Y. Lafont P. Taylor Proofs and Types 1989 Cambridge University Press
13. D.J.D. Hughes, Hypergame semantics: Full completeness for system F, D.Phil. Thesis, University of Oxford, 1999
14. J.M.E. Hyland A small complete category Ann. Pure Appl. Logic 40 1988
15. F.W. Lawvere Equality in hyperdoctrines and the comprehension schema as an adjoint functor in: Proc. Symp. on Applications of Categorical Logic 1970
16. G. Longo Parametric and type-dependent polymorphism Fund. Inform. 22 1-2 1995 69-92
17. G. Longo K. Milsted S. Soloviev The genericity theorem and parametricity in the polymorphic λ-calculus TCS 121 1 & 2 1993 323-349
18. Q.-Q. Ma J.C. Reynolds Types, abstraction and parametric polymorphism, part 2 In: S. Brookes et al (Eds.) Mathematical Foundations of Programming Language Semantics LNCS vol. 598 1992
19. A. Murawski, On semantic and type-theoretic aspects of polynomial-time computability. D.Phil. Thesis, University of Oxford, 2001
20. A. Pitts Polymorphism is set-theoretic constructively In: D. Pitt (Eds.) CTCS'88 Conf. Proc. LNCS vol. 283 1988
21. G. Plotkin, M. Abadi, A logic for parametric polymorphism, in: TLCA'93 Conf. Proc., LNCS, 1993
22. J.C. Reynolds Towards a theory of type structure in: Programming Symposium, Proceedings, Paris, 1974 LNCS vol. 19 1974
23. J.C. Reynolds Types, abstraction and parametric polymorphism in: Information Processing 83 1983 Elsevier, North-Holland 513-523
24. R.A.G. Seeley Categorical semantics for higher-order polymorphic lambda calculus J. Symbolic Logic 52 4 1987 969-989
25. G. Winskel The Formal Semantics of Programming Languages 1993 MIT Press