val mem : key -> t -> bool
val remove : key -> t -> t
val iter : (key -> value -> unit) -> t -> unit
val fold : (key -> value -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (key -> value -> bool) -> t -> bool
val exists : (key -> value -> bool) -> t -> bool
val min_binding_opt : t -> (key * value) option
val max_binding_opt : t -> (key * value) option
val find_first_opt : (key -> bool) -> t -> (key * value) option
val find_last_opt : (key -> bool) -> t -> (key * value) option
val fold_map : t -> init:'a -> f:('a -> value -> 'a * value) -> 'a * t
val fold_mapi : t -> init:'a -> f:(key -> 'a -> value -> 'a * value) -> 'a * t
val pp_key : IStdlib__PrettyPrintable.F.formatter -> key -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val widen : prev:t -> next:t -> num_iters:int -> t
val is_bottom : t -> bool