library colibrilib.models — module PolynomePTModelpolynome.PT
module PolynomePTModel267use int.Int268use list.List269use option.Option270use colibrilib.ring.Atom271use colibrilib.stda.StdA as A272use colibrilib.polynome.Assoc as Assoc273clone SortedMap as M {… begin (* cloned colibrilib.models.SortedMap *) type M.binding function M.assoc t (list (t,t)) : option t predicate M.has t (list (t,t)) predicate M.above t (list (t,t)) predicate M.sorted (list (t,t)) type M.t type M.l type M.n type M.t'mk type M.t'eq function M.bindings t : list (t,t) let ghost M.above_trans t t (list (t,t)) : unit let ghost M.above_not_has t (list (t,t)) : unit let M.cons_opt t (option t) (list (t,t)) t : list (t,t),t let M.empty unit : t let M.is_empty t : bool let M.singleton t t : t let M.find t (list (t,t)) : option t let M.find_opt t t : option t let M.rem t (list (t,t)) : list (t,t) let M.remove t t : t let M.cardinal t : int let M.cardinal63 t : int63 let M.to_list t : list (t,t) let M.some_binding t : t,t let M.mrg (t -> (option t -> (option t -> option t))) (list (t,t)) (list (t,t)) : list (t,t),t let M.merge (t -> (option t -> (option t -> option t))) t t : t let M.ins t t (list (t,t)) : list (t,t) let M.update t (option t -> option t) t : t let M.mp (t -> t) (list (t,t)) : list (t,t) let M.map (t -> t) t : t let M.flt (t -> bool) (list (t,t)) : list (t,t),t let M.filter (t -> bool) t : t end } with type value = A.t274Valid (18ms) (colibri2)275let rec lemma assoc_eq (k:Atom.t) (l:list Assoc.binding)276ensures { M.assoc k l = Assoc.assoc k l }277variant { l }278= match l with Nil -> () | Cons _ r -> assoc_eq k r end279Valid (27ms) (colibri2)280let rec lemma sorted_eq (l:list Assoc.binding)281ensures { M.sorted l <-> Assoc.sorted l }282variant { l }283= match l with Nil -> () | Cons _ r -> sorted_eq r end284285clone colibrilib.polynome.PT {… begin (* cloned colibrilib.polynome.PT *) Valid (18ms) (colibri2) lemma PT.bindings_sorted function PT.get t M.t : option t end } with286type t = M.t, function bindings = M.bindings,287lemma bindings_sorted,288val empty = M.empty, val is_empty = M.is_empty,289val singleton = M.singleton, val find_opt = M.find_opt,290val remove = M.remove, val cardinal = M.cardinal,291val to_list = M.to_list, val pivot_binding = M.some_binding,292val min_binding = M.some_binding, val merge = M.merge,293val update = M.update, val map = M.map294end295