offsite

[lambda.git] / offsite_reading.mdwn

diff --git a/offsite_reading.mdwn b/offsite_reading.mdwn
index a6b537a..3e0981b 100644 (file)
--- 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,7 +119,7 @@ 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)
+*      [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)
 *      From HaskwellWiki:
        [Monad tutorials timeline](http://www.haskell.org/haskellwiki/Monad_tutorials_timeline)