Univmodule UGlobal : sig ... endQualified global universe level
module Level : sig ... endUniverses.
module Universe : sig ... enduniv_level_mem l u Is l is mentioned in u ?
val univ_level_mem : Level.t -> Universe.t -> booluniv_level_rem u v min removes u from v, resulting in min if v was exactly u.
val univ_level_rem : Level.t -> Universe.t -> Universe.t -> Universe.ttype univ_constraint = Level.t * constraint_type * Level.tmodule Constraints : sig ... endtype 'a constrained = 'a * Constraints.tA value with universe Constraints.t.
val constraints_of : 'a constrained -> Constraints.tConstrained
type 'a constraint_function = 'a -> 'a -> Constraints.t -> Constraints.tEnforcing Constraints.t.
val enforce_eq_level : Level.t constraint_functionval enforce_leq_level : Level.t constraint_functionUniverse contexts (as sets)
A set of universes with universe Constraints.t. We linearize the set to a list after typechecking. Beware, representation could change.
module ContextSet : sig ... endtype 'a in_universe_context_set = 'a * ContextSet.tA value in a universe context set.
type universe_level_subst = Level.t Level.Map.tval empty_level_subst : universe_level_substval is_empty_level_subst : universe_level_subst -> boolval subst_univs_level_level : universe_level_subst -> Level.t -> Level.tSubstitution of universes.
val subst_univs_level_universe : universe_level_subst -> Universe.t -> Universe.tval subst_univs_level_constraints : universe_level_subst -> Constraints.t -> Constraints.tval pr_constraint_type : constraint_type -> Pp.tval pr_universe_context_set : (Level.t -> Pp.t) -> ContextSet.t -> Pp.tval pr_universe_level_subst : (Level.t -> Pp.t) -> universe_level_subst -> Pp.tval hcons_univ : Universe.t -> Universe.tval hcons_constraints : Constraints.t -> Constraints.tval hcons_universe_set : Level.Set.t -> Level.Set.tval hcons_universe_context_set : ContextSet.t -> ContextSet.t