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 equality constraints with a weak form of subtyping to allow for more accurate analyses. We give a complete complexity characterization of the various entailment problems for conditional equality constraints. Additionally, for comparison, we study a natural extension of conditional equality constraints.

• Type: Conference
• Year: 2001
• Where: ESOP
• Authors: Zhendong Su, Alexander Aiken
• Keywords: Conditional Equality Constraints, Constraints Extend Equality, Equality Constraints, ESOP 2001, Programming Languages