module Bool: sig .. end
type 'a t = ('a Bddapron.Env.t, Cudd.Man.v Bddapron.Expr0.Bool.t) Bddapron.Env.value
val of_expr0 : 'a Bddapron.Env.t -> 'a Bddapron.Expr0.Bool.t -> 'a t
Creation from an expression of level 0 (without environment)
val get_env : 'a t -> 'a Bddapron.Env.t
val to_expr0 : 'a t -> 'a Bddapron.Expr0.Bool.t
Extract resp. the environment and the underlying
expression of level 0
val of_expr : 'a Bddapron.Expr1.expr -> 'a t
val to_expr : 'a t -> 'a Bddapron.Expr1.expr
Conversion from/to general expression
val extend_environment : 'a t -> 'a Bddapron.Env.t -> 'a t
Extend the underlying environment to a superenvironment,
and adapt accordingly the underlying representation
val dtrue : 'a Bddapron.Env.t -> 'a Bddapron.Cond.t -> 'a t
val dfalse : 'a Bddapron.Env.t -> 'a Bddapron.Cond.t -> 'a t
val of_bool : 'a Bddapron.Env.t -> 'a Bddapron.Cond.t -> bool -> 'a t
val var : 'a Bddapron.Env.t -> 'a Bddapron.Cond.t -> 'a -> 'a t
Logical connectors
val dnot : 'a Bddapron.Cond.t -> 'a t -> 'a t
val dand : 'a Bddapron.Cond.t ->
'a t ->
'a t -> 'a t
val dor : 'a Bddapron.Cond.t ->
'a t ->
'a t -> 'a t
not, and and or (use of 'd' prefix because of conflict with OCaml
keywords)
val xor : 'a Bddapron.Cond.t ->
'a t ->
'a t -> 'a t
val nand : 'a Bddapron.Cond.t ->
'a t ->
'a t -> 'a t
val nor : 'a Bddapron.Cond.t ->
'a t ->
'a t -> 'a t
val nxor : 'a Bddapron.Cond.t ->
'a t ->
'a t -> 'a t
Exclusive or, not and, nor or and not xor
val eq : 'a Bddapron.Cond.t ->
'a t ->
'a t -> 'a t
Same as nxor
val leq : 'a Bddapron.Cond.t ->
'a t ->
'a t -> 'a t
Implication
val ite : 'a Bddapron.Cond.t ->
'a t ->
'a t ->
'a t -> 'a t
If-then-else
val is_true : 'a Bddapron.Cond.t -> 'a t -> bool
val is_false : 'a Bddapron.Cond.t -> 'a t -> bool
val is_cst : 'a Bddapron.Cond.t -> 'a t -> bool
val is_eq : 'a Bddapron.Cond.t ->
'a t -> 'a t -> bool
val is_leq : 'a Bddapron.Cond.t ->
'a t -> 'a t -> bool
val is_inter_false : 'a Bddapron.Cond.t ->
'a t -> 'a t -> bool
val exist : 'a Bddapron.Cond.t ->
'a list -> 'a t -> 'a t
val forall : 'a Bddapron.Cond.t ->
'a list -> 'a t -> 'a t
val cofactor : 'a t ->
'a t -> 'a t
val restrict : 'a t ->
'a t -> 'a t
val tdrestrict : 'a t ->
'a t -> 'a t
val substitute_by_var : ?memo:Cudd.Memo.t ->
'a Bddapron.Cond.t ->
'a t -> ('a * 'a) list -> 'a t
val substitute : ?memo:Cudd.Memo.t ->
'a Bddapron.Cond.t ->
'a t ->
('a * 'a Bddapron.Expr1.expr) list -> 'a t
val print : 'a Bddapron.Cond.t -> Format.formatter -> 'a t -> unit