X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=offsite_reading.mdwn;h=66e481c5bd2315bc7e1cb0b346d84e28fdddd99b;hp=272b8a14dd4e6d401cda4a551a5a13dc18ac5286;hb=4380b5f17428692754b630209ed9f06b7f549fd6;hpb=b0046b1316f1487979d5dc2cc75ddf8e287c59b3 diff --git a/offsite_reading.mdwn b/offsite_reading.mdwn index 272b8a14..66e481c5 100644 --- a/offsite_reading.mdwn +++ b/offsite_reading.mdwn @@ -14,22 +14,10 @@ of an article you don't fully understand, so that you can discuss it with the re the group and hopefully get to a point where you can read it again and get more out of. (Rinse and repeat.) - -## General issues about variables and binding in programming languages ## - -* [[!wikipedia Variable (programming) desc="Variables"]] -* [[!wikipedia Variable shadowing]] -* [[!wikipedia Scope (programming) desc="Variable scope"]] -* [[!wikipedia Free variables and bound variables]] -* [[!wikipedia Name binding]] -* [[!wikipedia Name resolution]] -* [[!wikipedia Parameter (computer science) desc="Function parameters"]] - -## Functions as values, etc ## +## Functions ## * [[!wikipedia Higher-order function]] * [[!wikipedia First-class function]] -* [[!wikipedia Closure (computer science) desc="Closures"]] * [[!wikipedia Currying]] ## Functional vs imperative programming ## @@ -40,29 +28,55 @@ get more out of. (Rinse and repeat.) * [[!wikipedia Referential transparency (computer science)]] * [[!wikipedia Imperative programming]] +## General issues about variables and scope in programming languages ## + +* [[!wikipedia Variable (programming) desc="Variables"]] +* [[!wikipedia Free variables and bound variables]] +* [[!wikipedia Variable shadowing]] +* [[!wikipedia Name binding]] +* [[!wikipedia Name resolution]] +* [[!wikipedia Parameter (computer science) desc="Function parameters"]] +* [[!wikipedia Scope (programming) desc="Variable scope"]] +* [[!wikipedia Closure (computer science) desc="Closures"]] + +##[[Learning Scheme]]## + +* [Try Scheme in your web browser](http://tryscheme.sourceforge.net/) + ## Untyped lambda calculus and combinatory logic ## * [[!wikipedia Lambda calculus]] -* [Chris Barker's Lambda Tutorial](http://homepages.nyu.edu/~cb125/Lambda) -* [Lambda Animator](http://thyer.name/lambda-animator/)

* [[!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]] * [[!wikipedia B,C,K,W system]] - -* [Chris Barker's Iota and Jot](http://semarch.linguistics.fas.nyu.edu/barker/Iota/) +* Jeroen Fokker, "The Systematic Construction of a One-combinator Basis for Lambda-Terms" Formal Aspects of Computing 4 (1992), pp. 776-780. + +* [Chris Barker's Iota and Jot](http://semarch.linguistics.fas.nyu.edu/barker/Iota/)

+ +* [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 ## + +* [[!wikipedia Evaluation strategy]] +* [[!wikipedia Eager evaluation]] +* [[!wikipedia Lazy evaluation]] +* [[!wikipedia Strict programming language]] + +## Confluence, Normalization, Undecidability ## + * [[!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]] - -##[[Learning Scheme]]## ## Recursion and the Y Combinator ## @@ -76,13 +90,7 @@ 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... - -## Evaluation Order ## - -* [[!wikipedia Evaluation strategy]] -* [[!wikipedia Eager evaluation]] -* [[!wikipedia Lazy evaluation]] -* [[!wikipedia Strict programming language]] +* [The church of the least fixed point, by Sans Pareil](http://www.springerlink.com/content/n4t2v573m58g2755/) ## Types ## @@ -97,12 +105,10 @@ get more out of. (Rinse and repeat.) * [[!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]]## @@ -169,6 +175,12 @@ 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) +## The Curry-Howard Correspondence ## +* 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

+ + ## Continuations ## * [[!wikipedia Continuation]]