University of Washington • CSE583 • D. Notkin
©
2000
78
Defining cond
l
cond
º
l
b
·
l
c
·
l
a
·
b c a
–
cond true 2 1
(
l
b
·
l
c
·
l
a
·
b c a) true 2 1
–
(
l
c
·
l
a
·
true c a) 2 1
–
(
l
a
·
true 2 a) 1
–
true 2 1
–
(
l
t
·
l
f
·
t) 2 1
–
(
l
f
·
2) 1
–
2
l
Of course, we could represent 1 and 2 explicitly as
functions, too