X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?a=blobdiff_plain;ds=sidebyside;f=week1.mdwn;h=67dce382b4e6536cc1cdf318bd606e7c68ceb18c;hb=180b5fcb23d05c1f7ea98d02517dc3d697ce111d;hp=801ae6984609be27b76abc8ca7f378fc93020dc6;hpb=787216b36925c3757985a48ced39d6eee1ee5392;p=lambda.git

diff --git a/week1.mdwn b/week1.mdwn
index 801ae698..67dce382 100644
--- a/week1.mdwn
+++ b/week1.mdwn
@@ -59,7 +59,6 @@ We'll tend to write <code>(&lambda;a M)</code> as just `(\a M)`, so we don't hav
 
 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,7 +69,6 @@ Examples of expressions:
 	(\x (\y x))
 	(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
@@ -605,7 +603,6 @@ Here's how it looks to say the same thing in various of these languages.
 
 	It's easy to be lulled into thinking this is a kind of imperative construction. *But it's not!* It's really just a shorthand for the compound "let"-expressions we've already been looking at, taking the maximum syntactically permissible scope. (Compare the "dot" convention in the lambda calculus, discussed above.)
 
-
 9.	Some shorthand
 
 	OCaml permits you to abbreviate:
@@ -676,12 +673,15 @@ Here's how it looks to say the same thing in various of these languages.
 
 	and there's no more mutation going on there than there is in:
 
+<!--
+
 	<pre>
 	<code>&forall;x. (F x or &forall;x (not (F x)))</code>
 	</pre>
 
 	When a previously-bound variable is rebound in the way we see here, that's called **shadowing**: the outer binding is shadowed during the scope of the inner binding.
 
+-->
 
 Some more comparisons between Scheme and OCaml
 ----------------------------------------------