# HG changeset patch
# User wenzelm
# Date 1144922474 -7200
# Node ID 3f5835aac3ced48cdcfa32841d082e0264ffebd3
# Parent  d7c10da57042692babf0dcab72e0453272e8b884
ignore sort constraints of consts declarations;
use conjunction stuff from conjunction.ML;
prefer ProofContext.pretty_thm;

diff -r d7c10da57042 -r 3f5835aac3ce src/Pure/Tools/codegen_theorems.ML
--- a/src/Pure/Tools/codegen_theorems.ML	Thu Apr 13 12:01:13 2006 +0200
+++ b/src/Pure/Tools/codegen_theorems.ML	Thu Apr 13 12:01:14 2006 +0200
@@ -238,6 +238,7 @@
   val merge = merge_T;
   fun print (thy : theory) (data : T) =
     let
+      val pretty_thm = ProofContext.pretty_thm (ProofContext.init thy);
       val codethms = (fn T { codethms, ... } => codethms) data;
       val funs = (Symtab.dest o (fn Codethms { funs, ... } => funs)) codethms;
       val preds = (Symtab.dest o (fn Codethms { preds, ... } => preds)) codethms;
@@ -249,7 +250,7 @@
         Pretty.fbreaks (
           map (fn (c, thms) => 
             (Pretty.block o Pretty.fbreaks) (
-              Pretty.str c :: map Display.pretty_thm thms
+              Pretty.str c :: map pretty_thm thms
             )
           ) funs
         ) @ [
@@ -257,12 +258,12 @@
         Pretty.fbreaks (
           map (fn (c, thms) => 
             (Pretty.block o Pretty.fbreaks) (
-              Pretty.str c :: map Display.pretty_thm thms
+              Pretty.str c :: map pretty_thm thms
             )
           ) preds
         ) @ [
         Pretty.str "unfolding theorems:",
-        (Pretty.block o Pretty.fbreaks o map Display.pretty_thm) unfolds
+        (Pretty.block o Pretty.fbreaks o map pretty_thm) unfolds
       ])
     end;
 end);
@@ -382,7 +383,7 @@
           in (thm', max') end;
         val (thms', maxidx) = fold_map incr_thm thms 0;
         val (ty1::tys) = map extract_typ thms;
-        fun unify ty = Type.unify (Sign.tsig_of thy) (ty1, ty);
+        fun unify ty = Sign.typ_unify thy (ty1, ty);
         val (env, _) = fold unify tys (Vartab.empty, maxidx)
         val instT = Vartab.fold (fn (x_i, (sort, ty)) =>
           cons (Thm.ctyp_of thy (TVar (x_i, sort)), Thm.ctyp_of thy ty)) env [];
@@ -394,9 +395,9 @@
   |> fold (fn f => f thy) (the_preprocs thy)
   |> map (rewrite_rule (the_unfolds thy))
   |> (if is_some extract_typ then common_typ thy (the extract_typ) else I)
-  |> Drule.conj_intr_list
+  |> Conjunction.intr_list
   |> Drule.zero_var_indexes
-  |> Drule.conj_elim_list
+  |> Conjunction.elim_list
   |> map Drule.unvarifyT
   |> map Drule.unvarify;