WhoCites Definitions mb automata 2 Sections GenAutomata Doc

Who Cites sts mng?
sts_mngDef [[sts]] rho == x:{x:SimpleType| x sts }. [[x]] rho
Thm* sts:Collection(SimpleType), rho:Decl. [[sts]] rho Type
st_mng Def [[s]] rho == t_iterate(st_lift(rho);x,y. xy;s)
Thm* rho:Decl, s:SimpleType. [[s]] rho Type
col_member Def x c == c(x)
Thm* T:Type, x:T, c:Collection(T). x c Prop
st Def SimpleType == Tree(Label+Unit)
Thm* SimpleType Type
st_lift Def st_lift(rho)(x) == InjCase(x; x'. rho(x'); a. Top)
Thm* rho:(LabelType). st_lift(rho) (Label+Unit)Type
t_iterate Def t_iterate(l;n;t) == Case(t) Case x;y = > n(t_iterate(l;n;x),t_iterate(l;n;y)) Case tree_leaf(x) = > l(x) Default = > True (recursive)
Thm* E,A:Type, l:(EA), n:(AAA), t:Tree(E). t_iterate(l;n;t) A
lbl Def Label == {p:Pattern| ground_ptn(p) }
Thm* Label Type
tree Def Tree(E) == rec(T.tree_con(E;T))
Thm* E:Type. Tree(E) Type
top Def Top == Void given Void
Thm* Top Type
ground_ptn Def ground_ptn(p) == Case(p) Case ptn_var(v) = > false Case ptn_pr( < x, y > ) = > ground_ptn(x)ground_ptn(y) Default = > true (recursive)
Thm* p:Pattern. ground_ptn(p)
case_default Def Default = > body(value,value) == body
case_tree_leaf Def Case tree_leaf(x) = > body(x) cont(x1,z) == InjCase(x1; x2. body(x2); _. cont(z,z))
case_node Def Case x;y = > body(x;y) cont(x1,z) == InjCase(x1; _. cont(z,z); x2. x2/x3,x2@0. body(x3;x2@0))
case Def Case(value) body == body(value,value)
assert Def b == if b True else False fi
Thm* b:. b Prop
ptn Def Pattern == rec(T.ptn_con(T))
Thm* Pattern Type
tree_con Def tree_con(E;T) == E+(TT)
Thm* E,T:Type. tree_con(E;T) Type
band Def pq == if p q else false fi
Thm* p,q:. (pq)
case_lbl_pair Def Case ptn_pr( < x, y > ) = > body(x;y) cont(x1,z) == InjCase(x1; _. cont(z,z); x2. InjCase(x2; _. cont(z,z); x2@0. InjCase(x2@0; _. cont(z,z); x2@1. x2@1/x3,x2@2. body(x3;x2@2))))
case_ptn_var Def Case ptn_var(x) = > body(x) cont(x1,z) == (x1.inr(x2) = > (x1.inr(x2) = > (x1.inl(x2) = > body(hd([x2 / tl(x1)])) cont(hd(x1),z))([x2 / tl(x1)]) cont(hd(x1),z))([x2 / tl(x1)]) cont(hd(x1),z))([x1])
ptn_con Def ptn_con(T) == Atom++Atom+(TT)
Thm* T:Type. ptn_con(T) Type
hd Def hd(l) == Case of l; nil "?" ; h.t h
Thm* A:Type, l:A List. ||l||1 hd(l) A
Thm* A:Type, l:A List. hd(l) A
tl Def tl(l) == Case of l; nil nil ; h.t t
Thm* A:Type, l:A List. tl(l) A List
case_inl Def inl(x) = > body(x) cont(value,contvalue) == InjCase(value; x. body(x); _. cont(contvalue,contvalue))
case_inr Def inr(x) = > body(x) cont(value,contvalue) == InjCase(value; _. cont(contvalue,contvalue); x. body(x))

Syntax:[[sts]] rho has structure: sts_mng(sts; rho)

About:
spreadproductlistconsconsnil
list_indboolbfalsebtrueifthenelse
assertunitvoidintnatural_numberatomtokenuniondecide
setisectisectlambdaapplyfunction
recursive_def_noticerecuniversemembertoppropimpliesfalse
trueall!abstraction

WhoCites Definitions mb automata 2 Sections GenAutomata Doc