Some definitions of interest.
d-realizes	Def D  Def realizes es.P(es) Def == D':Dsys.  Def == D  D'  (w:World, p:FairFifo. PossibleWorld(D';w)  P(ES(w)))
d-sub	Def D1  D2 == i:Id. M(i)  M(i)
dsys	Def Dsys == IdMsgA
	Thm* Dsys  Type{i'}
Knd	Def Knd == (IdLnkId)+Id
	Thm* Knd  Type
ma-state	Def State(ds) == x:Idds(x)?Top
Id	Def Id == Atom
	Thm* Id  Type
m-sys-at	Def @i: A(j) == if j = i A else  fi
assert	Def b == if b True else False fi
	Thm* b:. b  Prop
es-E	Def E == 1of(es)
es-after	Def (x after e) Def == 1of(2of(2of(2of(2of(2of(2of(2of(2of(2of(2of(es)))))))))))(x,e)
es-first	Def first(e) Def == 1of(2of(2of(2of(2of(2of(2of(2of(2of(2of(2of(2of(2of(2of(2of( Def == 1of(es))))))))))))))) Def == (e)
es-valtype	Def valtype(e) == if isrcv(e) rcvtype(e) else acttype(e) fi
es-kind	Def kind(e) == 1of(2of(2of(2of(2of(2of(2of(2of(es))))))))(e)
es-loc	Def loc(e) == 1of(2of(2of(2of(2of(2of(2of(es)))))))(e)
es-val	Def val(e) == 1of(2of(2of(2of(2of(2of(2of(2of(2of(es)))))))))(e)
es-vartype	Def vartype(i;x) == 1of(2of(2of(es)))(i,x)
es-when	Def (x when e) == 1of(2of(2of(2of(2of(2of(2of(2of(2of(2of(es))))))))))(x,e)
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))
ma-single-pre-init	Def (with ds: ds Def (init: init Def action a:T Def aprecondition a(v) is Def aP) Def == mk-ma(ds; locl(a) : T; init; a : P; ; ; ; )
fpf-single	Def x : v == <[x],x.v>
locl	Def locl(a) == inr(a)
	Thm* a:Id. locl(a)  Knd
not	Def A == A  False
	Thm* A:Prop. (A)  Prop

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