A game semantics for generic polymorphism

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2620, Issue , 2003, Pages 1-22

  Abramsky, Samson ^a   Jagadeesan, Radha ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b DEPAUL UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

CATEGORICAL MODEL; GAME SEMANTICS; GENERIC STRATEGIES; GENERIC TYPES; NOVEL CONSTRUCTION; POLYMORPHIC PRODUCTS; RECURSIVE EQUATIONS; TYPE VARIABLES;

SEMANTICS;

EID: 28844463817     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36576-1_1     Document Type: Article

References (22)

1. M. Abadi, L. Cardelli and P.-L. Curien. Formal Parametric Polymorphism. In Proc. 20th ACM Symposium on Principles of Programming Languages, 1993.
2. S. Abramsky. Semantics of Interaction. In Semantics and Logics of Computation, edited by A. Pitts and P. Dybjer, Cambridge University Press 1997, 1-32.
3. S. Abramsky, R. Jagadeesan. Games and Full Completeness for Multiplicative Linear Logic, J. of Symbolic Logic 59(2), 1994, 543-574.
4. S. Abramsky, R. Jagadeesan. A Game Semantics for Generic Polymorphism. Oxford University Computing Laboratory Programming Research Group, Research Report RR-03-02, 2003. Available on-line at http://web.comlab.ox.ac.uk/oucl/publications/tr/rr-03-02.
5. S. Abramsky, R. Jagadeesan, P. Malacaria. Full Abstraction for PCF, Inf. and Comp. 163, 2000, 409-470.
6. S. Abramsky, M. Lenisa. A Fully-complete PER Model for ML Polymorphic Types, CSL'00 Conf. Proc., P. Clote, H.Schwichtenberg eds., LNCS 1862, 2000, 140-155.
7. S. Abramsky, M. Lenisa. A Fully Complete Minimal PER Model for the Simply Typed λ-calculus, CSL'01 Conf. Proc., LNCS 2001.
8. S. Abramsky and G. McCusker. Games for Recursive Types. In C. Hankin, I. Mackie and R. Nagarajan, eds. Theory and Formal Methods of Computing 1994. Imperial College Press, 1995.
9. G. Berry. The Foundations of Esterel. In Proof, Language and Interaction: Essays in honour of Robin Milner, eds. G. Plotkin, C. Stirling and M. Tofte. MIT Press 2000, 425-454.
10. 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.
11. J.-Y. Girard, Y. Lafont and P. Taylor. Proofs and Types. Cambridge University Press 1989.
12. D. J. D. Hughes. Hypergame Semantics: Full Completeness for System F. D.Phil. thesis, University of Oxford, 1999.
13. J. M. E. Hyland. A small complete category. Annals of Pure and Applied Logic, 40, 1988.
14. F. W. Lawvere. Equality in hyperdoctrines and the comprehension schema as an adjoint functor, Proc. Symp. on Applications of Categorical Logic, 1970.
15. G. Longo, K. Milsted, S. Soloviev. The Genericity Theorem and Parametricity in the Polymorphic λ-Calculus, TCS 121(1&2):323-349, 1993.
16. G. Longo. Parametric and Type-Dependent Polymorphism. Fundamenta Informaticae 22(1/2):69-92.
17. Q.-Q. Ma and J. C. Reynolds. Types, Abstraction and Parametric Polymorphism, Part 2. In S. Brookes et al. editors, Mathematical Foundations of Programming Language Semantics. LNCS 598, 1992.
18. A. Pitts. Polymorphism is set-theoretic constructively, CTCS'88 Conf. Proc., D.Pitt ed., LNCS 283, 1988.
19. G. Plotkin, M. Abadi. A Logic for Parametric Polymorphism, TLCA'93 Conf. Proc., LNCS, 1993.
20. J. C. Reynolds. Towards a Theory of Type Structure. Programming Symposium, Proceedings, Paris 1974. LNCS 19, 1974.
21. J. C. Reynolds. Types, Abstraction and Parametric Polymorphism. Information Processing 83, pp. 513-523, Elsevier (North-Holland), 1983.
22. R. A. G. Seeley. Categorical semantics for higher-order polymorphic lambda calculus. Journal of Symbolic Logic, 52(4):969-989, 1987.