Some definitions of interest.
msga	Def MsgA Def == ds:x:Id fp-> Type Def == da:a:Knd fp-> Type Def == x:Id fp-> ds(x)?Voida:Id fp-> State(ds)ma-valtype(da; locl(a))Prop Def == kx:KndId fp-> State(ds)ma-valtype(da; 1of(kx))ds(2of(kx))?Void Def == kl:KndIdLnk fp-> (tg:Id Def == kl:KndIdLnk fp-> (State(ds)ma-valtype(da; 1of(kl)) Def == kl:KndIdLnk fp-> ((da(rcv(2of(kl); tg))?Void List)) List Def == x:Id fp-> Knd Listltg:IdLnkId fp-> Knd ListTop
	Thm* MsgA  Type{i'}
ma-state	Def State(ds) == x:Idds(x)?Top
Id	Def Id == Atom
	Thm* Id  Type
fpf-cap	Def f(x)?z == if x  dom(f) f(x) else z fi
ma-single-pre-init1	Def ma-single-pre-init1(x;T;c;a;T';y,v.P(y;v)) Def == (with ds: x : T Def == (init: x : c Def == action a:T' Def == aprecondition a(v) is Def == as,v. P(s(x);v))
fpf-single	Def x : v == <[x],x.v>
id-deq	Def IdDeq == product-deq(Atom;;AtomDeq;NatDeq)

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