X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=offsite_reading.mdwn;h=0a660be07032010e6dfa02028e2076eead952aac;hp=b826458092f276c8783b266132a8d7d955c757c1;hb=4fde59e8440a11db16396496648d9b53fe055670;hpb=015b352b7886d9558be102861850f4401c65b50a diff --git a/offsite_reading.mdwn b/offsite_reading.mdwn index b8264580..0a660be0 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,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 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 ) +* [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) @@ -123,7 +128,9 @@ 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) +* [A State Monad Tutorial](http://strabismicgobbledygook.wordpress.com/2010/03/06/a-state-monad-tutorial/) * [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) * [Monads for the Working Haskell Programmer -- a short tutorial](http://www.engr.mun.ca/~theo/Misc/haskell_and_monads.htm) @@ -154,7 +161,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)

- * [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,18 +195,14 @@ 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) -## 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]] @@ -214,7 +216,8 @@ in M. Broy, editor, *Marktoberdorf Summer School on Program Design Calculi*, Spr * [Continuations In Scheme](http://tech.phillipwright.com/2010/05/23/continuations-in-scheme/) * [Understanding Scheme Continuations](http://sanjaypande.blogspot.com/2004/06/understanding-scheme-continuations.html). This is tagged "Part I" but I think there's no further parts. * [Continuations for Curmudgeons](http://www.intertwingly.net/blog/2005/04/13/Continuations-for-Curmudgeons) [Commentary](http://lambda-the-ultimate.org/node/643) -* [Haskell wiki on Continuations](http://www.haskell.org/haskellwiki/Continuation)

+* [Haskell wiki on Continuations](http://www.haskell.org/haskellwiki/Continuation) +* [Haskell wikibook on Continuation Passing Style](http://en.wikibooks.org/wiki/Haskell/Continuation_passing_style)

* [[!wikipedia Delimited continuation]] * [Composable Continuations Tutorial](http://community.schemewiki.org/?composable-continuations-tutorial) at SchemeWiki * [Post by Ken](http://lambda-the-ultimate.org/node/1197#comment-12927) on Lambda the Ultimate explaining difference between undelimited and delimited continuations @@ -232,6 +235,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/) +* [Haskell wikibook on the Curry-Howard Isomorphism](http://en.wikibooks.org/wiki/Haskell/The_Curry-Howard_isomorphism) at Haskell wiki

+ + + ## Linear Logic ## * [[!wikipedia Linear logic]]