University
of Washington • CSE583 • D. Notkin © 2000
76
Reduction
lApplying b-reduction to both arguments
–lf · lx · (lf · lx · f x) f
((lf · lx · f (f x)) f x)
((lf · lx · f (f x)) f x)
–lf · lx · (lf · lx · f x) f (f (f x))
–lx · (lf · lx · f x) (f (f x))
–lf · lx · f (f (f x))
lWhew, 1 + 2 is 3
–This is much like adding in unary on a Turing machine