Searched refs:mk_less (Results 1 - 25 of 37) sorted by relevance

12

/seL4-l4v-10.1.1/HOL4/src/num/arith/src/
H A DArith_cons.sml61 (* mk_less, mk_leq, mk_great, mk_geq *)
64 val mk_less = numSyntax.mk_less value
H A DArith_cons.sig16 val mk_less : term * term -> term value
/seL4-l4v-10.1.1/HOL4/src/integer/testing/
H A Dgen_bc_problem.sml21 val opn = if r < 0.33 then mk_eq else mk_less
H A Dgenproblem.sml22 else if r < 0.4 then mk_less(gen_term(), gen_term())
/seL4-l4v-10.1.1/HOL4/src/HolSmt/
H A DSmtLib_Theories.sml268 ("<", chainable intSyntax.mk_less),
299 ("<", chainable realSyntax.mk_less),
330 ("<", chainable intSyntax.mk_less),
341 ("<", chainable realSyntax.mk_less),
H A DSmtLib_Logics.sml123 ("<", chainable (realSyntax.mk_less o one_int_to_real)),
/seL4-l4v-10.1.1/HOL4/src/real/
H A DrealSyntax.sig65 val mk_less : (term * term) -> term value
H A DrealSyntax.sml143 fun mk_less(t1, t2) = list_mk_comb(less_tm, [t1, t2]) function
/seL4-l4v-10.1.1/HOL4/src/integer/
H A DintSyntax.sig91 val mk_less : (term * term) -> term value
H A DOmegaSimple.sml132 val zero_lt_c = EQT_ELIM (REDUCE_CONV (mk_less(zero_tm, c)))
165 (EQT_ELIM (REDUCE_CONV (mk_less(zero_tm, d_t))))
H A DCooperCore.sml158 val MK_LESS = if use_bis then mk_less else (fn (x,y) => mk_less(y,x))
291 val restriction = mk_conj(mk_less(zero_tm, i),
317 val jrestriction = mk_conj(mk_less(zero_tm, j), mk_leq(j, delta_tm))
359 val zero_lt_delta = EQT_ELIM (REDUCE_CONV (mk_less(zero_tm, delta_tm)))
362 EQT_ELIM (REDUCE_CONV (mk_conj(mk_less(zero_tm, one_tm),
H A DintSyntax.sml135 fun mk_less (tm1, tm2) = list_mk_comb(less_tm, [tm1, tm2]) function
H A DjrhCore.sml106 val zero_lt_lcm = EQT_ELIM (REDUCE_CONV (mk_less(zero_tm, lcm_t)))
/seL4-l4v-10.1.1/HOL4/src/floating-point/
H A Dbinary_ieeeLib.sml318 fun mk_abs_diff_lt (x, r, u) = realSyntax.mk_less (mk_abs_diff (x, r), u)
322 fun mk_abs_lt (r, x) = realSyntax.mk_less (cond_mk_absval true r, x)
434 (realSyntax.mk_less
527 realSyntax.mk_less (x, mk_neg_large tw)
535 val lt = realSyntax.mk_less (mk_large tw, x)
551 val lt = realSyntax.mk_less (mk_large tw, x)
568 val lt = realSyntax.mk_less (x, mk_neg_large tw)
/seL4-l4v-10.1.1/HOL4/src/num/theories/
H A DnumSyntax.sig51 val mk_less : term * term -> term value
H A DnumSyntax.sml63 val mk_less = mk_binop less_tm value
/seL4-l4v-10.1.1/HOL4/src/string/
H A DstringLib.sml17 Drule.EQT_ELIM (reduceLib.LT_CONV (numSyntax.mk_less (m, bound)))
H A DstringScript.sml30 in mk_abs(n,mk_less(n,topnum))
/seL4-l4v-10.1.1/graph-refine/
H A Dlogic.py15 mk_less_eq, mk_less, mk_implies, mk_and, mk_or, mk_not, mk_word32, mk_word8,
164 preconds += [mk_less (last_arg_addr, addr)
461 out1 = mk_less (end_addr (p, typ), p2)
462 out2 = mk_less (end_addr (p2, typ2), p)
482 out1 = mk_less (mk_plus (p, mk_word32 (typ.size () - 1)), mk_word32 (start))
483 out2 = mk_less (mk_word32 (end), p)
556 return lambda offs: mk_and (mk_less (offs, size),
612 mk_implies (mk_less (w0, size),
H A Dloop_bounds.py267 fin_cmp1 = syntax.mk_less (x, y)
268 fin_cmp2 = syntax.mk_less (y, x)
/seL4-l4v-10.1.1/HOL4/src/num/
H A DnumLib.sml235 (EQT_ELIM(REDUCE_CONV (mk_less(zero_tm,c))))
256 (EQT_ELIM(REDUCE_CONV (mk_less(zero_tm,c))))
/seL4-l4v-10.1.1/HOL4/src/datatype/
H A DEnumType.sml23 in mk_abs(n,mk_less(n,topnum))
37 val less_thm = EQT_ELIM (REDUCE_CONV (mk_less(n,top_numeral)))
278 mk_cond(mk_less(m, mk_numeral (Arbnum.fromInt mid)),
/seL4-l4v-10.1.1/HOL4/src/num/reduce/src/
H A DArithconv.sml220 fun provelt x y = EQT_ELIM (LT_CONV (mk_less(mk_numeral x, mk_numeral y)))
/seL4-l4v-10.1.1/HOL4/src/n-bit/
H A DwordsLib.sml686 val lt_thm = numSyntax.mk_less (n, wordsSyntax.mk_dimindex ty)
727 val lt_thm = numSyntax.mk_less (n, dim_sub1)
1817 |> numSyntax.mk_less
1847 (numLib.DECIDE (numSyntax.mk_less (numSyntax.zero_tm, n)))]
1911 val l_lt = numSyntax.mk_less (l, sz)
1912 val r_lt = numSyntax.mk_less (r, sz)
2400 numSyntax.mk_less (numSyntax.zero_tm, n)
2402 fun thm4 () = numSyntax.mk_less (n,
H A DbitstringLib.sml330 numSyntax.mk_less (i, fcpSyntax.mk_dimindex ty)

Completed in 236 milliseconds

12