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

sha256=b1501d686c21836302191ae30f610cca57fb309214c126518ca009363ad2cd3c

doc/coq-core.kernel/Names/Cpred/index.html

Module `Names.Cpred`Source

The *_env modules consider an order on user part of names the others consider an order on canonical part of names

type elt = Constant.t

The type of the elements in the set.

type t

The type of sets.

val empty : t

The empty set.

val full : t

The set of all elements (of type elm).

val is_empty : t -> bool

Test whether a set is empty or not.

val is_full : t -> bool

Test whether a set contains the whole type or not.

val mem : elt -> t -> bool

mem x s tests whether x belongs to the set s.

val singleton : elt -> t

singleton x returns the one-element set containing only x.

val add : elt -> t -> t

add x s returns a set containing all elements of s, plus x. If x was already in s, then s is returned unchanged.

val remove : elt -> t -> t

remove x s returns a set containing all elements of s, except x. If x was not in s, then s is returned unchanged.

val union : t -> t -> t

Set union.

val inter : t -> t -> t

Set intersection.

val diff : t -> t -> t

Set difference.

val complement : t -> t

Set complement.

val equal : t -> t -> bool

equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

val subset : t -> t -> bool

subset s1 s2 tests whether the set s1 is a subset of the set s2.

val elements : t -> bool * elt list

Gives a finite representation of the predicate: if the boolean is false, then the predicate is given in extension. if it is true, then the complement is given