<strong>Application</strong>: <code>(M N)</code>
</blockquote>
-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:
- x
- (y x)
- (x x)
- (\x y)
- (\x x)
- (\x (\y x))
- (x (\x x))
- ((\x (x x)) (\x (x x)))
+<blockquote><code>
+x<p>
+(y x)<p>
+(x x)<p>
+(\x y)<p>
+(\x x)<p>
+(\x (\y x))<p>
+(x (\x x))<p>
+((\x (x x)) (\x (x x)))<p>
+</code></blockquote>
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