package coq-core

You can search for identifiers within the package.

in-package search v0.2.0

The Coq Proof Assistant -- Core Binaries and Tools

Install

dune-project

Dependency

sha512=9a35311acec2a806730b94ac7dceabc88837f235c52a14c026827d9b89433bd7fa9555a9fc6829aa49edfedb24c8bbaf1411ebf463b74a50aeb17cba47745b6b

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

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

Sourceval level_subst_of : universe_subst_fn -> universe_level_subst_fn

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

val subst_instance : 
  universe_level_subst_fn ->
  Univ.Instance.t ->
  Univ.Instance.t

Sourcetype universe_opt_subst = Univ.Universe.t option universe_map

val normalize_univ_variables : 
  universe_opt_subst ->
  universe_opt_subst * Univ.Level.Set.t * universe_subst

val normalize_univ_variable_opt_subst : 
  universe_opt_subst ->
  Univ.Level.t ->
  Univ.Universe.t

val normalize_universe_opt_subst : 
  universe_opt_subst ->
  Univ.Universe.t ->
  Univ.Universe.t

Sourceval normalize_opt_subst : universe_opt_subst -> universe_opt_subst

Full universes substitutions into terms

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

val subst_univs_universe : 
  (Univ.Level.t -> Univ.Universe.t) ->
  Univ.Universe.t ->
  Univ.Universe.t

Sourceval pr_universe_subst : universe_subst -> Pp.t

Sourceval enforce_eq : Univ.Universe.t Univ.constraint_function

Sourceval enforce_leq : Univ.Universe.t Univ.constraint_function

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

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

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.