← Back to context Comment by kubb 5 hours ago You can just compile any tail recursive function to a function with a loop and no recursion. 4 comments kubb Reply 1-more 4 hours ago This is in fact how Elm does it! Tail call recursion compiles to a while loop. srean 3 hours ago That does not address the use case where I find tail recursion most tempting. That would be mutually recursive functions.If the function can be written as an idiomatic loop I probably would do so in the first place. adamwk 4 hours ago [dead]
srean 3 hours ago That does not address the use case where I find tail recursion most tempting. That would be mutually recursive functions.If the function can be written as an idiomatic loop I probably would do so in the first place.
This is in fact how Elm does it! Tail call recursion compiles to a while loop.
That does not address the use case where I find tail recursion most tempting. That would be mutually recursive functions.
If the function can be written as an idiomatic loop I probably would do so in the first place.
[dead]