X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=schedule_of_topics.mdwn;h=fad5256ccfdb444f3a386276253136cfd36f998d;hp=bc7ec86758e42484a802156a022342f1d6a062d5;hb=e93866bd6d541c64ca54e5423e35a2e31a1324ae;hpb=5b3399970ddcafc56fbec8032f81a6b5c13dd9bd

diff --git a/schedule_of_topics.mdwn b/schedule_of_topics.mdwn
index bc7ec867..fad5256c 100644
--- 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
 
@@ -62,17 +62,16 @@ This is very sketchy at this point, but it should give a sense of our intended s
 17.	[Phil/ling application] Expletives
 
 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)
-	*	on donkey anaphora and continuations
-	*	[Wadler on symmetric sequent calculi](http://homepages.inf.ed.ac.uk/wadler/papers/dual-reloaded/dual-reloaded.pdf)
+       * [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)
 
 19.	Dependent types
 
 ## Side-effects and mutation ##
 
 1.	What difference imperativity makes
-2.	Monads we've 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