102 search results - page 1 / 21 » Syntactic Logical Relations for Polymorphic and Recursive Ty... |
106
click to vote
ENTCS
2007
15 years 2 months ago
2007
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 ...
141
click to vote
ESOP
2006
Springer
15 years 5 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...
130
click to vote
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...
117
click to vote
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....
136
click to vote
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
This article introduces our new approach to program representation for genetic programming (GP). We replace the usual s-expression representation scheme by a strongly-typed ion-ba...