15-317 Constructive Logic
Lecture 8: Classical Computation

In this lecture we explore the correspondence between proofs in classical logic and programs. Adding contradiction and proof by contradiction to our logic leads to sophisticated control operators in our programs. We also discuss the relationship between classical logic and intuitionistic logic.

• Reading: 08-classical-programs.pdf
• Key concepts:
  • Proof terms
  • Continuations
  • Double-negation translations
  • Continuation-passing style (CPS)
• Previous lecture: Classical Logic
• Next lecture: Sequent Calculus

[ Home | Schedule | Assignments | Handouts | Software ]

fp@cs
Frank Pfenning