Re: recursion to iteration macro

[Emanuel Berg]

tomas 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.

How do you propose the virtual stack be implemented?

The goal is to have recursion syntax but iteration execution
transparently and seamlessly, other than that we will just
make it as efficient as possible.

-- 
underground experts united
https://dataswamp.org/~incal