package coq-core

  1. Overview
  2. No Docs
The Coq Proof Assistant -- Core Binaries and Tools

Install 

dune-project
 Dependency

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

Authors

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

Maintainers

  1. T
    The Coq development team <coqdev@inria.fr>

Sources

coq-8.19.0.tar.gz
md5=64b49dbc3205477bd7517642c0b9cbb6
sha512=02fb5b4fb575af79e092492cbec6dc0d15a1d74a07f827f657a72d4e6066532630e5a6d15be4acdb73314bd40b9a321f9ea0584e0ccfe51fd3a56353bd30db9b

doc/coq-core.kernel/UGraph/index.html

Module UGraphSource

Sourcetype t

Graphs of universes.

Sourceval set_type_in_type : bool -> t -> t
Sourceval type_in_type : t -> bool

When type_in_type, functions adding constraints do not fail and may instead ignore inconsistent constraints.

Checking functions such as check_leq always return true.

Sourcetype 'a check_function = t -> 'a -> 'a -> bool
Sourceval check_eq_level : Univ.Level.t check_function
Sourceval initial_universes : t

The initial graph of universes: Prop < Set

Sourceval initial_universes_with : t -> t

Initial universes, but keeping options such as type in type from the argument.

Sourceval check_eq_instances : UVars.Instance.t check_function

Check equality of instances w.r.t. a universe graph

...

Merge of constraints in a universes graph. The function merge_constraints merges a set of constraints in a given universes graph. It raises the exception UniverseInconsistency if the constraints are not satisfiable.

Sourcetype path_explanation
Sourcetype explanation =
  1. | Path of path_explanation
  2. | Other of Pp.t
Sourcetype univ_inconsistency = Univ.constraint_type * Sorts.t * Sorts.t * explanation option
Sourceexception UniverseInconsistency of univ_inconsistency
Sourceval enforce_constraint : Univ.univ_constraint -> t -> t
Sourceval merge_constraints : Univ.Constraints.t -> t -> t
Sourceval check_constraint : t -> Univ.univ_constraint -> bool
Sourceval check_constraints : Univ.Constraints.t -> t -> bool
Sourceval check_eq_sort : t -> Sorts.t -> Sorts.t -> bool
Sourceval check_leq_sort : t -> Sorts.t -> Sorts.t -> bool

Adds a universe to the graph, ensuring it is >= or > Set.

Sourceexception AlreadyDeclared
Sourcemodule Bound : sig ... end
Sourceval add_universe : Univ.Level.t -> lbound:Bound.t -> strict:bool -> t -> t
Sourceexception UndeclaredLevel of Univ.Level.t

Check that the universe levels are declared. Otherwise

Sourceval check_declared_universes : t -> Univ.Level.Set.t -> unit
Sourceval empty_universes : t

The empty graph of universes

Sourceval constraints_of_universes : t -> Univ.Constraints.t * Univ.Level.Set.t list

constraints_of_universes g returns csts and partition where csts are the non-Eq constraints and partition is the partition of the universes into equivalence classes.

Sourceval choose : (Univ.Level.t -> bool) -> t -> Univ.Level.t -> Univ.Level.t option

choose p g u picks a universe verifying p and equal to u in g.

Sourceval constraints_for : kept:Univ.Level.Set.t -> t -> Univ.Constraints.t

constraints_for ~kept g returns the constraints about the universes kept in g up to transitivity.

eg if g is a <= b <= c then constraints_for ~kept:{a, c} g is a <= c.

Sourceval domain : t -> Univ.Level.Set.t

Known universes

check_subtype univ ctx1 ctx2 checks whether ctx2 is an instance of ctx1.

Dumping
Sourcetype node =
  1. | Alias of Univ.Level.t
  2. | Node of bool Univ.Level.Map.t
    (*

    Nodes v s.t. u < v (true) or u <= v (false)

    *)
Pretty-printing of universes.
Sourceval pr_universes : (Univ.Level.t -> Pp.t) -> node Univ.Level.Map.t -> Pp.t
Sourceval explain_universe_inconsistency : (Sorts.QVar.t -> Pp.t) -> (Univ.Level.t -> Pp.t) -> univ_inconsistency -> Pp.t
Sourceval check_universes_invariants : t -> unit

Debugging