UnivProblem (u.4b72d9d53197f808b005effa2cda4f29.coq-core.8.20.1.doc.coq-core.engine.UnivProblem)

Constraints for type inference

When doing conversion of universes, not only do we have =/<= constraints but also Lub constraints which correspond to unification of two levels which might not be necessary if unfolding is performed.

UWeak constraints come from irrelevant universes in cumulative polymorphism.

Sourcetype t =

| QEq of Sorts.Quality.t * Sorts.Quality.t
| QLeq of Sorts.Quality.t * Sorts.Quality.t
| ULe of Sorts.t * Sorts.t
| UEq of Sorts.t * Sorts.t
| ULub of Univ.Level.t * Univ.Level.t
| UWeak of Univ.Level.t * Univ.Level.t

Sourceval is_trivial : t -> bool

Sourceval check_eq_level : UGraph.t -> Univ.Level.t -> Univ.Level.t -> bool

Wrapper around the UGraph function to handle Prop

Sourcemodule Set : sig ... end

Sourcetype 'a constraint_function = 'a -> 'a -> Set.t -> Set.t

Sourceval enforce_eq_instances_univs : bool -> UVars.Instance.t constraint_function

Sourceval enforce_eq_qualities : Sorts.Quality.t array constraint_function

Source

val compare_cumulative_instances : 
  Conversion.conv_pb ->
  UVars.Variance.t array ->
  UVars.Instance.t constraint_function