Re:How Tail Call Optimization Works
by manwe150 on Friday January 08, 2021 @02:39AM
(#25682514)
Consider that some processors were too small to fit a stack. Some languages (notably BASIC), only had what you might call 'static' variables (to use the C name), so when you recursed into them, the variables would be shared across all calls to that function.
[ Parent
| on HN ]
Re:How Tail Call Optimization Works
by eyelidlessness on Friday January 08, 2021 @02:45AM
(#25682548)
And that’s a good case for supporting recursion but eliminating branching! You can goto and rebind to your heart’s content as long as you don’t have to back out of a condition