X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=week1.mdwn;h=36ebdfcc6a48bf72288e2023a0186b9c6665de2d;hp=e65919563b4ac23de3d1140d07172f6e9f141f14;hb=fe4f7506b9e2821161136e88eb7d008d951cb666;hpb=7b5614a9122ebf1671f0bf5c7dd5fb35d4c81286

diff --git a/week1.mdwn b/week1.mdwn
index e6591956..36ebdfcc 100644
--- a/week1.mdwn
+++ b/week1.mdwn
@@ -57,7 +57,7 @@ We'll tend to write <code>(&lambda;a M)</code> as just `(\a M)`, so we don't hav
 <strong>Application</strong>: <code>(M N)</code>
 </blockquote>
 
-Some authors reserve the term "term" for just variables and abstracts. We won't participate in that convention; we'll probably just say "term" and "expression" indiscriminately for expressions of any of these three forms.
+Some authors reserve the term "term" for just variables and abstracts. We'll probably just say "term" and "expression" indiscriminately for expressions of any of these three forms.
 
 Examples of expressions:
 
@@ -70,12 +70,11 @@ Examples of expressions:
 	(x (\x x))
 	((\x (x x)) (\x (x x)))
 
-<p>
 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)
+	((\ 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**.