UnivSubst (p.coq-core.8.19.2.doc.coq-core.engine.UnivSubst)

Sourcetype 'a universe_map = 'a Univ.Level.Map.t

Sourcetype universe_subst = Univ.Universe.t universe_map

Sourcetype universe_subst_fn = Univ.Level.t -> Univ.Universe.t option

Sourcetype universe_level_subst_fn = Univ.Level.t -> Univ.Level.t

Sourcetype quality_subst = Sorts.Quality.t Sorts.QVar.Map.t

Sourcetype quality_subst_fn = Sorts.QVar.t -> Sorts.Quality.t

Sourceval level_subst_of : universe_subst_fn -> universe_level_subst_fn

The resulting function must never be called on a level which would produce an algebraic.

Source

val subst_univs_constraints : 
  universe_subst_fn ->
  Univ.Constraints.t ->
  Univ.Constraints.t

Source

val nf_binder_annot : 
  (Sorts.relevance -> Sorts.relevance) ->
  'a Context.binder_annot ->
  'a Context.binder_annot

Source

val nf_evars_and_universes_opt_subst : 
  (Constr.existential -> Constr.constr option) ->
  quality_subst_fn ->
  universe_subst_fn ->
  Constr.constr ->
  Constr.constr

Source

val subst_univs_universe : 
  universe_subst_fn ->
  Univ.Universe.t ->
  Univ.Universe.t

Sourceval pr_universe_subst : (Univ.Level.t -> Pp.t) -> universe_subst -> Pp.t

Sourceval enforce_eq : Univ.Universe.t Univ.constraint_function

Sourceval enforce_leq : Univ.Universe.t Univ.constraint_function

Source

val enforce_eq_sort : 
  Sorts.t ->
  Sorts.t ->
  Univ.Constraints.t ->
  Univ.Constraints.t

Source

val enforce_leq_sort : 
  Sorts.t ->
  Sorts.t ->
  Univ.Constraints.t ->
  Univ.Constraints.t

Source

val enforce_leq_alg_sort : 
  Sorts.t ->
  Sorts.t ->
  UGraph.t ->
  Univ.Constraints.t * UGraph.t

Picks an arbitrary set of constraints sufficient to ensure u <= v.