7 search results - page 1 / 2 » Realizability Semantics of Parametric Polymorphism, General ... |
121
Voted
FOSSACS
2009
Springer
15 years 9 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....
MSCS
2010
15 years 29 days ago
2010
tations of imperative abstract data 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...
236
Voted
POPL
2007
ACM
16 years 2 months ago
2007
ACM
We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...
224
Voted
POPL
2007
ACM
16 years 2 months ago
2007
ACM
We present an internal language with equivalent expressive power to Standard ML, and discuss its formalization in LF and the machine-checked verification of its type safety in Twe...