Continuing the series on Scheme, this video explains the lambda function, which allows you to define anonymous functions. It goes on to bend your mind with 2 examples of the enormous power of functions and closures in Scheme.
Continuing the series on Scheme, this video describes an important feature of functions in Scheme: closures. Closures allow functions to carry their “environment” around with them, and even change it later. This allows all kinds of exciting things, including implementing something similar to classes in other languages.
Continuing the series on Scheme, this video describes some of the things you will need to understand to be able to write real programs. I introduce pairs, lists, and navigation through lists using recursive procedures, before discussing the map and foldr procedures, which you will use in most programs.
Update: all six episodes: