Interpreting polymorphic FPC into domain theoretic models of parametric polymorphism

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

Volumn 4052 LNCS, Issue , 2006, Pages 372-383

  Møgelberg, Rasmus Ejlers ^a  

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; DIFFERENTIAL EQUATIONS; DIFFERENTIATION (CALCULUS); MATHEMATICAL MODELS; NONLINEAR SYSTEMS; RECURSIVE FUNCTIONS;

DOMAIN THEORY; LINEAR LAMBDA CALCULUS; METALANGUAGE; POLYMORPHISM;

COMPUTER PROGRAMMING LANGUAGES;

EID: 33746350776     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11787006_32     Document Type: Conference Paper

References (28)

1. M. Abadi and G.D. Plotkin. A per model of polymorphism and recursive types. In 5th Annual IEEE Symposium on Logic in Computer Science, pages 355-365. IEEE Computer Society Press, 1990.
2. A. Barber. Linear Type Theories, Semantics and Action Calculi. PhD thesis, Edinburgh University, 1997.
3. P.N. Benton. A mixed linear and non-linear logic: Proofs, terms and models (preliminary report). Technical report, University of Cambridge, 1995.
4. G. M. Bierman, A. M. Pitts, and C. V. Russo. Operational properties of Lily, a polymorphic linear lambda calculus with recursion. In Fourth International Workshop on Higher Order Operational Techniques in Semantics, Montréal, volume 41 of Electronic Notes in Theoretical Computer Science. Elsevier, September 2000.
5. L. Birkedal and R. E. Møgelberg. Categorical models of Abadi-Plotkin's logic for parametricity. Mathematical Structures in Computer Science, 15(4):709-772, 2005.
6. L. Birkedal, R. E. Møgelberg, and R. L. Petersen. Category theoretic models of linear Abadi & Plotkin logic. Submitted.
7. L. Birkedal, R. E. Møgelberg, and R. L. Petersen. Domain theoretic models of parametric polymorphism. Submitted.
8. L. Birkedal, R. E. Møgelberg, and R. L. Petersen. Linear Abadi & Plotkin logic. Submitted.
9. L. Birkedal, R. E. Møgelberg, and R. L. Petersen. Parametric domain-theoretic models of linear Abadi & Plotkin logic. 2005. Submitted.
10. L. Birkedal, R. E. Møgelberg, and R. L. Petersen. Parametric domain-theoretic models of polymorphic intuitionistic / linear lambda calculus. In Proceedings of the Twenty-first Conference on the Mathematical Foundations of Programming Semantics, 2005. To appear.
11. L. Birkedal, R.L. Petersen, R.E. Møgelberg, and C. Varming. Operational semantics and models of linear Abadi-Plotkin logic. Manuscript.
12. M. Fiore. Axiomatic Domain Theory in Categories of Partial Maps. Distinguished Dissertations in Computer Science. Cambridge University Press, 1996.
13. P.J. Freyd. Algebraically complete categories. In A. Carboni, M. C. Pedicchio, and G. Rosolini, editors, Category Theory. Proceedings, Como 1990, volume 1488 of Lecture Notes in Mathematics, pages 95-104. Springer-Verlag, 1990.
14. P.J. Freyd. Recursive types reduced to inductive types. In Proceedings of the fifth IEEE Conference on Logic in Computer Science, pages 498-507, 1990.
15. P.J. Freyd. Remarks on algebraically compact categories. In M. P. Fourman, P.T. Johnstone, and A. M. Pitts, editors, Applications of Categories in Computer Science. Proceedings of the LMS Symposium. Durham 1991, volume 177 of London Mathematical Society Lecture Note Series, pages 95-106. Cambridge University Press, 1991.
16. Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50:1-102, 1987.
17. Patricia Johann and Janis Voigtländer. Free theorems in the presence of seq. In Proc. of 31st ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages. POPL2004, Venice, Italy, 14-16 Jan. 2004, pages 99-110. ACM Press, New York, 2004.
18. Paola Maneggia. Models of Linear Polymorphism. PhD thesis. University of Birmingham, Feb. 2004.
19. Maraist, Odersky, Turner, and Wadler. Call-by-name, call-by-value, call-by-need and the linear lambda calculus. TCS: Theoretical Computer Science, 228:175-210, 1999.
20. R. E. Møgelberg. Categorical and domain theoretic models of parametric polymorphism. PhD thesis, IT University of Copenhagen, 2005.
21. A.M. Pitts. Typed operational reasoning. In B. C. Pierce, editor, Advanced Topics in Types and Programming Languages, chapter 7, pages 245-289. The MIT Press, 2005.
22. A.M. Pitts. Relational properties of domains. Information and Computation, 127:66-90, 1996.
23. G. D. Plotkin. Type theory and recursion (extended abstract). In Proceedings, Eighth Annual IEEE Symposium on Logic in Computer Science, page 374, Montreal, Canada, 19-23 June 1993. IEEE Computer Society Press.
24. G.D. Plotkin. Lectures on predomains and partial functions. Notes for a course given at the Center for the Study of Language and Information, Stanford, 1985.
25. G.D. Plotkin. Second order type theory and recursion. Notes for a talk at the Scott Fest, February 1993.
26. Gordon Plotkin and Martín Abadi. A logic for parametric polymorphism. In Typed lambda calculi and applications (Utrecht, 1993), volume 664 of Lecture Notes in Comput. Sci., pages 361-375. Springer, Berlin, 1993.
27. J.C. Reynolds. Types, abstraction, and parametric polymorphism. Information Processing, 83:513-523, 1983.
28. Stephen Tse and Steve Zdancewic. Translating dependency into parametricity. j-SIGPLAN, 39(9): 115-125, September 2004.