wenzelm@16014
|
1 |
(* Title: Pure/simplifier.ML
|
wenzelm@16014
|
2 |
Author: Tobias Nipkow and Markus Wenzel, TU Muenchen
|
wenzelm@16014
|
3 |
|
wenzelm@16014
|
4 |
Generic simplifier, suitable for most logics (see also
|
haftmann@41634
|
5 |
raw_simplifier.ML for the actual meta-level rewriting engine).
|
wenzelm@16014
|
6 |
*)
|
wenzelm@16014
|
7 |
|
wenzelm@16014
|
8 |
signature BASIC_SIMPLIFIER =
|
wenzelm@16014
|
9 |
sig
|
wenzelm@41494
|
10 |
include BASIC_RAW_SIMPLIFIER
|
wenzelm@43667
|
11 |
val map_simpset: (simpset -> simpset) -> Proof.context -> Proof.context
|
wenzelm@43667
|
12 |
val simpset_of: Proof.context -> simpset
|
wenzelm@32148
|
13 |
val global_simpset_of: theory -> simpset
|
wenzelm@16014
|
14 |
val Addsimprocs: simproc list -> unit
|
wenzelm@16014
|
15 |
val Delsimprocs: simproc list -> unit
|
wenzelm@17967
|
16 |
val generic_simp_tac: bool -> bool * bool * bool -> simpset -> int -> tactic
|
wenzelm@16014
|
17 |
val safe_asm_full_simp_tac: simpset -> int -> tactic
|
wenzelm@35613
|
18 |
val simp_tac: simpset -> int -> tactic
|
wenzelm@35613
|
19 |
val asm_simp_tac: simpset -> int -> tactic
|
wenzelm@35613
|
20 |
val full_simp_tac: simpset -> int -> tactic
|
wenzelm@35613
|
21 |
val asm_lr_simp_tac: simpset -> int -> tactic
|
wenzelm@35613
|
22 |
val asm_full_simp_tac: simpset -> int -> tactic
|
wenzelm@35613
|
23 |
val simplify: simpset -> thm -> thm
|
wenzelm@35613
|
24 |
val asm_simplify: simpset -> thm -> thm
|
wenzelm@35613
|
25 |
val full_simplify: simpset -> thm -> thm
|
wenzelm@35613
|
26 |
val asm_lr_simplify: simpset -> thm -> thm
|
wenzelm@16014
|
27 |
val asm_full_simplify: simpset -> thm -> thm
|
wenzelm@16014
|
28 |
end;
|
wenzelm@16014
|
29 |
|
wenzelm@16014
|
30 |
signature SIMPLIFIER =
|
wenzelm@16014
|
31 |
sig
|
wenzelm@16014
|
32 |
include BASIC_SIMPLIFIER
|
wenzelm@43667
|
33 |
val map_simpset_global: (simpset -> simpset) -> theory -> theory
|
wenzelm@30356
|
34 |
val pretty_ss: Proof.context -> simpset -> Pretty.T
|
wenzelm@17004
|
35 |
val clear_ss: simpset -> simpset
|
wenzelm@32738
|
36 |
val debug_bounds: bool Unsynchronized.ref
|
wenzelm@44470
|
37 |
val prems_of: simpset -> thm list
|
wenzelm@41492
|
38 |
val add_simp: thm -> simpset -> simpset
|
wenzelm@41492
|
39 |
val del_simp: thm -> simpset -> simpset
|
wenzelm@46491
|
40 |
val add_eqcong: thm -> simpset -> simpset
|
wenzelm@46491
|
41 |
val del_eqcong: thm -> simpset -> simpset
|
wenzelm@46491
|
42 |
val add_cong: thm -> simpset -> simpset
|
wenzelm@46491
|
43 |
val del_cong: thm -> simpset -> simpset
|
wenzelm@41492
|
44 |
val add_prems: thm list -> simpset -> simpset
|
wenzelm@17883
|
45 |
val inherit_context: simpset -> simpset -> simpset
|
wenzelm@17898
|
46 |
val the_context: simpset -> Proof.context
|
wenzelm@17898
|
47 |
val context: Proof.context -> simpset -> simpset
|
haftmann@37416
|
48 |
val global_context: theory -> simpset -> simpset
|
wenzelm@36600
|
49 |
val with_context: Proof.context -> (simpset -> simpset) -> simpset -> simpset
|
wenzelm@43667
|
50 |
val simproc_global_i: theory -> string -> term list ->
|
wenzelm@43667
|
51 |
(theory -> simpset -> term -> thm option) -> simproc
|
wenzelm@43667
|
52 |
val simproc_global: theory -> string -> string list ->
|
wenzelm@43667
|
53 |
(theory -> simpset -> term -> thm option) -> simproc
|
wenzelm@35613
|
54 |
val rewrite: simpset -> conv
|
wenzelm@35613
|
55 |
val asm_rewrite: simpset -> conv
|
wenzelm@35613
|
56 |
val full_rewrite: simpset -> conv
|
wenzelm@35613
|
57 |
val asm_lr_rewrite: simpset -> conv
|
wenzelm@23598
|
58 |
val asm_full_rewrite: simpset -> conv
|
wenzelm@22379
|
59 |
val get_ss: Context.generic -> simpset
|
wenzelm@22379
|
60 |
val map_ss: (simpset -> simpset) -> Context.generic -> Context.generic
|
wenzelm@46491
|
61 |
val attrib: (thm -> simpset -> simpset) -> attribute
|
wenzelm@18728
|
62 |
val simp_add: attribute
|
wenzelm@18728
|
63 |
val simp_del: attribute
|
wenzelm@18728
|
64 |
val cong_add: attribute
|
wenzelm@18728
|
65 |
val cong_del: attribute
|
wenzelm@43336
|
66 |
val check_simproc: Proof.context -> xstring * Position.T -> string
|
wenzelm@43336
|
67 |
val the_simproc: Proof.context -> string -> simproc
|
wenzelm@43335
|
68 |
val def_simproc: {name: binding, lhss: term list,
|
wenzelm@22236
|
69 |
proc: morphism -> simpset -> cterm -> thm option, identifier: thm list} ->
|
wenzelm@22201
|
70 |
local_theory -> local_theory
|
wenzelm@43335
|
71 |
val def_simproc_cmd: {name: binding, lhss: string list,
|
wenzelm@22236
|
72 |
proc: morphism -> simpset -> cterm -> thm option, identifier: thm list} ->
|
wenzelm@22201
|
73 |
local_theory -> local_theory
|
wenzelm@30518
|
74 |
val cong_modifiers: Method.modifier parser list
|
wenzelm@30518
|
75 |
val simp_modifiers': Method.modifier parser list
|
wenzelm@30518
|
76 |
val simp_modifiers: Method.modifier parser list
|
wenzelm@30518
|
77 |
val method_setup: Method.modifier parser list -> theory -> theory
|
wenzelm@18708
|
78 |
val easy_setup: thm -> thm list -> theory -> theory
|
wenzelm@16014
|
79 |
end;
|
wenzelm@16014
|
80 |
|
wenzelm@16014
|
81 |
structure Simplifier: SIMPLIFIER =
|
wenzelm@16014
|
82 |
struct
|
wenzelm@16014
|
83 |
|
wenzelm@41494
|
84 |
open Raw_Simplifier;
|
wenzelm@21708
|
85 |
|
wenzelm@21708
|
86 |
|
wenzelm@43336
|
87 |
(** data **)
|
wenzelm@43336
|
88 |
|
wenzelm@43336
|
89 |
structure Data = Generic_Data
|
wenzelm@43336
|
90 |
(
|
wenzelm@43336
|
91 |
type T = simpset * simproc Name_Space.table;
|
wenzelm@43336
|
92 |
val empty : T = (empty_ss, Name_Space.empty_table "simproc");
|
wenzelm@43336
|
93 |
fun extend (ss, tab) = (Raw_Simplifier.inherit_context empty_ss ss, tab);
|
wenzelm@43336
|
94 |
fun merge ((ss1, tab1), (ss2, tab2)) =
|
wenzelm@43336
|
95 |
(merge_ss (ss1, ss2), Name_Space.merge_tables (tab1, tab2));
|
wenzelm@43336
|
96 |
);
|
wenzelm@43336
|
97 |
|
wenzelm@43336
|
98 |
val get_ss = fst o Data.get;
|
wenzelm@43336
|
99 |
|
wenzelm@43336
|
100 |
fun map_ss f context =
|
wenzelm@43336
|
101 |
Data.map (apfst ((Raw_Simplifier.with_context (Context.proof_of context) f))) context;
|
wenzelm@43336
|
102 |
|
wenzelm@43336
|
103 |
val get_simprocs = snd o Data.get o Context.Proof;
|
wenzelm@43336
|
104 |
|
wenzelm@43336
|
105 |
|
wenzelm@43336
|
106 |
|
wenzelm@30356
|
107 |
(** pretty printing **)
|
wenzelm@30356
|
108 |
|
wenzelm@30356
|
109 |
fun pretty_ss ctxt ss =
|
wenzelm@30356
|
110 |
let
|
wenzelm@30356
|
111 |
val pretty_cterm = Syntax.pretty_term ctxt o Thm.term_of;
|
wenzelm@32111
|
112 |
val pretty_thm = Display.pretty_thm ctxt;
|
wenzelm@30356
|
113 |
fun pretty_proc (name, lhss) = Pretty.big_list (name ^ ":") (map pretty_cterm lhss);
|
wenzelm@30356
|
114 |
fun pretty_cong (name, thm) =
|
wenzelm@30356
|
115 |
Pretty.block [Pretty.str (name ^ ":"), Pretty.brk 1, pretty_thm thm];
|
wenzelm@30356
|
116 |
|
wenzelm@30356
|
117 |
val {simps, procs, congs, loopers, unsafe_solvers, safe_solvers, ...} = dest_ss ss;
|
wenzelm@30356
|
118 |
in
|
wenzelm@30356
|
119 |
[Pretty.big_list "simplification rules:" (map (pretty_thm o #2) simps),
|
wenzelm@30356
|
120 |
Pretty.big_list "simplification procedures:" (map pretty_proc (sort_wrt #1 procs)),
|
wenzelm@30356
|
121 |
Pretty.big_list "congruences:" (map pretty_cong congs),
|
wenzelm@30356
|
122 |
Pretty.strs ("loopers:" :: map quote loopers),
|
wenzelm@30356
|
123 |
Pretty.strs ("unsafe solvers:" :: map quote unsafe_solvers),
|
wenzelm@30356
|
124 |
Pretty.strs ("safe solvers:" :: map quote safe_solvers)]
|
wenzelm@30356
|
125 |
|> Pretty.chunks
|
wenzelm@30356
|
126 |
end;
|
wenzelm@30356
|
127 |
|
wenzelm@30356
|
128 |
|
wenzelm@30356
|
129 |
|
wenzelm@17883
|
130 |
(** simpset data **)
|
wenzelm@16014
|
131 |
|
wenzelm@26497
|
132 |
(* attributes *)
|
wenzelm@26497
|
133 |
|
wenzelm@46491
|
134 |
fun attrib f = Thm.declaration_attribute (map_ss o f);
|
wenzelm@26497
|
135 |
|
wenzelm@46491
|
136 |
val simp_add = attrib add_simp;
|
wenzelm@46491
|
137 |
val simp_del = attrib del_simp;
|
wenzelm@46491
|
138 |
val cong_add = attrib add_cong;
|
wenzelm@46491
|
139 |
val cong_del = attrib del_cong;
|
wenzelm@26497
|
140 |
|
wenzelm@26497
|
141 |
|
wenzelm@26497
|
142 |
(* local simpset *)
|
wenzelm@16014
|
143 |
|
wenzelm@43667
|
144 |
fun map_simpset f = Context.proof_map (map_ss f);
|
wenzelm@41494
|
145 |
fun simpset_of ctxt = Raw_Simplifier.context ctxt (get_ss (Context.Proof ctxt));
|
wenzelm@16014
|
146 |
|
wenzelm@44446
|
147 |
val _ = Context.>> (Context.map_theory
|
wenzelm@44446
|
148 |
(ML_Antiquote.value (Binding.name "simpset")
|
wenzelm@44446
|
149 |
(Scan.succeed "Simplifier.simpset_of (ML_Context.the_local_context ())")));
|
wenzelm@22132
|
150 |
|
wenzelm@16014
|
151 |
|
wenzelm@43667
|
152 |
(* global simpset *)
|
wenzelm@43667
|
153 |
|
wenzelm@43667
|
154 |
fun map_simpset_global f = Context.theory_map (map_ss f);
|
wenzelm@43667
|
155 |
fun global_simpset_of thy =
|
wenzelm@43667
|
156 |
Raw_Simplifier.context (Proof_Context.init_global thy) (get_ss (Context.Theory thy));
|
wenzelm@43667
|
157 |
|
wenzelm@43667
|
158 |
fun Addsimprocs args = Context.>> (map_ss (fn ss => ss addsimprocs args));
|
wenzelm@43667
|
159 |
fun Delsimprocs args = Context.>> (map_ss (fn ss => ss delsimprocs args));
|
wenzelm@43667
|
160 |
|
wenzelm@43667
|
161 |
|
wenzelm@17967
|
162 |
|
wenzelm@22201
|
163 |
(** named simprocs **)
|
wenzelm@22201
|
164 |
|
wenzelm@22204
|
165 |
(* get simprocs *)
|
wenzelm@22204
|
166 |
|
wenzelm@44446
|
167 |
fun check_simproc ctxt = Name_Space.check ctxt (get_simprocs ctxt) #> #1;
|
wenzelm@43337
|
168 |
val the_simproc = Name_Space.get o get_simprocs;
|
wenzelm@43336
|
169 |
|
wenzelm@43335
|
170 |
val _ =
|
wenzelm@44446
|
171 |
Context.>> (Context.map_theory
|
wenzelm@44446
|
172 |
(ML_Antiquote.value (Binding.name "simproc")
|
wenzelm@44446
|
173 |
(Args.context -- Scan.lift (Parse.position Args.name)
|
wenzelm@44446
|
174 |
>> (fn (ctxt, name) =>
|
wenzelm@44446
|
175 |
"Simplifier.the_simproc (ML_Context.the_local_context ()) " ^
|
wenzelm@44446
|
176 |
ML_Syntax.print_string (check_simproc ctxt name)))));
|
wenzelm@22204
|
177 |
|
wenzelm@22204
|
178 |
|
wenzelm@22204
|
179 |
(* define simprocs *)
|
wenzelm@22201
|
180 |
|
wenzelm@22201
|
181 |
local
|
wenzelm@22201
|
182 |
|
wenzelm@43335
|
183 |
fun gen_simproc prep {name = b, lhss, proc, identifier} lthy =
|
wenzelm@22201
|
184 |
let
|
wenzelm@33673
|
185 |
val naming = Local_Theory.naming_of lthy;
|
wenzelm@22236
|
186 |
val simproc = make_simproc
|
wenzelm@33169
|
187 |
{name = Name_Space.full_name naming b,
|
wenzelm@22236
|
188 |
lhss =
|
wenzelm@22236
|
189 |
let
|
wenzelm@22236
|
190 |
val lhss' = prep lthy lhss;
|
wenzelm@46202
|
191 |
val ctxt' = fold Variable.auto_fixes lhss' lthy;
|
wenzelm@22236
|
192 |
in Variable.export_terms ctxt' lthy lhss' end
|
wenzelm@43231
|
193 |
|> map (Thm.cterm_of (Proof_Context.theory_of lthy)),
|
wenzelm@22236
|
194 |
proc = proc,
|
wenzelm@33593
|
195 |
identifier = identifier};
|
wenzelm@22201
|
196 |
in
|
wenzelm@46162
|
197 |
lthy |> Local_Theory.declaration {syntax = false, pervasive = false} (fn phi => fn context =>
|
wenzelm@22201
|
198 |
let
|
haftmann@28991
|
199 |
val b' = Morphism.binding phi b;
|
wenzelm@46161
|
200 |
val simproc' = transform_simproc phi simproc;
|
wenzelm@22201
|
201 |
in
|
wenzelm@43246
|
202 |
context
|
wenzelm@43336
|
203 |
|> Data.map (fn (ss, tab) =>
|
wenzelm@43336
|
204 |
(ss addsimprocs [simproc'],
|
wenzelm@43336
|
205 |
#2 (Name_Space.define (Context.proof_of context) true naming (b', simproc') tab)))
|
wenzelm@22201
|
206 |
end)
|
wenzelm@22201
|
207 |
end;
|
wenzelm@22201
|
208 |
|
wenzelm@22201
|
209 |
in
|
wenzelm@22201
|
210 |
|
wenzelm@43335
|
211 |
val def_simproc = gen_simproc Syntax.check_terms;
|
wenzelm@43335
|
212 |
val def_simproc_cmd = gen_simproc Syntax.read_terms;
|
wenzelm@22201
|
213 |
|
wenzelm@22201
|
214 |
end;
|
wenzelm@22201
|
215 |
|
wenzelm@22201
|
216 |
|
wenzelm@22201
|
217 |
|
wenzelm@17967
|
218 |
(** simplification tactics and rules **)
|
wenzelm@17967
|
219 |
|
wenzelm@17967
|
220 |
fun solve_all_tac solvers ss =
|
wenzelm@17967
|
221 |
let
|
wenzelm@41494
|
222 |
val (_, {subgoal_tac, ...}) = Raw_Simplifier.internal_ss ss;
|
wenzelm@41494
|
223 |
val solve_tac = subgoal_tac (Raw_Simplifier.set_solvers solvers ss) THEN_ALL_NEW (K no_tac);
|
wenzelm@17967
|
224 |
in DEPTH_SOLVE (solve_tac 1) end;
|
wenzelm@17967
|
225 |
|
wenzelm@17967
|
226 |
(*NOTE: may instantiate unknowns that appear also in other subgoals*)
|
wenzelm@17967
|
227 |
fun generic_simp_tac safe mode ss =
|
wenzelm@17967
|
228 |
let
|
wenzelm@41494
|
229 |
val (_, {loop_tacs, solvers = (unsafe_solvers, solvers), ...}) = Raw_Simplifier.internal_ss ss;
|
haftmann@21286
|
230 |
val loop_tac = FIRST' (map (fn (_, tac) => tac ss) (rev loop_tacs));
|
wenzelm@41494
|
231 |
val solve_tac = FIRST' (map (Raw_Simplifier.solver ss)
|
haftmann@22717
|
232 |
(rev (if safe then solvers else unsafe_solvers)));
|
wenzelm@17967
|
233 |
|
wenzelm@17967
|
234 |
fun simp_loop_tac i =
|
wenzelm@41507
|
235 |
Raw_Simplifier.asm_rewrite_goal_tac mode (solve_all_tac unsafe_solvers) ss i THEN
|
wenzelm@17967
|
236 |
(solve_tac i ORELSE TRY ((loop_tac THEN_ALL_NEW simp_loop_tac) i));
|
wenzelm@17967
|
237 |
in simp_loop_tac end;
|
wenzelm@17967
|
238 |
|
wenzelm@17967
|
239 |
local
|
wenzelm@17967
|
240 |
|
wenzelm@17967
|
241 |
fun simp rew mode ss thm =
|
wenzelm@17967
|
242 |
let
|
wenzelm@41494
|
243 |
val (_, {solvers = (unsafe_solvers, _), ...}) = Raw_Simplifier.internal_ss ss;
|
haftmann@22717
|
244 |
val tacf = solve_all_tac (rev unsafe_solvers);
|
wenzelm@17967
|
245 |
fun prover s th = Option.map #1 (Seq.pull (tacf s th));
|
wenzelm@17967
|
246 |
in rew mode prover ss thm end;
|
wenzelm@17967
|
247 |
|
wenzelm@17967
|
248 |
in
|
wenzelm@17967
|
249 |
|
wenzelm@41494
|
250 |
val simp_thm = simp Raw_Simplifier.rewrite_thm;
|
wenzelm@41494
|
251 |
val simp_cterm = simp Raw_Simplifier.rewrite_cterm;
|
wenzelm@17967
|
252 |
|
wenzelm@17967
|
253 |
end;
|
wenzelm@17967
|
254 |
|
wenzelm@17967
|
255 |
|
wenzelm@16806
|
256 |
(* tactics *)
|
wenzelm@16806
|
257 |
|
wenzelm@16014
|
258 |
val simp_tac = generic_simp_tac false (false, false, false);
|
wenzelm@16014
|
259 |
val asm_simp_tac = generic_simp_tac false (false, true, false);
|
wenzelm@16014
|
260 |
val full_simp_tac = generic_simp_tac false (true, false, false);
|
wenzelm@16014
|
261 |
val asm_lr_simp_tac = generic_simp_tac false (true, true, false);
|
wenzelm@16014
|
262 |
val asm_full_simp_tac = generic_simp_tac false (true, true, true);
|
wenzelm@16014
|
263 |
val safe_asm_full_simp_tac = generic_simp_tac true (true, true, true);
|
wenzelm@16014
|
264 |
|
wenzelm@16806
|
265 |
|
wenzelm@16806
|
266 |
(* conversions *)
|
wenzelm@16806
|
267 |
|
wenzelm@17967
|
268 |
val simplify = simp_thm (false, false, false);
|
wenzelm@17967
|
269 |
val asm_simplify = simp_thm (false, true, false);
|
wenzelm@17967
|
270 |
val full_simplify = simp_thm (true, false, false);
|
wenzelm@17967
|
271 |
val asm_lr_simplify = simp_thm (true, true, false);
|
wenzelm@17967
|
272 |
val asm_full_simplify = simp_thm (true, true, true);
|
wenzelm@16014
|
273 |
|
wenzelm@17967
|
274 |
val rewrite = simp_cterm (false, false, false);
|
wenzelm@17967
|
275 |
val asm_rewrite = simp_cterm (false, true, false);
|
wenzelm@17967
|
276 |
val full_rewrite = simp_cterm (true, false, false);
|
wenzelm@17967
|
277 |
val asm_lr_rewrite = simp_cterm (true, true, false);
|
wenzelm@17967
|
278 |
val asm_full_rewrite = simp_cterm (true, true, true);
|
wenzelm@16014
|
279 |
|
wenzelm@16014
|
280 |
|
wenzelm@16014
|
281 |
|
wenzelm@16014
|
282 |
(** concrete syntax of attributes **)
|
wenzelm@16014
|
283 |
|
wenzelm@16014
|
284 |
(* add / del *)
|
wenzelm@16014
|
285 |
|
wenzelm@16014
|
286 |
val simpN = "simp";
|
wenzelm@16014
|
287 |
val congN = "cong";
|
wenzelm@16014
|
288 |
val onlyN = "only";
|
wenzelm@16014
|
289 |
val no_asmN = "no_asm";
|
wenzelm@16014
|
290 |
val no_asm_useN = "no_asm_use";
|
wenzelm@16014
|
291 |
val no_asm_simpN = "no_asm_simp";
|
wenzelm@16014
|
292 |
val asm_lrN = "asm_lr";
|
wenzelm@16014
|
293 |
|
wenzelm@16014
|
294 |
|
wenzelm@24024
|
295 |
(* simprocs *)
|
wenzelm@24024
|
296 |
|
wenzelm@24024
|
297 |
local
|
wenzelm@24024
|
298 |
|
wenzelm@24024
|
299 |
val add_del =
|
wenzelm@24024
|
300 |
(Args.del -- Args.colon >> K (op delsimprocs) ||
|
wenzelm@24024
|
301 |
Scan.option (Args.add -- Args.colon) >> K (op addsimprocs))
|
wenzelm@24024
|
302 |
>> (fn f => fn simproc => fn phi => Thm.declaration_attribute
|
wenzelm@46161
|
303 |
(K (map_ss (fn ss => f (ss, [transform_simproc phi simproc])))));
|
wenzelm@24024
|
304 |
|
wenzelm@24024
|
305 |
in
|
wenzelm@24024
|
306 |
|
wenzelm@30530
|
307 |
val simproc_att =
|
wenzelm@43336
|
308 |
(Args.context -- Scan.lift add_del) :|-- (fn (ctxt, decl) =>
|
wenzelm@43336
|
309 |
Scan.repeat1 (Scan.lift (Args.named_attribute (decl o the_simproc ctxt o check_simproc ctxt))))
|
wenzelm@46246
|
310 |
>> (fn atts => Thm.declaration_attribute (fn th =>
|
wenzelm@46246
|
311 |
Library.apply (map (fn att => Thm.attribute_declaration (Morphism.form att) th) atts)));
|
wenzelm@24024
|
312 |
|
wenzelm@24024
|
313 |
end;
|
wenzelm@24124
|
314 |
|
wenzelm@24024
|
315 |
|
wenzelm@16014
|
316 |
(* conversions *)
|
wenzelm@16014
|
317 |
|
wenzelm@16014
|
318 |
local
|
wenzelm@16014
|
319 |
|
wenzelm@16014
|
320 |
fun conv_mode x =
|
wenzelm@16014
|
321 |
((Args.parens (Args.$$$ no_asmN) >> K simplify ||
|
wenzelm@16014
|
322 |
Args.parens (Args.$$$ no_asm_simpN) >> K asm_simplify ||
|
wenzelm@16014
|
323 |
Args.parens (Args.$$$ no_asm_useN) >> K full_simplify ||
|
wenzelm@16014
|
324 |
Scan.succeed asm_full_simplify) |> Scan.lift) x;
|
wenzelm@16014
|
325 |
|
wenzelm@16014
|
326 |
in
|
wenzelm@16014
|
327 |
|
wenzelm@30530
|
328 |
val simplified = conv_mode -- Attrib.thms >>
|
wenzelm@30530
|
329 |
(fn (f, ths) => Thm.rule_attribute (fn context =>
|
wenzelm@41494
|
330 |
f ((if null ths then I else Raw_Simplifier.clear_ss)
|
wenzelm@32148
|
331 |
(simpset_of (Context.proof_of context)) addsimps ths)));
|
wenzelm@16014
|
332 |
|
wenzelm@16014
|
333 |
end;
|
wenzelm@16014
|
334 |
|
wenzelm@16014
|
335 |
|
wenzelm@16014
|
336 |
(* setup attributes *)
|
wenzelm@16014
|
337 |
|
wenzelm@26463
|
338 |
val _ = Context.>> (Context.map_theory
|
wenzelm@30530
|
339 |
(Attrib.setup (Binding.name simpN) (Attrib.add_del simp_add simp_del)
|
wenzelm@30530
|
340 |
"declaration of Simplifier rewrite rule" #>
|
wenzelm@30530
|
341 |
Attrib.setup (Binding.name congN) (Attrib.add_del cong_add cong_del)
|
wenzelm@30530
|
342 |
"declaration of Simplifier congruence rule" #>
|
wenzelm@33673
|
343 |
Attrib.setup (Binding.name "simproc") simproc_att
|
wenzelm@33673
|
344 |
"declaration of simplification procedures" #>
|
wenzelm@30530
|
345 |
Attrib.setup (Binding.name "simplified") simplified "simplified rule"));
|
wenzelm@16014
|
346 |
|
wenzelm@16014
|
347 |
|
wenzelm@16014
|
348 |
|
wenzelm@31300
|
349 |
(** method syntax **)
|
wenzelm@16014
|
350 |
|
wenzelm@16014
|
351 |
val cong_modifiers =
|
wenzelm@18728
|
352 |
[Args.$$$ congN -- Args.colon >> K ((I, cong_add): Method.modifier),
|
wenzelm@18728
|
353 |
Args.$$$ congN -- Args.add -- Args.colon >> K (I, cong_add),
|
wenzelm@18728
|
354 |
Args.$$$ congN -- Args.del -- Args.colon >> K (I, cong_del)];
|
wenzelm@16014
|
355 |
|
wenzelm@16014
|
356 |
val simp_modifiers =
|
wenzelm@18728
|
357 |
[Args.$$$ simpN -- Args.colon >> K (I, simp_add),
|
wenzelm@18728
|
358 |
Args.$$$ simpN -- Args.add -- Args.colon >> K (I, simp_add),
|
wenzelm@18728
|
359 |
Args.$$$ simpN -- Args.del -- Args.colon >> K (I, simp_del),
|
wenzelm@17883
|
360 |
Args.$$$ simpN -- Args.$$$ onlyN -- Args.colon
|
wenzelm@41494
|
361 |
>> K (Context.proof_map (map_ss Raw_Simplifier.clear_ss), simp_add)]
|
wenzelm@16014
|
362 |
@ cong_modifiers;
|
wenzelm@16014
|
363 |
|
wenzelm@16014
|
364 |
val simp_modifiers' =
|
wenzelm@18728
|
365 |
[Args.add -- Args.colon >> K (I, simp_add),
|
wenzelm@18728
|
366 |
Args.del -- Args.colon >> K (I, simp_del),
|
wenzelm@18688
|
367 |
Args.$$$ onlyN -- Args.colon
|
wenzelm@41494
|
368 |
>> K (Context.proof_map (map_ss Raw_Simplifier.clear_ss), simp_add)]
|
wenzelm@16014
|
369 |
@ cong_modifiers;
|
wenzelm@16014
|
370 |
|
wenzelm@31300
|
371 |
val simp_options =
|
wenzelm@31300
|
372 |
(Args.parens (Args.$$$ no_asmN) >> K simp_tac ||
|
wenzelm@31300
|
373 |
Args.parens (Args.$$$ no_asm_simpN) >> K asm_simp_tac ||
|
wenzelm@31300
|
374 |
Args.parens (Args.$$$ no_asm_useN) >> K full_simp_tac ||
|
wenzelm@31300
|
375 |
Args.parens (Args.$$$ asm_lrN) >> K asm_lr_simp_tac ||
|
wenzelm@31300
|
376 |
Scan.succeed asm_full_simp_tac);
|
wenzelm@16014
|
377 |
|
wenzelm@31300
|
378 |
fun simp_method more_mods meth =
|
wenzelm@35613
|
379 |
Scan.lift simp_options --|
|
wenzelm@31300
|
380 |
Method.sections (more_mods @ simp_modifiers') >>
|
wenzelm@35613
|
381 |
(fn tac => fn ctxt => METHOD (fn facts => meth ctxt tac facts));
|
wenzelm@16014
|
382 |
|
wenzelm@16014
|
383 |
|
wenzelm@16014
|
384 |
|
wenzelm@18708
|
385 |
(** setup **)
|
wenzelm@18708
|
386 |
|
wenzelm@31300
|
387 |
fun method_setup more_mods =
|
wenzelm@31300
|
388 |
Method.setup (Binding.name simpN)
|
wenzelm@31300
|
389 |
(simp_method more_mods (fn ctxt => fn tac => fn facts =>
|
wenzelm@31300
|
390 |
HEADGOAL (Method.insert_tac facts THEN'
|
wenzelm@32148
|
391 |
(CHANGED_PROP oo tac) (simpset_of ctxt))))
|
wenzelm@31300
|
392 |
"simplification" #>
|
wenzelm@31300
|
393 |
Method.setup (Binding.name "simp_all")
|
wenzelm@31300
|
394 |
(simp_method more_mods (fn ctxt => fn tac => fn facts =>
|
wenzelm@31300
|
395 |
ALLGOALS (Method.insert_tac facts) THEN
|
wenzelm@43243
|
396 |
(CHANGED_PROP o PARALLEL_GOALS o ALLGOALS o tac) (simpset_of ctxt)))
|
wenzelm@31300
|
397 |
"simplification (all goals)";
|
wenzelm@16014
|
398 |
|
wenzelm@26497
|
399 |
fun easy_setup reflect trivs = method_setup [] #> Context.theory_map (map_ss (fn _ =>
|
wenzelm@16014
|
400 |
let
|
wenzelm@16014
|
401 |
val trivialities = Drule.reflexive_thm :: trivs;
|
wenzelm@16014
|
402 |
|
wenzelm@44470
|
403 |
fun unsafe_solver_tac ss =
|
wenzelm@44470
|
404 |
FIRST' [resolve_tac (trivialities @ Raw_Simplifier.prems_of ss), assume_tac];
|
wenzelm@16014
|
405 |
val unsafe_solver = mk_solver "easy unsafe" unsafe_solver_tac;
|
wenzelm@16014
|
406 |
|
wenzelm@16014
|
407 |
(*no premature instantiation of variables during simplification*)
|
wenzelm@44470
|
408 |
fun safe_solver_tac ss =
|
wenzelm@44470
|
409 |
FIRST' [match_tac (trivialities @ Raw_Simplifier.prems_of ss), eq_assume_tac];
|
wenzelm@16014
|
410 |
val safe_solver = mk_solver "easy safe" safe_solver_tac;
|
wenzelm@16014
|
411 |
|
wenzelm@16014
|
412 |
fun mk_eq thm =
|
wenzelm@20872
|
413 |
if can Logic.dest_equals (Thm.concl_of thm) then [thm]
|
wenzelm@16014
|
414 |
else [thm RS reflect] handle THM _ => [];
|
wenzelm@16014
|
415 |
|
wenzelm@44937
|
416 |
fun mksimps thm = mk_eq (Thm.forall_elim_vars (Thm.maxidx_of thm + 1) thm);
|
wenzelm@26497
|
417 |
in
|
wenzelm@26497
|
418 |
empty_ss setsubgoaler asm_simp_tac
|
wenzelm@26497
|
419 |
setSSolver safe_solver
|
wenzelm@26497
|
420 |
setSolver unsafe_solver
|
wenzelm@36543
|
421 |
setmksimps (K mksimps)
|
wenzelm@26497
|
422 |
end));
|
wenzelm@16014
|
423 |
|
wenzelm@16014
|
424 |
end;
|
wenzelm@16014
|
425 |
|
wenzelm@32738
|
426 |
structure Basic_Simplifier: BASIC_SIMPLIFIER = Simplifier;
|
wenzelm@32738
|
427 |
open Basic_Simplifier;
|