X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=offsite_reading.mdwn;h=3720e2fc2d3e341b263422f8b9b63115aa445e4b;hp=a1e26cad3067a909eddb97f02fb12305f80a299b;hb=24922633d6b3070235172b47560e97c4f081d87a;hpb=764cf922472ec8e00bc4f31c47ad0fdb1ea5fe6a

diff --git a/offsite_reading.mdwn b/offsite_reading.mdwn
index a1e26cad..3720e2fc 100644
--- a/offsite_reading.mdwn
+++ b/offsite_reading.mdwn
@@ -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]]
-*	[[!wikipedia B,C,K,W system]]<p>
+*	[[!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>