X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=week1.mdwn;h=897ef1f8ae37429e35509fd2cd0a8de984c12abc;hp=cacb73fc61c4d49d4b4afa2cf2c4df05d533447e;hb=3a08849b14cc00a2a279acd120f3835414ea1a82;hpb=9a4224ba2c49f246262dd164b7a9102c3ad64fd5

diff --git a/week1.mdwn b/week1.mdwn
index cacb73fc..897ef1f8 100644
--- a/week1.mdwn
+++ b/week1.mdwn
@@ -59,7 +59,18 @@ 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 won't participate in that convention; we'll probably just say "term" and "expression" indiscriminately for expressions of any of these three forms.
 
-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:
+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:
 
 	((\a M) N)