Fold

http://www.haskell.org/haskellwiki/Fold
Haskell has map in terms of 'foldr ((:) . f) []'

How would you implementd foldr, and then map with foldr in scheme/lisp?

(define (map f seq)
  (foldr (lambda (x y) (cons (f x) y)) '() seq))