(define (foldr f z xs)
(if (null? xs)
z
(f (car xs) (foldr f z (cdr xs)))))(define (map f seq)
(foldr (lambda (x y) (cons (f x) y)) '() seq))
(define (compose f g)
(f (lambda (x) (g x))))(define (compose f g)
(lambda (x) (f (g x))))
(define (compose . l)
(lambda (x)
(define (compose-iter l x)
(if (null? l) x
(compose-iter (cdr l) ((car l) x))))
(compose-iter l x)))> ((compose sqr sub1) 5)
24
(define (compose . l)
(lambda (x)
(foldr (lambda (f x) (f x)) x l)))
((compose sqr sub1) 5)
16
(define (compose . l)
(lambda (x)
(define (compose-iter l x)
(if (null? l) x
(compose-iter (cdr l) ((car l) x))))
(compose-iter (reverse l) x)))foldr, and your definition of foldr is not tail recursive, which makes my solution ``better''.foldr I see no reason why one would prefer your solution.
reverse is tail recursive too)