5.
x:Top. primrec(n-1;x;f) ~ list_accum(i,y.f(y,i);x;upto(0;n-1))6. x: Top
7. primrec(n-1;x;f) ~ list_accum(i,y.f(y,i);x;upto(0;n-1))
8.
n = 0
(f(n-1,primrec(n-1;x;f))) ~ list_accum(i,y.f(y,i);x;upto(0;n))
f,x:Top. primrec(n-1;x;f) ~ list_accum(i,y.f(y,i);x;upto(0;n-1))
f,x:Top. primrec(n;x;f) ~ list_accum(i,y.f(y,i);x;upto(0;n))
| 1 | 4. f: Top 5. x:Top. primrec(n-1;x;f) ~ list_accum(i,y.f(y,i);x;upto(0;n-1))6. x: Top 7. primrec(n-1;x;f) ~ list_accum(i,y.f(y,i);x;upto(0;n-1)) 8. n = 0 (f(n-1,primrec(n-1;x;f))) ~ list_accum(i,y.f(y,i);x;upto(0;n)) | 11 steps |
About:
 |  |  |  |  |  |  |  |