From b6e2ba40d18b2c1efb84e764d0e07d7f97d57319 Mon Sep 17 00:00:00 2001
From: jim <jim@web>
Date: Sat, 7 Feb 2015 13:24:58 -0500
Subject: [PATCH 1/1] add comment

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

diff --git a/topics/week2_lambda_intro.mdwn b/topics/week2_lambda_intro.mdwn
index 3718d317..091e1234 100644
--- a/topics/week2_lambda_intro.mdwn
+++ b/topics/week2_lambda_intro.mdwn
@@ -270,7 +270,7 @@ For some lambda terms, it is easy to see what function they represent:
 simply returns `M`: `((\x x) M) ~~> M`.
 
 > `(\x (x x))` duplicates its argument (applies it to itself):
-`((\x (x x)) M) ~~> (M M)` <!-- **M** or &omega;; W is \uv.uvv -->
+`((\x (x x)) M) ~~> (M M)` <!-- **M** or &omega;; W is \uv.uvv, L is \uv.u(vv) -->
 
 > `(\x (\y (y x)))` reorders its two arguments:
 `(((\x  (\y (y x))) M) N) ~~> (N M)` <!-- **T**; C is \uvx.uxv -->
-- 
2.11.0