| Who Cites tagged-messages? |
|
tagged-messages | Def tagged-messages(l;s;v;L) == map( x.<l,x>;tagged-list-messages(s;v;L)) |
|
tagged-list-messages | Def tagged-list-messages(s;v;L)
Def == concat(map( tgf.map( x.<1of(tgf),x>;2of(tgf)(s,v));L)) |
|
map | Def map(f;as) == Case of as; nil nil ; a.as' [(f(a)) / map(f;as')]
Def (recursive) |
| | Thm* A,B:Type, f:(A B), l:A List. map(f;l) B List |
| | Thm* A,B:Type, f:(A B), l:A List . map(f;l) B List |
|
pi2 | Def 2of(t) == t.2 |
| | Thm* A:Type, B:(A Type), p:(a:A B(a)). 2of(p) B(1of(p)) |
|
pi1 | Def 1of(t) == t.1 |
| | Thm* A:Type, B:(A Type), p:(a:A B(a)). 1of(p) A |
|
concat | Def concat(ll) == reduce( l,l'. l @ l';nil;ll) |
| | Thm* T:Type, ll:(T List) List. concat(ll) T List |
|
append | Def as @ bs == Case of as; nil bs ; a.as' [a / (as' @ bs)] (recursive) |
| | Thm* T:Type, as,bs:T List. (as @ bs) T List |
|
reduce | Def reduce(f;k;as) == Case of as; nil k ; a.as' f(a,reduce(f;k;as'))
Def (recursive) |
| | Thm* A,B:Type, f:(A B B), k:B, as:A List. reduce(f;k;as) B |