package coq

You can search for identifiers within the package.

in-package search v0.2.0

Formal proof management system

Install

Dune Dependency

coq.inria.fr Edit opam file Versions (38)

Authors

T

The Coq development team, INRIA, CNRS, and contributors.

Maintainers

C

coqdev@inria.fr

Sources

coq-8.16.0.tar.gz

sha256=36577b55f4a4b1c64682c387de7abea932d0fd42fc0cd5406927dca344f53587

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 =

| 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 : UGraph.t -> 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 -> Univ.Instance.t constraint_function

On This Page

Constraints for type inference