X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=offsite_reading.mdwn;h=945670eded075a63d1564206b9d2ffbc4c0aca95;hp=d812fff70f9d1245a5d01590ce26375a1b820d30;hb=4bb066353658fb0f3d07920622b666ee0280b821;hpb=1e4e668fcd36b96953619d3e1edbdc4fe10e6d91

diff --git a/offsite_reading.mdwn b/offsite_reading.mdwn
index d812fff7..945670ed 100644
--- a/offsite_reading.mdwn
+++ b/offsite_reading.mdwn
@@ -12,7 +12,7 @@ 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.)
+get more out of. (Rinse and repeat.)
 
 
 ## General issues about variables and binding in programming languages ##
@@ -45,13 +45,17 @@ get more out of out. (Rinse and repeat.)
 *	[[!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]]<p>
+*	[[!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]]
 *	[[!wikipedia Turing completeness]]<p>
@@ -117,6 +121,7 @@ community. ([Libraries for R6RS](http://www.r6rs.org/final/html/r6rs-lib/r6rs-li
 
 *	[[!wikipedia Tagged union]]
 *	[[!wikipedia Algebraic data type]]
+*	[[!wikipedia Recursive data type]]
 *	[[!wikipedia Pattern matching]]
 *	[[!wikipedia Unit type]]
 *	[[!wikipedia Bottom type]]
@@ -125,7 +130,8 @@ community. ([Libraries for R6RS](http://www.r6rs.org/final/html/r6rs-lib/r6rs-li
 *	[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
 *	The [[!wikipedia Curry-Howard isomorphism]]
-*	[The Curry-Howard correspondence in Haskell](http://www.thenewsh.com/~newsham/formal/curryhoward/)<p>
+*	[The Curry-Howard correspondence in Haskell](http://www.thenewsh.com/~newsham/formal/curryhoward/)
+*	[The Curry-Howard Isomorphism](http://en.wikibooks.org/wiki/Haskell/The_Curry-Howard_isomorphism) at Haskell wiki<p>
 *	[[!wikipedia Type polymorphism]]
 *	[[!wikipedia System F]]
 
@@ -139,6 +145,8 @@ community. ([Libraries for R6RS](http://www.r6rs.org/final/html/r6rs-lib/r6rs-li
 
 *	Here's a [more detailed tutorial](http://www.ocaml-tutorial.org/) for OCaml.
 
+*	The start of the [OCaml Reference Manual](http://caml.inria.fr/pub/docs/manual-ocaml/manual003.html) has another tutorial.
+
 *	Jason Hickey has posted a [draft of a nice book introducing OCaml](http://www.cs.caltech.edu/courses/cs134/cs134b/book.pdf).
 
 *	FAQs for [OCaml Beginners](http://pauillac.inria.fr/caml/FAQ/FAQ_DEBUTANT-eng.html), and [a few more](http://caml.inria.fr/resources/doc/faq/). Also FAQs for [OCaml Experts](http://pauillac.inria.fr/caml/FAQ/FAQ_EXPERT-eng.html).