20 search results - page 2 / 4 » Faithful Ideal Models for Recursive Polymorphic Types |
ENTCS
2006
13 years 7 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,...
LICS
2008
IEEE
14 years 1 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...
APLAS
2005
ACM
14 years 1 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...
ESOP
2006
Springer
13 years 11 months ago
2006
Springer
We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...
FPCA
1989
13 years 11 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...