Categorical models for Abadi and Plotkin's logic for parametricity

Mathematical Structures in Computer Science

Volumn 15, Issue 4, 2005, Pages 709-772

  Birkedal, Lars ^a   Møgelberg, Rasmus E ^a  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33646236163     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129505004834     Document Type: Article

References (21)

1. Dunphy, B. (2004) Parametricity as a notion of uniformity in reflexive graphs, Ph.D. thesis.
2. Dunphy, B. and Reddy, U.S. (2004) Parametric limits. In: Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS-04)) 242-251.
3. Hasegawa, R. (1994) Categorical data types in parametric polymorphism. Mathematical Structures in Computer Science 4 71-109.
4. Hyland, J., Robinson, E. and Rosolini, G. (1990) The discrete objects in the effective topos. Proc. London Math. Soc. 3 (60) 1-36.
5. Jacobs, B. (1999) Categorical Logic and Type Theory. Studies in Logic and the Foundations of Mathematics 141, Elsevier Science Publishers B.V.
6. Ma, Q. and Reynolds, J. (1992) Types, abstraction, and parametric polymorphism, part 2. In: Brookes, S., Main, M., Melton, A., Mislove, M. and Schmidt, D. (eds.) Mathematical Foundations of Programming Semantics. Springer-Verlag Lecture Notes in Computer Science 598 1-40.
7. Mac Lane, S. (1971) Categories for the Working Mathematician, Springer-Verlag.
8. Mitchell, J. (1996) Foundations for Programming Languages, MIT Press.
9. Pitts, A. (1987) Polymorphism is set theoretic, constructively. In: Pitt, D.H., Poigné, A. and Rydeheard, D. E. (eds.) Category Theory and Computer Science, Proc., Edinburgh 1987. Springer-Verlag Lecture Notes in Computer Science 283 12-39.
10. Pitts, A.M. (1989) Non-trivial power types can't be subtypes of polymorphic types. In: 4th Annual Symposium on Logic in Computer Science, IEEE Computer Society Press 6-13.
11. Plotkin, G. (1993) Second order type theory and recursion. Notes for a talk at the Scott Fest.
12. Plotkin, G. and Abadi, M. (1993) A logic for parametric polymorphism. In: Typed lambda calculi and applications (Utrecht, 1993). Springer-Verlag Lecture Notes in Computer Science 664 361-375.
13. Reynolds, J. (1983) Types, abstraction, and parametric polymorphism. Information Processing 83 513-523.
14. Reynolds, J. (1984) Polymorphism is not set-theoretic. In: Kahn, G., MacQueen, D. B. and Plotkin, G.D. (eds.) Semantics of Data Types. Springer-Verlag Lecture Notes in Computer Science 173 145-156.
15. Robinson, E. and Rosolini, G. (1994) Reflexive graphs and parametric polymorphism. In: Abramsky, S. (ed.) Proc. 9th Symposium in Logic in Computer Science, Paris, I.E.E.E. Computer Society 364-371.
16. Rosolini, G. (1995) Notes on synthetic domain theory. (Draft.)
17. Rummelhoff, I. (2004) Polynat in PER-models. Theoretical Computer Science 316 (1-3) 215-224.
18. Seely, R. (1987) Categorical semantics of higher-order polymorphic lambda calculus. The Journal of Symbolic Logic 52 (4) 969-989.
19. Takeuti, I. (1998) An axiomatic system of parametricity. Typed lambda-calculi and applications (Nancy, 1997). Fund. Inform. 33 (4) 397-432.
20. Wadler, P. (1989) Theorems for free! In: 4'th Symposium on Functional Programming Languages and Computer Architecture, ACM, London.
21. Wadler, P. (2004) The Girard-Reynolds isomorphism (second edition). (Manuscript.)