Synthetic domain theory and models of linear Abadi & Plotkin logic

Annals of Pure and Applied Logic

Volumn 155, Issue 2, 2008, Pages 115-133

  Møgelberg, Rasmus Ejlers ^a   Birkedal, Lars ^a   Rosolini, Giuseppe ^b  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

^b UNIVERSITY OF GENOA   (Italy)

Author keywords

Domain theory; Intuitionistic set theory; Linear lambda calculus; Parametric polymorphism

Indexed keywords

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

References (27)

1. N. Benton, G. Bierman, V. de Paiva, M. Hyland, Term assignment for intuitionistic linear logic, Technical Report 262, Computer Laboratory, University of Cambridge, August 1992
2. Benton N., Bierman G.M., Hyland J.M.E., and de Paiva V. Linear λ-calculus and categorical models revisited. In: Börger E. (Ed). Proceedings of the Sixth Workshop on Computer Science Logic. Lecture Notes in Computer Science vol. 702 (1992), Springer-Verlag 61-84
3. Bierman G.M., Pitts A.M., and Russo C.V. Operational properties of Lily, a polymorphic linear lambda calculus with recursion. Fourth International Workshop on Higher Order Operational Techniques in Semantics, Montréal. Electronic Notes in Theoretical Computer Science vol. 41 (2000), Elsevier
4. Birkedal L., and Møgelberg R.E. Categorical models of Abadi-Plotkin's logic for parametricity. Mathematical Structures in Computer Science 15 4 (2005) 709-772
5. Birkedal L., Møgelberg R.E., and Petersen R.L. Linear Abadi & Plotkin logic. Logical Methods in Computer Science 2 (2006)
6. Birkedal L., Møgelberg R.E., and Petersen R.L. Category-theoretic models of linear Abadi & Plotkin logic. Theory and Applications of Categories 20 (2008) 116-151
7. Birkedal L., Møgelberg R.E., and Petersen R.L. Domain-theoretical models of parametric polymorphism. Theoretical Computer Science 388 1-3 (2007) 152-172
8. Freyd P.J. Algebraically complete categories. In: Carboni A., Pedicchio M.C., and Rosolini G. (Eds). Category Theory. Proceedings, Como 1990. Lecture Notes in Mathematics vol. 1488 (1990), Springer-Verlag 95-104
9. P.J. Freyd, Recursive types reduced to inductive types, in: Proceedings of the Fifth IEEE Conference on Logic in Computer Science, 1990, pp. 498-507
10. Freyd P.J. Remarks on algebraically compact categories. In: Fourman M.P., Johnstone P.T., and Pitts A.M. (Eds). Applications of Categories in Computer Science. Proceedings of the LMS Symposium, Durham 1991. London Mathematical Society Lecture Note Series vol. 177 (1991), Cambridge University Press 95-106
11. Jacobs B. Categorical Logic and Type Theory. Studies in Logic and the Foundations of Mathematics vol. 141 (1999), Elsevier Science Publishers B.V
12. Joyal A., and Moerdijk I. Algebraic Set Theory. London Mathematical Society Lecture Notes in Mathematics vol. 220 (1995), Cambridge University Press
13. Kelly G.M. Doctrinal adjunction. Category Seminar (Proc. Sem., Sydney, 1972/1973). Lecture Notes in Math. vol. 420 (1974), Springer, Berlin 257-280
14. Longley J.R., and Simpson A.K. A uniform approach to domain theory in realizability models. Mathematical Structures in Computer Science 11 (1996)
15. Ma Q., and Reynolds J.C. 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. Lecture Notes in Computer Science vol. 598 (1992), Springer-Verlag 1-40
16. Maietti M.E., Maneggia P., de Paiva V., and Ritter E. Relating categorical semantics for intuitionistic linear logic. Applied Categorical Structures 13 1 (2005) 1-36
17. R.E. Møgelberg, Categorical and domain theoretic models of parametric polymorphism, Ph.D. Thesis, IT University of Copenhagen, 2005
18. R.E. Møgelberg, Parametric completion for models of polymorphic intuitionistic/linear lambda calculus, Technical Report TR-2005-60, IT University of Copenhagen, February 2005
19. R.E. Møgelberg, L. Birkedal, R.L. Petersen, Categorical models of PILL, Technical Report TR-2005-58, IT University of Copenhagen, February 2005
20. Plotkin G.D. Type theory and recursion (extended abstract). Proceedings, Eighth Annual IEEE Symposium on Logic in Computer Science. Montreal, Canada, 19-23 June (1993), IEEE Computer Society Press 374
21. G.D. Plotkin, Second order type theory and recursion, Notes for a talk at the Scott Fest, February 1993
22. Plotkin G., and Abadi M. A logic for parametric polymorphism. Typed Lambda Calculi and Applications (Utrecht, 1993). Lecture Notes in Comput. Sci. vol. 664 (1993), Springer, Berlin 361-375
23. Robinson E.P., and Rosolini G. Reflexive graphs and parametric polymorphism. In: Abramsky S. (Ed). Proc. 9th Symposium in Logic in Computer Science (1994), I.E.E.E. Computer Society, Paris 364-371
24. G. Rosolini, A. Simpson, Using synthetic domain theory to prove operational properties of a polymorphic programming language based on strictness, Manuscript, available from: http://homepages.inf.ed.ac.uk/als/Research/, 2004
25. Simpson A. Computational adequacy in an elementary topos. CSL: 12th Workshop on Computer Science Logic. LNCS (1998), Springer-Verlag
26. Simpson A. Elementary axioms for categories of classes. 14th Symposium on Logic in Computer Science. LICS'99 (1999), IEEE, Washington, Brussels, Tokyo 77-87
27. Simpson A. Computational adequacy for recursive types in models of intuitionistic set theory. Annals of Pure and Applied Logic 130 (2004)