# HG changeset patch
# User wenzelm
# Date 1011297772 -3600
# Node ID abcf9fd6ee655c6bfa5770c73b09fe69b72ac0ab
# Parent  5472afdd3bd333b2483c8e18df397d4c629d48f6
added is_norm_hhf (from logic.ML);
norm_hhf based on fast Pattern.rewrite_term;

diff -r 5472afdd3bd3 -r abcf9fd6ee65 src/Pure/drule.ML
--- a/src/Pure/drule.ML	Thu Jan 17 21:02:18 2002 +0100
+++ b/src/Pure/drule.ML	Thu Jan 17 21:02:52 2002 +0100
@@ -107,6 +107,8 @@
   val del_rules: thm list -> thm list -> thm list
   val merge_rules: thm list * thm list -> thm list
   val norm_hhf_eq: thm
+  val is_norm_hhf: term -> bool
+  val norm_hhf: Sign.sg -> term -> term
   val triv_goal: thm
   val rev_triv_goal: thm
   val implies_intr_goals: cterm list -> thm -> thm
@@ -485,7 +487,7 @@
 fun eq_thm_sg (th1,th2) = Sign.eq_sg(#sign(rep_thm th1), #sign(rep_thm th2));
 
 (*Useful "distance" function for BEST_FIRST*)
-val size_of_thm = size_of_term o #prop o rep_thm;
+val size_of_thm = size_of_term o prop_of;
 
 (*maintain lists of theorems --- preserving canonical order*)
 fun del_rules rs rules = Library.gen_rems Thm.eq_thm (rules, rs);
@@ -684,6 +686,18 @@
     |> store_standard_thm_open "norm_hhf_eq"
   end;
 
+fun is_norm_hhf tm =
+  let
+    fun is_norm (Const ("==>", _) $ _ $ (Const ("all", _) $ _)) = false
+      | is_norm (t $ u) = is_norm t andalso is_norm u
+      | is_norm (Abs (_, _, t)) = is_norm t
+      | is_norm _ = true;
+  in is_norm (Pattern.beta_eta_contract tm) end;
+
+fun norm_hhf sg t =
+  if is_norm_hhf t then t
+  else Pattern.rewrite_term (Sign.tsig_of sg) [Logic.dest_equals (prop_of norm_hhf_eq)] t;
+
 
 (*** Instantiate theorem th, reading instantiations under signature sg ****)
 
@@ -692,7 +706,7 @@
 
 fun read_instantiate_sg sg sinsts th =
     let val ts = types_sorts th;
-        val used = add_term_tvarnames(#prop(rep_thm th),[]);
+        val used = add_term_tvarnames (prop_of th, []);
     in  instantiate (read_insts sg ts ts used sinsts) th  end;
 
 (*Instantiate theorem th, reading instantiations under theory of th*)
@@ -797,8 +811,8 @@
 fun tvars_of_terms ts = rev (foldl Term.add_tvars ([], ts));
 fun vars_of_terms ts = rev (foldl Term.add_vars ([], ts));
 
-fun tvars_of thm = tvars_of_terms [#prop (Thm.rep_thm thm)];
-fun vars_of thm = vars_of_terms [#prop (Thm.rep_thm thm)];
+fun tvars_of thm = tvars_of_terms [prop_of thm];
+fun vars_of thm = vars_of_terms [prop_of thm];
 
 
 (* instantiate by left-to-right occurrence of variables *)