[plt-scheme] Re: guido on tail recursion

The link itself says "similar to lazy functional languages" so yeah,
it is indeed "cons should not evaluate its arguments". (My comment
should've been more specific.) However, their wording is "similar",
which indicates differences as well. Their function notation is
just sugar for their procedure notation that binds variables in
a dataflow thread. Expanding the Map function into their native
procedure notation gives a better idea. In other words, the apparent
laziness seems to come from their dataflow execution model.

.. anyway that is *way* off topic.

On Apr 23, 11:30 pm, Prabhakar Ragde <plra... at uwaterloo.ca> wrote:
> Kumar wrote:
> > 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.
>
> My guess is that this is a "Cons should not evaluate its arguments"
> situation. --PR
> _________________________________________________
>   For list-related administrative tasks:
>  http://list.cs.brown.edu/mailman/listinfo/plt-scheme