8 search results - page 1 / 2 » Strictness Logic and Polymorphic Invariance |
111
Voted
LFCS
1992
Springer
15 years 5 months ago
1992
Springer
We describe a logic for reasoning about higher-order strictness properties of typed lambda terms. The logic arises from axiomatising the inclusion order on certain closed subsets ...
97
Voted
ENTCS
2007
15 years 1 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 ...
212
Voted
POPL
2004
ACM
16 years 1 months ago
2004
ACM
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
96
Voted
FPCA
1989
15 years 5 months ago
1989
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
131
Voted
ESOP
2006
Springer
15 years 4 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...