From: barker Date: Tue, 24 Aug 2010 00:51:30 +0000 (-0400) Subject: (no commit message) X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=commitdiff_plain;h=4f5bfe5bf2009e31c9a52d3cb719bf4bb632ab86 --- diff --git a/schedule_of_topics.mdwn b/schedule_of_topics.mdwn index ca49980b..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