Searched refs:same (Results 376 - 400 of 478) sorted by relevance
<<11121314151617181920
| /seL4-l4v-master/HOL4/Manual/Description/ |
| H A D | QuantHeuristics.tex | 236 also a conversion called \holtxt{INST\_QUANT\_CONV} with the same
|
| /seL4-l4v-master/HOL4/Manual/Translations/IT/Description/ |
| H A D | QuantHeuristics.tex | 236 also a conversion called \holtxt{INST\_QUANT\_CONV} with the same
|
| /seL4-l4v-master/HOL4/examples/HolCheck/examples/ |
| H A D | amba_ahbScript.sml | 390 it is triggered in the same cycle (see Ra and {3-31})*)
|
| /seL4-l4v-master/HOL4/examples/lambda/typing/ |
| H A D | type_schemasScript.sml | 8 is the same thing as
|
| /seL4-l4v-master/HOL4/examples/machine-code/compiler/ |
| H A D | reg_allocLib.sml | 539 used in the same instruction
|
| /seL4-l4v-master/HOL4/examples/miller/formalize/ |
| H A D | extra_realScript.sml | 60 (* the same theorem in realTheory is slightly different *)
|
| /seL4-l4v-master/HOL4/examples/miller/prob/ |
| H A D | prob_canonScript.sml | 59 (* 1. Canonical form is the same as sorted, prefixfree and twinfree. *)
|
| /seL4-l4v-master/HOL4/src/probability/ |
| H A D | hurdUtils.sml | 1058 (* i.e., the same goal, and a new assumption list that logically *)
|
| H A D | martingaleScript.sml | 440 >> EQ_TAC >> STRIP_TAC (* 2 subgoals, same tactics *)
482 >> CONJ_TAC (* 2 subgoals, same tactics *)
512 RW_TAC std_ss [SUBSET_DEF, IN_CROSS] >| (* 2 subgoals, same ending *)
4778 >- (CONJ_TAC \\ (* 2 subgoals, same tactics *)
|
| /seL4-l4v-master/HOL4/examples/algebra/ring/ |
| H A D | ringIntegerScript.sml | 681 (3) same as (1)
|
| H A D | ringDividesScript.sml | 126 val _ = set_fixity "rdivides" (Infix(NONASSOC, 450)); (* same as relation *)
|
| /seL4-l4v-master/HOL4/examples/algebra/polynomial/ |
| H A D | polyWeakScript.sml | 1420 (* Others proofs of the same result by element *)
1911 This picture holds only for lists of the same length:
4422 (* Proof: by induction on p, the lists are of the same length.
4454 (* Proof: due to lists are of the same length.
|
| /seL4-l4v-master/HOL4/examples/algebra/finitefield/ |
| H A D | ffConjugateScript.sml | 1801 (* Another proof of the same theorem. *)
1830 (* Third proof of the same theorem, without counting conjugates. *)
2122 val _ = set_fixity "~~" (Infix(NONASSOC, 450)); (* same as relation *)
2826 (* Another proof of the same result *)
|
| H A D | ffBasicScript.sml | 673 (* Better Proof of same theorem. *)
|
| /seL4-l4v-master/HOL4/examples/fun-op-sem/small-step/ |
| H A D | forSmallScript.sml | 1065 (* Prove that the straightforward definition of the semantics are the same as
|
| /seL4-l4v-master/HOL4/examples/algebra/lib/ |
| H A D | MobiusScript.sml | 707 and m = 1 by SING_DEF, IN_SING (same as MAX_SET_SING)
|
| /seL4-l4v-master/HOL4/src/coalgebras/ |
| H A D | coalgAxiomsScript.sml | 94 (* same as an "all" test *)
|
| /seL4-l4v-master/HOL4/polyml/basis/ |
| H A D | BasicStreamIO.sml | 136 and the new one so reading on either adds to the same chain. *)
|
| /seL4-l4v-master/HOL4/examples/algebra/group/ |
| H A D | groupOrderScript.sml | 855 (3) same as (1)
|
| /seL4-l4v-master/HOL4/src/parse/ |
| H A D | Parse.sml | 1249 (* when new_theory is called, and if the new theory has the same name
|
| /seL4-l4v-master/HOL4/src/real/ |
| H A D | realSimps.sml | 387 Derived from code to do the same for the natural numbers, which is in
|
| /seL4-l4v-master/HOL4/examples/fermat/twosq/ |
| H A D | iterateComputeScript.sml | 397 (* Idea: the same result, but start with j = 0, and remove 0 < n. *)
|
| H A D | windmillScript.sml | 882 val _ = set_fixity "involute" (Infix(NONASSOC, 450)); (* same as relation *)
|
| /seL4-l4v-master/HOL4/examples/algebra/monoid/ |
| H A D | monoidOrderScript.sml | 1162 (* Better proof of the same theorem. *)
|
| /seL4-l4v-master/HOL4/polyml/mlsource/MLCompiler/ |
| H A D | DEBUGGER_.sml | 548 value if we are compiling a match. In that case the same expression
|
Completed in 523 milliseconds
<<11121314151617181920