From 9a4224ba2c49f246262dd164b7a9102c3ad64fd5 Mon Sep 17 00:00:00 2001
From: Jim Pryor
Date: Wed, 15 Sep 2010 21:09:06 0400
Subject: [PATCH] week1: tweaks
Signedoffby: Jim Pryor

week1.mdwn  15 +
1 file changed, 1 insertion(+), 14 deletions()
diff git a/week1.mdwn b/week1.mdwn
index fa1abce4..cacb73fc 100644
 a/week1.mdwn
+++ b/week1.mdwn
@@ 57,20 +57,7 @@ We'll tend to write (λa M)
as just `(\a M)`, so we don't hav
Application: (M N)
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:

 x
 (y x)
 (x x)
 (\x y)
 (\x x)
 (\x (\y x))
 (x (\x x))
 ((\x (x x)) (\x (x x)))

lthough.
+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 **betareduction** or "betacontraction". Suppose you have some expression of the form:

2.11.0