X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=offsite_reading.mdwn;h=3e0981bdeb3873f41b46a948f4b8c2d74edbc6ae;hp=b826458092f276c8783b266132a8d7d955c757c1;hb=d4f4c6c97357ac4245c3526219bf4eb4e0adcd37;hpb=015b352b7886d9558be102861850f4401c65b50a

diff --git a/offsite_reading.mdwn b/offsite_reading.mdwn
index b8264580..3e0981bd 100644
--- a/offsite_reading.mdwn
+++ b/offsite_reading.mdwn
@@ -26,6 +26,7 @@ get more out of. (Rinse and repeat.)
 *	[[!wikipedia Functional programming]]
 *	[[!wikipedia Purely functional]]
 *	[[!wikipedia Referential transparency (computer science)]]
+*	[[!wikipedia Side effect (computer science) desc="Side effects"]]
 *	[[!wikipedia Imperative programming]]
 
 ## General issues about variables and scope in programming languages ##
@@ -90,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 ##
 
@@ -114,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)
@@ -154,7 +159,6 @@ get more out of. (Rinse and repeat.)
 *	[How not to explain Haskell monads](http://mvanier.livejournal.com/1205.html)
 *	[The State Monad: a tutorial for the confused?](http://coder.bsimmons.name/blog/2009/10/the-state-monad-a-tutorial-for-the-confused/)
 *	Haskell state monads: [part 1](http://mvanier.livejournal.com/1765.html) [part 2](http://mvanier.livejournal.com/1901.html) [part 3](http://mvanier.livejournal.com/4586.html) [part 4](http://mvanier.livejournal.com/4647.html)<p>
-
 *	[Research Papers/Monads and Arrows](http://www.haskell.org/haskellwiki/Research_papers/Monads_and_arrows)
 *	[Eugenio Moggi, Notions of Computation and Monads](http://www.disi.unige.it/person/MoggiE/ftp/ic91.pdf): Information and Computation 93 (1) 1991.
 *	[Philip Wadler. The essence of functional programming](http://homepages.inf.ed.ac.uk/wadler/papers/essence/essence.ps):
@@ -189,7 +193,9 @@ in M. Broy, editor, *Marktoberdorf Summer School on Program Design Calculi*, Spr
 
 ## Side-effects / mutation ##
 
+*	[[!wikipedia Referential transparency (computer science)]]
 *	[[!wikipedia Side effect (computer science) desc="Side effects"]]
+*	[[!wikipedia Imperative programming]]
 *	[[!wikipedia Reference (computer science) desc="References"]]
 *	[[!wikipedia Pointer (computing) desc="Pointers"]]
 *	[Pointers in OCaml](http://caml.inria.fr/resources/doc/guides/pointers.html)