2019-02-22: Fredrik Nordvall Forsberg (MSP)

Sat, 21 Oct 2023 21:24:08 +0100

Fredrik Nordvall Forsberg (MSP)

MSP 101: Proof-irrelevance for Dependent Type Theory

Abstract

Proof-irrelevance can mean two similar but different things: on the one hand, irrelevant proofs can be discarded when extracting programs to execute (run-time erasability), and on the other hand, one might want to treat proofs as irrelevant during type checking (type-checking time erasability). I will give an overview of the subject, focusing on type-checking time erasability. I suspect that at least three people in the audience knows more than me, so my main function will be to keep things accessible. I plan to follow the recent paper "Degrees of Relatedness: A Unified Framework for Parametricity, Irrelevance, Ad Hoc Polymorphism, Intersections, Unions and Algebra in Dependent Type Theory" by Andreas Nuyts and Dominique Devriese (LICS 2018).

2019-02-22 16:00:00 UTC
LT1310