Added the automatic generation of the boolean equality if possible and the

decidability of the usual equality
Major changes:
 * andb_prop & andb_true_intro have been moved from Bool.v to Datatypes.v 
 * added 2 files:
    * toplevel/ind_tables.ml* : tables where the boolean eqs and the
        decidability proofs are stored
    * toplevel/auto_ind_decl.ml* : code of the schemes that are automatically
        generated from inductives types (currently boolean eq & decidability )
 * improvement of injection: if the decidability have been correctly computed,
   injection can now break the equalities over dependant pair

How to use:
 Set Equality Scheme. to set the automatic generation of the equality when you
create a new inductive type
 Scheme Equality for I. tries to create the equality for the already declared
type I




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

1 files changed, 7 insertions, 0 deletions

diff --git a/interp/coqlib.mli b/interp/coqlib.mli
index 0a37eefbd0..038cf94ff2 100644
--- a/interp/coqlib.mli
+++ b/interp/coqlib.mli
@@ -73,6 +73,7 @@ val path_of_false : constructor
 val glob_true : global_reference
 val glob_false : global_reference
 
+
 (* Equality *)
 val glob_eq : global_reference
 
@@ -84,6 +85,12 @@ val glob_eq : global_reference
 
 type 'a delayed = unit -> 'a
 
+type coq_bool_data = {
+  andb : constr;
+  andb_prop : constr;
+  andb_true_intro : constr}
+val build_bool_type : coq_bool_data delayed
+
 (*s For Equality tactics *)
 type coq_sigma_data = {
   proj1 : constr;