[plt-scheme] Re: guido on tail recursion

I'm surprised that he'd push the absence of tail call elimination
as a design feature and something that expresses a broad programming
philosophy. The Mozart/Oz folks OTOH give an implementation of map
that looks like it isn't tail recursive and yet runs in constant
stack! I'm still digesting that one. (http://www.mozart-oz.org/home/
doc/tutorial/node6.html)

... and the thing is tail _recursion_ is just the corner of the TCE
sky.

-Kumar

On Apr 23, 12:01 pm, Dimitris Vyzovitis <v... at media.mit.edu> wrote:
> http://neopythonic.blogspot.com/2009/04/tail-recursion-elimination.html
>
> "I don't believe in recursion as the basis of all programming. This is a
> fundamental belief of certain computer scientists, especially those who
> love Scheme and like to teach programming by starting with a "cons" cell
> and recursion. But to me, seeing recursion as the basis of everything else
> is just a nice theoretical approach to fundamental mathematics (turtles
> all the way down), not a day-to-day tool.
> "
>
> Ahem.
>
> -- vyzo
> _________________________________________________
>   For list-related administrative tasks:
>  http://list.cs.brown.edu/mailman/listinfo/plt-scheme