library colibrilib.product — module ExportWhat OCaml calls: the contracts of Prod and Solve; none has a requires
module Export1422use int.Int1423use mach.int.Int631424use real.RealInfix1425use real.Abs1426use list.List1427use option.Option1428use colibrilib.ring.Atom1429use colibrilib.stdq.StdQ as Q1430use colibrilib.stda.StdA as A1431use Apow1432use QAssoc1433use PT1434use APow1435use Prod1436use Solve1437use colibrilib.spec.Sound1438use colibrilib.spec.Eval1439use colibrilib.spec.EvalOn1440use colibrilib.spec.Test1441use colibrilib.spec.Opt1442Valid (20ms) (colibri2)1443let partial classify (p:t) : kind1444ensures { match result with1445| CST c -> bindings p.poly = Nil /\ c = p.cst1446| NODE c x -> c = p.cst /\ denotes0 value (fun env -> A.real c *. abs (env x)) p1447/\ total p1448| PRODUCT -> true1449end }1450= Prod.classify p1451Valid (32ms) (colibri2)1452let common (p1 p2:t) : t1453ensures { A.real result.cst = 1.0 }1454ensures { forall k. mem k result -> mem k p1 /\ mem k p21455/\ exp k result = exp k p1 /\ exp k result = exp k p2 }1456= Prod.common p1 p21457Valid (24ms) (colibri2)1458let const (c:A.t) : t1459ensures { denotes0 value (fun _ -> abs (A.real c)) result /\ total result }1460ensures { forall k. not mem k result }1461= Prod.const c1462Valid (35ms) (colibri2)1463let div (p1 p2:t) : t1464ensures { denotes2_on (ok_div p1 p2) value (/.) p1 p2 result }1465ensures { includes valid (ok_div p1 p2) result }1466ensures { forall k. mem k result -> mem k p1 \/ mem k p2 }1467ensures { A.real p1.cst <> 0.0 -> forall k. exp k result = exp k p1 -. exp k p2 }1468ensures { A.real p1.cst <> 0.0 -> A.real result.cst <> 0.0 }1469raises { DivZero -> A.real p2.cst = 0.0 }1470= Prod.div p1 p21471Valid (34ms) (colibri2)1472let extract (p:t) : extracted1473ensures { match result with1474| One -> bindings p.poly = Nil /\ A.real p.cst = 1.01475| Cst c -> bindings p.poly = Nil /\ c = p.cst /\ A.real c <> 1.01476| Var q x r -> exp x p = Q.real q /\ Q.real q <> 0.0 /\ r.cst = p.cst1477/\ exact mem (fun k -> mem k p /\ k <> x) r1478/\ denotes0 value (fun env -> apow (env x) (Q.real q) *. eval env r) p1479/\ includes valid (ok1 p) r1480end }1481= Prod.extract p1482Valid (28ms) (colibri2)1483let filter (f: Atom.t -> bool) (p:t) : t1484ensures { result.cst = p.cst }1485ensures { forall k. get k result.poly = if f k then get k p.poly else None }1486= Prod.filter f p1487Valid (19ms) (colibri2)1488let partial is_one_node (p:t) : option Atom.t1489ensures { when_some (is_abs_node p) result }1490= Prod.is_one_node p1491Valid (34ms) (colibri2)1492let is_zero (p:t) : bool1493ensures { decides (A.real p.cst = 0.0) result }1494ensures { result -> forall env. eval env p = 0.0 }1495= Prod.is_zero p1496Valid (28ms) (colibri2)1497let monome (x:Atom.t) (c:Q.t) : t1498ensures { denotes0 value (fun env -> apow (env x) (Q.real c)) result }1499ensures { exact valid (fun env -> Q.real c <. 0.0 -> env x <> 0.0) result }1500ensures { forall k. mem k result -> k = x }1501= Prod.monome x c1502Valid (29ms) (colibri2)1503let mul (p1 p2:t) : t1504ensures { denotes2_on (ok2 p1 p2) value (*.) p1 p2 result }1505ensures { includes valid (ok2 p1 p2) result }1506ensures { forall k. mem k result -> mem k p1 \/ mem k p2 }1507= Prod.mul p1 p21508Valid (21ms) (colibri2)1509let normalize (p:t) (f: Atom.t -> t) : t1510ensures { denotes1_on (ok_normalize p f) value (fun v -> v) p result }1511ensures { includes valid (ok_normalize p f) result }1512raises { DivZero -> exists k. exp k p <. 0.0 /\ A.real (f k).cst = 0.0 }1513= Prod.normalize p f1514Valid (23ms) (colibri2)1515let of_list (c:A.t) (l:list binding) : t1516ensures { denotes0_on (lvalid_at l) value (fun env -> abs (A.real c) *. evp env l) result }1517ensures { includes valid (lvalid_at l) result }1518= Prod.of_list c l1519Valid (22ms) (colibri2)1520let one () : t1521ensures { denotes0 value (fun _ -> 1.0) result /\ total result }1522ensures { forall k. not mem k result }1523= Prod.one ()1524Valid (23ms) (colibri2)1525let power_cst (c:Q.t) (p:t) : t1526ensures { denotes1_on (ok_pow c p) value (fun v -> apow v (Q.real c)) p result }1527ensures { includes valid (ok_pow c p) result }1528ensures { forall k. mem k result -> mem k p }1529ensures { A.real p.cst <> 0.0 -> forall k. exp k result = Q.real c *. exp k p }1530raises { DivZero -> Q.real c <. 0.0 /\ A.real p.cst = 0.0 }1531= Prod.power_cst c p1532Valid (30ms) (colibri2)1533let remove (n:Atom.t) (p:t) : t1534ensures { denotes0 value (fun env -> apow (env n) (exp n p) *. eval env result) p }1535ensures { includes valid (ok1 p) result }1536ensures { exact mem (fun k -> mem k p /\ k <> n) result }1537ensures { forall k. k <> n -> exp k result = exp k p }1538ensures { result.cst = p.cst }1539= Prod.remove n p1540Valid (29ms) (colibri2)1541let partial solve (unk1:PT.t) (p1:t) (unk2:PT.t) (p2:t) : solved1542ensures { solves (fun env -> hyp env unk1 p1 /\ hyp env unk2 p2)1543(fun env -> eval env p1 = eval env p2) result }1544= Solve.solve unk1 p1 unk2 p21545Valid (26ms) (colibri2)1546let subst (p:t) (x:Atom.t) (s:t) : option t1547ensures { match result with1548| None -> not mem x p1549| Some r -> mem x p1550/\ (forall k. mem k r -> (mem k p /\ k <> x) \/ mem k s)1551/\ denotes1_on (ok_subst p x s) value (fun v -> v) p r1552/\ includes valid (ok_subst p x s) r1553end }1554raises { DivZero -> exp x p <. 0.0 /\ A.real s.cst = 0.0 }1555= Prod.subst p x s1556Valid (19ms) (colibri2)1557let x_m_yc (p1 p2:t) (c:Q.t) : t1558ensures { denotes2_on (ok_mul_pow p1 p2 c) value (fun x y -> x *. apow y (Q.real c)) p1 p2 result }1559ensures { includes valid (ok_mul_pow p1 p2 c) result }1560ensures { forall k. mem k result -> mem k p1 \/ mem k p2 }1561raises { DivZero -> Q.real c <. 0.0 /\ A.real p2.cst = 0.0 }1562= Prod.x_m_yc p1 p2 c1563Valid (18ms) (colibri2)1564let zero () : t1565ensures { denotes0 value (fun _ -> 0.0) result /\ total result }1566ensures { forall k. not mem k result }1567= Prod.zero ()1568end1569