Searched refs:same (Results 401 - 425 of 478) sorted by relevance

<<11121314151617181920

/seL4-l4v-master/HOL4/src/probability/
H A DborelScript.sml457 (* `fn_plus f x + fn_minus f x` is always defined (same reason as above) *)
1773 (* the same theorems with more meaningful names, new *)
4025 fs [Borel, PREIMAGE_UNION, UNION_OVER_INTER'] (* 3 subgoals, same tactics *) \\
4153 (* 2 subgoals, same tactics below *)
5413 (* "open" (J) and "half open" (H) intervals of the same bounds *)
5920 >- fs [REAL_LE_LT] \\ (* 2 goals left, same tactics *)
6942 >> EQ_TAC >> rpt STRIP_TAC >> Q.EXISTS_TAC `N` (* 2 subgoals, same tactics *)
8138 fs [Borel, PREIMAGE_UNION, UNION_OVER_INTER'] (* 3 subgoals, same tactics *) \\
9098 fs [Borel, PREIMAGE_UNION, UNION_OVER_INTER'] (* 3 subgoals, same tactics *) \\
/seL4-l4v-master/HOL4/src/1/
H A DConv.sml707 then raise ERR "AND_FORALL_CONV" "forall'ed variables not the same"
787 raise ERR "OR_EXISTS_CONV" "Variables not the same"
/seL4-l4v-master/HOL4/Manual/Translations/IT/Logic/
H A Dsemantics.tex283 \PPL\index{PPlambda (same as PPLAMBDA), of LCF system@\ml{PP}$\lambda$ (same as \ml{PPLAMBDA}), of \ml{LCF} system}, dal momento che \HOL{} � stato
/seL4-l4v-master/HOL4/examples/simple_complexity/loop/
H A DloopDecreaseScript.sml693 (* This is the same as hop_exceeds: |- !b n. 0 < b ==> n <= b * hop b n *)
1942 (* This is the same, but directly from the SUM *)
H A DloopDivideScript.sml801 (* This is the same as pop_exceeds: |- !b n. 1 < b ==> n < b ** pop b n *)
2030 (* This is the same, but directly from the SUM *)
/seL4-l4v-master/HOL4/examples/fun-op-sem/ml/
H A DtypeSoundScript.sml86 apply them; in our syntax we can of course achieve the same in e by:
1605 value has the same type as the original expression, and if they terminate with
/seL4-l4v-master/HOL4/examples/algebra/ring/
H A DringScript.sml344 prod: 'a monoid (* monoid and group share the same type *)
2435 (* This export is very bad, same as conversion. *)
/seL4-l4v-master/HOL4/examples/algebra/field/
H A DfieldScript.sml56 (* Data type (same as ring):
502 (* Field and Ring share the same type. *)
/seL4-l4v-master/HOL4/src/HolSmt/
H A DZ3_ProofReplay.sml910 future uses of the same proof ID merely require a lookup in the
/seL4-l4v-master/HOL4/src/IndDef/Manual/
H A Dpaper.tex544 the terms that occur at these positions must be the same variables given in the
/seL4-l4v-master/HOL4/src/emit/
H A Dbasis_emitScript.sml354 (* Map 0 and ZERO to the same thing in generated ML. *)
/seL4-l4v-master/HOL4/src/quotient/examples/lambda/
H A DalphaScript.sml56 (* the variables must each be found at the same place. *)
/seL4-l4v-master/HOL4/src/quotient/examples/sigma/
H A DreductionScript.sml249 But the following definition is not the same as that in relationTheory. *)
/seL4-l4v-master/HOL4/src/unwind/
H A DunwindLib.sml110 "bound vars do not have same name"
/seL4-l4v-master/HOL4/tools/mllex/
H A Dmllex.sml20 user declarations at same level as makeLexer, etc.
/seL4-l4v-master/HOL4/examples/acl2/ml/
H A DpolytypicLib.sml401 (* Exactly the same as Prim.prove_rec_fn_exists but performs checking on *)
624 " which was not universally quantified with a variable of the same type!"))
2387 (* a) Exactly the same type is visited twice *)
3116 (* Make sure we have exactly the same form as the term we were given *)
/seL4-l4v-master/isabelle/src/Doc/Intro/document/
H A Dgetting.tex66 zero, while {\tt?z6} has identifier {\tt"z"} and subscript~6. The same
/seL4-l4v-master/HOL4/examples/lambda/barendregt/
H A Dchap3Script.sml528 (* This is not the same CR as appears in There
/seL4-l4v-master/l4v/isabelle/src/Doc/Intro/document/
H A Dgetting.tex66 zero, while {\tt?z6} has identifier {\tt"z"} and subscript~6. The same
/seL4-l4v-master/HOL4/examples/CCS/
H A DStrongLawsScript.sml213 (* Unused recursion variables have the same behavior as `nil` *)
/seL4-l4v-master/HOL4/examples/miller/ho_prover/
H A Dho_proverTools.sml1187 val _ = assert (a_pos <> pos) (ERR "anc_frule" "same polarity")
/seL4-l4v-master/HOL4/examples/fun-op-sem/for/
H A DforScript.sml1014 (* Everything above current clock gives same result if didn't time out*)
/seL4-l4v-master/HOL4/examples/algebra/polynomial/
H A DpolyDivisionScript.sml979 (* Another proof of same result. *)
/seL4-l4v-master/HOL4/src/sort/
H A DsortingScript.sml1245 (* PART3_FILTER - Partition is the same as filtering. *)
/seL4-l4v-master/HOL4/polyml/mlsource/extra/Win/
H A DBase.sml340 val cDWORD_PTR = cULONG_PTR (* Defined to be the same so I'm not sure why it's there .*)

Completed in 456 milliseconds

<<11121314151617181920