How to call a recursive function without stackoverflow?

[ffevotte]

@uniment

Why not?

There have been numerous discussions on this topic in the past. See for example this one and the references therein:

Does Julia have tail call optimization?

does Julia have tail call optimization ? or does a recursive function always overflow regardless of if you are careful to construct it in that fashion ?

The following thread is also very interesting IMO, in that it discusses the topic from a different point-of-view:

Tail-call optimization and function-barrier -based accumulation in loops

Tail-call optimization/elimination was brought up in several threads like this one in discourse and this one in GitHub. The main interest seems to be purely based on the nice-to-have performance benefit and the core devs seem to be open to the change while assigning very low priority because writing for/while-loop is more idiomatic in Julia. But I think there is another point of view related to function-barrier -based accumulation which makes me wonder if the tail-call optimization actually mak…