15851 Computation and Deduction
Lecture 10: Progress
We prove the progress theorem for our continuationpassing machine.
It states that the computation on welltyped 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 MiniML.
[ Home
 Schedule
 Assignments
 Handouts
 Software
 Overview
]
fp@cs
Frank Pfenning
