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:MsgA List. ma-is-empty((L))  reduce(M,x. ma-is-empty(M) & x;True;L)	[assert-ma-join-list-is-empty]
Thm* L:MsgA List. ma-is-empty((L)) ~ reduce(M,x. ma-is-empty(M)x;true;L)	[ma-join-list-is-empty]

In prior sections: mb list 2 list 1 mb list 1 mb event system 1 mb event system 2 mb event system 4

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