One thing that’s cool about the Y combinator is that it lets you “overload” recursion with extra stuff. So instead of doing normal recursion, like this: # let rec fac n = if n = 1 then 1 else n * fac (n - 1);; val fac : int -> int = <fun> # fac 12;; - : int = 479001600 You can do this, where you …

A Y combinator you can actually use?

zapashcanon December 4, 2022, 9:47pm 19

Do you have a simple example of how you can use a CPS transform to tail-recursiv-ize a function?

You can find a step by step explanation here.

Topic		Replies	Views
Recursive function Learning	3	596	May 31, 2020
Getting a recursive function to typecheck Learning type-system	3	132	July 3, 2024
What do you do when you have trouble grokking a recursive algorithm? Learning	13	1004	February 6, 2024
How can I use the let in construct to guarantee a function is either forward or tail recursive? Learning	1	873	September 22, 2019
Best approach for implementing open recursion over extensible types Learning recursion , gadt	7	731	September 15, 2024