| Who Cites term? |
|
term |
Def Term == Tree(ts()) |
| | Thm* Term Type |
|
ts |
Def ts() == Label+Label+Label+Label+Label |
| | Thm* ts() Type |
|
lbl |
Def Label == {p:Pattern| ground_ptn(p) } |
| | Thm* Label Type |
|
niltrace |
Def niltrace() == mk_trace_env(nil, P,k. false ) |
| | Thm* d:Decl. niltrace() trace_env(d) |
|
mk_trace_env |
Def mk_trace_env(trace, proj) == < trace,proj > |
| | Thm* d:Decl, trace:( d) List, proj:(Label Label  ). mk_trace_env(trace, proj) trace_env(d) |
|
term_mng |
Def [[t]] e s a tr
== iterate(statevar x- > s.x
statevar x'- > s.x
funsymbol f- > e.f
freevar x- > a
trace(P)- > tr.P
x(y)- > x(y)
over t) |
|
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)  |
|
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 |
Def Tree(E) == rec(T.tree_con(E;T)) |
| |
Thm* E:Type. Tree(E) Type |
|
tproj |
Def tre.P == tre.trace | tre.proj(P) |
| | Thm* d:Decl, tre:trace_env(d), P:Label. tre.P ( d) List |
|
r_select |
Def r.l == r(l) |
| | Thm* d:Decl, r:{d}, l:Label. r.l d(l) |
|
case_default |
Def Default = > body(value,value) == body |
|
band |
Def p q == if p q else false fi |
| | Thm* p,q: . (p q)  |
|
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]) |
|
case |
Def Case(value) body == body(value,value) |
|
ptn_con |
Def ptn_con(T) == Atom+ +Atom+(T T) |
| | Thm* T:Type. ptn_con(T) Type |
|
tree_con |
Def tree_con(E;T) == E+(T T) |
| | Thm* E,T:Type. tree_con(E;T) Type |
|
trace_env_proj |
Def t.proj == 2of(t) |
| |
Thm* d:Decl, t:trace_env(d). t.proj Label Label   |
|
trace_env_trace |
Def t.trace == 1of(t) |
| |
Thm* d:Decl, t:trace_env(d). t.trace ( d) List |
|
trace_projection |
Def tr | P == filter( x.P(kind(x));tr) |
| | Thm* d:Decl, tr:( d) List, P:(Label  ). tr | P ( d) List |
|
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)) |
|
pi2 |
Def 2of(t) == t.2 |
| |
Thm* A:Type, B:(A Type), p:(a:A B(a)). 2of(p) B(1of(p)) |
|
kind |
Def kind(a) == 1of(a) |
| | Thm* d:Decl, a:( d). kind(a) Label |
| | Thm* M:sm{i:l}(), a:M.action. kind(a) Label & kind(a) Pattern |
|
pi1 |
Def 1of(t) == t.1 |
| | Thm* A:Type, B:(A Type), p:(a:A B(a)). 1of(p) A |
|
filter |
Def filter(P;l) == reduce( a,v. if P(a) [a / v] else v fi;nil;l) |
| | Thm* T:Type, P:(T  ), l:T List. filter(P;l) T List |
|
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:(A B B), k:B, as:A List. reduce(f;k;as) B |