X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=offsite_reading.mdwn;h=3e670b36a29595b10dc871ee35c603b2769d2217;hp=ee863af321d94761014b9d27c3d7d4f6ad7b75ec;hb=d8be476da34a56b5c268b2dbe62f93b0378eefca;hpb=2bfe2dd7229e77118182ed283cede3a358f6ed8a

diff --git a/offsite_reading.mdwn b/offsite_reading.mdwn
index ee863af3..3e670b36 100644
--- a/offsite_reading.mdwn
+++ b/offsite_reading.mdwn
@@ -4,6 +4,17 @@ hope at this point in your education you'll have learned to be a guarded reader
 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)]]
@@ -32,30 +43,26 @@ Wikipedia-specific warnings.
 
 ## 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]]
@@ -70,9 +77,13 @@ Wikipedia-specific warnings.
 *	[[!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)]]
@@ -81,8 +92,10 @@ Wikipedia-specific warnings.
 
 *	[[!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 ##
 
@@ -92,4 +105,3 @@ Wikipedia-specific warnings.
 
 *	[[!wikipedia Linear logic]]
 
-