Stackless refers to a code implementation that does not use a call stack. Haskell is an example of a stackless language
Stackless refers to a code implementation that does not use a call stack. Haskell is an example of a stackless language
Questions tagged [stackless]
46 questions
0
votes
1 answer
How to eliminate this type of recursion?
This is a bit more intricate than a simple left-recursion or tail-call recursion. So I'm wondering how I can eliminate this kind of recursion. I'm already keeping my own stack as you can see below, so the function needs to no params or return…
metaleap
- 2,132
- 2
- 22
- 40