Make.Domain
module Constraints = Constraints
type binary = Transfer_functions.Term.binary Constraints.t
type integer = Transfer_functions.Term.integer Constraints.t
type boolean = Transfer_functions.Term.boolean Constraints.t
val top : t
module Query : sig ... end
val nondet :
doma:t ->
tupa:Constraints.any Immutable_array.t ->
domb:t ->
tupb:Constraints.any Immutable_array.t ->
tupres:Constraints.any Immutable_array.t ->
t
module Domain_Arity : sig ... end
module Boolean_Forward :
Transfer_functions.Boolean_Forward
with module Arity := Domain_Arity
and type boolean := boolean
module Integer_Forward :
Transfer_functions.Integer_Forward
with module Arity := Domain_Arity
and type boolean := boolean
and type integer := integer
module Binary_Forward :
Transfer_functions.Binary_Forward
with module Arity := Domain_Arity
and type boolean := boolean
and type binary := binary
val pretty : Stdlib.Format.formatter -> t -> unit
val fixpoint_step :
lvl:int ->
t ->
actuals:Constraints.any Immutable_array.t ->
t ->
args:Constraints.any Immutable_array.t ->
t ->
finals:Constraints.any Immutable_array.t ->
bool * (close:bool -> Constraints.any Immutable_array.t -> t)