Some definitions of interest.
dsys	Def Dsys == IdMsgA
	Thm* Dsys  Type{i'}
ma-decla	Def a declared in M == locl(a)  dom(1of(2of(M)))
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-valtype	Def ma-valtype(da; k) == da(k)?Top
Kind-deq	Def KindDeq == union-deq(IdLnkId;Id;product-deq(IdLnk;Id;IdLnkDeq;IdDeq);IdDeq)
Knd	Def Knd == (IdLnkId)+Id
	Thm* Knd  Type
IdLnk	Def IdLnk == IdId
	Thm* IdLnk  Type
ma-state	Def State(ds) == x:Idds(x)?Top
Id	Def Id == Atom
	Thm* Id  Type
id-deq	Def IdDeq == product-deq(Atom;;AtomDeq;NatDeq)
assert	Def b == if b True else False fi
	Thm* b:. b  Prop
d-m	Def M(i) == D(i)
decidable	Def Dec(P) == P  P
	Thm* A:Prop. Dec(A)  Prop
fpf	Def a:A fp-> B(a) == d:A Lista:{a:A| (a  d) }B(a)
	Thm* A:Type, B:(AType). a:A fp-> B(a)  Type
fpf-cap	Def f(x)?z == if x  dom(f) f(x) else z fi
fpf-dom	Def x  dom(f) == deq-member(eq;x;1of(f))
locl	Def locl(a) == inr(a)
	Thm* a:Id. locl(a)  Knd
pi1	Def 1of(t) == t.1
	Thm* A:Type, B:(AType), p:(a:AB(a)). 1of(p)  A
pi2	Def 2of(t) == t.2
	Thm* A:Type, B:(AType), p:(a:AB(a)). 2of(p)  B(1of(p))
rcv	Def rcv(l; tg) == inl(<l,tg>)
	Thm* l:IdLnk, tg:Id. rcv(l; tg)  Knd
top	Def Top == Void given Void
	Thm* Top  Type

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