| Some definitions of interest. |
|
es-le | Def e e' == (e <loc e') e = e' E |
|
event_system | Def ES
Def == E:Type
Def == EqDecider(E) (T:Id Id Type
Def == EqDecider(E) ( V:Id Id Type
Def == EqDecider(E) ( M:IdLnk Id Type
Def == EqDecider(E) ( Top (loc:E Id
Def == EqDecider(E) ( Top ( kind:E Knd
Def == EqDecider(E) ( Top ( val:(e:E eventtype(kind;loc;V;M;e))
Def == EqDecider(E) ( Top ( when:(x:Id e:E T(loc(e),x))
Def == EqDecider(E) ( Top ( after:(x:Id e:E T(loc(e),x))
Def == EqDecider(E) ( Top ( sends:(l:IdLnk E (Msg_sub(l; M) List))
Def == EqDecider(E) ( Top ( sender:{e:E| isrcv(kind(e)) } E
Def == EqDecider(E) ( Top ( index:(e:{e:E| isrcv(kind(e)) }  ||sends
Def == EqDecider(E) ( Top ( index:(e:{e:E| isrcv(kind(e)) }  ||(lnk(kind(e))
Def == EqDecider(E) ( Top ( index:(e:{e:E| isrcv(kind(e)) }  ||,sender(e))||)
Def == EqDecider(E) ( Top ( first:E 
Def == EqDecider(E) ( Top ( pred:{e':E|  (first(e')) } E
Def == EqDecider(E) ( Top ( causl:E E Prop
Def == EqDecider(E) ( Top ( ESAxioms{i:l}
Def == EqDecider(E) ( Top ( ESAxioms(E;
Def == EqDecider(E) ( Top ( ESAxioms(T;
Def == EqDecider(E) ( Top ( ESAxioms(M;
Def == EqDecider(E) ( Top ( ESAxioms(loc;
Def == EqDecider(E) ( Top ( ESAxioms(kind;
Def == EqDecider(E) ( Top ( ESAxioms(val;
Def == EqDecider(E) ( Top ( ESAxioms(when;
Def == EqDecider(E) ( Top ( ESAxioms(after;
Def == EqDecider(E) ( Top ( ESAxioms(sends;
Def == EqDecider(E) ( Top ( ESAxioms(sender;
Def == EqDecider(E) ( Top ( ESAxioms(index;
Def == EqDecider(E) ( Top ( ESAxioms(first;
Def == EqDecider(E) ( Top ( ESAxioms(pred;
Def == EqDecider(E) ( Top ( ESAxioms(causl)
Def == EqDecider(E) ( Top ( Top)) |
| | Thm* ES Type{i'} |
|
Id | Def Id == Atom  |
| | Thm* Id Type |
|
es-E | Def E == 1of(es) |
|
es-causl | Def (e < e')
Def == 1of(2of(2of(2of(2of(2of(2of(2of(2of(2of(2of(2of(2of(2of(2of(2of(2of(
Def == 1of(es)))))))))))))))))
Def == (e
Def == ,e') |
|
es-interval | Def [e, e'] == filter( ev.es-ble{i:l}(es;e;ev);before(e') @ [e']) |
|
es-loc | Def loc(e) == 1of(2of(2of(2of(2of(2of(2of(es)))))))(e) |
|
iff | Def P  Q == (P  Q) & (P  Q) |
| | Thm* A,B:Prop. (A  B) Prop |
|
l_all | Def ( x L.P(x)) == x:T. (x L)  P(x) |
| | Thm* T:Type, L:T List, P:(T Prop). ( x L.P(x)) Prop |
|
l_member | Def (x l) == i: . i<||l|| & x = l[i] T |
| | Thm* T:Type, x:T, l:T List. (x l) Prop |