COMP 426 Automated Reasoning
Lecture 6 : Proof (Type) checking

Instead of annotating derivations with proof terms, we can also use the presented inference rules for synthesizing a proposition (type) which corresponds to a given proof term. Hence we discuss how we can derive from the presented rules a proof (type) checker.

We also will discuss the relationship between normal derivations and normal terms. Finally, we will briefly discuss issues with substitution.

• Reading: in preparation
• Code: in preparation
• Previous lecture: Proof terms -- cont.
• Next lecture: Intercalation

[ Home | Schedule | Assignments | Handouts | Software | Overview ]

bp@cs.mcgill.ca
Brigitte Pientka