- +* [Chris Barker's Lambda Tutorial](http://homepages.nyu.edu/~cb125/Lambda) +* [Lambda Animator](http://thyer.name/lambda-animator/)
* [[!wikipedia Haskell Curry]] * [[!wikipedia Moses Schönfinkel]] * [[!wikipedia Alonzo Church]]
@@ -56,17 +55,12 @@ get more out of out. (Rinse and repeat.) * [[!wikipedia Church-Rosser theorem]] * [[!wikipedia Normalization property]] * [[!wikipedia Turing completeness]]
+* [Scooping the Loop Snooper](http://www.cl.cam.ac.uk/teaching/0910/CompTheory/scooping.pdf), a proof of the undecidability of the halting problem in the style of Dr Seuss by Geoffrey K. Pullum * [[!wikipedia Church encoding]] -* [[!wikipedia Y combinator]]
-* [[!wikipedia Curry-Howard isomorphism]]
-* [[!wikipedia Evaluation strategy]] -* [[!wikipedia Eager evaluation]] -* [[!wikipedia Lazy evaluation]] -* [[!wikipedia Strict programming language]] ## 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: @@ -93,12 +87,12 @@ Revised Revised Report..." and so on, or "The Revised^n Report..." for short, for increasing n. The most widely implemented standard is [The Revised^5 Report on Scheme](http://docs.racket-lang.org/r5rs/index.html), or R5RS, published in 1998. -\[[Alt link](http://www.schemers.org/Documents/Standards/R5RS/HTML/)\] +\[ [Alt link](http://www.schemers.org/Documents/Standards/R5RS/HTML/) \] A new standard [R6RS](http://docs.racket-lang.org/r6rs/index.html) was ratified in 2007, but this has many detractors and has not been fully accepted in the community. -\[[Alt link](http://www.r6rs.org/final/html/r6rs/r6rs.html); -[Libraries](http://www.r6rs.org/final/html/r6rs-lib/r6rs-lib.html)\] +\[ [Alt link](http://www.r6rs.org/final/html/r6rs/r6rs.html); +[Libraries](http://www.r6rs.org/final/html/r6rs-lib/r6rs-lib.html) \] * [Scheme FAQ](http://community.schemewiki.org/?scheme-faq) @@ -107,6 +101,25 @@ community. * The [Schematics Scheme Cookbook](http://schemecookbook.org/) is a collaborative effort to produce documentation and recipes for using Scheme for common tasks. +## 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) +* [The Y Combinator (Slight Return), or: How to Succeed at Recursion Without Really Recursing](http://mvanier.livejournal.com/2897.html) +* [Y Combinator for Dysfunctional Non-Schemers](http://rayfd.wordpress.com/2007/05/06/y-combinator-for-dysfunctional-non-schemers/) +* [The Y Combinator](http://www.ece.uc.edu/~franco/C511/html/Scheme/ycomb.html) +* [The Y Combinator](http://dangermouse.brynmawr.edu/cs245/ycomb_jim.html), described as: + > This is the derivation of the applicative-order Y-combinator from scratch, in Scheme. The following derivation is similar in flavor to the derivation found in The Little LISPer by Friedman/Felleisen, but uses a slightly different starting approach... + +## Evaluation Order ## + +* [[!wikipedia Evaluation strategy]] +* [[!wikipedia Eager evaluation]] +* [[!wikipedia Lazy evaluation]] +* [[!wikipedia Strict programming language]] + ## Types ## @@ -119,6 +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 Curry-Howard correspondence in Haskell](http://www.thenewsh.com/~newsham/formal/curryhoward/)
* [[!wikipedia Type polymorphism]] * [[!wikipedia System F]] @@ -128,9 +143,94 @@ 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 ## + +* [[!wikipedia Monad (functional programming) desc="Monads in Functional Programming"]] + +* [A Gentle Intro to Haskell: About Monads](http://www.haskell.org/tutorial/monads.html) + +* [Understanding Haskell Monads](http://ertes.de/articles/monads.html) + +* [The State Monad: a tutorial for the confused?](http://coder.bsimmons.name/blog/2009/10/the-state-monad-a-tutorial-for-the-confused/) + +* [Beyond Monads](http://blog.sigfpe.com/2009/02/beyond-monads.html) + +* [Simple Explanation of a Monad](http://math.stackexchange.com/questions/405/simple-explanation-of-a-monad) + +* [What is a Monad?](http://stackoverflow.com/questions/44965/what-is-a-monad) + +* [Can Anyone Explain Monads?](http://stackoverflow.com/questions/2366/can-anyone-explain-monads) + +* [Monad in Plain English...](http://stackoverflow.com/questions/2704652/monad-in-plain-english-for-the-oop-programmer-with-no-fp-background) + +* [Monad in non-programming terms](http://stackoverflow.com/questions/3261729/monad-in-non-programming-terms) + +* [Real World Haskell: chapter on Monads](http://book.realworldhaskell.org/read/monads.html) + +* [Learn You a Haskell for Great Good: chapter on Functors, Applicative Functors and Monoids](http://www.learnyouahaskell.com/functors-applicative-functors-and-monoids) + +* Monads are Elephants: +[Part 1](http://james-iry.blogspot.com/2007/09/monads-are-elephants-part-1.html) +[Part 2](http://james-iry.blogspot.com/2007/10/monads-are-elephants-part-2.html) +[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/) + +* [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) + +* [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/) + +* [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) + +* Haskell state monads: [part 1](http://mvanier.livejournal.com/1765.html) [part 2](http://mvanier.livejournal.com/1901.html) + +* [How not to explain Haskell monads](http://mvanier.livejournal.com/1205.html) + +* Yet Another Monad Tutorial: [part 1](http://mvanier.livejournal.com/3917.html) [part 2](http://mvanier.livejournal.com/4305.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) + +* [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. + +## 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 ## @@ -141,11 +241,9 @@ community. * [[!wikipedia Delimited continuation]] * [Delimited/composable continuations tutorial](composable-continuations-tutorial) at SchemeWiki -## Monads ## - -* [[!wikipedia Monad (functional programming)]] ## Linear Logic ## * [[!wikipedia Linear logic]] +