15-851 Computation and Deduction
Lecture 10: Progress

We prove the progress theorem for our continuation-passing machine. It states that the computation on well-typed machine states can never get stuck: either we have produced a value and are finished, or a computation rule will apply. This shows that an untyped computation model is adequate for Mini-ML.

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

Frank Pfenning