BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Polymorphism\, subtyping and type inference in MLsub - Stephen Dol
 an\, University of Cambridge
DTSTART:20161216T140000Z
DTEND:20161216T150000Z
UID:TALK69531@talks.cam.ac.uk
CONTACT:Dominic Mulligan
DESCRIPTION:We present a type system combining subtyping and ML-style para
 metric\npolymorphism. Unlike previous work\, our system supports type infe
 rence\nand has compact principal types.  We demonstrate this system in the
 \nminimal language MLsub\, which types a strict superset of core ML\nprogr
 ams.\n\nThis is made possible by keeping a strict separation between the t
 ypes\nused to describe inputs and those used to describe outputs\, and\nex
 tending the classical unification algorithm to handle subtyping\nconstrain
 ts between these input and output types. Principal types are\nkept compact
  by type simplification\, which exploits deep connections\nbetween subtypi
 ng and the algebra of regular languages. An\nimplementation is available o
 nline.
LOCATION:FW26
END:VEVENT
END:VCALENDAR