Learn AI, Data Science & Business — Earn Certificates That Get You Hired
Earn Your Business Degree, Tuition-Free, 100% Online!
Overview
AI, Data Science & Cloud Certificates from Google, IBM & Meta — 40% Off
One plan covers every Professional Certificate on Coursera. 40% off Coursera Plus Annual.
Unlock All Certificates
Watch a 26-minute conference presentation from POPL 2018 exploring the relationship between parametricity and universal types in programming languages. Examine how researchers Dominique Devriese, Marco Patrignani, and Frank Piessens investigate long-standing questions about dynamically enforcing parametricity in System F through secure compilation. Learn about their discovery of a concrete counterexample that demonstrates why both the Sumii-Pierce compiler and polymorphic blame calculus fail to preserve contextual equivalence in System F. Understand the fundamental role that the absence of a universal type in System F plays in these limitations, and gain insights into the implications for gradually typed languages and future research directions in secure compilation of polymorphic languages.
Syllabus
[POPL'18] Parametricity versus the Universal Type
Taught by
ACM SIGPLAN