From parametric polymorphism to models of polymorphic FPC
Publikation:
Artikel i tidsskrift og konference artikel i tidsskrift
Tidsskriftartikel
Forskning
Peer-reviewResume
This paper shows how parametric PILL Y (Polymorphic Intuitionistic / Linear Lambda calculus with a fixed point combinator Y) can be used as a metalanguage for domain theory, as originally suggested by Plotkin more than a decade ago. Using recent results about solutions to recursive domain equations in parametric models of PILL Y , we show how to interpret FPC in these. 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 the first model of a language with parametric polymorphism, recursive terms and recursive types in a non-linear setting.
Publikation information
Produktionstype
Publikation:
Artikel i tidsskrift og konference artikel i tidsskrift
Tidsskriftartikel
Forskning
Peer-reviewOriginalsprog
EngelskSider fra-til (Antal sider)
Sider 639-686Tidsskrift (Bind, Nummer)
Mathematical Structures in Computer Science (Bind 19, Udgave 4)Publikationsmilepæle
- Udgivet - 2009
Publikationsstatus
Udgivet - 2009
ISSN
0960-1295Publikations IDer
- Scopus: 69749083448
Metrikker
PlumX
Antal citationer
3
Hentninger
2
