COMP 426 Automated Reasoning
Lecture 4: Proof terms
We briefly summarize the material covered so far, and review some sampe proofs involving localized hypothesis.
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. Finally we will discuss proof checking which correpsonds to type checking.
[ Home
| Schedule
| Assignments
| Projects
| Handouts
| Software
| Overview
]
bp@cs.mcgill.ca
Brigitte Pientka
|