[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: recursion to iteration macro
From: |
tomas |
Subject: |
Re: recursion to iteration macro |
Date: |
Sat, 23 Mar 2024 11:30:20 +0100 |
On Sat, Mar 23, 2024 at 11:17:04AM +0100, Emanuel Berg wrote:
> 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'?
Only usually *much* more efficient.
Cheers
--
t
signature.asc
Description: PGP signature
- 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, 2024/03/23
- Re: recursion to iteration macro,
tomas <=
- 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