University
of Washington CSE583 D. Notkin © 2000
90
But its complicated
lTheorem: If there is a normal form for a lambda
expression, then it is unique
There isnt
always a normal form, however
lTheorem: If there is a normal form, then normal-order
reduction will get to it
Applicative-order
reduction might not
l So, it
seems pretty clear that you want to define a functional language in terms of normal-order
reductions, right?