author | wenzelm |
Wed, 29 Apr 1998 11:30:55 +0200 | |
changeset 4855 | 62bc389d6168 |
parent 4795 | 721b532ada7a |
child 5001 | 9de7fda0a6df |
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 |
|
4795 | 5 |
Generic simplifier, suitable for most logics. See Pure/thm.ML for the |
6 |
actual meta-level rewriting engine. |
|
1 | 7 |
*) |
1260 | 8 |
|
3551 | 9 |
infix 4 |
4682 | 10 |
setsubgoaler setloop addloop delloop setSSolver addSSolver setSolver |
4677 | 11 |
addSolver addsimps delsimps addeqcongs deleqcongs |
12 |
setmksimps setmkeqTrue setmksym settermless addsimprocs delsimprocs; |
|
2567 | 13 |
|
4795 | 14 |
signature BASIC_SIMPLIFIER = |
0 | 15 |
sig |
2509 | 16 |
type simproc |
3577
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
17 |
val mk_simproc: string -> cterm list |
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
18 |
-> (Sign.sg -> thm list -> term -> thm option) -> simproc |
0 | 19 |
type simpset |
2503 | 20 |
val empty_ss: simpset |
3551 | 21 |
val rep_ss: simpset -> |
22 |
{mss: meta_simpset, |
|
23 |
subgoal_tac: simpset -> int -> tactic, |
|
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
24 |
loop_tacs: (string * (int -> tactic))list, |
3551 | 25 |
finish_tac: thm list -> int -> tactic, |
26 |
unsafe_finish_tac: thm list -> int -> tactic}; |
|
27 |
val print_ss: simpset -> unit |
|
4366 | 28 |
val print_simpset: theory -> unit |
2629 | 29 |
val setsubgoaler: simpset * (simpset -> int -> tactic) -> simpset |
30 |
val setloop: simpset * (int -> tactic) -> simpset |
|
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
31 |
val addloop: simpset * (string * (int -> tactic)) -> simpset |
4682 | 32 |
val delloop: simpset * string -> simpset |
2629 | 33 |
val setSSolver: simpset * (thm list -> int -> tactic) -> simpset |
34 |
val addSSolver: simpset * (thm list -> int -> tactic) -> simpset |
|
35 |
val setSolver: simpset * (thm list -> int -> tactic) -> simpset |
|
36 |
val addSolver: simpset * (thm list -> int -> tactic) -> simpset |
|
3577
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
37 |
val setmksimps: simpset * (thm -> thm list) -> simpset |
4677 | 38 |
val setmkeqTrue: simpset * (thm -> thm option) -> simpset |
39 |
val setmksym: simpset * (thm -> thm option) -> simpset |
|
3577
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
40 |
val settermless: simpset * (term * term -> bool) -> simpset |
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
41 |
val addsimps: simpset * thm list -> simpset |
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
42 |
val delsimps: simpset * thm list -> simpset |
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
43 |
val addeqcongs: simpset * thm list -> simpset |
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
44 |
val deleqcongs: simpset * thm list -> simpset |
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
45 |
val addsimprocs: simpset * simproc list -> simpset |
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
46 |
val delsimprocs: simpset * simproc list -> simpset |
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
47 |
val merge_ss: simpset * simpset -> simpset |
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
48 |
val prems_of_ss: simpset -> thm list |
4080
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
49 |
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
|
50 |
val simpset_ref_of: theory -> simpset ref |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
51 |
val simpset_of_sg: Sign.sg -> simpset |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
52 |
val simpset_of: theory -> simpset |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
53 |
val SIMPSET: (simpset -> tactic) -> tactic |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
54 |
val SIMPSET': (simpset -> 'a -> tactic) -> 'a -> tactic |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
55 |
val simpset: unit -> simpset |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
56 |
val simpset_ref: unit -> simpset ref |
1243 | 57 |
val Addsimps: thm list -> unit |
58 |
val Delsimps: thm list -> unit |
|
2509 | 59 |
val Addsimprocs: simproc list -> unit |
60 |
val Delsimprocs: simproc list -> unit |
|
2629 | 61 |
val simp_tac: simpset -> int -> tactic |
62 |
val asm_simp_tac: simpset -> int -> tactic |
|
63 |
val full_simp_tac: simpset -> int -> tactic |
|
4722
d2e44673c21e
The new asm_lr_simp_tac is the old asm_full_simp_tac.
nipkow
parents:
4713
diff
changeset
|
64 |
val asm_lr_simp_tac: simpset -> int -> tactic |
2629 | 65 |
val asm_full_simp_tac: simpset -> int -> tactic |
66 |
val safe_asm_full_simp_tac: simpset -> int -> tactic |
|
67 |
val Simp_tac: int -> tactic |
|
68 |
val Asm_simp_tac: int -> tactic |
|
69 |
val Full_simp_tac: int -> tactic |
|
4722
d2e44673c21e
The new asm_lr_simp_tac is the old asm_full_simp_tac.
nipkow
parents:
4713
diff
changeset
|
70 |
val Asm_lr_simp_tac: int -> tactic |
2629 | 71 |
val Asm_full_simp_tac: int -> tactic |
3557 | 72 |
val simplify: simpset -> thm -> thm |
73 |
val asm_simplify: simpset -> thm -> thm |
|
74 |
val full_simplify: simpset -> thm -> thm |
|
75 |
val asm_full_simplify: simpset -> thm -> thm |
|
0 | 76 |
end; |
77 |
||
4795 | 78 |
signature SIMPLIFIER = |
79 |
sig |
|
80 |
include BASIC_SIMPLIFIER |
|
4855 | 81 |
val setup: (theory -> theory) list |
4795 | 82 |
val get_local_simpset: local_theory -> simpset |
83 |
val put_local_simpset: simpset -> local_theory -> local_theory |
|
84 |
val simp_add: tag |
|
85 |
val simp_del: tag |
|
4855 | 86 |
val simp_add_global: theory attribute |
87 |
val simp_del_global: theory attribute |
|
88 |
val simp_add_local: local_theory attribute |
|
89 |
val simp_del_local: local_theory attribute |
|
4795 | 90 |
end; |
2503 | 91 |
|
92 |
structure Simplifier: SIMPLIFIER = |
|
0 | 93 |
struct |
94 |
||
2509 | 95 |
|
96 |
(** simplification procedures **) |
|
97 |
||
98 |
(* datatype simproc *) |
|
99 |
||
100 |
datatype simproc = |
|
3577
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
101 |
Simproc of string * cterm list * (Sign.sg -> thm list -> term -> thm option) * stamp; |
2509 | 102 |
|
3557 | 103 |
fun mk_simproc name lhss proc = |
104 |
Simproc (name, map (Thm.cterm_fun Logic.varify) lhss, proc, stamp ()); |
|
105 |
||
3551 | 106 |
fun rep_simproc (Simproc args) = args; |
2509 | 107 |
|
108 |
||
109 |
||
2503 | 110 |
(** simplification sets **) |
111 |
||
112 |
(* type simpset *) |
|
113 |
||
0 | 114 |
datatype simpset = |
2503 | 115 |
Simpset of { |
116 |
mss: meta_simpset, |
|
2629 | 117 |
subgoal_tac: simpset -> int -> tactic, |
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
118 |
loop_tacs: (string * (int -> tactic))list, |
2629 | 119 |
finish_tac: thm list -> int -> tactic, |
120 |
unsafe_finish_tac: thm list -> int -> tactic}; |
|
2503 | 121 |
|
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
122 |
fun make_ss (mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac) = |
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
123 |
Simpset {mss = mss, subgoal_tac = subgoal_tac, loop_tacs = loop_tacs, |
2629 | 124 |
finish_tac = finish_tac, unsafe_finish_tac = unsafe_finish_tac}; |
0 | 125 |
|
126 |
val empty_ss = |
|
4677 | 127 |
let val mss = Thm.set_mk_sym(Thm.empty_mss, Some o symmetric_fun) |
128 |
in make_ss (mss, K (K no_tac), [], K (K no_tac), K (K no_tac)) end; |
|
3551 | 129 |
|
130 |
fun rep_ss (Simpset args) = args; |
|
131 |
fun prems_of_ss (Simpset {mss, ...}) = Thm.prems_of_mss mss; |
|
132 |
||
133 |
||
134 |
(* print simpsets *) |
|
2503 | 135 |
|
3551 | 136 |
fun print_ss ss = |
137 |
let |
|
138 |
val Simpset {mss, ...} = ss; |
|
139 |
val {simps, procs, congs} = Thm.dest_mss mss; |
|
2503 | 140 |
|
3551 | 141 |
val pretty_thms = map Display.pretty_thm; |
142 |
fun pretty_proc (name, lhss) = |
|
143 |
Pretty.big_list (name ^ ":") (map Display.pretty_cterm lhss); |
|
144 |
in |
|
145 |
Pretty.writeln (Pretty.big_list "simplification rules:" (pretty_thms simps)); |
|
146 |
Pretty.writeln (Pretty.big_list "simplification procedures:" (map pretty_proc procs)); |
|
147 |
Pretty.writeln (Pretty.big_list "congruences:" (pretty_thms congs)) |
|
148 |
end; |
|
2503 | 149 |
|
150 |
||
151 |
(* extend simpsets *) |
|
152 |
||
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
153 |
fun (Simpset {mss, subgoal_tac = _, loop_tacs, finish_tac, unsafe_finish_tac}) |
3551 | 154 |
setsubgoaler subgoal_tac = |
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
155 |
make_ss (mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac); |
2629 | 156 |
|
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
157 |
fun (Simpset {mss, subgoal_tac, loop_tacs = _, finish_tac, unsafe_finish_tac}) |
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
158 |
setloop tac = |
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
159 |
make_ss (mss, subgoal_tac, [("",tac)], finish_tac, unsafe_finish_tac); |
2503 | 160 |
|
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
161 |
fun (Simpset {mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac}) |
4741
7fcd106cb0ed
addloop: added warning in case of overwriting a looper
oheimb
parents:
4739
diff
changeset
|
162 |
addloop tac = make_ss (mss, subgoal_tac, |
7fcd106cb0ed
addloop: added warning in case of overwriting a looper
oheimb
parents:
4739
diff
changeset
|
163 |
(case assoc_string (loop_tacs,(fst tac)) of None => () | Some x => |
7fcd106cb0ed
addloop: added warning in case of overwriting a looper
oheimb
parents:
4739
diff
changeset
|
164 |
warning ("overwriting looper "^fst tac); overwrite(loop_tacs,tac)), |
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
165 |
finish_tac, unsafe_finish_tac); |
2567 | 166 |
|
4682 | 167 |
fun (ss as Simpset {mss,subgoal_tac,loop_tacs,finish_tac,unsafe_finish_tac}) |
168 |
delloop name = |
|
169 |
let val (del,rest) = partition (fn (n,_) => n=name) loop_tacs |
|
170 |
in if null del then (warning ("No such looper in simpset: " ^ name); ss) |
|
171 |
else make_ss (mss, subgoal_tac, rest, finish_tac, unsafe_finish_tac) |
|
172 |
end; |
|
173 |
||
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
174 |
fun (Simpset {mss, subgoal_tac, loop_tacs, finish_tac = _, unsafe_finish_tac}) |
3551 | 175 |
setSSolver finish_tac = |
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
176 |
make_ss (mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac); |
2503 | 177 |
|
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
178 |
fun (Simpset {mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac}) |
3551 | 179 |
addSSolver tac = |
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
180 |
make_ss (mss, subgoal_tac, loop_tacs, fn hyps => finish_tac hyps ORELSE' tac hyps, |
3551 | 181 |
unsafe_finish_tac); |
2503 | 182 |
|
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
183 |
fun (Simpset {mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac = _}) |
3551 | 184 |
setSolver unsafe_finish_tac = |
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
185 |
make_ss (mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac); |
2503 | 186 |
|
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
187 |
fun (Simpset {mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac}) |
3551 | 188 |
addSolver tac = |
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
189 |
make_ss (mss, subgoal_tac, loop_tacs, finish_tac, |
3551 | 190 |
fn hyps => unsafe_finish_tac hyps ORELSE' tac hyps); |
2503 | 191 |
|
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
192 |
fun (Simpset {mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac}) |
3551 | 193 |
setmksimps mk_simps = |
2645
9d3a3e62bf34
mk_rews: automatically includes strip_shyps, zero_var_indexes;
wenzelm
parents:
2629
diff
changeset
|
194 |
make_ss (Thm.set_mk_rews (mss, map (Thm.strip_shyps o Drule.zero_var_indexes) o mk_simps), |
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
195 |
subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac); |
2509 | 196 |
|
4677 | 197 |
fun (Simpset {mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac}) |
198 |
setmkeqTrue mk_eq_True = |
|
199 |
make_ss (Thm.set_mk_eq_True (mss, mk_eq_True), |
|
200 |
subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac); |
|
201 |
||
202 |
fun (Simpset {mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac}) |
|
203 |
setmksym mksym = |
|
204 |
make_ss (Thm.set_mk_sym (mss, mksym), |
|
205 |
subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac); |
|
206 |
||
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
207 |
fun (Simpset {mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac}) |
3551 | 208 |
settermless termless = |
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
209 |
make_ss (Thm.set_termless (mss, termless), subgoal_tac, loop_tacs, |
3551 | 210 |
finish_tac, unsafe_finish_tac); |
211 |
||
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
212 |
fun (Simpset {mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac}) |
3551 | 213 |
addsimps rews = |
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
214 |
make_ss (Thm.add_simps (mss, rews), subgoal_tac, loop_tacs, |
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
215 |
finish_tac, unsafe_finish_tac); |
2503 | 216 |
|
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
217 |
fun (Simpset {mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac}) |
3551 | 218 |
delsimps rews = |
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
219 |
make_ss (Thm.del_simps (mss, rews), subgoal_tac, loop_tacs, |
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
220 |
finish_tac, unsafe_finish_tac); |
2503 | 221 |
|
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
222 |
fun (Simpset {mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac}) |
3551 | 223 |
addeqcongs newcongs = |
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
224 |
make_ss (Thm.add_congs (mss, newcongs), subgoal_tac, loop_tacs, |
3551 | 225 |
finish_tac, unsafe_finish_tac); |
2509 | 226 |
|
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
227 |
fun (Simpset {mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac}) |
3551 | 228 |
deleqcongs oldcongs = |
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
229 |
make_ss (Thm.del_congs (mss, oldcongs), subgoal_tac, loop_tacs, |
3551 | 230 |
finish_tac, unsafe_finish_tac); |
2629 | 231 |
|
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
232 |
fun (Simpset {mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac}) |
3551 | 233 |
addsimprocs simprocs = |
234 |
make_ss |
|
235 |
(Thm.add_simprocs (mss, map rep_simproc simprocs), |
|
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
236 |
subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac); |
2509 | 237 |
|
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
238 |
fun (Simpset {mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac}) |
3551 | 239 |
delsimprocs simprocs = |
240 |
make_ss |
|
241 |
(Thm.del_simprocs (mss, map rep_simproc simprocs), |
|
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
242 |
subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac); |
2503 | 243 |
|
244 |
||
4795 | 245 |
(* merge simpsets *) (*NOTE: ignores tactics of 2nd simpset (except loopers)*) |
2503 | 246 |
|
3551 | 247 |
fun merge_ss |
4795 | 248 |
(Simpset {mss = mss1, loop_tacs = loop_tacs1, subgoal_tac, finish_tac, unsafe_finish_tac}, |
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
249 |
Simpset {mss = mss2, loop_tacs = loop_tacs2, ...}) = |
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
250 |
make_ss (Thm.merge_mss (mss1, mss2), subgoal_tac, |
4795 | 251 |
merge_alists loop_tacs1 loop_tacs2, finish_tac, unsafe_finish_tac); |
2503 | 252 |
|
253 |
||
3557 | 254 |
|
4795 | 255 |
(** simpset data **) |
4080
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
256 |
|
4784 | 257 |
val simpsetK = "Provers/simpset"; |
4795 | 258 |
|
259 |
||
260 |
(* global simpset ref *) |
|
261 |
||
262 |
exception SimpsetGlobal of simpset ref; |
|
4080
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
263 |
|
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
264 |
local |
4795 | 265 |
val empty = SimpsetGlobal (ref empty_ss); |
0 | 266 |
|
4080
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
267 |
(*create new reference*) |
4795 | 268 |
fun prep_ext (SimpsetGlobal (ref ss)) = SimpsetGlobal (ref ss); |
4080
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
269 |
|
4795 | 270 |
fun merge (SimpsetGlobal (ref ss1), SimpsetGlobal (ref ss2)) = |
271 |
SimpsetGlobal (ref (merge_ss (ss1, ss2))); |
|
4080
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
272 |
|
4795 | 273 |
fun print _ (SimpsetGlobal (ref ss)) = print_ss ss; |
4080
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
274 |
in |
4795 | 275 |
val setup_thy_data = Theory.init_data [(simpsetK, (empty, prep_ext, merge, print))]; |
4080
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
276 |
end; |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
277 |
|
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
278 |
|
4795 | 279 |
(* access global simpset *) |
0 | 280 |
|
4366 | 281 |
fun print_simpset thy = Display.print_data thy simpsetK; |
282 |
||
4080
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
283 |
fun simpset_ref_of_sg sg = |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
284 |
(case Sign.get_data sg simpsetK of |
4795 | 285 |
SimpsetGlobal r => r |
286 |
| _ => type_error simpsetK); |
|
4080
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 |
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
|
289 |
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
|
290 |
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
|
291 |
|
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
292 |
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
|
293 |
fun SIMPSET' tacf i state = tacf (simpset_of_sg (sign_of_thm state)) i state; |
0 | 294 |
|
4080
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
295 |
val simpset = simpset_of o Context.get_context; |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
296 |
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
|
297 |
|
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
298 |
|
4795 | 299 |
(* change global simpset *) |
4080
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
300 |
|
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
301 |
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
|
302 |
|
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
303 |
val Addsimps = change_simpset (op addsimps); |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
304 |
val Delsimps = change_simpset (op delsimps); |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
305 |
val Addsimprocs = change_simpset (op addsimprocs); |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
306 |
val Delsimprocs = change_simpset (op delsimprocs); |
2509 | 307 |
|
0 | 308 |
|
4795 | 309 |
(* local simpset *) |
310 |
||
311 |
exception SimpsetLocal of simpset; |
|
312 |
||
313 |
fun get_local_simpset (thy, data) = |
|
314 |
(case Symtab.lookup (data, simpsetK) of |
|
315 |
Some (SimpsetLocal ss) => ss |
|
316 |
| None => simpset_of thy |
|
317 |
| _ => type_error simpsetK); |
|
318 |
||
319 |
fun put_local_simpset ss (thy, data) = |
|
320 |
(thy, Symtab.update ((simpsetK, SimpsetLocal ss), data)); |
|
321 |
||
322 |
||
323 |
||
324 |
(** simplifier attributes **) |
|
325 |
||
326 |
(* tags *) |
|
327 |
||
4855 | 328 |
val simpN = "simp"; |
329 |
val simp_addN = "add"; |
|
330 |
val simp_delN = "del"; |
|
331 |
||
332 |
val simp_tag = (simpN, []); |
|
333 |
val simp_add = (simpN, [simp_addN]); |
|
334 |
val simp_del = (simpN, [simp_delN]); |
|
4795 | 335 |
|
336 |
||
4855 | 337 |
(* attributes *) |
4795 | 338 |
|
4855 | 339 |
local |
340 |
fun simp_attr change args (x, tth) = |
|
341 |
if null args orelse args = [simp_addN] then change (op addsimps) (x, tth) |
|
342 |
else if args = [simp_delN] then change (op delsimps) (x, tth) |
|
343 |
else Attribute.fail simpN ("bad argument(s) " ^ commas_quote args); |
|
344 |
||
345 |
fun change_global_ss f (thy, tth) = |
|
346 |
let val r = simpset_ref_of thy |
|
347 |
in r := f (! r, [Attribute.thm_of tth]); (thy, tth) end; |
|
4795 | 348 |
|
4855 | 349 |
fun change_local_ss f (lthy, tth) = |
350 |
let val ss = f (get_local_simpset lthy, [Attribute.thm_of tth]) |
|
351 |
in (put_local_simpset ss lthy, tth) end; |
|
4795 | 352 |
|
4855 | 353 |
val simp_attr_global = simp_attr change_global_ss; |
354 |
val simp_attr_local = simp_attr change_local_ss; |
|
355 |
in |
|
356 |
val setup_attrs = Attribute.add_attrs [(simpN, (simp_attr_global, simp_attr_local))]; |
|
4795 | 357 |
|
4855 | 358 |
val simp_add_global = simp_attr_global [simp_addN]; |
359 |
val simp_del_global = simp_attr_global [simp_delN]; |
|
360 |
val simp_add_local = simp_attr_local [simp_addN]; |
|
361 |
val simp_del_local = simp_attr_local [simp_delN]; |
|
362 |
end; |
|
4795 | 363 |
|
364 |
||
3557 | 365 |
|
2503 | 366 |
(** simplification tactics **) |
0 | 367 |
|
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
368 |
fun solve_all_tac (subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac) mss = |
3557 | 369 |
let |
370 |
val ss = |
|
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
371 |
make_ss (mss, subgoal_tac, loop_tacs, unsafe_finish_tac, unsafe_finish_tac); |
4612 | 372 |
val solve1_tac = (subgoal_tac ss THEN_ALL_NEW (K no_tac)) 1 |
3557 | 373 |
in DEPTH_SOLVE solve1_tac end; |
374 |
||
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
375 |
fun loop_tac loop_tacs = FIRST'(map snd loop_tacs); |
3557 | 376 |
|
2629 | 377 |
(*not totally safe: may instantiate unknowns that appear also in other subgoals*) |
378 |
fun basic_gen_simp_tac mode = |
|
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
379 |
fn (Simpset {mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac}) => |
3551 | 380 |
let |
4612 | 381 |
fun simp_loop_tac i = |
382 |
asm_rewrite_goal_tac mode |
|
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
383 |
(solve_all_tac (subgoal_tac,loop_tacs,finish_tac,unsafe_finish_tac)) |
4612 | 384 |
mss i |
385 |
THEN (finish_tac (prems_of_mss mss) i ORELSE |
|
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
386 |
TRY ((loop_tac loop_tacs THEN_ALL_NEW simp_loop_tac) i)) |
4612 | 387 |
in simp_loop_tac end; |
0 | 388 |
|
3551 | 389 |
fun gen_simp_tac mode (ss as Simpset {unsafe_finish_tac, ...}) = |
390 |
basic_gen_simp_tac mode (ss setSSolver unsafe_finish_tac); |
|
391 |
||
4713 | 392 |
val simp_tac = gen_simp_tac (false, false, false); |
393 |
val asm_simp_tac = gen_simp_tac (false, true, false); |
|
394 |
val full_simp_tac = gen_simp_tac (true, false, false); |
|
4722
d2e44673c21e
The new asm_lr_simp_tac is the old asm_full_simp_tac.
nipkow
parents:
4713
diff
changeset
|
395 |
val asm_lr_simp_tac = gen_simp_tac (true, true, false); |
d2e44673c21e
The new asm_lr_simp_tac is the old asm_full_simp_tac.
nipkow
parents:
4713
diff
changeset
|
396 |
val asm_full_simp_tac = gen_simp_tac (true, true, true); |
0 | 397 |
|
2629 | 398 |
(*not totally safe: may instantiate unknowns that appear also in other subgoals*) |
4713 | 399 |
val safe_asm_full_simp_tac = basic_gen_simp_tac (true, true, false); |
2629 | 400 |
|
4795 | 401 |
(*the abstraction over the proof state delays the dereferencing*) |
4080
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
402 |
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
|
403 |
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
|
404 |
fun Full_simp_tac i st = full_simp_tac (simpset ()) i st; |
4722
d2e44673c21e
The new asm_lr_simp_tac is the old asm_full_simp_tac.
nipkow
parents:
4713
diff
changeset
|
405 |
fun Asm_lr_simp_tac i st = asm_lr_simp_tac (simpset ()) i st; |
4080
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
406 |
fun Asm_full_simp_tac i st = asm_full_simp_tac (simpset ()) i st; |
406 | 407 |
|
3557 | 408 |
|
4795 | 409 |
|
3557 | 410 |
(** simplification meta rules **) |
411 |
||
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
412 |
fun simp mode (Simpset {mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac}) thm = |
3557 | 413 |
let |
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
414 |
val tacf = solve_all_tac (subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac); |
4271
3a82492e70c5
changed Pure/Sequence interface -- isatool fixseq;
wenzelm
parents:
4259
diff
changeset
|
415 |
fun prover m th = apsome fst (Seq.pull (tacf m th)); |
3557 | 416 |
in |
417 |
Drule.rewrite_thm mode prover mss thm |
|
418 |
end; |
|
419 |
||
4713 | 420 |
val simplify = simp (false, false, false); |
421 |
val asm_simplify = simp (false, true, false); |
|
422 |
val full_simplify = simp (true, false, false); |
|
423 |
val asm_full_simplify = simp (true, true, false); |
|
3557 | 424 |
|
425 |
||
4795 | 426 |
|
427 |
(** theory setup **) |
|
428 |
||
4855 | 429 |
val setup = [setup_thy_data, setup_attrs]; |
4795 | 430 |
|
431 |
||
1243 | 432 |
end; |
4795 | 433 |
|
434 |
||
435 |
structure BasicSimplifier: BASIC_SIMPLIFIER = Simplifier; |
|
436 |
open BasicSimplifier; |