Def reduce(f;k;as) == Case of as; nil  k ; a.as'  f(a,reduce(f;k;as'))
Def (recursive)

is mentioned by

Thm* L:T List, P:(T). (xL.P(x))  reduce(x,y. P(x)y;true;L)	[l_all_reduce]
Def compose_list(L) == reduce(p,q. p o q;x.x;L)	[compose_list]

In prior sections: list 1 mb list 1

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