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