Searched refs:right (Results 201 - 225 of 370) sorted by relevance
1234567891011>>
/seL4-l4v-10.1.1/HOL4/src/1/ |
H A D | Drule.sml | 836 * Inverse of LIST_CONJ : flattens only right conjuncts. * 935 | i.e. the right-hand side is put into the antecedent. false focuses on the 936 | right hand side. If the list is empty, the equation is not splitted. 2262 ("Theorem not of right form: must be\n\ 2307 ("Theorem not of right form: must be\n\ 2349 ("Theorem not of right form: must be\n\ 2402 ("Theorem not of right form: must be\n\ 2496 the bound variable on the right is actually still an x because
|
H A D | TypeBase.sml | 364 the same right-hand-side and it doesn't depend on any pattern variables.
|
/seL4-l4v-10.1.1/HOL4/src/integer/ |
H A D | OmegaSymbolic.sml | 235 right associated 411 appropriate rewrite from OmegaTheory. The right choice of rewrite
|
H A D | OmegaSimple.sml | 35 from left to right, and aren't duplicated.
|
/seL4-l4v-10.1.1/HOL4/src/pfl/ |
H A D | index.sml | 352 val right = mk_is_some(dest_the rapp) value 355 val deftm = mk_eq(list_mk_comb(dom_var, args),right)
|
/seL4-l4v-10.1.1/HOL4/src/res_quan/src/ |
H A D | res_quanLib.sml | 135 val (left,right) = dest_conj conj 137 val right_pred = mk_abs(var,right)
|
H A D | Cond_rewrite.sml | 191 (* search_top_down carries out a top-down left-to-right search for *)
|
/seL4-l4v-10.1.1/HOL4/src/unwind/Manual/ |
H A D | description.tex | 372 line variable has a right-hand side of an equation associated with it. The 373 free variables in each right-hand side are computed and those that are also
|
/seL4-l4v-10.1.1/HOL4/tools/Holmake/ |
H A D | Holmake_tools.sml | 243 if p = mypath then diag (K "In the right HOL distribution") 655 (* All files on the right of a colon are assumed to be dependencies.
|
H A D | ReadHMF.sml | 157 error b ("No right-paren in "^nm^" line")
|
/seL4-l4v-10.1.1/HOL4/tools/mlyacc/mlyacclib/ |
H A D | MLY_parser2.sml | 392 let fun del(0,accum,left,right,lexPair) = 394 pos=qPos,leftPos=left,rightPos=right,
|
/seL4-l4v-10.1.1/HOL4/examples/ARM_security_properties/ |
H A D | ARM_proverLib.sml | 579 (* proof of the right part*) 592 (* combining the left and right parts *)
|
H A D | ARM_prover_extLib.sml | 312 (* proof of the right part*) 315 (* combining the left and right parts *)
|
/seL4-l4v-10.1.1/HOL4/polyml/libpolyml/libffi/src/powerpc/ |
H A D | linux64_closure.S | 321 # ie. right justified. Larger structs are passed left justified
|
/seL4-l4v-10.1.1/HOL4/examples/formal-languages/regular/regular-play/src/ |
H A D | regexMarkedScript.sml | 334 (* recursively, m says whether to start, c says what to match, this should be right for all marks that are already there and the virtual mark m *)
|
/seL4-l4v-10.1.1/HOL4/polyml/mlsource/extra/Win/ |
H A D | Metafile.sml | 24 type RECT = { top: int, left: int, bottom: int, right: int }
|
H A D | Clipboard.sml | 142 right form of subclassing to allow all the various handle types to be combined. *)
|
/seL4-l4v-10.1.1/HOL4/src/coretypes/ |
H A D | PairedLambda.sml | 211 (* the right-hand side of the input theorem th, at the places that *)
|
H A D | pairSyntax.sml | 59 in left-to-right order.
|
/seL4-l4v-10.1.1/HOL4/src/portableML/poly/ |
H A D | Intset.sml | 107 if rn>=wt ln then (*right is too big*)
|
/seL4-l4v-10.1.1/HOL4/src/real/ |
H A D | hratScript.sml | 310 (* Save theorems and make sure they are all of the right form *)
|
/seL4-l4v-10.1.1/HOL4/src/simp/src/ |
H A D | Traverse.sml | 168 (* This code is used just once, to do the right thing with the
|
H A D | boolSimps.sml | 365 * - inwards into right of implications
|
/seL4-l4v-10.1.1/HOL4/examples/HolCheck/examples/ |
H A D | amba_ahb.sml | 127 (* default master always the bus upon request (either right away, or if masked then after demasking via hsplit) *)
|
/seL4-l4v-10.1.1/HOL4/examples/HolCheck/ |
H A D | stringBinTree.sml | 50 fun rmid L = List.nth(L,(List.length L) div 2); (* return middle or right middle element *)
|
Completed in 326 milliseconds
1234567891011>>