3 ms·
How is it difficult to prove if a recursive call is tail-recursive or not? If it's tail-recursive and your language supports tail-call optimisation then you pro
by tigershark 9y ago
How is it difficult to prove if a recursive call is tail-recursive or not?
If it's tail-recursive and your language supports tail-call optimisation then you proved that there will be no stack blow-up.
- AstralStorm 9y agoFor simple calls, not. For something more involved? (Dependent functions, corecursion, partially stateful code.) Very which is why compilers fail to optimize it in general.