Signed-off-by: Jim Pryor <profjim@jimpryor.net>
x
(y x)
(x x)
- (_x y)
- (_x x)
- (_x (_y x))
- (x (_x x))
- ((_x (x x)) (_x (x x)))
+ (\x y)
+ (\x x)
+ (\x (\y x))
+ (x (\x x))
+ ((\x (x x)) (\x (x x)))
+
+lthough.
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: