Definitions mb hybrid GenAutomata Doc

Defined Operators mentioned in mb hybrid (and any they in turn depend on)

Defswitch_inv(E; tr)[switch_inv2001_03_15_DASH_PM_DASH_12_53_21]
Defx R_del(E) y[R_del]
DefNo-dup-send(E)[no_duplicate_send]mb structures
DefEventStruct[event_str]mb structures
Def(L -msg(a;b) L1)[remove_msgs]
DefTaggedEventStruct[tagged_event_str]mb structures
DefMessageStruct[message_str]mb structures
DefDecidableEquiv[dequiv]mb structures
DefEquivRel x,y:T. E(x;y)[equiv_rel]rel 1
DefRefl(T;x,y.E(x;y))[refl]rel 1
Def(xL.P(x))[l_exists]mb list 2
Deftotalorder(E)[totalorder]
Defsingle-tag-decomposable(E)[single_tag_decomposable]
DefMCS(E)[memoryless_composable_safety]
Defswitchable0(E)[switchable0]
Defswitchable(E)[b_switchable]
DefcomposableR(E)[R_composable]
Def(xL.P(x))[l_all]mb list 2
Defagree_on_common(T;as;bs)[agree_on_common]mb list 1
Def(x l)[l_member]mb list 1
Def[bool]bool 1
DefP Q[iff]core
DefTag-by-msg(E)[P_tag_by_msg]
DefPTrue[PTrue]
DefI fuses P[fusion_condition]
DefR_ad_normal(tr)[R_ad_normal]
DefR_strong_safety(E)[R_strong_safety]
DefP Q[prop_and]mb nat
DefStructure[struct]mb structures
DefTraceProperty(E)[trace_property]
Deftag_splitable(E;R)[tag_splitable]mb structures
Defswitch-decomposable(E)[switch_decomposable]
DefAD-normal(E)[switch_normal]
DefR_permutation(E)[R_permutation]
DefR^-1[rel_inverse]mb nat
DefswitchR(tr)[switch_inv_rel]
Deflocal_deliver_property(E;P)[local_deliver_property]
DefadR(E)[R_ad]
DefP o evt[compose_map]mb structures
Definduced_event_str(E;A;f)[induced_event_str]mb structures
Deffull_switch_inv(E;A;evt;tg;tr_u;tr_l)[full_switch_inv]
Deftrue[btrue]bool 1
Defsublist(T;L1;L2)[sublist]mb list 1
DeflayerR(E)[layer_rel]
DefdelayableR(E)[R_delayable]
DefasyncR(E)[R_async]
DefR(tg)[tag_rel]
Defswap adjacent[P(x;y)][swap_adjacent]mb list 2
Defswap(L;i;j)[swap]mb list 2
Defx somewhere delivered before y[delivered_before_somewhere]
Defswitch_inv(E)[switch_inv]
Defx delivered at time k[delivered_at]
DefC(Q)[message_closure]
DefNo-dup-deliver(E)[P_no_dup]
DefCausal(E)[P_causal]
Def(L o f)[permute_list]mb list 2
Defl[i][select]list 1
Deftr delivered at p[deliveries_at]
DefmemorylessR(E)[R_memoryless]
Defnth_tl(n;as)[nth_tl]list 1
Defij[le_int]bool 1
Defb[bnot]bool 1
Def=msg=(E)[event_msg_eq]mb structures
DefLabel[lbl]mb label
Def < tr > _tg[tag_sublist]mb structures
Def=(M)[msg_eq]mb structures
Defl1 = l2[eq_lbl]mb basic
Defground_ptn(p)[ground_ptn]mb basic
Defpq[band]bool 1
Deffilter(P;l)[filter]mb list 1
Defreduce(f;k;as)[reduce]list 1
Def < A,evt,tg > (E)[induced_tagged_event_str]mb structures
Defloc(E)[event_loc]mb structures
DefP & Q[and]core
Defx:A. B(x)[exists]core
Defx f y[infix_ap]core
Deftag(E)[event_tag]mb structures
Defincreasing(f;k)[increasing]mb basic
Def{i..j}[int_seg]int 1
DefR^*[rel_star]mb nat
Def[nat]int 1
Defi j < k[lelt]int 1
DefAB[le]core
Defis-deliver(E)(x)[event_is_deliver]mb structures
DefDec(P)[decidable]core
DefA[not]core
Defsend-enabledR(E)[R_send_enabled]
Defis-send(E)[event_is_snd]mb structures
Defb[assert]bool 1
DefP Q[implies]core
Def||as||[length]list 1
Defx:A. B(x)[all]core
DefTrue[true]core
DefsafetyR(E)[R_safety]
Defl1 l2[iseg]mb list 1
Defmklist(n;f)[mklist]mb list 1
Defas @ bs[append]list 1
DefTrace(E)[str_trace]mb structures
DefP refines Q[tr_refines]
Def|S|[carrier]mb structures
DefP Q[or]core
DefProp[prop]core
Defmsg(E)[event_msg]mb structures
Defmap(f;as)[map]list 1
DefMS(E)[event_msg_str]mb structures
Def(ternary) R preserves P [preserved_by2]mb nat
DefR preserves P[preserved_by]mb nat
DefR1 R2[rel_or]mb nat
DefTop[top]core
DefP Q[rev_implies]core
Deff o g[compose]fun 1
Defuid(MS)[msg_id]mb structures
Defsender(MS)[msg_sender]mb structures
Defcontent(MS)[msg_content]mb structures
DefcEQ(MS)[msg_content_eq]mb structures
Def=(DE)[eq_dequiv]mb structures
Def2of(t)[pi2]core
Def1of(t)[pi1]core
DefPattern[ptn]mb basic
DefCase ptn_var(x) = > body(x) cont[case_ptn_var]mb basic
DefCase ptn_int(x) = > body(x) cont[case_ptn_int]mb basic
Defhd(l)[hd]list 1
DefDefault = > body[case_default]prog 1
DefCase ptn_pr( < x, y > ) = > body(x;y) cont[case_lbl_pair]mb basic
DefCase(value) body[case]prog 1
Defx=yAtom[eq_atom]bool 1
Def(i, j)[flip]mb nat
DefR^n[rel_exp]mb nat
Defprimrec(n;b;c)[primrec]mb nat
Defi=j[eq_int]bool 1
DefCase ptn_atom(x) = > body(x) cont[case_ptn_atom]mb basic
Defptn_con(T)[ptn_con]mb basic
Deftl(l)[tl]list 1
Definl(x) = > body(x) cont[case_inl]prog 1
Definr(x) = > body(x) cont[case_inr]prog 1
Defi < j[lt_int]bool 1
DefTrans x,y:T. E(x;y)[trans]rel 1
DefSym x,y:T. E(x;y)[sym]rel 1

About:
pairspreadspreadspreadproductproductlistconsconsnil
list_indboolbfalsebtrueifthenelseassert
decidableunititvoidintnatural_numberaddsubtractint_eqless
less_thanatomtokenatom_equnioninldecide
setisectlambdaapplyfunctionycombrecuniverseequal
membertoppropimpliesandorfalsetrueallexists

Definitions mb hybrid GenAutomata Doc