Lattice_bounds.Bottom
type 'a t = 'a or_bottom
module Operators : sig ... end
Operators
module Make_Datatype
(Domain : Datatype.S) :
Datatype.S with type t = Domain.t or_bottom
Datatype constructor
module Bound_Lattice
(Lattice : Lattice_type.Join_Semi_Lattice) :
Lattice_type.Bounded_Join_Semi_Lattice with type t = Lattice.t or_bottom
Bounds a semi-lattice
val is_bottom : 'a t -> bool
Access
val non_bottom : 'a t -> 'a
val value : bottom:'a -> 'a t -> 'a
val hash : ('a -> int) -> 'a t -> int
Datatype
val pretty :
(Stdlib.Format.formatter -> 'a -> unit) ->
Stdlib.Format.formatter ->
'a t ->
unit
val iter : ('a -> unit) -> 'a t -> unit
val fold : bottom:'b -> ('a -> 'b) -> 'a t -> 'b
In a lattice where the elements are lists of non-bottom values, the empty list is the bottom case.
val to_option : 'a t -> 'a option
Conversion
val of_option : 'a option -> 'a t
val to_list : 'a t -> 'a list
val bot_of_list : 'a list -> 'a list t
val list_of_bot : 'a list t -> 'a list
val list_values : 'a t list -> 'a list
val add_to_list : 'a t -> 'a list -> 'a list
elt >:: list
adds elt
to the list
if it is not bottom.