is implemented using regular, non-mutual recursion, like this (`u` is a variable not occurring free in `A`, `B`, or `C`):
- let rec u g x = (let f = u g in A)
+ let rec u g x = (let f = u g in A)
in let rec g y = (let f = u g in B)
- in let f = u g in C
+ in let f = u g in
+ C
or, expanded into the form we've been working with:
let u = Y (\u g x. (\f. A) (u g)) in
- let g = Y (\g y. (\f. B) (u g)) in
- let f = u g
+ let g = Y ( \g y. (\f. B) (u g)) in
+ let f = u g in
+ C
+* Here's the same strategy extended to three mutually-recursive functions. `f`, `g` and `h`:
+
+ let u = Y (\u g h x. (\f. A) (u g h)) in
+ let w = Y ( \w h x. (\g. (\f. B) (u g h)) (w h)) in
+ let h = Y ( \h x. (\g. (\f. C) (u g h)) (w h)) in
+ let g = w h in
+ let f = u g h in
+ D