Some definitions of interest.
Knd	Def Knd == (IdLnkId)+Id
	Thm* Knd  Type
ma-state	Def State(ds) == x:Idds(x)?Top
ma-valtype	Def ma-valtype(da; k) == da(k)?Top
Id	Def Id == Atom
	Thm* Id  Type
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-single	Def x : v == <[x],x.v>
id-deq	Def IdDeq == product-deq(Atom;;AtomDeq;NatDeq)
top	Def Top == Void given Void
	Thm* Top  Type

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