15-851 Computation and Deduction
Lecture 28: Abstract Types

In this lecture we consider how to model abstract types. It turns out that abstract types are properly defined via the notion of existential type. Theorems such as type preservation and progress continue to hold under such an extension.

Not surprisingly, variants of existential types are also the foundation of the type-theoretic understanding of module systems.

• Reading: slides, notes in preparation
• Code: abstype
• Previous lecture: Recursive Types
• This is the final lecture

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

fp@cs
Frank Pfenning