X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=offsite_reading.mdwn;h=076f77d21d4f7c26c6bd4705a93f31619e181252;hp=b39906cd93679e46b5b536fe3f26a82886c56e94;hb=a89810d44a32600a3cd6288c5357a7eb5bdf5dd3;hpb=86a7982ef67a424a823da45ad03a839f64ec56a7 diff --git a/offsite_reading.mdwn b/offsite_reading.mdwn index b39906cd..076f77d2 100644 --- a/offsite_reading.mdwn +++ b/offsite_reading.mdwn @@ -67,7 +67,10 @@ get more out of. (Rinse and repeat.) * [Chris Barker's Iota and Jot](http://semarch.linguistics.fas.nyu.edu/barker/Iota/)

-* [To Dissect a Mockingbird](http://dkeenan.com/Lambda/index.htm) +* [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. + ## Evaluation Order ## @@ -97,6 +100,7 @@ get more out of. (Rinse and repeat.) * [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 ## * [[!wikipedia Tagged union]]