COMP 426 Automated Reasoning
Lecture 12: Bi-directional proof checking

In the first part of the lecture, we add proof terms to the annotated natural deduction calculus. This will give us a bi-directional proof checker, which allows us to omit and reconstruct some of the information in proof terms, and hence leads to a more compact representation of proof terms. In the sequent part of the lecture, we assign proof terms to the the sequent calculus. We will also show an implementation of a bi-directional proof checker in class

• Reading: in preparation
• Code: in preparation
• Previous lecture: Lecture 11
• Next lecture: Lecture 13

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

bp@cs.mcgill.ca
Brigitte Pientka