Some definitions of interest.
d-feasible	Def d-feasible(D) Def == (i:Id. Feasible(M(i))) Def == & (l:IdLnk, tg:Id. Def == & (M(source(l)).dout(l,tg) r M(destination(l)).din(l,tg)) Def == & (i:Id.  Def == & (finite-type({l:IdLnk Def == & (finite-type({| destination(l) = i & M(source(l)) sends on link l }))
ring-leader1	Def ring-leader1(loc;R;uid;out;in) Def == if R(loc) Def == if [(send-once(loc;;;"send-me";x.x;"vote";out(loc);"me"));  Def == if [(trigger1(loc;;;x,y. x=y;loc;rcv Def == if [((in(loc)); "vote");"leader";"me"));  Def == if [(Dconstant(loc;;uid(loc);"me";loc));  Def == if [ma-single-sends1(; Def == if [ma-single-sends1(; Def == if [ma-single-sends1(; Def == if [ma-single-sends1("me"; Def == if [ma-single-sends1(rcv((in(loc)); "vote"); Def == if [ma-single-sends1((out(loc)); Def == if [ma-single-sends1("vote"; Def == if [ma-single-sends1((a,b. if a<b [b] else nil fi));  Def == if [only [rcv((in(loc)); "vote");  Def == if [only [locl("send-me")] sends on (out(loc) with "vote")] Def == else nil fi
ma-join-list	Def (L) == reduce(A,B. A  B;;L)
ring	Def ring(R;in;out) Def == (i:|R|.  Def == ((R(source(in(i)))) & (R(destination(out(i)))) Def == (& source(out(i)) = i Def == (& & destination(in(i)) = i Def == (& & in(destination(out(i))) = out(i)  IdLnk Def == (& & out(source(in(i))) = in(i)  IdLnk) Def == & (i,j:|R|. k:. x.destination(out(x))^k(i) = j  Id) Def == & |R|
	Thm* R:(Id), in,out:(|R|IdLnk). ring(R;in;out)  Prop
IdLnk	Def IdLnk == IdId
	Thm* IdLnk  Type
rset	Def |R| == {i:Id| (R(i)) }
	Thm* R:(Id). |R|  Type
Id	Def Id == Atom
	Thm* Id  Type
inject	Def Inj(A; B; f) == a1,a2:A. f(a1) = f(a2)  B  a1 = a2
	Thm* A,B:Type, f:(AB). Inj(A; B; f)  Prop
l_member	Def (x  l) == i:. i<||l|| & x = l[i]  T
	Thm* T:Type, x:T, l:T List. (x  l)  Prop
length	Def ||as|| == Case of as; nil  0 ; a.as'  ||as'||+1  (recursive)
	Thm* A:Type, l:A List. ||l||
	Thm* ||nil||
nat	Def  == {i:| 0i }
	Thm*   Type

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