13. Representing lists as folds
14. Typical higher-order functions: map, filter, fold
-15. Recursion exploiting the fold-like representation of numbers and lists
+15. Recursion exploiting the fold-like representation of numbers and lists (deforestation, zippers)
16. General recursion using omega
17. The Y combinator(s); more on evaluation strategies
4. The basis of monads in category theory
5. Other interesting monads: reader monad, continuation monad
-6. [Phil/ling application] Monsters and context-shifting, e.g. Gillies/von Fintel on "ifs"
+6. [Phil/ling application] Monsters and context-shifting, e.g. Gillies/von Fintel on "ifs" [not sure which paper]
7. Montague / Ben-avi and Winter, [A modular approach to intensionality](http://citeseerx.ist.psu.edu/viewdocsummary?doi=10.1.1.73.6927)
8. Passing by reference
-9. [Phil/ling application] Fine and Pryor on "coordinated contents"
-
+9. [Phil/ling application] Fine and Pryor on "coordinated contents" (see, e.g., [Hyper-Evaluativity](http://www.jimpryor.net/research/papers/Hyper-Evaluativity.txt)
## Continuations (continued) ##
-1. Using CPS to handle abortive computations (think: presupposition failure)
+1. Using CPS to handle abortive computations (think: presupposition failure, expressives)
2. Using CPS to do other handy things, e.g., coroutines
3. Making evaluation order explicit with continuations (could also be done earlier, but I think will be helpful to do after we've encountered mutation)
4. Delimited (quantifier scope) vs undelimited (expressives, presupposition) continuations