sig
exception UnificationError of Flx_types.btypecode_t * Flx_types.btypecode_t
val flx_bool : Flx_ast.typecode_t
val flx_bbool : Flx_types.btypecode_t
val dummy_sr : Flx_ast.range_srcref
val is_unitsum : Flx_types.btypecode_t -> bool
val int_of_unitsum : Flx_types.btypecode_t -> int
val all_units0 : Flx_types.b0typecode_t list -> bool
val all_units : Flx_types.btypecode_t list -> bool
val all_voids : Flx_types.btypecode_t list -> bool
val cmp_literal : Flx_ast.literal_t -> Flx_ast.literal_t -> bool
val cmp_tbexpr : Flx_types.tbexpr_t -> Flx_types.tbexpr_t -> bool
val type_of_argtypes : Flx_ast.typecode_t list -> Flx_ast.typecode_t
val funparamtype : 'a * 'b -> 'b
val typeoflist : Flx_types.btypecode_t list -> Flx_types.btypecode_t
val lift : Flx_types.btypecode_t -> Flx_types.btypecode_t
val lower : Flx_types.btypecode_t -> Flx_types.btypecode_t
val qualified_name_of_expr : Flx_ast.expr_t -> Flx_ast.qualified_name_t
module FuntypeSet :
sig
type elt = Flx_ast.typecode_t
type 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
end
module FunInstSet :
sig
type elt = Flx_ast.bid_t * Flx_types.btypecode_t list
type 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
end
end