X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=week1.mdwn;h=897ef1f8ae37429e35509fd2cd0a8de984c12abc;hp=48784ca90cd7170c178bdb6a932564a70ebb0624;hb=2a47e1ac75e6278460a516a1eed8650df8c504cb;hpb=16beefe772e4fcf110c58394c16773390c8a4dab diff --git a/week1.mdwn b/week1.mdwn index 48784ca9..897ef1f8 100644 --- a/week1.mdwn +++ b/week1.mdwn @@ -59,11 +59,18 @@ We'll tend to write (λa M) 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. -Samples of expressions:  +Examples of expressions: - foo + 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: +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)