package coq-core
The Coq Proof Assistant -- Core Binaries and Tools
Install
Dune Dependency
Authors
Maintainers
Sources
coq-8.20.1.tar.gz
md5=0cfaa70f569be9494d24c829e6555d46
sha512=8ee967c636b67b22a4f34115871d8f9b9114df309afc9ddf5f61275251088c6e21f6cf745811df75554d30f4cebb6682f23eeb2e88b771330c4b60ce3f6bf5e2
doc/coq-core.vernac/Indschemes/index.html
Module Indschemes
Source
See also Auto_ind_decl, Indrec, Eqscheme, Ind_tables, ...
Build and register the boolean equalities associated to an inductive type
Build and register a congruence scheme for an equality-like inductive type
Build and register rewriting schemes for an equality-like inductive type
Mutual Minimality/Induction scheme. force_mutual
forces the construction of eliminators having the same predicates and methods even if some of the inductives are not recursive. By default it is false
and some of the eliminators are defined as simple case analysis. By default isrec
is true
.
Source
val do_mutual_induction_scheme :
?force_mutual:bool ->
Environ.env ->
?isrec:bool ->
resolved_scheme list ->
unit
Main calls to interpret the Scheme command
Main call to Scheme Equality command
Source
val do_scheme_equality :
?locmap:Ind_tables.Locmap.t ->
Vernacexpr.equality_scheme_type ->
Libnames.qualid Constrexpr.or_by_notation ->
unit
Combine a list of schemes into a conjunction of them
Source
val build_combined_scheme :
Environ.env ->
Names.Constant.t list ->
Evd.evar_map * Constr.constr * Constr.types
Hook called at each inductive type definition
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>