From 1f3f3f4cb3dde7a62bc3537a606f4cc7070c04d7 Mon Sep 17 00:00:00 2001
From: Jim <jim.pryor@nyu.edu>
Date: Fri, 20 Feb 2015 08:56:29 -0500
Subject: [PATCH] tweak comment

---
 topics/week3_combinatory_logic.mdwn | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/topics/week3_combinatory_logic.mdwn b/topics/week3_combinatory_logic.mdwn
index 5d8d9dbb..60cb3da1 100644
--- a/topics/week3_combinatory_logic.mdwn
+++ b/topics/week3_combinatory_logic.mdwn
@@ -36,7 +36,7 @@ over the first two arguments.
 
 >   **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`?) <!-- \x. multiply x x ≡ \x. square x -->
 
->   **ω** (that is, lower-case omega) is defined to be: `\x. x x`. Sometimes this combinator is called **M**. It and `W` both duplicate arguments, just in different ways. <!-- L is \uv.u(vv) -->
+>   **ω** (that is, lower-case omega) is defined to be: `\x. x x`. Sometimes this combinator is called **M**. It and `W` both duplicate arguments, just in different ways. <!-- L is \hu.h(uu) -->
 
 
 It's possible to build a logical system equally powerful as the Lambda
-- 
2.11.0