From: Jim Pryor Date: Tue, 24 Aug 2010 02:44:10 +0000 (-0400) Subject: Merge branch 'pryor' X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=commitdiff_plain;h=91d4ed7e42351e78d5d5f7e73da136bb99d4b59d;hp=f30e2819d09f18a3ee21f3f84cf28db2c6a80b51 Merge branch 'pryor' --- diff --git a/index.mdwn b/index.mdwn index 73d2020b..4f1281e5 100644 --- a/index.mdwn +++ b/index.mdwn @@ -168,6 +168,10 @@ This covers some of the same introductory ground as The Little Schemer, but this time in ML. The dialect of ML used is SML, not OCaml, but there are only superficial syntactic differences between these languages. +# Other resources # + +* [Barker's Lambda Tutorial](http://homepages.nyu.edu/~cb125/Lambda): tutorial with embedded Javascript code that enables a user to type a lambda form into a web browser page and click to execute (reduce) it. +* [Penn Lambda Calculator](http://www.ling.upenn.edu/lambda/): requires installing Java, but provides a number of tools for evaluating lambda expressions and other linguistic forms. ##[[Schedule of Topics]]## diff --git a/schedule_of_topics.mdwn b/schedule_of_topics.mdwn index 3d704bae..52455c5e 100644 --- a/schedule_of_topics.mdwn +++ b/schedule_of_topics.mdwn @@ -29,7 +29,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