## Untyped lambda calculus and combinatory logic ##
* [[!wikipedia Lambda calculus]]
-* [Chris Barker's Lambda Tutorial](http://homepages.nyu.edu/~cb125/Lambda)<p>
-
+* [Chris Barker's Lambda Tutorial](http://homepages.nyu.edu/~cb125/Lambda)
+* [Lambda Animator](http://thyer.name/lambda-animator/)<p>
* [[!wikipedia Haskell Curry]]
* [[!wikipedia Moses Schönfinkel]]
* [[!wikipedia Alonzo Church]]<p>
* [[!wikipedia Church-Rosser theorem]]
* [[!wikipedia Normalization property]]
* [[!wikipedia Turing completeness]]<p>
+* [Scooping the Loop Snooper](http://www.cl.cam.ac.uk/teaching/0910/CompTheory/scooping.pdf), a proof of the undecidability of the halting problem in the style of Dr Seuss by Geoffrey K. Pullum
* [[!wikipedia Church encoding]]
-* [[!wikipedia Y combinator]]<p>
-* [[!wikipedia Curry-Howard isomorphism]]<p>
-* [[!wikipedia Evaluation strategy]]
-* [[!wikipedia Eager evaluation]]
-* [[!wikipedia Lazy evaluation]]
-* [[!wikipedia Strict programming language]]
## Learning Scheme ##
short, for increasing n. The most widely implemented standard is [The
Revised^5 Report on Scheme](http://docs.racket-lang.org/r5rs/index.html),
or R5RS, published in 1998.
-\[[Alt link](http://www.schemers.org/Documents/Standards/R5RS/HTML/)\]
+\[ [Alt link](http://www.schemers.org/Documents/Standards/R5RS/HTML/) \]
A new standard [R6RS](http://docs.racket-lang.org/r6rs/index.html) was ratified
in 2007, but this has many detractors and has not been fully accepted in the
community.
-\[[Alt link](http://www.r6rs.org/final/html/r6rs/r6rs.html);
-[Libraries](http://www.r6rs.org/final/html/r6rs-lib/r6rs-lib.html)\]
+\[ [Alt link](http://www.r6rs.org/final/html/r6rs/r6rs.html);
+[Libraries](http://www.r6rs.org/final/html/r6rs-lib/r6rs-lib.html) \]
* [Scheme FAQ](http://community.schemewiki.org/?scheme-faq)
* The [Schematics Scheme Cookbook](http://schemecookbook.org/) is a collaborative effort to produce documentation and recipes for using Scheme for common tasks.
+
+## Recursion and the Y Combinator ##
+
+* [[!wikipedia Y combinator]]
+* [Chapter 9 from The Little Schemer](http://www.ccs.neu.edu/home/matthias/BTLS/sample.ps) on the Y Combinator "...and Again, and Again, and Again..."
+* [The Y combinator](http://mvanier.livejournal.com/2700.html)
+* [The Y Combinator (Slight Return), or: How to Succeed at Recursion Without Really Recursing](http://mvanier.livejournal.com/2897.html)
+* [Y Combinator for Dysfunctional Non-Schemers](http://rayfd.wordpress.com/2007/05/06/y-combinator-for-dysfunctional-non-schemers/)
+* [The Y Combinator](http://www.ece.uc.edu/~franco/C511/html/Scheme/ycomb.html)
+* [The Y Combinator](http://dangermouse.brynmawr.edu/cs245/ycomb_jim.html), described as:
+ > This is the derivation of the applicative-order Y-combinator from scratch, in Scheme. The following derivation is similar in flavor to the derivation found in The Little LISPer by Friedman/Felleisen, but uses a slightly different starting approach...
+
+## Evaluation Order ##
+
+* [[!wikipedia Evaluation strategy]]
+* [[!wikipedia Eager evaluation]]
+* [[!wikipedia Lazy evaluation]]
+* [[!wikipedia Strict programming language]]
## Types ##
* [[!wikipedia Simply typed lambda calculus]]
* [Type Theory](http://plato.stanford.edu/entries/type-theory/) at the Stanford Encyclopedia of Philosophy
* [Church's Type Theory](http://plato.stanford.edu/entries/type-theory-church/) at the Stanford Encyclopedia of Philosophy
+* The [[!wikipedia Curry-Howard isomorphism]]<p>
* [[!wikipedia Type polymorphism]]
* [[!wikipedia System F]]