16 search results - page 1 / 4 » The Complexity of Subtype Entailment for Simple Types |
LICS
1997
IEEE
13 years 11 months ago
1997
IEEE
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
ICALP
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...
ASIAN
1999
Springer
13 years 11 months ago
1999
Springer
Entailment of subtype constraints was introduced for constraint simplification in subtype inference systems. Designing an efficient algorithm for subtype entailment turned out to...
CSL
2004
Springer
14 years 6 days ago
2004
Springer
Subtyping rules can be fairly complex for union types, due to interactions with other types, such as function types. Furthermore, these interactions turn out to depend on the calc...
ESOP
2001
Springer
13 years 11 months ago
2001
Springer
Equality constraints (unification constraints) have widespread use in program analysis, most notably in static polymorphic type systems. Conditional equality constraints extend eq...