package rocq-runtime

You can search for identifiers within the package.

in-package search v0.2.0

The Rocq Prover -- Core Binaries and Tools

Install

Dune Dependency

rocq-prover.org Readme Edit opam file Versions (1)

Authors

T

The Rocq development team, INRIA, CNRS, and contributors

Maintainers

T

The Rocq development team <coqdev@inria.fr>

Sources

rocq-9.0.0.tar.gz

md5=8d522602d23e7a665631826dab9aa92b

sha512=f4f76a6a178e421c99ee7a331a2fd97a06e9c5d0168d7e60c44e3820d8e1a124370ea104ad90c7f87a9a1e9d87b2d0d7d2d387c998feeaed4a75ed04e176a4be

doc/rocq-runtime.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 : ?init:Level.Set.t -> t -> Level.Set.t

Get the levels inside the universe, forgetting about increments, and add them to init (default empty)

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.ExtS with type elt = t

module Map : CMap.ExtS with type key = t and module Set := Set