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 Dependency

coq.inria.fr Readme Edit opam file Versions (9)

Authors

T

The Coq development team, INRIA, CNRS, and contributors

Maintainers

T

The Coq development team <coqdev@inria.fr>

Sources

coq-8.19.0.tar.gz

md5=64b49dbc3205477bd7517642c0b9cbb6

sha512=02fb5b4fb575af79e092492cbec6dc0d15a1d74a07f827f657a72d4e6066532630e5a6d15be4acdb73314bd40b9a321f9ea0584e0ccfe51fd3a56353bd30db9b

doc/coq-core.engine/UnivProblem/index.html

Module `UnivProblem`Source

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

On This Page

Constraints for type inference