15-399 Constructive Logic
Lecture 5: Proofs as Programs
We introduce an interpretation of constructive proofs as programs in
a small functional language. Under this interpretation, propositions
correspond to types. On the propositional logic considered so far,
this correspondence is an isomorphism: every proof corresponds to a
program, and every program corresponds to a proof.
We also discuss the notion of reduction, which is the basis of
an operational semantics for the small programming language.