diff options
author | 2018-12-29 14:31:32 -0500 | |
---|---|---|
committer | 2018-12-29 14:31:32 -0500 | |
commit | 2708a015fcf65f72328be4296a00dd32b1f1c17a (patch) | |
tree | 696f9b5fb84817e1a5c8d9271976a92e25aef18a /vernac/indschemes.mli | |
parent | d7d80c5bea564b7cb0eadc33e9ee38c9d9de1cd8 (diff) | |
parent | 9043add656177eeac1491a73d2f3ab92bec0013c (diff) |
Updated version 8.8.2 from 'upstream/8.8.2'
with Debian dir a16bcf46abacaf1a684eda04f02555c984bf540d
Diffstat (limited to 'vernac/indschemes.mli')
-rw-r--r-- | vernac/indschemes.mli | 53 |
1 files changed, 53 insertions, 0 deletions
diff --git a/vernac/indschemes.mli b/vernac/indschemes.mli new file mode 100644 index 00000000..43915788 --- /dev/null +++ b/vernac/indschemes.mli @@ -0,0 +1,53 @@ +(************************************************************************) +(* * The Coq Proof Assistant / The Coq Development Team *) +(* v * INRIA, CNRS and contributors - Copyright 1999-2018 *) +(* <O___,, * (see CREDITS file for the list of authors) *) +(* \VV/ **************************************************************) +(* // * This file is distributed under the terms of the *) +(* * GNU Lesser General Public License Version 2.1 *) +(* * (see LICENSE file for the text of the license) *) +(************************************************************************) + +open Names +open Constr +open Environ +open Vernacexpr + +(** See also Auto_ind_decl, Indrec, Eqscheme, Ind_tables, ... *) + +(** Build and register the boolean equalities associated to an inductive type *) + +val declare_beq_scheme : MutInd.t -> unit + +val declare_eq_decidability : MutInd.t -> unit + +(** Build and register a congruence scheme for an equality-like inductive type *) + +val declare_congr_scheme : inductive -> unit + +(** Build and register rewriting schemes for an equality-like inductive type *) + +val declare_rewriting_schemes : 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. + *) + +val do_mutual_induction_scheme : ?force_mutual:bool -> + (Misctypes.lident * bool * inductive * Sorts.family) list -> unit + +(** Main calls to interpret the Scheme command *) + +val do_scheme : (Misctypes.lident option * scheme) list -> unit + +(** Combine a list of schemes into a conjunction of them *) + +val build_combined_scheme : env -> Constant.t list -> Evd.evar_map * constr * types + +val do_combined_scheme : Misctypes.lident -> Misctypes.lident list -> unit + +(** Hook called at each inductive type definition *) + +val declare_default_schemes : MutInd.t -> unit |