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

is mentioned by

Def (L) == reduce(A,B. A  B;;L)

[ma-join-list]

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

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