Lead AI-Native Products with Microsoft's Agentic AI Program
Learn Backend Development Part-Time, Online
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore a 24-minute conference talk presented at POPL 2018 that delves into the relationship between linear approximations and non-idempotent intersection types. Learn how researchers Damiano Mazza, Luc Pellissier, and Pierre Vial from French institutions develop a comprehensive framework for constructing intersection type systems that characterize normalization properties. Discover how their approach, grounded in Melliès and Zeilberger's concept of "type systems as functors," successfully recreates well-known intersection type systems while enabling the near-automatic creation of new ones. Gain insights into the connections between linear logic, intersection types, type systems, and multicategories through this academic presentation that bridges theoretical computer science concepts.
Syllabus
[POPL'18] Polyadic Approximations, Fibrations and Intersection Types
Taught by
ACM SIGPLAN