Some definitions of interest.
ma-ef	Def M.ef(k,x,s,v,w) Def == E != 1of(2of(2of(2of(2of(M)))))(<k,x>) ==> w = E(s,v)  M.ds(x)
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'}
Knd	Def Knd == (IdLnkId)+Id
	Thm* Knd  Type
ma-da	Def M.da(a) == 1of(2of(M))(a)?Top
ma-st	Def M.state == State(1of(M))
Id	Def Id == Atom
	Thm* Id  Type
ma-ds	Def M.ds(x) == 1of(M)(x)?Top

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