(no commit message)

[lambda.git] / schedule_of_topics.mdwn

diff --git a/schedule_of_topics.mdwn b/schedule_of_topics.mdwn
index 883c648..fad5256 100644 (file)
--- a/schedule_of_topics.mdwn
+++ b/schedule_of_topics.mdwn
@@ -28,7 +28,7 @@ This is very sketchy at this point, but it should give a sense of our intended s
 13.    Representing lists as folds
 14.    Typical higher-order functions: map, filter, fold
 
-15.    Recursion exploiting the fold-like representation of numbers and lists (deforestation, zippers)
+15.    Recursion exploiting the fold-like representation of numbers and lists ([deforestation](http://en.wikipedia.org/wiki/Deforestation_%28computer_science%29), [zippers](http://en.wikipedia.org/wiki/Zipper_%28data_structure%29))
 16.    General recursion using omega
 17.    The Y combinator(s); more on evaluation strategies
 
@@ -71,7 +71,7 @@ This is very sketchy at this point, but it should give a sense of our intended s
 ## Side-effects and mutation ##
 
 1.     What difference imperativity makes
-2.     Monads we've already seen, and the "monadic laws" (computer science version)
+2.     Monads we've already seen, and the "monadic laws" [computer science version: Wadler](http://homepages.inf.ed.ac.uk/wadler/papers/marktoberdorf/baastad.pdf)
 3.     Side-effects in a purely functional setting, via monads
 4.     The basis of monads in category theory
 5.     Other interesting monads: reader monad, continuation monad