Tail recursion, but modulo cons

Re:Tail recursion, but modulo cons by yawaramin on Monday February 28, 2022 @06:24PM (#30506635)

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

It should ship in version 5.

[ Parent | on HN ]

Re:Tail recursion, but modulo cons by jfmengels1 on Tuesday March 01, 2022 @04:30AM (#30511782)

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)

[ Parent | on HN ]

Re:Tail recursion, but modulo cons by melony on Monday February 28, 2022 @06:30PM (#30506690)

Is this similar to Racket's stack replacement infinite tail recursion mechanism?

[ Parent | on HN ]

Re:Tail recursion, but modulo cons by ska on Monday February 28, 2022 @06:38PM (#30506794)

Isn't that just standard TCO (scheme, unusually, mandates this in the standard)?

[ Parent | on HN ]

Re:Tail recursion, but modulo cons by melony on Monday February 28, 2022 @07:09PM (#30507133)

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

[ Parent | on HN ]