Warning: I used the board quite often, with many (most?) things not in the slides, unfortunately.
See also the dependency graphs as explained in the Haskell comments, for uniform modulus of continuity 3, 4, 5, 6, 7, 8.
There is also alternative Haskell code, with less discussion, but more experiments.
And a C++ implementation of some of this by one of the course students, Ivan Pouzyrevsky, which includes call-by-need.
There is also a zip file with the the Agda files.
(What is Agda? I recommend this to get started.)