20 search results - page 2 / 4 » A Per Model of Polymorphism and Recursive Types |
136
Voted
TLDI
2009
ACM
15 years 11 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...
127
Voted
ENTCS
2006
15 years 2 months ago
2006
We present a formalization of a version of Abadi and Plotkin's logic for parametricity for a polymorphic dual intuitionistic / linear type theory with fixed points, and show,...
124
Voted
LICS
2008
IEEE
15 years 9 months ago
2008
IEEE
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
91
Voted
APLAS
2005
ACM
15 years 8 months ago
2005
ACM
The formal core calculus .FJ has been introduced to model lightweight family polymorphism, a programming style to support reusable yet type-safe mutually recursive classes. This pa...
137
Voted
FPCA
1989
15 years 6 months ago
1989
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...