evaluator tweaks

[lambda.git] / offsite_reading.mdwn

diff --git a/offsite_reading.mdwn b/offsite_reading.mdwn
index b82bd4b..66e481c 100644 (file)
--- a/offsite_reading.mdwn
+++ b/offsite_reading.mdwn
@@ -46,18 +46,12 @@ get more out of. (Rinse and repeat.)
 ## Untyped lambda calculus and combinatory logic ##
 
 *      [[!wikipedia Lambda calculus]]
-*      Our [[Lambda evaluator]]
-*      [Chris Barker's Lambda Tutorial](http://homepages.nyu.edu/~cb125/Lambda)
-*      [Lambda Animator](http://thyer.name/lambda-animator/)
-*      [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>
 *      [[!wikipedia Church encoding]]
 
-
 *      [[!wikipedia Combinatory logic]]
 *      [Combinatory logic](http://plato.stanford.edu/entries/logic-combinatory/) at the Stanford Encyclopedia of Philosophy
 *      [[!wikipedia SKI combinatory calculus]]
@@ -68,8 +62,7 @@ get more out of. (Rinse and repeat.)
 
 *      [To Dissect a Mockingbird](http://dkeenan.com/Lambda/index.htm)
 *      [Combinator Birds](http://www.angelfire.com/tx4/cus/combinator/birds.html)
-*       [Les deux combinateurs et la totalite](http://www.paulbraffort.net/j_et_i/j_et_i.html) by Paul Braffort.
-
+*   [Les deux combinateurs et la totalite](http://www.paulbraffort.net/j_et_i/j_et_i.html) by Paul Braffort.
 
 ## Evaluation Order ##
 
@@ -97,7 +90,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 ##
@@ -112,12 +105,10 @@ get more out of. (Rinse and repeat.)
 *      [[!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
-*      The [[!wikipedia Curry-Howard isomorphism]]
-*      [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]]
 
+
 ##[[Learning OCaml]]##
 
 
@@ -184,6 +175,12 @@ invited talk, *19'th Symposium on Principles of Programming Languages*, ACM Pres
 *      [A Partial Ordering of some Category Theory applied to Haskell](http://blog.sigfpe.com/2010/03/partial-ordering-of-some-category.html)
 
 
+## The Curry-Howard Correspondence ##
+*      The [[!wikipedia Curry-Howard isomorphism]]
+*      [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>
+
+
 ## Continuations ##
 
 *      [[!wikipedia Continuation]]