Restructuration of command.ml + generic infrastructure for inductive schemes

- Cleaning and uniformisation in command.ml:
  - For better modularity and better visibility, two files got isolated
    out of command.ml:
    - lemmas.ml is about starting and saving a proof
    - indschemes.ml is about declaring inductive schemes
  - Decomposition of the functions of command.ml into a functional part
    and the imperative part
- Inductive schemes:
  - New architecture in ind_tables.ml for registering scheme builders,
    and for sharing and generating on demand inductive schemes
  - Adding new automatically generated equality schemes (file eqschemes.ml)
    - "_congr" for equality types (completing here commit 12273)
    - "_rew_forward" (similar to vernac-level eq_rect_r), "_rew_forward_dep",
      "_rew_backward" (similar to eq_rect), "_rew_backward_dep" for
      rewriting schemes (warning, rew_forward_dep cannot be stated following
      the standard Coq pattern for inductive types: "t=u" cannot be the
      last argument of the scheme)
    - "_case", "_case_nodep", "_case_dep" for case analysis schemes
  - Preliminary step towards discriminate and injection working on any
    equality-like type (e.g. eq_true)
  - Restating JMeq_congr under the canonical form of congruence schemes
  - Renamed "Set Equality Scheme" into "Set Equality Schemes"
  - Added "Set Rewriting Schemes", "Set Case Analysis Schemes"
  - Activation of the automatic generation of boolean equality lemmas
  - Partial debug and error messages improvements for the generation of
    boolean equality and decidable equality
  - Added schemes for making dependent rewrite working (unfortunately with
    not a fully satisfactory design - see file eqschemes.ml)
- Some names of ML function made more regular (see dev/doc/changes.txt)
- Incidentally, added a flush to obsolete Local/Global syntax warning

git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@12481 85f007b7-540e-0410-9357-904b9bb8a0f7

1 files changed, 2 insertions, 2 deletions

diff --git a/doc/refman/RefMan-tac.tex b/doc/refman/RefMan-tac.tex
index 4edf1a41d1..4d5cdbb81c 100644
--- a/doc/refman/RefMan-tac.tex
+++ b/doc/refman/RefMan-tac.tex
@@ -4162,7 +4162,7 @@ general principle of mutual induction for objects in type {\term$_i$}.
 \SeeAlso Section~\ref{Scheme-examples}
 
 \subsection{Automatic declaration of schemes}
-\comindex{Set Equality Scheme}
+\comindex{Set Equality Schemes}
 \comindex{Set Elimination Schemes}
 It is possible to deactivate the automatic declaration of the induction
  principles when defining a new inductive type  with the
@@ -4171,7 +4171,7 @@ reactivated at any time with {\tt Set Elimination Schemes}.
 \\
 
 You can also activate the automatic declaration of those boolean equalities 
-(see the second variant of {\tt Scheme})  with the {\tt Set Equality Scheme}
+(see the second variant of {\tt Scheme})  with the {\tt Set Equality Schemes}
  command. However you have to be careful with this option since
 \Coq~ may now reject well-defined inductive types because it cannot compute
 a boolean equality for them.