From 64ccacaf20339168985b55aec3141bd9ba5c06fa Mon Sep 17 00:00:00 2001 From: barker Date: Sat, 18 Sep 2010 09:38:41 -0400 Subject: [PATCH] --- week2.mdwn | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/week2.mdwn b/week2.mdwn index aa4c453f..717b5943 100644 --- a/week2.mdwn +++ b/week2.mdwn @@ -39,7 +39,7 @@ Lambda expressions that have no free variables are known as **combinators**. Her > **get-second** was our function for extracting the second element of an ordered pair: `\fst snd. snd`. Compare this to our definition of **false**. -> **ω** is defined to be: `\x. x x (\x. x x)` +> **ω** 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. -- 2.11.0