596 search results - page 57 / 120 » Subtyping Recursive Types |
101
click to vote
GI
2009
Springer
15 years 6 months ago
2009
Springer
: This paper describes a syntactical method for contextual equivalence in polymorphically typed lambda-calculi. Our specific calculus has letrec as cyclic let, data constructors, ...
TAPSOFT
1991
Springer
15 years 4 months ago
1991
Springer
Type inference can be phrased as constraint-solving over types. We consider an implicitly typed language equipped with recursive types, multiple inheritance, 1st order parametric ...
CAV
2008
Springer
15 years 3 months ago
2008
Springer
We propose a type system for lock-freedom in the -calculus, which guarantees that certain communications will eventually succeed. Distinguishing features of our type system are: it...
109
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Sized types are a modular and theoretically well-understood tool for checking termination of recursive and productivity of corecursive definitions. The essential idea is to track ...
111
click to vote
LICS
2008
IEEE
15 years 7 months ago
2008
IEEE
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...