diff options
| author |  Stephane Glondu <steph@glondu.net> | 2010-07-21 09:46:51 +0200 |
|---|---|---|
| committer | Stephane Glondu <steph@glondu.net> | 2010-07-21 09:46:51 +0200 |
| commit | 5b7eafd0f00a16d78f99a27f5c7d5a0de77dc7e6 (patch) | |
| tree | 631ad791a7685edafeb1fb2e8faeedc8379318ae /tactics/eqschemes.mli | |
| parent | da178a880e3ace820b41d38b191d3785b82991f5 (diff) | |
Imported Upstream snapshot 8.3~beta0+13298
Diffstat (limited to 'tactics/eqschemes.mli')
| -rw-r--r-- | tactics/eqschemes.mli | 46 |
1 files changed, 46 insertions, 0 deletions
diff --git a/tactics/eqschemes.mli b/tactics/eqschemes.mli new file mode 100644 index 00000000..96196ac3 --- /dev/null +++ b/tactics/eqschemes.mli @@ -0,0 +1,46 @@ +(************************************************************************) +(* v * The Coq Proof Assistant / The Coq Development Team *) +(* <O___,, * CNRS-Ecole Polytechnique-INRIA Futurs-Universite Paris Sud *) +(* \VV/ **************************************************************) +(* // * This file is distributed under the terms of the *) +(* * GNU Lesser General Public License Version 2.1 *) +(************************************************************************) + +(*i $Id$ i*) + +(* This file builds schemes relative to equality inductive types *) + +open Names +open Term +open Environ +open Ind_tables + +(* Builds a left-to-right rewriting scheme for an equality type *) + +val rew_l2r_dep_scheme_kind : individual scheme_kind +val rew_l2r_scheme_kind : individual scheme_kind +val rew_r2l_forward_dep_scheme_kind : individual scheme_kind +val rew_l2r_forward_dep_scheme_kind : individual scheme_kind +val rew_r2l_dep_scheme_kind : individual scheme_kind +val rew_r2l_scheme_kind : individual scheme_kind +val rew_asym_scheme_kind : individual scheme_kind + +val build_r2l_rew_scheme : bool -> env -> inductive -> sorts_family -> constr +val build_l2r_rew_scheme : bool -> env -> inductive -> sorts_family -> constr +val build_r2l_forward_rew_scheme : + bool -> env -> inductive -> sorts_family -> constr +val build_l2r_forward_rew_scheme : + bool -> env -> inductive -> sorts_family -> constr + +(* Builds a symmetry scheme for a symmetrical equality type *) + +val build_sym_scheme : env -> inductive -> constr +val sym_scheme_kind : individual scheme_kind + +val build_sym_involutive_scheme : env -> inductive -> constr +val sym_involutive_scheme_kind : individual scheme_kind + +(* Builds a congruence scheme for an equality type *) + +val congr_scheme_kind : individual scheme_kind +val build_congr : env -> constr * constr -> inductive -> constr |