author | wenzelm |
Wed, 15 Mar 2000 18:36:53 +0100 | |
changeset 8467 | 58dbeea60bb8 |
parent 8382 | 52d5fae273dd |
child 8634 | 3f34637cb9c0 |
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 |
7568 | 19 |
type solver |
20 |
val mk_solver: string -> (thm list -> int -> tactic) -> solver |
|
0 | 21 |
type simpset |
2503 | 22 |
val empty_ss: simpset |
3551 | 23 |
val rep_ss: simpset -> |
24 |
{mss: meta_simpset, |
|
25 |
subgoal_tac: simpset -> int -> tactic, |
|
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
26 |
loop_tacs: (string * (int -> tactic))list, |
7568 | 27 |
unsafe_solvers: solver list, |
28 |
solvers: solver list}; |
|
3551 | 29 |
val print_ss: simpset -> unit |
4366 | 30 |
val print_simpset: theory -> unit |
2629 | 31 |
val setsubgoaler: simpset * (simpset -> int -> tactic) -> simpset |
32 |
val setloop: simpset * (int -> tactic) -> simpset |
|
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
33 |
val addloop: simpset * (string * (int -> tactic)) -> simpset |
4682 | 34 |
val delloop: simpset * string -> simpset |
7568 | 35 |
val setSSolver: simpset * solver -> simpset |
36 |
val addSSolver: simpset * solver -> simpset |
|
37 |
val setSolver: simpset * solver -> simpset |
|
38 |
val addSolver: simpset * solver -> simpset |
|
3577
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
39 |
val setmksimps: simpset * (thm -> thm list) -> simpset |
4677 | 40 |
val setmkeqTrue: simpset * (thm -> thm option) -> simpset |
41 |
val setmksym: simpset * (thm -> thm option) -> simpset |
|
3577
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
42 |
val settermless: simpset * (term * term -> bool) -> simpset |
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
43 |
val addsimps: simpset * thm list -> simpset |
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
44 |
val delsimps: simpset * thm list -> simpset |
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
45 |
val addeqcongs: simpset * thm list -> simpset |
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
46 |
val deleqcongs: simpset * thm list -> simpset |
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
47 |
val addsimprocs: simpset * simproc list -> simpset |
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
48 |
val delsimprocs: simpset * simproc list -> simpset |
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
49 |
val merge_ss: simpset * simpset -> simpset |
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
50 |
val prems_of_ss: simpset -> thm list |
4080
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
51 |
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
|
52 |
val simpset_ref_of: theory -> simpset ref |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
53 |
val simpset_of_sg: Sign.sg -> simpset |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
54 |
val simpset_of: theory -> simpset |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
55 |
val SIMPSET: (simpset -> tactic) -> tactic |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
56 |
val SIMPSET': (simpset -> 'a -> tactic) -> 'a -> tactic |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
57 |
val simpset: unit -> simpset |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
58 |
val simpset_ref: unit -> simpset ref |
1243 | 59 |
val Addsimps: thm list -> unit |
60 |
val Delsimps: thm list -> unit |
|
2509 | 61 |
val Addsimprocs: simproc list -> unit |
62 |
val Delsimprocs: simproc list -> unit |
|
2629 | 63 |
val simp_tac: simpset -> int -> tactic |
64 |
val asm_simp_tac: simpset -> int -> tactic |
|
65 |
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
|
66 |
val asm_lr_simp_tac: simpset -> int -> tactic |
2629 | 67 |
val asm_full_simp_tac: simpset -> int -> tactic |
68 |
val safe_asm_full_simp_tac: simpset -> int -> tactic |
|
69 |
val Simp_tac: int -> tactic |
|
70 |
val Asm_simp_tac: int -> tactic |
|
71 |
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
|
72 |
val Asm_lr_simp_tac: int -> tactic |
2629 | 73 |
val Asm_full_simp_tac: int -> tactic |
3557 | 74 |
val simplify: simpset -> thm -> thm |
75 |
val asm_simplify: simpset -> thm -> thm |
|
76 |
val full_simplify: simpset -> thm -> thm |
|
77 |
val asm_full_simplify: simpset -> thm -> thm |
|
0 | 78 |
end; |
79 |
||
4795 | 80 |
signature SIMPLIFIER = |
81 |
sig |
|
82 |
include BASIC_SIMPLIFIER |
|
5082 | 83 |
val rewrite: simpset -> cterm -> thm |
84 |
val asm_rewrite: simpset -> cterm -> thm |
|
85 |
val full_rewrite: simpset -> cterm -> thm |
|
86 |
val asm_full_rewrite: simpset -> cterm -> thm |
|
5842 | 87 |
val print_local_simpset: Proof.context -> unit |
88 |
val get_local_simpset: Proof.context -> simpset |
|
89 |
val put_local_simpset: simpset -> Proof.context -> Proof.context |
|
8467 | 90 |
val change_global_ss: (simpset * thm list -> simpset) -> theory attribute |
91 |
val change_local_ss: (simpset * thm list -> simpset) -> Proof.context attribute |
|
4855 | 92 |
val simp_add_global: theory attribute |
93 |
val simp_del_global: theory attribute |
|
5842 | 94 |
val simp_add_local: Proof.context attribute |
95 |
val simp_del_local: Proof.context attribute |
|
7177 | 96 |
val change_simpset_of: (simpset * 'a -> simpset) -> 'a -> theory -> theory |
7273 | 97 |
val simp_modifiers: (Args.T list -> (Method.modifier * Args.T list)) list |
5842 | 98 |
val setup: (theory -> theory) list |
8467 | 99 |
val method_setup: (Args.T list -> (Method.modifier * Args.T list)) list |
100 |
-> (theory -> theory) list |
|
8228 | 101 |
val easy_setup: thm -> thm list -> (theory -> theory) list |
4795 | 102 |
end; |
2503 | 103 |
|
104 |
structure Simplifier: SIMPLIFIER = |
|
0 | 105 |
struct |
106 |
||
2509 | 107 |
|
108 |
(** simplification procedures **) |
|
109 |
||
110 |
(* datatype simproc *) |
|
111 |
||
112 |
datatype simproc = |
|
3577
9715b6e3ec5f
added prems argument to simplification procedures;
wenzelm
parents:
3557
diff
changeset
|
113 |
Simproc of string * cterm list * (Sign.sg -> thm list -> term -> thm option) * stamp; |
2509 | 114 |
|
3557 | 115 |
fun mk_simproc name lhss proc = |
116 |
Simproc (name, map (Thm.cterm_fun Logic.varify) lhss, proc, stamp ()); |
|
117 |
||
3551 | 118 |
fun rep_simproc (Simproc args) = args; |
2509 | 119 |
|
8467 | 120 |
|
121 |
||
7568 | 122 |
(** solvers **) |
2509 | 123 |
|
7568 | 124 |
datatype solver = Solver of string * (thm list -> int -> tactic) * stamp; |
125 |
||
126 |
fun mk_solver name solver = Solver(name, solver, stamp()); |
|
127 |
||
128 |
fun eq_solver (Solver(_,_,s1),Solver(_,_,s2)) = s1=s2; |
|
129 |
||
130 |
val merge_solvers = generic_merge eq_solver I I; |
|
131 |
||
132 |
fun app_sols [] _ _ = no_tac |
|
133 |
| app_sols (Solver(_,solver,_)::sols) thms i = |
|
134 |
solver thms i ORELSE app_sols sols thms i; |
|
2509 | 135 |
|
8467 | 136 |
|
137 |
||
2503 | 138 |
(** simplification sets **) |
139 |
||
140 |
(* type simpset *) |
|
141 |
||
0 | 142 |
datatype simpset = |
2503 | 143 |
Simpset of { |
144 |
mss: meta_simpset, |
|
2629 | 145 |
subgoal_tac: simpset -> int -> tactic, |
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
146 |
loop_tacs: (string * (int -> tactic))list, |
7568 | 147 |
unsafe_solvers: solver list, |
148 |
solvers: solver list}; |
|
2503 | 149 |
|
7568 | 150 |
fun make_ss (mss, subgoal_tac, loop_tacs, unsafe_solvers, solvers) = |
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
151 |
Simpset {mss = mss, subgoal_tac = subgoal_tac, loop_tacs = loop_tacs, |
7568 | 152 |
unsafe_solvers = unsafe_solvers, solvers = solvers}; |
0 | 153 |
|
154 |
val empty_ss = |
|
6911 | 155 |
let val mss = Thm.set_mk_sym (Thm.empty_mss, Some o symmetric_fun) |
7568 | 156 |
in make_ss (mss, K (K no_tac), [], [], []) end; |
3551 | 157 |
|
158 |
fun rep_ss (Simpset args) = args; |
|
159 |
fun prems_of_ss (Simpset {mss, ...}) = Thm.prems_of_mss mss; |
|
160 |
||
161 |
||
162 |
(* print simpsets *) |
|
2503 | 163 |
|
3551 | 164 |
fun print_ss ss = |
165 |
let |
|
166 |
val Simpset {mss, ...} = ss; |
|
167 |
val {simps, procs, congs} = Thm.dest_mss mss; |
|
2503 | 168 |
|
3551 | 169 |
val pretty_thms = map Display.pretty_thm; |
170 |
fun pretty_proc (name, lhss) = |
|
171 |
Pretty.big_list (name ^ ":") (map Display.pretty_cterm lhss); |
|
172 |
in |
|
173 |
Pretty.writeln (Pretty.big_list "simplification rules:" (pretty_thms simps)); |
|
174 |
Pretty.writeln (Pretty.big_list "simplification procedures:" (map pretty_proc procs)); |
|
175 |
Pretty.writeln (Pretty.big_list "congruences:" (pretty_thms congs)) |
|
176 |
end; |
|
2503 | 177 |
|
178 |
||
179 |
(* extend simpsets *) |
|
180 |
||
7568 | 181 |
fun (Simpset {mss, subgoal_tac = _, loop_tacs, unsafe_solvers, solvers}) |
3551 | 182 |
setsubgoaler subgoal_tac = |
7568 | 183 |
make_ss (mss, subgoal_tac, loop_tacs, unsafe_solvers, solvers); |
2629 | 184 |
|
7568 | 185 |
fun (Simpset {mss, subgoal_tac, loop_tacs = _, unsafe_solvers, solvers}) |
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
186 |
setloop tac = |
7568 | 187 |
make_ss (mss, subgoal_tac, [("",tac)], unsafe_solvers, solvers); |
2503 | 188 |
|
7568 | 189 |
fun (Simpset {mss, subgoal_tac, loop_tacs, unsafe_solvers, solvers}) |
4741
7fcd106cb0ed
addloop: added warning in case of overwriting a looper
oheimb
parents:
4739
diff
changeset
|
190 |
addloop tac = make_ss (mss, subgoal_tac, |
5886 | 191 |
(case assoc_string (loop_tacs,(fst tac)) of None => () | Some x => |
192 |
warning ("overwriting looper "^fst tac); overwrite(loop_tacs,tac)), |
|
7568 | 193 |
unsafe_solvers, solvers); |
2567 | 194 |
|
7568 | 195 |
fun (ss as Simpset {mss, subgoal_tac, loop_tacs, unsafe_solvers, solvers}) |
7214
381d6987f68d
exchanged finish_tac and unsafe_finish_tac (the more important one) in simpset
oheimb
parents:
7177
diff
changeset
|
196 |
delloop name = |
6911 | 197 |
let val (del, rest) = partition (fn (n, _) => n = name) loop_tacs in |
198 |
if null del then (warning ("No such looper in simpset: " ^ name); ss) |
|
7568 | 199 |
else make_ss (mss, subgoal_tac, rest, unsafe_solvers, solvers) |
4682 | 200 |
end; |
201 |
||
7568 | 202 |
fun (Simpset {mss, subgoal_tac, loop_tacs, unsafe_solvers, ...}) |
203 |
setSSolver solver = |
|
204 |
make_ss (mss, subgoal_tac, loop_tacs, unsafe_solvers, [solver]); |
|
2503 | 205 |
|
7568 | 206 |
fun (Simpset {mss, subgoal_tac, loop_tacs, unsafe_solvers, solvers}) |
207 |
addSSolver sol = |
|
208 |
make_ss (mss, subgoal_tac, loop_tacs, unsafe_solvers, |
|
209 |
merge_solvers solvers [sol]); |
|
2503 | 210 |
|
7568 | 211 |
fun (Simpset {mss, subgoal_tac, loop_tacs, unsafe_solvers = _, solvers}) |
212 |
setSolver unsafe_solver = |
|
213 |
make_ss (mss, subgoal_tac, loop_tacs, [unsafe_solver], solvers); |
|
214 |
||
215 |
fun (Simpset {mss, subgoal_tac, loop_tacs, unsafe_solvers, solvers}) |
|
216 |
addSolver sol = |
|
7214
381d6987f68d
exchanged finish_tac and unsafe_finish_tac (the more important one) in simpset
oheimb
parents:
7177
diff
changeset
|
217 |
make_ss (mss, subgoal_tac, loop_tacs, |
7568 | 218 |
merge_solvers unsafe_solvers [sol], solvers); |
2503 | 219 |
|
7568 | 220 |
fun (Simpset {mss, subgoal_tac, loop_tacs, unsafe_solvers, solvers}) |
3551 | 221 |
setmksimps mk_simps = |
7646
1ad3866b86cc
mk_simps: do *not* include Thm.strip_shyps o Drule.zero_var_indexes
wenzelm
parents:
7571
diff
changeset
|
222 |
make_ss (Thm.set_mk_rews (mss, mk_simps), subgoal_tac, loop_tacs, unsafe_solvers, solvers); |
2509 | 223 |
|
7568 | 224 |
fun (Simpset {mss, subgoal_tac, loop_tacs, unsafe_solvers, solvers}) |
4677 | 225 |
setmkeqTrue mk_eq_True = |
226 |
make_ss (Thm.set_mk_eq_True (mss, mk_eq_True), |
|
7568 | 227 |
subgoal_tac, loop_tacs, unsafe_solvers, solvers); |
4677 | 228 |
|
7568 | 229 |
fun (Simpset {mss, subgoal_tac, loop_tacs, unsafe_solvers, solvers}) |
4677 | 230 |
setmksym mksym = |
231 |
make_ss (Thm.set_mk_sym (mss, mksym), |
|
7568 | 232 |
subgoal_tac, loop_tacs, unsafe_solvers, solvers); |
4677 | 233 |
|
7568 | 234 |
fun (Simpset {mss, subgoal_tac, loop_tacs, unsafe_solvers, solvers}) |
3551 | 235 |
settermless termless = |
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
236 |
make_ss (Thm.set_termless (mss, termless), subgoal_tac, loop_tacs, |
7568 | 237 |
unsafe_solvers, solvers); |
3551 | 238 |
|
7568 | 239 |
fun (Simpset {mss, subgoal_tac, loop_tacs, unsafe_solvers, solvers}) |
3551 | 240 |
addsimps rews = |
7214
381d6987f68d
exchanged finish_tac and unsafe_finish_tac (the more important one) in simpset
oheimb
parents:
7177
diff
changeset
|
241 |
make_ss (Thm.add_simps (mss, rews), subgoal_tac, loop_tacs, |
7568 | 242 |
unsafe_solvers, solvers); |
2503 | 243 |
|
7568 | 244 |
fun (Simpset {mss, subgoal_tac, loop_tacs, unsafe_solvers, solvers}) |
3551 | 245 |
delsimps rews = |
7214
381d6987f68d
exchanged finish_tac and unsafe_finish_tac (the more important one) in simpset
oheimb
parents:
7177
diff
changeset
|
246 |
make_ss (Thm.del_simps (mss, rews), subgoal_tac, loop_tacs, |
7568 | 247 |
unsafe_solvers, solvers); |
2503 | 248 |
|
7568 | 249 |
fun (Simpset {mss, subgoal_tac, loop_tacs, unsafe_solvers, solvers}) |
3551 | 250 |
addeqcongs newcongs = |
7214
381d6987f68d
exchanged finish_tac and unsafe_finish_tac (the more important one) in simpset
oheimb
parents:
7177
diff
changeset
|
251 |
make_ss (Thm.add_congs (mss, newcongs), subgoal_tac, loop_tacs, |
7568 | 252 |
unsafe_solvers, solvers); |
2509 | 253 |
|
7568 | 254 |
fun (Simpset {mss, subgoal_tac, loop_tacs, unsafe_solvers, solvers}) |
3551 | 255 |
deleqcongs oldcongs = |
7214
381d6987f68d
exchanged finish_tac and unsafe_finish_tac (the more important one) in simpset
oheimb
parents:
7177
diff
changeset
|
256 |
make_ss (Thm.del_congs (mss, oldcongs), subgoal_tac, loop_tacs, |
7568 | 257 |
unsafe_solvers, solvers); |
2629 | 258 |
|
7568 | 259 |
fun (Simpset {mss, subgoal_tac, loop_tacs, unsafe_solvers, solvers}) |
3551 | 260 |
addsimprocs simprocs = |
261 |
make_ss |
|
262 |
(Thm.add_simprocs (mss, map rep_simproc simprocs), |
|
7568 | 263 |
subgoal_tac, loop_tacs, unsafe_solvers, solvers); |
2509 | 264 |
|
7568 | 265 |
fun (Simpset {mss, subgoal_tac, loop_tacs, unsafe_solvers, solvers}) |
3551 | 266 |
delsimprocs simprocs = |
267 |
make_ss |
|
268 |
(Thm.del_simprocs (mss, map rep_simproc simprocs), |
|
7568 | 269 |
subgoal_tac, loop_tacs, unsafe_solvers, solvers); |
2503 | 270 |
|
8467 | 271 |
fun clear_ss (Simpset {mss, subgoal_tac, loop_tacs = _, unsafe_solvers, solvers}) = |
272 |
make_ss (Thm.clear_mss mss, subgoal_tac, [], unsafe_solvers, solvers); |
|
6911 | 273 |
|
2503 | 274 |
|
7568 | 275 |
(* merge simpsets *) |
8467 | 276 |
|
277 |
(*ignores subgoal_tac of 2nd simpset!*) |
|
2503 | 278 |
|
3551 | 279 |
fun merge_ss |
7568 | 280 |
(Simpset {mss = mss1, loop_tacs = loop_tacs1, subgoal_tac, |
281 |
unsafe_solvers = unsafe_solvers1, solvers = solvers1}, |
|
282 |
Simpset {mss = mss2, loop_tacs = loop_tacs2, |
|
283 |
unsafe_solvers = unsafe_solvers2, solvers = solvers2, ...}) = |
|
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
284 |
make_ss (Thm.merge_mss (mss1, mss2), subgoal_tac, |
7568 | 285 |
merge_alists loop_tacs1 loop_tacs2, |
286 |
merge_solvers unsafe_solvers1 unsafe_solvers2, |
|
287 |
merge_solvers solvers1 solvers2); |
|
2503 | 288 |
|
3557 | 289 |
|
8467 | 290 |
|
5024 | 291 |
(** global and local simpset data **) |
4080
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
292 |
|
5842 | 293 |
(* theory data kind 'Provers/simpset' *) |
4795 | 294 |
|
5842 | 295 |
structure GlobalSimpsetArgs = |
5024 | 296 |
struct |
5842 | 297 |
val name = "Provers/simpset"; |
5024 | 298 |
type T = simpset ref; |
0 | 299 |
|
5024 | 300 |
val empty = ref empty_ss; |
6556 | 301 |
fun copy (ref ss) = (ref ss): T; (*create new reference!*) |
302 |
val prep_ext = copy; |
|
5024 | 303 |
fun merge (ref ss1, ref ss2) = ref (merge_ss (ss1, ss2)); |
304 |
fun print _ (ref ss) = print_ss ss; |
|
305 |
end; |
|
4080
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
306 |
|
5842 | 307 |
structure GlobalSimpset = TheoryDataFun(GlobalSimpsetArgs); |
308 |
val print_simpset = GlobalSimpset.print; |
|
309 |
val simpset_ref_of_sg = GlobalSimpset.get_sg; |
|
310 |
val simpset_ref_of = GlobalSimpset.get; |
|
4080
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
311 |
|
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
312 |
|
4795 | 313 |
(* access global simpset *) |
0 | 314 |
|
4080
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
315 |
val simpset_of_sg = ! o simpset_ref_of_sg; |
6391 | 316 |
val simpset_of = simpset_of_sg o Theory.sign_of; |
4080
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
317 |
|
6391 | 318 |
fun SIMPSET tacf state = tacf (simpset_of_sg (Thm.sign_of_thm state)) state; |
319 |
fun SIMPSET' tacf i state = tacf (simpset_of_sg (Thm.sign_of_thm state)) i state; |
|
0 | 320 |
|
5028 | 321 |
val simpset = simpset_of o Context.the_context; |
6391 | 322 |
val simpset_ref = simpset_ref_of_sg o Theory.sign_of o Context.the_context; |
4080
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
323 |
|
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
324 |
|
4795 | 325 |
(* change global simpset *) |
4080
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
326 |
|
7177 | 327 |
fun change_simpset_of f x thy = |
328 |
let val r = simpset_ref_of thy |
|
329 |
in r := f (! r, x); thy end; |
|
330 |
||
331 |
fun change_simpset f x = (change_simpset_of f x (Context.the_context ()); ()); |
|
4080
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
332 |
|
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
333 |
val Addsimps = change_simpset (op addsimps); |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
334 |
val Delsimps = change_simpset (op delsimps); |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
335 |
val Addsimprocs = change_simpset (op addsimprocs); |
7dce11095b0a
new implicit simpset mechanism based on Sign.sg anytype data;
wenzelm
parents:
3728
diff
changeset
|
336 |
val Delsimprocs = change_simpset (op delsimprocs); |
2509 | 337 |
|
0 | 338 |
|
5842 | 339 |
(* proof data kind 'Provers/simpset' *) |
4795 | 340 |
|
5842 | 341 |
structure LocalSimpsetArgs = |
342 |
struct |
|
343 |
val name = "Provers/simpset"; |
|
344 |
type T = simpset; |
|
345 |
val init = simpset_of; |
|
346 |
fun print _ ss = print_ss ss; |
|
347 |
end; |
|
4795 | 348 |
|
5842 | 349 |
structure LocalSimpset = ProofDataFun(LocalSimpsetArgs); |
350 |
val print_local_simpset = LocalSimpset.print; |
|
351 |
val get_local_simpset = LocalSimpset.get; |
|
352 |
val put_local_simpset = LocalSimpset.put; |
|
7273 | 353 |
fun map_local_simpset f ctxt = put_local_simpset (f (get_local_simpset ctxt)) ctxt; |
4795 | 354 |
|
355 |
||
5886 | 356 |
(* attributes *) |
357 |
||
358 |
fun change_global_ss f (thy, th) = |
|
359 |
let val r = simpset_ref_of thy |
|
6096 | 360 |
in r := f (! r, [th]); (thy, th) end; |
5886 | 361 |
|
362 |
fun change_local_ss f (ctxt, th) = |
|
6096 | 363 |
let val ss = f (get_local_simpset ctxt, [th]) |
5886 | 364 |
in (put_local_simpset ss ctxt, th) end; |
365 |
||
366 |
val simp_add_global = change_global_ss (op addsimps); |
|
367 |
val simp_del_global = change_global_ss (op delsimps); |
|
368 |
val simp_add_local = change_local_ss (op addsimps); |
|
369 |
val simp_del_local = change_local_ss (op delsimps); |
|
370 |
||
371 |
||
3557 | 372 |
|
2503 | 373 |
(** simplification tactics **) |
0 | 374 |
|
7568 | 375 |
fun solve_all_tac (subgoal_tac, loop_tacs, unsafe_solvers) mss = |
3557 | 376 |
let |
377 |
val ss = |
|
7568 | 378 |
make_ss (mss, subgoal_tac, loop_tacs,unsafe_solvers,unsafe_solvers); |
4612 | 379 |
val solve1_tac = (subgoal_tac ss THEN_ALL_NEW (K no_tac)) 1 |
3557 | 380 |
in DEPTH_SOLVE solve1_tac end; |
381 |
||
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
382 |
fun loop_tac loop_tacs = FIRST'(map snd loop_tacs); |
3557 | 383 |
|
7214
381d6987f68d
exchanged finish_tac and unsafe_finish_tac (the more important one) in simpset
oheimb
parents:
7177
diff
changeset
|
384 |
(*unsafe: may instantiate unknowns that appear also in other subgoals*) |
7568 | 385 |
fun basic_gen_simp_tac mode solvers = |
386 |
fn (Simpset {mss, subgoal_tac, loop_tacs, unsafe_solvers, ...}) => |
|
3551 | 387 |
let |
4612 | 388 |
fun simp_loop_tac i = |
389 |
asm_rewrite_goal_tac mode |
|
7568 | 390 |
(solve_all_tac (subgoal_tac,loop_tacs,unsafe_solvers)) |
4612 | 391 |
mss i |
7568 | 392 |
THEN (solvers (prems_of_mss mss) i ORELSE |
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4612
diff
changeset
|
393 |
TRY ((loop_tac loop_tacs THEN_ALL_NEW simp_loop_tac) i)) |
4612 | 394 |
in simp_loop_tac end; |
0 | 395 |
|
7214
381d6987f68d
exchanged finish_tac and unsafe_finish_tac (the more important one) in simpset
oheimb
parents:
7177
diff
changeset
|
396 |
fun gen_simp_tac mode |
7568 | 397 |
(ss as Simpset {mss, subgoal_tac, loop_tacs, unsafe_solvers, ...}) = |
398 |
basic_gen_simp_tac mode (app_sols unsafe_solvers) ss; |
|
3551 | 399 |
|
4713 | 400 |
val simp_tac = gen_simp_tac (false, false, false); |
401 |
val asm_simp_tac = gen_simp_tac (false, true, false); |
|
402 |
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
|
403 |
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
|
404 |
val asm_full_simp_tac = gen_simp_tac (true, true, true); |
0 | 405 |
|
2629 | 406 |
(*not totally safe: may instantiate unknowns that appear also in other subgoals*) |
7214
381d6987f68d
exchanged finish_tac and unsafe_finish_tac (the more important one) in simpset
oheimb
parents:
7177
diff
changeset
|
407 |
fun safe_asm_full_simp_tac (ss as Simpset {mss, subgoal_tac, loop_tacs, |
7568 | 408 |
unsafe_solvers, solvers}) = |
409 |
basic_gen_simp_tac (true, true, true) (app_sols solvers) ss; |
|
2629 | 410 |
|
4795 | 411 |
(*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
|
412 |
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
|
413 |
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
|
414 |
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
|
415 |
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
|
416 |
fun Asm_full_simp_tac i st = asm_full_simp_tac (simpset ()) i st; |
406 | 417 |
|
3557 | 418 |
|
4795 | 419 |
|
5082 | 420 |
(** simplification rules and conversions **) |
3557 | 421 |
|
7214
381d6987f68d
exchanged finish_tac and unsafe_finish_tac (the more important one) in simpset
oheimb
parents:
7177
diff
changeset
|
422 |
fun simp rew mode |
7568 | 423 |
(Simpset {mss, subgoal_tac, loop_tacs, unsafe_solvers, ...}) thm = |
3557 | 424 |
let |
7568 | 425 |
val tacf = solve_all_tac (subgoal_tac, loop_tacs, unsafe_solvers); |
4271
3a82492e70c5
changed Pure/Sequence interface -- isatool fixseq;
wenzelm
parents:
4259
diff
changeset
|
426 |
fun prover m th = apsome fst (Seq.pull (tacf m th)); |
5082 | 427 |
in rew mode prover mss thm end; |
428 |
||
429 |
val simp_thm = simp Drule.rewrite_thm; |
|
430 |
val simp_cterm = simp Drule.rewrite_cterm; |
|
3557 | 431 |
|
5082 | 432 |
val simplify = simp_thm (false, false, false); |
433 |
val asm_simplify = simp_thm (false, true, false); |
|
434 |
val full_simplify = simp_thm (true, false, false); |
|
435 |
val asm_full_simplify = simp_thm (true, true, false); |
|
436 |
||
437 |
val rewrite = simp_cterm (false, false, false); |
|
438 |
val asm_rewrite = simp_cterm (false, true, false); |
|
439 |
val full_rewrite = simp_cterm (true, false, false); |
|
440 |
val asm_full_rewrite = simp_cterm (true, true, false); |
|
3557 | 441 |
|
442 |
||
4795 | 443 |
|
5886 | 444 |
(** concrete syntax of attributes **) |
5842 | 445 |
|
5886 | 446 |
(* add / del *) |
5842 | 447 |
|
5928 | 448 |
val simpN = "simp"; |
449 |
val addN = "add"; |
|
450 |
val delN = "del"; |
|
6911 | 451 |
val onlyN = "only"; |
5928 | 452 |
val otherN = "other"; |
5842 | 453 |
|
5886 | 454 |
fun simp_att change = |
5928 | 455 |
(Args.$$$ addN >> K (op addsimps) || |
456 |
Args.$$$ delN >> K (op delsimps) || |
|
5886 | 457 |
Scan.succeed (op addsimps)) |
458 |
>> change |
|
459 |
|> Scan.lift |
|
460 |
|> Attrib.syntax; |
|
5842 | 461 |
|
5886 | 462 |
val simp_attr = (simp_att change_global_ss, simp_att change_local_ss); |
5842 | 463 |
|
464 |
||
465 |
(* conversions *) |
|
466 |
||
467 |
fun conv_attr f = |
|
6096 | 468 |
(Attrib.no_args (Drule.rule_attribute (f o simpset_of)), |
469 |
Attrib.no_args (Drule.rule_attribute (f o get_local_simpset))); |
|
5842 | 470 |
|
471 |
||
472 |
(* setup_attrs *) |
|
473 |
||
474 |
val setup_attrs = Attrib.add_attributes |
|
8467 | 475 |
[(simpN, simp_attr, "declare simplification rule"), |
5842 | 476 |
("simplify", conv_attr simplify, "simplify rule"), |
477 |
("asm_simplify", conv_attr asm_simplify, "simplify rule, using assumptions"), |
|
478 |
("full_simplify", conv_attr full_simplify, "fully simplify rule"), |
|
479 |
("asm_full_simplify", conv_attr asm_full_simplify, "fully simplify rule, using assumptions")]; |
|
480 |
||
481 |
||
482 |
||
483 |
(** proof methods **) |
|
484 |
||
485 |
(* simplification *) |
|
486 |
||
8382 | 487 |
val colon = Args.$$$ ":"; |
488 |
||
5928 | 489 |
val simp_modifiers = |
8467 | 490 |
[Args.$$$ simpN -- colon >> K (I, simp_add_local), |
491 |
Args.$$$ simpN -- Args.$$$ addN -- colon >> K (I, simp_add_local), |
|
8382 | 492 |
Args.$$$ simpN -- Args.$$$ delN -- colon >> K (I, simp_del_local), |
493 |
Args.$$$ simpN -- Args.$$$ onlyN -- colon >> K (map_local_simpset clear_ss, simp_add_local), |
|
494 |
Args.$$$ otherN -- colon >> K (I, I)]; |
|
5928 | 495 |
|
496 |
val simp_modifiers' = |
|
8382 | 497 |
[Args.$$$ addN -- colon >> K (I, simp_add_local), |
498 |
Args.$$$ delN -- colon >> K (I, simp_del_local), |
|
499 |
Args.$$$ onlyN -- colon >> K (map_local_simpset clear_ss, simp_add_local), |
|
500 |
Args.$$$ otherN -- colon >> K (I, I)]; |
|
5928 | 501 |
|
8467 | 502 |
fun simp_method more_mods tac = |
7558 | 503 |
(fn prems => fn ctxt => Method.METHOD (fn facts => |
8170 | 504 |
ALLGOALS (Method.insert_tac (prems @ facts)) THEN tac (get_local_simpset ctxt))) |
8467 | 505 |
|> Method.bang_sectioned_args (more_mods @ simp_modifiers'); |
8170 | 506 |
|
8467 | 507 |
fun simp_method' more_mods tac = |
8170 | 508 |
(fn prems => fn ctxt => Method.METHOD (fn facts => |
8168 | 509 |
HEADGOAL (Method.insert_tac (prems @ facts) THEN' tac (get_local_simpset ctxt)))) |
8467 | 510 |
|> Method.bang_sectioned_args (more_mods @ simp_modifiers'); |
7568 | 511 |
|
5842 | 512 |
|
513 |
(* setup_methods *) |
|
514 |
||
8467 | 515 |
fun setup_methods more_mods = Method.add_methods |
516 |
[(simpN, simp_method' more_mods |
|
517 |
(CHANGED oo asm_full_simp_tac), "full simplification"), |
|
518 |
("simp_all", simp_method more_mods (CHANGED o ALLGOALS o asm_full_simp_tac), |
|
8170 | 519 |
"full simplification (all goals)"), |
8467 | 520 |
("simp_tac", simp_method' more_mods simp_tac, "simp_tac (improper!)"), |
521 |
("asm_simp_tac", simp_method' more_mods asm_simp_tac, "asm_simp_tac (improper!)"), |
|
522 |
("full_simp_tac", simp_method' more_mods full_simp_tac, "full_simp_tac (improper!)"), |
|
523 |
("asm_full_simp_tac", simp_method' more_mods asm_full_simp_tac, "asm_full_simp_tac (improper!)"), |
|
524 |
("asm_lr_simp_tac", simp_method' more_mods asm_lr_simp_tac, "asm_lr_simp_tac (improper!)")]; |
|
5842 | 525 |
|
526 |
||
527 |
||
4795 | 528 |
(** theory setup **) |
529 |
||
8467 | 530 |
val setup = [GlobalSimpset.init, LocalSimpset.init, setup_attrs]; |
531 |
fun method_setup mods = [setup_methods mods]; |
|
4795 | 532 |
|
8228 | 533 |
fun easy_setup reflect trivs = |
534 |
let |
|
535 |
val trivialities = Drule.reflexive_thm :: trivs; |
|
536 |
||
537 |
fun unsafe_solver_tac prems = FIRST' [resolve_tac (trivialities @ prems), assume_tac]; |
|
538 |
val unsafe_solver = mk_solver "easy unsafe" unsafe_solver_tac; |
|
539 |
||
540 |
(*no premature instantiation of variables during simplification*) |
|
541 |
fun safe_solver_tac prems = FIRST' [match_tac (trivialities @ prems), eq_assume_tac]; |
|
542 |
val safe_solver = mk_solver "easy safe" safe_solver_tac; |
|
543 |
||
8243 | 544 |
fun mk_eq thm = |
8228 | 545 |
if Logic.is_equals (Thm.concl_of thm) then [thm] |
546 |
else [thm RS reflect] handle THM _ => []; |
|
547 |
||
8243 | 548 |
fun mksimps thm = mk_eq (Drule.forall_elim_vars (#maxidx (Thm.rep_thm thm) + 1) thm); |
549 |
||
8228 | 550 |
fun init_ss thy = |
551 |
(simpset_ref_of thy := |
|
552 |
empty_ss setsubgoaler asm_simp_tac |
|
553 |
setSSolver safe_solver |
|
554 |
setSolver unsafe_solver |
|
555 |
setmksimps mksimps; thy); |
|
8467 | 556 |
in setup @ method_setup [] @ [init_ss] end; |
8228 | 557 |
|
4795 | 558 |
|
1243 | 559 |
end; |
4795 | 560 |
|
561 |
||
562 |
structure BasicSimplifier: BASIC_SIMPLIFIER = Simplifier; |
|
563 |
open BasicSimplifier; |