The grammar we gave for the lambda calculus leads to some verbosity. There are several informal conventions in widespread use, which enable the language to be written more compactly. (If you like, you could instead articulate a formal grammar which incorporates these additional conventions. Instead of showing it to you, we'll leave it as an exercise for those so inclined.)
-**Dot notation** Dot means "put a left paren here, and put the right
-paren as far the right as possible without creating unbalanced
-parentheses". So:
+**Parentheses** Outermost parentheses around applications can be dropped. Moreover, applications will associate to the left, so `M N P` will be understood as `((M N) P)`. Finally, you can drop parentheses around abstracts, but not when they're part of an application. So you can abbreviate:
- (\x (\y (x y)))
+ (\x (x y))
-can be abbreviated as:
+as:
- (\x (\y. x y))
+ \x (x y)
+
+but you should include the parentheses in:
+
+ (\x (x y)) z
and:
- (\x (\y. (z y) z))
+ z (\x (x y))
-would abbreviate:
- (\x (\y ((z y) z)))
+**Dot notation** Dot means "put a left paren here, and put the right
+paren as far the right as possible without creating unbalanced
+parentheses". So:
-This on the other hand:
+ \x (\y (x y))
- (\x (\y. z y) z)
+can be abbreviated as:
-would abbreviate:
+ \x (\y. x y)
- (\x (\y (z y)) z)
+and that as:
-**Parentheses** Outermost parentheses around applications can be dropped. Moreover, applications will associate to the left, so `M N P` will be understood as `((M N) P)`. Finally, you can drop parentheses around abstracts, but not when they're part of an application. So you can abbreviate:
+ \x. \y. x y
- (\x. x y)
+This:
-as:
+ \x. \y. (x y) x
- \x. x y
+abbreviates:
-but you should include the parentheses in:
+ \x (\y ((x y) x))
- (\x. x y) z
+This on the other hand:
-and:
+ (\x. \y. (x y)) x
+
+abbreviates:
+
+ ((\x (\y (x y))) x)
- z (\x. x y)
**Merging lambdas** An expression of the form `(\x (\y M))`, or equivalently, `(\x. \y. M)`, can be abbreviated as:
proposed answers to the assignment.
-
+There's also a (slow, bare-bones, but perfectly adequate) version of Scheme available for online use at <http://tryscheme.sourceforge.net/>.
-1. Declarative vs imperatival models of computation.
-2. Variety of ways in which "order can matter."
-3. Variety of meanings for "dynamic."
-4. Schoenfinkel, Curry, Church: a brief history
-5. Functions as "first-class values"
-6. "Curried" functions
-
-1. Beta reduction
-1. Encoding pairs (and triples and ...)
-1. Encoding booleans
-
-
-
-
-