# HG changeset patch
# User wenzelm
# Date 925203050 -7200
# Node ID 2f6cec5c046fba4638a59a03d3c1679c27b52040
# Parent  16c425fc00cb916893bcb61d64d1d80296aa3953
adapted add_inductive;

diff -r 16c425fc00cb -r 2f6cec5c046f src/HOL/Tools/datatype_abs_proofs.ML
--- a/src/HOL/Tools/datatype_abs_proofs.ML	Tue Apr 27 10:50:31 1999 +0200
+++ b/src/HOL/Tools/datatype_abs_proofs.ML	Tue Apr 27 10:50:50 1999 +0200
@@ -170,7 +170,7 @@
     val (thy1, {intrs = rec_intrs, elims = rec_elims, ...}) =
       setmp InductivePackage.quiet_mode (!quiet_mode)
         (InductivePackage.add_inductive_i false true big_rec_name' false false true
-           rec_sets (map (fn x => (("", x), [])) rec_intr_ts) [] []) thy0;
+           rec_sets [] (map (fn x => (("", x), [])) rec_intr_ts) [] []) thy0;
 
     (* prove uniqueness and termination of primrec combinators *)
 
diff -r 16c425fc00cb -r 2f6cec5c046f src/HOL/Tools/datatype_rep_proofs.ML
--- a/src/HOL/Tools/datatype_rep_proofs.ML	Tue Apr 27 10:50:31 1999 +0200
+++ b/src/HOL/Tools/datatype_rep_proofs.ML	Tue Apr 27 10:50:50 1999 +0200
@@ -136,7 +136,7 @@
     val (thy2, {raw_induct = rep_induct, intrs = rep_intrs, ...}) =
       setmp InductivePackage.quiet_mode (!quiet_mode)
         (InductivePackage.add_inductive_i false true big_rec_name false true false
-           consts (map (fn x => (("", x), [])) intr_ts) [] []) thy1;
+           consts [] (map (fn x => (("", x), [])) intr_ts) [] []) thy1;
 
     (********************************* typedef ********************************)