15-317 Constructive Logic
Lecture 8: Proof Irrelevance

In this lecture we discuss how we can consistently eliminated unwanted computation from proofs. This is achieved through proof irrelevance, which is a new judgment that also give rise to a new logical operator. We determine which logical laws this operator must satisfy so that when we erase irrelevant parts from a proof, the resulting contracted program can still be executed.

• Reading: 08-irrelevance.pdf
• Previous lecture: Computational Meaning of Quantifiers
• Next lecture: Classical Logic
• Key concepts:
  • Irrelevance as a judgment
  • Promotion
  • Contracting proofs to programs

[ Home | Schedule | Assignments | Handouts | Software ]

fp@cs
Frank Pfenning