UnivSubsttype 'a universe_map = 'a Univ.Level.Map.ttype universe_subst = Univ.Universe.t universe_maptype universe_subst_fn = Univ.Level.t -> Univ.Universe.t optiontype universe_level_subst_fn = Univ.Level.t -> Univ.Level.ttype quality_subst = Sorts.Quality.t Sorts.QVar.Map.ttype quality_subst_fn = Sorts.QVar.t -> Sorts.Quality.tval level_subst_of : universe_subst_fn -> universe_level_subst_fnThe resulting function must never be called on a level which would produce an algebraic.
val subst_univs_constraints : universe_subst_fn -> Univ.Constraints.t -> Univ.Constraints.tFull universes substitutions into terms
val map_universes_opt_subst_with_binders : ('a -> 'a) -> ('a -> Constr.constr -> Constr.constr) -> quality_subst_fn -> universe_subst_fn -> 'a -> Constr.constr -> Constr.constrval nf_evars_and_universes_opt_subst : (Constr.existential -> Constr.constr option) -> quality_subst_fn -> universe_subst_fn -> Constr.constr -> Constr.constrval subst_univs_universe : universe_subst_fn -> Univ.Universe.t -> Univ.Universe.tval pr_universe_subst : (Univ.Level.t -> Pp.t) -> universe_subst -> Pp.tval enforce_eq : Univ.Universe.t Univ.constraint_functionval enforce_leq : Univ.Universe.t Univ.constraint_functionval enforce_eq_sort : Sorts.t -> Sorts.t -> Univ.Constraints.t -> Univ.Constraints.tval enforce_leq_sort : Sorts.t -> Sorts.t -> Univ.Constraints.t -> Univ.Constraints.tval enforce_leq_alg_sort : Sorts.t -> Sorts.t -> UGraph.t -> Univ.Constraints.t * UGraph.tPicks an arbitrary set of constraints sufficient to ensure u <= v.