author | wenzelm |
Tue, 04 Nov 1997 16:17:04 +0100 | |
changeset 4124 | 1af16493c57f |
parent 4080 | 7dce11095b0a |
child 4259 | adbe3f4e7caf |
permissions | -rw-r--r-- |
1243 | 1 |
(* Title: Provers/simplifier.ML |
1 | 2 |
ID: $Id$ |
3557 | 3 |
Author: Tobias Nipkow and Markus Wenzel, TU Muenchen |
1 | 4 |
|
3577
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
5 |
Generic simplifier, suitable for most logics. See also Pure/thm.ML |
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
6 |
for the actual meta level rewriting engine. |
1 | 7 |
*) |
1260 | 8 |
|
3551 | 9 |
infix 4 |
10 |
setsubgoaler setloop addloop setSSolver addSSolver setSolver |
|
11 |
addSolver setmksimps addsimps delsimps addeqcongs deleqcongs |
|
12 |
settermless addsimprocs delsimprocs; |
|
2567 | 13 |
|
0 | 14 |
|
15 |
signature SIMPLIFIER = |
|
16 |
sig |
|
2509 | 17 |
type simproc |
3577
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
18 |
val mk_simproc: string -> cterm list |
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
19 |
-> (Sign.sg -> thm list -> term -> thm option) -> simproc |
2509 | 20 |
val conv_prover: (term * term -> term) -> thm -> (thm -> thm) |
3557 | 21 |
-> tactic -> (int -> tactic) -> Sign.sg -> term -> term -> thm |
0 | 22 |
type simpset |
2503 | 23 |
val empty_ss: simpset |
3551 | 24 |
val rep_ss: simpset -> |
25 |
{mss: meta_simpset, |
|
26 |
subgoal_tac: simpset -> int -> tactic, |
|
27 |
loop_tac: int -> tactic, |
|
28 |
finish_tac: thm list -> int -> tactic, |
|
29 |
unsafe_finish_tac: thm list -> int -> tactic}; |
|
30 |
val print_ss: simpset -> unit |
|
2629 | 31 |
val setsubgoaler: simpset * (simpset -> int -> tactic) -> simpset |
32 |
val setloop: simpset * (int -> tactic) -> simpset |
|
33 |
val addloop: simpset * (int -> tactic) -> simpset |
|
34 |
val setSSolver: simpset * (thm list -> int -> tactic) -> simpset |
|
35 |
val addSSolver: simpset * (thm list -> int -> tactic) -> simpset |
|
36 |
val setSolver: simpset * (thm list -> int -> tactic) -> simpset |
|
37 |
val addSolver: simpset * (thm list -> int -> tactic) -> simpset |
|
3577
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
38 |
val setmksimps: simpset * (thm -> thm list) -> simpset |
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
39 |
val settermless: simpset * (term * term -> bool) -> simpset |
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
40 |
val addsimps: simpset * thm list -> simpset |
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
41 |
val delsimps: simpset * thm list -> simpset |
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
42 |
val addeqcongs: simpset * thm list -> simpset |
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
43 |
val deleqcongs: simpset * thm list -> simpset |
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
44 |
val addsimprocs: simpset * simproc list -> simpset |
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
45 |
val delsimprocs: simpset * simproc list -> simpset |
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
46 |
val merge_ss: simpset * simpset -> simpset |
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
47 |
val prems_of_ss: simpset -> thm list |
4080
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
48 |
|
4124 | 49 |
val simpset_thy_data: string * (object * (object -> object) * |
50 |
(object * object -> object) * (object -> unit)) |
|
4080
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
51 |
val simpset_ref_of_sg: Sign.sg -> simpset ref |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
52 |
val simpset_ref_of: theory -> simpset ref |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
53 |
val simpset_of_sg: Sign.sg -> simpset |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
54 |
val simpset_of: theory -> simpset |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
55 |
val SIMPSET: (simpset -> tactic) -> tactic |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
56 |
val SIMPSET': (simpset -> 'a -> tactic) -> 'a -> tactic |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
57 |
val simpset: unit -> simpset |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
58 |
val simpset_ref: unit -> simpset ref |
1243 | 59 |
val Addsimps: thm list -> unit |
60 |
val Delsimps: thm list -> unit |
|
2509 | 61 |
val Addsimprocs: simproc list -> unit |
62 |
val Delsimprocs: simproc list -> unit |
|
4080
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
63 |
|
2629 | 64 |
val simp_tac: simpset -> int -> tactic |
65 |
val asm_simp_tac: simpset -> int -> tactic |
|
66 |
val full_simp_tac: simpset -> int -> tactic |
|
67 |
val asm_full_simp_tac: simpset -> int -> tactic |
|
68 |
val safe_asm_full_simp_tac: simpset -> int -> tactic |
|
69 |
val Simp_tac: int -> tactic |
|
70 |
val Asm_simp_tac: int -> tactic |
|
71 |
val Full_simp_tac: int -> tactic |
|
72 |
val Asm_full_simp_tac: int -> tactic |
|
3557 | 73 |
val simplify: simpset -> thm -> thm |
74 |
val asm_simplify: simpset -> thm -> thm |
|
75 |
val full_simplify: simpset -> thm -> thm |
|
76 |
val asm_full_simplify: simpset -> thm -> thm |
|
0 | 77 |
end; |
78 |
||
2503 | 79 |
|
80 |
structure Simplifier: SIMPLIFIER = |
|
0 | 81 |
struct |
82 |
||
2509 | 83 |
|
84 |
(** simplification procedures **) |
|
85 |
||
86 |
(* datatype simproc *) |
|
87 |
||
88 |
datatype simproc = |
|
3577
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
89 |
Simproc of string * cterm list * (Sign.sg -> thm list -> term -> thm option) * stamp; |
2509 | 90 |
|
3557 | 91 |
fun mk_simproc name lhss proc = |
92 |
Simproc (name, map (Thm.cterm_fun Logic.varify) lhss, proc, stamp ()); |
|
93 |
||
3551 | 94 |
fun rep_simproc (Simproc args) = args; |
2509 | 95 |
|
96 |
||
4080
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
97 |
(* generic conversion prover *) |
2509 | 98 |
|
99 |
fun conv_prover mk_eqv eqv_refl mk_meta_eq expand_tac norm_tac sg t u = |
|
100 |
let |
|
101 |
val X = Free (gensym "X.", fastype_of t); |
|
102 |
val goal = Logic.mk_implies (mk_eqv (X, t), mk_eqv (X, u)); |
|
103 |
val pre_result = |
|
104 |
prove_goalw_cterm [] (cterm_of sg goal) (*goal: X=t ==> X=u*) |
|
105 |
(fn prems => [ |
|
106 |
expand_tac, (*expand u*) |
|
107 |
ALLGOALS (cut_facts_tac prems), |
|
108 |
ALLGOALS norm_tac]); (*normalize both t and u*) |
|
109 |
in |
|
110 |
mk_meta_eq (eqv_refl RS pre_result) (*final result: t==u*) |
|
111 |
end |
|
112 |
handle ERROR => error ("The error(s) above occurred while trying to prove " ^ |
|
113 |
(string_of_cterm (cterm_of sg (mk_eqv (t, u))))); |
|
114 |
||
115 |
||
116 |
||
2503 | 117 |
(** simplification sets **) |
118 |
||
119 |
(* type simpset *) |
|
120 |
||
0 | 121 |
datatype simpset = |
2503 | 122 |
Simpset of { |
123 |
mss: meta_simpset, |
|
2629 | 124 |
subgoal_tac: simpset -> int -> tactic, |
125 |
loop_tac: int -> tactic, |
|
126 |
finish_tac: thm list -> int -> tactic, |
|
127 |
unsafe_finish_tac: thm list -> int -> tactic}; |
|
2503 | 128 |
|
3551 | 129 |
fun make_ss (mss, subgoal_tac, loop_tac, finish_tac, unsafe_finish_tac) = |
130 |
Simpset {mss = mss, subgoal_tac = subgoal_tac, loop_tac = loop_tac, |
|
2629 | 131 |
finish_tac = finish_tac, unsafe_finish_tac = unsafe_finish_tac}; |
0 | 132 |
|
133 |
val empty_ss = |
|
3551 | 134 |
make_ss (Thm.empty_mss, K (K no_tac), K no_tac, K (K no_tac), K (K no_tac)); |
135 |
||
136 |
fun rep_ss (Simpset args) = args; |
|
137 |
fun prems_of_ss (Simpset {mss, ...}) = Thm.prems_of_mss mss; |
|
138 |
||
139 |
||
140 |
(* print simpsets *) |
|
2503 | 141 |
|
3551 | 142 |
fun print_ss ss = |
143 |
let |
|
144 |
val Simpset {mss, ...} = ss; |
|
145 |
val {simps, procs, congs} = Thm.dest_mss mss; |
|
2503 | 146 |
|
3551 | 147 |
val pretty_thms = map Display.pretty_thm; |
148 |
fun pretty_proc (name, lhss) = |
|
149 |
Pretty.big_list (name ^ ":") (map Display.pretty_cterm lhss); |
|
150 |
in |
|
151 |
Pretty.writeln (Pretty.big_list "simplification rules:" (pretty_thms simps)); |
|
152 |
Pretty.writeln (Pretty.big_list "simplification procedures:" (map pretty_proc procs)); |
|
153 |
Pretty.writeln (Pretty.big_list "congruences:" (pretty_thms congs)) |
|
154 |
end; |
|
2503 | 155 |
|
156 |
||
157 |
(* extend simpsets *) |
|
158 |
||
3551 | 159 |
fun (Simpset {mss, subgoal_tac = _, loop_tac, finish_tac, unsafe_finish_tac}) |
160 |
setsubgoaler subgoal_tac = |
|
161 |
make_ss (mss, subgoal_tac, loop_tac, finish_tac, unsafe_finish_tac); |
|
2629 | 162 |
|
3551 | 163 |
fun (Simpset {mss, subgoal_tac, loop_tac = _, finish_tac, unsafe_finish_tac}) |
164 |
setloop loop_tac = |
|
165 |
make_ss (mss, subgoal_tac, DETERM o loop_tac, finish_tac, unsafe_finish_tac); |
|
2503 | 166 |
|
3551 | 167 |
fun (Simpset {mss, subgoal_tac, loop_tac, finish_tac, unsafe_finish_tac}) |
168 |
addloop tac = |
|
169 |
make_ss (mss, subgoal_tac, loop_tac ORELSE' (DETERM o tac), finish_tac, unsafe_finish_tac); |
|
2567 | 170 |
|
3551 | 171 |
fun (Simpset {mss, subgoal_tac, loop_tac, finish_tac = _, unsafe_finish_tac}) |
172 |
setSSolver finish_tac = |
|
173 |
make_ss (mss, subgoal_tac, loop_tac, finish_tac, unsafe_finish_tac); |
|
2503 | 174 |
|
3551 | 175 |
fun (Simpset {mss, subgoal_tac, loop_tac, finish_tac, unsafe_finish_tac}) |
176 |
addSSolver tac = |
|
177 |
make_ss (mss, subgoal_tac, loop_tac, fn hyps => finish_tac hyps ORELSE' tac hyps, |
|
178 |
unsafe_finish_tac); |
|
2503 | 179 |
|
3551 | 180 |
fun (Simpset {mss, subgoal_tac, loop_tac, finish_tac, unsafe_finish_tac = _}) |
181 |
setSolver unsafe_finish_tac = |
|
182 |
make_ss (mss, subgoal_tac, loop_tac, finish_tac, unsafe_finish_tac); |
|
2503 | 183 |
|
3551 | 184 |
fun (Simpset {mss, subgoal_tac, loop_tac, finish_tac, unsafe_finish_tac}) |
185 |
addSolver tac = |
|
186 |
make_ss (mss, subgoal_tac, loop_tac, finish_tac, |
|
187 |
fn hyps => unsafe_finish_tac hyps ORELSE' tac hyps); |
|
2503 | 188 |
|
3551 | 189 |
fun (Simpset {mss, subgoal_tac, loop_tac, finish_tac, unsafe_finish_tac}) |
190 |
setmksimps mk_simps = |
|
2645
9d3a3e62bf34
mk_rews: automatically includes strip_shyps, zero_var_indexes;
wenzelm
parents:
2629
diff
changeset
|
191 |
make_ss (Thm.set_mk_rews (mss, map (Thm.strip_shyps o Drule.zero_var_indexes) o mk_simps), |
2629 | 192 |
subgoal_tac, loop_tac, finish_tac, unsafe_finish_tac); |
2509 | 193 |
|
3551 | 194 |
fun (Simpset {mss, subgoal_tac, loop_tac, finish_tac, unsafe_finish_tac}) |
195 |
settermless termless = |
|
196 |
make_ss (Thm.set_termless (mss, termless), subgoal_tac, loop_tac, |
|
197 |
finish_tac, unsafe_finish_tac); |
|
198 |
||
199 |
fun (Simpset {mss, subgoal_tac, loop_tac, finish_tac, unsafe_finish_tac}) |
|
200 |
addsimps rews = |
|
2503 | 201 |
let val rews' = flat (map (Thm.mk_rews_of_mss mss) rews) in |
3551 | 202 |
make_ss (Thm.add_simps (mss, rews'), subgoal_tac, loop_tac, |
203 |
finish_tac, unsafe_finish_tac) |
|
2503 | 204 |
end; |
205 |
||
3551 | 206 |
fun (Simpset {mss, subgoal_tac, loop_tac, finish_tac, unsafe_finish_tac}) |
207 |
delsimps rews = |
|
2503 | 208 |
let val rews' = flat (map (Thm.mk_rews_of_mss mss) rews) in |
3551 | 209 |
make_ss (Thm.del_simps (mss, rews'), subgoal_tac, loop_tac, |
210 |
finish_tac, unsafe_finish_tac) |
|
2503 | 211 |
end; |
212 |
||
3551 | 213 |
fun (Simpset {mss, subgoal_tac, loop_tac, finish_tac, unsafe_finish_tac}) |
214 |
addeqcongs newcongs = |
|
215 |
make_ss (Thm.add_congs (mss, newcongs), subgoal_tac, loop_tac, |
|
216 |
finish_tac, unsafe_finish_tac); |
|
2509 | 217 |
|
3551 | 218 |
fun (Simpset {mss, subgoal_tac, loop_tac, finish_tac, unsafe_finish_tac}) |
219 |
deleqcongs oldcongs = |
|
220 |
make_ss (Thm.del_congs (mss, oldcongs), subgoal_tac, loop_tac, |
|
221 |
finish_tac, unsafe_finish_tac); |
|
2629 | 222 |
|
3551 | 223 |
fun (Simpset {mss, subgoal_tac, loop_tac, finish_tac, unsafe_finish_tac}) |
224 |
addsimprocs simprocs = |
|
225 |
make_ss |
|
226 |
(Thm.add_simprocs (mss, map rep_simproc simprocs), |
|
227 |
subgoal_tac, loop_tac, finish_tac, unsafe_finish_tac); |
|
2509 | 228 |
|
3551 | 229 |
fun (Simpset {mss, subgoal_tac, loop_tac, finish_tac, unsafe_finish_tac}) |
230 |
delsimprocs simprocs = |
|
231 |
make_ss |
|
232 |
(Thm.del_simprocs (mss, map rep_simproc simprocs), |
|
233 |
subgoal_tac, loop_tac, finish_tac, unsafe_finish_tac); |
|
2503 | 234 |
|
235 |
||
3551 | 236 |
(* merge simpsets *) (*NOTE: ignores tactics of 2nd simpset*) |
2503 | 237 |
|
3551 | 238 |
fun merge_ss |
239 |
(Simpset {mss = mss1, subgoal_tac, loop_tac, finish_tac, unsafe_finish_tac}, |
|
240 |
Simpset {mss = mss2, ...}) = |
|
241 |
make_ss (Thm.merge_mss (mss1, mss2), |
|
242 |
subgoal_tac, loop_tac, finish_tac, unsafe_finish_tac); |
|
2503 | 243 |
|
244 |
||
3557 | 245 |
|
4080
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
246 |
(** simpset theory data **) |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
247 |
|
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
248 |
(* data kind simpset *) |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
249 |
|
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
250 |
val simpsetK = "simpset"; |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
251 |
exception SimpsetData of simpset ref; |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
252 |
|
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
253 |
local |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
254 |
val empty = SimpsetData (ref empty_ss); |
0 | 255 |
|
4080
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
256 |
(*create new reference*) |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
257 |
fun prep_ext (SimpsetData (ref ss)) = SimpsetData (ref ss); |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
258 |
|
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
259 |
fun merge (SimpsetData (ref ss1), SimpsetData (ref ss2)) = |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
260 |
SimpsetData (ref (merge_ss (ss1, ss2))); |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
261 |
|
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
262 |
fun print (SimpsetData (ref ss)) = print_ss ss; |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
263 |
in |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
264 |
val simpset_thy_data = (simpsetK, (empty, prep_ext, merge, print)); |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
265 |
end; |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
266 |
|
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
267 |
|
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
268 |
(* access simpset *) |
0 | 269 |
|
4080
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
270 |
fun simpset_ref_of_sg sg = |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
271 |
(case Sign.get_data sg simpsetK of |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
272 |
SimpsetData r => r |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
273 |
| _ => sys_error "simpset_ref_of_sg") |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
274 |
|
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
275 |
val simpset_ref_of = simpset_ref_of_sg o sign_of; |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
276 |
val simpset_of_sg = ! o simpset_ref_of_sg; |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
277 |
val simpset_of = simpset_of_sg o sign_of; |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
278 |
|
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
279 |
fun SIMPSET tacf state = tacf (simpset_of_sg (sign_of_thm state)) state; |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
280 |
fun SIMPSET' tacf i state = tacf (simpset_of_sg (sign_of_thm state)) i state; |
0 | 281 |
|
4080
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
282 |
val simpset = simpset_of o Context.get_context; |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
283 |
val simpset_ref = simpset_ref_of_sg o sign_of o Context.get_context; |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
284 |
|
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
285 |
|
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
286 |
(* change simpset *) |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
287 |
|
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
288 |
fun change_simpset f x = simpset_ref () := (f (simpset (), x)); |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
289 |
|
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
290 |
val Addsimps = change_simpset (op addsimps); |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
291 |
val Delsimps = change_simpset (op delsimps); |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
292 |
val Addsimprocs = change_simpset (op addsimprocs); |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
293 |
val Delsimprocs = change_simpset (op delsimprocs); |
2509 | 294 |
|
0 | 295 |
|
3557 | 296 |
|
2503 | 297 |
(** simplification tactics **) |
0 | 298 |
|
3551 | 299 |
fun NEWSUBGOALS tac tacf st0 = |
300 |
st0 |> (tac THEN (fn st1 => tacf (nprems_of st1 - nprems_of st0) st1)); |
|
1 | 301 |
|
3557 | 302 |
fun solve_all_tac (subgoal_tac, loop_tac, finish_tac, unsafe_finish_tac) mss = |
303 |
let |
|
304 |
val ss = |
|
305 |
make_ss (mss, subgoal_tac, loop_tac, unsafe_finish_tac, unsafe_finish_tac); |
|
306 |
val solve1_tac = |
|
307 |
NEWSUBGOALS (subgoal_tac ss 1) (fn n => if n < 0 then all_tac else no_tac); |
|
308 |
in DEPTH_SOLVE solve1_tac end; |
|
309 |
||
310 |
||
2629 | 311 |
(*not totally safe: may instantiate unknowns that appear also in other subgoals*) |
312 |
fun basic_gen_simp_tac mode = |
|
3551 | 313 |
fn (Simpset {mss, subgoal_tac, loop_tac, finish_tac, unsafe_finish_tac}) => |
314 |
let |
|
1512 | 315 |
fun simp_loop_tac i thm = |
3557 | 316 |
(asm_rewrite_goal_tac mode |
317 |
(solve_all_tac (subgoal_tac, loop_tac, finish_tac, unsafe_finish_tac)) mss i |
|
318 |
THEN (finish_tac (prems_of_mss mss) i ORELSE looper i)) thm |
|
3551 | 319 |
and allsimp i n = EVERY (map (fn j => simp_loop_tac (i + j)) (n downto 0)) |
320 |
and looper i = TRY (NEWSUBGOALS (loop_tac i) (allsimp i)); |
|
217
c972c57e7762
got rid of METAHYPS due to the change of the basic simplification routines
nipkow
parents:
146
diff
changeset
|
321 |
in simp_loop_tac end; |
0 | 322 |
|
3551 | 323 |
fun gen_simp_tac mode (ss as Simpset {unsafe_finish_tac, ...}) = |
324 |
basic_gen_simp_tac mode (ss setSSolver unsafe_finish_tac); |
|
325 |
||
2629 | 326 |
|
2503 | 327 |
val simp_tac = gen_simp_tac (false, false); |
328 |
val asm_simp_tac = gen_simp_tac (false, true); |
|
329 |
val full_simp_tac = gen_simp_tac (true, false); |
|
330 |
val asm_full_simp_tac = gen_simp_tac (true, true); |
|
0 | 331 |
|
2629 | 332 |
(*not totally safe: may instantiate unknowns that appear also in other subgoals*) |
333 |
val safe_asm_full_simp_tac = basic_gen_simp_tac (true, true); |
|
334 |
||
3728 | 335 |
(** The abstraction over the proof state delays the dereferencing **) |
336 |
||
4080
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
337 |
fun Simp_tac i st = simp_tac (simpset ()) i st; |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
338 |
fun Asm_simp_tac i st = asm_simp_tac (simpset ()) i st; |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
339 |
fun Full_simp_tac i st = full_simp_tac (simpset ()) i st; |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
340 |
fun Asm_full_simp_tac i st = asm_full_simp_tac (simpset ()) i st; |
406 | 341 |
|
3557 | 342 |
|
343 |
||
344 |
(** simplification meta rules **) |
|
345 |
||
346 |
fun simp mode (Simpset {mss, subgoal_tac, loop_tac, finish_tac, unsafe_finish_tac}) thm = |
|
347 |
let |
|
348 |
val tacf = solve_all_tac (subgoal_tac, loop_tac, finish_tac, unsafe_finish_tac); |
|
349 |
fun prover m th = apsome fst (Sequence.pull (tacf m th)); |
|
350 |
in |
|
351 |
Drule.rewrite_thm mode prover mss thm |
|
352 |
end; |
|
353 |
||
354 |
val simplify = simp (false, false); |
|
355 |
val asm_simplify = simp (false, true); |
|
356 |
val full_simplify = simp (true, false); |
|
357 |
val asm_full_simplify = simp (true, true); |
|
358 |
||
359 |
||
1243 | 360 |
end; |