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