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

md5=0cfaa70f569be9494d24c829e6555d46

sha512=8ee967c636b67b22a4f34115871d8f9b9114df309afc9ddf5f61275251088c6e21f6cf745811df75554d30f4cebb6682f23eeb2e88b771330c4b60ce3f6bf5e2

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

Module `Univ.Universe`Source

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 hcons : t -> t

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