Tail calls reuse the current call frame and thus avoid stack overflows in deep recursions.
There is no stack to overflow since the frames are on the heap.
In reply to Re^4: Syntactic sugar for tail call optimizations
by ikegami
in thread Syntactic sugar for tail call optimizations
by LanX
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |