+* [[!wikipedia Church encoding]] * [[!wikipedia Combinatory logic]] -* [[!wikipedia B,C,K,W system]] +* [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]] +* 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/)

-* [[!wikipedia Church-Rosser theorem]] -* [[!wikipedia Normalization property]] -* [[!wikipedia Turing completeness]] - -* [[!wikipedia Church encoding]] -* [[!wikipedia Y combinator]] +* [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. -* [[!wikipedia Curry-Howard isomorphism]] +## 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 + + +## 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 Why of Y](http://www.dreamsongs.com/NewFiles/WhyOfY.pdf) +* [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) 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/) + + ## Types ## +* [[!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 +* [[!wikipedia Type polymorphism]] +* [[!wikipedia System F]] +

+ ## Continuations ## * [[!wikipedia Continuation]] * [[!wikipedia Continuation-passing style]] -* [[!wikipedia Call-with-current-continuation]] +* [[!wikipedia Call-with-current-continuation]] +* [Intro to call/cc](http://community.schemewiki.org/?call-with-current-continuation) at SchemeWiki +* [Call With Current Continuation](http://www.c2.com/cgi/wiki?CallWithCurrentContinuation) +* [Continuations Made Simple and Illustrated](http://www.ps.uni-saarland.de/~duchier/python/continuations.html) +* [Continuation kata](http://programming-musings.org/2006/02/12/continuation-kata/) +* [Understanding continuations](http://keithdevens.com/weblog/archive/2004/Jul/11/continuations) [Commentary](http://lambda-the-ultimate.org/node/86) +* [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)

* [[!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 +* [shift, reset and streams](http://chneukirchen.org/blog/archive/2005/04/shift-reset-and-streams.html) +* [guile and delimited continuations](http://www.wingolog.org/archives/2010/02/26/guile-and-delimited-continuations) +* [Delimited continuations in Scala](http://blog.richdougherty.com/2009/02/delimited-continuations-in-scala_24.html) +* [Delimited Continuations Explained (in Scala)](http://dcsobral.blogspot.com/2009/07/delimited-continuations-explained-in.html) +* [Partial Continuations](http://www.bluishcoder.co.nz/articles/scheme/partial-continuations.html) +* Delimited Continuations in MzScheme: +[Part 1](http://schemekeys.blogspot.com/2006/11/prompts-their-interaction-with-dynamic.html) +[Part 2](http://schemekeys.blogspot.com/2006/12/delimited-continuations-in-mzscheme.html) +[Part 3](http://schemekeys.blogspot.com/2007/01/going-further-with-primitives.html) +[Part 4](http://schemekeys.blogspot.com/2007/01/odd-and-ends.html)

+* [Online Bibliography of Scheme Research: Continuations and Continuation Passing Style](http://library.readscheme.org/page6.html) +* [Delimited continuations in natural language semantics](http://okmij.org/ftp/gengo/) -## Monads ## - -* [[!wikipedia Monad (functional programming)]] ## Linear Logic ##