| | Who Cites sig mng? |
|
| sig_mng | Def [[s]] rho == <  op.[[s.fun(op)]] rho,R.[[s.rel(R)]] rho > |
| | | Thm*  s:sig(), rho:Decl{i}. sig_mng{i:l}(s; rho)  Decl{i} Decl{i'} |
|
| sig_rel | Def t.rel == 2of(t) |
| | | Thm* t:sig(). t.rel Label  (SimpleType List) |
|
| st_list_mng | Def [[l]] rho == reduce(s,m. [[s]] rhom;Prop;l) |
| | | Thm* l:SimpleType List, rho:Decl{i}. [[l]] rho{i} Type{i'} |
|
| sig_fun | Def t.fun == 1of(t) |
| | | Thm* t:sig(). t.fun LabelSimpleType |
|
| st_mng | Def [[s]] rho == t_iterate(st_lift(rho);x,y. xy;s) |
| | | Thm* rho:Decl, s:SimpleType. [[s]] rho Type |
|
| pi2 | Def 2of(t) == t.2 |
| | | Thm* A:Type, B:(AType), p:(a:AB(a)). 2of(p) B(1of(p)) |
|
| reduce | Def reduce(f;k;as) == Case of as; nil  k ; a.as' f(a,reduce(f;k;as')) (recursive) |
| | | Thm* A,B:Type, f:(ABB), k:B, as:A List. reduce(f;k;as) B |
|
| pi1 | Def 1of(t) == t.1 |
| | | Thm* A:Type, B:(AType), p:(a:AB(a)). 1of(p) A |
|
| 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 |
|
| top | Def Top == Void given Void |
| | | Thm* Top Type |
|
| 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) |
