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…

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

tkf September 15, 2019, 1:47am 8

I just find that Guy Steele is discussing something very similar in the first half of this talk:

3 Likes

Simple recursive Fibonaci example. How to make it faster?

Topic		Replies	Views
Tail-call recursion Performance	41	4076	December 15, 2022
[RFC/ANN] FLoops.jl: fast generic for loops (foldl for humans™) Package Announcements	42	8592	April 29, 2020
Huge performance improvement by separating function? General Usage	15	1188	August 27, 2018
Recursive call vs while loop Performance recursion	21	12317	April 12, 2022
Recursive Fibonacci Benchmark using top languages on Github Performance recursion	11	2882	September 29, 2018