X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=week1.mdwn;h=5c596c78587a6324db858d5022136c5b81a35953;hp=48bc6b593f8b5ff11f8e2f966f9eb6580704cb1d;hb=c1a371c8bd84f3ee2d03c10b3aa622f45eea5461;hpb=6c49eb332507fd00c786264c48cf519cb150b8b5 diff --git a/week1.mdwn b/week1.mdwn index 48bc6b59..5c596c78 100644 --- a/week1.mdwn +++ b/week1.mdwn @@ -57,7 +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. +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: @@ -70,7 +70,8 @@ Examples of expressions: (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)