/seL4-l4v-master/isabelle/src/Doc/Logics/document/ |
H A D | Sequents.tex | 16 perform proofs in this same informal way, and without requiring the
|
H A D | LK.tex | 306 to structure a proof into lemmas, avoiding repeated proofs of the same 381 are essentially the same; the key step here is to use \tdx{exR} rather than 640 them in any order leads to essentially the same result. Backtracking may
|
/seL4-l4v-master/l4v/isabelle/src/Doc/Logics/document/ |
H A D | Sequents.tex | 16 perform proofs in this same informal way, and without requiring the
|
H A D | LK.tex | 306 to structure a proof into lemmas, avoiding repeated proofs of the same 381 are essentially the same; the key step here is to use \tdx{exR} rather than 640 them in any order leads to essentially the same result. Backtracking may
|
/seL4-l4v-master/HOL4/examples/miller/ho_prover/ |
H A D | skiTools.sml | 116 (BUG "ski_unify" "same var, different types?")
|
/seL4-l4v-master/HOL4/src/postkernel/ |
H A D | DB.sml | 63 same name. There is a list of them because item-names are really
|
/seL4-l4v-master/HOL4/examples/AKS/theories/ |
H A D | AKSshiftScript.sml | 139 val _ = set_fixity "intro_" (Infix(NONASSOC, 450)); (* same as relation *)
|
/seL4-l4v-master/HOL4/src/coretypes/ |
H A D | pairSyntax.sml | 397 (* Generates a pair structure of variable with the same structure as *)
|
/seL4-l4v-master/HOL4/src/simp/src/ |
H A D | boolSimps.sml | 173 This is essentially the same as the old REWRITE_TAC []
|
/seL4-l4v-master/HOL4/src/bool/ |
H A D | boolpp.sml | 198 Instead, all 6 components above are in the same printing block,
|
/seL4-l4v-master/HOL4/src/parse/ |
H A D | Parse.sig | 88 way that the exported theory will have the same grammar *)
|
H A D | term_grammar.sml | 410 the same name are rare, but it's quite reasonable for many 411 types/terms to share the same theory *) 578 priv_a2string a1^" and "^priv_a2string a2^") at same level") 591 | _ => raise GrammarError "Attempt to have different forms at same level"
|
/seL4-l4v-master/HOL4/polyml/basis/ |
H A D | ForeignMemory.sml | 123 the same as subtracting 1. *)
|
/seL4-l4v-master/HOL4/polyml/mlsource/MLCompiler/ParseTree/ |
H A D | BASE_PARSE_TREE.sml | 220 patterns in each clause. It checks that they are the same in each
|
/seL4-l4v-master/HOL4/examples/algebra/group/ |
H A D | subgroupScript.sml | 62 h.op = Binary operation of subgroup, same as g.op = *. 63 h.id = Identity element of subgroup, same as g.id = #e. 782 (3) same as (1) 794 (* Theorem: All cosets of subgroup are of the same size as the subgroup *)
|
H A D | groupScript.sml | 48 (* Data type (same as monoid): 198 (* Monoid and Group share the same type: already defined in monoid.hol 1172 Take the same y, then y <> z by monoid_invertibles_element
|
/seL4-l4v-master/HOL4/src/1/ |
H A D | TypeBase.sml | 367 the same right-hand-side and it doesn't depend on any pattern variables.
|
/seL4-l4v-master/HOL4/examples/fermat/twosq/ |
H A D | iterateComposeScript.sml | 457 (* Better proof of the same theorem. *) 646 (* Better proof of the same theorem. *) 758 (* Better proof of the same theorem. *) 1215 if odd period, to have the same equality, iterate_mate is tricky to define!
|
/seL4-l4v-master/HOL4/src/integer/ |
H A D | OmegaMLShadow.sml | 362 same constraint key in the tree with a less or equal constant, 411 (and they're all the same variable) 439 non-zero coefficient, and its everywhere the same variable. Our aim
|
/seL4-l4v-master/HOL4/src/metis/ |
H A D | mlibOmega.sml | 407 same constraint key in the tree with a less or equal constant, 463 (and they're all the same variable) 491 non-zero coefficient, and its everywhere the same variable. Our aim
|
/seL4-l4v-master/isabelle/src/Tools/Metis/src/ |
H A D | selftest.sml | 461 (* Testing the rewriting with disequalities in the same clause *) 1072 fun same n = raise Fail ("Two goals called " ^ n); function 1104 | SOME _ => same name
|
/seL4-l4v-master/isabelle/src/Doc/Tutorial/document/ |
H A D | rules.tex | 166 same purpose: 625 terms. The simplest case is when the two terms are already the same. Next 633 the rule or proof state are updated at the same time. 740 it would be with the \isa{rule} method. At the same time \isa{erule} looks 776 This use of the \methdx{subst} method has the same effect as the command 966 same inference. 1049 logic texts present it using the same notation for substitution. 1685 a subgoal are replaced by~$Q$. The simplifier performs the same 1990 %can we achieve the same effect using \isa{THEN} with the rule \isa{ssubst}? 2067 the same ide [all...] |
/seL4-l4v-master/l4v/isabelle/src/Tools/Metis/src/ |
H A D | selftest.sml | 461 (* Testing the rewriting with disequalities in the same clause *) 1072 fun same n = raise Fail ("Two goals called " ^ n); function 1104 | SOME _ => same name
|
/seL4-l4v-master/l4v/isabelle/src/Doc/Tutorial/document/ |
H A D | rules.tex | 166 same purpose: 625 terms. The simplest case is when the two terms are already the same. Next 633 the rule or proof state are updated at the same time. 740 it would be with the \isa{rule} method. At the same time \isa{erule} looks 776 This use of the \methdx{subst} method has the same effect as the command 966 same inference. 1049 logic texts present it using the same notation for substitution. 1685 a subgoal are replaced by~$Q$. The simplifier performs the same 1990 %can we achieve the same effect using \isa{THEN} with the rule \isa{ssubst}? 2067 the same ide [all...] |
/seL4-l4v-master/HOL4/examples/algebra/monoid/ |
H A D | monoidMapScript.sml | 281 (* This is the same as monoid_homo_trans *) 470 (* This is the same as monoid_iso_trans. *) 511 (* This is the same as monoid_iso_sym, just a direct proof. *)
|