15-851 Computation and Deduction
Lecture 20: Subtyping Constraints

In this lecture we combine the idea of constraint-based type inference with atomic subtyping. The language of constraints is not based on subtyping rather than equality between types, and algorithms for deciding satisfiability more complex.

Since our language extended pure atomic subtyping via several case rules, our constraint language must also be able to handle disjunction, which further complicates algorithms for type inference.

This lecture give by Brigitte Pientka

[ Home | Schedule | Assignments | Handouts | Software | Overview ]

Frank Pfenning