readings.mdwn

   1 ## Links to tutorials and other resources on Scheme, OCaml, and Haskell ##
   2
   3 *   Help on [[Learning Scheme]]
   4 *   Help on [[Learning OCaml]]
   5 *   Help on [[Learning Haskell]]
   6
   7 <!-- -->
   8 *   This site's [[explanation of the differences|rosetta1]] between these languages
   9
  10
  11 ## Other Offsite Reading ##
  12
  13 *   [[Famous Computer Scientists|people]]
  14
  15
  16
  17 <!--
  18 There's lots of links here already to tutorials and encyclopedia entries about many of the notions we'll be dealing with.
  19
  20 Many of these links are to Wikipedia. You can learn a lot from such articles,
  21 so long as you remember they may sometimes mislead or make mistakes. However, I
  22 hope at this point in your education you'll have learned to be a guarded reader
  23 even of authoritative treatises by eminent authors. So you shouldn't need any
  24 Wikipedia-specific warnings.
  25
  26 For most readers, many bits of reading we point you to will be hairy in one way
  27 or another. It may be aimed at audiences with more programming experience; it
  28 may be aimed at audiences with specific logical background you don't yet have;
  29 it may be aimed at audiences familiar with technical areas in linguistics you're
  30 first encountering. Or perhaps several of these at once. We hope you will
  31 already have mastered the skill of leveraged reading: getting what you can out
  32 of an article you don't fully understand, so that you can discuss it with the rest of
  33 the group and hopefully get to a point where you can read it again and
  34 get more out of. (Rinse and repeat.)
  35
  36 ## Functions ##
  37
  38 *       [[!wikipedia Higher-order function]]
  39 *       [[!wikipedia First-class function]]
  40 *       [[!wikipedia Currying]]
  41
  42 ## Functional vs imperative programming ##
  43
  44 *       [[!wikipedia Declarative programming]]
  45 *       [[!wikipedia Functional programming]]
  46 *       [[!wikipedia Purely functional]]
  47 *       [[!wikipedia Referential transparency (computer science)]]
  48 *       [[!wikipedia Side effect (computer science) desc="Side effects"]]
  49 *       [[!wikipedia Imperative programming]]
  50
  51 ## General issues about variables and scope in programming languages ##
  52
  53 *       [[!wikipedia Variable (programming) desc="Variables"]]
  54 *       [[!wikipedia Free variables and bound variables]]
  55 *       [[!wikipedia Variable shadowing]]
  56 *       [[!wikipedia Name binding]]
  57 *       [[!wikipedia Name resolution]]
  58 *       [[!wikipedia Parameter (computer science) desc="Function parameters"]]
  59 *       [[!wikipedia Scope (programming) desc="Variable scope"]]
  60 *       [[!wikipedia Closure (computer science) desc="Closures"]]
  61
  62 ##[[Learning Scheme]]##
  63
  64 ## Untyped lambda calculus and combinatory logic ##
  65
  66 *       [[!wikipedia Lambda calculus]]
  67 <!~- Haskell Curry had ideas that he felt were validated upon reading a 1924 paper by M. Schönfinkel "Uber die Bausteine der mathematischen Logik" which used combinators in a similar way to his own ideas. Haskell then wrote "An analysis of logical substitution" which appeared in the American Journal of Mathematics in 1929. ~->
  68 *       [[!wikipedia Moses Schönfinkel]]
  69 *       [[!wikipedia Haskell Curry]]
  70 *       [[!wikipedia Alonzo Church]]<p>
  71 *       [[!wikipedia Church encoding]]
  72
  73 *       [[!wikipedia Combinatory logic]]
  74 *       [Combinatory logic](http://plato.stanford.edu/entries/logic-combinatory/) at the Stanford Encyclopedia of Philosophy
  75 *       [[!wikipedia SKI combinatory calculus]]
  76 *       [[!wikipedia B,C,K,W system]]
  77 *       Jeroen Fokker, "The Systematic Construction of a One-combinator Basis for Lambda-Terms" <cite>Formal Aspects of Computing</cite> 4 (1992), pp. 776-780.
  78         <http://people.cs.uu.nl/jeroen/article/combinat/combinat.ps>
  79 *       [Chris Barker's Iota and Jot](http://semarch.linguistics.fas.nyu.edu/barker/Iota/)<p>
  80
  81 *       [To Dissect a Mockingbird](http://dkeenan.com/Lambda/index.htm)
  82 *       [Combinator Birds](http://www.angelfire.com/tx4/cus/combinator/birds.html)
  83 *   [Les deux combinateurs et la totalite](http://www.paulbraffort.net/j_et_i/j_et_i.html) by Paul Braffort.
  84
  85 ## Evaluation Order ##
  86
  87 *       [[!wikipedia Evaluation strategy]]
  88 *       [[!wikipedia Eager evaluation]]
  89 *       [[!wikipedia Lazy evaluation]]
  90 *       [[!wikipedia Strict programming language]]
  91
  92 ## Confluence, Normalization, Undecidability ##
  93
  94 *       [[!wikipedia Church-Rosser theorem]]
  95 *       [[!wikipedia Normalization property]]
  96 *       [[!wikipedia Turing completeness]]<p>
  97 *       [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
  98
  99
 100 ## Recursion and the Y Combinator ##
 101
 102 *       [[!wikipedia Recursion (computer science) desc="Recursion"]]
 103 *       [[!wikipedia Y combinator]]
 104 *       [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..."
 105 *       [The Y combinator](http://mvanier.livejournal.com/2700.html)
 106 *       [The Why of Y](http://www.dreamsongs.com/NewFiles/WhyOfY.pdf)
 107 *       [The Y Combinator (Slight Return), or: How to Succeed at Recursion Without Really Recursing](http://mvanier.livejournal.com/2897.html)
 108 *       [Y Combinator for Dysfunctional Non-Schemers](http://rayfd.wordpress.com/2007/05/06/y-combinator-for-dysfunctional-non-schemers/)
 109 *       [The Y Combinator](http://www.ece.uc.edu/~franco/C511/html/Scheme/ycomb.html)
 110 *       [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...
 111 *   [The church of the least fixed point, by Sans Pareil](http://www.springerlink.com/content/n4t2v573m58g2755/)
 112
 113 ## Folds ##
 114
 115 *    [[!wikipedia Fold (higher-order function)]]
 116
 117
 118 ## Types ##
 119
 120 *       [[!wikipedia Typed lambda calculus]]
 121 *       [[!wikipedia Simply typed lambda calculus]]
 122 *       [Type Theory](http://plato.stanford.edu/entries/type-theory/) at the Stanford Encyclopedia of Philosophy
 123 *       [Church's Type Theory](http://plato.stanford.edu/entries/type-theory-church/) at the Stanford Encyclopedia of Philosophy
 124 *       [[!wikipedia Type polymorphism]]
 125 *       [[!wikipedia System F]]
 126 <p>
 127 *       [[!wikipedia Tagged union]]
 128 *       [[!wikipedia Algebraic data type]]
 129 *       [[!wikipedia Recursive data type]]
 130 *       [[!wikipedia Pattern matching]]
 131 *       [[!wikipedia Unit type]]
 132 *       [[!wikipedia Bottom type]]
 133
 134
 135 ##[[Learning OCaml]]##
 136
 137
 138 ## Monads ##
 139 *       [[!wikipedia Monad (functional programming) desc="Monads in Functional Programming"]]
 140 *       [Daniel Friedman. A Schemer's View of Monads](/schemersviewofmonads.ps): from <https://www.cs.indiana.edu/cgi-pub/c311/doku.php?id=home> but the link above is to a local copy.
 141 *       [A Gentle Intro to Haskell: About Monads](http://www.haskell.org/tutorial/monads.html) (link currently broken, check <http://www.haskell.org/haskellwiki/Tutorials>)
 142 *       [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))
 143 *       From HaskwellWiki:
 144         [Monad tutorials timeline](http://www.haskell.org/haskellwiki/Monad_tutorials_timeline)
 145         | [Monad laws](http://www.haskell.org/haskellwiki/Monad_Laws)
 146         | [Monads as computation](http://www.haskell.org/haskellwiki/Monads_as_computation)
 147         | [Monads as containers](http://www.haskell.org/haskellwiki/Monads_as_containers)
 148         | [What a monad is not](http://www.haskell.org/haskellwiki/What_a_Monad_is_not)
 149 *       [Haskell wikibook: Understanding monads](http://en.wikibooks.org/wiki/Haskell/Understanding_monads)
 150 *       [Haskell wikibook: Monad Transformers](http://en.wikibooks.org/wiki/Haskell/Monad_transformers)
 151
 152 *       [A State Monad Tutorial](http://strabismicgobbledygook.wordpress.com/2010/03/06/a-state-monad-tutorial/)
 153 *       [You Could Have Invented Monads! (And Maybe You Already Have.)](http://blog.sigfpe.com/2006/08/you-could-have-invented-monads-and.html)
 154 *       Yet Another Monad Tutorial: [part 1](http://mvanier.livejournal.com/3917.html) [part 2](http://mvanier.livejournal.com/4305.html)
 155 *       [Monads for the Working Haskell Programmer -- a short tutorial](http://www.engr.mun.ca/~theo/Misc/haskell_and_monads.htm)
 156 *       [Introduction to Haskell: Monads](http://onlamp.com/pub/a/onlamp/2007/08/02/introduction-to-haskell-pure-functions.html)
 157 *       [SPb Haskell User Group: Monad tutorial](http://spbhug.folding-maps.org/wiki/MonadsEn)
 158 *       [Understanding Haskell Monads](http://ertes.de/articles/monads.html)
 159 *       [A Monad Tutorial for OCaml](http://enfranchisedmind.com/blog/posts/a-monad-tutorial-for-ocaml/)
 160 *       [Beyond Monads](http://blog.sigfpe.com/2009/02/beyond-monads.html)
 161 *       [Simple Explanation of a Monad](http://math.stackexchange.com/questions/405/simple-explanation-of-a-monad)
 162 *       [What is a Monad?](http://stackoverflow.com/questions/44965/what-is-a-monad)
 163 *       [Can Anyone Explain Monads?](http://stackoverflow.com/questions/2366/can-anyone-explain-monads)
 164 *       [Monad in Plain English...](http://stackoverflow.com/questions/2704652/monad-in-plain-english-for-the-oop-programmer-with-no-fp-background)
 165 *       [Monad in non-programming terms](http://stackoverflow.com/questions/3261729/monad-in-non-programming-terms)
 166 *       [Real World Haskell: chapter on Monads](http://book.realworldhaskell.org/read/monads.html)
 167 *       [Learn You a Haskell for Great Good: chapter on Functors, Applicative Functors and Monoids](http://www.learnyouahaskell.com/functors-applicative-functors-and-monoids)
 168 *       Monads are Elephants:
 169 [Part 1](http://james-iry.blogspot.com/2007/09/monads-are-elephants-part-1.html)
 170 [Part 2](http://james-iry.blogspot.com/2007/10/monads-are-elephants-part-2.html)
 171 [Part 3](http://james-iry.blogspot.com/2007/10/monads-are-elephants-part-3.html)
 172 [Part 4](http://james-iry.blogspot.com/2007/11/monads-are-elephants-part-4.html)
 173 *       [Brian Beckman: Don't fear the Monad (67 minute video)](http://channel9.msdn.com/shows/Going+Deep/Brian-Beckman-Dont-fear-the-Monads/)
 174 *       [A monad non-tutorial...or why you shouldn't ask what a monad is](http://strongtyped.blogspot.com/2010/01/monad-non-tutorial.html)
 175 *       [Abstraction, intuition, and the "monad tutorial fallacy"](http://byorgey.wordpress.com/2009/01/12/abstraction-intuition-and-the-monad-tutorial-fallacy/)
 176 *       [How you should(n't) use Monad](http://noordering.wordpress.com/2009/03/31/how-you-shouldnt-use-monad/)
 177 *       [The Mother of all Monads](http://blog.sigfpe.com/2008/12/mother-of-all-monads.html)
 178 *       [Monads! (and Why Monad Tutorials Are All Awful)](http://ahamsandwich.wordpress.com/2007/07/26/monads-and-why-monad-tutorials-are-all-awful/)
 179 *       [Of monads and spacesuits (archived)](http://www.iterasi.net/openviewer.aspx?sqrlitid=ixx7fcluvek_9lfolsxr_g)
 180 *       [How not to explain Haskell monads](http://mvanier.livejournal.com/1205.html)
 181 *       [The State Monad: a tutorial for the confused?](http://coder.bsimmons.name/blog/2009/10/the-state-monad-a-tutorial-for-the-confused/)
 182 *       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>
 183 *       [Research Papers/Monads and Arrows](http://www.haskell.org/haskellwiki/Research_papers/Monads_and_arrows)
 184 *       [Eugenio Moggi, Notions of Computation and Monads](http://www.disi.unige.it/person/MoggiE/ftp/ic91.pdf): Information and Computation 93 (1) 1991.
 185 *       [Philip Wadler. The essence of functional programming](http://homepages.inf.ed.ac.uk/wadler/papers/essence/essence.ps):
 186 invited talk, *19'th Symposium on Principles of Programming Languages*, ACM Press, Albuquerque, January 1992.
 187 <!~-    This paper explores the use monads to structure functional programs. No prior knowledge of monads or category theory is required.
 188         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.
 189         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.~->
 190 *       [Philip Wadler. Monads for Functional Programming](http://homepages.inf.ed.ac.uk/wadler/papers/marktoberdorf/baastad.pdf):
 191 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.
 192 <!~-    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.~->
 193 *       Ken Shan [Monads for natural language semantics](http://arxiv.org/abs/cs/0205026v1) (2001) uses reader monad to implement intensionality.
 194 *       Ben-Avi and Winter [A modular approach to intensionality](http://parles.upf.es/glif/pub/sub11/individual/bena_wint.pdf) (2007) reinvents the technique.
 195         <!~- http://citeseerx.ist.psu.edu/viewdocsummary?doi=10.1.1.73.6927 ~->
 196 *       Monsters and context-shifting, e.g. Gillies/von Fintel on "ifs" [not sure which paper]
 197
 198
 199 ## Monads in Category Theory ##
 200
 201 *       [Category Theory at SEP](http://plato.stanford.edu/entries/category-theory/)
 202 *       [[!wikipedia Category theory]]
 203 *       [[!wikipedia Category (mathematics) desc="Category"]]
 204 *       [[!wikipedia Morphism]]
 205 *       [[!wikipedia Functor]]
 206 *       [[!wikipedia Natural transformation]]
 207 *       [[!wikipedia Monad (category theory) desc="Monads in category theory"]]
 208 *       [Haskell/Category Theory](http://en.wikibooks.org/wiki/Haskell/Category_theory)
 209 *       [Category Theory & Functional Programming](http://blog.mestan.fr/2009/01/09/category-theory-functional-programming/)
 210 *       [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/)
 211 *       [Resources for learning practical category theory](http://mathoverflow.net/questions/903/resources-for-learning-practical-category-theory)
 212 *       [A Partial Ordering of some Category Theory applied to Haskell](http://blog.sigfpe.com/2010/03/partial-ordering-of-some-category.html)
 213
 214
 215 ## Side-effects / mutation ##
 216
 217 *       [[!wikipedia Referential transparency (computer science)]]
 218 *       [[!wikipedia Side effect (computer science) desc="Side effects"]]
 219 *       [[!wikipedia Imperative programming]]
 220 *       [[!wikipedia Reference (computer science) desc="References"]]
 221 *       [[!wikipedia Pointer (computing) desc="Pointers"]]
 222 *       [Pointers in OCaml](http://caml.inria.fr/resources/doc/guides/pointers.html)
 223
 224
 225 ## Continuations ##
 226
 227 *       [[!wikipedia Continuation]]
 228 *       [[!wikipedia Continuation-passing style]]
 229 *       [[!wikipedia Call-with-current-continuation]]
 230 *       [Intro to call/cc](http://community.schemewiki.org/?call-with-current-continuation) at SchemeWiki
 231 *       [Call With Current Continuation](http://www.c2.com/cgi/wiki?CallWithCurrentContinuation)
 232 *       [Continuations Made Simple and Illustrated](http://www.ps.uni-saarland.de/~duchier/python/continuations.html)
 233 *       [Continuation kata](http://programming-musings.org/2006/02/12/continuation-kata/)
 234 *       [Understanding continuations](http://keithdevens.com/weblog/archive/2004/Jul/11/continuations) [Commentary](http://lambda-the-ultimate.org/node/86)
 235 *       [Continuations In Scheme](http://tech.phillipwright.com/2010/05/23/continuations-in-scheme/)
 236 *       [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.
 237 *       [Continuations for Curmudgeons](http://www.intertwingly.net/blog/2005/04/13/Continuations-for-Curmudgeons) [Commentary](http://lambda-the-ultimate.org/node/643)
 238 *       [Haskell wiki on Continuations](http://www.haskell.org/haskellwiki/Continuation)
 239 *       [Haskell wikibook on Continuation Passing Style](http://en.wikibooks.org/wiki/Haskell/Continuation_passing_style)<p>
 240 *       [[!wikipedia Delimited continuation]]
 241 *       [Composable Continuations Tutorial](http://community.schemewiki.org/?composable-continuations-tutorial) at SchemeWiki
 242 *       [Post by Ken](http://lambda-the-ultimate.org/node/1197#comment-12927) on Lambda the Ultimate explaining difference between undelimited and delimited continuations
 243 *       [shift, reset and streams](http://chneukirchen.org/blog/archive/2005/04/shift-reset-and-streams.html)
 244 *       [guile and delimited continuations](http://www.wingolog.org/archives/2010/02/26/guile-and-delimited-continuations)
 245 *       [Delimited continuations in Scala](http://blog.richdougherty.com/2009/02/delimited-continuations-in-scala_24.html)
 246 *       [Delimited Continuations Explained (in Scala)](http://dcsobral.blogspot.com/2009/07/delimited-continuations-explained-in.html)
 247 *       [Partial Continuations](http://www.bluishcoder.co.nz/articles/scheme/partial-continuations.html)
 248 *       Delimited Continuations in MzScheme:
 249 [Part 1](http://schemekeys.blogspot.com/2006/11/prompts-their-interaction-with-dynamic.html)
 250 [Part 2](http://schemekeys.blogspot.com/2006/12/delimited-continuations-in-mzscheme.html)
 251 [Part 3](http://schemekeys.blogspot.com/2007/01/going-further-with-primitives.html)
 252 [Part 4](http://schemekeys.blogspot.com/2007/01/odd-and-ends.html)<p>
 253 *       [Online Bibliography of Scheme Research: Continuations and Continuation Passing Style](http://library.readscheme.org/page6.html)
 254 *       [Delimited continuations in natural language semantics](http://okmij.org/ftp/gengo/)
 255
 256
 257 ## The Curry-Howard Correspondence ##
 258 *       The [[!wikipedia Curry-Howard isomorphism]]
 259 *       [The Curry-Howard correspondence in Haskell](http://www.thenewsh.com/~newsham/formal/curryhoward/)
 260 *       [Haskell wikibook on the Curry-Howard Isomorphism](http://en.wikibooks.org/wiki/Haskell/The_Curry-Howard_isomorphism) at Haskell wiki<p>
 261
 262
 263
 264 ## Linear Logic ##
 265
 266 *       [[!wikipedia Linear logic]]
 267
 268
 269 -->