is mentioned by
Thm* | [es-valtype-w-valtype] |
Thm* FairFifo Thm* Thm* isrcv(kind(e)) Thm* Thm* match(lnk(kind(e));t;time(e)) Thm* Thm* onlnk(lnk(kind(e));m(source(lnk(kind(e)));t))[(||rcvs(lnk(kind(e));time(e))|| Thm* -||snds(lnk(kind(e));t)||)] Thm* = Thm* msg(a(loc(e);time(e))) Thm* | [w-match-property] |
Thm* FairFifo Thm* Thm* isrcv(kind(e)) Thm* Thm* ( Thm* (match(lnk(kind(e));t;time(e)) Thm* (& onlnk(lnk(kind(e));m(source(lnk(kind(e)));t))[(||rcvs(lnk(kind(e));time(e))|| Thm* (& -||snds(lnk(kind(e));t)||)] Thm* (& = Thm* (& msg(a(loc(e);time(e))) Thm* (& | [better-w-match-exists] |
| [assert-w-first] | |
Def == if isnull(a(loc(e);time(e)-1)) Def == else <loc(e),time(e)-1> fi Def (recursive) | [w-pred] |
Def == if time(e)= Def == i; isnull(a(loc(e);time(e)-1)) Def == else false Def (recursive) | [w-first] |
| [w-act] | |
| [w-E] | |
Def == ( Def == & ( Def == & ( Def == & ( Def == & (( Def == & (& m(i;t) = nil Def == & ( Def == & ( Def == & ( Def == & (destination(l) = i Def == & (& ||queue(l;t)|| Def == & ( Def == & ( Def == & (t | [fair-fifo] |
| [w-rcvs] |
Try larger context:
EventSystems
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html