## Scheme and OCaml ##
+* [An Introduction to Lambda Calculus and Scheme](http://www.jetcafe.org/~jim/lambda.html) -- aimed at programmers
* [[!wikipedia Scheme (programming language)]]
* [[!wikipedia Objective Caml]]
* [[!wikipedia Moses Schönfinkel]]
* [[!wikipedia Alonzo Church]]<p>
* [[!wikipedia Combinatory logic]]
+* [Combinatory logic](http://plato.stanford.edu/entries/logic-combinatory/) at the Stanford Encyclopedia of Philosophy
* [[!wikipedia B,C,K,W system]]
* [[!wikipedia SKI combinatory calculus]]<p>
* [[!wikipedia Church-Rosser theorem]]
* [[!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
* [[!wikipedia Type polymorphism]]
* [[!wikipedia System F]]
* [[!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
* [[!wikipedia Delimited continuation]]
+* [Delimited/composable continuations tutorial](composable-continuations-tutorial) at SchemeWiki
## Monads ##