With_Cardinality._include Lattice_type.AI_Lattice_with_cardinal_one with type t := Value.tinclude Lattice_type.Bottom_Bounded_Join_Semi_Lattice with type t := Value.tinclude Lattice_type.Join_Semi_Lattice with type t := Value.tdatatype of element of the lattice
include Datatype.S with type t := Value.tinclude Datatype.S_no_copy with type t := Value.tinclude Datatype.Ty with type t := Value.tval packed_descr : Structural_descr.packPacked version of the descriptor.
val reprs : Value.t listList of representants of the descriptor.
val hash : Value.t -> intHash function: same spec than Hashtbl.hash.
val pretty : Stdlib.Format.formatter -> Value.t -> unitPretty print each value in an user-friendly way.
val mem_project : (Project_skeleton.t -> bool) -> Value.t -> boolmem_project f x must return true iff there is a value p of type Project.t in x such that f p returns true.
val bottom : Value.tsmallest element
include Lattice_type.With_Top with type t := Value.tval top : Value.tlargest element
include Lattice_type.With_Cardinal_One with type t := Value.tval cardinal_zero_or_one : Value.t -> boolinclude Lattice_type.With_Intersects with type t := Value.tinclude Lattice_type.With_Enumeration with type t := Value.tFold on the elements of the value one by one if possible. Raises Abstract_interp.Not_less_than when there is an infinite number of elements to enumerate.
val cardinal_less_than : Value.t -> int -> intRaises Abstract_interp.Not_less_than whenever the cardinal of the given lattice is strictly higher than the given integer.