author  haftmann 
Thu, 08 Jul 2010 16:19:24 +0200  
changeset 37744  3daaf23b9ab4 
parent 36603  d5d6111761a6 
child 38558  32ad17fe2b9c 
permissions  rwrr 
37744  1 
(* Title: HOL/Tools/simpdata.ML 
21163  2 
Author: Tobias Nipkow 
3 
Copyright 1991 University of Cambridge 

4 

5 
Instantiation of the generic simplifier for HOL. 

6 
*) 

7 

8 
(** tools setup **) 

9 

10 
structure Quantifier1 = Quantifier1Fun 

11 
(struct 

12 
(*abstract syntax*) 

35364  13 
fun dest_eq ((c as Const(@{const_name "op ="},_)) $ s $ t) = SOME (c, s, t) 
21163  14 
 dest_eq _ = NONE; 
35364  15 
fun dest_conj ((c as Const(@{const_name "op &"},_)) $ s $ t) = SOME (c, s, t) 
21163  16 
 dest_conj _ = NONE; 
35364  17 
fun dest_imp ((c as Const(@{const_name "op >"},_)) $ s $ t) = SOME (c, s, t) 
21163  18 
 dest_imp _ = NONE; 
19 
val conj = HOLogic.conj 

20 
val imp = HOLogic.imp 

21 
(*rules*) 

22147  22 
val iff_reflection = @{thm eq_reflection} 
23 
val iffI = @{thm iffI} 

24 
val iff_trans = @{thm trans} 

25 
val conjI= @{thm conjI} 

26 
val conjE= @{thm conjE} 

27 
val impI = @{thm impI} 

28 
val mp = @{thm mp} 

29 
val uncurry = @{thm uncurry} 

30 
val exI = @{thm exI} 

31 
val exE = @{thm exE} 

32 
val iff_allI = @{thm iff_allI} 

33 
val iff_exI = @{thm iff_exI} 

34 
val all_comm = @{thm all_comm} 

35 
val ex_comm = @{thm ex_comm} 

21163  36 
end); 
37 

21551  38 
structure Simpdata = 
21163  39 
struct 
40 

22147  41 
fun mk_meta_eq r = r RS @{thm eq_reflection}; 
21163  42 
fun safe_mk_meta_eq r = mk_meta_eq r handle Thm.THM _ => r; 
43 

22147  44 
fun mk_eq th = case concl_of th 
21163  45 
(*expects Trueprop if not == *) 
35364  46 
of Const (@{const_name "=="},_) $ _ $ _ => th 
47 
 _ $ (Const (@{const_name "op ="}, _) $ _ $ _) => mk_meta_eq th 

48 
 _ $ (Const (@{const_name "Not"}, _) $ _) => th RS @{thm Eq_FalseI} 

22147  49 
 _ => th RS @{thm Eq_TrueI} 
21163  50 

36543
0e7fc5bf38de
proper context for mksimps etc.  via simpset of the running Simplifier;
wenzelm
parents:
35364
diff
changeset

51 
fun mk_eq_True (_: simpset) r = 
22147  52 
SOME (r RS @{thm meta_eq_to_obj_eq} RS @{thm Eq_TrueI}) handle Thm.THM _ => NONE; 
21163  53 

54 
(* Produce theorems of the form 

55 
(P1 =simp=> ... =simp=> Pn => x == y) ==> (P1 =simp=> ... =simp=> Pn => x = y) 

56 
*) 

22838  57 

22147  58 
fun lift_meta_eq_to_obj_eq i st = 
21163  59 
let 
35364  60 
fun count_imp (Const (@{const_name HOL.simp_implies}, _) $ P $ Q) = 1 + count_imp Q 
21163  61 
 count_imp _ = 0; 
62 
val j = count_imp (Logic.strip_assums_concl (List.nth (prems_of st, i  1))) 

22147  63 
in if j = 0 then @{thm meta_eq_to_obj_eq} 
21163  64 
else 
65 
let 

66 
val Ps = map (fn k => Free ("P" ^ string_of_int k, propT)) (1 upto j); 

33339  67 
fun mk_simp_implies Q = fold_rev (fn R => fn S => 
35364  68 
Const (@{const_name HOL.simp_implies}, propT > propT > propT) $ R $ S) Ps Q 
21163  69 
val aT = TFree ("'a", HOLogic.typeS); 
70 
val x = Free ("x", aT); 

71 
val y = Free ("y", aT) 

72 
in Goal.prove_global (Thm.theory_of_thm st) [] 

73 
[mk_simp_implies (Logic.mk_equals (x, y))] 

74 
(mk_simp_implies (HOLogic.mk_Trueprop (HOLogic.mk_eq (x, y)))) 

26711  75 
(fn {prems, ...} => EVERY 
22147  76 
[rewrite_goals_tac @{thms simp_implies_def}, 
77 
REPEAT (ares_tac (@{thm meta_eq_to_obj_eq} :: 

78 
map (rewrite_rule @{thms simp_implies_def}) prems) 1)]) 

21163  79 
end 
80 
end; 

81 

82 
(*Congruence rules for = (instead of ==)*) 

36543
0e7fc5bf38de
proper context for mksimps etc.  via simpset of the running Simplifier;
wenzelm
parents:
35364
diff
changeset

83 
fun mk_meta_cong (_: simpset) rl = zero_var_indexes 
21163  84 
(let val rl' = Seq.hd (TRYALL (fn i => fn st => 
85 
rtac (lift_meta_eq_to_obj_eq i st) i st) rl) 

86 
in mk_meta_eq rl' handle THM _ => 

87 
if can Logic.dest_equals (concl_of rl') then rl' 

88 
else error "Conclusion of congruence rules must be =equality" 

89 
end); 

90 

91 
fun mk_atomize pairs = 

92 
let 

21313
26fc3a45547c
mk_atomize: careful matching against rules admits overloading;
wenzelm
parents:
21163
diff
changeset

93 
fun atoms thm = 
26fc3a45547c
mk_atomize: careful matching against rules admits overloading;
wenzelm
parents:
21163
diff
changeset

94 
let 
26fc3a45547c
mk_atomize: careful matching against rules admits overloading;
wenzelm
parents:
21163
diff
changeset

95 
fun res th = map (fn rl => th RS rl); (*exception THM*) 
26fc3a45547c
mk_atomize: careful matching against rules admits overloading;
wenzelm
parents:
21163
diff
changeset

96 
fun res_fixed rls = 
26fc3a45547c
mk_atomize: careful matching against rules admits overloading;
wenzelm
parents:
21163
diff
changeset

97 
if Thm.maxidx_of (Thm.adjust_maxidx_thm ~1 thm) = ~1 then res thm rls 
36603
d5d6111761a6
renamed Variable.thm_context to Variable.global_thm_context to emphasize that this is not the real thing;
wenzelm
parents:
36543
diff
changeset

98 
else Variable.trade (K (fn [thm'] => res thm' rls)) (Variable.global_thm_context thm) [thm]; 
21313
26fc3a45547c
mk_atomize: careful matching against rules admits overloading;
wenzelm
parents:
21163
diff
changeset

99 
in 
26fc3a45547c
mk_atomize: careful matching against rules admits overloading;
wenzelm
parents:
21163
diff
changeset

100 
case concl_of thm 
35364  101 
of Const (@{const_name Trueprop}, _) $ p => (case head_of p 
21313
26fc3a45547c
mk_atomize: careful matching against rules admits overloading;
wenzelm
parents:
21163
diff
changeset

102 
of Const (a, _) => (case AList.lookup (op =) pairs a 
26fc3a45547c
mk_atomize: careful matching against rules admits overloading;
wenzelm
parents:
21163
diff
changeset

103 
of SOME rls => (maps atoms (res_fixed rls) handle THM _ => [thm]) 
26fc3a45547c
mk_atomize: careful matching against rules admits overloading;
wenzelm
parents:
21163
diff
changeset

104 
 NONE => [thm]) 
26fc3a45547c
mk_atomize: careful matching against rules admits overloading;
wenzelm
parents:
21163
diff
changeset

105 
 _ => [thm]) 
26fc3a45547c
mk_atomize: careful matching against rules admits overloading;
wenzelm
parents:
21163
diff
changeset

106 
 _ => [thm] 
26fc3a45547c
mk_atomize: careful matching against rules admits overloading;
wenzelm
parents:
21163
diff
changeset

107 
end; 
21163  108 
in atoms end; 
109 

36543
0e7fc5bf38de
proper context for mksimps etc.  via simpset of the running Simplifier;
wenzelm
parents:
35364
diff
changeset

110 
fun mksimps pairs (_: simpset) = 
21313
26fc3a45547c
mk_atomize: careful matching against rules admits overloading;
wenzelm
parents:
21163
diff
changeset

111 
map_filter (try mk_eq) o mk_atomize pairs o gen_all; 
21163  112 

22147  113 
fun unsafe_solver_tac prems = 
114 
(fn i => REPEAT_DETERM (match_tac @{thms simp_impliesI} i)) THEN' 

115 
FIRST' [resolve_tac (reflexive_thm :: @{thm TrueI} :: @{thm refl} :: prems), atac, 

116 
etac @{thm FalseE}]; 

117 

21163  118 
val unsafe_solver = mk_solver "HOL unsafe" unsafe_solver_tac; 
119 

22838  120 

21163  121 
(*No premature instantiation of variables during simplification*) 
22147  122 
fun safe_solver_tac prems = 
123 
(fn i => REPEAT_DETERM (match_tac @{thms simp_impliesI} i)) THEN' 

124 
FIRST' [match_tac (reflexive_thm :: @{thm TrueI} :: @{thm refl} :: prems), 

125 
eq_assume_tac, ematch_tac @{thms FalseE}]; 

126 

21163  127 
val safe_solver = mk_solver "HOL safe" safe_solver_tac; 
128 

32177
bc02c5bfcb5b
renamed functor SplitterFun to Splitter, require explicit theory;
wenzelm
parents:
32155
diff
changeset

129 
structure Splitter = Splitter 
bc02c5bfcb5b
renamed functor SplitterFun to Splitter, require explicit theory;
wenzelm
parents:
32155
diff
changeset

130 
( 
bc02c5bfcb5b
renamed functor SplitterFun to Splitter, require explicit theory;
wenzelm
parents:
32155
diff
changeset

131 
val thy = @{theory} 
bc02c5bfcb5b
renamed functor SplitterFun to Splitter, require explicit theory;
wenzelm
parents:
32155
diff
changeset

132 
val mk_eq = mk_eq 
bc02c5bfcb5b
renamed functor SplitterFun to Splitter, require explicit theory;
wenzelm
parents:
32155
diff
changeset

133 
val meta_eq_to_iff = @{thm meta_eq_to_obj_eq} 
bc02c5bfcb5b
renamed functor SplitterFun to Splitter, require explicit theory;
wenzelm
parents:
32155
diff
changeset

134 
val iffD = @{thm iffD2} 
bc02c5bfcb5b
renamed functor SplitterFun to Splitter, require explicit theory;
wenzelm
parents:
32155
diff
changeset

135 
val disjE = @{thm disjE} 
bc02c5bfcb5b
renamed functor SplitterFun to Splitter, require explicit theory;
wenzelm
parents:
32155
diff
changeset

136 
val conjE = @{thm conjE} 
bc02c5bfcb5b
renamed functor SplitterFun to Splitter, require explicit theory;
wenzelm
parents:
32155
diff
changeset

137 
val exE = @{thm exE} 
bc02c5bfcb5b
renamed functor SplitterFun to Splitter, require explicit theory;
wenzelm
parents:
32155
diff
changeset

138 
val contrapos = @{thm contrapos_nn} 
bc02c5bfcb5b
renamed functor SplitterFun to Splitter, require explicit theory;
wenzelm
parents:
32155
diff
changeset

139 
val contrapos2 = @{thm contrapos_pp} 
bc02c5bfcb5b
renamed functor SplitterFun to Splitter, require explicit theory;
wenzelm
parents:
32155
diff
changeset

140 
val notnotD = @{thm notnotD} 
bc02c5bfcb5b
renamed functor SplitterFun to Splitter, require explicit theory;
wenzelm
parents:
32155
diff
changeset

141 
); 
21163  142 

32177
bc02c5bfcb5b
renamed functor SplitterFun to Splitter, require explicit theory;
wenzelm
parents:
32155
diff
changeset

143 
val split_tac = Splitter.split_tac; 
21674  144 
val split_inside_tac = Splitter.split_inside_tac; 
145 

32177
bc02c5bfcb5b
renamed functor SplitterFun to Splitter, require explicit theory;
wenzelm
parents:
32155
diff
changeset

146 
val op addsplits = Splitter.addsplits; 
bc02c5bfcb5b
renamed functor SplitterFun to Splitter, require explicit theory;
wenzelm
parents:
32155
diff
changeset

147 
val op delsplits = Splitter.delsplits; 
21674  148 

149 

21163  150 
(* integration of simplifier with classical reasoner *) 
151 

152 
structure Clasimp = ClasimpFun 

153 
(structure Simplifier = Simplifier and Splitter = Splitter 

154 
and Classical = Classical and Blast = Blast 

22147  155 
val iffD1 = @{thm iffD1} val iffD2 = @{thm iffD2} val notE = @{thm notE}); 
21674  156 
open Clasimp; 
21163  157 

27338  158 
val _ = ML_Antiquote.value "clasimpset" 
32149
ef59550a55d3
renamed simpset_of to global_simpset_of, and local_simpset_of to simpset_of  same for claset and clasimpset;
wenzelm
parents:
32010
diff
changeset

159 
(Scan.succeed "Clasimp.clasimpset_of (ML_Context.the_local_context ())"); 
22128  160 

21163  161 
val mksimps_pairs = 
35364  162 
[(@{const_name "op >"}, [@{thm mp}]), 
163 
(@{const_name "op &"}, [@{thm conjunct1}, @{thm conjunct2}]), 

164 
(@{const_name All}, [@{thm spec}]), 

165 
(@{const_name True}, []), 

166 
(@{const_name False}, []), 

167 
(@{const_name If}, [@{thm if_bool_eq_conj} RS @{thm iffD1}])]; 

21163  168 

21674  169 
val HOL_basic_ss = 
35232
f588e1169c8b
renamed Simplifier.theory_context to Simplifier.global_context to emphasize that this is not the real thing;
wenzelm
parents:
33339
diff
changeset

170 
Simplifier.global_context @{theory} empty_ss 
21163  171 
setsubgoaler asm_simp_tac 
172 
setSSolver safe_solver 

173 
setSolver unsafe_solver 

174 
setmksimps (mksimps mksimps_pairs) 

175 
setmkeqTrue mk_eq_True 

176 
setmkcong mk_meta_cong; 

177 

21674  178 
fun hol_simplify rews = Simplifier.full_simplify (HOL_basic_ss addsimps rews); 
21163  179 

180 
fun unfold_tac ths = 

21674  181 
let val ss0 = Simplifier.clear_ss HOL_basic_ss addsimps ths 
21163  182 
in fn ss => ALLGOALS (full_simp_tac (Simplifier.inherit_context ss ss0)) end; 
183 

184 
val defALL_regroup = 

32010  185 
Simplifier.simproc @{theory} 
21163  186 
"defined ALL" ["ALL x. P x"] Quantifier1.rearrange_all; 
187 

188 
val defEX_regroup = 

32010  189 
Simplifier.simproc @{theory} 
21163  190 
"defined EX" ["EX x. P x"] Quantifier1.rearrange_ex; 
191 

192 

24035  193 
val simpset_simprocs = HOL_basic_ss addsimprocs [defALL_regroup, defEX_regroup] 
21163  194 

21313
26fc3a45547c
mk_atomize: careful matching against rules admits overloading;
wenzelm
parents:
21163
diff
changeset

195 
end; 
21551  196 

197 
structure Splitter = Simpdata.Splitter; 

198 
structure Clasimp = Simpdata.Clasimp; 