Module Flatten.Formula

module Formula: sig .. end

type t = Flatten.Disj.t list 
val print : Cudf.universe -> Format.formatter -> Flatten.PSet.t list -> unit
val of_disj : 'a -> 'a list
val lit : Flatten.PSet.elt -> Flatten.PSet.t list
val lit_disj : Flatten.PSet.elt list -> Flatten.PSet.t list
val implies1 : Flatten.PSet.t list -> Flatten.PSet.t -> bool
val implies : Flatten.PSet.t list -> Flatten.PSet.t list -> bool
val equiv : Flatten.PSet.t list -> Flatten.PSet.t list -> bool
val _true : 'a list
val conj1 : Flatten.PSet.t list -> Flatten.PSet.t -> Flatten.PSet.t list
val conj : Flatten.PSet.t list -> Flatten.PSet.t list -> Flatten.PSet.t list
val conjl : Flatten.PSet.t list list -> Flatten.PSet.t list
val _false : Flatten.PSet.t list
val disj : Flatten.PSet.t list -> Flatten.PSet.t list -> Flatten.PSet.t list
val disjl : Flatten.PSet.t list list -> Flatten.PSet.t list
val iter : 'a list -> ('a -> unit) -> unit
val fold : ('a -> 'b -> 'b) -> 'a list -> 'b -> 'b
val filter : ('a -> bool) -> 'a list -> 'a list
val exists : ('a -> bool) -> 'a list -> bool
val map : ('a -> 'b) -> 'a list -> 'b list
val normalize : Flatten.PSet.t list -> Flatten.PSet.t list