package coq-core

  1. Overview
  2. No Docs
The Coq Proof Assistant -- Core Binaries and Tools

Install 

dune-project
 Dependency

coq.inria.fr Edit opam file Versions (11)

Authors

  1. T
    The Coq development team, INRIA, CNRS, and contributors

Maintainers

  1. T
    The Coq development team <coqdev@inria.fr>

Sources

coq-8.19.0.tar.gz
md5=64b49dbc3205477bd7517642c0b9cbb6
sha512=02fb5b4fb575af79e092492cbec6dc0d15a1d74a07f827f657a72d4e6066532630e5a6d15be4acdb73314bd40b9a321f9ea0584e0ccfe51fd3a56353bd30db9b

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

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 family

Sourcetype case_analysis = private {
  1. case_params : EConstr.rel_context;
  2. case_pred : Names.Name.t Context.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 -> 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

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

Sourceval 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.

Builds mutual (recursive) induction schemes

Sourceval 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.

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