package coq-core

  1. Overview
  2. Docs
Legend:
Page
Library
Module
Module type
Parameter
Class
Class type
Source

Module IndrecSource

Errors related to recursors building

Sourcetype recursion_scheme_error =
  1. | NotAllowedCaseAnalysis of bool * Sorts.t * Constr.pinductive
  2. | NotMutualInScheme of Names.inductive * Names.inductive
  3. | 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

Sourcetype case_analysis = private {
  1. case_params : EConstr.rel_context;
  2. case_pred : Names.Name.t EConstr.binder_annot * EConstr.types;
  3. case_branches : EConstr.rel_context;
  4. case_arity : EConstr.rel_context;
  5. case_body : EConstr.t;
  6. case_type : EConstr.t;
}
Sourceval check_valid_elimination : Environ.env -> Evd.evar_map -> Names.inductive EConstr.puniverses -> dep:bool -> EConstr.ESorts.t -> unit
Sourceval eval_case_analysis : case_analysis -> EConstr.t * EConstr.types
Sourceval default_case_analysis_dependence : Environ.env -> Names.inductive -> bool

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

Builds a recursive induction scheme (Peano-induction style) in the given sort.

Builds mutual (recursive) induction schemes

Sourceval build_mutual_induction_scheme : Environ.env -> Evd.evar_map -> ?force_mutual:bool -> (Names.inductive EConstr.puniverses * dep_flag * EConstr.ESorts.t) list -> Evd.evar_map * EConstr.constr list

Recursor names utilities

Sourceval elimination_suffix : Sorts.family -> string
Sourceval make_elimination_ident : Names.Id.t -> Sorts.family -> Names.Id.t
Sourceval case_suffix : string

Default dependence of eliminations for Prop inductives

Sourceval declare_prop_but_default_dependent_elim : Names.inductive -> unit
Sourceval is_prop_but_default_dependent_elim : Names.inductive -> bool
OCaml

Innovation. Community. Security.