From: Jim Pryor Date: Tue, 24 Aug 2010 03:51:01 +0000 (-0400) Subject: schedule: reformat lists, use auto-numbering in some of them (fixed) X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=commitdiff_plain;h=04ad199a11e07f2f7669145dd3702ae248431e8c schedule: reformat lists, use auto-numbering in some of them (fixed) Signed-off-by: Jim Pryor --- diff --git a/schedule_of_topics.mdwn b/schedule_of_topics.mdwn index 2037b356..eb7cf80a 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

-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

1. Introducing the notion of a "continuation", which technique we'll now already have used a few times