Scheme - What is proper tail recursion really mean in r5rs?

Author

What is proper tail recursion really mean in r5rs?

zelzel.zsu@gmail.com

2006-07-21, 4:01 am

What is proper tail recursion really mean in r5rs?

The r5rs said:
"""
A Scheme implementation is properly tail-recursive if it supports an
unbounded
number of active tail calls.
"""

But it was not very clear.

Can anyone explain it in detail or perhaps give me an example please?
thanks.

Jens Axel Søgaard

2006-07-21, 8:01 am

zelzel.zsu@gmail.com wrote:
> What is proper tail recursion really mean in r5rs?
>
> The r5rs said:
> """
> A Scheme implementation is properly tail-recursive if it supports an
> unbounded
> number of active tail calls.
> """
>
> But it was not very clear.
>
> Can anyone explain it in detail or perhaps give me an example please?

Try reading these explanations:

<http://mitpress.mit.edu/sicp/full-t....html#%_sec_1.2>
<http://www.scheme.com/tspl3/further.html#./further:s43>

Then return to:

<http://www.schemers.org/Documents/S....html#%_sec_3.5>

--
Jens Axel Søgaard

Matthias Blume

2006-07-21, 7:02 pm

Jens Axel Søgaard <usenet@soegaard.net> writes:

> zelzel.zsu@gmail.com wrote:
>

[...]

> Then return to:
>
> <http://www.schemers.org/Documents/S....html#%_sec_3.5>

The characterization of being properly tail-recursive given in r5rs is
useless. You will have to look up reference [8] to get something that
actually has meaning.

Matthias

Sponsored Links