-* [[!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]]
-* [[!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>
-* [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 Variable (programming) desc="Variables"]]
+* [[!wikipedia Free variables and bound variables]]
+* [[!wikipedia Variable shadowing]]
+* [[!wikipedia Name binding]]
+* [[!wikipedia Name resolution]]
+* [[!wikipedia Parameter (computer science) desc="Function parameters"]]
+* [[!wikipedia Scope (programming) desc="Variable scope"]]
+* [[!wikipedia Closure (computer science) desc="Closures"]]