Problem 1: Evaluation
The usual: type of expression, guess the value, then evaluate.
(lambda (x y z) x)
((lambda (x y) (+ x y)) 4 (+ 3 4))
((lambda (happy tiger) (if (= tiger 4) (+ happy tiger) happy))
4 5)
((lambda (wow this works) (wow this works))
- 7 5)
((lambda (wow this works) (works wow this))
7 - 5)
((if (= 4 5)
(lambda (x) (+ x 3))
(lambda (x) (+ x 5)))
7)
(define x 2)
((lambda (x) (+ x x)) 5)
((lambda (yummy) (* yummy yummy)) 5)
yummy
Problem 2: Writing Procedures
For each problem, write the specified procedure while obeying the given constraints on what primitive
procedures are available. Additionally, test the procedure with a couple of inputs and include these test
cases and their results in your submission to demonstrate that your procedure works.
1. If you didn't finish problem 2 in the lecture handout, do so (through positive-root).
2. Write two procedures that use the following definitions to convert days into minutes and minutes
into days:
Docsity.com
