Lecture 14: Continuations.

In this lecture we will discuss the concept of continuations. Continuations are accumulator arguments of functional type that are useful to capture the notion of a computation that has to happen after the main computation has terminated.

We are demonstrating continuations with the standard example of appending two lists. By using them, when can make append tail recursive.

Source Code:

acc.hs Appending lists using continuations.

Suggested Reading Materials:

Frank Pfenning (edited by John Lafferty). Some notes on continuations

Previous lecture: Lecture 13
Next lecture: Lecture 15