[PL-sem-jr] PL Seminar, 3/30: Type inference beyond Hindley-Milner

Justin R. Slepak jrslepak at ccs.neu.edu
Sun Mar 29 21:04:26 EDT 2015


The design of Hindley-Milner typing requires all quantifiers in a type to be at the outermost level, which restricts the types we can express and use. Type reconstruction for a fully implicitly-typed System F is uncomputable, but including some programmer-provided annotation makes type inference possible again. We will examine global and local inference algorithms which paved the way for more recent work in type inference.

We will meet from 12:30 to 2:00 in WVH 166.

---
Justin Slepak
PhD student, Computer Science dept.



More information about the Pl-sem-jr mailing list