Def bi-tree(T;to;from)
Def == bi-graph(T;to;from)
Def == & (i,j:|T|.
Def == & (p:Edge(T) List. 
Def == & (lconnects(p;i;j) & (q:Edge(T) List. lconnects(q;i;j)  q = p))
Def == & (L:|T| List. i:|T|. (i  L))
Def == & |T|

is mentioned

In prior sections: mb event system 7

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html