Also didn't finish. This is a very academic explanation of programming using all LISP examples. I got one good piece of info from it, given the single-assignment property of functional languages, recursion becomes useful because the paramter to the function becomes the index, which can change (increment) on each call.