# HG changeset patch
# User chaieb
# Date 1181854782 -7200
# Node ID 4b03e3586f7f6c2f418bc72ff4acef258845e9ba
# Parent  a7c128816edc853a372ed1d3f46e675434b0dd8a
fixed term_constants (impact on is_relevant); terms in generalize_tac are sorted before we abstract over them (to *try* to avoid the case when a term to be abstracted over already occurs in an other)

diff -r a7c128816edc -r 4b03e3586f7f src/HOL/Tools/Presburger/presburger.ML
--- a/src/HOL/Tools/Presburger/presburger.ML	Thu Jun 14 22:59:40 2007 +0200
+++ b/src/HOL/Tools/Presburger/presburger.ML	Thu Jun 14 22:59:42 2007 +0200
@@ -1,3 +1,4 @@
+
 (*  Title:      HOL/Tools/Presburger/presburger.ML
     ID:         $Id$
     Author:     Amine Chaieb, TU Muenchen
@@ -64,7 +65,7 @@
 
  val term_constants =
   let fun h acc t = case t of
-    Const _ => [t]
+    Const _ => insert (op aconv) t acc
   | a$b => h (h acc a) b
   | Abs (_,_,t) => h acc t
   | _ => acc
@@ -93,7 +94,7 @@
    let 
    fun all T = Drule.cterm_rule (instantiate' [SOME T] []) @{cpat "all"}
    fun gen x t = Thm.capply (all (ctyp_of_term x)) (Thm.cabs x t)
-   val ts = f p
+   val ts = sort (fn (a,b) => Term.fast_term_ord (term_of a, term_of b)) (f p)
    val p' = fold_rev gen ts p
  in Seq.of_list [implies_intr p' (implies_elim st (fold forall_elim ts (assume p')))]
  end;
@@ -179,7 +180,7 @@
    NONE => all_tac st
  | SOME _ => (if q then I else TRY) (rtac TrueI i) st
 
-fun cooper_tac elim add_ths del_ths = fn ctxt => fn i => 
+fun cooper_tac elim add_ths del_ths ctxt i = 
 let val ss = fst (Cooper_Data.get ctxt) delsimps del_ths addsimps add_ths
 in
 nogoal_tac i