X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=offsite_reading.mdwn;h=6c0435eca9b90fb11ccffd9962bef3f013b55601;hp=a6b537ab8f614d24175aba42869f3665357aa952;hb=1b7446b685897f2463c3ffe680f3321fdb8900be;hpb=84b26cc370cce66016c780306f90262cef60cfba

diff --git a/offsite_reading.mdwn b/offsite_reading.mdwn
index a6b537ab..6c0435ec 100644
--- a/offsite_reading.mdwn
+++ b/offsite_reading.mdwn
@@ -91,6 +91,10 @@ 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/)
 
+## Folds ##
+
+*    [[!wikipedia Fold (higher-order function)]]
+
 
 ## Types ##
 
@@ -115,8 +119,8 @@ get more out of. (Rinse and repeat.)
 ## Monads ##
 *	[[!wikipedia Monad (functional programming) desc="Monads in Functional Programming"]]
 *	[Daniel Friedman. A Schemer's View of Monads](/schemersviewofmonads.ps): from <https://www.cs.indiana.edu/cgi-pub/c311/doku.php?id=home> but the link above is to a local copy.
-*	[A Gentle Intro to Haskell: About Monads](http://www.haskell.org/tutorial/monads.html)
-*	[All About Monads](http://haskell.org/all_about_monads/html/index.html)
+*	[A Gentle Intro to Haskell: About Monads](http://www.haskell.org/tutorial/monads.html) (link currently broken, check <http://www.haskell.org/haskellwiki/Tutorials>)
+*	[All About Monads](http://haskell.org/all_about_monads/html/index.html) (also broken, here's an [archived version](http://web.archive.org/web/20071013115156/haskell.org/all_about_monads/html/index.html))
 *	From HaskwellWiki:
 	[Monad tutorials timeline](http://www.haskell.org/haskellwiki/Monad_tutorials_timeline)
 	| [Monad laws](http://www.haskell.org/haskellwiki/Monad_Laws)
@@ -124,6 +128,7 @@ get more out of. (Rinse and repeat.)
 	| [Monads as containers](http://www.haskell.org/haskellwiki/Monads_as_containers)
 	| [What a monad is not](http://www.haskell.org/haskellwiki/What_a_Monad_is_not)
 *	[Haskell wikibook: Understanding monads](http://en.wikibooks.org/wiki/Haskell/Understanding_monads)
+*	[Haskell WikiBook: Monad Transformers](http://en.wikibooks.org/wiki/Haskell/Monad_transformers)
 
 *	[You Could Have Invented Monads! (And Maybe You Already Have.)](http://blog.sigfpe.com/2006/08/you-could-have-invented-monads-and.html)
 *	Yet Another Monad Tutorial: [part 1](http://mvanier.livejournal.com/3917.html) [part 2](http://mvanier.livejournal.com/4305.html)
@@ -197,12 +202,6 @@ in M. Broy, editor, *Marktoberdorf Summer School on Program Design Calculi*, Spr
 *	[Pointers in OCaml](http://caml.inria.fr/resources/doc/guides/pointers.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]]
@@ -234,6 +233,13 @@ in M. Broy, editor, *Marktoberdorf Summer School on Program Design Calculi*, Spr
 *	[Delimited continuations in natural language semantics](http://okmij.org/ftp/gengo/)
 
 
+## 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>
+
+
+
 ## Linear Logic ##
 
 *	[[!wikipedia Linear logic]]