(no commit message)

diff --git a/week2.mdwn b/week2.mdwn
index aa4c453..717b594 100644 (file)
--- 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.