week1: fix markup processing?

Signed-off-by: Jim Pryor <profjim@jimpryor.net>

diff --git a/test2.mdwn b/test2.mdwn
new file mode 100644 (file)
index 0000000..be55fef
--- /dev/null
+++ b/test2.mdwn
@@ -0,0 +1,17 @@
+
+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:
+
+       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:

diff --git a/week1.mdwn b/week1.mdwn
index b5a67fa..36ebdfc 100644 (file)
--- a/week1.mdwn
+++ b/week1.mdwn
@@ -59,9 +59,16 @@ 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.
 
 
 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:
+Examples of expressions:

 
        x
 
        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
 
 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