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

is mentioned by

Def simp_rec == x:'a. f:'a'a. n:. ncompose(f;n;x)

[hsimp_rec]

In prior sections: hol num

Try larger context: HOLlib IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html