15851 Computation and Deduction
Lecture 9: A ContinuationPassing Machine
Natural semantics is often characterized as a bigstep semantics,
because it directly relates an expression to its final value. In
a smallstep semantics, computation proceeds in small steps, essentially
rewriting an expression to its value.
In this lecture we give a smallstep semantics using a socalled
continuationpassing 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
]
fp@cs
Frank Pfenning
