Nuprl Theory sci_base

(only non hidden objects are presented)

COMtmp[( [{[Dn: minus.1 = Dn: squash_df.1 = Dn: not_df.1 = Dn: NOT_df.1]} | Dn: list.1] > [(Dn: apply.1 > [([Dn: div.1 | Dn: mul.1 | Dn: rem.1] > [Dn: sub.1 | Dn: add.1]) | ([Dn: function.1 | Dn: product.1] > Dn: union.1)]) | Dn: infix_ap_df.1] > ( {[Dn: equal.1 = Dn: lt.1 = Dn: member_df.1 = Dn: eqi.1 = Dn: le_df.1 = Dn: ge_df.1 = Dn: gt_df.1]} > [Dn: and_df.1 | Dn: or_df.1] > [Dn: iff_df.1 | Dn: implies_df.1 | Dn: rev_implies_df.1] ) > {[Dn: lambda.1 = Dn: exists_df.1 = Dn: all_df.1]} ) | Dn: inr.1 | Dn: inl.1 | Dn: sq_exists_df.1 | Dn: pi1_df.1 | Dn: pi2_df.1]
MLBogusRulelet BogusRule = Refine `because` [];;
DISPcons_df2Parens ::Index 0 :: {[SOFT}<h:term>{\\}::<t:list:E>{]}== <h>::<t>
THMnat_inc
THMint_wf1 S
THMsubtract_wf_natx,y:. x y x - y
THMdecidable__intlist_equalityl,l': List. Dec(l = l')
ABSxorp q == (p q) (p q)
THMxor_wfp,q:. (p q)
DISPxor_df RAssoc Infix Display Form Generator Prec: xor Slot Name: prop Infix Chars: " " Term: A,B.A B
ABSexists_unique!x:A.P[x] == x:A. P[x] (y:A. P[y] x = y)
THMexists_unique_wfA:. P:A . (!x:A.P[x])
DISPexists_unique_dfParens ::Prec(exists):: !<x:var>:<A:type:*>{\\?.}<P:prop:E> == !<x>:<A>.<P>
THMatom_wf1Atom S
DISPatom_eq_pred_dfatom_eq_pred()== atom_eq_pred()
ABSatom_eq_predatom_eq_pred() == x,y.x =a y
THMatom_eq_pred_wfatom_eq_pred() eq(Atom)
DISPdecidable_true_dftrue(<P:P:*>)== true(<P>)
ABSdecidable_truetrue(P) == isl(d)
THMdecidable_true_wfP:. d:Dec(P). true(P)
THMassert_of_decidable_trueP:. d:Dec(P). true(P) P
MLdecidable_true_simpsimpset_add `HOL_standard_lib_simps` (lemma_simp `assert_of_decidable_ true`) ;;
THMlist_charA:. l:A List. l = [] (a:A. k:A List. l = (a::k))
DISPlist_el_dflist_el(<A:A:*><x:x:*><l:l:*>)== list_el(<A><x><l>)
MLlist_el_mllist_el(A;x;l) ==r if null(l) then False else x = hd(l) list_el(A;x;tl(l)) fi
THMlist_el_wfA:. x:A. l:A List. list_el(A;x;l)
THMlist_el_nilA:. x:A. list_el(A;x;[])
THMlist_el_consA:. x,y:A. l:A List. list_el(A;x;y::l) x = y list_el(A;x;l)
THMlist_el_snoc'a:S. x,y:'a. l:'a List. list_el('a;x;snoc(y;l)) x = y list_el('a;x;l)
MLlist_el_simpssimpset_add `HOL_standard_lib_simps` (lemma_simp `list_el_nil`) ;; simpset_add `HOL_standard_lib_simps` (lemma_simp `list_el_cons`) ;; simpset_add `HOL_standard_lib_simps` (lemma_simp `list_el_snoc`) ;;
THMlist_el_monoA:. x,y:A. l:A List. list_el(A;x;l) list_el(A;x;y::l)
THMlist_el_mapA,B:. f:A B. l:A List. x:B. list_el(B;x;map(f;l)) (y:A. x = f y list_el(A;y;l))
DISPlistsubset_dflistsubset(<A:A:*><l1:l1:*><l2:l2:*>)== listsubset(<A><l1><l2>)
ABSlistsubsetlistsubset(A;l1;l2) == x:A. list_el(A;x;l1) list_el(A;x;l2)
THMlistsubset_wfA:. l1,l2:A List. listsubset(A;l1;l2)
MLlistsubset_simpsimpset_add `HOL_standard_lib_simps` (unfold_top_simp `listsubset`) ;;
THMfilter_listsubset'a:S. P:'a . l:'a List. listsubset('a;filter(P;l);l)
THMsnoc_listsubset'a:S. x:'a. l:'a List. listsubset('a;l;snoc(x;l))
THMbut_last_el_listsubset'a:S. l:'a List. listsubset('a;but_last_el(l);l)
THMfirstn_listsubset'a:S. n,m:. l:'a List. n < m listsubset('a;firstn(n;l);firstn(m;l))
THMlastn_listsubset'a:S. n,m:. l:'a List. n < m listsubset('a;lastn(n;l);lastn(m;l))
THMseg_not_null'a:S. m,n:. l:'a List. m > 0 n < ||l|| mt(seg(m;n;l))
THMlast_el_nil'a:S. x:'a. last_el(x::[]) = x
THMlast_el_cons'a:S. x,y:'a. l:'a List. last_el(x::y::l) = last_el(y::l)
THMbut_last_el_nil'a:S. x:'a. but_last_el(x::[]) = []
THMbut_last_el_cons'a:S. x,y:'a. l:'a List. but_last_el(x::y::l) = (x::but_last_el(y::l))
THMlast_el_list_el'a:S. l:'a List. mt(l) list_el('a;last_el(l);l)
THMlast_or_butlast'a:S. x:'a. l:'a List. mt(l) (list_el('a;x;l) list_el('a;x;but_last_el(l)) x = last_el(l))
THMbut_last_el_last_append'a:S. l:'a List. mt(l) but_last_el(l) @ (last_el(l)::[]) = l
THMlength_filter_but_last_el_ff'a:S. l:'a List. P:'a . mt(l) (P last_el(l)) ||filter(P;but_last_el(l))|| = ||filter(P;l)||
THMmt_filter_ff'a:S. l:'a List. P:'a . mt(filter(P;l)) (x:'a. list_el('a;x;l) (P x))
THMlist_el_filter_tt'a:S. x:'a. l:'a List. P:'a . list_el('a;x;filter(P;l)) (P x)
THMlist_el_filter_tt_iff'a:S. x:'a. l:'a List. P:'a . list_el('a;x;filter(P;l)) list_el('a;x;l) (P x)
THMlength_filter'a:S. l:'a List. P:'a . ||filter(P;l)|| ||l||
THMlength_1_filter'a:S. l:'a List. P:'a . ||filter(P;l)|| = 1 ((P last_el(l)) mt(filter(P;but_last_el(l)))) ((P last_el(l)) ||filter(P;but_last_el(l))|| = 1)
THMlength_2_filter'a:S. x,y:'a. l:'a List. P:'a . (x = y) list_el('a;x;filter(P;l)) list_el('a;y;filter(P;l)) ||filter(P;l)|| 2
THMel_length_1_filter'a:S. x:'a. l:'a List. list_el('a;x;l) ||l|| > 0
THMlast_butlast_length_2_filter'a:S. x:'a. l:'a List. P:'a . mt(l) (P last_el(l)) (P x) list_el('a;x;but_last_el(l)) ||filter(P;l)|| 2
THMmt_snoc'a:S. x:'a. l:'a List. mt(snoc(x;l))
THMmap_null'a,'b:S. f:'a 'b. l:'a List. mt(map(f;l)) mt(l)
THMlast_el_map'a,'b:S. f:'a 'b. l:'a List. mt(l) last_el(map(f;l)) = f last_el(l)
THMbut_last_el_map'b,'a:S. l:'a List. mt(l) (f:'a 'b. but_last_el(map(f;l)) = map(f;but_last_el(l)))
THMlength_but_last_el'a:S. l:'a List. mt(l) ||but_last_el(l)|| = ||l|| - 1
THMel_but_last_el'a:S. l:'a List. i:. i < ||l|| - 1 but_last_el(l)[i] = l[i]
THMdistrib_el_appendA:. as,bs:A List. a:A. list_el(A;a;as @ bs) list_el(A;a;as) list_el(A;a;bs)
THMlast_el_select'a:S. l:'a List. mt(l) last_el(l) = l[(||l|| - 1)]
THMbut_last_el_firstn'a:S. l:'a List. mt(l) but_last_el(l) = firstn(||l|| - 1;l)
THMlist_el_firstn_but_last_el'a:S. n:. x:'a. l:'a List. n < ||l|| list_el('a;x;firstn(n;but_last_el(l))) list_el('a;x;firstn(n;l))
THMlist_el_lastn_but_last_el'a:S. n:. x:'a. l:'a List. n < ||l|| list_el('a;x;lastn(n;but_last_el(l))) list_el('a;x;lastn(n + 1;l))
THMlist_el_select'a:S. l:'a List. i:. i < ||l|| list_el('a;l[i];l)
THMfilter1_firstn_ff'a:S. x:'a. l:'a List. P:'a . i:. 0 i < ||l|| ||filter(P;l)|| = 1 (P l[i]) (y:'a. list_el('a;y;firstn(i;l)) (P y))
THMfilter1_lastn_ff'a:S. x:'a. l:'a List. P:'a . i:. 0 i < ||l|| ||filter(P;l)|| = 1 (P l[i]) (y:'a. list_el('a;y;lastn(||l|| - i - 1;l)) (P y))
MLhol1_simpsetmap (simpset_add `hol1`) (get_simpset `HOL_standard_lib_simps`) ;; map ((simpset_add `hol1`) o lemma_simp) ``last_el_nil last_el_cons but_last_el_nil but_last_el_cons mt_snoc map_null last_el_map but_last_el_map el_but_last_el length_but_last_el distrib_el_append`` ;; map ((simpset_add `hol1`) o rev_lemma_simp) ``last_el_select but_last_el_firstn`` ;;
COMsci_base_1---- Booleans -------------------------------------------
ABSzboolo == {k:| k = 0 k = 1}
DISPzbool_dfo== o
THMzbool_wfo
MLzbool_ml_incadd_set_inclusion_info `zbool` `int` AbSetDForInc Auto;;
THMzbool_inco
ABSztruetrue == 1
DISPztrue_dftrue== true
THMztrue_wftrue o
ABSzfalsefalse == 0
DISPzfalse_dffalse== false
THMzfalse_wffalse o
THMzbool_charb:o. b = true b = false
ABStruez[b] == b = true
DISPtruez_df[<b:zbool>]== [<b>]
THMtruez_wfb:o. [b]
THMtruez_falseA:o. A = false [A]
THMtruez_trueA:o. A = true [A]
MLtruez_simpsadd_to_simpset `zbool_iff_simps` (lemma_to_simp `truez_false`) ;; add_to_simpset `zbool_iff_simps` (lemma_to_simp `truez_true`) ;;
ABSzandA B == A * B
DISPzand_df RAssoc Infix Display Form Generator Prec: and Slot Name: zbool Infix Chars: " " Term: A,B.A B
THMzand_wfA,B:o. (A B) o
THMtruez_andA,B:o. [(A B)] [A] [B]
MLzand_simpadd_to_simpset `zbool_iff_simps` (lemma_to_simp `truez_and`) ;;
ABSznotA == 1 - A
DISPznot_dfParens ::Prec(preop):: <A:zbool:E>== <A>
THMznot_wfA:o. A o
THMtruez_notA:o. [(A)] [A]
MLznot_simpadd_to_simpset `zbool_iff_simps` (lemma_to_simp `truez_not`) ;;
ABSzorA B == (A B)
DISPzor_df RAssoc Infix Display Form Generator Prec: or Slot Name: zbool Infix Chars: " " Term: A,B.A B
THMzor_wfA,B:o. (A B) o
THMtruez_orA,B:o. [(A B)] [A] [B]
MLzor_simpadd_to_simpset `zbool_iff_simps` (lemma_to_simp `truez_or`) ;;
ABSzifif b then x else y == if b=1 then x else y
DISPzif_dfif <b:zbool> then <s:Term:*> else <t:Term:E> == if <b> then <s> else <t>
THMzif_wfT:. b:o. x,y:T. if b then x else y T
THMzif_charT:. x,y:T. if false then x else y = y if true then x else y = x
MLzif_char_simpsmap (add_to_simpset `zbool_simps`) (lemma_clauses_to_simps `zif_char`) ;;
ABSz_int_eqn1 = n2 == if n1=n2 then true else false
DISPz_int_eq_dfParens ::Prec(atomrel)::Index 0 :: {[SOFT}<t1:int:L>{\\ }= {->0}<t2:int:L>{<-}{]} == <t1> = <t2>
THMz_int_eq_wfn1,n2:. (n1 = n2) o
THMz_int_eq_rwn:. (n = n) = true
MLz_int_eq_rw_simpadd_to_simpset `zbool_simps` (lemma_to_simp `z_int_eq_rw`) ;;
THMz_int_neq_rwn,m:. (n = m) (n = m) = false
THMtruez_int_eqn1,n2:. [(n1 = n2)] n1 = n2
MLz_int_eq_simpadd_to_simpset `zbool_iff_simps` (lemma_to_simp `truez_int_eq`) ;;
ABSz_atom_eqn1 = n2 == if n1=n2 then true else false
DISPz_atom_eq_dfParens ::Prec(atomrel)::Index 0 :: {[SOFT}<t1:atom:L>{\\ }= {->0}<t2:atom:L>{<-}{]} == <t1> = <t2>
THMz_atom_eq_wfn1,n2:Atom. (n1 = n2) o
THMz_atom_eq_rwx:Atom. (x = x) = true
MLz_atom_eq_rw_simpadd_to_simpset `zbool_simps` (lemma_to_simp `z_atom_eq_rw`) ;;
THMz_atom_neq_rwx,y:Atom. (x = y) (x = y) = false
THMtruez_atom_eqn1,n2:Atom. [(n1 = n2)] n1 = n2
MLz_atom_eq_simpadd_to_simpset `zbool_iff_simps` (lemma_to_simp `truez_atom_eq`) ;;
DISPznull_dfznull(<l:l:*>)== znull(<l>)
ABSznullznull(l) == case l of [] => true | a::l' => false esac
THMznull_wfA:. l:A List. znull(l) o
THMtruez_nullA:. l:A List. [znull(l)] mt(l)
THMznull_nilznull([]) = true
THMznull_consA:. a:A. l:A List. znull(a::l) = false
MLznull_cons_simpadd_to_simpset `zbool_simps` (lemma_to_simp `znull_cons`) ;;
MLzbool_iff_simpset1map ((simpset_add `zbool_iff`) o lemma_simp) ``truez_false truez_true truez_and truez_not truez_or truez_int_eq truez_atom_eq truez_null`` ;;
MLzbool_simpset1map (simpset_add `zbool`) (lemma_simps `zif_char`) ;; map ((simpset_add `zbool`) o lemma_simp) ``z_int_eq_rw z_atom_eq_rw znull_nil znull_cons`` ;;
COMsci_base_2---- Basic Types -----------------------------------------
ABSpidPId == {k:| k 0 }
ABSpidsPId? == {k:| k -1 }
ABSvprocP(N) == {p:PId| 1 p N}
ABSvpidP+m(N) == {p:PId| p N}
ABSvpidsP?(N) == {p:PId?| p N}
DISPpid_dfPId== PId
DISPpids_dfPId?== PId?
DISPvproc_dfP(<n:nat>)== P(<n>) P== P
DISPvpid_dfP+m(<n:nat>)== P+m(<n>) P+m== P+m
DISPvpids_dfP?(<n:nat>)== P?(<n>) P?== P?
THMpid_wfPId
THMpid_wf1PId S
THMpids_wfPId?
THMvproc_wfN:. P(N)
THMvpid_wfN:. P+m(N)
THMvpids_wfN:. P?(N)
THMpid_incPId PId?
THMpid_int_incPId
THMpids_incPId?
THMvproc_incn:. P P+m
THMvpid_incn:. P+m P?
THMvproc_pids_incn:. P PId?
THMvproc_pid_incn:. P PId
THMvpid_pid_incn:. P+m PId
THMvpids_incn:. P? PId?
THMvpid_pids_incn:. P+m PId?
COMinclusion_comment-- ml_inc's below are what is used by the autotactic (see Sect. 10.2.5 of the manual), the inc lemmas above don't seem to be needed
MLpids_int_ml_incadd_set_inclusion_info `pids` `int` AbSetDForInc Auto;;
MLpid_pids_ml_incadd_set_inclusion_info `pid` `pids` AbSetDForInc Auto;;
MLvpids_pids_ml_incadd_set_inclusion_info `vpids` `pids` AbSetDForInc Auto;;
MLvpid_pid_ml_incadd_set_inclusion_info `vpid` `pid` AbSetDForInc Auto;;
MLvproc_vpid_ml_incadd_set_inclusion_info `vproc` `vpid` AbSetDForInc Auto;;
MLpid_arith_typesarith_types := union ``vpid vproc pid pids`` arith_types ;;
THMsubtype_decA:. P:A . x,y:{z:A| P[z]} . Dec(x = y) Dec(x = y)
THMdecidable__pid_equalityp,q:PId. Dec(p = q)
THMdecidable__pids_equalityp,q:PId?. Dec(p = q)
THMdecidable__vproc_equalityn:. p,q:P. Dec(p = q)
THMdecidable__vpid_equalityn:. p,q:P+m. Dec(p = q)
THMpid_eqn:. p,q:P. p = q p = q
MLpid_eq_mllet PidEq p = (let g = (concl p) in if ((is_equal_term g) & (is_term ` pid` (fst (dest_equal g)))) then (BLemma `pid_eq` THENM Trivia l) else Fail) p ;; update_Auto_additions `PidEq` PidEq ;;
DISPid_dfid== id
ABSidid == Atom PId?
THMid_wfid
DISPid_tup_df<a:a:*><p:p:*>== <a><p>
ABSid_tupap == <a, p>
THMid_tup_wfa:Atom. p:PId?. ap id
DISPmk_id_dfEdAlias mk_id :: <x:string>-<n:nat>== <x>-<n> <x:string>-== <x>-
ABSmk_id$s-i == "$s"i
MLmk_id_inf_mladd_type_inf_fun `mk_id` (\g e t. mk_simple_term `id` []) ;;
MLmk_id_eq_mlupdate_EqCD_additions `mk_id` (\p. if opid_of_term (first_equand (concl p)) = `mk_id` then Unfolds ``mk_id`` 0 p else fail);;
ABSid_nameid.name == id.1
THMid_name_wfi:id. (i.name) Atom
DISPid_name_dfParens ::Prec(pi1):: <t:id:*>.name== <t>.name
ABSid_pidid.pid == id.2
THMid_pid_wfi:id. (i.pid) PId?
DISPid_pid_dfParens ::Prec(pi1):: <t:id:*>.pid== <t>.pid
THMid_name_rwx:Atom. p:PId?. (xp.name) = x
THMid_pid_rwx:Atom. p:PId?. (xp.pid) = p
DISPz_id_eq_dfParens ::Prec(atomrel)::Index 0 :: {[SOFT}<t1:id:L>{\\ }= {->0}<t2:id:L>{<-}{]} == <t1> = <t2>
ABSz_id_eqid1 = id2 == (id1.name) = (id2.name) (id1.pid) = (id2.pid)
THMz_id_eq_wfid1,id2:id. (id1 = id2) o
THMz_id_eq_rwx:id. (x = x) = true
MLz_id_eq_rw_simpadd_to_simpset `zbool_simps` (lemma_to_simp `z_id_eq_rw`) ;;
THMz_id_neq_rwx,y:id. (x = y) (x = y) = false
THMtruez_id_eqx1,x2:id. [(x1 = x2)] x1 = x2
MLz_id_eq_simpadd_to_simpset `zbool_iff_simps` (lemma_to_simp `truez_id_eq`) ;;
DISPmesg_dfmesg== mesg
ABSmesgmesg == List
THMmesg_wfmesg
THMmesg_wf1mesg S
DISPmk_mesg_df<T:T:*>(<args:args:*>)== <T>(<args>)
ABSmk_mesgT(args) == <T, args>
THMmk_mesg_wfT:. args: List. T(args) mesg
DISPmesg_type_df<M:M:*>.type== <M>.type
ABSmesg_typeM.type == M.1
THMmesg_type_wfM:mesg. M.type
DISPmesg_args_df<M:M:*>.args== <M>.args
ABSmesg_argsM.args == M.2
THMmesg_args_wfM:mesg. M.args List
THMmesg_charM:mesg. M.type(M.args) = M
THMmesg_type_rwT:. args: List. T(args).type = T
THMmesg_args_rwT:. l: List. T(l).args = l
DISPmesg_first_arg_dfmesg_first_arg(<M:M:*>)== mesg_first_arg(<M>)
ABSmesg_first_argmesg_first_arg(M) == if null(M.args) then nil else hd(M.args) fi
THMmesg_first_arg_wfM:mesg. mesg_first_arg(M)
THMmesg_first_arg_rwT,p:. args: List. mesg_first_arg(T(p::args)) = p
THMdecidable__mesg_equalityM,M':mesg. Dec(M = M')
THMdecidable__mesg_list_elM:mesg. l:mesg List. Dec(list_el(mesg;M;l))
THMdecidable__exists_mesg_senderT:. args: List. l:mesg List. Dec(q:. list_el(mesg;T(q::args);l))
DISPhist_el_dfhist_el== hist_el
ABShist_elhist_el == o PId mesg
THMhist_el_wfhist_el
THMhist_el_wf1hist_el S
DISPmk_hist_el_dfmk_hist_el(<b:b:*><p:p:*><q:q:*><M:M:*>) == mk_hist_el(<b><p><q><M>)
ABSmk_hist_elmk_hist_el(b;p;q;M) == <b, p, q, M>
THMmk_hist_el_wfb:o. p:PId. q:. M:mesg. mk_hist_el(b;p;q;M) hist_el
DISPhe_send_df<he:he:*>.send?== <he>.send?
ABShe_sendhe.send? == he.1
THMhe_send_wfhe:hist_el. he.send? o
DISPhe_src_df<he:he:*>.src== <he>.src
ABShe_srche.src == he.2.1
THMhe_src_wfhe:hist_el. he.src PId
DISPhe_dest_df<he:he:*>.dest== <he>.dest
ABShe_desthe.dest == he.2.2.1
THMhe_dest_wfhe:hist_el. he.dest
DISPhe_mesg_df<he:he:*>.mesg== <he>.mesg
ABShe_mesghe.mesg == he.2.2.2
THMhe_mesg_wfhe:hist_el. he.mesg mesg
THMhist_el_charhe:hist_el. mk_hist_el(he.send?;he.src;he.dest;he.mesg) = he
THMhe_send_rwb:o. p:PId. q:. M:mesg. mk_hist_el(b;p;q;M).send? = b
THMhe_src_rwb:o. p:PId. q:. M:mesg. mk_hist_el(b;p;q;M).src = p
THMhe_dest_rwb:o. p:PId. q:. M:mesg. mk_hist_el(b;p;q;M).dest = q
THMhe_mesg_rwb:o. p:PId. q:. M:mesg. mk_hist_el(b;p;q;M).mesg = M
DISPhist_dfhist== hist
ABShisthist == hist_el List
THMhist_wfhist
MLhist_softadd_soft_abs ``hist``;;
DISPstate_dfstate== state
ABSstatestate == (id ) hist
THMstate_wfstate
DISPmk_state_dfmk_state(<v:v:*><h:h:*>)== mk_state(<v><h>)
ABSmk_statemk_state(v;h) == <v, h>
THMmk_state_wfv:id . h:hist. mk_state(v;h) state
ABSs_vs.v == s.1
THMs_v_wfs:state. (s.v) id
ABSs_hs.h == s.2
THMs_h_wfs:state. (s.h) hist
DISPs_v_dfParens ::Prec(pi1):: <t:state:*>.v== <t>.v
DISPs_h_dfParens ::Prec(pi1):: <t:state:*>.h== <t>.h
THMstate_v_rwv:id . h:hist. (mk_state(v;h).v) = v
THMstate_h_rwv:id . h:hist. (mk_state(v;h).h) = h
DISPzexp_dfzexp== zexp
ABSzexpzexp == state
THMzexp_wfzexp
DISPbexp_dfbexp== bexp
ABSbexpbexp == state o
THMbexp_wfbexp
MLzexp_ml_incadd_set_inclusion_info `bexp` `zexp` AbSetDForInc Auto;;
THMbexp_incbexp zexp
DISPmexp_dfmexp== mexp
ABSmexpmexp == state mesg
THMmexp_wfmexp
DISPcom_dfcom== com
ABScomcom == state state
THMcom_wfcom
MLcom_softadd_soft_abs ``com``;;
ABSprogprog{} == com List (state )
THMprog_wfprog{} {2}
ABSprog_actionsprg.actions == prg.1
THMprog_actions_wfprg:prog{}. (prg.actions) com List
ABSprog_initprg.init == prg.2
THMprog_init_wfprg:prog{}. (prg.init) state
DISPprog_actions_dfParens ::Prec(pi1):: <t:program:*>.actions== <t>.actions
DISPprog_init_dfParens ::Prec(pi1):: <t:program:*>.init== <t>.init
ABSvar_valxst == (st.v) x
DISPvar_val_dfEdAlias ap ::Parens ::Prec(apply):: {[SOFT}<x:id:E>{\\}<s:state:L>{]} == <x><s> <x:id>'== <x>' <x:id>_== <x>_
THMvar_val_wfx:id. st:state. xst
ABSevalest == e st
DISPeval_dfEdAlias ap ::Parens ::Prec(apply):: {[SOFT}<e:zexp:E>{\\}<s:state:L>{]} == <e><s>
THMeval_wfe:zexp. st:state. est
THMeval_wf1b:bexp. st:state. bst o
DISPmval_dfEdAlias ap ::Parens ::Prec(apply):: {[SOFT}<M:mexp:E>{\\}<s:state:L>{]} == <M><s>
ABSmvalMs == M s
THMmval_wfM:mexp. s:state. Ms mesg
ABScvalcst == c st
DISPcval_dfEdAlias ap ::Parens ::Prec(apply):: {[SOFT}<c:command:E>{\\}<s:state:L>{]} == <c><s>
THMcval_wfc:com. st:state. cst state
ABSzexp_valzexp_val{}(s) == e.es
THMzexp_val_wfs:state. zexp_val{}(s) zexp
MLzbool_iff_simpset2simpset_add `zbool_iff` (lemma_simp `truez_id_eq`) ;;
MLzbool_simpset2simpset_add `zbool` (lemma_simp `z_id_eq_rw`) ;;
MLbase1_simpset1map ((simpset_add `base1`) o lemma_simp) ``he_send_rw he_src_rw he_dest_rw he_mesg_rw mesg_char mesg_type_rw mesg_args_rw mesg_first_arg_rw state_v_rw state_h_rw id_name_rw id_pid_rw``;;
COMsci_base_3---- Basic Expressions -----------------------------------
DISPeint_df<x:int>== <x>
ABSeintn == s.n
THMeint_wfn:. n zexp
DISPevar_df<x:id>== <x>
ABSevarx == st.xst
THMevar_wfx:id. x zexp
DISPemesg_df<T:T:*>(<es:es:*>)== <T>(<es>)
ABSemesgT(es) == s.T(map(zexp_val{}(s);es))
THMemesg_wfT:. es:zexp List. T(es) mexp
DISPetrue_dftrue== true
ABSetruetrue == s.true
THMetrue_wftrue bexp
DISPefalse_dffalse== false
ABSefalsefalse == s.false
THMefalse_wffalse bexp
DISPe_int_eq_dfParens ::Prec(atomrel)::Index 0 :: {[SOFT}<t1:zexp:L>{\\ }= {->0}<t2:zexp:L>{<-}{]} == <t1> = <t2>
ABSe_int_eqm = n == s.ms = ns
THMe_int_eq_wfn,m:zexp. (n = m) bexp
DISPeand_df RAssoc Infix Display Form Generator Prec: and Slot Name: bexp Infix Chars: " " Term: A,B.A B
ABSeandA B == s.As Bs
THMeand_wfA,B:bexp. (A B) bexp
DISPenot_dfParens ::Prec(preop):: <A:bexp:E>== <A>
ABSenotA == s.(As)
THMenot_wfA:bexp. A bexp
DISPeor_df RAssoc Infix Display Form Generator Prec: or Slot Name: bexp Infix Chars: " " Term: A,B.A B
ABSeorA B == s.As Bs
THMeor_wfA,B:bexp. (A B) bexp
COMsci_base_4---- Basic Commands -------------------------------------
DISPcseq_df RAssoc Infix Display Form Generator Prec: cseq Slot Name: com Infix Chars: "" Term: c1,c2.c1 ;c2
ABScseqc1 ;c2 == s.c2(c1s)
THMcseq_wfc1,c2:com. (c1 ;c2) com
DISPcif_df(if <b:bexp> then <s:command:*> else <t:command:E>) == (if <b> then <s> else <t>)
ABScif(if b then c1 else c2) == s.if (bs) then c1s else (c2s)
THMcif_wfb:bexp. c1,c2:com. (if b then c1 else c2) com
DISPupdate_state_df<st:state>[<x:id><-<v:zexp>]== <st>[<x><-<v>]
ABSupdate_statest[x<-v] == <y.if (x = y) then v else (yst), st.h>
THMupdate_state_wfs:state. x:id. v:. s[x<-v] state
DISPcguard_df<b:bexp> --> <c:command>== <b> --> <c>
ABScguardb --> c == s.if (bs) then cs else s
THMcguard_wfb:bexp. c:com. b --> c com
DISPcskip_dfskip== skip
ABScskipskip == s.s
THMcskip_wfskip com
DISPcassign_df<x:id>:=<e:zexp>== <x>:=<e>
ABScassignx:=e == s.s[x<-(es)]
THMcassign_wfx:id. e:zexp. x:=e com
COMsci_base_5---- Send and Receive ------------------------------------
DISPupdate_hist_df[<h:var><-<f:hist>]== [<h><-<f>]
ABSupdate_hist[h<-f[h]] == s.mk_state(s.v;f[(s.h)])
THMupdate_hist_wff:hist hist. [h<-f[h]] com
DISPset_send_dfset_send(<he:he:*><b:b:*>)== set_send(<he><b>)
ABSset_sendset_send(he;b) == mk_hist_el(b;he.src;he.dest;he.mesg)
THMset_send_wfhe:hist_el. b:o. set_send(he;b) hist_el
DISPbogus_he_dfbogus_he()== bogus_he()
ABSbogus_hebogus_he() == mk_hist_el(true;0;0;0([]))
THMbogus_he_wfbogus_he() hist_el
DISPnext_in_hist_dfnext_in_hist(<h:h:*>)== next_in_hist(<h>)
ABSnext_in_histnext_in_hist(h) == if znull(h) then bogus_he() else last_el(h)
THMnext_in_hist_wfh:hist. next_in_hist(h) hist_el
THMnext_in_hist_charnext_in_hist([]) = bogus_he() (he:hist_el. h:hist. next_in_hist(he::h) = last_el(he::h))
DISPaux_queue_dfaux_queue(<h:h:*>)== aux_queue(<h>)
MLaux_queue_mlaux_queue(h) ==r if znull(h) then [] else if hd(h).send? then hd(h) ::aux_queue(tl(h)) else but_last_el(aux_queue(tl(h)))
THMaux_queue_wfh:hist. aux_queue(h) hist
THMaux_queue_nilaux_queue([]) = []
THMaux_queue_consx:hist_el. l:hist. (x.send? = true aux_queue(x::l) = (x::aux_queue(l))) (x.send? = false aux_queue(x::l) = but_last_el(aux_queue(l)))
THMaux_queue_listsubseth:hist. listsubset(hist_el;aux_queue(h);h)
THMaux_queue_sendh:hist. he:hist_el. list_el(hist_el;he;aux_queue(h)) he.send? = true
DISPraw_queue_dfraw_queue(<i:i:*><h:h:*>)== raw_queue(<i><h>)
ABSraw_queueraw_queue(i;h) == filter(he.(he.dest = i);h)
THMraw_queue_wfi:. h:hist. raw_queue(i;h) hist
THMraw_queue_nili:. raw_queue(i;[]) = []
THMraw_queue_consi:. x:hist_el. l:hist. (x.dest = i raw_queue(i;x::l) = (x::raw_queue(i;l))) ((x.dest = i) raw_queue(i;x::l) = raw_queue(i;l))
THMraw_queue_listsubseth:hist. i:. listsubset(hist_el;raw_queue(i;h);h)
THMraw_queue_desth:hist. i:. he:hist_el. list_el(hist_el;he;raw_queue(i;h)) he.dest = i
DISPqueue_dfqueue(<i:i:*><h:h:*>)== queue(<i><h>)
ABSqueuequeue(i;h) == aux_queue(raw_queue(i;h))
THMqueue_wfi:. h:hist. queue(i;h) hist
THMqueue_nili:. queue(i;[]) = []
THMqueue_listsubseth:hist. i:. listsubset(hist_el;queue(i;h);h)
DISPnext_he_dfnext_he(<dest:dest:*><h:h:*>)== next_he(<dest><h>)
ABSnext_henext_he(dest;h) == next_in_hist(queue(dest;h))
THMnext_he_wfdest:. h:hist. next_he(dest;h) hist_el
DISPnext_mesg_dfnext_mesg(<dest:dest:*><h:h:*>)== next_mesg(<dest><h>)
ABSnext_mesgnext_mesg(dest;h) == next_he(dest;h).mesg
THMnext_mesg_wfdest:. h:hist. next_mesg(dest;h) mesg
THMnext_he_senddest:. h:hist. next_he(dest;h).send? = true
THMnext_he_desth:hist. dest:. (next_mesg(dest;h).type = 0) next_he(dest;h).dest = dest
THMnext_he_mesgh:hist. dest:. next_he(dest;h).mesg = next_mesg(dest;h)
THMnext_he_chars:state. p,T:. next_mesg(p;s.h).type = T (T = 0) next_he(p;s.h) = mk_hist_el(true;next_he(p;s.h).src;p;next_mesg(p;s.h))
ABSbmsg_pmsg?(dest,T) == s.next_mesg(dest;s.h).type = T
DISPbmsg_p_dfmsg?(<dest:pid>,<T:msg_t>)== msg?(<dest>,<T>)
THMbmsg_p_wfdest,T:. msg?(dest,T) bexp
THMbmsg_p_in_hists:state. p,T:. msg?(p,T)s = true (T = 0) list_el(hist_el;next_he(p;s.h);s.h)
THMnext_mesg_in_hists:state. p,T:. next_mesg(p;s.h).type = T (T = 0) list_el(hist_el;next_he(p;s.h);s.h)
THMnext_he_in_hists:state. p,T:. next_mesg(p;s.h).type = T (T = 0) list_el(hist_el;mk_hist_el(true;next_he(p;s.h).src;p;next_mesg(p; s.h));s.h)
THMreceived_mesg_in_hists:state. p,T:. b:o. set_send(next_he(p;s.h);b).mesg.type = T (T = 0) list_el(hist_el;next_he(p;s.h);s.h)
DISPassign_args_dfassign_args(<vs:vs:*><vals:vals:*>)== assign_args(<vs><vals>)
MLassign_args_mlassign_args(vs;vals) ==r if znull(vs) then skip else if znull(vals) then hd(vs):=0 ;assign_args(tl(vs);vals) else (hd(vs):=hd(vals) ;assign_args(tl(vs);tl(vals)))
THMassign_args_wfvs:id List. vals: List. assign_args(vs;vals) com
THMassign_args_char(vals: List. assign_args([];vals) = skip) (x:id. vs:id List. assign_args(x::vs;[]) = (x:=0 ;assign_args(vs;[]))) (x:id. vs:id List. val:. vals: List. assign_args(x::vs;val::vals) = (x:=val ;assign_args(vs;vals)))
DISPassign_msg_args_dfassign_msg_args(<dest:dest:*><argvs:argvs:*>) == assign_msg_args(<dest><argvs>)
ABSassign_msg_argsassign_msg_args(dest;argvs) == s.assign_args(argvs;next_mesg(dest;s.h).args)s
THMassign_msg_args_wfdest:. argvs:id List. assign_msg_args(dest;argvs) com
DISPhsend_dfhsend(<src:src:*><dest:dest:*><M:M:*>)== hsend(<src><dest><M>)
ABShsendhsend(src;dest;M) == mk_hist_el(true;src;dest;M)
THMhsend_wfsrc:PId. dest:. M:mesg. hsend(src;dest;M) hist_el
THMhsend_he_send_rwp:PId. q:. M:mesg. hsend(p;q;M).send? = true
DISPhreceive_dfhreceive(<dest:dest:*><h:h:*>)== hreceive(<dest><h>)
ABShreceivehreceive(dest;h) == set_send(next_he(dest;h);false)
THMhreceive_wfdest:. h:hist. hreceive(dest;h) hist_el
THMhreceive_he_send_rwp:. h:hist. hreceive(p;h).send? = false
THMhreceived_mesg_in_hists:state. p,T:. hreceive(p;s.h).mesg.type = T (T = 0) list_el(hist_el;next_he(p;s.h);s.h)
ABScsendsrc->dest!M == s.[h<-(hsend(src;dests;Ms)::h)] s
DISPcsend_df<src:pid>-><dest:zexp>!<M:mexp>== <src>-><dest>!<M> <dest:zexp>!<M:mexp>== <dest>!<M> <dest:zexp>!<M:mexp>== <dest>!<M>
THMcsend_wfsrc:PId. dest:zexp. M:mexp. src->dest!M com
ABScreceivereceive(dest,argvs) == assign_msg_args(dest;argvs) ;[h<-(hreceive(dest;h)::h)]
DISPcreceive_dfreceive(<dest:pid>,<argvs:ids>)== receive(<dest>,<argvs>)
THMcreceive_wfdest:. argvs:id List. receive(dest,argvs) com
ABScguard_recdest?T(argvs) --> c == msg?(dest,T) --> (receive(dest,argvs) ;c)
DISPcguard_rec_df<dest:pid>?<T:msg_t>(<argvs:ids>) --> <c:com> == <dest>?<T>(<argvs>) --> <c>
THMcguard_rec_wfdest,T:. argvs:id List. c:com. dest?T(argvs) --> c com
MLbase_simpset1map (simpset_add `base`) (lemma_simps `next_in_hist_char`) ;; map ((simpset_add `base`) o lemma_simp) ``aux_queue_nil raw_queue_nil queue_nil next_he_send next_he_dest ne xt_he_mesg`` ;; map (simpset_add `base`) (lemma_simps `assign_args_char`);;
COMsci_base_6---- Buffers and Histories ------------------------------
ABSbufbuf[p]st == map(he.he.mesg;queue(p;st.h))
DISPbuf_dfEdAlias ap ::Parens ::Prec(apply):: {[SOFT}buf[<p:pid:E>]{\\}<s:state:L>{]} == buf[<p>]<s> buf[<p:pid>]'== buf[<p>]' buf[<p:pid>]_== buf[<p>]_
THMbuf_wfs:state. p:. buf[p]_ mesg List
DISPinbuf_dfParens ::Prec(atomrel):: {->0}<M:M:*>{<-}{\\? } {->0}buf[<p:p:*>]{\\}<s:s:*>{<-} == <M> buf[<p>] <s> Parens ::Prec(atomrel):: {->0}<M:M:*>{<-}{\\? } {->0}buf[<p:p:*>]'{<-} == <M> buf[<p>]' Parens ::Prec(atomrel):: {->0}<M:M:*>{<-}{\\? } {->0}buf[<p:p:*>]_{<-} == <M> buf[<p>]_
ABSinbufM buf[p]st == list_el(mesg;M;buf[p]st)
THMinbuf_wfs:state. M:mesg. p:. (M buf[p]_)
THMinbuf_sents:state. M:mesg. q:. M buf[q]_ (p:PId. list_el(hist_el;mk_hist_el(true;p;q;M);s.h))
THMbuf_not_emptys:state. p:. (next_mesg(p;s.h).type = 0) mt(buf[p]_)
THMnext_mesg_last_els:state. p:. (next_mesg(p;s.h).type = 0) next_mesg(p;s.h) = last_el(buf[p]_)
THMnext_mesg_in_bufs:state. p:. (next_mesg(p;s.h).type = 0) next_mesg(p;s.h) buf[p]_
THMnext_mesg_in_buf_fs:state. p:PId. (next_mesg(p;s.h).type = 0) next_mesg(p;s.h) buf[p]_
MLbase_simpset2simpset_add `base` (unfold_top_simp `inbuf`) ;; simpset_add `base` (unfold_top_simp `mk_id`) ;;
MLbase1_simpset2map ((simpset_add `base1`) o lemma_simp) ``hsend_he_send_rw hreceive_he_send_rw`` ;;
COMsci_base_7---- Trace Semantics -------------------------------------
ABSin_progin_prog{}(a; prg) == list_el(com;a;prg.actions)
THMin_prog_wfa:com. p:prog{}. in_prog{}(a; p)
ABSenabledenabled{}(s; a) == (as = s)
THMenabled_wfs:state. a:com. enabled{}(s; a)
ABStracetrace{} == state
THMtrace_wftrace{}
ABStvaltri == tr i
THMtval_wftr:trace{}. i:. tri state
DISPtval_dfEdAlias ap ::Parens ::Prec(apply):: {[SOFT}<tr:trace:E>{\\}<i:nat:L>{]} == <tr><i>
ABStrace_oftrace_of{}(prg; tr) == (i:. a:com. in_prog{}(a; prg) a(tri) = tr(i + 1)) (prg.init) (tr0)
THMtrace_of_wfp:prog{}. tr:trace{}. trace_of{}(p; tr)
ABSweak_fairweak_fair{}(p; tr) == a:com in_prog{}(a; p) (k: (i:. k < i enabled{}((tri); a)) (i:. k < i a(tri) = tr(i + 1)))
THMweak_fair_wfp:prog{}. tr:trace{}. weak_fair{}(p; tr)
ABSstrong_fairstrong_fair{}(p; tr) == a:com in_prog{}(a; p) (k: (i:. j:. (k < i i < j) enabled{}((trj); a)) (i:. k < i (a(tri) = tr(i + 1))))
THMstrong_fair_wfp:prog{}. tr:trace{}. strong_fair{}(p; tr)
ABSin_tracein_trace{}(s; tr) == i:. tri = s
THMin_trace_wfs:state. tr:trace{}. in_trace{}(s; tr)
ABSin_execin_exec{}(prg; s) == tr:trace{}. trace_of{}(prg; tr) in_trace{}(s; tr)
THMin_exec_wfprg:prog{}. s:state. in_exec{}(prg; s)
THMnext_in_execprg:prog{}. s:state. a:com. in_exec{}(prg; s) in_prog{}(a; prg) in_exec{}(prg; (as))
ABSin_weak_fair_execin_weak_fair_exec{}(prg; s) == tr:trace{} weak_fair{}(prg; tr) trace_of{}(prg; tr) in_trace{}(s; tr)
THMin_weak_fair_exec_wfprg:prog{}. s:state. in_weak_fair_exec{}(prg; s)
ABSin_strong_fair_execin_strong_fair_exec{}(prg; s) == tr:trace{} weak_fair{}(prg; tr) trace_of{}(prg; tr) in_trace{}(s; tr)
THMin_strong_fair_exec_wfprg:prog{}. s:state. in_strong_fair_exec{}(prg; s)
ABSin_exec_prin_exec_pr{}(prg; s; s') == tr:trace{} trace_of{}(prg; tr) (i:. tri = s tr(i + 1) = s')
THMin_exec_pr_wfprg:prog{}. s,s':state. in_exec_pr{}(prg; s; s')
COMsci_base_8---- Logic -----------------------------------------------
DISPhtriple_dfhtriple(<s:var>.<A:A:*><prg:prg:*><s:var>.<B:B:*>) == htriple(<s>.<A><prg><s>.<B>)
ABShtriplehtriple(s.A[s];prg;s.B[s]) == s:state in_exec{}(prg; s) A[s] (a:com. in_prog{}(a; prg) B[(as)])
THMhtriple_wfprg:prog{}. A,B:state . htriple(s.A[s];prg;s.B[s])
THMhtriple_conjprg:prog{}. A,B,C:state . htriple(s.A[s];prg;s.B[s]) htriple(s.A[s];prg;s.C[s]) htriple(s.A[s];prg;s.B[s] C[s])
THMhtriple_pre_conjprg:prog{}. A,B,C:state . htriple(s.A[s];prg;s.C[s]) htriple(s.A[s] B[s];prg;s.C[s])
THMhtriple_dischargeprg:prog{}. A,B:state . htriple(s.A[s] B[s];prg;s.B[s]) (s:state. B[s] A[s]) htriple(s.A[s] B[s];prg;s.A[s] B[s])
ABSinvinv{}(prg; s.I[s]) == s:state. in_exec{}(prg; s) I[s]
THMinv_wfprg:prog{}. I:state . inv{}(prg; s.I[s])
THMdecomp_invprg:prog{}. I:state . (s:state. (prg.init) s I[s]) (s:state in_exec{}(prg; s) I[s] (a:com. in_prog{}(a; prg) I[as])) inv{}(prg; s.I[s])
THMdecomp_inv_prprg:prog{}. I:state . (s:state. (prg.init) s I[s]) (s,s':state. in_exec_pr{}(prg; s; s') I[s] I[s']) inv{}(prg; s.I[s])
THMinv_weakenprg:prog{}. I,J:state . inv{}(prg; s.I[s]) (s:state. I[s] J[s]) inv{}(prg; s.J[s])
THMhtriple_invprg:prog{}. I:state . (s:state. (prg.init) s I[s]) (htriple(s.I[s];prg;s.I[s]) inv{}(prg; s.I[s]))
ABSinv_Winv_W{}(prg; s.P[s]; s.Q[s]) == s:state in_exec{}(prg; s) P[s] Q[s] (a:com. in_prog{}(a; prg) P[(as)] Q[(as)])
THMinv_W_wfprg:prog{}. P,Q:state . inv_W{}(prg; s.P[s]; s.Q[s])
ABSinv_Uinv_U{}(prg; s.P[s]; s.Q[s]) == tr:trace{} trace_of{}(prg; tr) weak_fair{}(prg; tr) (i: P[(tri)] (j:{x:| x i } Q[(trj)] (k:{x:| i x < j} . P[(trk)])))
THMinv_U_wfprg:prog{}. P,Q:state . inv_U{}(prg; s.P[s]; s.Q[s])

the other theories