Common — library colibrilib.models — module ProductPTModel

product.PT

298
module ProductPTModel
299
use int.Int
300
use list.List
301
use option.Option
302
use colibrilib.ring.Atom
303
use colibrilib.stdq.StdQ as Q
304
use colibrilib.product.QAssoc as QAssoc
305
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 = Q.t
306
Valid (22ms) (colibri2)
307
let rec lemma
assoc_eq
(k:Atom.t) (l:list QAssoc.binding)
308
ensures { M.assoc k l = QAssoc.assoc k l }
309
variant { l }
310
= match l with Nil -> () | Cons _ r -> assoc_eq k r end
311
Valid (33ms) (colibri2)
312
let rec lemma
sorted_eq
(l:list QAssoc.binding)
313
ensures { M.sorted l <-> QAssoc.sorted l }
314
variant { l }
315
= match l with Nil -> () | Cons _ r -> sorted_eq r end
316
317
clone colibrilib.product.PT {… begin (* cloned colibrilib.product.PT *) Valid (25ms) (colibri2) lemma
PT.bindings_sorted
function
PT.get
t M.t : option t end
}
with
318
type t = M.t, function bindings = M.bindings,
319
lemma bindings_sorted,
320
val empty = M.empty, val is_empty = M.is_empty,
321
val singleton = M.singleton, val find_opt = M.find_opt,
322
val remove = M.remove, val choose = M.some_binding,
323
val cardinal = M.cardinal63,
324
val merge = M.merge, val map = M.map, val filter = M.filter,
325
val to_list = M.to_list
326
end