Sciweavers

20 search results - page 1 / 4
» Relational parametricity for references and recursive types
Sort
View
TLDI
2009
ACM
169views Formal Methods» more  TLDI 2009»
14 years 3 months ago
Relational parametricity for references and recursive types
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...
Lars Birkedal, Kristian Støvring, Jacob Tha...
FOSSACS
2009
Springer
14 years 1 months ago
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
Lars Birkedal, Kristian Støvring, Jacob Tha...
MSCS
2010
86views more  MSCS 2010»
13 years 4 months ago
Realisability semantics of parametric polymorphism, general references and recursive types
tations of imperative abstract data types.
Lars Birkedal, Kristian Støvring, Jacob Tha...
APLAS
2006
ACM
14 years 6 days ago
Relational Reasoning for Recursive Types and References
We present a local relational reasoning method for reasoning about contextual equivalence of expressions in a λ-calculus with recursive types and general references. Our developme...
Nina Bohr, Lars Birkedal
ENTCS
2007
82views more  ENTCS 2007»
13 years 6 months ago
Syntactic Logical Relations for Polymorphic and Recursive Types
The method of logical relations assigns a relational interpretation to types that expresses operational invariants satisfied by all terms of a type. The method is widely used in ...
Karl Crary, Robert Harper