Graded Modal Dependent Type Theory with Universe and Erasure - Formalized
Offered By: ACM SIGPLAN via YouTube
Course Description
Overview
Explore a 30-minute conference talk from ICFP 2023 that presents a graded modal type theory with a universe and erasure, fully formalized in Agda. Delve into the theory's features, including Π-types, weak and strong Σ-types, natural numbers, an empty type, and a universe, as well as extensions with a unit type and graded Σ-types. Examine how the theory is parameterized by a modality, allowing for different grade systems to track variable usage in terms and types. Focus on the erasure modality for marking function arguments as erasable. Learn about the formalization's meta-theoretic properties, including subject reduction, consistency, normalization, and decidability of definitional equality. Investigate the extraction function that translates terms to an untyped λ-calculus and removes erasable content. Understand the conditions under which extraction is proven sound for a certain class of modalities. Access supplementary materials, including the article and archive, to further explore this advanced topic in dependent type theory and formal verification.
Syllabus
[ICFP'23] A Graded Modal Dependent Type Theory with a Universe and Erasure, Formalized
Taught by
ACM SIGPLAN
Related Courses
Radical and Type Theories in Organic Chemistry (1832-1850) - Lecture 22Yale 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