X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=schedule_of_topics.mdwn;h=50a9c33bb1c7b883e9809413e16a5646a0f6bd28;hp=2037b356b8584dd9e18439ead279f3ac8959be47;hb=227503eac084d04b374a829310b76ebaec0b2c0e;hpb=503136d0c685c3e9c0f2768aa4a8ba44e48ef1d9

diff --git a/schedule_of_topics.mdwn b/schedule_of_topics.mdwn
index 2037b356..50a9c33b 100644
--- a/schedule_of_topics.mdwn
+++ b/schedule_of_topics.mdwn
@@ -27,7 +27,7 @@ This is very sketchy at this point, but it should give a sense of our intended s
 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
@@ -52,7 +52,7 @@ This is very sketchy at this point, but it should give a sense of our intended s
 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)