Sciweavers

5 search results - page 1 / 1
» Entailment of Non-structural Subtype Constraints
Sort
View
ICALP
1998
Springer
13 years 8 months ago
Constraint Automata and the Complexity of Recursive Subtype Entailment
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...
Fritz Henglein, Jakob Rehof
ASIAN
1999
Springer
114views Algorithms» more  ASIAN 1999»
13 years 8 months ago
Entailment of Non-structural Subtype Constraints
Entailment of subtype constraints was introduced for constraint simplification in subtype inference systems. Designing an efficient algorithm for subtype entailment turned out to...
Joachim Niehren, Tim Priesnitz
LICS
1997
IEEE
13 years 8 months ago
The Complexity of Subtype Entailment for Simple Types
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. ...
Fritz Henglein, Jakob Rehof
POPL
2002
ACM
14 years 4 months ago
The first-order theory of subtyping constraints
We investigate the first-order theory of subtyping constraints. We show that the first-order theory of nonstructural subtyping is undecidable, and we show that in the case where a...
Zhendong Su, Alexander Aiken, Joachim Niehren, Tim...
ESOP
2001
Springer
13 years 8 months ago
Entailment with Conditional Equality Constraints
Equality constraints (unification constraints) have widespread use in program analysis, most notably in static polymorphic type systems. Conditional equality constraints extend eq...
Zhendong Su, Alexander Aiken