Revision of 1.3.2 Constructing Procedures Using Lambda from 14 July 2009 - 6:17pm

The revisions let you track differences between multiple versions of a post.

Exercises

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.

Submitted by Visitor on 31 December 2009 - 1:59am.

I believe the pic below the paragraph

“This construct is so useful that there is a special form called let to make its use more convenient. Using let, the f procedure could be written as”

is incorrect because it is identical to the one above.

Submitted by Visitor on 22 December 2010 - 12:36pm.

The code just after the paragraph

“This construct is so useful that there is a special form called let to make its use more convenient. Using let, the f procedure could be written as”

should be this:


(define (f x y)
  (let ((a (+ 1 (* x y)))
        (b (- 1 y)))
    (+ (* x (square a))
       (* y b)
       (* a b))))

Submitted by Visitor on 3 March 2012 - 5:43am.

Nice Website containing full of Language knowledge ,
One of my friend has refered me for this Website

We provide Interpreter work and services in
all languages, for more info CALL US : +91 - 9873019933

Submitted by Visitor on 23 January 2013 - 7:17am.

sell burberry quilted jacket UntKTCXB [URL=http://www.burberryoutlet-online2013.org/ - burberry outlet online[/URL - to take huge discount uIqEjQGd http://www.burberryoutlet-online2013.org/