Space-Efficient Polymorphic Gradual Typing, Mostly Parametric - PLDI 2024

Offered By: ACM SIGPLAN via YouTube

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!

Explore a groundbreaking 18-minute conference talk from PLDI 2024 that delves into the space-efficiency problem of gradual typing with parametric polymorphism. Learn how researchers from Kyoto University, National Institute of Informatics, and Tokyo Institute of Technology propose a solution by slightly relaxing parametricity. Discover the development of λCmp, a coercion calculus with mostly parametric polymorphism, and its space-efficient counterpart λSmp. Gain insights into the proof of space-efficient execution for λSmp programs and the type- and semantics-preserving translation from λCmp to λSmp. Understand the implications of this research for efficient implementations of gradual typing in programming languages.

Syllabus

[PLDI24] Space-Efficient Polymorphic Gradual Typing, Mostly Parametric

Taught by

ACM SIGPLAN

Related Courses

Radical and Type Theories in Organic Chemistry (1832-1850) - Lecture 22
Yale University via YouTube Introduction to programming with dependent types in Scala
Stepik Uncovering the Unknown - Principles of Type Inference in Programming Languages
ChariotSolutions via YouTube Univalence from a Computer Science Point-of-View - Dan Licata
Institute for Advanced Study via YouTube Univalent Foundations and the Equivalence Principle - Benedikt Ahrens
Institute for Advanced Study via YouTube