>>45
Loops are more explicit, easier to understand, and are always inline (like they should be; they have practically 0 overhead and calling a function that just loops, which is what a map is doing, is needless overcomplication.)
You must have never written, studied or even read about Lisp compilers. Have you heard of tail-call optimization? Do you know what that is? Do you know what it means? Do you know how it's implemented? Go ahead and write an infinite recursive loop in Scheme. Run it. Wait for it to run out of stack. I'll wait...
What's that? Still running? No overflow? Now if you're such an expert on machine architecture, please explain to me how TCO is possible if the interpreter keeps making function calls. The mapper function can be inlined too, especially if it's a lambda or compound procedure.
Why don't you try using a Lisp compiler and studying it's output before demonstrating to everybody here that you don't know what the fuck you're talking about.