X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=week1.mdwn;h=897ef1f8ae37429e35509fd2cd0a8de984c12abc;hp=5c596c78587a6324db858d5022136c5b81a35953;hb=2a47e1ac75e6278460a516a1eed8650df8c504cb;hpb=84acc7f9a8742c9392478f96be04d3be827be696

diff --git a/week1.mdwn b/week1.mdwn
index 5c596c78..897ef1f8 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 won't participate in that convention; we'll probably just say "term" and "expression" indiscriminately for expressions of any of these three forms.
 
 Examples of expressions:
 
@@ -70,8 +70,6 @@ Examples of expressions:
 	(x (\x x))
 	((\x (x x)) (\x (x x)))
 
->	&nbsp;
-
 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)