Indschemes (p.rocq-runtime.9.2.0.doc.rocq-runtime.vernac.Indschemes)

Source

type resolved_scheme =
  Names.Id.t CAst.t
  * Indrec.dep_flag
  * Names.inductive
  * UnivGen.QualityOrSet.t

See also Auto_ind_decl, Indrec, Eqscheme, Ind_tables, ...

Build and register the boolean equalities associated to an inductive type

Sourceval declare_beq_scheme : ?locmap:Ind_tables.Locmap.t -> Names.MutInd.t -> unit

Source

val declare_eq_decidability : 
  ?locmap:Ind_tables.Locmap.t ->
  Names.MutInd.t ->
  unit

Build and register rewriting schemes for an equality-like inductive type

Sourceval declare_rewriting_schemes : ?loc:Loc.t -> Names.inductive -> unit

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 : 
  register:bool ->
  ?force_mutual:bool ->
  Environ.env ->
  ?isrec:bool ->
  resolved_scheme list ->
  unit

Main calls to interpret the Scheme command

Source

val do_scheme : 
  register:bool ->
  Environ.env ->
  (Names.Id.t CAst.t option * Vernacexpr.scheme) list ->
  unit

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

Sourceval do_combined_scheme : Names.lident -> Names.Constant.t list -> unit

Source

type declare_mind_function =
  ?all_depth:int ->
  Entries.mutual_inductive_entry ->
  UState.named_universes_entry ->
  Names.MutInd.t

Hook called at each inductive type definition

Source

val declare_default_schemes : 
  ?locmap:Ind_tables.Locmap.t ->
  ?all_depth:int ->
  declare_mind:declare_mind_function ->
  Names.MutInd.t ->
  unit

Sourcemodule Internal : sig ... end