Searched refs:unbounded (Results 1 - 13 of 13) sorted by relevance

/seL4-l4v-master/graph-refine/graph-to-graph/
H A Dcplex.py12 unbounded = "unbounded" variable
59 if not expect_unbounded and (ret or (infeasible in err or infeasible in out) or (unbounded in err or unbounded in out)):
61 print 'note that infeasible/unbounded can mean the other, turn off the presolver to investiage which is the case'
69 if re.search(unbounded,line) or re.search(infeasible, line):
71 return unbounded
72 assert False and "Infeasible/unbounded ilp !!!"
121 return ret_val == unbounded
152 print "unbounded i
[all...]
/seL4-l4v-master/HOL4/tools/Holmake/tests/brokenstrings/
H A DAST.sml8 \(either \ \fixed width or unbounded)"
/seL4-l4v-master/HOL4/examples/ARM/v7/eval/
H A Demit_eval.sig32 count (* max number of cycles, -ve for unbounded *)
/seL4-l4v-master/HOL4/src/pred_set/src/more_theories/
H A DveblenScript.sml23 unbounded (A:'a ordinal set) = !a. ?b. b IN A /\ a < b
26 val club_def = Define`club A <=> closed A /\ unbounded A`
/seL4-l4v-master/HOL4/src/portableML/poly/
H A DDynarray.sig21 unbounded arrays with elements of type 'ty. Type 'ty array does
H A DDynarray.sml6 * Arrays of unbounded length
/seL4-l4v-master/HOL4/examples/fun-op-sem/small-step/
H A DdetermSemScript.sml94 unbounded f ���
186 unbounded f ���
H A DoracleSemScript.sml156 unbounded f ���
224 unbounded f ���
355 unbounded f ���
H A Dsimple_traceScript.sml29 unbounded (f : num -> num) ���
/seL4-l4v-master/HOL4/src/metis/
H A DmlibTermorder.sml136 (* An equation being unbounded is an incredibly weak condition *)
138 fun unbounded q = M.exists (fn ("",_) => false | (_,n) => 0 < n) q; function
143 else if #precision parm <= 1 then not (unbounded eqn orelse trivial eqn)
/seL4-l4v-master/HOL4/src/1/
H A DConseqConv.sig214 int option -> (*max no of steps, NONE for unbounded *)
369 int option -> (*no of steps, NONE for unbounded *)
/seL4-l4v-master/HOL4/examples/computability/kolmog/
H A Dkolmog_incomputableScript.sml1062 val unbounded_def = Define���unbounded f = (���m. ���x. (m:num) <= f (x:num))���
1074 computable f ��� unbounded f ==> ���i. ���x. Phi i x = SOME (MIN_SET {n | x <= f n})
1098 rw[] >> ���unbounded (��x. KC U (n2bl x))��� by
/seL4-l4v-master/HOL4/src/real/
H A DseqScript.sml572 (* Prove that an unbounded sequence's inverse tends to 0 *)

Completed in 110 milliseconds