X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?a=blobdiff_plain;ds=inline;f=offsite_reading.mdwn;h=8bb42380b30fb731febb77a8c9ad7e6f8311c5ef;hb=a738121a17239d9b723d64d2497b13c664465924;hp=8d86d8bf4d1a0df4bcb1d122f1fab964fe4371e7;hpb=6ce866dea74b5bbf12c2360b553a58bce45bdf27;p=lambda.git diff --git a/offsite_reading.mdwn b/offsite_reading.mdwn index 8d86d8bf..8bb42380 100644 --- a/offsite_reading.mdwn +++ b/offsite_reading.mdwn @@ -41,23 +41,15 @@ get more out of. (Rinse and repeat.) ##[[Learning Scheme]]## -* [Try Scheme in your web browser](http://tryscheme.sourceforge.net/) - ## 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.
- * [[!wikipedia Moses Schönfinkel]] * [[!wikipedia Haskell Curry]] * [[!wikipedia Alonzo Church]]
* [[!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]]
@@ -66,7 +58,9 @@ get more out of. (Rinse and repeat.)
-* [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)
+* [Les deux combinateurs et la totalite](http://www.paulbraffort.net/j_et_i/j_et_i.html) by Paul Braffort.
## Evaluation Order ##
@@ -94,7 +88,8 @@ 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/)
+* [The church of the least fixed point, by Sans Pareil](http://www.springerlink.com/content/n4t2v573m58g2755/)
+
## Types ##
@@ -108,12 +103,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
* [[!wikipedia Type polymorphism]]
* [[!wikipedia System F]]
+
##[[Learning OCaml]]##
@@ -180,6 +173,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
+
+
## Continuations ##
* [[!wikipedia Continuation]]