X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=week1.mdwn;h=0207f0ceae92b3e0eafc4513fa279d8007de294e;hp=f09f393d653bc0f8cdc0dbc677a6bbfd04b4e775;hb=6ca041c08f7d5eccc1550af16de405c66fb23139;hpb=5739a5066020a0e9dd46e0299165faadb59fc438

diff --git a/week1.mdwn b/week1.mdwn
index f09f393d..0207f0ce 100644
--- a/week1.mdwn
+++ b/week1.mdwn
@@ -57,8 +57,9 @@ 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.
 
+<div>
 Examples of expressions:
 
 	x
@@ -70,6 +71,8 @@ Examples of expressions:
 	(x (\x x))
 	((\x (x x)) (\x (x x)))
 
+</div>
+
 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: