Common — library colibrilib.models — module PolynomePTModel

polynome.PT

267
module PolynomePTModel
268
use int.Int
269
use list.List
270
use option.Option
271
use colibrilib.ring.Atom
272
use colibrilib.stda.StdA as A
273
use colibrilib.polynome.Assoc as Assoc
274
clone 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.t
275
Valid (18ms) (colibri2)
276
let rec lemma
assoc_eq
(k:Atom.t) (l:list Assoc.binding)
277
ensures { M.assoc k l = Assoc.assoc k l }
278
variant { l }
279
= match l with Nil -> () | Cons _ r -> assoc_eq k r end
280
Valid (27ms) (colibri2)
281
let rec lemma
sorted_eq
(l:list Assoc.binding)
282
ensures { M.sorted l <-> Assoc.sorted l }
283
variant { l }
284
= match l with Nil -> () | Cons _ r -> sorted_eq r end
285
286
clone colibrilib.polynome.PT {… begin (* cloned colibrilib.polynome.PT *) Valid (18ms) (colibri2) lemma
PT.bindings_sorted
function
PT.get
t M.t : option t end
}
with
287
type t = M.t, function bindings = M.bindings,
288
lemma bindings_sorted,
289
val empty = M.empty, val is_empty = M.is_empty,
290
val singleton = M.singleton, val find_opt = M.find_opt,
291
val remove = M.remove, val cardinal = M.cardinal,
292
val to_list = M.to_list, val pivot_binding = M.some_binding,
293
val min_binding = M.some_binding, val merge = M.merge,
294
val update = M.update, val map = M.map
295
end