I don't quite understand what that has to do with the parent commenter's language suggestions. Simple TCO is easy to implement in the compiler level. ReasonML, for example, is quite capable of optimizing the usual recursive fibonacci example into a while loop [1].

[1]: https://reasonml.github.io/en/try.html?rrjsx=true&reason=DYU...