From: Jim Pryor Date: Sat, 18 Sep 2010 19:06:46 +0000 (-0400) Subject: week2 tweaks X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?a=commitdiff_plain;ds=sidebyside;h=ba19207955ab6675d8396fa51af98b19a708a707;hp=-c;p=lambda.git week2 tweaks Signed-off-by: Jim Pryor --- ba19207955ab6675d8396fa51af98b19a708a707 diff --git a/week2.mdwn b/week2.mdwn index 68080c04..ce21d268 100644 --- a/week2.mdwn +++ b/week2.mdwn @@ -45,7 +45,7 @@ Lambda expressions that have no free variables are known as **combinators**. Her > **W** is defined to be: `\f x . f x x`. (So `W f` accepts one argument and gives it to `f` twice. What is the meaning of `W multiply`?) -> **ω** is defined to be: `\x. x x` +> **ω** (that is, lower-case omega) is defined to be: `\x. x x` It's possible to build a logical system equally powerful as the lambda calculus (and readily intertranslatable with it) using just combinators, considered as atomic operations. Such a language doesn't have any variables in it: not just no free variables, but no variables at all.