src/HOL/Decision_Procs/ferrack_tac.ML
author haftmann
Wed May 05 18:25:34 2010 +0200 (2010-05-05)
changeset 36692 54b64d4ad524
parent 35625 9c818cab0dd0
child 36853 c8e4102b08aa
permissions -rw-r--r--
farewell to old-style mem infixes -- type inference in situations with mem_int and mem_string should provide enough information to resolve the type of (op =)
hoelzl@30439
     1
(*  Title:      HOL/Decision_Procs/ferrack_tac.ML
haftmann@29788
     2
    Author:     Amine Chaieb, TU Muenchen
haftmann@29788
     3
*)
haftmann@29788
     4
wenzelm@31302
     5
signature FERRACK_TAC =
wenzelm@31302
     6
sig
wenzelm@32740
     7
  val trace: bool Unsynchronized.ref
wenzelm@31302
     8
  val linr_tac: Proof.context -> bool -> int -> tactic
wenzelm@31302
     9
  val setup: theory -> theory
wenzelm@31302
    10
end
wenzelm@31302
    11
haftmann@29788
    12
structure Ferrack_Tac =
chaieb@23264
    13
struct
chaieb@23264
    14
wenzelm@32740
    15
val trace = Unsynchronized.ref false;
chaieb@23264
    16
fun trace_msg s = if !trace then tracing s else ();
chaieb@23264
    17
huffman@26075
    18
val ferrack_ss = let val ths = [@{thm real_of_int_inject}, @{thm real_of_int_less_iff}, 
wenzelm@32960
    19
                                @{thm real_of_int_le_iff}]
wenzelm@32960
    20
             in @{simpset} delsimps ths addsimps (map (fn th => th RS sym) ths)
wenzelm@32960
    21
             end;
chaieb@23264
    22
huffman@26075
    23
val binarith =
huffman@26075
    24
  @{thms normalize_bin_simps} @ @{thms pred_bin_simps} @ @{thms succ_bin_simps} @
huffman@26075
    25
  @{thms add_bin_simps} @ @{thms minus_bin_simps} @  @{thms mult_bin_simps};
chaieb@23318
    26
val comp_arith = binarith @ simp_thms
chaieb@23264
    27
huffman@26075
    28
val zdvd_int = @{thm zdvd_int};
huffman@26075
    29
val zdiff_int_split = @{thm zdiff_int_split};
huffman@26075
    30
val all_nat = @{thm all_nat};
huffman@26075
    31
val ex_nat = @{thm ex_nat};
huffman@26075
    32
val number_of1 = @{thm number_of1};
huffman@26075
    33
val number_of2 = @{thm number_of2};
huffman@26075
    34
val split_zdiv = @{thm split_zdiv};
huffman@26075
    35
val split_zmod = @{thm split_zmod};
huffman@26075
    36
val mod_div_equality' = @{thm mod_div_equality'};
huffman@26075
    37
val split_div' = @{thm split_div'};
nipkow@31790
    38
val Suc_eq_plus1 = @{thm Suc_eq_plus1};
huffman@26075
    39
val imp_le_cong = @{thm imp_le_cong};
huffman@26075
    40
val conj_le_cong = @{thm conj_le_cong};
nipkow@30034
    41
val mod_add_left_eq = @{thm mod_add_left_eq} RS sym;
nipkow@30034
    42
val mod_add_right_eq = @{thm mod_add_right_eq} RS sym;
huffman@26075
    43
val nat_div_add_eq = @{thm div_add1_eq} RS sym;
huffman@26075
    44
val int_div_add_eq = @{thm zdiv_zadd1_eq} RS sym;
huffman@26075
    45
val ZDIVISION_BY_ZERO_MOD = @{thm DIVISION_BY_ZERO} RS conjunct2;
huffman@26075
    46
val ZDIVISION_BY_ZERO_DIV = @{thm DIVISION_BY_ZERO} RS conjunct1;
chaieb@23264
    47
chaieb@23264
    48
fun prepare_for_linr sg q fm = 
chaieb@23264
    49
  let
chaieb@23264
    50
    val ps = Logic.strip_params fm
chaieb@23264
    51
    val hs = map HOLogic.dest_Trueprop (Logic.strip_assums_hyp fm)
chaieb@23264
    52
    val c = HOLogic.dest_Trueprop (Logic.strip_assums_concl fm)
chaieb@23264
    53
    fun mk_all ((s, T), (P,n)) =
haftmann@36692
    54
      if member (op =) (loose_bnos P) 0 then
chaieb@23264
    55
        (HOLogic.all_const T $ Abs (s, T, P), n)
chaieb@23264
    56
      else (incr_boundvars ~1 P, n-1)
chaieb@23264
    57
    fun mk_all2 (v, t) = HOLogic.all_const (fastype_of v) $ lambda v t;
chaieb@23264
    58
      val rhs = hs
chaieb@23264
    59
(*    val (rhs,irhs) = List.partition (relevant (rev ps)) hs *)
chaieb@23264
    60
    val np = length ps
wenzelm@33004
    61
    val (fm',np) =  List.foldr (fn ((x, T), (fm,n)) => mk_all ((x, T), (fm,n)))
wenzelm@33004
    62
      (List.foldr HOLogic.mk_imp c rhs, np) ps
haftmann@27436
    63
    val (vs, _) = List.partition (fn t => q orelse (type_of t) = HOLogic.natT)
wenzelm@29265
    64
      (OldTerm.term_frees fm' @ OldTerm.term_vars fm');
wenzelm@33004
    65
    val fm2 = List.foldr mk_all2 fm' vs
chaieb@23264
    66
  in (fm2, np + length vs, length rhs) end;
chaieb@23264
    67
chaieb@23264
    68
(*Object quantifier to meta --*)
chaieb@23264
    69
fun spec_step n th = if (n=0) then th else (spec_step (n-1) th) RS spec ;
chaieb@23264
    70
chaieb@23264
    71
(* object implication to meta---*)
chaieb@23264
    72
fun mp_step n th = if (n=0) then th else (mp_step (n-1) th) RS mp;
chaieb@23264
    73
chaieb@23264
    74
wenzelm@35233
    75
fun linr_tac ctxt q =
wenzelm@35625
    76
    Object_Logic.atomize_prems_tac
wenzelm@35233
    77
        THEN' (REPEAT_DETERM o split_tac [@{thm split_min}, @{thm split_max}, @{thm abs_split}])
wenzelm@35233
    78
        THEN' SUBGOAL (fn (g, i) =>
chaieb@23264
    79
  let
chaieb@23264
    80
    val thy = ProofContext.theory_of ctxt
chaieb@23264
    81
    (* Transform the term*)
chaieb@23264
    82
    val (t,np,nh) = prepare_for_linr thy q g
chaieb@23264
    83
    (* Some simpsets for dealing with mod div abs and nat*)
wenzelm@35233
    84
    val simpset0 = Simplifier.context ctxt HOL_basic_ss addsimps comp_arith
chaieb@23264
    85
    val ct = cterm_of thy (HOLogic.mk_Trueprop t)
chaieb@23264
    86
    (* Theorem for the nat --> int transformation *)
chaieb@23264
    87
   val pre_thm = Seq.hd (EVERY
chaieb@23264
    88
      [simp_tac simpset0 1,
wenzelm@35233
    89
       TRY (simp_tac (Simplifier.context ctxt ferrack_ss) 1)]
chaieb@23264
    90
      (trivial ct))
chaieb@23264
    91
    fun assm_tac i = REPEAT_DETERM_N nh (assume_tac i)
chaieb@23264
    92
    (* The result of the quantifier elimination *)
wenzelm@35233
    93
    val (th, tac) = case prop_of pre_thm of
chaieb@23264
    94
        Const ("==>", _) $ (Const ("Trueprop", _) $ t1) $ _ =>
wenzelm@28290
    95
    let val pth = linr_oracle (cterm_of thy (Pattern.eta_long [] t1))
chaieb@23264
    96
    in 
chaieb@23264
    97
          (trace_msg ("calling procedure with term:\n" ^
wenzelm@26939
    98
             Syntax.string_of_term ctxt t1);
chaieb@23264
    99
           ((pth RS iffD2) RS pre_thm,
chaieb@23264
   100
            assm_tac (i + 1) THEN (if q then I else TRY) (rtac TrueI i)))
chaieb@23264
   101
    end
chaieb@23264
   102
      | _ => (pre_thm, assm_tac i)
wenzelm@35233
   103
  in rtac ((mp_step nh o spec_step np) th) i THEN tac end);
chaieb@23264
   104
chaieb@23264
   105
val setup =
wenzelm@31302
   106
  Method.setup @{binding rferrack}
wenzelm@31302
   107
    (Args.mode "no_quantify" >> (fn q => fn ctxt =>
wenzelm@31302
   108
      SIMPLE_METHOD' (linr_tac ctxt (not q))))
wenzelm@31302
   109
    "decision procedure for linear real arithmetic";
chaieb@23264
   110
huffman@23469
   111
end