+* [[!wikipedia Haskell Curry]]
+* [[!wikipedia Moses Schönfinkel]]
+* [[!wikipedia Alonzo Church]]<p>
+* [[!wikipedia Combinatory logic]]
+* [Combinatory logic](http://plato.stanford.edu/entries/logic-combinatory/) at the Stanford Encyclopedia of Philosophy
+* [[!wikipedia SKI combinatory calculus]]<p>
+* [[!wikipedia B,C,K,W system]]
+* [[!wikipedia Church-Rosser theorem]]
+* [[!wikipedia Normalization property]]
+* [[!wikipedia Turing completeness]]<p>
+* [[!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 ##
+
+* [Wikipedia overview of Scheme](http://en.wikipedia.org/wiki/Scheme_%28programming_language%29)
+
+* If you are new to programming or if you have the patience to work through a textbook, you should work through a textbook. Some good choices are The Little Schemer book(s) we recommended for the seminar; and also:
+
+ + [How to Design Programs](http://www.htdp.org/2003-09-26/), by Matthias Felleisen, et al., which the Racket groups recommends. Whenever the book says "Scheme," you can read it as "Racket."
+
+ Another warmly-recommended introduction available online is: