src/HOL/Decision_Procs/cooper_tac.ML
author wenzelm
Wed Aug 10 20:53:43 2011 +0200 (2011-08-10)
changeset 44121 44adaa6db327
parent 43594 ef1ddc59b825
child 45620 f2a587696afb
permissions -rw-r--r--
old term operations are legacy;
     1 (*  Title:      HOL/Decision_Procs/cooper_tac.ML
     2     Author:     Amine Chaieb, TU Muenchen
     3 *)
     4 
     5 signature COOPER_TAC =
     6 sig
     7   val trace: bool Unsynchronized.ref
     8   val linz_tac: Proof.context -> bool -> int -> tactic
     9   val setup: theory -> theory
    10 end
    11 
    12 structure Cooper_Tac: COOPER_TAC =
    13 struct
    14 
    15 val trace = Unsynchronized.ref false;
    16 fun trace_msg s = if !trace then tracing s else ();
    17 
    18 val cooper_ss = @{simpset};
    19 
    20 val nT = HOLogic.natT;
    21 val binarith = @{thms normalize_bin_simps};
    22 val comp_arith = binarith @ simp_thms
    23 
    24 val zdvd_int = @{thm zdvd_int};
    25 val zdiff_int_split = @{thm zdiff_int_split};
    26 val all_nat = @{thm all_nat};
    27 val ex_nat = @{thm ex_nat};
    28 val number_of1 = @{thm number_of1};
    29 val number_of2 = @{thm number_of2};
    30 val split_zdiv = @{thm split_zdiv};
    31 val split_zmod = @{thm split_zmod};
    32 val mod_div_equality' = @{thm mod_div_equality'};
    33 val split_div' = @{thm split_div'};
    34 val Suc_eq_plus1 = @{thm Suc_eq_plus1};
    35 val imp_le_cong = @{thm imp_le_cong};
    36 val conj_le_cong = @{thm conj_le_cong};
    37 val mod_add_left_eq = @{thm mod_add_left_eq} RS sym;
    38 val mod_add_right_eq = @{thm mod_add_right_eq} RS sym;
    39 val mod_add_eq = @{thm mod_add_eq} RS sym;
    40 val nat_div_add_eq = @{thm div_add1_eq} RS sym;
    41 val int_div_add_eq = @{thm zdiv_zadd1_eq} RS sym;
    42 
    43 fun prepare_for_linz q fm =
    44   let
    45     val ps = Logic.strip_params fm
    46     val hs = map HOLogic.dest_Trueprop (Logic.strip_assums_hyp fm)
    47     val c = HOLogic.dest_Trueprop (Logic.strip_assums_concl fm)
    48     fun mk_all ((s, T), (P,n)) =
    49       if Term.is_dependent P then
    50         (HOLogic.all_const T $ Abs (s, T, P), n)
    51       else (incr_boundvars ~1 P, n-1)
    52     fun mk_all2 (v, t) = HOLogic.all_const (fastype_of v) $ lambda v t;
    53     val rhs = hs
    54     val np = length ps
    55     val (fm',np) = List.foldr (fn ((x, T), (fm,n)) => mk_all ((x, T), (fm,n)))
    56       (List.foldr HOLogic.mk_imp c rhs, np) ps
    57     val (vs, _) = List.partition (fn t => q orelse (type_of t) = nT)
    58       (Misc_Legacy.term_frees fm' @ Misc_Legacy.term_vars fm');
    59     val fm2 = List.foldr mk_all2 fm' vs
    60   in (fm2, np + length vs, length rhs) end;
    61 
    62 (*Object quantifier to meta --*)
    63 fun spec_step n th = if (n=0) then th else (spec_step (n-1) th) RS spec ;
    64 
    65 (* object implication to meta---*)
    66 fun mp_step n th = if (n=0) then th else (mp_step (n-1) th) RS mp;
    67 
    68 
    69 fun linz_tac ctxt q = Object_Logic.atomize_prems_tac THEN' SUBGOAL (fn (g, i) =>
    70   let
    71     val thy = Proof_Context.theory_of ctxt
    72     (* Transform the term*)
    73     val (t,np,nh) = prepare_for_linz q g
    74     (* Some simpsets for dealing with mod div abs and nat*)
    75     val mod_div_simpset = HOL_basic_ss
    76       addsimps [refl,mod_add_eq, mod_add_left_eq,
    77           mod_add_right_eq,
    78           nat_div_add_eq, int_div_add_eq,
    79           @{thm mod_self}, @{thm "zmod_self"},
    80           @{thm mod_by_0}, @{thm div_by_0},
    81           @{thm "zdiv_zero"}, @{thm "zmod_zero"}, @{thm "div_0"}, @{thm "mod_0"},
    82           @{thm "div_by_1"}, @{thm "mod_by_1"}, @{thm "div_1"}, @{thm "mod_1"},
    83           Suc_eq_plus1]
    84       addsimps @{thms add_ac}
    85       addsimprocs [@{simproc cancel_div_mod_nat}, @{simproc cancel_div_mod_int}]
    86     val simpset0 = HOL_basic_ss
    87       addsimps [mod_div_equality', Suc_eq_plus1]
    88       addsimps comp_arith
    89       addsplits [split_zdiv, split_zmod, split_div', @{thm "split_min"}, @{thm "split_max"}]
    90     (* Simp rules for changing (n::int) to int n *)
    91     val simpset1 = HOL_basic_ss
    92       addsimps [@{thm nat_number_of_def}, zdvd_int] @ map (fn r => r RS sym)
    93         [@{thm int_int_eq}, @{thm zle_int}, @{thm zless_int}, @{thm zadd_int}, @{thm zmult_int}]
    94       addsplits [zdiff_int_split]
    95     (*simp rules for elimination of int n*)
    96 
    97     val simpset2 = HOL_basic_ss
    98       addsimps [@{thm nat_0_le}, @{thm all_nat}, @{thm ex_nat}, @{thm number_of1}, @{thm number_of2}, @{thm int_0}, @{thm int_1}]
    99       addcongs [@{thm conj_le_cong}, @{thm imp_le_cong}]
   100     (* simp rules for elimination of abs *)
   101     val simpset3 = HOL_basic_ss addsplits [@{thm abs_split}]
   102     val ct = cterm_of thy (HOLogic.mk_Trueprop t)
   103     (* Theorem for the nat --> int transformation *)
   104     val pre_thm = Seq.hd (EVERY
   105       [simp_tac mod_div_simpset 1, simp_tac simpset0 1,
   106        TRY (simp_tac simpset1 1), TRY (simp_tac simpset2 1),
   107        TRY (simp_tac simpset3 1), TRY (simp_tac cooper_ss 1)]
   108       (Thm.trivial ct))
   109     fun assm_tac i = REPEAT_DETERM_N nh (assume_tac i)
   110     (* The result of the quantifier elimination *)
   111     val (th, tac) = case (prop_of pre_thm) of
   112         Const ("==>", _) $ (Const (@{const_name Trueprop}, _) $ t1) $ _ =>
   113     let val pth = linzqe_oracle (cterm_of thy (Pattern.eta_long [] t1))
   114     in
   115           ((pth RS iffD2) RS pre_thm,
   116             assm_tac (i + 1) THEN (if q then I else TRY) (rtac TrueI i))
   117     end
   118       | _ => (pre_thm, assm_tac i)
   119   in rtac (((mp_step nh) o (spec_step np)) th) i THEN tac end);
   120 
   121 val setup =
   122   Method.setup @{binding cooper}
   123     let
   124       val parse_flag = Args.$$$ "no_quantify" >> K (K false)
   125     in
   126       Scan.lift (Scan.optional (Args.$$$ "(" |-- Scan.repeat1 parse_flag --| Args.$$$ ")") [] >>
   127         curry (Library.foldl op |>) true) >>
   128       (fn q => fn ctxt => SIMPLE_METHOD' (linz_tac ctxt q))
   129     end
   130     "decision procedure for linear integer arithmetic";
   131 
   132 end