Lecture 34: Lazyness in ML and HOAS.

In this lecture we discuss of how we can add laziness to a strict programming language. We do this by defining streams as a function that expects unit as argument and returns the head of a list together with the remaining tail stream.

Another interesting data structure involves higher-order abstract syntax which can be used to program an evaluator for Mini-Haskell, or Mini-ML.

Further Reading:

Previous lecture: Lecture 33
Next lecture: Lecture 35