15-851 Computation and Deduction
Lecture 11: Implementing Progress
We show in detail how the continuation-passing machine and the proof
of its correctness can be implemented in the Twelf system. We recall
techniques for implementating and checking proofs, including
substitution lemmas, mode checking, termination checking, and coverage
checking (which is currently not available in the implementation).
[ Home
| Schedule
| Assignments
| Handouts
| Software
| Overview
]
fp@cs
Frank Pfenning
|