package coq-core

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

Install 

dune-project
 Dependency

coq.inria.fr Readme 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.2.tar.gz
md5=5d1187d5e44ed0163f76fb12dabf012e
sha512=91bc81530fa4f6498961583ad51eac5001f139881788b88e360a866ad8e2a6e2c5bce86d1a580ab4cd4782bf49d48318767df82471ce33ba3ac143e5569ad33c

doc/coq-core.kernel/Univ/Universe/index.html

Module Univ.UniverseSource

Sourcetype t

Type of universes. A universe is defined as a set of level expressions. A level expression is built from levels and successors of level expressions, i.e.: le ::= l + n, n \in N.

A universe is said atomic if it consists of a single level expression with no increment, and algebraic otherwise (think the least upper bound of a set of level expressions).

Sourceval compare : t -> t -> int

Comparison function

Sourceval equal : t -> t -> bool

Equality function on formal universes

Sourceval hash : t -> int

Hash function

Sourceval make : Level.t -> t

Create a universe representing the given level.

Sourceval pr : (Level.t -> Pp.t) -> t -> Pp.t

Pretty-printing

Sourceval raw_pr : t -> Pp.t
Sourceval is_level : t -> bool

Test if the universe is a level or an algebraic universe.

Sourceval is_levels : t -> bool

Test if the universe is a lub of levels or contains +n's.

Sourceval level : t -> Level.t option

Try to get a level out of a universe, returns None if it is an algebraic universe.

Sourceval levels : t -> Level.Set.t

Get the levels inside the universe, forgetting about increments

Sourceval super : t -> t

The universe strictly above

Sourceval sup : t -> t -> t

The l.u.b. of 2 universes

Sourceval type0 : t

image of Set in the universes hierarchy

Sourceval type1 : t

the universe of the type of Prop/Set

Sourceval is_type0 : t -> bool
Sourceval exists : ((Level.t * int) -> bool) -> t -> bool
Sourceval for_all : ((Level.t * int) -> bool) -> t -> bool
Sourceval repr : t -> (Level.t * int) list
Sourceval unrepr : (Level.t * int) list -> t
module Set : CSet.S with type elt = t
module Map : CMap.ExtS with type key = t and module Set := Set