Def ncompose(f;n;x) == if n=0 then x else f(ncompose(f;n-1;x)) fi   (recursive)

is mentioned

In prior sections: hol num hol prim rec

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html