1 (* Title: Provers/simplifier.ML |
|
2 ID: $Id$ |
|
3 Author: Tobias Nipkow and Markus Wenzel, TU Muenchen |
|
4 |
|
5 Generic simplifier, suitable for most logics. See Pure/meta_simplifier.ML |
|
6 for the actual meta-level rewriting engine. |
|
7 *) |
|
8 |
|
9 (* added: put_delta_simpset, get_delta_simpset |
|
10 changed: simp_add_local |
|
11 07/01/05 |
|
12 *) |
|
13 |
|
14 |
|
15 signature BASIC_SIMPLIFIER = |
|
16 sig |
|
17 include BASIC_META_SIMPLIFIER |
|
18 type context_solver |
|
19 val mk_context_solver: string -> (Proof.context -> thm list -> int -> tactic) |
|
20 -> context_solver |
|
21 type context_simproc |
|
22 val mk_context_simproc: string -> cterm list -> |
|
23 (Proof.context -> simpset -> term -> thm option) -> context_simproc |
|
24 val print_simpset: theory -> unit |
|
25 val simpset_ref_of_sg: Sign.sg -> simpset ref |
|
26 val simpset_ref_of: theory -> simpset ref |
|
27 val simpset_of_sg: Sign.sg -> simpset |
|
28 val simpset_of: theory -> simpset |
|
29 val SIMPSET: (simpset -> tactic) -> tactic |
|
30 val SIMPSET': (simpset -> 'a -> tactic) -> 'a -> tactic |
|
31 val simpset: unit -> simpset |
|
32 val simpset_ref: unit -> simpset ref |
|
33 val Addsimps: thm list -> unit |
|
34 val Delsimps: thm list -> unit |
|
35 val Addsimprocs: simproc list -> unit |
|
36 val Delsimprocs: simproc list -> unit |
|
37 val Addcongs: thm list -> unit |
|
38 val Delcongs: thm list -> unit |
|
39 val local_simpset_of: Proof.context -> simpset |
|
40 val safe_asm_full_simp_tac: simpset -> int -> tactic |
|
41 val simp_tac: simpset -> int -> tactic |
|
42 val asm_simp_tac: simpset -> int -> tactic |
|
43 val full_simp_tac: simpset -> int -> tactic |
|
44 val asm_lr_simp_tac: simpset -> int -> tactic |
|
45 val asm_full_simp_tac: simpset -> int -> tactic |
|
46 val Simp_tac: int -> tactic |
|
47 val Asm_simp_tac: int -> tactic |
|
48 val Full_simp_tac: int -> tactic |
|
49 val Asm_lr_simp_tac: int -> tactic |
|
50 val Asm_full_simp_tac: int -> tactic |
|
51 val simplify: simpset -> thm -> thm |
|
52 val asm_simplify: simpset -> thm -> thm |
|
53 val full_simplify: simpset -> thm -> thm |
|
54 val asm_lr_simplify: simpset -> thm -> thm |
|
55 val asm_full_simplify: simpset -> thm -> thm |
|
56 end; |
|
57 |
|
58 signature SIMPLIFIER = |
|
59 sig |
|
60 include BASIC_SIMPLIFIER |
|
61 val simproc_i: Sign.sg -> string -> term list |
|
62 -> (Sign.sg -> simpset -> term -> thm option) -> simproc |
|
63 val simproc: Sign.sg -> string -> string list |
|
64 -> (Sign.sg -> simpset -> term -> thm option) -> simproc |
|
65 val context_simproc_i: Sign.sg -> string -> term list |
|
66 -> (Proof.context -> simpset -> term -> thm option) -> context_simproc |
|
67 val context_simproc: Sign.sg -> string -> string list |
|
68 -> (Proof.context -> simpset -> term -> thm option) -> context_simproc |
|
69 val rewrite: simpset -> cterm -> thm |
|
70 val asm_rewrite: simpset -> cterm -> thm |
|
71 val full_rewrite: simpset -> cterm -> thm |
|
72 val asm_lr_rewrite: simpset -> cterm -> thm |
|
73 val asm_full_rewrite: simpset -> cterm -> thm |
|
74 val add_context_simprocs: context_simproc list -> theory -> theory |
|
75 val del_context_simprocs: context_simproc list -> theory -> theory |
|
76 val set_context_subgoaler: (Proof.context -> simpset -> int -> tactic) -> theory -> theory |
|
77 val reset_context_subgoaler: theory -> theory |
|
78 val add_context_looper: string * (Proof.context -> int -> Tactical.tactic) -> |
|
79 theory -> theory |
|
80 val del_context_looper: string -> theory -> theory |
|
81 val add_context_unsafe_solver: context_solver -> theory -> theory |
|
82 val add_context_safe_solver: context_solver -> theory -> theory |
|
83 val print_local_simpset: Proof.context -> unit |
|
84 val get_local_simpset: Proof.context -> simpset |
|
85 val put_local_simpset: simpset -> Proof.context -> Proof.context |
|
86 val change_global_ss: (simpset * thm list -> simpset) -> theory attribute |
|
87 val change_local_ss: (simpset * thm list -> simpset) -> Proof.context attribute |
|
88 val simp_add_global: theory attribute |
|
89 val simp_del_global: theory attribute |
|
90 val simp_add_local: Proof.context attribute |
|
91 val simp_del_local: Proof.context attribute |
|
92 val cong_add_global: theory attribute |
|
93 val cong_del_global: theory attribute |
|
94 val cong_add_local: Proof.context attribute |
|
95 val cong_del_local: Proof.context attribute |
|
96 val change_simpset_of: (simpset * 'a -> simpset) -> 'a -> theory -> theory |
|
97 val simp_modifiers: (Args.T list -> (Method.modifier * Args.T list)) list |
|
98 val setup: (theory -> theory) list |
|
99 val method_setup: (Args.T list -> (Method.modifier * Args.T list)) list |
|
100 -> (theory -> theory) list |
|
101 val easy_setup: thm -> thm list -> (theory -> theory) list |
|
102 |
|
103 val get_delta_simpset: ProofContext.context -> Thm.thm list |
|
104 val put_delta_simpset: Thm.thm list -> ProofContext.context -> ProofContext.context |
|
105 |
|
106 val find_rewrites: string -> Toplevel.transition -> Toplevel.transition |
|
107 end; |
|
108 |
|
109 structure Simplifier: SIMPLIFIER = |
|
110 struct |
|
111 |
|
112 open MetaSimplifier; |
|
113 |
|
114 |
|
115 (** context dependent simpset components **) |
|
116 |
|
117 (* datatype context_solver *) |
|
118 |
|
119 datatype context_solver = |
|
120 ContextSolver of (string * (Proof.context -> thm list -> int -> tactic)) * stamp; |
|
121 |
|
122 fun mk_context_solver name f = ContextSolver ((name, f), stamp ()); |
|
123 fun eq_context_solver (ContextSolver (_, id1), ContextSolver (_, id2)) = (id1 = id2); |
|
124 val merge_context_solvers = gen_merge_lists eq_context_solver; |
|
125 |
|
126 |
|
127 (* datatype context_simproc *) |
|
128 |
|
129 datatype context_simproc = ContextSimproc of |
|
130 (string * cterm list * (Proof.context -> simpset -> term -> thm option)) * stamp; |
|
131 |
|
132 fun mk_context_simproc name lhss f = ContextSimproc ((name, lhss, f), stamp ()); |
|
133 fun eq_context_simproc (ContextSimproc (_, id1), ContextSimproc (_, id2)) = (id1 = id2); |
|
134 val merge_context_simprocs = gen_merge_lists eq_context_simproc; |
|
135 |
|
136 fun context_simproc_i sg name = |
|
137 mk_context_simproc name o map (Thm.cterm_of sg o Logic.varify); |
|
138 |
|
139 fun context_simproc sg name = |
|
140 context_simproc_i sg name o map (Sign.simple_read_term sg TypeInfer.logicT); |
|
141 |
|
142 |
|
143 (* datatype context_ss *) |
|
144 |
|
145 datatype context_ss = ContextSS of |
|
146 {simprocs: context_simproc list, |
|
147 subgoal_tac: (Proof.context -> simpset -> int -> tactic) option, |
|
148 loop_tacs: (string * (Proof.context -> int -> tactic)) list, |
|
149 unsafe_solvers: context_solver list, |
|
150 solvers: context_solver list}; |
|
151 |
|
152 fun context_ss ctxt ss ctxt_ss = |
|
153 let |
|
154 val ContextSS {simprocs, subgoal_tac, loop_tacs, unsafe_solvers, solvers} = ctxt_ss; |
|
155 fun prep_simproc (ContextSimproc ((name, lhss, f), _)) = |
|
156 mk_simproc name lhss (K (f ctxt)); |
|
157 fun add_loop (name, f) simpset = simpset addloop (name, f ctxt); |
|
158 fun add_solver add (ContextSolver ((name, f), _)) simpset = |
|
159 add (simpset, mk_solver name (f ctxt)); |
|
160 in |
|
161 ((case subgoal_tac of NONE => ss | SOME tac => ss setsubgoaler tac ctxt) |
|
162 addsimprocs map prep_simproc simprocs) |
|
163 |> fold_rev add_loop loop_tacs |
|
164 |> fold_rev (add_solver (op addSolver)) unsafe_solvers |
|
165 |> fold_rev (add_solver (op addSSolver)) solvers |
|
166 end; |
|
167 |
|
168 fun make_context_ss (simprocs, subgoal_tac, loop_tacs, unsafe_solvers, solvers) = |
|
169 ContextSS {simprocs = simprocs, subgoal_tac = subgoal_tac, loop_tacs = loop_tacs, |
|
170 unsafe_solvers = unsafe_solvers, solvers = solvers}; |
|
171 |
|
172 val empty_context_ss = make_context_ss ([], NONE, [], [], []); |
|
173 |
|
174 fun merge_context_ss (ctxt_ss1, ctxt_ss2) = |
|
175 let |
|
176 val ContextSS {simprocs = simprocs1, subgoal_tac = subgoal_tac1, loop_tacs = loop_tacs1, |
|
177 unsafe_solvers = unsafe_solvers1, solvers = solvers1} = ctxt_ss1; |
|
178 val ContextSS {simprocs = simprocs2, subgoal_tac = subgoal_tac2, loop_tacs = loop_tacs2, |
|
179 unsafe_solvers = unsafe_solvers2, solvers = solvers2} = ctxt_ss2; |
|
180 |
|
181 val simprocs' = merge_context_simprocs simprocs1 simprocs2; |
|
182 val subgoal_tac' = (case subgoal_tac1 of NONE => subgoal_tac2 | some => some); |
|
183 val loop_tacs' = merge_alists loop_tacs1 loop_tacs2; |
|
184 val unsafe_solvers' = merge_context_solvers unsafe_solvers1 unsafe_solvers2; |
|
185 val solvers' = merge_context_solvers solvers1 solvers2; |
|
186 in make_context_ss (simprocs', subgoal_tac', loop_tacs', unsafe_solvers', solvers') end; |
|
187 |
|
188 |
|
189 |
|
190 (** global and local simpset data **) |
|
191 |
|
192 (* theory data kind 'Provers/simpset' *) |
|
193 |
|
194 structure GlobalSimpsetArgs = |
|
195 struct |
|
196 val name = "Provers/simpset"; |
|
197 type T = simpset ref * context_ss; |
|
198 |
|
199 val empty = (ref empty_ss, empty_context_ss); |
|
200 fun copy (ref ss, ctxt_ss) = (ref ss, ctxt_ss): T; (*create new reference!*) |
|
201 val prep_ext = copy; |
|
202 fun merge ((ref ss1, ctxt_ss1), (ref ss2, ctxt_ss2)) = |
|
203 (ref (merge_ss (ss1, ss2)), merge_context_ss (ctxt_ss1, ctxt_ss2)); |
|
204 fun print _ (ref ss, _) = print_ss ss; |
|
205 end; |
|
206 |
|
207 structure GlobalSimpset = TheoryDataFun(GlobalSimpsetArgs); |
|
208 val print_simpset = GlobalSimpset.print; |
|
209 val simpset_ref_of_sg = #1 o GlobalSimpset.get_sg; |
|
210 val simpset_ref_of = #1 o GlobalSimpset.get; |
|
211 val get_context_ss = #2 o GlobalSimpset.get o ProofContext.theory_of; |
|
212 |
|
213 fun map_context_ss f = GlobalSimpset.map (apsnd |
|
214 (fn ContextSS {simprocs, subgoal_tac, loop_tacs, unsafe_solvers, solvers} => |
|
215 make_context_ss (f (simprocs, subgoal_tac, loop_tacs, unsafe_solvers, solvers)))); |
|
216 |
|
217 |
|
218 (* access global simpset *) |
|
219 |
|
220 val simpset_of_sg = ! o simpset_ref_of_sg; |
|
221 val simpset_of = simpset_of_sg o Theory.sign_of; |
|
222 |
|
223 fun SIMPSET tacf state = tacf (simpset_of_sg (Thm.sign_of_thm state)) state; |
|
224 fun SIMPSET' tacf i state = tacf (simpset_of_sg (Thm.sign_of_thm state)) i state; |
|
225 |
|
226 val simpset = simpset_of o Context.the_context; |
|
227 val simpset_ref = simpset_ref_of_sg o Theory.sign_of o Context.the_context; |
|
228 |
|
229 |
|
230 (* find rewrites *) |
|
231 |
|
232 fun find_rewrites s = Toplevel.keep (fn state => |
|
233 let |
|
234 val pstate = Toplevel.enter_forward_proof state |
|
235 val ctxt = Proof.context_of pstate; |
|
236 val prt_fact = ProofContext.pretty_fact ctxt |
|
237 val thy = ProofContext.theory_of ctxt |
|
238 val t = ProofContext.read_term ctxt s; |
|
239 val (_, {mk_rews = {mk,...}, ...}) = rep_ss (simpset_of thy) |
|
240 val lhs = fst o Logic.dest_equals o Logic.strip_imp_concl |
|
241 val rews = map (apsnd single) (PureThy.find_matching_thms (mk,lhs) thy t) |
|
242 in map prt_fact (rev rews) |> Pretty.chunks |> Pretty.writeln end); |
|
243 |
|
244 |
|
245 (* change global simpset *) |
|
246 |
|
247 fun change_simpset_of f x thy = |
|
248 let val r = simpset_ref_of thy |
|
249 in r := f (! r, x); thy end; |
|
250 |
|
251 fun change_simpset f x = (change_simpset_of f x (Context.the_context ()); ()); |
|
252 |
|
253 val Addsimps = change_simpset (op addsimps); |
|
254 val Delsimps = change_simpset (op delsimps); |
|
255 val Addsimprocs = change_simpset (op addsimprocs); |
|
256 val Delsimprocs = change_simpset (op delsimprocs); |
|
257 val Addcongs = change_simpset (op addcongs); |
|
258 val Delcongs = change_simpset (op delcongs); |
|
259 |
|
260 |
|
261 (* change context dependent components *) |
|
262 |
|
263 fun add_context_simprocs procs = |
|
264 map_context_ss (fn (simprocs, subgoal_tac, loop_tacs, unsafe_solvers, solvers) => |
|
265 (merge_context_simprocs procs simprocs, subgoal_tac, loop_tacs, |
|
266 unsafe_solvers, solvers)); |
|
267 |
|
268 fun del_context_simprocs procs = |
|
269 map_context_ss (fn (simprocs, subgoal_tac, loop_tacs, unsafe_solvers, solvers) => |
|
270 (gen_rems eq_context_simproc (simprocs, procs), subgoal_tac, loop_tacs, |
|
271 unsafe_solvers, solvers)); |
|
272 |
|
273 fun set_context_subgoaler tac = |
|
274 map_context_ss (fn (simprocs, _, loop_tacs, unsafe_solvers, solvers) => |
|
275 (simprocs, SOME tac, loop_tacs, unsafe_solvers, solvers)); |
|
276 |
|
277 val reset_context_subgoaler = |
|
278 map_context_ss (fn (simprocs, _, loop_tacs, unsafe_solvers, solvers) => |
|
279 (simprocs, NONE, loop_tacs, unsafe_solvers, solvers)); |
|
280 |
|
281 fun add_context_looper (name, tac) = |
|
282 map_context_ss (fn (simprocs, subgoal_tac, loop_tacs, unsafe_solvers, solvers) => |
|
283 (simprocs, subgoal_tac, merge_alists [(name, tac)] loop_tacs, |
|
284 unsafe_solvers, solvers)); |
|
285 |
|
286 fun del_context_looper name = |
|
287 map_context_ss (fn (simprocs, subgoal_tac, loop_tacs, unsafe_solvers, solvers) => |
|
288 (simprocs, subgoal_tac, filter_out (equal name o #1) loop_tacs, |
|
289 unsafe_solvers, solvers)); |
|
290 |
|
291 fun add_context_unsafe_solver solver = |
|
292 map_context_ss (fn (simprocs, subgoal_tac, loop_tacs, unsafe_solvers, solvers) => |
|
293 (simprocs, subgoal_tac, loop_tacs, |
|
294 merge_context_solvers [solver] unsafe_solvers, solvers)); |
|
295 |
|
296 fun add_context_safe_solver solver = |
|
297 map_context_ss (fn (simprocs, subgoal_tac, loop_tacs, unsafe_solvers, solvers) => |
|
298 (simprocs, subgoal_tac, loop_tacs, unsafe_solvers, |
|
299 merge_context_solvers [solver] solvers)); |
|
300 |
|
301 |
|
302 (* proof data kind 'Provers/simpset' *) |
|
303 |
|
304 structure LocalSimpsetArgs = |
|
305 struct |
|
306 val name = "Provers/simpset"; |
|
307 type T = simpset; |
|
308 val init = simpset_of; |
|
309 fun print ctxt ss = print_ss (context_ss ctxt ss (get_context_ss ctxt)); |
|
310 end; |
|
311 |
|
312 structure LocalSimpset = ProofDataFun(LocalSimpsetArgs); |
|
313 val print_local_simpset = LocalSimpset.print; |
|
314 val get_local_simpset = LocalSimpset.get; |
|
315 val put_local_simpset = LocalSimpset.put; |
|
316 fun map_local_simpset f ctxt = put_local_simpset (f (get_local_simpset ctxt)) ctxt; |
|
317 |
|
318 fun local_simpset_of ctxt = |
|
319 context_ss ctxt (get_local_simpset ctxt) (get_context_ss ctxt); |
|
320 |
|
321 |
|
322 (* Jia: added DeltaSimpsetArgs and DeltaSimpset for delta_simpset |
|
323 also added methods to retrieve them. *) |
|
324 (* CB: changed "delta simpsets" to context data, |
|
325 moved counter to here, it is no longer a ref *) |
|
326 |
|
327 structure DeltaSimpsetArgs = |
|
328 struct |
|
329 val name = "Provers/delta_simpset"; |
|
330 type T = Thm.thm list * int; (*the type is thm list * int*) |
|
331 fun init _ = ([], 0); |
|
332 fun print ctxt thms = (); |
|
333 end; |
|
334 |
|
335 structure DeltaSimpsetData = ProofDataFun(DeltaSimpsetArgs); |
|
336 |
|
337 val get_delta_simpset = #1 o DeltaSimpsetData.get; |
|
338 fun put_delta_simpset ss = DeltaSimpsetData.map (fn (_, i) => (ss, i)); |
|
339 fun delta_increment ctxt = |
|
340 let val ctxt' = DeltaSimpsetData.map (fn (ss, i) => (ss, i+1)) ctxt |
|
341 in (ctxt', #2 (DeltaSimpsetData.get ctxt')) |
|
342 end; |
|
343 |
|
344 (* Jia: added to rename a local thm if necessary *) |
|
345 local |
|
346 fun rename_thm' (ctxt,thm) = |
|
347 let val (new_ctxt, new_id) = delta_increment ctxt |
|
348 val new_name = "anon_simp_" ^ (string_of_int new_id) |
|
349 in |
|
350 (new_ctxt, Thm.name_thm(new_name,thm)) |
|
351 end; |
|
352 |
|
353 in |
|
354 |
|
355 fun rename_thm (ctxt,thm) = if (!Proof.call_atp) then rename_thm' (ctxt,thm) else (ctxt, thm); |
|
356 |
|
357 end |
|
358 |
|
359 (* attributes *) |
|
360 |
|
361 fun change_global_ss f (thy, th) = |
|
362 let val r = simpset_ref_of thy |
|
363 in r := f (! r, [th]); (thy, th) end; |
|
364 |
|
365 fun change_local_ss f (ctxt, th) = |
|
366 let val ss = f (get_local_simpset ctxt, [th]) |
|
367 in (put_local_simpset ss ctxt, th) end; |
|
368 |
|
369 val simp_add_global = change_global_ss (op addsimps); |
|
370 val simp_del_global = change_global_ss (op delsimps); |
|
371 |
|
372 |
|
373 |
|
374 |
|
375 |
|
376 (* Jia: note: when simplifier rules are added to local_simpset, they are also added to delta_simpset in ProofContext.context, but not removed if simp_del_local is called *) |
|
377 fun simp_add_local (ctxt,th) = |
|
378 let val delta_ss = get_delta_simpset ctxt |
|
379 val thm_name = Thm.name_of_thm th |
|
380 val (ctxt', th') = |
|
381 if (thm_name = "") then rename_thm (ctxt,th) else (ctxt, th) |
|
382 val new_dss = th'::delta_ss |
|
383 val ctxt'' = put_delta_simpset new_dss ctxt' |
|
384 in |
|
385 change_local_ss (op addsimps) (ctxt'',th) |
|
386 end; |
|
387 |
|
388 val simp_del_local = change_local_ss (op delsimps); |
|
389 |
|
390 val cong_add_global = change_global_ss (op addcongs); |
|
391 val cong_del_global = change_global_ss (op delcongs); |
|
392 val cong_add_local = change_local_ss (op addcongs); |
|
393 val cong_del_local = change_local_ss (op delcongs); |
|
394 |
|
395 |
|
396 val simp_tac = generic_simp_tac false (false, false, false); |
|
397 val asm_simp_tac = generic_simp_tac false (false, true, false); |
|
398 val full_simp_tac = generic_simp_tac false (true, false, false); |
|
399 val asm_lr_simp_tac = generic_simp_tac false (true, true, false); |
|
400 val asm_full_simp_tac = generic_simp_tac false (true, true, true); |
|
401 val safe_asm_full_simp_tac = generic_simp_tac true (true, true, true); |
|
402 |
|
403 |
|
404 |
|
405 (*the abstraction over the proof state delays the dereferencing*) |
|
406 fun Simp_tac i st = simp_tac (simpset ()) i st; |
|
407 fun Asm_simp_tac i st = asm_simp_tac (simpset ()) i st; |
|
408 fun Full_simp_tac i st = full_simp_tac (simpset ()) i st; |
|
409 fun Asm_lr_simp_tac i st = asm_lr_simp_tac (simpset ()) i st; |
|
410 fun Asm_full_simp_tac i st = asm_full_simp_tac (simpset ()) i st; |
|
411 |
|
412 val simplify = simp_thm (false, false, false); |
|
413 val asm_simplify = simp_thm (false, true, false); |
|
414 val full_simplify = simp_thm (true, false, false); |
|
415 val asm_lr_simplify = simp_thm (true, true, false); |
|
416 val asm_full_simplify = simp_thm (true, true, true); |
|
417 |
|
418 val rewrite = simp_cterm (false, false, false); |
|
419 val asm_rewrite = simp_cterm (false, true, false); |
|
420 val full_rewrite = simp_cterm (true, false, false); |
|
421 val asm_lr_rewrite = simp_cterm (true, true, false); |
|
422 val asm_full_rewrite = simp_cterm (true, true, true); |
|
423 |
|
424 |
|
425 |
|
426 (** concrete syntax of attributes **) |
|
427 |
|
428 (* add / del *) |
|
429 |
|
430 val simpN = "simp"; |
|
431 val congN = "cong"; |
|
432 val addN = "add"; |
|
433 val delN = "del"; |
|
434 val onlyN = "only"; |
|
435 val no_asmN = "no_asm"; |
|
436 val no_asm_useN = "no_asm_use"; |
|
437 val no_asm_simpN = "no_asm_simp"; |
|
438 val asm_lrN = "asm_lr"; |
|
439 |
|
440 val simp_attr = |
|
441 (Attrib.add_del_args simp_add_global simp_del_global, |
|
442 Attrib.add_del_args simp_add_local simp_del_local); |
|
443 |
|
444 val cong_attr = |
|
445 (Attrib.add_del_args cong_add_global cong_del_global, |
|
446 Attrib.add_del_args cong_add_local cong_del_local); |
|
447 |
|
448 |
|
449 (* conversions *) |
|
450 |
|
451 local |
|
452 |
|
453 fun conv_mode x = |
|
454 ((Args.parens (Args.$$$ no_asmN) >> K simplify || |
|
455 Args.parens (Args.$$$ no_asm_simpN) >> K asm_simplify || |
|
456 Args.parens (Args.$$$ no_asm_useN) >> K full_simplify || |
|
457 Scan.succeed asm_full_simplify) |> Scan.lift) x; |
|
458 |
|
459 fun simplified_att get args = |
|
460 Attrib.syntax (conv_mode -- args >> (fn (f, ths) => |
|
461 Drule.rule_attribute (fn x => f ((if null ths then I else clear_ss) (get x) addsimps ths)))); |
|
462 |
|
463 in |
|
464 |
|
465 val simplified_attr = |
|
466 (simplified_att simpset_of Attrib.global_thmss, |
|
467 simplified_att local_simpset_of Attrib.local_thmss); |
|
468 |
|
469 end; |
|
470 |
|
471 |
|
472 (* setup_attrs *) |
|
473 |
|
474 val setup_attrs = Attrib.add_attributes |
|
475 [(simpN, simp_attr, "declaration of simplification rule"), |
|
476 (congN, cong_attr, "declaration of Simplifier congruence rule"), |
|
477 ("simplified", simplified_attr, "simplified rule")]; |
|
478 |
|
479 |
|
480 |
|
481 (** proof methods **) |
|
482 |
|
483 (* simplification *) |
|
484 |
|
485 val simp_options = |
|
486 (Args.parens (Args.$$$ no_asmN) >> K simp_tac || |
|
487 Args.parens (Args.$$$ no_asm_simpN) >> K asm_simp_tac || |
|
488 Args.parens (Args.$$$ no_asm_useN) >> K full_simp_tac || |
|
489 Args.parens (Args.$$$ asm_lrN) >> K asm_lr_simp_tac || |
|
490 Scan.succeed asm_full_simp_tac); |
|
491 |
|
492 val cong_modifiers = |
|
493 [Args.$$$ congN -- Args.colon >> K ((I, cong_add_local):Method.modifier), |
|
494 Args.$$$ congN -- Args.add -- Args.colon >> K (I, cong_add_local), |
|
495 Args.$$$ congN -- Args.del -- Args.colon >> K (I, cong_del_local)]; |
|
496 |
|
497 val simp_modifiers = |
|
498 [Args.$$$ simpN -- Args.colon >> K (I, simp_add_local), |
|
499 Args.$$$ simpN -- Args.add -- Args.colon >> K (I, simp_add_local), |
|
500 Args.$$$ simpN -- Args.del -- Args.colon >> K (I, simp_del_local), |
|
501 Args.$$$ simpN -- Args.$$$ onlyN -- Args.colon >> K (map_local_simpset clear_ss, simp_add_local)] |
|
502 @ cong_modifiers; |
|
503 |
|
504 val simp_modifiers' = |
|
505 [Args.add -- Args.colon >> K (I, simp_add_local), |
|
506 Args.del -- Args.colon >> K (I, simp_del_local), |
|
507 Args.$$$ onlyN -- Args.colon >> K (map_local_simpset clear_ss, simp_add_local)] |
|
508 @ cong_modifiers; |
|
509 |
|
510 fun simp_args more_mods = |
|
511 Method.sectioned_args (Args.bang_facts -- Scan.lift simp_options) (more_mods @ simp_modifiers'); |
|
512 |
|
513 |
|
514 fun simp_method (prems, tac) ctxt = Method.METHOD (fn facts => |
|
515 ALLGOALS (Method.insert_tac (prems @ facts)) THEN |
|
516 (CHANGED_PROP o ALLGOALS o tac) (local_simpset_of ctxt)); |
|
517 |
|
518 fun simp_method' (prems, tac) ctxt = Method.METHOD (fn facts => |
|
519 HEADGOAL (Method.insert_tac (prems @ facts) THEN' |
|
520 (CHANGED_PROP oo tac) (local_simpset_of ctxt))); |
|
521 |
|
522 |
|
523 (* setup_methods *) |
|
524 |
|
525 fun setup_methods more_mods = Method.add_methods |
|
526 [(simpN, simp_args more_mods simp_method', "simplification"), |
|
527 ("simp_all", simp_args more_mods simp_method, "simplification (all goals)")]; |
|
528 |
|
529 |
|
530 |
|
531 (** theory setup **) |
|
532 |
|
533 val setup = [GlobalSimpset.init, LocalSimpset.init, DeltaSimpsetData.init, |
|
534 setup_attrs]; |
|
535 fun method_setup mods = [setup_methods mods]; |
|
536 |
|
537 fun easy_setup reflect trivs = |
|
538 let |
|
539 val trivialities = Drule.reflexive_thm :: trivs; |
|
540 |
|
541 fun unsafe_solver_tac prems = FIRST' [resolve_tac (trivialities @ prems), assume_tac]; |
|
542 val unsafe_solver = mk_solver "easy unsafe" unsafe_solver_tac; |
|
543 |
|
544 (*no premature instantiation of variables during simplification*) |
|
545 fun safe_solver_tac prems = FIRST' [match_tac (trivialities @ prems), eq_assume_tac]; |
|
546 val safe_solver = mk_solver "easy safe" safe_solver_tac; |
|
547 |
|
548 fun mk_eq thm = |
|
549 if Logic.is_equals (Thm.concl_of thm) then [thm] |
|
550 else [thm RS reflect] handle THM _ => []; |
|
551 |
|
552 fun mksimps thm = mk_eq (Drule.forall_elim_vars (#maxidx (Thm.rep_thm thm) + 1) thm); |
|
553 |
|
554 fun init_ss thy = |
|
555 (simpset_ref_of thy := |
|
556 empty_ss setsubgoaler asm_simp_tac |
|
557 setSSolver safe_solver |
|
558 setSolver unsafe_solver |
|
559 setmksimps mksimps; thy); |
|
560 in setup @ method_setup [] @ [init_ss] end; |
|
561 |
|
562 |
|
563 |
|
564 (** outer syntax **) |
|
565 |
|
566 val print_simpsetP = |
|
567 OuterSyntax.improper_command "print_simpset" "print context of Simplifier" |
|
568 OuterSyntax.Keyword.diag |
|
569 (Scan.succeed (Toplevel.no_timing o Toplevel.unknown_context o (Toplevel.keep |
|
570 (Toplevel.node_case print_simpset (print_local_simpset o Proof.context_of))))); |
|
571 |
|
572 val find_rewritesP = |
|
573 OuterSyntax.improper_command "find_rewrites" "find and print rewrites" OuterSyntax.Keyword.diag |
|
574 (OuterParse.term >> (Toplevel.no_timing oo find_rewrites)); |
|
575 |
|
576 val _ = OuterSyntax.add_parsers [print_simpsetP,find_rewritesP]; |
|
577 |
|
578 end; |
|
579 |
|
580 |
|
581 structure BasicSimplifier: BASIC_SIMPLIFIER = Simplifier; |
|
582 open BasicSimplifier; |
|