Some definitions of interest.
ma-compat	Def A ||+ B == A || B & ma-frame-compatible(A; B) & ma-sframe-compatible(A; B)
ma-compatible	Def M1 || M2 Def == M1 ||decl M2 Def == & 1of(2of(2of(M1))) || 1of(2of(2of(M2))) Def == & 1of(2of(2of(2of(M1)))) || 1of(2of(2of(2of(M2)))) Def == & 1of(2of(2of(2of(2of(M1))))) || 1of(2of(2of(2of(2of(M2))))) Def == & 1of(2of(2of(2of(2of(2of(M1)))))) || 1of(2of(2of(2of(2of(2of(M2)))))) Def == & 1of(2of(2of(2of(2of(2of(2of(M1))))))) || 1of(2of(2of(2of(2of(2of(2of( Def == & 1of(2of(2of(2of(2of(2of(2of(M1))))))) || 1of(M2))))))) Def == & 1of(2of(2of(2of(2of(2of(2of(2of( Def == & 1of(M1)))))))) || 1of(2of(2of(2of(2of(2of(2of(2of(M2))))))))
ma-empty	Def  == mk-ma(; ; ; ; ; ; ; )
ma-frame-compatible	Def ma-frame-compatible(A; B) Def == kx:(KndId).  Def == (kx  dom(1of(2of(2of(2of(2of(A)))))) Def == ( Def == (2of(kx)  dom(1of(2of(2of(2of(2of(2of(2of(A)))))))) Def == ( Def == (2of(kx)  dom(1of(2of(2of(2of(2of(2of(2of(B)))))))) Def == ( Def == (deq-member(KindDeq;1of(kx);1of(2of(2of(2of(2of(2of(2of( Def == (deq-member(KindDeq;1of(kx);1of(B)))))))(2of(kx)))) Def == & (kx  dom(1of(2of(2of(2of(2of(B)))))) Def == & ( Def == & (2of(kx)  dom(1of(2of(2of(2of(2of(2of(2of(B)))))))) Def == & ( Def == & (2of(kx)  dom(1of(2of(2of(2of(2of(2of(2of(A)))))))) Def == & ( Def == & (deq-member(KindDeq;1of(kx);1of(2of(2of(2of(2of(2of(2of( Def == & (deq-member(KindDeq;1of(kx);1of(A)))))))(2of(kx))))
ma-sframe-compatible	Def ma-sframe-compatible(A; B) Def == kl:(KndIdLnk), tg:Id. Def == (kl  dom(1of(2of(2of(2of(2of(2of(A))))))) Def == ( Def == ((tg  map(p.1of(p);1of(2of(2of(2of(2of(2of(A))))))(kl))) Def == ( Def == (<2of(kl),tg>  dom(1of(2of(2of(2of(2of(2of(2of(2of(A))))))))) Def == ( Def == (<2of(kl),tg>  dom(1of(2of(2of(2of(2of(2of(2of(2of(B))))))))) Def == ( Def == (deq-member(KindDeq;1of(kl);1of(2of(2of(2of(2of(2of(2of(2of( Def == (deq-member(KindDeq;1of(kl);1of(B))))))))(<2of(kl),tg>))) Def == & (kl  dom(1of(2of(2of(2of(2of(2of(B))))))) Def == & ( Def == & ((tg  map(p.1of(p);1of(2of(2of(2of(2of(2of(B))))))(kl))) Def == & ( Def == & (<2of(kl),tg>  dom(1of(2of(2of(2of(2of(2of(2of(2of(B))))))))) Def == & ( Def == & (<2of(kl),tg>  dom(1of(2of(2of(2of(2of(2of(2of(2of(A))))))))) Def == & ( Def == & (deq-member(KindDeq;1of(kl);1of(2of(2of(2of(2of(2of(2of(2of( Def == & (deq-member(KindDeq;1of(kl);1of(A))))))))(<2of(kl),tg>)))
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'}

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