1. Representing lists as pairs
1. Representing lists as folds
1. Typical higher-order functions: map, filter, fold<p>
-1. Recursion exploiting the fold-like representation of numbers and lists (deforestation, zippers)
+1. Recursion exploiting the fold-like representation of numbers and lists ([[!wikipedia Deforestation (computer science)]], [[!wikipedia Zipper (data structure)]])
1. General recursion using omega
1. The Y combinator(s); more on evaluation strategies<p>
1. Introducing the notion of a "continuation", which technique we'll now already have used a few times