added monads in category theory links

[lambda.git] / offsite_reading.mdwn

diff --git a/offsite_reading.mdwn b/offsite_reading.mdwn
index 286e748..4fb2eca 100644 (file)
--- a/offsite_reading.mdwn
+++ b/offsite_reading.mdwn
@@ -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
 *      [[!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]]<p>
+*      The [[!wikipedia Curry-Howard isomorphism]]
+*      [The Curry-Howard correspondence in Haskell](http://www.thenewsh.com/~newsham/formal/curryhoward/)<p>

 *      [[!wikipedia Type polymorphism]]
 *      [[!wikipedia System F]]
 
 *      [[!wikipedia Type polymorphism]]
 *      [[!wikipedia System F]]
 


@@ -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.
 
 
        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]]
 ## Continuations ##
 
 *      [[!wikipedia Continuation]]


@@ -224,7 +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
 
 *      [[!wikipedia Delimited continuation]]
 *      [Delimited/composable continuations tutorial](composable-continuations-tutorial) at SchemeWiki
 

+

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

+