You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
19 lines
233 B
19 lines
233 B
2 years ago
|
|
||
|
|
Exercise 1.34: Suppose we define the procedure
|
||
|
|
|
||
|
|
|
||
|
|
(define (f g) (g 2))
|
||
|
|
|
||
|
|
Then we have
|
||
|
|
|
||
|
|
|
||
|
|
(f square)
|
||
|
|
4
|
||
|
|
|
||
|
|
(f (lambda (z) (* z (+ z 1))))
|
||
|
|
6
|
||
|
|
|
||
|
|
|
||
|
|
What happens if we (perversely) ask the interpreter to evaluate the combination
|
||
|
|
(f f)? Explain.
|