sig
type t = private InnerTerm.t
type ty = Type.t
type builtin = TType | Prop | Term | Rat | Int
val pp_builtin : Type.builtin CCFormat.printer
val builtin_conv : Type.builtin -> Builtin.t
type view = private
Builtin of Type.builtin
| Var of Type.t HVar.t
| DB of int
| App of ID.t * Type.t list
| Fun of Type.t list * Type.t
| Forall of Type.t
val view : Type.t -> Type.view
val equal : t -> t -> bool
val hash_fun : t -> CCHash.state -> CCHash.state
val hash : t -> int
val compare : t -> t -> int
val is_tType : Type.t -> bool
val is_var : Type.t -> bool
val is_bvar : Type.t -> bool
val is_app : Type.t -> bool
val is_fun : Type.t -> bool
val is_forall : Type.t -> bool
val tType : Type.t
val prop : Type.t
val term : Type.t
val int : Type.t
val rat : Type.t
val var : Type.t HVar.t -> Type.t
val var_of_int : int -> Type.t
val app : ID.t -> Type.t list -> Type.t
val builtin : Type.builtin -> Type.t
val const : ID.t -> Type.t
val arrow : Type.t list -> Type.t -> Type.t
val forall : Type.t -> Type.t
val forall_n : int -> Type.t -> Type.t
val bvar : int -> Type.t
val ( ==> ) : Type.t list -> Type.t -> Type.t
val of_term_unsafe : InnerTerm.t -> Type.t
val of_terms_unsafe : InnerTerm.t list -> Type.t list
val cast_var_unsafe : InnerTerm.t HVar.t -> Type.t HVar.t
module Set :
sig
type elt = 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 Map :
sig
type key = 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 Tbl :
sig
type key = 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 Seq :
sig
val vars : Type.t -> Type.t HVar.t Sequence.t
val sub : Type.t -> Type.t Sequence.t
val symbols : Type.t -> ID.t Sequence.t
val add_set : Type.Set.t -> Type.t Sequence.t -> Type.Set.t
val max_var : Type.t HVar.t Sequence.t -> int
val min_var : Type.t HVar.t Sequence.t -> int
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 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 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
val vars_set : Type.VarSet.t -> Type.t -> Type.VarSet.t
val vars : Type.t -> Type.t HVar.t list
val close_forall : Type.t -> Type.t
type arity_result = Arity of int * int | NoArity
val arity : Type.t -> Type.arity_result
val expected_args : Type.t -> Type.t list
val expected_ty_vars : Type.t -> int
val is_ground : Type.t -> bool
val size : Type.t -> int
val depth : Type.t -> int
val open_poly_fun : Type.t -> int * Type.t list * Type.t
val open_fun : Type.t -> Type.t list * Type.t
exception ApplyError of string
val apply : Type.t -> Type.t list -> Type.t
val apply1 : Type.t -> Type.t -> Type.t
val apply_unsafe : Type.t -> InnerTerm.t list -> Type.t
type print_hook =
int -> t CCFormat.printer -> Format.formatter -> t -> bool
val pp_depth : ?hooks:print_hook list -> int -> t CCFormat.printer
val pp : t CCFormat.printer
val to_string : t -> string
val pp_surrounded : Type.t CCFormat.printer
val pp_typed_var : Type.t HVar.t CCFormat.printer
module TPTP :
sig
type print_hook =
int -> t CCFormat.printer -> Format.formatter -> t -> bool
val pp_depth : ?hooks:print_hook list -> int -> t CCFormat.printer
val pp : t CCFormat.printer
val to_string : t -> string
val pp_typed_var : Type.t HVar.t CCFormat.printer
val i : Type.t
val o : Type.t
val int : Type.t
val rat : Type.t
val real : Type.t
end
module Conv :
sig
type ctx
val create : unit -> Type.Conv.ctx
val copy : Type.Conv.ctx -> Type.Conv.ctx
val clear : Type.Conv.ctx -> unit
val of_simple_term : Type.Conv.ctx -> TypedSTerm.t -> Type.t option
val var_of_simple_term :
Type.Conv.ctx -> TypedSTerm.t Var.t -> Type.t HVar.t
val fresh_ty_var : Type.Conv.ctx -> Type.t HVar.t
exception Error
val of_simple_term_exn : Type.Conv.ctx -> TypedSTerm.t -> Type.t
val to_simple_term :
?env:TypedSTerm.t Var.t DBEnv.t -> Type.t -> TypedSTerm.t
end
end