X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=offsite_reading.mdwn;h=de5dad45131c38baaeb7fa41b82498e80f236e1c;hp=8c9db0f551988e89f1cea222f19a2aeaaf3700f7;hb=e0cb39835147afbdd9e78f40355e0b4eff081414;hpb=6664b66b09fe67f93d8ee2bb49e3a2b8f0087e9b diff --git a/offsite_reading.mdwn b/offsite_reading.mdwn index 8c9db0f5..de5dad45 100644 --- a/offsite_reading.mdwn +++ b/offsite_reading.mdwn @@ -67,7 +67,8 @@ 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/ +* [To Dissect a Mockingbird](http://dkeenan.com/Lambda/index.htm) +* [Combinator Birds](http://www.angelfire.com/tx4/cus/combinator/birds.html) ## Evaluation Order ## @@ -96,6 +97,7 @@ get more out of. (Rinse and repeat.) * [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/) +* [Les deux combinateurs et la totalite](http://www.paulbraffort.net/j_et_i/j_et_i.html) ## Types ##