Def bif(b; bx.x(bx); by.y(by)) == if b x(*) else y(x.x) fi

is mentioned by

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

[ncompose]

In prior sections: hol bool

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