Searched refs:same (Results 126 - 150 of 478) sorted by relevance

1234567891011>>

/seL4-l4v-master/HOL4/Manual/Logic/
H A Dsemantics.tex245 is the result of performing the same substitution across all of the
283 \PPL\index{PPlambda (same as PPLAMBDA), of LCF system@\ml{PP}$\lambda$ (same as \ml{PPLAMBDA}), of \ml{LCF} system}, since \HOL{} was
286 the same as the corresponding rule in \LCF; the code implementing this
399 The theory \theory{LOG} has the same type
893 constant $\con{c}_i$ must be the same as the type of the corresponding
1066 the introduced constants have, via their types, the same dependency on
1068 situation is the same as that discussed in the Remark in
1307 provides one way of achieving this while at the same time preserving
1501 $q$ in $M'$ are the same a
[all...]
/seL4-l4v-master/HOL4/examples/algebra/polynomial/
H A DpolyDividesScript.sml354 (* not same as polyDivideTheory.poly_unit_property (which specifies upoly u instead of just poly u):
560 val _ = set_fixity "pdivides" (Infix(NONASSOC, 450)); (* same as relation *)
692 (* Another proof of the same theorem, with p, q interchanged. *)
713 (* Third proof of the same theorem. *)
1074 (* Original proof of the same theorem *)
1241 (* Original proof of the same theorem *)
1346 (* Original proof of the same theorem. *)
1421 (* Original proof of the same theorem. *)
1547 (* This is the same as poly_divides_mult, different proof. *)
1992 val _ = set_fixity "=~" (Infix(NONASSOC, 450)); (* same a
[all...]
/seL4-l4v-master/HOL4/examples/boyer_moore/
H A Dboyer_moore_specScript.sml38 (* The capacity to skip and produce the same solution set *)
/seL4-l4v-master/HOL4/examples/dev/sw2/
H A DfuncCall.sml182 statement match, i.e. both branches have the same outputs.
/seL4-l4v-master/HOL4/examples/formal-languages/lambek/
H A DCutFreeScript.sml462 >> REPEAT STRIP_TAC (* 12 subgoals, all sharing the same tacticals *)
1037 STRIP_TAC \\ (* 2 sub-goals here, sharing the same tactical *)
1042 STRIP_TAC \\ (* 2 sub-goals here, sharing the same tactical *)
1047 STRIP_TAC >| (* 2 sub-goals here, sharing the same tactical *)
/seL4-l4v-master/HOL4/polyml/mlsource/extra/Win/
H A DScrollbar.sml202 (* The same values are used with different names for horizontal and vertical bars.
H A DClass.sml194 (* We can't use the same definition of WNDCLASSEX as above because
H A DFontBase.sml146 [CLIP_DEFAULT_PRECIS] is the same as [] i.e. zero. *)
/seL4-l4v-master/HOL4/src/HolSat/
H A DminisatProve.sml156 (* same functionality for ZChaff, if installed by user *)
/seL4-l4v-master/HOL4/src/IndDef/
H A DInductiveDefinition.sml31 same name, maybe it should.
575 (* Generalize definitions and theorem over given variables (all the same!) *)
860 (* All relations in a given call must have the same schematic args (if they *)
862 (* the first arguments to each relation, in the same order(!) *)
/seL4-l4v-master/HOL4/src/finite_maps/
H A DtcTacs.sml8 (* proving it equal to a term of the same form without the ^+ . *)
/seL4-l4v-master/HOL4/src/integer/
H A DintSimps.sml96 Derived from code to do the same for the natural numbers, which is in
/seL4-l4v-master/HOL4/src/temporal/
H A Dexamples.sml116 is true all the time. The same holds for PNEXT (PALWAYS a) and
/seL4-l4v-master/HOL4/tools/mlyacc/src/
H A Dshrink.sml108 idea is to sort the entries and place duplicates entries in the same
/seL4-l4v-master/HOL4/developers/
H A Dprehol.sml219 (* used to stand for "has double quote", but the same analysis is necessary
/seL4-l4v-master/HOL4/examples/HolCheck/
H A DmuSyntax.sml353 (* take f:mu and create a HOL term that replaces all :mu constants by bool names of the same type structure.
463 (* return a string term that is not the same as any in l, formed by priming mv enough times *)
470 (* rename all bound vars so that no two are the same, or clash with a free var name *)
522 (* return the max same-quantifier nesting depth of the given formula *)
/seL4-l4v-master/HOL4/examples/acl2/ml/
H A Dmake_sexp.ml404 (* (complex-rationalp #c(3 0)) ; nil, since #c(3 0) is the same as 3 *)
429 (* (complex x 0) ; same as x, for rational numbers x *)
439 (* The reader macro #C (which is the same as #c) provides a convenient way *)
441 (* #C(x y) is read to the same value as (complex x y). *)
H A DsexpScript.sml430 (* (complex-rationalp #c(3 0)) ; nil, since #c(3 0) is the same as 3 *)
455 (* (complex x 0) ; same as x, for rational numbers x *)
465 (* The reader macro #C (which is the same as #c) provides a convenient way *)
467 (* #C(x y) is read to the same value as (complex x y). *)
/seL4-l4v-master/HOL4/polyml/basis/
H A DArray2.sml52 (* Check that all the lists have the same length. *)
H A DPackWord8Big.sml49 (* Exactly the same as Pack8Big except for the value of isBigEndian *)
/seL4-l4v-master/isabelle/src/Doc/Tutorial/document/
H A Dfp.tex148 By the same device you can also write bounded quantifiers like
170 during proofs by simplification. The same is true for the equations in
383 same cardinality --- an impossibility. For the same reason it is not possible
H A Dnumerics.tex17 Most numeric operations are overloaded: the same symbol can be
268 ML treats negative divisors in the same way, but most computer hardware
269 treats signed operands using the same rules as for multiplication.
341 for type \isa{real} have the same syntax as those for type
H A Dprotocol.tex115 If Charlie tries the same attack, Alice will receive the message
/seL4-l4v-master/HOL4/examples/machine-code/lisp/
H A Dlisp_semanticsScript.sml171 (* Label-defined functions share the same namespace). *)
/seL4-l4v-master/isabelle/src/HOL/MicroJava/document/
H A Dintroduction.tex66 same data types are supported and bytecode instructions required for

Completed in 168 milliseconds

1234567891011>>