sig
type t = Sl_term.t * Sl_term.t
val compare : t -> t -> int
val equal : t -> t -> bool
val hash : t -> int
val to_string : t -> string
val pp : Format.formatter -> t -> unit
val unify :
?order:bool ->
?update_check:Sl_unify.Unidirectional.update_check ->
t Sl_unify.Unidirectional.unifier
val biunify :
?order:bool ->
?update_check:Sl_unify.Bidirectional.update_check ->
t Sl_unify.Bidirectional.unifier
val order : t -> t
val subst : Sl_subst.t -> t -> t
val to_string_sep : string -> t -> string
val to_melt_sep : Latex.t -> t -> Latex.t
module FList :
sig
type t = t list
val compare : t -> t -> int
val equal : t -> t -> bool
val hash : t -> int
val to_string : t -> string
val pp : Format.formatter -> t -> unit
val terms : t -> Sl_term.Set.t
end
module ListSet :
sig
type t
val hash : t -> int
val to_string : t -> string
val pp : Format.formatter -> t -> unit
type elt = t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val max_elt : t -> elt
val choose : t -> elt
val split : elt -> t -> t * bool * t
val of_list : elt list -> t
val to_list : t -> elt list
val endomap : (elt -> elt) -> t -> t
val map_to : ('b -> 'a -> 'a) -> 'a -> (elt -> 'b) -> t -> 'a
val opt_map_to :
('b -> 'a -> 'a) -> 'a -> (elt -> 'b option) -> t -> 'a
val map_to_list : (elt -> 'a) -> t -> 'a list
val weave :
(elt -> 'a -> 'a list) ->
(elt -> 'a -> 'b) -> ('b list -> 'b) -> t -> 'a -> 'b
val find : (elt -> bool) -> t -> elt
val find_opt : (elt -> bool) -> t -> elt option
val find_map : (elt -> 'a option) -> t -> 'a option
val union_of_list : t list -> t
val subsets : t -> t list
val fixpoint : (t -> t) -> t -> t
val del_first : (elt -> bool) -> t -> t
val disjoint : t -> t -> bool
val mk_unifier :
bool ->
bool ->
('a, 'b, elt) Unification.cps_unifier ->
('a, 'b, t) Unification.cps_unifier
end
end