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

diff --git a/week1.mdwn b/week1.mdwn
index 8d1ad0dd..36ebdfcc 100644
--- a/week1.mdwn
+++ b/week1.mdwn
@@ -57,26 +57,24 @@ 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:
 
-<blockquote><code>
-x<p>
-(y x)<p>
-(x x)<p>
-(\x y)<p>
-(\x x)<p>
-(\x (\y x))<p>
-(x (\x x))<p>
-((\x (x x)) (\x (x x)))<p>
-</code></blockquote>
+	x
+	(y x)
+	(x x)
+	(\x y)
+	(\x x)
+	(\x (\y x))
+	(x (\x x))
+	((\x (x x)) (\x (x x)))
 
 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**.