already have mastered the skill of leveraged reading: getting what you can out
of an article you don't fully understand, so that you can discuss it with the rest of
the group and hopefully get to a point where you can read it again and
-get more out of out. (Rinse and repeat.)
+get more out of. (Rinse and repeat.)
## General issues about variables and binding in programming languages ##
* [[!wikipedia Lambda calculus]]
* [Chris Barker's Lambda Tutorial](http://homepages.nyu.edu/~cb125/Lambda)
* [Lambda Animator](http://thyer.name/lambda-animator/)<p>
-* [[!wikipedia Haskell Curry]]
+<!-- Haskell Curry had ideas that he felt were validated upon reading a 1924 paper by M. Schönfinkel "Uber die Bausteine der mathematischen Logik" which used combinators in a similar way to his own ideas. Haskell then wrote "An analysis of logical substitution" which appeared in the American Journal of Mathematics in 1929. -->
* [[!wikipedia Moses Schönfinkel]]
+* [[!wikipedia Haskell Curry]]
* [[!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]]
* [[!wikipedia B,C,K,W system]]
+ <!-- Jeroen Fokker, The Systematic Construction of a One-combinator Basis for Lambda-Terms. Formal Aspects of Computing 4 (1992), pp. 776-780
+ http://people.cs.uu.nl/jeroen/article/combinat/combinat.ps -->
* [Chris Barker's Iota and Jot]() (broken link)<p>
* [[!wikipedia Church-Rosser theorem]]
* [[!wikipedia Normalization property]]