Module `Indrec`Source

Errors related to recursors building

Sourcetype recursion_scheme_error =

| NotAllowedCaseAnalysis of bool * Sorts.t * Constr.pinductive
| NotMutualInScheme of Names.inductive * Names.inductive
| NotAllowedDependentAnalysis of bool * Names.inductive

Sourceexception RecursionSchemeError of Environ.env * recursion_scheme_error

Eliminations

Sourcetype dep_flag = bool

Build a case analysis elimination scheme in some sort family

Sourcetype case_analysis = private {

case_params : EConstr.rel_context;
case_pred : Names.Name.t Context.binder_annot * EConstr.types;
case_branches : EConstr.rel_context;
case_arity : EConstr.rel_context;
case_body : EConstr.t;
case_type : EConstr.t;

}

Source

val check_valid_elimination : 
  Environ.env ->
  Constr.pinductive ->
  dep:bool ->
  Sorts.family ->
  unit

Sourceval eval_case_analysis : case_analysis -> EConstr.t * EConstr.types

Sourceval default_case_analysis_dependence : Environ.env -> Names.inductive -> bool

Source

val build_case_analysis_scheme : 
  Environ.env ->
  Evd.evar_map ->
  Constr.pinductive ->
  dep_flag ->
  Sorts.family ->
  Evd.evar_map * case_analysis

Build a dependent case elimination predicate unless type is in Prop or is a recursive record with primitive projections.

Source

val build_case_analysis_scheme_default : 
  Environ.env ->
  Evd.evar_map ->
  Constr.pinductive ->
  Sorts.family ->
  Evd.evar_map * case_analysis

Builds a recursive induction scheme (Peano-induction style) in the same sort family as the inductive family; it is dependent if not in Prop or a recursive record with primitive projections.

Source

val build_induction_scheme : 
  Environ.env ->
  Evd.evar_map ->
  Constr.pinductive ->
  dep_flag ->
  Sorts.family ->
  Evd.evar_map * Constr.constr

Builds mutual (recursive) induction schemes

Source

val build_mutual_induction_scheme : 
  Environ.env ->
  Evd.evar_map ->
  ?force_mutual:bool ->
  (Constr.pinductive * dep_flag * Sorts.family) list ->
  Evd.evar_map * Constr.constr list

Scheme combinators

weaken_sort_scheme env sigma eq s n c t derives by subtyping from c:t whose conclusion is quantified on Type i at position n of t a scheme quantified on sort s. set asks for s be declared equal to i, otherwise just less or equal to i.

Source

val weaken_sort_scheme : 
  Environ.env ->
  Evd.evar_map ->
  bool ->
  EConstr.ESorts.t ->
  int ->
  Constr.constr ->
  Constr.types ->
  Evd.evar_map * Constr.types * Constr.constr

Recursor names utilities

Source

val lookup_eliminator : 
  Environ.env ->
  Names.inductive ->
  Sorts.family ->
  Names.GlobRef.t

Sourceval elimination_suffix : Sorts.family -> string

Sourceval make_elimination_ident : Names.Id.t -> Sorts.family -> Names.Id.t

Sourceval case_suffix : string

Install

Dune Dependency

Authors

Maintainers

Sources

doc/coq-core.pretyping/Indrec/index.html

Module `Indrec`Source

package coq-core

Install

Dune Dependency

Authors

Maintainers

Sources

doc/coq-core.pretyping/Indrec/index.html

Module IndrecSource

Module `Indrec`Source