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

md5=66e57ea55275903bef74d5bf36fbe0f1

sha512=1a7eac6e2f58724a3f9d68bbb321e4cfe963ba1a5551b9b011db4b3f559c79be433d810ff262593d753770ee41ea68fbd6a60daa1e2319ea00dff64c8851d70b

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

Module `Names.Id`Source

Representation and operations on identifiers.

Sourcetype t

Values of this type represent (Coq) identifiers.

Sourceval equal : t -> t -> bool

Equality over identifiers.

Sourceval compare : t -> t -> int

Comparison over identifiers.

Sourceval hash : t -> int

Hash over identifiers.

Sourceval is_valid : string -> bool

Check that a string may be converted to an identifier.

Sourceval is_valid_ident_part : string -> bool

Check that a string is a valid part of an identifier

Sourceval of_bytes : bytes -> t

Sourceval of_string : string -> t

Converts a string into an identifier.

raises UserError
if the string is invalid as an identifier.

Sourceval of_string_soft : string -> t

Same as of_string except that any string made of supported UTF-8 characters is accepted.

raises UserError
if the string is invalid as an UTF-8 string.

Sourceval to_string : t -> string

Converts a identifier into an string.

Sourceval print : t -> Pp.t

Pretty-printer.

module Set : Util.Set.S with type elt = t

Finite sets of identifiers.

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

Finite maps of identifiers.

module Pred : Predicate.S with type elt = t

Predicates over identifiers.

module List : Util.List.MonoS with type elt = t

Operations over lists of identifiers.

Sourceval hcons : t -> t

Hashconsing of identifiers.