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.parsing/Notgram_ops/index.html

Module `Notgram_ops`Source

Declare the parsing rules and entries of a (possibly uninterpreted) notation

Source

val declare_notation_grammar : 
  Constrexpr.notation ->
  Notation_gram.notation_grammar ->
  unit

Sourceval grammar_of_notation : Constrexpr.notation -> Notation_gram.notation_grammar

raise Not_found if not declared

Source

val declare_notation_non_terminals : 
  Constrexpr.notation ->
  Extend.constr_entry_key list ->
  unit

Source

val non_terminals_of_notation : 
  Constrexpr.notation ->
  Extend.constr_entry_key list

Source

val longest_common_prefix : 
  Constrexpr.notation ->
  (Constrexpr.notation * int) option

longest_common_prefix ntn looks among notations ntn' already registered with declare_notation_non_terminals ntn' for the one that shares the longest common prefix with ntn, if any returns Some (ntn', k) where k is the number of nonterminal symbols in the common prefix between ntn and ntn'.

Sourceval get_defined_notations : unit -> Constrexpr.notation list

Returns notations with defined parsing/printing rules

On This Page

Declare the parsing rules and entries of a (possibly uninterpreted) notation

package coq-core

Install

Dune Dependency

Authors

Maintainers

Sources

doc/coq-core.parsing/Notgram_ops/index.html

Module Notgram_opsSource

Declare the parsing rules and entries of a (possibly uninterpreted) notation

Module `Notgram_ops`Source