author | wenzelm |
Mon, 01 Aug 2005 19:20:43 +0200 | |
changeset 16989 | 1877b00fb4d2 |
parent 16806 | 916387f7afd2 |
child 17004 | 6a0d8ecf65f1 |
permissions | -rw-r--r-- |
16014 | 1 |
(* Title: Pure/simplifier.ML |
2 |
ID: $Id$ |
|
3 |
Author: Tobias Nipkow and Markus Wenzel, TU Muenchen |
|
4 |
||
5 |
Generic simplifier, suitable for most logics (see also |
|
6 |
meta_simplifier.ML for the actual meta-level rewriting engine). |
|
7 |
*) |
|
8 |
||
9 |
signature BASIC_SIMPLIFIER = |
|
10 |
sig |
|
11 |
include BASIC_META_SIMPLIFIER |
|
12 |
type context_solver |
|
13 |
val mk_context_solver: string -> (Proof.context -> thm list -> int -> tactic) |
|
14 |
-> context_solver |
|
15 |
type context_simproc |
|
16 |
val mk_context_simproc: string -> cterm list -> |
|
17 |
(Proof.context -> simpset -> term -> thm option) -> context_simproc |
|
18 |
val print_simpset: theory -> unit |
|
16458 | 19 |
val simpset_ref_of_sg: theory -> simpset ref (*obsolete*) |
16014 | 20 |
val simpset_ref_of: theory -> simpset ref |
16458 | 21 |
val simpset_of_sg: theory -> simpset (*obsolete*) |
16014 | 22 |
val simpset_of: theory -> simpset |
23 |
val SIMPSET: (simpset -> tactic) -> tactic |
|
24 |
val SIMPSET': (simpset -> 'a -> tactic) -> 'a -> tactic |
|
25 |
val simpset: unit -> simpset |
|
26 |
val simpset_ref: unit -> simpset ref |
|
27 |
val Addsimps: thm list -> unit |
|
28 |
val Delsimps: thm list -> unit |
|
29 |
val Addsimprocs: simproc list -> unit |
|
30 |
val Delsimprocs: simproc list -> unit |
|
31 |
val Addcongs: thm list -> unit |
|
32 |
val Delcongs: thm list -> unit |
|
33 |
val local_simpset_of: Proof.context -> simpset |
|
34 |
val safe_asm_full_simp_tac: simpset -> int -> tactic |
|
35 |
val simp_tac: simpset -> int -> tactic |
|
36 |
val asm_simp_tac: simpset -> int -> tactic |
|
37 |
val full_simp_tac: simpset -> int -> tactic |
|
38 |
val asm_lr_simp_tac: simpset -> int -> tactic |
|
39 |
val asm_full_simp_tac: simpset -> int -> tactic |
|
40 |
val Simp_tac: int -> tactic |
|
41 |
val Asm_simp_tac: int -> tactic |
|
42 |
val Full_simp_tac: int -> tactic |
|
43 |
val Asm_lr_simp_tac: int -> tactic |
|
44 |
val Asm_full_simp_tac: int -> tactic |
|
45 |
val simplify: simpset -> thm -> thm |
|
46 |
val asm_simplify: simpset -> thm -> thm |
|
47 |
val full_simplify: simpset -> thm -> thm |
|
48 |
val asm_lr_simplify: simpset -> thm -> thm |
|
49 |
val asm_full_simplify: simpset -> thm -> thm |
|
50 |
end; |
|
51 |
||
52 |
signature SIMPLIFIER = |
|
53 |
sig |
|
54 |
include BASIC_SIMPLIFIER |
|
16458 | 55 |
val simproc_i: theory -> string -> term list |
56 |
-> (theory -> simpset -> term -> thm option) -> simproc |
|
57 |
val simproc: theory -> string -> string list |
|
58 |
-> (theory -> simpset -> term -> thm option) -> simproc |
|
59 |
val context_simproc_i: theory -> string -> term list |
|
16014 | 60 |
-> (Proof.context -> simpset -> term -> thm option) -> context_simproc |
16458 | 61 |
val context_simproc: theory -> string -> string list |
16014 | 62 |
-> (Proof.context -> simpset -> term -> thm option) -> context_simproc |
16989 | 63 |
val inherit_bounds: simpset -> simpset -> simpset |
16014 | 64 |
val rewrite: simpset -> cterm -> thm |
65 |
val asm_rewrite: simpset -> cterm -> thm |
|
66 |
val full_rewrite: simpset -> cterm -> thm |
|
67 |
val asm_lr_rewrite: simpset -> cterm -> thm |
|
68 |
val asm_full_rewrite: simpset -> cterm -> thm |
|
69 |
val add_context_simprocs: context_simproc list -> theory -> theory |
|
70 |
val del_context_simprocs: context_simproc list -> theory -> theory |
|
71 |
val set_context_subgoaler: (Proof.context -> simpset -> int -> tactic) -> theory -> theory |
|
72 |
val reset_context_subgoaler: theory -> theory |
|
73 |
val add_context_looper: string * (Proof.context -> int -> Tactical.tactic) -> |
|
74 |
theory -> theory |
|
75 |
val del_context_looper: string -> theory -> theory |
|
76 |
val add_context_unsafe_solver: context_solver -> theory -> theory |
|
77 |
val add_context_safe_solver: context_solver -> theory -> theory |
|
78 |
val print_local_simpset: Proof.context -> unit |
|
79 |
val get_local_simpset: Proof.context -> simpset |
|
80 |
val put_local_simpset: simpset -> Proof.context -> Proof.context |
|
81 |
val change_global_ss: (simpset * thm list -> simpset) -> theory attribute |
|
82 |
val change_local_ss: (simpset * thm list -> simpset) -> Proof.context attribute |
|
83 |
val simp_add_global: theory attribute |
|
84 |
val simp_del_global: theory attribute |
|
85 |
val simp_add_local: Proof.context attribute |
|
86 |
val simp_del_local: Proof.context attribute |
|
87 |
val cong_add_global: theory attribute |
|
88 |
val cong_del_global: theory attribute |
|
89 |
val cong_add_local: Proof.context attribute |
|
90 |
val cong_del_local: Proof.context attribute |
|
91 |
val change_simpset_of: (simpset * 'a -> simpset) -> 'a -> theory -> theory |
|
92 |
val simp_modifiers: (Args.T list -> (Method.modifier * Args.T list)) list |
|
93 |
val method_setup: (Args.T list -> (Method.modifier * Args.T list)) list |
|
94 |
-> (theory -> theory) list |
|
95 |
val easy_setup: thm -> thm list -> (theory -> theory) list |
|
96 |
end; |
|
97 |
||
98 |
structure Simplifier: SIMPLIFIER = |
|
99 |
struct |
|
100 |
||
101 |
open MetaSimplifier; |
|
102 |
||
103 |
||
104 |
(** context dependent simpset components **) |
|
105 |
||
106 |
(* datatype context_solver *) |
|
107 |
||
108 |
datatype context_solver = |
|
109 |
ContextSolver of (string * (Proof.context -> thm list -> int -> tactic)) * stamp; |
|
110 |
||
111 |
fun mk_context_solver name f = ContextSolver ((name, f), stamp ()); |
|
112 |
fun eq_context_solver (ContextSolver (_, id1), ContextSolver (_, id2)) = (id1 = id2); |
|
113 |
val merge_context_solvers = gen_merge_lists eq_context_solver; |
|
114 |
||
115 |
||
116 |
(* datatype context_simproc *) |
|
117 |
||
118 |
datatype context_simproc = ContextSimproc of |
|
119 |
(string * cterm list * (Proof.context -> simpset -> term -> thm option)) * stamp; |
|
120 |
||
121 |
fun mk_context_simproc name lhss f = ContextSimproc ((name, lhss, f), stamp ()); |
|
122 |
fun eq_context_simproc (ContextSimproc (_, id1), ContextSimproc (_, id2)) = (id1 = id2); |
|
123 |
val merge_context_simprocs = gen_merge_lists eq_context_simproc; |
|
124 |
||
16458 | 125 |
fun context_simproc_i thy name = |
126 |
mk_context_simproc name o map (Thm.cterm_of thy o Logic.varify); |
|
16014 | 127 |
|
16458 | 128 |
fun context_simproc thy name = |
16806 | 129 |
context_simproc_i thy name o map (Sign.read_term thy); |
16014 | 130 |
|
131 |
||
132 |
(* datatype context_ss *) |
|
133 |
||
134 |
datatype context_ss = ContextSS of |
|
135 |
{simprocs: context_simproc list, |
|
136 |
subgoal_tac: (Proof.context -> simpset -> int -> tactic) option, |
|
137 |
loop_tacs: (string * (Proof.context -> int -> tactic)) list, |
|
138 |
unsafe_solvers: context_solver list, |
|
139 |
solvers: context_solver list}; |
|
140 |
||
141 |
fun context_ss ctxt ss ctxt_ss = |
|
142 |
let |
|
143 |
val ContextSS {simprocs, subgoal_tac, loop_tacs, unsafe_solvers, solvers} = ctxt_ss; |
|
144 |
fun prep_simproc (ContextSimproc ((name, lhss, f), _)) = |
|
145 |
mk_simproc name lhss (K (f ctxt)); |
|
146 |
fun add_loop (name, f) simpset = simpset addloop (name, f ctxt); |
|
147 |
fun add_solver add (ContextSolver ((name, f), _)) simpset = |
|
148 |
add (simpset, mk_solver name (f ctxt)); |
|
149 |
in |
|
150 |
((case subgoal_tac of NONE => ss | SOME tac => ss setsubgoaler tac ctxt) |
|
151 |
addsimprocs map prep_simproc simprocs) |
|
152 |
|> fold_rev add_loop loop_tacs |
|
153 |
|> fold_rev (add_solver (op addSolver)) unsafe_solvers |
|
154 |
|> fold_rev (add_solver (op addSSolver)) solvers |
|
155 |
end; |
|
156 |
||
157 |
fun make_context_ss (simprocs, subgoal_tac, loop_tacs, unsafe_solvers, solvers) = |
|
158 |
ContextSS {simprocs = simprocs, subgoal_tac = subgoal_tac, loop_tacs = loop_tacs, |
|
159 |
unsafe_solvers = unsafe_solvers, solvers = solvers}; |
|
160 |
||
161 |
val empty_context_ss = make_context_ss ([], NONE, [], [], []); |
|
162 |
||
163 |
fun merge_context_ss (ctxt_ss1, ctxt_ss2) = |
|
164 |
let |
|
165 |
val ContextSS {simprocs = simprocs1, subgoal_tac = subgoal_tac1, loop_tacs = loop_tacs1, |
|
166 |
unsafe_solvers = unsafe_solvers1, solvers = solvers1} = ctxt_ss1; |
|
167 |
val ContextSS {simprocs = simprocs2, subgoal_tac = subgoal_tac2, loop_tacs = loop_tacs2, |
|
168 |
unsafe_solvers = unsafe_solvers2, solvers = solvers2} = ctxt_ss2; |
|
169 |
||
170 |
val simprocs' = merge_context_simprocs simprocs1 simprocs2; |
|
171 |
val subgoal_tac' = (case subgoal_tac1 of NONE => subgoal_tac2 | some => some); |
|
172 |
val loop_tacs' = merge_alists loop_tacs1 loop_tacs2; |
|
173 |
val unsafe_solvers' = merge_context_solvers unsafe_solvers1 unsafe_solvers2; |
|
174 |
val solvers' = merge_context_solvers solvers1 solvers2; |
|
175 |
in make_context_ss (simprocs', subgoal_tac', loop_tacs', unsafe_solvers', solvers') end; |
|
176 |
||
177 |
||
178 |
||
179 |
(** global and local simpset data **) |
|
180 |
||
181 |
(* theory data kind 'Pure/simpset' *) |
|
182 |
||
16458 | 183 |
structure GlobalSimpset = TheoryDataFun |
184 |
(struct |
|
16014 | 185 |
val name = "Pure/simpset"; |
186 |
type T = simpset ref * context_ss; |
|
187 |
||
188 |
val empty = (ref empty_ss, empty_context_ss); |
|
189 |
fun copy (ref ss, ctxt_ss) = (ref ss, ctxt_ss): T; (*create new reference!*) |
|
16458 | 190 |
val extend = copy; |
191 |
fun merge _ ((ref ss1, ctxt_ss1), (ref ss2, ctxt_ss2)) = |
|
16014 | 192 |
(ref (merge_ss (ss1, ss2)), merge_context_ss (ctxt_ss1, ctxt_ss2)); |
193 |
fun print _ (ref ss, _) = print_ss ss; |
|
16458 | 194 |
end); |
16014 | 195 |
|
196 |
val _ = Context.add_setup [GlobalSimpset.init]; |
|
197 |
val print_simpset = GlobalSimpset.print; |
|
198 |
||
199 |
val simpset_ref_of = #1 o GlobalSimpset.get; |
|
16458 | 200 |
val simpset_ref_of_sg = simpset_ref_of; |
16014 | 201 |
val get_context_ss = #2 o GlobalSimpset.get o ProofContext.theory_of; |
202 |
||
203 |
fun map_context_ss f = GlobalSimpset.map (apsnd |
|
204 |
(fn ContextSS {simprocs, subgoal_tac, loop_tacs, unsafe_solvers, solvers} => |
|
205 |
make_context_ss (f (simprocs, subgoal_tac, loop_tacs, unsafe_solvers, solvers)))); |
|
206 |
||
207 |
||
208 |
(* access global simpset *) |
|
209 |
||
16458 | 210 |
val simpset_of = ! o simpset_ref_of; |
211 |
val simpset_of_sg = simpset_of; |
|
16014 | 212 |
|
16458 | 213 |
fun SIMPSET tacf state = tacf (simpset_of (Thm.theory_of_thm state)) state; |
214 |
fun SIMPSET' tacf i state = tacf (simpset_of (Thm.theory_of_thm state)) i state; |
|
16014 | 215 |
|
216 |
val simpset = simpset_of o Context.the_context; |
|
16458 | 217 |
val simpset_ref = simpset_ref_of o Context.the_context; |
16014 | 218 |
|
219 |
||
220 |
(* change global simpset *) |
|
221 |
||
222 |
fun change_simpset_of f x thy = |
|
223 |
let val r = simpset_ref_of thy |
|
224 |
in r := f (! r, x); thy end; |
|
225 |
||
226 |
fun change_simpset f x = (change_simpset_of f x (Context.the_context ()); ()); |
|
227 |
||
228 |
val Addsimps = change_simpset (op addsimps); |
|
229 |
val Delsimps = change_simpset (op delsimps); |
|
230 |
val Addsimprocs = change_simpset (op addsimprocs); |
|
231 |
val Delsimprocs = change_simpset (op delsimprocs); |
|
232 |
val Addcongs = change_simpset (op addcongs); |
|
233 |
val Delcongs = change_simpset (op delcongs); |
|
234 |
||
235 |
||
236 |
(* change context dependent components *) |
|
237 |
||
238 |
fun add_context_simprocs procs = |
|
239 |
map_context_ss (fn (simprocs, subgoal_tac, loop_tacs, unsafe_solvers, solvers) => |
|
240 |
(merge_context_simprocs procs simprocs, subgoal_tac, loop_tacs, |
|
241 |
unsafe_solvers, solvers)); |
|
242 |
||
243 |
fun del_context_simprocs procs = |
|
244 |
map_context_ss (fn (simprocs, subgoal_tac, loop_tacs, unsafe_solvers, solvers) => |
|
245 |
(gen_rems eq_context_simproc (simprocs, procs), subgoal_tac, loop_tacs, |
|
246 |
unsafe_solvers, solvers)); |
|
247 |
||
248 |
fun set_context_subgoaler tac = |
|
249 |
map_context_ss (fn (simprocs, _, loop_tacs, unsafe_solvers, solvers) => |
|
250 |
(simprocs, SOME tac, loop_tacs, unsafe_solvers, solvers)); |
|
251 |
||
252 |
val reset_context_subgoaler = |
|
253 |
map_context_ss (fn (simprocs, _, loop_tacs, unsafe_solvers, solvers) => |
|
254 |
(simprocs, NONE, loop_tacs, unsafe_solvers, solvers)); |
|
255 |
||
256 |
fun add_context_looper (name, tac) = |
|
257 |
map_context_ss (fn (simprocs, subgoal_tac, loop_tacs, unsafe_solvers, solvers) => |
|
258 |
(simprocs, subgoal_tac, merge_alists [(name, tac)] loop_tacs, |
|
259 |
unsafe_solvers, solvers)); |
|
260 |
||
261 |
fun del_context_looper name = |
|
262 |
map_context_ss (fn (simprocs, subgoal_tac, loop_tacs, unsafe_solvers, solvers) => |
|
263 |
(simprocs, subgoal_tac, filter_out (equal name o #1) loop_tacs, |
|
264 |
unsafe_solvers, solvers)); |
|
265 |
||
266 |
fun add_context_unsafe_solver solver = |
|
267 |
map_context_ss (fn (simprocs, subgoal_tac, loop_tacs, unsafe_solvers, solvers) => |
|
268 |
(simprocs, subgoal_tac, loop_tacs, |
|
269 |
merge_context_solvers [solver] unsafe_solvers, solvers)); |
|
270 |
||
271 |
fun add_context_safe_solver solver = |
|
272 |
map_context_ss (fn (simprocs, subgoal_tac, loop_tacs, unsafe_solvers, solvers) => |
|
273 |
(simprocs, subgoal_tac, loop_tacs, unsafe_solvers, |
|
274 |
merge_context_solvers [solver] solvers)); |
|
275 |
||
276 |
||
277 |
(* proof data kind 'Pure/simpset' *) |
|
278 |
||
16458 | 279 |
structure LocalSimpset = ProofDataFun |
280 |
(struct |
|
16014 | 281 |
val name = "Pure/simpset"; |
282 |
type T = simpset; |
|
283 |
val init = simpset_of; |
|
284 |
fun print ctxt ss = print_ss (context_ss ctxt ss (get_context_ss ctxt)); |
|
16458 | 285 |
end); |
16014 | 286 |
|
287 |
val _ = Context.add_setup [LocalSimpset.init]; |
|
288 |
val print_local_simpset = LocalSimpset.print; |
|
289 |
||
290 |
val get_local_simpset = LocalSimpset.get; |
|
291 |
val put_local_simpset = LocalSimpset.put; |
|
292 |
fun map_local_simpset f ctxt = put_local_simpset (f (get_local_simpset ctxt)) ctxt; |
|
293 |
||
294 |
fun local_simpset_of ctxt = |
|
295 |
context_ss ctxt (get_local_simpset ctxt) (get_context_ss ctxt); |
|
296 |
||
297 |
||
298 |
(* attributes *) |
|
299 |
||
300 |
fun change_global_ss f (thy, th) = |
|
301 |
let val r = simpset_ref_of thy |
|
302 |
in r := f (! r, [th]); (thy, th) end; |
|
303 |
||
304 |
fun change_local_ss f (ctxt, th) = |
|
305 |
let val ss = f (get_local_simpset ctxt, [th]) |
|
306 |
in (put_local_simpset ss ctxt, th) end; |
|
307 |
||
308 |
val simp_add_global = change_global_ss (op addsimps); |
|
309 |
val simp_del_global = change_global_ss (op delsimps); |
|
16806 | 310 |
val simp_add_local = change_local_ss (op addsimps); |
16014 | 311 |
val simp_del_local = change_local_ss (op delsimps); |
312 |
||
313 |
val cong_add_global = change_global_ss (op addcongs); |
|
314 |
val cong_del_global = change_global_ss (op delcongs); |
|
315 |
val cong_add_local = change_local_ss (op addcongs); |
|
316 |
val cong_del_local = change_local_ss (op delcongs); |
|
317 |
||
318 |
||
16806 | 319 |
(* tactics *) |
320 |
||
16014 | 321 |
val simp_tac = generic_simp_tac false (false, false, false); |
322 |
val asm_simp_tac = generic_simp_tac false (false, true, false); |
|
323 |
val full_simp_tac = generic_simp_tac false (true, false, false); |
|
324 |
val asm_lr_simp_tac = generic_simp_tac false (true, true, false); |
|
325 |
val asm_full_simp_tac = generic_simp_tac false (true, true, true); |
|
326 |
val safe_asm_full_simp_tac = generic_simp_tac true (true, true, true); |
|
327 |
||
328 |
(*the abstraction over the proof state delays the dereferencing*) |
|
329 |
fun Simp_tac i st = simp_tac (simpset ()) i st; |
|
330 |
fun Asm_simp_tac i st = asm_simp_tac (simpset ()) i st; |
|
331 |
fun Full_simp_tac i st = full_simp_tac (simpset ()) i st; |
|
332 |
fun Asm_lr_simp_tac i st = asm_lr_simp_tac (simpset ()) i st; |
|
333 |
fun Asm_full_simp_tac i st = asm_full_simp_tac (simpset ()) i st; |
|
334 |
||
16806 | 335 |
|
336 |
(* conversions *) |
|
337 |
||
16014 | 338 |
val simplify = simp_thm (false, false, false); |
339 |
val asm_simplify = simp_thm (false, true, false); |
|
340 |
val full_simplify = simp_thm (true, false, false); |
|
341 |
val asm_lr_simplify = simp_thm (true, true, false); |
|
342 |
val asm_full_simplify = simp_thm (true, true, true); |
|
343 |
||
344 |
val rewrite = simp_cterm (false, false, false); |
|
345 |
val asm_rewrite = simp_cterm (false, true, false); |
|
346 |
val full_rewrite = simp_cterm (true, false, false); |
|
347 |
val asm_lr_rewrite = simp_cterm (true, true, false); |
|
348 |
val asm_full_rewrite = simp_cterm (true, true, true); |
|
349 |
||
350 |
||
351 |
||
352 |
(** concrete syntax of attributes **) |
|
353 |
||
354 |
(* add / del *) |
|
355 |
||
356 |
val simpN = "simp"; |
|
357 |
val congN = "cong"; |
|
358 |
val addN = "add"; |
|
359 |
val delN = "del"; |
|
360 |
val onlyN = "only"; |
|
361 |
val no_asmN = "no_asm"; |
|
362 |
val no_asm_useN = "no_asm_use"; |
|
363 |
val no_asm_simpN = "no_asm_simp"; |
|
364 |
val asm_lrN = "asm_lr"; |
|
365 |
||
366 |
val simp_attr = |
|
367 |
(Attrib.add_del_args simp_add_global simp_del_global, |
|
368 |
Attrib.add_del_args simp_add_local simp_del_local); |
|
369 |
||
370 |
val cong_attr = |
|
371 |
(Attrib.add_del_args cong_add_global cong_del_global, |
|
372 |
Attrib.add_del_args cong_add_local cong_del_local); |
|
373 |
||
374 |
||
375 |
(* conversions *) |
|
376 |
||
377 |
local |
|
378 |
||
379 |
fun conv_mode x = |
|
380 |
((Args.parens (Args.$$$ no_asmN) >> K simplify || |
|
381 |
Args.parens (Args.$$$ no_asm_simpN) >> K asm_simplify || |
|
382 |
Args.parens (Args.$$$ no_asm_useN) >> K full_simplify || |
|
383 |
Scan.succeed asm_full_simplify) |> Scan.lift) x; |
|
384 |
||
385 |
fun simplified_att get args = |
|
386 |
Attrib.syntax (conv_mode -- args >> (fn (f, ths) => |
|
387 |
Drule.rule_attribute (fn x => f ((if null ths then I else clear_ss) (get x) addsimps ths)))); |
|
388 |
||
389 |
in |
|
390 |
||
391 |
val simplified_attr = |
|
392 |
(simplified_att simpset_of Attrib.global_thmss, |
|
393 |
simplified_att local_simpset_of Attrib.local_thmss); |
|
394 |
||
395 |
end; |
|
396 |
||
397 |
||
398 |
(* setup attributes *) |
|
399 |
||
400 |
val _ = Context.add_setup |
|
401 |
[Attrib.add_attributes |
|
402 |
[(simpN, simp_attr, "declaration of simplification rule"), |
|
403 |
(congN, cong_attr, "declaration of Simplifier congruence rule"), |
|
404 |
("simplified", simplified_attr, "simplified rule")]]; |
|
405 |
||
406 |
||
407 |
||
408 |
(** proof methods **) |
|
409 |
||
410 |
(* simplification *) |
|
411 |
||
412 |
val simp_options = |
|
413 |
(Args.parens (Args.$$$ no_asmN) >> K simp_tac || |
|
414 |
Args.parens (Args.$$$ no_asm_simpN) >> K asm_simp_tac || |
|
415 |
Args.parens (Args.$$$ no_asm_useN) >> K full_simp_tac || |
|
416 |
Args.parens (Args.$$$ asm_lrN) >> K asm_lr_simp_tac || |
|
417 |
Scan.succeed asm_full_simp_tac); |
|
418 |
||
16685 | 419 |
fun simp_flags x = (Scan.repeat |
16684
7b58002668c0
methods: added simp_flags argument, added "depth_limit" flag;
wenzelm
parents:
16458
diff
changeset
|
420 |
(Args.parens (Args.$$$ "depth_limit" -- Args.colon |-- Args.nat) |
7b58002668c0
methods: added simp_flags argument, added "depth_limit" flag;
wenzelm
parents:
16458
diff
changeset
|
421 |
>> setmp MetaSimplifier.simp_depth_limit) |
16709 | 422 |
>> (curry (Library.foldl op o) I o rev)) x; |
16684
7b58002668c0
methods: added simp_flags argument, added "depth_limit" flag;
wenzelm
parents:
16458
diff
changeset
|
423 |
|
16014 | 424 |
val cong_modifiers = |
425 |
[Args.$$$ congN -- Args.colon >> K ((I, cong_add_local):Method.modifier), |
|
426 |
Args.$$$ congN -- Args.add -- Args.colon >> K (I, cong_add_local), |
|
427 |
Args.$$$ congN -- Args.del -- Args.colon >> K (I, cong_del_local)]; |
|
428 |
||
429 |
val simp_modifiers = |
|
430 |
[Args.$$$ simpN -- Args.colon >> K (I, simp_add_local), |
|
431 |
Args.$$$ simpN -- Args.add -- Args.colon >> K (I, simp_add_local), |
|
432 |
Args.$$$ simpN -- Args.del -- Args.colon >> K (I, simp_del_local), |
|
433 |
Args.$$$ simpN -- Args.$$$ onlyN -- Args.colon >> K (map_local_simpset clear_ss, simp_add_local)] |
|
434 |
@ cong_modifiers; |
|
435 |
||
436 |
val simp_modifiers' = |
|
437 |
[Args.add -- Args.colon >> K (I, simp_add_local), |
|
438 |
Args.del -- Args.colon >> K (I, simp_del_local), |
|
439 |
Args.$$$ onlyN -- Args.colon >> K (map_local_simpset clear_ss, simp_add_local)] |
|
440 |
@ cong_modifiers; |
|
441 |
||
442 |
fun simp_args more_mods = |
|
16684
7b58002668c0
methods: added simp_flags argument, added "depth_limit" flag;
wenzelm
parents:
16458
diff
changeset
|
443 |
Method.sectioned_args (Args.bang_facts -- Scan.lift simp_options -- Scan.lift simp_flags) |
7b58002668c0
methods: added simp_flags argument, added "depth_limit" flag;
wenzelm
parents:
16458
diff
changeset
|
444 |
(more_mods @ simp_modifiers'); |
16014 | 445 |
|
16684
7b58002668c0
methods: added simp_flags argument, added "depth_limit" flag;
wenzelm
parents:
16458
diff
changeset
|
446 |
fun simp_method ((prems, tac), FLAGS) ctxt = Method.METHOD (fn facts => |
16014 | 447 |
ALLGOALS (Method.insert_tac (prems @ facts)) THEN |
16684
7b58002668c0
methods: added simp_flags argument, added "depth_limit" flag;
wenzelm
parents:
16458
diff
changeset
|
448 |
(FLAGS o CHANGED_PROP o ALLGOALS o tac) (local_simpset_of ctxt)); |
16014 | 449 |
|
16684
7b58002668c0
methods: added simp_flags argument, added "depth_limit" flag;
wenzelm
parents:
16458
diff
changeset
|
450 |
fun simp_method' ((prems, tac), FLAGS) ctxt = Method.METHOD (fn facts => |
16014 | 451 |
HEADGOAL (Method.insert_tac (prems @ facts) THEN' |
16684
7b58002668c0
methods: added simp_flags argument, added "depth_limit" flag;
wenzelm
parents:
16458
diff
changeset
|
452 |
((FLAGS o CHANGED_PROP) oo tac) (local_simpset_of ctxt))); |
16014 | 453 |
|
454 |
||
455 |
(* setup methods *) |
|
456 |
||
457 |
fun setup_methods more_mods = Method.add_methods |
|
458 |
[(simpN, simp_args more_mods simp_method', "simplification"), |
|
459 |
("simp_all", simp_args more_mods simp_method, "simplification (all goals)")]; |
|
460 |
||
461 |
fun method_setup mods = [setup_methods mods]; |
|
462 |
||
463 |
||
464 |
(** easy_setup **) |
|
465 |
||
466 |
fun easy_setup reflect trivs = |
|
467 |
let |
|
468 |
val trivialities = Drule.reflexive_thm :: trivs; |
|
469 |
||
470 |
fun unsafe_solver_tac prems = FIRST' [resolve_tac (trivialities @ prems), assume_tac]; |
|
471 |
val unsafe_solver = mk_solver "easy unsafe" unsafe_solver_tac; |
|
472 |
||
473 |
(*no premature instantiation of variables during simplification*) |
|
474 |
fun safe_solver_tac prems = FIRST' [match_tac (trivialities @ prems), eq_assume_tac]; |
|
475 |
val safe_solver = mk_solver "easy safe" safe_solver_tac; |
|
476 |
||
477 |
fun mk_eq thm = |
|
478 |
if Logic.is_equals (Thm.concl_of thm) then [thm] |
|
479 |
else [thm RS reflect] handle THM _ => []; |
|
480 |
||
481 |
fun mksimps thm = mk_eq (Drule.forall_elim_vars (#maxidx (Thm.rep_thm thm) + 1) thm); |
|
482 |
||
483 |
fun init_ss thy = |
|
484 |
(simpset_ref_of thy := |
|
485 |
empty_ss setsubgoaler asm_simp_tac |
|
486 |
setSSolver safe_solver |
|
487 |
setSolver unsafe_solver |
|
488 |
setmksimps mksimps; thy); |
|
489 |
in method_setup [] @ [init_ss] end; |
|
490 |
||
491 |
end; |
|
492 |
||
493 |
structure BasicSimplifier: BASIC_SIMPLIFIER = Simplifier; |
|
494 |
open BasicSimplifier; |