Lecture 14: Lazy Datastructures and Coinduction

Lazyness can be used to improve the efficieny of algorithms. We will see how Fibonacci numbers can be computed using lazy lists. The implementation is as elegant as it is fast. Why does it work so well? Because lazy lists can be used to memoize.

Source Code:

Suggested Reading Materials:

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

Previous lecture: Lecture 13
Next lecture: Lecture 15