X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=offsite_reading.mdwn;h=4fb2eca381dd79bb22ca2c932b48108053808a90;hp=b09ae2eae117a453aa13dbdaee246d373bff74c7;hb=e6a2ebdabf3013f0f4bbea873a5c083b628bb289;hpb=f06e3f39c0c0b1f5ee094239cc51ca541668e856 diff --git a/offsite_reading.mdwn b/offsite_reading.mdwn index b09ae2ea..4fb2eca3 100644 --- a/offsite_reading.mdwn +++ b/offsite_reading.mdwn @@ -17,21 +17,20 @@ get more out of out. (Rinse and repeat.) ## General issues about variables and binding in programming languages ## -* [[!wikipedia Variable (programming)]] +* [[!wikipedia Variable (programming) desc="Variables"]] * [[!wikipedia Variable shadowing]] -* [[!wikipedia Scope (programming)]] +* [[!wikipedia Scope (programming) desc="Variable scope"]] * [[!wikipedia Free variables and bound variables]] * [[!wikipedia Name binding]] * [[!wikipedia Name resolution]] -* [[!wikipedia Parameter (computer science)]] +* [[!wikipedia Parameter (computer science) desc="Function parameters"]] ## Functions as values, etc ## * [[!wikipedia Higher-order function]] * [[!wikipedia First-class function]] -* [[!wikipedia Closure (computer science)]] +* [[!wikipedia Closure (computer science) desc="Closures"]] * [[!wikipedia Currying]] -* [[!wikipedia Recursion (computer science)]] ## Functional vs imperative programming ## @@ -61,7 +60,7 @@ get more out of out. (Rinse and repeat.) ## Learning Scheme ## -* [Wikipedia overview of Scheme](http://en.wikipedia.org/wiki/Scheme_%28programming_language%29) +* [[!wikipedia Scheme (programming language) desc="Wikipedia overview of Scheme"]] * If you are new to programming or if you have the patience to work through a textbook, you should work through a textbook. Some good choices are The Little Schemer book(s) we recommended for the seminar; and also: @@ -104,6 +103,7 @@ community. ## Recursion and the Y Combinator ## +* [[!wikipedia Recursion (computer science) desc="Recursion"]] * [[!wikipedia Y combinator]] * [Chapter 9 from The Little Schemer](http://www.ccs.neu.edu/home/matthias/BTLS/sample.ps) on the Y Combinator "...and Again, and Again, and Again..." * [The Y combinator](http://mvanier.livejournal.com/2700.html) @@ -132,7 +132,8 @@ community. * [[!wikipedia Simply typed lambda calculus]] * [Type Theory](http://plato.stanford.edu/entries/type-theory/) at the Stanford Encyclopedia of Philosophy * [Church's Type Theory](http://plato.stanford.edu/entries/type-theory-church/) at the Stanford Encyclopedia of Philosophy -* The [[!wikipedia Curry-Howard isomorphism]]

+* The [[!wikipedia Curry-Howard isomorphism]] +* [The Curry-Howard correspondence in Haskell](http://www.thenewsh.com/~newsham/formal/curryhoward/)

* [[!wikipedia Type polymorphism]] * [[!wikipedia System F]] @@ -142,13 +143,13 @@ community. ## Side-effects / mutation ## -* [[!wikipedia Side effect (computer science)]] -* [[!wikipedia Reference (computer science)]] -* [[!wikipedia Pointer (computing)]] +* [[!wikipedia Side effect (computer science) desc="Side effects"]] +* [[!wikipedia Reference (computer science) desc="References"]] +* [[!wikipedia Pointer (computing) desc="Pointers"]] ## Monads ## -* [Monad in Functional Programming](http://en.wikipedia.org/wiki/Monad_(functional_programming)) +* [[!wikipedia Monad (functional programming) desc="Monads in Functional Programming"]] * [A Gentle Intro to Haskell: About Monads](http://www.haskell.org/tutorial/monads.html) @@ -178,17 +179,17 @@ community. [Part 3](http://james-iry.blogspot.com/2007/10/monads-are-elephants-part-3.html) [Part 4](http://james-iry.blogspot.com/2007/11/monads-are-elephants-part-4.html) -* Brian Beckman: Don't fear the Monad (67 minute video)](http://channel9.msdn.com/shows/Going+Deep/Brian-Beckman-Dont-fear-the-Monads/) +* [Brian Beckman: Don't fear the Monad (67 minute video)](http://channel9.msdn.com/shows/Going+Deep/Brian-Beckman-Dont-fear-the-Monads/) -* A monad non-tutorial...or why you shouldn't ask what a monad is](http://strongtyped.blogspot.com/2010/01/monad-non-tutorial.html) +* [A monad non-tutorial...or why you shouldn't ask what a monad is](http://strongtyped.blogspot.com/2010/01/monad-non-tutorial.html) -* The Mother of all Monads](http://blog.sigfpe.com/2008/12/mother-of-all-monads.html) +* [The Mother of all Monads](http://blog.sigfpe.com/2008/12/mother-of-all-monads.html) -* You Could Have Invented Monads! (And Maybe You Already Have.)](http://blog.sigfpe.com/2006/08/you-could-have-invented-monads-and.html) +* [You Could Have Invented Monads! (And Maybe You Already Have.)](http://blog.sigfpe.com/2006/08/you-could-have-invented-monads-and.html) -* Monads! (and Why Monad Tutorials Are All Awful)](http://ahamsandwich.wordpress.com/2007/07/26/monads-and-why-monad-tutorials-are-all-awful/) +* [Monads! (and Why Monad Tutorials Are All Awful)](http://ahamsandwich.wordpress.com/2007/07/26/monads-and-why-monad-tutorials-are-all-awful/) -* Of monads and spacesuits (archived)](http://www.iterasi.net/openviewer.aspx?sqrlitid=ixx7fcluvek_9lfolsxr_g) +* [Of monads and spacesuits (archived)](http://www.iterasi.net/openviewer.aspx?sqrlitid=ixx7fcluvek_9lfolsxr_g) * [Haskell wikibook: Understanding monads](http://en.wikibooks.org/wiki/Haskell/Understanding_monads) @@ -215,6 +216,22 @@ invited talk, *19'th Symposium on Principles of Programming Languages*, ACM Pres 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. +## Monads in Category Theory ## + +* [Category Theory at SEP](http://plato.stanford.edu/entries/category-theory/) +* [[!wikipedia Category theory]] +* [[!wikipedia Category (mathematics) desc="Category"]] +* [[!wikipedia Morphism]] +* [[!wikipedia Functor]] +* [[!wikipedia Natural transformation]] +* [[!wikipedia Monad (category theory) desc="Monads in category theory"]] +* [Haskell/Category Theory](http://en.wikibooks.org/wiki/Haskell/Category_theory) +* [Category Theory & Functional Programming](http://blog.mestan.fr/2009/01/09/category-theory-functional-programming/) +* [Learning Haskell through Category Theory, and Adventuring in Category Land](http://dekudekuplex.wordpress.com/2009/01/16/learning-haskell-through-category-theory-and-adventuring-in-category-land-like-flatterland-only-about-categories/) +* [Resources for learning practical category theory](http://mathoverflow.net/questions/903/resources-for-learning-practical-category-theory) +* [A Partial Ordering of some Category Theory applied to Haskell](http://blog.sigfpe.com/2010/03/partial-ordering-of-some-category.html) + + ## Continuations ## * [[!wikipedia Continuation]] @@ -224,11 +241,9 @@ invited talk, *19'th Symposium on Principles of Programming Languages*, ACM Pres * [[!wikipedia Delimited continuation]] * [Delimited/composable continuations tutorial](composable-continuations-tutorial) at SchemeWiki -## Monads ## - -* [[!wikipedia Monad (functional programming)]] ## Linear Logic ## * [[!wikipedia Linear logic]] +