[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: recursion to iteration macro
|
From: |
Emanuel Berg |
|
Subject: |
Re: recursion to iteration macro |
|
Date: |
Sat, 23 Mar 2024 11:17:04 +0100 |
|
User-agent: |
Gnus/5.13 (Gnus v5.13) |
Philip Kaludercic wrote:
> At least for tail-call recursion, named-let will turn
> recursive code into iterative code.
>
> But generally speaking, if you need to accumulate data on
> the stack, then it becomes a lot more difficult.
Why is that so difficult, isn't a stack just a list with
`push' and `pop'?
--
underground experts united
https://dataswamp.org/~incal
- recursion to iteration macro, Emanuel Berg, 2024/03/23
- Re: recursion to iteration macro, Philip Kaludercic, 2024/03/23
- Re: recursion to iteration macro,
Emanuel Berg <=
- Re: recursion to iteration macro, tomas, 2024/03/23
- Re: recursion to iteration macro, Emanuel Berg, 2024/03/23
- Re: recursion to iteration macro, tomas, 2024/03/23
- Re: recursion to iteration macro, Richard Stallman, 2024/03/25
- Re: recursion to iteration macro, tomas, 2024/03/26
- Re: recursion to iteration macro, Richard Stallman, 2024/03/28
- Re: recursion to iteration macro, tomas, 2024/03/29
- Re: recursion to iteration macro, Richard Stallman, 2024/03/30