X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=week1.mdwn;h=e7061a81fb07747bebde43e1709d976d4a8b10ce;hp=f449ed49e8663878d519af2e55ddea82fd44603a;hb=2b16a9953de04222b4a05a4cfee4d0c12c3c7fc9;hpb=2d31fef8de720442af29e2e21a0a9007871ed6aa diff --git a/week1.mdwn b/week1.mdwn index f449ed49..e7061a81 100644 --- a/week1.mdwn +++ b/week1.mdwn @@ -57,18 +57,11 @@ 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: +Samples of expressions: - x - (y x) - (x x) - (\x y) - (\x x) - (\x (\y x)) - (x (\x x)) - ((\x (x x)) (\x (x x))) + foo 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: