X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=offsite_reading.mdwn;h=018758017c7572a3a2ec0897cf7545fb43b2271e;hp=d992c30a1ea38430f990920cf9ac1d67690682ba;hb=d9bf1d89baaef4a0ceeb5c84db4d2a7172aaf400;hpb=3cc38c05eaf8329c74c11a9df20a2ca8e30e563d

diff --git a/offsite_reading.mdwn b/offsite_reading.mdwn
index d992c30a..01875801 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 ##
 
@@ -118,10 +123,10 @@ get more out of. (Rinse and repeat.)
 *	[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)
-	[Monad laws](http://www.haskell.org/haskellwiki/Monad_Laws)
-	[Monads as computation](http://www.haskell.org/haskellwiki/Monads_as_computation)
-	[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)
+	| [Monad laws](http://www.haskell.org/haskellwiki/Monad_Laws)
+	| [Monads as computation](http://www.haskell.org/haskellwiki/Monads_as_computation)
+	| [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)
 
 *	[You Could Have Invented Monads! (And Maybe You Already Have.)](http://blog.sigfpe.com/2006/08/you-could-have-invented-monads-and.html)
@@ -153,22 +158,17 @@ get more out of. (Rinse and repeat.)
 *	[Of monads and spacesuits (archived)](http://www.iterasi.net/openviewer.aspx?sqrlitid=ixx7fcluvek_9lfolsxr_g)
 *	[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>
+*	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. Monads for Functional Programming](http://homepages.inf.ed.ac.uk/wadler/papers/marktoberdorf/baastad.pdf):
-in M. Broy, editor, *Marktoberdorf Summer School on Program Design Calculi*, Springer Verlag, NATO ASI Series F: Computer and systems sciences, Volume 118, August 1992. Also in J. Jeuring and E. Meijer, editors, *Advanced Functional Programming*, Springer Verlag, LNCS 925, 1995. Some errata fixed August 2001.
-<!--	The use of monads to structure functional programs is described. Monads provide a convenient framework for simulating effects found in other languages, such as global state, exception handling, output, or non-determinism. Three case studies are looked at in detail: how monads ease the modification of a simple evaluator; how monads act as the basis of a datatype of arrays subject to in-place update; and how monads can be used to build parsers.-->
 *	[Philip Wadler. The essence of functional programming](http://homepages.inf.ed.ac.uk/wadler/papers/essence/essence.ps):
 invited talk, *19'th Symposium on Principles of Programming Languages*, ACM Press, Albuquerque, January 1992.
 <!--	This paper explores the use monads to structure functional programs. No prior knowledge of monads or category theory is required.
 	Monads increase the ease with which programs may be modified. They can mimic the effect of impure features such as exceptions, state, and continuations; and also provide effects not easily achieved with such features. The types of a program reflect which effects occur.
 	The first section is an extended example of the use of monads. A simple interpreter is modified to support various extra features: error messages, state, output, and non-deterministic choice. The second section describes the relation between monads and continuation-passing style. The third section sketches how monads are used in a compiler for Haskell that is written in Haskell.-->
-
-<p>
+*	[Philip Wadler. Monads for Functional Programming](http://homepages.inf.ed.ac.uk/wadler/papers/marktoberdorf/baastad.pdf):
+in M. Broy, editor, *Marktoberdorf Summer School on Program Design Calculi*, Springer Verlag, NATO ASI Series F: Computer and systems sciences, Volume 118, August 1992. Also in J. Jeuring and E. Meijer, editors, *Advanced Functional Programming*, Springer Verlag, LNCS 925, 1995. Some errata fixed August 2001.
+<!--	The use of monads to structure functional programs is described. Monads provide a convenient framework for simulating effects found in other languages, such as global state, exception handling, output, or non-determinism. Three case studies are looked at in detail: how monads ease the modification of a simple evaluator; how monads act as the basis of a datatype of arrays subject to in-place update; and how monads can be used to build parsers.-->
 *	Ken Shan [Monads for natural language semantics](http://arxiv.org/abs/cs/0205026v1) (2001) uses reader monad to implement intensionality.
 *	Ben-Avi and Winter [A modular approach to intensionality](http://parles.upf.es/glif/pub/sub11/individual/bena_wint.pdf) (2007) reinvents the technique.
 	<!--http://citeseerx.ist.psu.edu/viewdocsummary?doi=10.1.1.73.6927-->
@@ -193,7 +193,9 @@ invited talk, *19'th Symposium on Principles of Programming Languages*, ACM Pres
 
 ## 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)