Nuprl - Proof: sends-rule 2 1 2 1 1 1 3 1 2 1

(148steps total) PrintForm Definitions Lemmas mb event system 6 Sections EventSystems Doc

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: sends-rule 2 1 2 1 1 1 3 1 2 1

1. i : Id
2. k : Knd
3. l : IdLnk
4. ds : x:Id fp-> Type
5. da : a:Knd fp-> Type
6. (tg:Id

State(ds)

ma-valtype(da; k)

(da(rcv(l; tg))?Void List)) List
7. source(l) = i
8. w : World
9. p : FairFifo
10. FairFifo
11.

a:Action(i).

isnull(a)

(valtype(i;a)

r da(kind(a))?Top)
12. e : E
13. loc(e) = i
14. valtype(i;act(e))

r ma-valtype(da; kind(act(e)))
15.

isnull(act(e))

valtype(e) ~ valtype(loc(e);act(e))

By:	DVar `e' THEN DVar `e' THEN All (h.Unfolds [`w-act`] h THEN Reduce h) THEN Fold `w-es` 0 THEN BackThru Thm* i:Id, w:World, p:FairFifo, t:. Thm* isnull(a(i;t)) (valtype(<i,t>) ~ valtype(i;a(i;t)))

Generated subgoals:

None

About:

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html

(148steps total) PrintForm Definitions Lemmas mb event system 6 Sections EventSystems Doc