week1: fix markup processing?

Signed-off-by: Jim Pryor <profjim@jimpryor.net>

diff --git a/week1.mdwn b/week1.mdwn
index 9ee159a..8484b17 100644 (file)
--- a/week1.mdwn
+++ b/week1.mdwn
@@ -76,7 +76,7 @@ The lambda calculus has an associated proof theory. For now, we can regard the
 proof theory as having just one rule, called the rule of **beta-reduction** or
 "beta-contraction". Suppose you have some expression of the form:
 
-       ((\a M) N)
+       ((lambda a M) N)
 
 that is, an application of an abstract to some other expression. This compound form is called a **redex**, meaning it's a "beta-reducible expression." `(\a M)` is called the **head** of the redex; `N` is called the **argument**, and `M` is called the **body**.