15-317 Constructive Logic
Lecture 4: Proofs as Programs

In this lecture we explore the correspondence between proofs and programs, which mirrors a related correspondence between propositions and types.

• Reading: 04-pap.pdf
• Key concepts:
  • Proof terms
  • Propositions as types
  • Local reductions as rules of computation
• Previous lecture: Harmony
• Next lecture: Quantification

[ Home | Schedule | Assignments | Handouts | Software ]

fp@cs
Frank Pfenning