/seL4-l4v-master/HOL4/examples/HolCheck/ |
H A D | decompTools.sml | 120 note that this ks1T is not the same as the ks1T needed in the ap_ext proof: that was for the unlifted ks (e.g. apb),
|
/seL4-l4v-master/HOL4/examples/acl2/ml/ |
H A D | acl2encodeLib.sig | 172 (* These functions work in exactly the same way as the non-polymorphic *)
|
/seL4-l4v-master/HOL4/polyml/mlsource/extra/Win/ |
H A D | DeviceBase.sml | 282 (* The size of the structure is the same in both 32-bit and 64-bit modes
|
/seL4-l4v-master/HOL4/examples/logic/propositional_logic/ |
H A D | PropLogicScript.sml | 224 (* (same as cases 1-3)*)
|
/seL4-l4v-master/HOL4/src/1/ |
H A D | Thm_cont.sml | 268 * variables in each of yl1...yln have the same types as the
|
H A D | dep_rewrite.sml | 59 (* remove duplicates; thus, several theorems with the same *) 60 (* hypothesis, or several uses of the same theorem, will generate *)
|
/seL4-l4v-master/HOL4/src/AI/sml_inspection/ |
H A D | smlParallel.sml | 42 Simplest parmap (probably the same behavior as Parmap.parmap)
|
/seL4-l4v-master/HOL4/examples/CCS/ |
H A D | TraceScript.sml | 522 >> EQ_TAC (* 2 goals here, same tactic *)
|
H A D | CCSScript.sml | 689 STRIP_TAC >> art [] (* 3 sub-goals, same initial tactics *) 781 >> IMP_RES_TAC TRANS_RESTR (* two sub-goals here, but same proofs *)
|
/seL4-l4v-master/HOL4/examples/algebra/group/ |
H A D | symmetryGroupScript.sml | 112 val _ = set_fixity "on" (Infix(NONASSOC, 450)); (* same as relation *)
|
/seL4-l4v-master/HOL4/examples/algebra/ring/ |
H A D | integralDomainScript.sml | 242 (* Another proof of the same result. *)
|
/seL4-l4v-master/HOL4/src/marker/ |
H A D | markerLib.sml | 455 multiples of the same name, the most recent will be taken.
|
/seL4-l4v-master/seL4/manual/parts/ |
H A D | threads.tex | 143 Round-robin threads are treated that same as sporadic threads except for one case: how the 179 \apifunc{seL4\_SchedContext\_Bind}{schedcontext_bind}, both invocations have the same effect 565 in the same format as outlined in \autoref{sec:read_write_registers}. 668 exist and are manipulated in exactly the same manner as the objects for the regular virtual
|
/seL4-l4v-master/HOL4/src/boss/ |
H A D | selftest.sml | 419 printarg = K "after setting parents, same raises UNCHANGED",
|
/seL4-l4v-master/HOL4/examples/algebra/lib/ |
H A D | GaussScript.sml | 599 (* Define the set of values with the same gcd *) 1154 (3) same as (1), true by divisors_has_cofactor. 1291 (3) same as (1), true by gcd_matches_divisor_element, 1561 Hence the same function as:
|
/seL4-l4v-master/HOL4/src/datatype/mutrec/ |
H A D | ConsThms.sml | 97 may have the same name as the args for CONS2, and we need to qualify 299 may have the same name as the args for CONS2, and we need to qualify
|
/seL4-l4v-master/HOL4/src/integer/ |
H A D | CooperMath.sml | 687 of each multiplication is the same numeral. We want to turn 894 var to be the same lcm *)
|
/seL4-l4v-master/HOL4/src/string/Manual/ |
H A D | description.tex | 145 right-hand sides represent the same ascii code or false (\ml{F}) otherwise. 436 library theory \ml{string} into a parent of \ml{foo}. The same effect could
|
/seL4-l4v-master/HOL4/Manual/Translations/IT/Description/ |
H A D | misc.tex | 23 through the same incantation: 268 make-file target of the same name, see 444 Make-file rules are interpreted in the same way as by traditional 500 does \emph{not} do the same thing as \texttt{protect} on either Unix 521 \] turns a list of files with suffixes \texttt{.sml} into the same 558 present are enabled. These have the same effect as the corresponding 584 \item[\texttt{HOLMOSMLC-C}] This variable is the same as 716 Users can use the same basic technology to ``dump'' heaps of their own.
|
/seL4-l4v-master/HOL4/examples/PSL/1.01/official-semantics/ |
H A D | PropertiesScript.sml | 341 * a SERE r is the same as the clocked semantics with clock equal to T 424 * FL formula f is the same as the clocked semantics with clock equal to T!
|
/seL4-l4v-master/HOL4/polyml/basis/ |
H A D | Real.sml | 557 this in the same way. *) 568 the same sign as the number even if it is zero. *)
|
/seL4-l4v-master/isabelle/src/Doc/Logics_ZF/document/ |
H A D | ZF.tex | 45 predicates. The two systems define essentially the same sets and classes, 142 union or intersection of a set of sets; $\bigcup A$ means the same as 433 same set, if $P(x,y)$ is single-valued. The nice syntax for replacement 466 function \cdx{restrict}$(f,A)$ has the same values as~$f$, but only 1105 concepts satisfy the same properties as their standard counterparts; in 1576 them by a numerical coefficient. It also cancels occurrences of the same 2038 All arguments, other than the recursive one, must be the same in each equation 2556 We perform the same replacement in the assumptions. This is a good
|
/seL4-l4v-master/l4v/isabelle/src/Doc/Logics_ZF/document/ |
H A D | ZF.tex | 45 predicates. The two systems define essentially the same sets and classes, 142 union or intersection of a set of sets; $\bigcup A$ means the same as 433 same set, if $P(x,y)$ is single-valued. The nice syntax for replacement 466 function \cdx{restrict}$(f,A)$ has the same values as~$f$, but only 1105 concepts satisfy the same properties as their standard counterparts; in 1576 them by a numerical coefficient. It also cancels occurrences of the same 2038 All arguments, other than the recursive one, must be the same in each equation 2556 We perform the same replacement in the assumptions. This is a good
|
/seL4-l4v-master/HOL4/tools/Holmake/ |
H A D | Holmake.sml | 330 Assume that we are already in directory dir, and will end in the same 550 file-system; it always looks the same. However, additional
|
/seL4-l4v-master/HOL4/examples/temporal_deep/src/deep_embeddings/ |
H A D | automaton_formulaScript.sml | 283 (* two automata are equivalent if they accept the same set of input traces *) 1005 and A_UNIV (universal) acceptance conditions are the same thing.
|