15-851 Computation and Deduction
Lecture 9: A Continuation-Passing Machine

Natural semantics is often characterized as a big-step semantics, because it directly relates an expression to its final value. In a small-step semantics, computation proceeds in small steps, essentially rewriting an expression to its value.

In this lecture we give a small-step semantics using a so-called continuation-passing machine. We then prove the correctness of this machine with respect to the natural semantics and show the implementation of these in Twelf.

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

Frank Pfenning