Hostname: page-component-6766d58669-7cz98 Total loading time: 0 Render date: 2026-05-19T17:46:25.075Z Has data issue: false hasContentIssue false
  • English
  • Français

From parametric polymorphism to models of polymorphic FPC

Published online by Cambridge University Press:  01 August 2009

RASMUS EJLERS MØGELBERG
RASMUS EJLERS MØGELBERG*
Affiliation:
IT University of Copenhagen, Rued Langgaards Vej 7, 2300 Copenhagen S, Denmark Email: mogel@itu.dk
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper shows how PILLY (Polymorphic Intuitionistic/Linear Lambda calculus with a fixed point combinator Y) with parametric polymorphism can be used as a metalanguage for domain theory, as originally suggested by Plotkin more than a decade ago. Using Plotkin's encodings of recursive types in PILLY, we show how parametric models of PILLY give rise to models of FPC, which is a simply typed lambda calculus with recursive types and an operational call-by-value semantics, reflecting a classical result from domain theory. Essentially, this interpretation is an interpretation of intuitionistic logic into linear logic first discovered by Girard, which in this paper is extended to deal with recursive types. Of particular interest is a model based on ‘admissible’ pers over a reflexive domain, the theory of which can be seen as a domain theory for (impredicative) polymorphism. We show how this model gives rise to a parametric and computationally adequate model of PolyFPC, an extension of FPC with impredicative polymorphism. This is to the author's knowledge the first denotational model of a non-linear language with parametric polymorphism and recursive types.

Information

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 19 , Issue 4 , August 2009 , pp. 639 - 686
Copyright
Copyright © Cambridge University Press 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Abadi, M. and Plotkin, G. (1990) A per model of polymorphism and recursive types. In: 5th Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press 355–365.Google Scholar
Amadio, R. M. (1993) On the adequacy of per models. In: Borzyszkowski, A. M. and Sokolowski, S. (eds.) Mathematical Foundations of Computer Science 1993, 18th International Symposium. Springer-Verlag Lecture Notes in Computer Science 711 222–231.CrossRefGoogle Scholar
Barber, A. (1997) Linear Type Theories, Semantics and Action Calculi, Ph.D. thesis, Edinburgh University.Google Scholar
Benton, N., Bierman, G., de Paiva, V. and Hyland, M. (1992) Term assignment for intuitionistic linear logic. Technical Report 262, Computer Laboratory, University of Cambridge.CrossRefGoogle Scholar
Benton, N. (1995) A mixed linear and non-linear logic: Proofs, terms and models (preliminary report). Technical report, University of Cambridge.CrossRefGoogle Scholar
Birkedal, L. and Møgelberg, R. E. (2005) Categorical models of Abadi and Plotkin's logic for parametricity. Mathematical Structures in Computer Science 15 (4)709–772.CrossRefGoogle Scholar
Birkedal, L., Møgelberg, R. E. and Petersen, R. L. (2006a) Linear Abadi & Plotkin logic. Logical Methods in Computer Science 2.CrossRefGoogle Scholar
Birkedal, L., Møgelberg, R. E. and Petersen, R. L. (2006b) Parametric domain-theoretic models of polymorphic intuitionistic / linear lambda calculus. Electr. Notes Theor. Comput. Sci 155 191–217.CrossRefGoogle Scholar
Birkedal, L., Møgelberg, R. E. and Petersen, R. L. (2007) Domain theoretic models of parametric polymorphism. Theoretical Computer Science 388.Google Scholar
Birkedal, L., Møgelberg, R. E. and Petersen, R. L. (2008) Category theoretic models of linear Abadi & Plotkin logic. Theory and Application of Categories 20 (7)116–151.Google Scholar
Fiore, M. (1996) Axiomatic Domain Theory in Categories of Partial Maps, Distinguished Dissertations in Computer Science, Cambridge University Press.CrossRefGoogle Scholar
Freyd, P. (1990a) Algebraically complete categories. In: Carboni, A., Pedicchio, M. C. and Rosolini, G. (eds.) Category Theory. Proceedings, Como 1990. Springer-Verlag Lecture Notes in Computer Science 1488 95–104.CrossRefGoogle Scholar
Freyd, P. (1990b) Recursive types reduced to inductive types. In: Proceedings of the fifth IEEE Conference on Logic in Computer Science 498–507.Google Scholar
Freyd, P. (1991) Remarks on algebraically compact categories. In: Fourman, M. P., Johnstone, P. and Pitts, A. M. (eds.) Applications of Categories in Computer Science. Proceedings of the LMS Symposium, Durham 1991. London Mathematical Society Lecture Note Series 177 95–106.CrossRefGoogle Scholar
Girard, J.-Y. (1987) Linear logic. Theoretical Computer Science 50 1–102.CrossRefGoogle Scholar
Hyland, J. (1988) A small complete category. Annals of Pure and Applied Logic 40 (2)135–165.CrossRefGoogle Scholar
Hyland, J., Johnstone, P. and Pitts, A. (1980) Tripos theory. Mathematical Proceedings of the Cambridge Philosophical Society 88.CrossRefGoogle Scholar
Jacobs, B. (1994) Semantics of weakening and contraction. Annals of Pure and Applied Logic 69 73–106.CrossRefGoogle Scholar
Jacobs, B. (1999) Categorical Logic and Type Theory. Studies in Logic and the Foundations of Mathematics 141, Elsevier.Google Scholar
Johann, P. and Voigtländer, J. (2004) Free theorems in the presence of seq. In: Proc. of 31st ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL 2004, Venice, Italy, 14–16 Jan. 2004, ACM Press 99–110.Google Scholar
Johnstone, P. T. (2002) Sketches of an elephant: a topos theory compendium. Vol. 2, Oxford Logic Guides 44, Oxford University Press.Google Scholar
Kock, A. (1970) Monads on symmetric monoidal closed categories. Archiv der Mathematik 21 1–10.CrossRefGoogle Scholar
Kock, A. (1972) Strong functors and monoidal monads. Archiv der Mathematik 23 113–120.CrossRefGoogle Scholar
Lambek, J. and Scott, P. (1986) Introduction to higher order categorical logic, Cambridge University Press.Google Scholar
Mac Lane, S. (1971) Categories for the Working Mathematician, Springer-Verlag.CrossRefGoogle Scholar
Maneggia, P. (2004) Models of Linear Polymorphism, Ph.D. thesis, University of Birmingham.Google Scholar
Maraist, J., Odersky, M., Turner, D. N. and Wadler, P. (1999) Call-by-name, call-by-value, call-by-need and the linear lambda calculus. Theoretical Computer Science 228 (1-2)175–210.CrossRefGoogle Scholar
Møgelberg, R. E. (2005) Categorical and domain theoretic models of parametric polymorphism, Ph.D. thesis, IT University of Copenhagen.CrossRefGoogle Scholar
Pitts, A. (1996) Relational properties of domains. Information and Computation 127 66–90.CrossRefGoogle Scholar
Pitts, A. M. (2005) Typed operational reasoning. In: Pierce, B. C. (ed.) Advanced Topics in Types and Programming Languages, The MIT Press 245–289.Google Scholar
Plotkin, G. (1985) Lectures on predomains and partial functions. Notes for a course given at the Center for the Study of Language and Information, Stanford.Google Scholar
Plotkin, G. (1993a) Second order type theory and recursion. Notes for a talk at the Scott Fest.Google Scholar
Plotkin, G. D. (1993b) Type theory and recursion (extended abstract). In: Proceedings, Eighth Annual IEEE Symposium on Logic in Computer Science, Montreal, Canada, IEEE Computer Society Press 374.Google Scholar
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.CrossRefGoogle Scholar
Reynolds, J. (1983) Types, abstraction, and parametric polymorphism. Information Processing 83 513–523.Google Scholar
Robinson, E. and Rosolini, G. (1994) Reflexive graphs and parametric polymorphism. In: Abramsky, S. (ed.) Proc. 9th Symposium in Logic in Computer Science, Paris, IEEE Computer Society Press 364–371.Google Scholar
Scott, D. (1970) Outline of a mathematical theory of computation. In: 4th Annual Princeton Conference on Information Sciences and Systems 169–176.Google Scholar
Scott, D. (1976) Data types as lattices. SIAM Journal of Computing 5 (3)522–587.CrossRefGoogle Scholar
Tse, S. and Zdancewic, S. (2004) Translating dependency into parametricity. j-SIGPLAN 39 (9)115–125.CrossRefGoogle Scholar
van Oosten, J. (2008) Realizability; An Introduction to its Categorical Side. Studies in Logic and the Foundations of Mathematics 152, Elsevier.Google Scholar
Voigtländer, J. and Johann, P. (2006) Selective strictness and parametricity in structural operational semantics. Technical Report TUD-FI06-02, Technische Universität Dresden.Google Scholar