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