wenzelm@9772
|
1 |
(* Title: Provers/clasimp.ML
|
oheimb@4652
|
2 |
ID: $Id$
|
oheimb@4652
|
3 |
Author: David von Oheimb, TU Muenchen
|
oheimb@4652
|
4 |
|
wenzelm@5219
|
5 |
Combination of classical reasoner and simplifier (depends on
|
wenzelm@16019
|
6 |
splitter.ML, classical.ML, blast.ML).
|
oheimb@4652
|
7 |
*)
|
oheimb@4652
|
8 |
|
wenzelm@9860
|
9 |
infix 4 addSIs2 addSEs2 addSDs2 addIs2 addEs2 addDs2 addsimps2 delsimps2
|
berghofe@13603
|
10 |
addSss addss addss' addIffs delIffs;
|
oheimb@4652
|
11 |
|
wenzelm@5219
|
12 |
signature CLASIMP_DATA =
|
wenzelm@5219
|
13 |
sig
|
wenzelm@8469
|
14 |
structure Splitter: SPLITTER
|
wenzelm@5219
|
15 |
structure Classical: CLASSICAL
|
wenzelm@5219
|
16 |
structure Blast: BLAST
|
wenzelm@5219
|
17 |
sharing type Classical.claset = Blast.claset
|
wenzelm@9860
|
18 |
val notE: thm
|
wenzelm@9860
|
19 |
val iffD1: thm
|
wenzelm@9860
|
20 |
val iffD2: thm
|
wenzelm@5219
|
21 |
end
|
wenzelm@5219
|
22 |
|
oheimb@4652
|
23 |
signature CLASIMP =
|
oheimb@4652
|
24 |
sig
|
wenzelm@5219
|
25 |
include CLASIMP_DATA
|
wenzelm@5219
|
26 |
type claset
|
wenzelm@5219
|
27 |
type clasimpset
|
wenzelm@26497
|
28 |
val get_css: Context.generic -> clasimpset
|
wenzelm@26497
|
29 |
val map_css: (clasimpset -> clasimpset) -> Context.generic -> Context.generic
|
wenzelm@17879
|
30 |
val change_clasimpset: (clasimpset -> clasimpset) -> unit
|
wenzelm@10317
|
31 |
val clasimpset: unit -> clasimpset
|
wenzelm@26497
|
32 |
val local_clasimpset_of: Proof.context -> clasimpset
|
wenzelm@9860
|
33 |
val addSIs2: clasimpset * thm list -> clasimpset
|
wenzelm@9860
|
34 |
val addSEs2: clasimpset * thm list -> clasimpset
|
wenzelm@9860
|
35 |
val addSDs2: clasimpset * thm list -> clasimpset
|
wenzelm@9860
|
36 |
val addIs2: clasimpset * thm list -> clasimpset
|
wenzelm@9860
|
37 |
val addEs2: clasimpset * thm list -> clasimpset
|
wenzelm@9860
|
38 |
val addDs2: clasimpset * thm list -> clasimpset
|
wenzelm@9860
|
39 |
val addsimps2: clasimpset * thm list -> clasimpset
|
wenzelm@9860
|
40 |
val delsimps2: clasimpset * thm list -> clasimpset
|
wenzelm@9860
|
41 |
val addSss: claset * simpset -> claset
|
wenzelm@9860
|
42 |
val addss: claset * simpset -> claset
|
berghofe@13603
|
43 |
val addss': claset * simpset -> claset
|
wenzelm@9860
|
44 |
val addIffs: clasimpset * thm list -> clasimpset
|
wenzelm@9860
|
45 |
val delIffs: clasimpset * thm list -> clasimpset
|
wenzelm@9860
|
46 |
val AddIffs: thm list -> unit
|
wenzelm@9860
|
47 |
val DelIffs: thm list -> unit
|
wenzelm@9860
|
48 |
val CLASIMPSET: (clasimpset -> tactic) -> tactic
|
wenzelm@9860
|
49 |
val CLASIMPSET': (clasimpset -> 'a -> tactic) -> 'a -> tactic
|
oheimb@5483
|
50 |
val clarsimp_tac: clasimpset -> int -> tactic
|
wenzelm@9860
|
51 |
val Clarsimp_tac: int -> tactic
|
wenzelm@9860
|
52 |
val mk_auto_tac: clasimpset -> int -> int -> tactic
|
wenzelm@9860
|
53 |
val auto_tac: clasimpset -> tactic
|
wenzelm@9860
|
54 |
val Auto_tac: tactic
|
wenzelm@9860
|
55 |
val auto: unit -> unit
|
wenzelm@9860
|
56 |
val force_tac: clasimpset -> int -> tactic
|
wenzelm@9860
|
57 |
val Force_tac: int -> tactic
|
wenzelm@9860
|
58 |
val force: int -> unit
|
wenzelm@9860
|
59 |
val fast_simp_tac: clasimpset -> int -> tactic
|
wenzelm@9860
|
60 |
val slow_simp_tac: clasimpset -> int -> tactic
|
wenzelm@9860
|
61 |
val best_simp_tac: clasimpset -> int -> tactic
|
wenzelm@18728
|
62 |
val attrib: (clasimpset * thm list -> clasimpset) -> attribute
|
wenzelm@18728
|
63 |
val iff_add: attribute
|
wenzelm@18728
|
64 |
val iff_add': attribute
|
wenzelm@18728
|
65 |
val iff_del: attribute
|
wenzelm@9860
|
66 |
val iff_modifiers: (Args.T list -> (Method.modifier * Args.T list)) list
|
wenzelm@9506
|
67 |
val clasimp_modifiers: (Args.T list -> (Method.modifier * Args.T list)) list
|
wenzelm@26497
|
68 |
val clasimp_setup: theory -> theory
|
oheimb@4652
|
69 |
end;
|
oheimb@4652
|
70 |
|
wenzelm@5219
|
71 |
functor ClasimpFun(Data: CLASIMP_DATA): CLASIMP =
|
oheimb@4652
|
72 |
struct
|
oheimb@4652
|
73 |
|
wenzelm@5219
|
74 |
open Data;
|
wenzelm@5219
|
75 |
|
wenzelm@26497
|
76 |
|
wenzelm@26497
|
77 |
(* type clasimpset *)
|
wenzelm@26497
|
78 |
|
wenzelm@5219
|
79 |
type claset = Classical.claset;
|
wenzelm@5219
|
80 |
type clasimpset = claset * simpset;
|
wenzelm@5219
|
81 |
|
wenzelm@26497
|
82 |
fun get_css context = (Classical.get_cs context, Simplifier.get_ss context);
|
wenzelm@17879
|
83 |
|
wenzelm@26497
|
84 |
fun map_css f context =
|
wenzelm@26497
|
85 |
let val (cs', ss') = f (get_css context)
|
wenzelm@26497
|
86 |
in context |> Classical.map_cs (K cs') |> Simplifier.map_ss (K ss') end;
|
wenzelm@26497
|
87 |
|
wenzelm@26497
|
88 |
fun change_clasimpset f = Context.>> (fn context => (Context.the_theory context; map_css f context));
|
wenzelm@10317
|
89 |
fun clasimpset () = (Classical.claset (), Simplifier.simpset ());
|
wenzelm@10317
|
90 |
|
wenzelm@26497
|
91 |
fun local_clasimpset_of ctxt =
|
wenzelm@26497
|
92 |
(Classical.local_claset_of ctxt, Simplifier.local_simpset_of ctxt);
|
wenzelm@26497
|
93 |
|
wenzelm@5219
|
94 |
|
wenzelm@5219
|
95 |
(* clasimpset operations *)
|
wenzelm@5219
|
96 |
|
wenzelm@5219
|
97 |
(*this interface for updating a clasimpset is rudimentary and just for
|
wenzelm@5219
|
98 |
convenience for the most common cases*)
|
wenzelm@5219
|
99 |
|
wenzelm@26497
|
100 |
fun pair_upd1 f ((a, b), x) = (f (a, x), b);
|
wenzelm@26497
|
101 |
fun pair_upd2 f ((a, b), x) = (a, f (b, x));
|
wenzelm@5219
|
102 |
|
wenzelm@5219
|
103 |
fun op addSIs2 arg = pair_upd1 Classical.addSIs arg;
|
wenzelm@5219
|
104 |
fun op addSEs2 arg = pair_upd1 Classical.addSEs arg;
|
wenzelm@5219
|
105 |
fun op addSDs2 arg = pair_upd1 Classical.addSDs arg;
|
wenzelm@5219
|
106 |
fun op addIs2 arg = pair_upd1 Classical.addIs arg;
|
wenzelm@5219
|
107 |
fun op addEs2 arg = pair_upd1 Classical.addEs arg;
|
wenzelm@5219
|
108 |
fun op addDs2 arg = pair_upd1 Classical.addDs arg;
|
wenzelm@5219
|
109 |
fun op addsimps2 arg = pair_upd2 Simplifier.addsimps arg;
|
wenzelm@5219
|
110 |
fun op delsimps2 arg = pair_upd2 Simplifier.delsimps arg;
|
oheimb@4652
|
111 |
|
oheimb@9402
|
112 |
(*not totally safe: may instantiate unknowns that appear also in other subgoals*)
|
oheimb@9402
|
113 |
val safe_asm_full_simp_tac = Simplifier.generic_simp_tac true (true,true,true);
|
oheimb@9402
|
114 |
|
oheimb@4652
|
115 |
(*Add a simpset to a classical set!*)
|
oheimb@4652
|
116 |
(*Caution: only one simpset added can be added by each of addSss and addss*)
|
oheimb@11181
|
117 |
fun cs addSss ss = Classical.addSafter (cs, ("safe_asm_full_simp_tac",
|
wenzelm@9772
|
118 |
CHANGED o safe_asm_full_simp_tac ss));
|
wenzelm@9772
|
119 |
fun cs addss ss = Classical.addbefore (cs, ("asm_full_simp_tac",
|
wenzelm@9772
|
120 |
CHANGED o Simplifier.asm_full_simp_tac ss));
|
berghofe@13603
|
121 |
fun cs addss' ss = Classical.addbefore (cs, ("asm_full_simp_tac",
|
berghofe@13603
|
122 |
CHANGED o Simplifier.asm_lr_simp_tac ss));
|
oheimb@4652
|
123 |
|
wenzelm@9860
|
124 |
(* iffs: addition of rules to simpsets and clasets simultaneously *)
|
wenzelm@9860
|
125 |
|
oheimb@11344
|
126 |
(*Takes (possibly conditional) theorems of the form A<->B to
|
wenzelm@9860
|
127 |
the Safe Intr rule B==>A and
|
wenzelm@9860
|
128 |
the Safe Destruct rule A==>B.
|
wenzelm@9860
|
129 |
Also ~A goes to the Safe Elim rule A ==> ?R
|
paulson@11462
|
130 |
Failing other cases, A is added as a Safe Intr rule*)
|
wenzelm@9860
|
131 |
local
|
wenzelm@9860
|
132 |
|
wenzelm@13026
|
133 |
fun addIff decls1 decls2 simp ((cs, ss), th) =
|
wenzelm@13026
|
134 |
let
|
wenzelm@13026
|
135 |
val n = nprems_of th;
|
paulson@17084
|
136 |
val (elim, intro) = if n = 0 then decls1 else decls2;
|
wenzelm@13026
|
137 |
val zero_rotate = zero_var_indexes o rotate_prems n;
|
wenzelm@13026
|
138 |
in
|
paulson@21709
|
139 |
(elim (intro (cs, [zero_rotate (th RS iffD2)]),
|
paulson@21709
|
140 |
[Tactic.make_elim (zero_rotate (th RS iffD1))])
|
paulson@21709
|
141 |
handle THM _ => (elim (cs, [zero_rotate (th RS notE)])
|
wenzelm@11902
|
142 |
handle THM _ => intro (cs, [th])),
|
wenzelm@11902
|
143 |
simp (ss, [th]))
|
wenzelm@11902
|
144 |
end;
|
wenzelm@9860
|
145 |
|
wenzelm@12375
|
146 |
fun delIff delcs delss ((cs, ss), th) =
|
wenzelm@11902
|
147 |
let val zero_rotate = zero_var_indexes o rotate_prems (nprems_of th) in
|
wenzelm@18688
|
148 |
(delcs (cs, [zero_rotate (th RS iffD2),
|
wenzelm@18688
|
149 |
Tactic.make_elim (zero_rotate (th RS iffD1))])
|
wenzelm@18688
|
150 |
handle THM _ => (delcs (cs, [zero_rotate (th RS notE)])
|
wenzelm@12375
|
151 |
handle THM _ => delcs (cs, [th])),
|
wenzelm@12375
|
152 |
delss (ss, [th]))
|
wenzelm@11902
|
153 |
end;
|
wenzelm@9860
|
154 |
|
wenzelm@18630
|
155 |
fun modifier att (x, ths) =
|
wenzelm@18728
|
156 |
fst (foldl_map (Library.apply [att]) (x, rev ths));
|
wenzelm@18630
|
157 |
|
wenzelm@18688
|
158 |
val addXIs = modifier (ContextRules.intro_query NONE);
|
wenzelm@18688
|
159 |
val addXEs = modifier (ContextRules.elim_query NONE);
|
wenzelm@18688
|
160 |
val addXDs = modifier (ContextRules.dest_query NONE);
|
wenzelm@18688
|
161 |
val delXs = modifier ContextRules.rule_del;
|
wenzelm@18630
|
162 |
|
wenzelm@9860
|
163 |
in
|
wenzelm@9860
|
164 |
|
wenzelm@10033
|
165 |
val op addIffs =
|
wenzelm@26497
|
166 |
Library.foldl
|
paulson@17084
|
167 |
(addIff (Classical.addSEs, Classical.addSIs)
|
wenzelm@26497
|
168 |
(Classical.addEs, Classical.addIs)
|
paulson@17084
|
169 |
Simplifier.addsimps);
|
skalberg@15570
|
170 |
val op delIffs = Library.foldl (delIff Classical.delrules Simplifier.delsimps);
|
wenzelm@10033
|
171 |
|
wenzelm@17879
|
172 |
fun AddIffs thms = change_clasimpset (fn css => css addIffs thms);
|
wenzelm@17879
|
173 |
fun DelIffs thms = change_clasimpset (fn css => css delIffs thms);
|
wenzelm@9860
|
174 |
|
wenzelm@18688
|
175 |
fun addIffs_generic (x, ths) =
|
wenzelm@18688
|
176 |
Library.foldl (addIff (addXEs, addXIs) (addXEs, addXIs) #1) ((x, ()), ths) |> #1;
|
wenzelm@12375
|
177 |
|
wenzelm@18688
|
178 |
fun delIffs_generic (x, ths) =
|
wenzelm@18688
|
179 |
Library.foldl (delIff delXs #1) ((x, ()), ths) |> #1;
|
wenzelm@12375
|
180 |
|
wenzelm@9860
|
181 |
end;
|
wenzelm@9860
|
182 |
|
wenzelm@9860
|
183 |
|
wenzelm@5219
|
184 |
(* tacticals *)
|
wenzelm@4888
|
185 |
|
wenzelm@5219
|
186 |
fun CLASIMPSET tacf state =
|
wenzelm@5219
|
187 |
Classical.CLASET (fn cs => Simplifier.SIMPSET (fn ss => tacf (cs, ss))) state;
|
wenzelm@4888
|
188 |
|
wenzelm@5219
|
189 |
fun CLASIMPSET' tacf i state =
|
wenzelm@5219
|
190 |
Classical.CLASET (fn cs => Simplifier.SIMPSET (fn ss => tacf (cs, ss) i)) state;
|
oheimb@4652
|
191 |
|
oheimb@4652
|
192 |
|
wenzelm@12375
|
193 |
fun clarsimp_tac (cs, ss) =
|
wenzelm@12375
|
194 |
safe_asm_full_simp_tac ss THEN_ALL_NEW
|
wenzelm@12375
|
195 |
Classical.clarify_tac (cs addSss ss);
|
wenzelm@12375
|
196 |
|
wenzelm@10317
|
197 |
fun Clarsimp_tac i = clarsimp_tac (clasimpset ()) i;
|
oheimb@5483
|
198 |
|
oheimb@5483
|
199 |
|
wenzelm@5219
|
200 |
(* auto_tac *)
|
oheimb@4652
|
201 |
|
wenzelm@5219
|
202 |
fun blast_depth_tac cs m i thm =
|
wenzelm@9772
|
203 |
Blast.depth_tac cs m i thm
|
oheimb@5554
|
204 |
handle Blast.TRANS s => (warning ("Blast_tac: " ^ s); Seq.empty);
|
wenzelm@9772
|
205 |
|
wenzelm@9772
|
206 |
(* a variant of depth_tac that avoids interference of the simplifier
|
wenzelm@5219
|
207 |
with dup_step_tac when they are combined by auto_tac *)
|
oheimb@5756
|
208 |
local
|
wenzelm@9772
|
209 |
fun slow_step_tac' cs = Classical.appWrappers cs
|
wenzelm@9772
|
210 |
(Classical.instp_step_tac cs APPEND' Classical.haz_step_tac cs);
|
wenzelm@9772
|
211 |
in fun nodup_depth_tac cs m i state = SELECT_GOAL
|
wenzelm@9772
|
212 |
(Classical.safe_steps_tac cs 1 THEN_ELSE
|
wenzelm@9772
|
213 |
(DEPTH_SOLVE (nodup_depth_tac cs m 1),
|
wenzelm@9772
|
214 |
Classical.inst0_step_tac cs 1 APPEND COND (K (m=0)) no_tac
|
wenzelm@9772
|
215 |
(slow_step_tac' cs 1 THEN DEPTH_SOLVE (nodup_depth_tac cs (m-1) 1))
|
oheimb@5756
|
216 |
)) i state;
|
oheimb@5756
|
217 |
end;
|
oheimb@4652
|
218 |
|
oheimb@9402
|
219 |
(*Designed to be idempotent, except if blast_depth_tac instantiates variables
|
oheimb@4652
|
220 |
in some of the subgoals*)
|
oheimb@4652
|
221 |
fun mk_auto_tac (cs, ss) m n =
|
wenzelm@5219
|
222 |
let val cs' = cs addss ss
|
wenzelm@9772
|
223 |
val maintac =
|
wenzelm@9772
|
224 |
blast_depth_tac cs m (* fast but can't use wrappers *)
|
oheimb@4652
|
225 |
ORELSE'
|
oheimb@5756
|
226 |
(CHANGED o nodup_depth_tac cs' n); (* slower but more general *)
|
wenzelm@5219
|
227 |
in EVERY [ALLGOALS (Simplifier.asm_full_simp_tac ss),
|
wenzelm@9772
|
228 |
TRY (Classical.safe_tac cs),
|
wenzelm@9772
|
229 |
REPEAT (FIRSTGOAL maintac),
|
wenzelm@5219
|
230 |
TRY (Classical.safe_tac (cs addSss ss)),
|
wenzelm@9772
|
231 |
prune_params_tac]
|
oheimb@4652
|
232 |
end;
|
oheimb@4652
|
233 |
|
wenzelm@9772
|
234 |
fun auto_tac css = mk_auto_tac css 4 2;
|
wenzelm@10317
|
235 |
fun Auto_tac st = auto_tac (clasimpset ()) st;
|
oheimb@4652
|
236 |
fun auto () = by Auto_tac;
|
oheimb@4652
|
237 |
|
wenzelm@9772
|
238 |
|
wenzelm@5219
|
239 |
(* force_tac *)
|
wenzelm@5219
|
240 |
|
oheimb@4659
|
241 |
(* aimed to solve the given subgoal totally, using whatever tools possible *)
|
oheimb@4717
|
242 |
fun force_tac (cs,ss) = let val cs' = cs addss ss in SELECT_GOAL (EVERY [
|
wenzelm@9772
|
243 |
Classical.clarify_tac cs' 1,
|
wenzelm@9772
|
244 |
IF_UNSOLVED (Simplifier.asm_full_simp_tac ss 1),
|
wenzelm@9772
|
245 |
ALLGOALS (Classical.first_best_tac cs')]) end;
|
wenzelm@10317
|
246 |
fun Force_tac i = force_tac (clasimpset ()) i;
|
oheimb@4717
|
247 |
fun force i = by (Force_tac i);
|
oheimb@4659
|
248 |
|
wenzelm@5219
|
249 |
|
wenzelm@9805
|
250 |
(* basic combinations *)
|
wenzelm@9591
|
251 |
|
wenzelm@9805
|
252 |
fun ADDSS tac (cs, ss) = let val cs' = cs addss ss in tac cs' end;
|
wenzelm@9805
|
253 |
|
wenzelm@9805
|
254 |
val fast_simp_tac = ADDSS Classical.fast_tac;
|
wenzelm@9805
|
255 |
val slow_simp_tac = ADDSS Classical.slow_tac;
|
wenzelm@9805
|
256 |
val best_simp_tac = ADDSS Classical.best_tac;
|
wenzelm@9591
|
257 |
|
wenzelm@9591
|
258 |
|
wenzelm@9860
|
259 |
(* access clasimpset *)
|
wenzelm@8639
|
260 |
|
wenzelm@15032
|
261 |
|
wenzelm@9860
|
262 |
|
wenzelm@9860
|
263 |
(* attributes *)
|
wenzelm@9860
|
264 |
|
wenzelm@26497
|
265 |
fun attrib f = Thm.declaration_attribute (fn th => map_css (fn css => f (css, [th])));
|
wenzelm@18688
|
266 |
fun attrib' f (x, th) = (f (x, [th]), th);
|
wenzelm@9860
|
267 |
|
wenzelm@18688
|
268 |
val iff_add = attrib (op addIffs);
|
wenzelm@18688
|
269 |
val iff_add' = attrib' addIffs_generic;
|
wenzelm@18688
|
270 |
val iff_del = attrib (op delIffs) o attrib' delIffs_generic;
|
wenzelm@10033
|
271 |
|
wenzelm@18688
|
272 |
val iff_att = Attrib.syntax (Scan.lift
|
wenzelm@18688
|
273 |
(Args.del >> K iff_del ||
|
wenzelm@18688
|
274 |
Scan.option Args.add -- Args.query >> K iff_add' ||
|
wenzelm@18688
|
275 |
Scan.option Args.add >> K iff_add));
|
wenzelm@9860
|
276 |
|
wenzelm@9860
|
277 |
|
wenzelm@9860
|
278 |
(* method modifiers *)
|
wenzelm@9860
|
279 |
|
wenzelm@9860
|
280 |
val iffN = "iff";
|
wenzelm@9860
|
281 |
|
wenzelm@9860
|
282 |
val iff_modifiers =
|
wenzelm@18728
|
283 |
[Args.$$$ iffN -- Scan.option Args.add -- Args.colon >> K ((I, iff_add): Method.modifier),
|
wenzelm@18728
|
284 |
Args.$$$ iffN -- Scan.option Args.add -- Args.query_colon >> K (I, iff_add'),
|
wenzelm@18728
|
285 |
Args.$$$ iffN -- Args.del -- Args.colon >> K (I, iff_del)];
|
wenzelm@9860
|
286 |
|
wenzelm@8469
|
287 |
val clasimp_modifiers =
|
wenzelm@9860
|
288 |
Simplifier.simp_modifiers @ Splitter.split_modifiers @
|
wenzelm@9860
|
289 |
Classical.cla_modifiers @ iff_modifiers;
|
wenzelm@9860
|
290 |
|
wenzelm@9860
|
291 |
|
wenzelm@9860
|
292 |
(* methods *)
|
wenzelm@5926
|
293 |
|
wenzelm@7559
|
294 |
fun clasimp_meth tac prems ctxt = Method.METHOD (fn facts =>
|
wenzelm@15032
|
295 |
ALLGOALS (Method.insert_tac (prems @ facts)) THEN tac (local_clasimpset_of ctxt));
|
wenzelm@7132
|
296 |
|
wenzelm@7559
|
297 |
fun clasimp_meth' tac prems ctxt = Method.METHOD (fn facts =>
|
wenzelm@15032
|
298 |
HEADGOAL (Method.insert_tac (prems @ facts) THEN' tac (local_clasimpset_of ctxt)));
|
wenzelm@5926
|
299 |
|
wenzelm@7559
|
300 |
val clasimp_method = Method.bang_sectioned_args clasimp_modifiers o clasimp_meth;
|
wenzelm@7559
|
301 |
val clasimp_method' = Method.bang_sectioned_args clasimp_modifiers o clasimp_meth';
|
wenzelm@5926
|
302 |
|
wenzelm@5926
|
303 |
|
wenzelm@9772
|
304 |
fun auto_args m =
|
wenzelm@27809
|
305 |
Method.bang_sectioned_args' clasimp_modifiers
|
wenzelm@27809
|
306 |
(Scan.lift (Scan.option (OuterParse.nat -- OuterParse.nat))) m;
|
wenzelm@9772
|
307 |
|
skalberg@15531
|
308 |
fun auto_meth NONE = clasimp_meth (CHANGED_PROP o auto_tac)
|
skalberg@15531
|
309 |
| auto_meth (SOME (m, n)) = clasimp_meth (CHANGED_PROP o (fn css => mk_auto_tac css m n));
|
wenzelm@9772
|
310 |
|
wenzelm@9772
|
311 |
|
wenzelm@9772
|
312 |
(* theory setup *)
|
wenzelm@9772
|
313 |
|
wenzelm@26497
|
314 |
val clasimp_setup =
|
wenzelm@18708
|
315 |
(Attrib.add_attributes
|
wenzelm@18728
|
316 |
[("iff", iff_att, "declaration of Simplifier / Classical rules")] #>
|
wenzelm@9860
|
317 |
Method.add_methods
|
wenzelm@9591
|
318 |
[("fastsimp", clasimp_method' fast_simp_tac, "combined fast and simp"),
|
wenzelm@9805
|
319 |
("slowsimp", clasimp_method' slow_simp_tac, "combined slow and simp"),
|
wenzelm@9805
|
320 |
("bestsimp", clasimp_method' best_simp_tac, "combined best and simp"),
|
wenzelm@9591
|
321 |
("force", clasimp_method' force_tac, "force"),
|
wenzelm@9772
|
322 |
("auto", auto_args auto_meth, "auto"),
|
wenzelm@18708
|
323 |
("clarsimp", clasimp_method' (CHANGED_PROP oo clarsimp_tac), "clarify simplified goal")]);
|
wenzelm@5926
|
324 |
|
oheimb@4652
|
325 |
end;
|