We introduce subtyping as another extension to the Mini-ML type system. Subtyping allows us to capture more information about the program, but leads to a more complex type inference problem. In this lecture we limit ourselves to so-called atomic subtyping. We show how to extend the proof of type preservation and the language of constraints required to express type inference.
[ Home | Schedule | Assignments | Handouts | Software | Overview ]