1194 search results - page 211 / 239 » A Calculus for Predicative Programming |
ESOP
2009
Springer
14 years 2 months ago
2009
Springer
Ownership types characterize the topology of objects in the heap, through a characterization of the context to which an object belongs. They have been used to support reasoning, me...
ESOP
2006
Springer
14 years 2 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...
POPL
1991
ACM
14 years 2 months ago
1991
ACM
We investigate the interactions of subtyping and recursive types, in a simply typed λ-calculus. The two fundamental questions here are whether two (recursive) types are in the su...
TACS
1991
Springer
14 years 2 months ago
1991
Springer
System F is a well-known typed λ-calculus with polymorphic types, which provides a basis for polymorphic programming languages. We study an extension of F, called F<: (pronoun...
ECOOP
2008
Springer
14 years 22 days ago
2008
Springer
Nominal and structural subtyping each have their own strengths and weaknesses. Nominal subtyping allows programmers to explicitly express design intent, and, when types are associa...