X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?a=blobdiff_plain;ds=sidebyside;f=offsite_reading.mdwn;h=0a660be07032010e6dfa02028e2076eead952aac;hb=5a2706782fc496bfa4274812c21ad8c4e88a60f9;hp=c9f1d7ef2ef73f5946c46a4deb034594995c7a71;hpb=e27dbcf03f2335e339d848018e156c09056cdbdc;p=lambda.git diff --git a/offsite_reading.mdwn b/offsite_reading.mdwn index c9f1d7ef..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 ## @@ -41,24 +42,15 @@ get more out of. (Rinse and repeat.) ##[[Learning Scheme]]## -* [Try Scheme in your web browser](http://tryscheme.sourceforge.net/) - ## Untyped lambda calculus and combinatory logic ## * [[!wikipedia Lambda calculus]] -* Our [[Lambda evaluator]] -* [Chris Barker's Lambda Tutorial](http://homepages.nyu.edu/~cb125/Lambda) -* [Lambda Animator](http://thyer.name/lambda-animator/) -* [Penn lambda calculator](http://www.ling.upenn.edu/lambda/) Pedagogical software developed by Lucas Champollion, Josh Tauberer and Maribel Romero.
- - * [[!wikipedia Moses Schönfinkel]] * [[!wikipedia Haskell Curry]] * [[!wikipedia Alonzo Church]]
* [[!wikipedia Church encoding]] - * [[!wikipedia Combinatory logic]] * [Combinatory logic](http://plato.stanford.edu/entries/logic-combinatory/) at the Stanford Encyclopedia of Philosophy * [[!wikipedia SKI combinatory calculus]] @@ -69,6 +61,7 @@ get more out of. (Rinse and repeat.) * [To Dissect a Mockingbird](http://dkeenan.com/Lambda/index.htm) * [Combinator Birds](http://www.angelfire.com/tx4/cus/combinator/birds.html) +* [Les deux combinateurs et la totalite](http://www.paulbraffort.net/j_et_i/j_et_i.html) by Paul Braffort. ## Evaluation Order ## @@ -96,42 +89,55 @@ get more out of. (Rinse and repeat.) * [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) 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/) +* [The church of the least fixed point, by Sans Pareil](http://www.springerlink.com/content/n4t2v573m58g2755/) + +## Folds ## + +* [[!wikipedia Fold (higher-order function)]] + ## Types ## -* [[!wikipedia Tagged union]] -* [[!wikipedia Algebraic data type]] -* [[!wikipedia Recursive data type]] -* [[!wikipedia Pattern matching]] -* [[!wikipedia Unit type]] -* [[!wikipedia Bottom type]] * [[!wikipedia Typed lambda calculus]] * [[!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/) -* [The Curry-Howard Isomorphism](http://en.wikibooks.org/wiki/Haskell/The_Curry-Howard_isomorphism) at Haskell wiki
* [[!wikipedia Type polymorphism]] * [[!wikipedia System F]] - -##[[Learning OCaml]]## +
+* [[!wikipedia Tagged union]]
+* [[!wikipedia Algebraic data type]]
+* [[!wikipedia Recursive data type]]
+* [[!wikipedia Pattern matching]]
+* [[!wikipedia Unit type]]
+* [[!wikipedia Bottom type]]
-## Side-effects / mutation ##
+##[[Learning OCaml]]##
-* [[!wikipedia Side effect (computer science) desc="Side effects"]]
-* [[!wikipedia Reference (computer science) desc="References"]]
-* [[!wikipedia Pointer (computing) desc="Pointers"]]
-* [Pointers in OCaml](http://caml.inria.fr/resources/doc/guides/pointers.html)
## Monads ##
-
* [[!wikipedia Monad (functional programming) desc="Monads in Functional Programming"]]
-* [A Gentle Intro to Haskell: About Monads](http://www.haskell.org/tutorial/monads.html)
+* [Daniel Friedman. A Schemer's View of Monads](/schemersviewofmonads.ps): from
* [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.
+* [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):
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.
+
+* [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.
+
+* Ken Shan [Monads for natural language semantics](http://arxiv.org/abs/cs/0205026v1) (2001) uses reader monad to implement intensionality.
+* Ben-Avi and Winter [A modular approach to intensionality](http://parles.upf.es/glif/pub/sub11/individual/bena_wint.pdf) (2007) reinvents the technique.
+
+* Monsters and context-shifting, e.g. Gillies/von Fintel on "ifs" [not sure which paper]
+
## Monads in Category Theory ##
@@ -182,6 +193,16 @@ invited talk, *19'th Symposium on Principles of Programming Languages*, ACM Pres
* [A Partial Ordering of some Category Theory applied to Haskell](http://blog.sigfpe.com/2010/03/partial-ordering-of-some-category.html)
+## 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)
+
+
## Continuations ##
* [[!wikipedia Continuation]]
@@ -195,7 +216,8 @@ invited talk, *19'th Symposium on Principles of Programming Languages*, ACM Pres
* [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
@@ -213,6 +235,13 @@ invited talk, *19'th Symposium on Principles of Programming Languages*, ACM Pres
* [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]]