20 search results - page 1 / 4 » Faithful Ideal Models for Recursive Polymorphic Types |
LICS
1989
IEEE
13 years 8 months ago
1989
IEEE
We explore ideal models for a programming language with recursive polymorphic types, variants of the model studied by MacQueen, Plotkin, and Sethi. The use of suitable ideals yiel...
LICS
1990
IEEE
13 years 8 months ago
1990
IEEE
FOSSACS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
APLAS
2005
ACM
13 years 10 months ago
2005
ACM
Abstract. Polymorphic recursion is a useful extension of HindleyMilner typing and has been incorporated in the functional programming language Haskell. It allows the expression of ...
TLDI
2009
ACM
14 years 1 months ago
2009
ACM
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...