3 ms·

Just as a point of reference, OCaml recently landed TRMC into the core compiler: https://github.com/ocaml/ocaml/pull/9760 https://github.com/ocaml/ocaml/pull/97

Just as a point of reference, OCaml recently landed TRMC into the core compiler: https://github.com/ocaml/ocaml/pull/9760 https://github.com/ocaml/ocaml/pull/9760 It should ship in version 5.

melony 5y ago
Is this similar to Racket's stack replacement infinite tail recursion mechanism?
- ska 5y ago
  Isn't that just standard TCO (scheme, unusually, mandates this in the standard)?
  - melony 5y ago
    No, Racket's work for non tail call recursion too. The standard recursive factorial won't overflow in Racket. According to: https://news.ycombinator.com/item?id=30420605 https://news.ycombinator.com/item?id=30420605
jfmengels1 5y ago
Indeed, though from a conversation with the author, it's only implemented for a subset of what was described in the post, specifically only for data construction. (Conversation: https://twitter.com/let_def/status/1485313834764095488 https://twitter.com/let_def/status/1485313834764095488)