package coq-core
The Coq Proof Assistant -- Core Binaries and Tools
Install
Dune Dependency
Authors
Maintainers
Sources
coq-8.20.0.tar.gz
md5=66e57ea55275903bef74d5bf36fbe0f1
sha512=1a7eac6e2f58724a3f9d68bbb321e4cfe963ba1a5551b9b011db4b3f559c79be433d810ff262593d753770ee41ea68fbd6a60daa1e2319ea00dff64c8851d70b
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)"
>