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?

>>12
scheme does not provide foldr, and your definition of foldr is not tail recursive, which makes my solution ``better''.
Unless you define a tail-recursive foldr I see no reason why one would prefer your solution.