> Not really. You don't want to recurse down the tail of a list, as in practice that's a great way to overflow the stack. The SICP book had a paragraph on the

> Not really. You don't want to recurse down the tail of a list, as in practice that's a great way to overflow the stack. The SICP book had a paragraph on the distinction before recursive process and recursive procedure. I can't remember which was which, but the point there was that recursive procedure could be an iterative process if it's written with tail recursion in mind, in which case it would not overflow the stack.