X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=week1.mdwn;h=cacb73fc61c4d49d4b4afa2cf2c4df05d533447e;hp=fa1abce41be7d0266b907aaa981967797b4991a0;hb=4400e0ff673a6a5d642da62977098a5ce777e8e9;hpb=f6bd2e9e39e9ed2f0b752258a5562492da2f0159 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 **beta-reduction** or "beta-contraction". Suppose you have some expression of the form: