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
15. The types of continuations; continuations as first-class values
16. [Phil/ling application] Partee on whether NPs should be uniformly interpreted as generalized quantifiers, or instead "lifted" when necessary. Lifting = a CPS transform.
17. [Phil/ling application] Expletives<p>
-18. Some references:
+18. Some references:
* [de Groote on the lambda-mu calculus in linguistics](http://www.loria.fr/%7Edegroote/papers/amsterdam01.pdf)
* [on donkey anaphora and continuations](http://dx.doi.org/10.3765/sp.1.1)
* [Wadler on symmetric sequent calculi](http://homepages.inf.ed.ac.uk/wadler/papers/dual-reloaded/dual-reloaded.pdf)