sig
type t
type term = InnerTerm.t
type view = private
Var of InnerTerm.t HVar.t
| DB of int
| Bind of Binder.t * InnerTerm.t * InnerTerm.t
| Const of ID.t
| App of InnerTerm.t * InnerTerm.t list
| AppBuiltin of Builtin.t * InnerTerm.t list
val view : InnerTerm.t -> InnerTerm.view
type type_result = NoType | HasType of InnerTerm.t
val ty : InnerTerm.t -> InnerTerm.type_result
val ty_exn : InnerTerm.t -> InnerTerm.t
val equal : t -> t -> bool
val hash_fun : t -> CCHash.state -> CCHash.state
val hash : t -> int
val compare : t -> t -> int
val same_l : InnerTerm.t list -> InnerTerm.t list -> bool
exception IllFormedTerm of string
type nat = int
val const : ty:InnerTerm.t -> ID.t -> InnerTerm.t
val app : ty:InnerTerm.t -> InnerTerm.t -> InnerTerm.t list -> InnerTerm.t
val bind :
ty:InnerTerm.t ->
varty:InnerTerm.t -> Binder.t -> InnerTerm.t -> InnerTerm.t
val var : InnerTerm.t HVar.t -> InnerTerm.t
val bvar : ty:InnerTerm.t -> InnerTerm.nat -> InnerTerm.t
val app_builtin :
ty:InnerTerm.t -> Builtin.t -> InnerTerm.t list -> InnerTerm.t
val builtin : ty:InnerTerm.t -> Builtin.t -> InnerTerm.t
val tType : InnerTerm.t
val cast : ty:InnerTerm.t -> InnerTerm.t -> InnerTerm.t
val is_var : InnerTerm.t -> bool
val is_bvar : InnerTerm.t -> bool
val is_const : InnerTerm.t -> bool
val is_bind : InnerTerm.t -> bool
val is_app : InnerTerm.t -> bool
val hashcons_stats : unit -> int * int * int * int * int * int
module Map :
sig
type key = term
type +'a t
val empty : 'a t
val is_empty : 'a t -> bool
val mem : key -> 'a t -> bool
val add : key -> 'a -> 'a t -> 'a t
val singleton : key -> 'a -> 'a t
val remove : key -> 'a t -> 'a t
val merge :
(key -> 'a option -> 'b option -> 'c option) -> 'a t -> 'b t -> 'c t
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val for_all : (key -> 'a -> bool) -> 'a t -> bool
val exists : (key -> 'a -> bool) -> 'a t -> bool
val filter : (key -> 'a -> bool) -> 'a t -> 'a t
val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t
val cardinal : 'a t -> int
val bindings : 'a t -> (key * 'a) list
val min_binding : 'a t -> key * 'a
val max_binding : 'a t -> key * 'a
val choose : 'a t -> key * 'a
val split : key -> 'a t -> 'a t * 'a option * 'a t
val find : key -> 'a t -> 'a
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
val get : key -> 'a t -> 'a option
val get_or : key -> 'a t -> or_:'a -> 'a
val update : key -> ('a option -> 'a option) -> 'a t -> 'a t
val merge_safe :
f:(key ->
[ `Both of 'a * 'b | `Left of 'a | `Right of 'b ] -> 'c option) ->
'a t -> 'b t -> 'c t
val of_seq : (key * 'a) CCMap.sequence -> 'a t
val add_seq : 'a t -> (key * 'a) CCMap.sequence -> 'a t
val to_seq : 'a t -> (key * 'a) CCMap.sequence
val of_list : (key * 'a) list -> 'a t
val add_list : 'a t -> (key * 'a) list -> 'a t
val keys : 'a t -> key CCMap.sequence
val values : 'a t -> 'a CCMap.sequence
val to_list : 'a t -> (key * 'a) list
val pp :
?start:string ->
?stop:string ->
?arrow:string ->
?sep:string ->
key CCMap.printer -> 'a CCMap.printer -> 'a t CCMap.printer
val print :
?start:string ->
?stop:string ->
?arrow:string ->
?sep:string ->
key CCMap.formatter -> 'a CCMap.formatter -> 'a t CCMap.formatter
end
module Set :
sig
type elt = term
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
val find : elt -> t -> elt
val of_seq : elt CCSet.sequence -> t
val add_seq : t -> elt CCSet.sequence -> t
val to_seq : t -> elt CCSet.sequence
val of_list : elt list -> t
val add_list : t -> elt list -> t
val to_list : t -> elt list
val pp :
?start:string ->
?stop:string -> ?sep:string -> elt CCSet.printer -> t CCSet.printer
val print :
?start:string ->
?stop:string ->
?sep:string -> elt CCSet.formatter -> t CCSet.formatter
end
module Tbl :
sig
type key = term
type 'a t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Hashtbl.statistics
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> or_:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.sequence
val values : 'a t -> 'a CCHashtbl.sequence
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_seq : 'a t -> (key * 'a) CCHashtbl.sequence
val of_seq : (key * 'a) CCHashtbl.sequence -> 'a t
val add_seq : 'a t -> (key * 'a) CCHashtbl.sequence -> unit
val add_seq_count : int t -> key CCHashtbl.sequence -> unit
val of_seq_count : key CCHashtbl.sequence -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val print :
key CCHashtbl.printer ->
'a CCHashtbl.printer -> 'a t CCHashtbl.printer
end
module VarMap :
sig
type key = t HVar.t
type +'a t
val empty : 'a t
val is_empty : 'a t -> bool
val mem : key -> 'a t -> bool
val add : key -> 'a -> 'a t -> 'a t
val singleton : key -> 'a -> 'a t
val remove : key -> 'a t -> 'a t
val merge :
(key -> 'a option -> 'b option -> 'c option) -> 'a t -> 'b t -> 'c t
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val for_all : (key -> 'a -> bool) -> 'a t -> bool
val exists : (key -> 'a -> bool) -> 'a t -> bool
val filter : (key -> 'a -> bool) -> 'a t -> 'a t
val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t
val cardinal : 'a t -> int
val bindings : 'a t -> (key * 'a) list
val min_binding : 'a t -> key * 'a
val max_binding : 'a t -> key * 'a
val choose : 'a t -> key * 'a
val split : key -> 'a t -> 'a t * 'a option * 'a t
val find : key -> 'a t -> 'a
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
val get : key -> 'a t -> 'a option
val get_or : key -> 'a t -> or_:'a -> 'a
val update : key -> ('a option -> 'a option) -> 'a t -> 'a t
val merge_safe :
f:(key ->
[ `Both of 'a * 'b | `Left of 'a | `Right of 'b ] -> 'c option) ->
'a t -> 'b t -> 'c t
val of_seq : (key * 'a) CCMap.sequence -> 'a t
val add_seq : 'a t -> (key * 'a) CCMap.sequence -> 'a t
val to_seq : 'a t -> (key * 'a) CCMap.sequence
val of_list : (key * 'a) list -> 'a t
val add_list : 'a t -> (key * 'a) list -> 'a t
val keys : 'a t -> key CCMap.sequence
val values : 'a t -> 'a CCMap.sequence
val to_list : 'a t -> (key * 'a) list
val pp :
?start:string ->
?stop:string ->
?arrow:string ->
?sep:string ->
key CCMap.printer -> 'a CCMap.printer -> 'a t CCMap.printer
val print :
?start:string ->
?stop:string ->
?arrow:string ->
?sep:string ->
key CCMap.formatter -> 'a CCMap.formatter -> 'a t CCMap.formatter
end
module VarSet :
sig
type elt = t HVar.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
val find : elt -> t -> elt
val of_seq : elt CCSet.sequence -> t
val add_seq : t -> elt CCSet.sequence -> t
val to_seq : t -> elt CCSet.sequence
val of_list : elt list -> t
val add_list : t -> elt list -> t
val to_list : t -> elt list
val pp :
?start:string ->
?stop:string -> ?sep:string -> elt CCSet.printer -> t CCSet.printer
val print :
?start:string ->
?stop:string ->
?sep:string -> elt CCSet.formatter -> t CCSet.formatter
end
module VarTbl :
sig
type key = t HVar.t
type 'a t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Hashtbl.statistics
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> or_:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.sequence
val values : 'a t -> 'a CCHashtbl.sequence
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_seq : 'a t -> (key * 'a) CCHashtbl.sequence
val of_seq : (key * 'a) CCHashtbl.sequence -> 'a t
val add_seq : 'a t -> (key * 'a) CCHashtbl.sequence -> unit
val add_seq_count : int t -> key CCHashtbl.sequence -> unit
val of_seq_count : key CCHashtbl.sequence -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val print :
key CCHashtbl.printer ->
'a CCHashtbl.printer -> 'a t CCHashtbl.printer
end
module DB :
sig
type env = InnerTerm.t DBEnv.t
val closed : InnerTerm.t -> bool
val contains : InnerTerm.t -> int -> bool
val shift : int -> InnerTerm.t -> InnerTerm.t
val unshift : int -> InnerTerm.t -> InnerTerm.t
val replace : InnerTerm.t -> sub:InnerTerm.t -> InnerTerm.t
val from_var : InnerTerm.t -> var:InnerTerm.t -> InnerTerm.t
val eval : InnerTerm.DB.env -> InnerTerm.t -> InnerTerm.t
val apply_subst :
InnerTerm.t InnerTerm.VarMap.t -> InnerTerm.t -> InnerTerm.t
end
module Seq :
sig
val vars : InnerTerm.t -> InnerTerm.t HVar.t Sequence.t
val subterms : InnerTerm.t -> InnerTerm.t Sequence.t
val subterms_depth : InnerTerm.t -> (InnerTerm.t * int) Sequence.t
val symbols : InnerTerm.t -> ID.t Sequence.t
val types : InnerTerm.t -> InnerTerm.t Sequence.t
val max_var : InnerTerm.t HVar.t Sequence.t -> int
val min_var : InnerTerm.t HVar.t Sequence.t -> int
val add_set :
InnerTerm.Set.t -> InnerTerm.t Sequence.t -> InnerTerm.Set.t
val add_tbl : unit InnerTerm.Tbl.t -> InnerTerm.t Sequence.t -> unit
end
module Pos :
sig
val at : InnerTerm.t -> Position.t -> InnerTerm.t
val replace :
InnerTerm.t -> Position.t -> by:InnerTerm.t -> InnerTerm.t
end
val replace :
InnerTerm.t -> old:InnerTerm.t -> by:InnerTerm.t -> InnerTerm.t
val bind_vars :
ty:InnerTerm.t ->
Binder.t -> InnerTerm.t HVar.t list -> InnerTerm.t -> InnerTerm.t
val close_vars : ty:InnerTerm.t -> Binder.t -> InnerTerm.t -> InnerTerm.t
val is_ground : InnerTerm.t -> bool
val size : InnerTerm.t -> int
val depth : InnerTerm.t -> int
val head : InnerTerm.t -> ID.t option
val print_hashconsing_ids : bool Pervasives.ref
val pp : t CCFormat.printer
val to_string : t -> string
type print_hook =
int -> t CCFormat.printer -> Format.formatter -> t -> bool
val pp_depth : ?hooks:print_hook list -> int -> t CCFormat.printer
val add_default_hook : print_hook -> unit
val debugf : InnerTerm.t CCFormat.printer
end