User-friendly representation of types.
val show_record_schemes : bool refShow generalized variables in records.
val global_evar_names : bool refUse globally unique names for existential variables.
include module type of struct include Type_base.R endtype 'a meth = 'a Type_base.R.meth = {name : string;optional : bool;scheme : 'a var list * 'a {t}9;json_name : string option;}and 'a var = string * 'a Type_constraints.ttype t = Type_base.constr Type_base.R.tval excerpt : Pos.t -> string optionGiven a position, find the relevant excerpt.
val excerpt_opt : Pos.t option -> string optionGiven a strictly positive integer, generate a name in a-z+: a, b, ... z, aa, ab, ... az, ba, ...
Generate a globally unique name for evars (used for debugging only).
val make :
?filter_out:(Type_base.t -> bool) ->
?generalized:Type_base.var list ->
Type_base.t ->
tCompute the structure that a term represents, given the list of universally quantified variables. Also takes care of computing the printing name of variables, including constraint symbols, which are removed from constraint lists. It supports a mechanism for filtering out parts of the type, which are then translated as `Ellipsis.
val print : Format.formatter -> Type_base.constr Type_base.R.t -> unitPrint a type representation. Unless in debug mode, variable identifiers are not shown, and variable names are generated. Names are only meaningful over one printing, as they are re-used.
val to_string : Type_base.constr Type_base.R.t -> stringval print_type : Format.formatter -> Type_base.t -> unitval print_scheme :
Format.formatter ->
(Type_base.var list * Type_base.t) ->
unitval string_of_type : ?generalized:Type_base.var list -> Type_base.t -> stringString representation of a type.
val string_of_scheme : (Type_base.var list * Type_base.t) -> stringString representation of a type scheme.
type explanation = bool * Type_base.t * Type_base.t * t * texception Type_error of explanationval print_type_error :
formatter:Format.formatter ->
(Pos.Option.t -> 'a) ->
explanation ->
unit