library colibrilib.polynome — module ExportWhat OCaml calls: the contracts of Lin and ModRw, and reduce_cst defensive
module Export905use int.Int906use real.RealInfix907use real.Abs908use real.FromInt909use list.List910use option.Option911use mach.int.Int63912use colibrilib.ring.Atom913use colibrilib.stda.StdA as A914use colibrilib.q.Real as Real915use Assoc916use PT917use Lin918use ModRw919use colibrilib.spec.Sound920use colibrilib.spec.Eval921use colibrilib.spec.EvalOn922use colibrilib.spec.Value923use colibrilib.spec.Test924use colibrilib.spec.Opt925Valid (27ms) (colibri2)926let add (p1 p2:t) : t927ensures { denotes2 value (+.) p1 p2 result }928= Lin.add p1 p2929Valid (28ms) (colibri2)930let add_cst (p:t) (c:A.t) : t931ensures { denotes1 value (fun v -> v +. A.real c) p result }932= Lin.add_cst p c933Valid (23ms) (colibri2)934let atoms (p:t) : list binding935ensures { value_is (bindings p.poly) result }936= Lin.atoms p937Valid (26ms) (colibri2)938let classify (p:t) : kind939ensures { match result with940| ZERO -> bindings p.poly = Nil /\ A.real p.cst = 0.0941| CST -> bindings p.poly = Nil /\ A.real p.cst <> 0.0942| VAR -> bindings p.poly <> Nil943end }944= Lin.classify p945Valid (28ms) (colibri2)946let const (c:A.t) : t947ensures { denotes0 value (fun _ -> A.real c) result }948= Lin.const c949Valid (28ms) (colibri2)950let cx_p_cy (c1:A.t) (p1:t) (c2:A.t) (p2:t) : t951ensures { denotes2 value (fun x y -> A.real c1 *. x +. A.real c2 *. y) p1 p2 result }952= Lin.cx_p_cy c1 p1 c2 p2953Valid (27ms) (colibri2)954let is_cst (p:t) : option A.t955ensures { match result with956| Some c -> bindings p.poly = Nil /\ c = p.cst957| None -> bindings p.poly <> Nil958end }959= Lin.is_cst p960Valid (28ms) (colibri2)961let is_one_node (p:t) : option Atom.t962ensures { when_some (is_node p) result }963= Lin.is_one_node p964Valid (25ms) (colibri2)965let is_pm_node (p:t) : option Atom.t966ensures { when_some (is_abs_node p) result }967= Lin.is_pm_node p968Valid (18ms) (colibri2)969let is_zero (p:t) : bool970ensures { decides (bindings p.poly = Nil /\ A.real p.cst = 0.0) result }971= Lin.is_zero p972Valid (26ms) (colibri2)973let monome (c:A.t) (x:Atom.t) : t974ensures { denotes0 value (fun env -> A.real c *. env x) result }975= Lin.monome c x976Valid (33ms) (colibri2)977let mult_cst (c:A.t) (p:t) : t978ensures { denotes1 value (fun v -> A.real c *. v) p result }979= Lin.mult_cst c p980Valid (30ms) (colibri2)981let neg (p:t) : t982ensures { denotes1 value (fun v -> -. v) p result }983= Lin.neg p984Valid (26ms) (colibri2)985let of_list (c:A.t) (l:list binding) : t986ensures { denotes0 value (fun env -> A.real c +. evall env l) result }987= Lin.of_list c l988Valid (20ms) (colibri2)989let reduce_node (p:t) (y:Atom.t) : t990ensures { same_rem_node y p result }991ensures { bindings result.poly = Nil -> A.real result.cst = 0.0 ->992forall env d. d <> 0.0 -> abs d = abs (env y) -> Real.mod_e (eval env p) d = 0.0 }993= ModRw.reduce_node p y994Valid (30ms) (colibri2)995let sub (p1 p2:t) : t996ensures { denotes2 value (-.) p1 p2 result }997= Lin.sub p1 p2998Valid (27ms) (colibri2)999let sub_cst (p:t) (c:A.t) : t1000ensures { denotes1 value (fun v -> v -. A.real c) p result }1001= Lin.sub_cst p c1002Valid (28ms) (colibri2)1003let subst (p:t) (x:Atom.t) (s:t) : (t, A.t)1004returns { (r, q) -> A.real q = coef x p1005/\ denotes0 value (fun env -> eval env p +. A.real q *. (eval env s -. env x)) r }1006= Lin.subst p x s1007Valid (21ms) (colibri2)1008let subst_node (p:t) (x y:Atom.t) : (t, A.t)1009returns { (r, q) -> A.real q = coef x p1010/\ denotes0 value (fun env -> eval env p +. A.real q *. (env y -. env x)) r }1011= Lin.subst_node p x y1012Valid (34ms) (colibri2)1013let x_p_cy (p1:t) (c:A.t) (p2:t) : t1014ensures { denotes2 value (fun x y -> x +. A.real c *. y) p1 p2 result }1015= Lin.x_p_cy p1 c p21016Valid (24ms) (colibri2)1017let zero () : t1018ensures { denotes0 value (fun _ -> 0.0) result }1019= Lin.zero ()1020Valid (24ms) (colibri2)1021let extract (p:t) : extract1022ensures { match result with1023| Zero -> bindings p.poly = Nil /\ A.real p.cst = 0.01024| Cst c -> bindings p.poly = Nil /\ c = p.cst /\ A.real c <> 0.01025| Var q x p' -> get x p.poly = Some q /\ not (has x (bindings p'.poly))1026/\ denotes0 value (fun env -> A.real q *. env x +. eval env p') p1027end }1028= Lin.extract p1029
Raised by reduce_cst for a zero divisor
exception ZeroDiv1032Valid (35ms) (colibri2)1033let reduce_cst (p:t) (m:A.t) : t1034ensures { A.real m <> 0.0 }1035ensures { 0.0 <=. A.real result.cst <. abs (A.real m) }1036ensures { forall k v. get k result.poly = Some v ->10370.0 <=. A.real v <. abs (A.real m) }1038ensures { forall k. has k (bindings result.poly) -> has k (bindings p.poly) }1039ensures { same_on (integer_atoms p) (fun v -> Real.mod_e v (A.real m)) value p result }1040ensures { bindings result.poly = Nil ->1041forall env. integer_atoms p env ->1042Real.mod_e (eval env p) (A.real m) = A.real result.cst }1043raises { ZeroDiv -> A.real m = 0.0 }1044= if A.equal m (A.of_int 0) then raise ZeroDiv else ModRw.reduce_cst p m1045end1046