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.14.1.tar.gz

sha256=3cbfc1e1a72b16d4744f5b64ede59586071e31d9c11c811a0372060727bfd9c3

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 Univ.Universe.t * Univ.Universe.t
| UEq of Univ.Universe.t * Univ.Universe.t
| ULub of Univ.Level.t * Univ.Level.t
| UWeak of Univ.Level.t * Univ.Level.t

Sourceval is_trivial : t -> bool

Sourcemodule Set : sig ... end

Sourcetype 'a accumulator = Set.t -> 'a -> 'a option

Sourcetype 'a constrained = 'a * Set.t

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

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

Sourceval to_constraints : force_weak:bool -> UGraph.t -> Set.t -> Univ.Constraint.t

With force_weak UWeak constraints are turned into equalities, otherwise they're forgotten.

On This Page

Constraints for type inference