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