Computation & Deduction
Spring 1997
Frank Pfenning

Lecture 11: A Continuation Machine

We complete the discussion of environments by adding recursion to the previously considered language. We then present a computational model based on transitions of an abstract machine. The machine works at a high level, using continuations to keep track of remaining computations. We also prove the correctness of the continuation machine compared to the natural semantics presented earlier.
  • next lecture
  • previous lecture

  • [ C&D Home | Schedule | Code | Assignments | Notes | Projects | Elf ]

    © Frank Pfenning 1992-1997