X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=offsite_reading.mdwn;fp=offsite_reading.mdwn;h=b82bd4bfb7a96351b35d279a16f10d3f43e66e81;hp=076f77d21d4f7c26c6bd4705a93f31619e181252;hb=fa5f84861179e2ffcc16dfadffbd4b1c4f01c5df;hpb=4a92c77df6312ecdf0c43a5d001630db32fdf756

diff --git a/offsite_reading.mdwn b/offsite_reading.mdwn
index 076f77d2..b82bd4bf 100644
--- a/offsite_reading.mdwn
+++ b/offsite_reading.mdwn
@@ -52,7 +52,6 @@ get more out of. (Rinse and repeat.)
 *	[Penn lambda calculator](http://www.ling.upenn.edu/lambda/) Pedagogical software developed by Lucas Champollion, Josh Tauberer and Maribel Romero.<p>
 
 <!-- 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>
@@ -98,7 +97,7 @@ get more out of. (Rinse and repeat.)
 *	[Y Combinator for Dysfunctional Non-Schemers](http://rayfd.wordpress.com/2007/05/06/y-combinator-for-dysfunctional-non-schemers/)
 *	[The Y Combinator](http://www.ece.uc.edu/~franco/C511/html/Scheme/ycomb.html)
 *	[The Y Combinator](http://dangermouse.brynmawr.edu/cs245/ycomb_jim.html) derives the applicative-order Y-combinator from scratch, in Scheme. This derivation is similar in flavor to the derivation found in The Little Schemer, but uses a slightly different starting approach...
-*       [The church of the least fixed point, by Sans Pareil](http://www.springerlink.com/content/n4t2v573m58g2755/)
+
 
 
 ## Types ##