X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=offsite_reading.mdwn;h=b82bd4bfb7a96351b35d279a16f10d3f43e66e81;hp=0c6a19da039b2ee6522f224ad7b3897411f981bd;hb=fa5f84861179e2ffcc16dfadffbd4b1c4f01c5df;hpb=0d2b33a56cdeba0ca5c4fe605fcd4e7e6d5cdc3d

diff --git a/offsite_reading.mdwn b/offsite_reading.mdwn
index 0c6a19da..b82bd4bf 100644
--- a/offsite_reading.mdwn
+++ b/offsite_reading.mdwn
@@ -46,6 +46,7 @@ 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>
@@ -65,6 +66,11 @@ get more out of. (Rinse and repeat.)
 	<http://people.cs.uu.nl/jeroen/article/combinat/combinat.ps>
 *	[Chris Barker's Iota and Jot](http://semarch.linguistics.fas.nyu.edu/barker/Iota/)<p>
 
+*	[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 ##
 
 *	[[!wikipedia Evaluation strategy]]
@@ -93,6 +99,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...
 
 
+
 ## Types ##
 
 *	[[!wikipedia Tagged union]]