This lecture introduces lazy evaluation, the mechanism used to evaluate expressions in Haskell. We start by reviewing the notion of evaluation, then consider evaluation strategies and their properties, discuss infinite lists and modular programming, and conclude with an extended example concerning prime numbers.
Course playlist: http://tinyurl.com/haskell-notts
