(************************************************************************) (* * The Coq Proof Assistant / The Coq Development Team *) (* v * INRIA, CNRS and contributors - Copyright 1999-2018 *) (* constr -> Univ.Universe.t val check_subtyping_arity_constructor : env -> (constr -> constr) -> types -> int -> bool -> unit val check_positivity : chkpos:bool -> Names.MutInd.t -> Environ.env -> (Constr.constr, Constr.types) Context.Rel.pt -> Declarations.recursivity_kind -> ('a * Names.Id.t list * Constr.types array * (('b, 'c) Context.Rel.pt * 'd)) array -> Int.t * Declarations.recarg Rtree.t array (** The following function does checks on inductive declarations. *) val check_inductive : env -> MutInd.t -> mutual_inductive_entry -> mutual_inductive_body (** The following enforces a system compatible with the univalent model *) val enforce_indices_matter : unit -> unit val is_indices_matter : unit -> bool