even of authoritative treatises by eminent authors. So you shouldn't need any
Wikipedia-specific warnings.
+For most readers, many bits of reading we point you to will be hairy in one way
+or another. It may be aimed at audiences with more programming experience; it
+may be aimed at audiences with specific logical background you don't yet have;
+it may be aimed at audiences familiar with technical areas in linguistics you're
+first encountering. Or perhaps several of these at once. We hope you will
+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.)
+
+
## General issues about variables and binding in programming languages ##
* [[!wikipedia Variable (programming)]]
## Scheme and OCaml ##
+* [An Introduction to Lambda Calculus and Scheme](http://www.jetcafe.org/~jim/lambda.html) -- aimed at programmers
* [[!wikipedia Scheme (programming language)]]
* [[!wikipedia Objective Caml]]
## Untyped lambda calculus and combinatory logic ##
-* [[!wikipedia Lambda calculus]]
-
+* [[!wikipedia Lambda calculus]]<p>
* [[!wikipedia Haskell Curry]]
* [[!wikipedia Moses Schönfinkel]]
-* [[!wikipedia Alonzo Church]]
-
+* [[!wikipedia Alonzo Church]]<p>
* [[!wikipedia Combinatory logic]]
+* [Combinatory logic](http://plato.stanford.edu/entries/logic-combinatory/) at the Stanford Encyclopedia of Philosophy
* [[!wikipedia B,C,K,W system]]
-* [[!wikipedia SKI combinatory calculus]]
-
+* [[!wikipedia SKI combinatory calculus]]<p>
* [[!wikipedia Church-Rosser theorem]]
* [[!wikipedia Normalization property]]
-* [[!wikipedia Turing completeness]]
-
+* [[!wikipedia Turing completeness]]<p>
* [[!wikipedia Church encoding]]
-* [[!wikipedia Y combinator]]
-
-* [[!wikipedia Curry-Howard isomorphism]]
-
+* [[!wikipedia Y combinator]]<p>
+* [[!wikipedia Curry-Howard isomorphism]]<p>
* [[!wikipedia Evaluation strategy]]
* [[!wikipedia Eager evaluation]]
* [[!wikipedia Lazy evaluation]]
* [[!wikipedia Bottom type]]
* [[!wikipedia Typed lambda calculus]]
* [[!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
* [[!wikipedia Type polymorphism]]
* [[!wikipedia System F]]
+## Side-effects / mutation ##
+
* [[!wikipedia Side effect (computer science)]]
* [[!wikipedia Reference (computer science)]]
* [[!wikipedia Pointer (computing)]]
* [[!wikipedia Continuation]]
* [[!wikipedia Continuation-passing style]]
-* [[!wikipedia Call-with-current-continuation]]
+* [[!wikipedia Call-with-current-continuation]]
+* [Intro to call/cc](http://community.schemewiki.org/?call-with-current-continuation) at SchemeWiki
* [[!wikipedia Delimited continuation]]
+* [Delimited/composable continuations tutorial](composable-continuations-tutorial) at SchemeWiki
## Monads ##
* [[!wikipedia Linear logic]]
-