Update note in manual demo of iteration-to-recursion conversion.
Chris Pressey
4 months ago
7 | 7 | // in the generating case we exploit the fact that `n` must |
8 | 8 | // already be known. |
9 | 9 | // |
10 | // So this avoids some of the pitfalls of the other attempts | |
11 | // to expand iteration into recursion. It remains to be seen | |
12 | // how well this can be automatically applied though. | |
10 | // This trasformation avoids some of the pitfalls of the other | |
11 | // attempts to convert iteration into recursion, and it has been | |
12 | // implemented in the reference implementation of Fountain. | |
13 | 13 | |
14 | 14 | Goal<n> ::= <. a = 0 .> Loop0<a, n> |
15 | 15 | <. b = 0 .> Loop1<b, n> |