Starting from an exact correspondence between affine approximations and non-idempotent intersection types, we develop a general framework for building intersection types systems characterizing normalization properties. We show how this construction, which uses in a fundamental way Melliès and Zeilberger’s ``type systems as functors'' viewpoint, allows us to recover equivalent versions of every well known intersection type system (including Coppo and Dezani’s original system, as well as its non-idempotent variants independently introduced by Gardner and de Carvalho). We also show how new systems of intersection types may be built almost automatically in this way.
Wed 10 Jan Times are displayed in time zone: (GMT-07:00) Tijuana, Baja California change
|10:30 - 10:55|
Jean-Philippe BernardyUniversity of Gothenburg, Mathieu BoespflugTweag I/O, Ryan R. NewtonIndiana University, Simon Peyton JonesMicrosoft Research, Arnaud SpiwackTweag I/OPre-print File Attached
|10:55 - 11:20|
|11:20 - 11:45|
Danel AhmanInria Paris
|11:45 - 12:10|