author | wenzelm |
Sat, 30 Mar 2013 17:27:21 +0100 | |
changeset 51591 | e4aeb102ad70 |
parent 51590 | c52891242de2 |
child 51611 | 0a7b4e0384d0 |
permissions | -rw-r--r-- |
41228
e1fce873b814
renamed structure MetaSimplifier to raw_Simplifer, to emphasize its meaning;
wenzelm
parents:
41227
diff
changeset
|
1 |
(* Title: Pure/raw_simplifier.ML |
29269
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
28839
diff
changeset
|
2 |
Author: Tobias Nipkow and Stefan Berghofer, TU Muenchen |
10413 | 3 |
|
41228
e1fce873b814
renamed structure MetaSimplifier to raw_Simplifer, to emphasize its meaning;
wenzelm
parents:
41227
diff
changeset
|
4 |
Higher-order Simplification. |
10413 | 5 |
*) |
6 |
||
15006
107e4dfd3b96
Merging the meta-simplifier with the Provers-simplifier. Next step:
skalberg
parents:
15001
diff
changeset
|
7 |
infix 4 |
45620
f2a587696afb
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45405
diff
changeset
|
8 |
addsimps delsimps addsimprocs delsimprocs |
45625
750c5a47400b
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45621
diff
changeset
|
9 |
setloop' setloop addloop addloop' delloop |
750c5a47400b
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45621
diff
changeset
|
10 |
setSSolver addSSolver setSolver addSolver; |
15006
107e4dfd3b96
Merging the meta-simplifier with the Provers-simplifier. Next step:
skalberg
parents:
15001
diff
changeset
|
11 |
|
41228
e1fce873b814
renamed structure MetaSimplifier to raw_Simplifer, to emphasize its meaning;
wenzelm
parents:
41227
diff
changeset
|
12 |
signature BASIC_RAW_SIMPLIFIER = |
11672 | 13 |
sig |
41227 | 14 |
val simp_depth_limit: int Config.T |
15 |
val simp_trace_depth_limit: int Config.T |
|
40878
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
39163
diff
changeset
|
16 |
val simp_debug: bool Config.T |
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
39163
diff
changeset
|
17 |
val simp_trace: bool Config.T |
51590 | 18 |
type cong_name = bool * string |
15023 | 19 |
type rrule |
16807 | 20 |
val eq_rrule: rrule * rrule -> bool |
15023 | 21 |
type simpset |
22 |
type proc |
|
17614 | 23 |
type solver |
43596 | 24 |
val mk_solver: string -> (simpset -> int -> tactic) -> solver |
15023 | 25 |
val empty_ss: simpset |
26 |
val merge_ss: simpset * simpset -> simpset |
|
30356 | 27 |
val dest_ss: simpset -> |
28 |
{simps: (string * thm) list, |
|
29 |
procs: (string * cterm list) list, |
|
51590 | 30 |
congs: (cong_name * thm) list, |
31 |
weak_congs: cong_name list, |
|
30356 | 32 |
loopers: string list, |
33 |
unsafe_solvers: string list, |
|
34 |
safe_solvers: string list} |
|
15023 | 35 |
type simproc |
22234 | 36 |
val eq_simproc: simproc * simproc -> bool |
45290 | 37 |
val transform_simproc: morphism -> simproc -> simproc |
22234 | 38 |
val make_simproc: {name: string, lhss: cterm list, |
39 |
proc: morphism -> simpset -> cterm -> thm option, identifier: thm list} -> simproc |
|
22008 | 40 |
val mk_simproc: string -> cterm list -> (theory -> simpset -> term -> thm option) -> simproc |
15023 | 41 |
val addsimps: simpset * thm list -> simpset |
42 |
val delsimps: simpset * thm list -> simpset |
|
43 |
val addsimprocs: simpset * simproc list -> simpset |
|
44 |
val delsimprocs: simpset * simproc list -> simpset |
|
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset
|
45 |
val setloop': simpset * (simpset -> int -> tactic) -> simpset |
15023 | 46 |
val setloop: simpset * (int -> tactic) -> simpset |
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset
|
47 |
val addloop': simpset * (string * (simpset -> int -> tactic)) -> simpset |
15023 | 48 |
val addloop: simpset * (string * (int -> tactic)) -> simpset |
49 |
val delloop: simpset * string -> simpset |
|
50 |
val setSSolver: simpset * solver -> simpset |
|
51 |
val addSSolver: simpset * solver -> simpset |
|
52 |
val setSolver: simpset * solver -> simpset |
|
53 |
val addSolver: simpset * solver -> simpset |
|
21708 | 54 |
|
55 |
val rewrite_rule: thm list -> thm -> thm |
|
56 |
val rewrite_goals_rule: thm list -> thm -> thm |
|
57 |
val rewrite_goals_tac: thm list -> tactic |
|
23536
60a1672e298e
moved (asm_)rewrite_goal_tac from goal.ML to meta_simplifier.ML (no longer depends on SELECT_GOAL);
wenzelm
parents:
23221
diff
changeset
|
58 |
val rewrite_goal_tac: thm list -> int -> tactic |
21708 | 59 |
val prune_params_tac: tactic |
60 |
val fold_rule: thm list -> thm -> thm |
|
61 |
val fold_goals_tac: thm list -> tactic |
|
30552
58db56278478
provide Simplifier.norm_hhf(_protect) as regular simplifier operation;
wenzelm
parents:
30356
diff
changeset
|
62 |
val norm_hhf: thm -> thm |
58db56278478
provide Simplifier.norm_hhf(_protect) as regular simplifier operation;
wenzelm
parents:
30356
diff
changeset
|
63 |
val norm_hhf_protect: thm -> thm |
15006
107e4dfd3b96
Merging the meta-simplifier with the Provers-simplifier. Next step:
skalberg
parents:
15001
diff
changeset
|
64 |
end; |
107e4dfd3b96
Merging the meta-simplifier with the Provers-simplifier. Next step:
skalberg
parents:
15001
diff
changeset
|
65 |
|
41228
e1fce873b814
renamed structure MetaSimplifier to raw_Simplifer, to emphasize its meaning;
wenzelm
parents:
41227
diff
changeset
|
66 |
signature RAW_SIMPLIFIER = |
10413 | 67 |
sig |
41228
e1fce873b814
renamed structure MetaSimplifier to raw_Simplifer, to emphasize its meaning;
wenzelm
parents:
41227
diff
changeset
|
68 |
include BASIC_RAW_SIMPLIFIER |
10413 | 69 |
exception SIMPLIFIER of string * thm |
30336 | 70 |
val internal_ss: simpset -> |
71 |
{rules: rrule Net.net, |
|
72 |
prems: thm list, |
|
73 |
bounds: int * ((string * typ) * string) list, |
|
32738 | 74 |
depth: int * bool Unsynchronized.ref, |
30336 | 75 |
context: Proof.context option} * |
51590 | 76 |
{congs: (cong_name * thm) list * cong_name list, |
30336 | 77 |
procs: proc Net.net, |
78 |
mk_rews: |
|
36543
0e7fc5bf38de
proper context for mksimps etc. -- via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset
|
79 |
{mk: simpset -> thm -> thm list, |
0e7fc5bf38de
proper context for mksimps etc. -- via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset
|
80 |
mk_cong: simpset -> thm -> thm, |
0e7fc5bf38de
proper context for mksimps etc. -- via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset
|
81 |
mk_sym: simpset -> thm -> thm option, |
0e7fc5bf38de
proper context for mksimps etc. -- via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset
|
82 |
mk_eq_True: simpset -> thm -> thm option, |
30336 | 83 |
reorient: theory -> term list -> term -> term -> bool}, |
84 |
termless: term * term -> bool, |
|
85 |
subgoal_tac: simpset -> int -> tactic, |
|
86 |
loop_tacs: (string * (simpset -> int -> tactic)) list, |
|
87 |
solvers: solver list * solver list} |
|
43597 | 88 |
val prems_of: simpset -> thm list |
27558 | 89 |
val add_simp: thm -> simpset -> simpset |
90 |
val del_simp: thm -> simpset -> simpset |
|
45620
f2a587696afb
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45405
diff
changeset
|
91 |
val add_eqcong: thm -> simpset -> simpset |
f2a587696afb
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45405
diff
changeset
|
92 |
val del_eqcong: thm -> simpset -> simpset |
f2a587696afb
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45405
diff
changeset
|
93 |
val add_cong: thm -> simpset -> simpset |
f2a587696afb
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45405
diff
changeset
|
94 |
val del_cong: thm -> simpset -> simpset |
45625
750c5a47400b
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45621
diff
changeset
|
95 |
val mksimps: simpset -> thm -> thm list |
750c5a47400b
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45621
diff
changeset
|
96 |
val set_mksimps: (simpset -> thm -> thm list) -> simpset -> simpset |
750c5a47400b
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45621
diff
changeset
|
97 |
val set_mkcong: (simpset -> thm -> thm) -> simpset -> simpset |
750c5a47400b
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45621
diff
changeset
|
98 |
val set_mksym: (simpset -> thm -> thm option) -> simpset -> simpset |
750c5a47400b
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45621
diff
changeset
|
99 |
val set_mkeqTrue: (simpset -> thm -> thm option) -> simpset -> simpset |
750c5a47400b
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45621
diff
changeset
|
100 |
val set_termless: (term * term -> bool) -> simpset -> simpset |
750c5a47400b
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45621
diff
changeset
|
101 |
val set_subgoaler: (simpset -> int -> tactic) -> simpset -> simpset |
17966
34e420fa03ad
moved various simplification tactics and rules to simplifier.ML;
wenzelm
parents:
17897
diff
changeset
|
102 |
val solver: simpset -> solver -> int -> tactic |
39163
4d701c0388c3
more explicit indication of Config.raw options, which are only needed for bootstrapping Pure;
wenzelm
parents:
39116
diff
changeset
|
103 |
val simp_depth_limit_raw: Config.raw |
15023 | 104 |
val clear_ss: simpset -> simpset |
47239 | 105 |
val default_mk_sym: simpset -> thm -> thm option |
38715
6513ea67d95d
renamed Simplifier.simproc(_i) to Simplifier.simproc_global(_i) to emphasize that this is not the real thing;
wenzelm
parents:
36944
diff
changeset
|
106 |
val simproc_global_i: theory -> string -> term list |
16458 | 107 |
-> (theory -> simpset -> term -> thm option) -> simproc |
38715
6513ea67d95d
renamed Simplifier.simproc(_i) to Simplifier.simproc_global(_i) to emphasize that this is not the real thing;
wenzelm
parents:
36944
diff
changeset
|
108 |
val simproc_global: theory -> string -> string list |
16458 | 109 |
-> (theory -> simpset -> term -> thm option) -> simproc |
41227 | 110 |
val simp_trace_depth_limit_raw: Config.raw |
111 |
val simp_trace_depth_limit_default: int Unsynchronized.ref |
|
112 |
val simp_trace_default: bool Unsynchronized.ref |
|
113 |
val simp_trace_raw: Config.raw |
|
114 |
val simp_debug_raw: Config.raw |
|
41226 | 115 |
val add_prems: thm list -> simpset -> simpset |
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset
|
116 |
val inherit_context: simpset -> simpset -> simpset |
20289 | 117 |
val the_context: simpset -> Proof.context |
118 |
val context: Proof.context -> simpset -> simpset |
|
42454 | 119 |
val global_context: theory -> simpset -> simpset |
36545
5c5b5c7f1157
conditional warnings: explicitly observe context visibility flag, not just accidental presence of a context;
wenzelm
parents:
36543
diff
changeset
|
120 |
val with_context: Proof.context -> (simpset -> simpset) -> simpset -> simpset |
32738 | 121 |
val debug_bounds: bool Unsynchronized.ref |
18208 | 122 |
val set_reorient: (theory -> term list -> term -> term -> bool) -> simpset -> simpset |
17966
34e420fa03ad
moved various simplification tactics and rules to simplifier.ML;
wenzelm
parents:
17897
diff
changeset
|
123 |
val set_solvers: solver list -> simpset -> simpset |
23598 | 124 |
val rewrite_cterm: bool * bool * bool -> (simpset -> thm -> thm option) -> simpset -> conv |
16458 | 125 |
val rewrite_term: theory -> thm list -> (term -> term option) list -> term -> term |
15023 | 126 |
val rewrite_thm: bool * bool * bool -> |
127 |
(simpset -> thm -> thm option) -> simpset -> thm -> thm |
|
46465 | 128 |
val generic_rewrite_goal_tac: bool * bool * bool -> |
23536
60a1672e298e
moved (asm_)rewrite_goal_tac from goal.ML to meta_simplifier.ML (no longer depends on SELECT_GOAL);
wenzelm
parents:
23221
diff
changeset
|
129 |
(simpset -> tactic) -> simpset -> int -> tactic |
23598 | 130 |
val rewrite: bool -> thm list -> conv |
21708 | 131 |
val simplify: bool -> thm list -> thm -> thm |
10413 | 132 |
end; |
133 |
||
41228
e1fce873b814
renamed structure MetaSimplifier to raw_Simplifer, to emphasize its meaning;
wenzelm
parents:
41227
diff
changeset
|
134 |
structure Raw_Simplifier: RAW_SIMPLIFIER = |
10413 | 135 |
struct |
136 |
||
15023 | 137 |
(** datatype simpset **) |
138 |
||
51590 | 139 |
(* congruence rules *) |
140 |
||
141 |
type cong_name = bool * string; |
|
142 |
||
143 |
fun cong_name (Const (a, _)) = SOME (true, a) |
|
144 |
| cong_name (Free (a, _)) = SOME (false, a) |
|
145 |
| cong_name _ = NONE; |
|
146 |
||
147 |
||
15023 | 148 |
(* rewrite rules *) |
10413 | 149 |
|
20546
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
150 |
type rrule = |
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
151 |
{thm: thm, (*the rewrite rule*) |
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
152 |
name: string, (*name of theorem from which rewrite rule was extracted*) |
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
153 |
lhs: term, (*the left-hand side*) |
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
154 |
elhs: cterm, (*the etac-contracted lhs*) |
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
155 |
extra: bool, (*extra variables outside of elhs*) |
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
156 |
fo: bool, (*use first-order matching*) |
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
157 |
perm: bool}; (*the rewrite rule is permutative*) |
15023 | 158 |
|
20546
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
159 |
(* |
12603 | 160 |
Remarks: |
10413 | 161 |
- elhs is used for matching, |
15023 | 162 |
lhs only for preservation of bound variable names; |
10413 | 163 |
- fo is set iff |
164 |
either elhs is first-order (no Var is applied), |
|
15023 | 165 |
in which case fo-matching is complete, |
10413 | 166 |
or elhs is not a pattern, |
20546
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
167 |
in which case there is nothing better to do; |
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
168 |
*) |
10413 | 169 |
|
170 |
fun eq_rrule ({thm = thm1, ...}: rrule, {thm = thm2, ...}: rrule) = |
|
22360
26ead7ed4f4b
moved eq_thm etc. to structure Thm in Pure/more_thm.ML;
wenzelm
parents:
22254
diff
changeset
|
171 |
Thm.eq_thm_prop (thm1, thm2); |
15023 | 172 |
|
173 |
||
17614 | 174 |
(* simplification sets, procedures, and solvers *) |
15023 | 175 |
|
176 |
(*A simpset contains data required during conversion: |
|
10413 | 177 |
rules: discrimination net of rewrite rules; |
15023 | 178 |
prems: current premises; |
15249
0da6b3075bfa
Replaced list of bound variables in simpset by maximal index of bound
berghofe
parents:
15199
diff
changeset
|
179 |
bounds: maximal index of bound variables already used |
15023 | 180 |
(for generating new names when rewriting under lambda abstractions); |
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multi-threaded simplification);
wenzelm
parents:
22717
diff
changeset
|
181 |
depth: simp_depth and exceeded flag; |
10413 | 182 |
congs: association list of congruence rules and |
183 |
a list of `weak' congruence constants. |
|
184 |
A congruence is `weak' if it avoids normalization of some argument. |
|
185 |
procs: discrimination net of simplification procedures |
|
186 |
(functions that prove rewrite rules on the fly); |
|
15023 | 187 |
mk_rews: |
188 |
mk: turn simplification thms into rewrite rules; |
|
189 |
mk_cong: prepare congruence rules; |
|
190 |
mk_sym: turn == around; |
|
191 |
mk_eq_True: turn P into P == True; |
|
192 |
termless: relation for ordered rewriting;*) |
|
15011 | 193 |
|
15023 | 194 |
datatype simpset = |
195 |
Simpset of |
|
196 |
{rules: rrule Net.net, |
|
10413 | 197 |
prems: thm list, |
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset
|
198 |
bounds: int * ((string * typ) * string) list, |
32738 | 199 |
depth: int * bool Unsynchronized.ref, |
20289 | 200 |
context: Proof.context option} * |
51590 | 201 |
{congs: (cong_name * thm) list * cong_name list, |
15023 | 202 |
procs: proc Net.net, |
36543
0e7fc5bf38de
proper context for mksimps etc. -- via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset
|
203 |
mk_rews: |
0e7fc5bf38de
proper context for mksimps etc. -- via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset
|
204 |
{mk: simpset -> thm -> thm list, |
0e7fc5bf38de
proper context for mksimps etc. -- via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset
|
205 |
mk_cong: simpset -> thm -> thm, |
0e7fc5bf38de
proper context for mksimps etc. -- via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset
|
206 |
mk_sym: simpset -> thm -> thm option, |
0e7fc5bf38de
proper context for mksimps etc. -- via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset
|
207 |
mk_eq_True: simpset -> thm -> thm option, |
0e7fc5bf38de
proper context for mksimps etc. -- via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset
|
208 |
reorient: theory -> term list -> term -> term -> bool}, |
11504 | 209 |
termless: term * term -> bool, |
15011 | 210 |
subgoal_tac: simpset -> int -> tactic, |
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset
|
211 |
loop_tacs: (string * (simpset -> int -> tactic)) list, |
15023 | 212 |
solvers: solver list * solver list} |
213 |
and proc = |
|
214 |
Proc of |
|
215 |
{name: string, |
|
216 |
lhs: cterm, |
|
22008 | 217 |
proc: simpset -> cterm -> thm option, |
22234 | 218 |
id: stamp * thm list} |
17614 | 219 |
and solver = |
220 |
Solver of |
|
221 |
{name: string, |
|
222 |
solver: simpset -> int -> tactic, |
|
15023 | 223 |
id: stamp}; |
224 |
||
225 |
||
30336 | 226 |
fun internal_ss (Simpset args) = args; |
10413 | 227 |
|
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multi-threaded simplification);
wenzelm
parents:
22717
diff
changeset
|
228 |
fun make_ss1 (rules, prems, bounds, depth, context) = |
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multi-threaded simplification);
wenzelm
parents:
22717
diff
changeset
|
229 |
{rules = rules, prems = prems, bounds = bounds, depth = depth, context = context}; |
15023 | 230 |
|
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multi-threaded simplification);
wenzelm
parents:
22717
diff
changeset
|
231 |
fun map_ss1 f {rules, prems, bounds, depth, context} = |
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multi-threaded simplification);
wenzelm
parents:
22717
diff
changeset
|
232 |
make_ss1 (f (rules, prems, bounds, depth, context)); |
10413 | 233 |
|
15023 | 234 |
fun make_ss2 (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) = |
235 |
{congs = congs, procs = procs, mk_rews = mk_rews, termless = termless, |
|
236 |
subgoal_tac = subgoal_tac, loop_tacs = loop_tacs, solvers = solvers}; |
|
237 |
||
238 |
fun map_ss2 f {congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers} = |
|
239 |
make_ss2 (f (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers)); |
|
240 |
||
241 |
fun make_simpset (args1, args2) = Simpset (make_ss1 args1, make_ss2 args2); |
|
10413 | 242 |
|
15023 | 243 |
fun map_simpset1 f (Simpset (r1, r2)) = Simpset (map_ss1 f r1, r2); |
244 |
fun map_simpset2 f (Simpset (r1, r2)) = Simpset (r1, map_ss2 f r2); |
|
245 |
||
43597 | 246 |
fun prems_of (Simpset ({prems, ...}, _)) = prems; |
17614 | 247 |
|
22234 | 248 |
fun eq_procid ((s1: stamp, ths1: thm list), (s2, ths2)) = |
22360
26ead7ed4f4b
moved eq_thm etc. to structure Thm in Pure/more_thm.ML;
wenzelm
parents:
22254
diff
changeset
|
249 |
s1 = s2 andalso eq_list Thm.eq_thm (ths1, ths2); |
22234 | 250 |
fun eq_proc (Proc {id = id1, ...}, Proc {id = id2, ...}) = eq_procid (id1, id2); |
17614 | 251 |
|
43596 | 252 |
fun mk_solver name solver = Solver {name = name, solver = solver, id = stamp ()}; |
17614 | 253 |
|
254 |
fun solver_name (Solver {name, ...}) = name; |
|
17966
34e420fa03ad
moved various simplification tactics and rules to simplifier.ML;
wenzelm
parents:
17897
diff
changeset
|
255 |
fun solver ss (Solver {solver = tac, ...}) = tac ss; |
17614 | 256 |
fun eq_solver (Solver {id = id1, ...}, Solver {id = id2, ...}) = (id1 = id2); |
257 |
||
15023 | 258 |
|
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multi-threaded simplification);
wenzelm
parents:
22717
diff
changeset
|
259 |
(* simp depth *) |
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multi-threaded simplification);
wenzelm
parents:
22717
diff
changeset
|
260 |
|
39163
4d701c0388c3
more explicit indication of Config.raw options, which are only needed for bootstrapping Pure;
wenzelm
parents:
39116
diff
changeset
|
261 |
val simp_depth_limit_raw = Config.declare "simp_depth_limit" (K (Config.Int 100)); |
4d701c0388c3
more explicit indication of Config.raw options, which are only needed for bootstrapping Pure;
wenzelm
parents:
39116
diff
changeset
|
262 |
val simp_depth_limit = Config.int simp_depth_limit_raw; |
24124
4399175e3014
turned simp_depth_limit into configuration option;
wenzelm
parents:
23938
diff
changeset
|
263 |
|
41183
e20f0d0e2af3
turned simp_trace_depth_limit into a configuration option
boehmes
parents:
40878
diff
changeset
|
264 |
val simp_trace_depth_limit_default = Unsynchronized.ref 1; |
e20f0d0e2af3
turned simp_trace_depth_limit into a configuration option
boehmes
parents:
40878
diff
changeset
|
265 |
val simp_trace_depth_limit_raw = Config.declare "simp_trace_depth_limit" |
e20f0d0e2af3
turned simp_trace_depth_limit into a configuration option
boehmes
parents:
40878
diff
changeset
|
266 |
(fn _ => Config.Int (! simp_trace_depth_limit_default)); |
e20f0d0e2af3
turned simp_trace_depth_limit into a configuration option
boehmes
parents:
40878
diff
changeset
|
267 |
val simp_trace_depth_limit = Config.int simp_trace_depth_limit_raw; |
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multi-threaded simplification);
wenzelm
parents:
22717
diff
changeset
|
268 |
|
41183
e20f0d0e2af3
turned simp_trace_depth_limit into a configuration option
boehmes
parents:
40878
diff
changeset
|
269 |
fun simp_trace_depth_limit_of NONE = ! simp_trace_depth_limit_default |
e20f0d0e2af3
turned simp_trace_depth_limit into a configuration option
boehmes
parents:
40878
diff
changeset
|
270 |
| simp_trace_depth_limit_of (SOME ctxt) = Config.get ctxt simp_trace_depth_limit; |
e20f0d0e2af3
turned simp_trace_depth_limit into a configuration option
boehmes
parents:
40878
diff
changeset
|
271 |
|
e20f0d0e2af3
turned simp_trace_depth_limit into a configuration option
boehmes
parents:
40878
diff
changeset
|
272 |
fun trace_depth (Simpset ({depth = (depth, exceeded), context, ...}, _)) msg = |
e20f0d0e2af3
turned simp_trace_depth_limit into a configuration option
boehmes
parents:
40878
diff
changeset
|
273 |
if depth > simp_trace_depth_limit_of context then |
40878
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
39163
diff
changeset
|
274 |
if ! exceeded then () else (tracing "simp_trace_depth_limit exceeded!"; exceeded := true) |
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multi-threaded simplification);
wenzelm
parents:
22717
diff
changeset
|
275 |
else |
23938 | 276 |
(tracing (enclose "[" "]" (string_of_int depth) ^ msg); exceeded := false); |
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multi-threaded simplification);
wenzelm
parents:
22717
diff
changeset
|
277 |
|
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multi-threaded simplification);
wenzelm
parents:
22717
diff
changeset
|
278 |
val inc_simp_depth = map_simpset1 (fn (rules, prems, bounds, (depth, exceeded), context) => |
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multi-threaded simplification);
wenzelm
parents:
22717
diff
changeset
|
279 |
(rules, prems, bounds, |
32738 | 280 |
(depth + 1, |
51590 | 281 |
if depth = simp_trace_depth_limit_of context |
282 |
then Unsynchronized.ref false else exceeded), context)); |
|
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multi-threaded simplification);
wenzelm
parents:
22717
diff
changeset
|
283 |
|
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multi-threaded simplification);
wenzelm
parents:
22717
diff
changeset
|
284 |
fun simp_depth (Simpset ({depth = (depth, _), ...}, _)) = depth; |
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multi-threaded simplification);
wenzelm
parents:
22717
diff
changeset
|
285 |
|
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multi-threaded simplification);
wenzelm
parents:
22717
diff
changeset
|
286 |
|
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset
|
287 |
(* diagnostics *) |
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset
|
288 |
|
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset
|
289 |
exception SIMPLIFIER of string * thm; |
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset
|
290 |
|
40878
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
39163
diff
changeset
|
291 |
val simp_debug_raw = Config.declare "simp_debug" (K (Config.Bool false)); |
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
39163
diff
changeset
|
292 |
val simp_debug = Config.bool simp_debug_raw; |
35979
12bb31230550
replaced references 'trace_simp' and 'debug_simp' by configuration options stored in the context
boehmes
parents:
35845
diff
changeset
|
293 |
|
40878
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
39163
diff
changeset
|
294 |
val simp_trace_default = Unsynchronized.ref false; |
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
39163
diff
changeset
|
295 |
val simp_trace_raw = Config.declare "simp_trace" (fn _ => Config.Bool (! simp_trace_default)); |
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
39163
diff
changeset
|
296 |
val simp_trace = Config.bool simp_trace_raw; |
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multi-threaded simplification);
wenzelm
parents:
22717
diff
changeset
|
297 |
|
38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
298 |
fun if_enabled (Simpset ({context, ...}, _)) flag f = |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
299 |
(case context of |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
300 |
SOME ctxt => if Config.get ctxt flag then f ctxt else () |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
301 |
| NONE => ()) |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
302 |
|
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
303 |
fun if_visible (Simpset ({context, ...}, _)) f x = |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
304 |
(case context of |
41469 | 305 |
SOME ctxt => Context_Position.if_visible ctxt f x |
38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
306 |
| NONE => ()); |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
307 |
|
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset
|
308 |
local |
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset
|
309 |
|
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multi-threaded simplification);
wenzelm
parents:
22717
diff
changeset
|
310 |
fun prnt ss warn a = if warn then warning a else trace_depth ss a; |
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset
|
311 |
|
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset
|
312 |
fun show_bounds (Simpset ({bounds = (_, bs), ...}, _)) t = |
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset
|
313 |
let |
20146 | 314 |
val names = Term.declare_term_names t Name.context; |
43326
47cf4bc789aa
simplified Name.variant -- discontinued builtin fold_map;
wenzelm
parents:
42454
diff
changeset
|
315 |
val xs = rev (#1 (fold_map Name.variant (rev (map #2 bs)) names)); |
49660
de49d9b4d7bc
more explicit Syntax_Trans.mark_bound_abs/mark_bound_body: preserve type information for show_markup;
wenzelm
parents:
48992
diff
changeset
|
316 |
fun subst (((b, T), _), x') = (Free (b, T), Syntax_Trans.mark_bound_abs (x', T)); |
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset
|
317 |
in Term.subst_atomic (ListPair.map subst (bs, xs)) t end; |
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset
|
318 |
|
35979
12bb31230550
replaced references 'trace_simp' and 'debug_simp' by configuration options stored in the context
boehmes
parents:
35845
diff
changeset
|
319 |
fun print_term ss warn a t ctxt = prnt ss warn (a () ^ "\n" ^ |
12bb31230550
replaced references 'trace_simp' and 'debug_simp' by configuration options stored in the context
boehmes
parents:
35845
diff
changeset
|
320 |
Syntax.string_of_term ctxt |
40878
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
39163
diff
changeset
|
321 |
(if Config.get ctxt simp_debug then t else show_bounds ss t)); |
35979
12bb31230550
replaced references 'trace_simp' and 'debug_simp' by configuration options stored in the context
boehmes
parents:
35845
diff
changeset
|
322 |
|
17705 | 323 |
in |
324 |
||
35979
12bb31230550
replaced references 'trace_simp' and 'debug_simp' by configuration options stored in the context
boehmes
parents:
35845
diff
changeset
|
325 |
fun print_term_global ss warn a thy t = |
42360 | 326 |
print_term ss warn (K a) t (Proof_Context.init_global thy); |
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset
|
327 |
|
40878
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
39163
diff
changeset
|
328 |
fun debug warn a ss = if_enabled ss simp_debug (fn _ => prnt ss warn (a ())); |
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
39163
diff
changeset
|
329 |
fun trace warn a ss = if_enabled ss simp_trace (fn _ => prnt ss warn (a ())); |
35979
12bb31230550
replaced references 'trace_simp' and 'debug_simp' by configuration options stored in the context
boehmes
parents:
35845
diff
changeset
|
330 |
|
40878
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
39163
diff
changeset
|
331 |
fun debug_term warn a ss t = if_enabled ss simp_debug (print_term ss warn a t); |
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
39163
diff
changeset
|
332 |
fun trace_term warn a ss t = if_enabled ss simp_trace (print_term ss warn a t); |
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset
|
333 |
|
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset
|
334 |
fun trace_cterm warn a ss ct = |
40878
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
39163
diff
changeset
|
335 |
if_enabled ss simp_trace (print_term ss warn a (Thm.term_of ct)); |
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset
|
336 |
|
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset
|
337 |
fun trace_thm a ss th = |
40878
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
39163
diff
changeset
|
338 |
if_enabled ss simp_trace (print_term ss false a (Thm.full_prop_of th)); |
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset
|
339 |
|
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset
|
340 |
fun trace_named_thm a ss (th, name) = |
40878
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
39163
diff
changeset
|
341 |
if_enabled ss simp_trace (print_term ss false |
35979
12bb31230550
replaced references 'trace_simp' and 'debug_simp' by configuration options stored in the context
boehmes
parents:
35845
diff
changeset
|
342 |
(fn () => if name = "" then a () else a () ^ " " ^ quote name ^ ":") |
12bb31230550
replaced references 'trace_simp' and 'debug_simp' by configuration options stored in the context
boehmes
parents:
35845
diff
changeset
|
343 |
(Thm.full_prop_of th)); |
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset
|
344 |
|
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multi-threaded simplification);
wenzelm
parents:
22717
diff
changeset
|
345 |
fun warn_thm a ss th = |
35979
12bb31230550
replaced references 'trace_simp' and 'debug_simp' by configuration options stored in the context
boehmes
parents:
35845
diff
changeset
|
346 |
print_term_global ss true a (Thm.theory_of_thm th) (Thm.full_prop_of th); |
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset
|
347 |
|
38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
348 |
fun cond_warn_thm a ss th = if_visible ss (fn () => warn_thm a ss th) (); |
20028
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset
|
349 |
|
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset
|
350 |
end; |
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset
|
351 |
|
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset
|
352 |
|
10413 | 353 |
|
354 |
(** simpset operations **) |
|
355 |
||
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset
|
356 |
(* context *) |
10413 | 357 |
|
17614 | 358 |
fun eq_bound (x: string, (y, _)) = x = y; |
359 |
||
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multi-threaded simplification);
wenzelm
parents:
22717
diff
changeset
|
360 |
fun add_bound bound = map_simpset1 (fn (rules, prems, (count, bounds), depth, context) => |
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multi-threaded simplification);
wenzelm
parents:
22717
diff
changeset
|
361 |
(rules, prems, (count + 1, bound :: bounds), depth, context)); |
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset
|
362 |
|
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multi-threaded simplification);
wenzelm
parents:
22717
diff
changeset
|
363 |
fun add_prems ths = map_simpset1 (fn (rules, prems, bounds, depth, context) => |
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multi-threaded simplification);
wenzelm
parents:
22717
diff
changeset
|
364 |
(rules, ths @ prems, bounds, depth, context)); |
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset
|
365 |
|
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multi-threaded simplification);
wenzelm
parents:
22717
diff
changeset
|
366 |
fun inherit_context (Simpset ({bounds, depth, context, ...}, _)) = |
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multi-threaded simplification);
wenzelm
parents:
22717
diff
changeset
|
367 |
map_simpset1 (fn (rules, prems, _, _, _) => (rules, prems, bounds, depth, context)); |
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset
|
368 |
|
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset
|
369 |
fun the_context (Simpset ({context = SOME ctxt, ...}, _)) = ctxt |
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset
|
370 |
| the_context _ = raise Fail "Simplifier: no proof context in simpset"; |
10413 | 371 |
|
17897 | 372 |
fun context ctxt = |
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multi-threaded simplification);
wenzelm
parents:
22717
diff
changeset
|
373 |
map_simpset1 (fn (rules, prems, bounds, depth, _) => (rules, prems, bounds, depth, SOME ctxt)); |
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset
|
374 |
|
42360 | 375 |
val global_context = context o Proof_Context.init_global; |
17897 | 376 |
|
27312
2a884461a9f3
activate_context: strict the_context, no fallback on theory context;
wenzelm
parents:
27022
diff
changeset
|
377 |
fun activate_context thy ss = |
2a884461a9f3
activate_context: strict the_context, no fallback on theory context;
wenzelm
parents:
27022
diff
changeset
|
378 |
let |
2a884461a9f3
activate_context: strict the_context, no fallback on theory context;
wenzelm
parents:
27022
diff
changeset
|
379 |
val ctxt = the_context ss; |
36545
5c5b5c7f1157
conditional warnings: explicitly observe context visibility flag, not just accidental presence of a context;
wenzelm
parents:
36543
diff
changeset
|
380 |
val ctxt' = ctxt |
42360 | 381 |
|> Context.raw_transfer (Theory.merge (thy, Proof_Context.theory_of ctxt)) |
36545
5c5b5c7f1157
conditional warnings: explicitly observe context visibility flag, not just accidental presence of a context;
wenzelm
parents:
36543
diff
changeset
|
382 |
|> Context_Position.set_visible false; |
27312
2a884461a9f3
activate_context: strict the_context, no fallback on theory context;
wenzelm
parents:
27022
diff
changeset
|
383 |
in context ctxt' ss end; |
17897 | 384 |
|
36545
5c5b5c7f1157
conditional warnings: explicitly observe context visibility flag, not just accidental presence of a context;
wenzelm
parents:
36543
diff
changeset
|
385 |
fun with_context ctxt f ss = inherit_context ss (f (context ctxt ss)); |
5c5b5c7f1157
conditional warnings: explicitly observe context visibility flag, not just accidental presence of a context;
wenzelm
parents:
36543
diff
changeset
|
386 |
|
17897 | 387 |
|
20028
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset
|
388 |
(* maintain simp rules *) |
10413 | 389 |
|
20546
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
390 |
(* FIXME: it seems that the conditions on extra variables are too liberal if |
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
391 |
prems are nonempty: does solving the prems really guarantee instantiation of |
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
392 |
all its Vars? Better: a dynamic check each time a rule is applied. |
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
393 |
*) |
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
394 |
fun rewrite_rule_extra_vars prems elhs erhs = |
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
395 |
let |
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
396 |
val elhss = elhs :: prems; |
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
397 |
val tvars = fold Term.add_tvars elhss []; |
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
398 |
val vars = fold Term.add_vars elhss []; |
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
399 |
in |
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
400 |
erhs |> Term.exists_type (Term.exists_subtype |
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
401 |
(fn TVar v => not (member (op =) tvars v) | _ => false)) orelse |
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
402 |
erhs |> Term.exists_subterm |
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
403 |
(fn Var v => not (member (op =) vars v) | _ => false) |
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
404 |
end; |
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
405 |
|
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
406 |
fun rrule_extra_vars elhs thm = |
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
407 |
rewrite_rule_extra_vars [] (term_of elhs) (Thm.full_prop_of thm); |
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
408 |
|
15023 | 409 |
fun mk_rrule2 {thm, name, lhs, elhs, perm} = |
410 |
let |
|
20546
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
411 |
val t = term_of elhs; |
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
412 |
val fo = Pattern.first_order t orelse not (Pattern.pattern t); |
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
413 |
val extra = rrule_extra_vars elhs thm; |
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
414 |
in {thm = thm, name = name, lhs = lhs, elhs = elhs, extra = extra, fo = fo, perm = perm} end; |
10413 | 415 |
|
20028
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset
|
416 |
fun del_rrule (rrule as {thm, elhs, ...}) ss = |
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multi-threaded simplification);
wenzelm
parents:
22717
diff
changeset
|
417 |
ss |> map_simpset1 (fn (rules, prems, bounds, depth, context) => |
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multi-threaded simplification);
wenzelm
parents:
22717
diff
changeset
|
418 |
(Net.delete_term eq_rrule (term_of elhs, rrule) rules, prems, bounds, depth, context)) |
20028
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset
|
419 |
handle Net.DELETE => (cond_warn_thm "Rewrite rule not in simpset:" ss thm; ss); |
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset
|
420 |
|
32797 | 421 |
fun insert_rrule (rrule as {thm, name, ...}) ss = |
22254 | 422 |
(trace_named_thm (fn () => "Adding rewrite rule") ss (thm, name); |
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multi-threaded simplification);
wenzelm
parents:
22717
diff
changeset
|
423 |
ss |> map_simpset1 (fn (rules, prems, bounds, depth, context) => |
15023 | 424 |
let |
425 |
val rrule2 as {elhs, ...} = mk_rrule2 rrule; |
|
16807 | 426 |
val rules' = Net.insert_term eq_rrule (term_of elhs, rrule2) rules; |
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multi-threaded simplification);
wenzelm
parents:
22717
diff
changeset
|
427 |
in (rules', prems, bounds, depth, context) end) |
20028
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset
|
428 |
handle Net.INSERT => (cond_warn_thm "Ignoring duplicate rewrite rule:" ss thm; ss)); |
10413 | 429 |
|
430 |
fun vperm (Var _, Var _) = true |
|
431 |
| vperm (Abs (_, _, s), Abs (_, _, t)) = vperm (s, t) |
|
432 |
| vperm (t1 $ t2, u1 $ u2) = vperm (t1, u1) andalso vperm (t2, u2) |
|
433 |
| vperm (t, u) = (t = u); |
|
434 |
||
435 |
fun var_perm (t, u) = |
|
33038 | 436 |
vperm (t, u) andalso eq_set (op =) (Term.add_vars t [], Term.add_vars u []); |
10413 | 437 |
|
15023 | 438 |
(*simple test for looping rewrite rules and stupid orientations*) |
18208 | 439 |
fun default_reorient thy prems lhs rhs = |
15023 | 440 |
rewrite_rule_extra_vars prems lhs rhs |
441 |
orelse |
|
442 |
is_Var (head_of lhs) |
|
443 |
orelse |
|
16305 | 444 |
(* turns t = x around, which causes a headache if x is a local variable - |
445 |
usually it is very useful :-( |
|
446 |
is_Free rhs andalso not(is_Free lhs) andalso not(Logic.occs(rhs,lhs)) |
|
447 |
andalso not(exists_subterm is_Var lhs) |
|
448 |
orelse |
|
449 |
*) |
|
16842 | 450 |
exists (fn t => Logic.occs (lhs, t)) (rhs :: prems) |
15023 | 451 |
orelse |
17203 | 452 |
null prems andalso Pattern.matches thy (lhs, rhs) |
10413 | 453 |
(*the condition "null prems" is necessary because conditional rewrites |
454 |
with extra variables in the conditions may terminate although |
|
15023 | 455 |
the rhs is an instance of the lhs; example: ?m < ?n ==> f(?n) == f(?m)*) |
456 |
orelse |
|
457 |
is_Const lhs andalso not (is_Const rhs); |
|
10413 | 458 |
|
459 |
fun decomp_simp thm = |
|
15023 | 460 |
let |
26626
c6231d64d264
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26424
diff
changeset
|
461 |
val thy = Thm.theory_of_thm thm; |
c6231d64d264
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26424
diff
changeset
|
462 |
val prop = Thm.prop_of thm; |
15023 | 463 |
val prems = Logic.strip_imp_prems prop; |
464 |
val concl = Drule.strip_imp_concl (Thm.cprop_of thm); |
|
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset
|
465 |
val (lhs, rhs) = Thm.dest_equals concl handle TERM _ => |
15023 | 466 |
raise SIMPLIFIER ("Rewrite rule not a meta-equality", thm); |
20579 | 467 |
val elhs = Thm.dest_arg (Thm.cprop_of (Thm.eta_conversion lhs)); |
18929 | 468 |
val erhs = Envir.eta_contract (term_of rhs); |
15023 | 469 |
val perm = |
470 |
var_perm (term_of elhs, erhs) andalso |
|
471 |
not (term_of elhs aconv erhs) andalso |
|
472 |
not (is_Var (term_of elhs)); |
|
16458 | 473 |
in (thy, prems, term_of lhs, elhs, term_of rhs, perm) end; |
10413 | 474 |
|
12783 | 475 |
fun decomp_simp' thm = |
12979
4c76bce4ce39
decomp_simp': use lhs instead of elhs (preserves more bound variable names);
wenzelm
parents:
12783
diff
changeset
|
476 |
let val (_, _, lhs, _, rhs, _) = decomp_simp thm in |
12783 | 477 |
if Thm.nprems_of thm > 0 then raise SIMPLIFIER ("Bad conditional rewrite rule", thm) |
12979
4c76bce4ce39
decomp_simp': use lhs instead of elhs (preserves more bound variable names);
wenzelm
parents:
12783
diff
changeset
|
478 |
else (lhs, rhs) |
12783 | 479 |
end; |
480 |
||
36543
0e7fc5bf38de
proper context for mksimps etc. -- via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset
|
481 |
fun mk_eq_True (ss as Simpset (_, {mk_rews = {mk_eq_True, ...}, ...})) (thm, name) = |
0e7fc5bf38de
proper context for mksimps etc. -- via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset
|
482 |
(case mk_eq_True ss thm of |
15531 | 483 |
NONE => [] |
484 |
| SOME eq_True => |
|
20546
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
485 |
let |
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
486 |
val (_, _, lhs, elhs, _, _) = decomp_simp eq_True; |
15023 | 487 |
in [{thm = eq_True, name = name, lhs = lhs, elhs = elhs, perm = false}] end); |
10413 | 488 |
|
15023 | 489 |
(*create the rewrite rule and possibly also the eq_True variant, |
490 |
in case there are extra vars on the rhs*) |
|
491 |
fun rrule_eq_True (thm, name, lhs, elhs, rhs, ss, thm2) = |
|
492 |
let val rrule = {thm = thm, name = name, lhs = lhs, elhs = elhs, perm = false} in |
|
20546
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
493 |
if rewrite_rule_extra_vars [] lhs rhs then |
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
494 |
mk_eq_True ss (thm2, name) @ [rrule] |
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
495 |
else [rrule] |
10413 | 496 |
end; |
497 |
||
15023 | 498 |
fun mk_rrule ss (thm, name) = |
499 |
let val (_, prems, lhs, elhs, rhs, perm) = decomp_simp thm in |
|
500 |
if perm then [{thm = thm, name = name, lhs = lhs, elhs = elhs, perm = true}] |
|
501 |
else |
|
502 |
(*weak test for loops*) |
|
503 |
if rewrite_rule_extra_vars prems lhs rhs orelse is_Var (term_of elhs) |
|
504 |
then mk_eq_True ss (thm, name) |
|
505 |
else rrule_eq_True (thm, name, lhs, elhs, rhs, ss, thm) |
|
10413 | 506 |
end; |
507 |
||
15023 | 508 |
fun orient_rrule ss (thm, name) = |
18208 | 509 |
let |
510 |
val (thy, prems, lhs, elhs, rhs, perm) = decomp_simp thm; |
|
511 |
val Simpset (_, {mk_rews = {reorient, mk_sym, ...}, ...}) = ss; |
|
512 |
in |
|
15023 | 513 |
if perm then [{thm = thm, name = name, lhs = lhs, elhs = elhs, perm = true}] |
16458 | 514 |
else if reorient thy prems lhs rhs then |
515 |
if reorient thy prems rhs lhs |
|
15023 | 516 |
then mk_eq_True ss (thm, name) |
517 |
else |
|
36543
0e7fc5bf38de
proper context for mksimps etc. -- via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset
|
518 |
(case mk_sym ss thm of |
18208 | 519 |
NONE => [] |
520 |
| SOME thm' => |
|
521 |
let val (_, _, lhs', elhs', rhs', _) = decomp_simp thm' |
|
522 |
in rrule_eq_True (thm', name, lhs', elhs', rhs', ss, thm) end) |
|
15023 | 523 |
else rrule_eq_True (thm, name, lhs, elhs, rhs, ss, thm) |
10413 | 524 |
end; |
525 |
||
36543
0e7fc5bf38de
proper context for mksimps etc. -- via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset
|
526 |
fun extract_rews (ss as Simpset (_, {mk_rews = {mk, ...}, ...}), thms) = |
0e7fc5bf38de
proper context for mksimps etc. -- via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset
|
527 |
maps (fn thm => map (rpair (Thm.get_name_hint thm)) (mk ss thm)) thms; |
10413 | 528 |
|
15023 | 529 |
fun extract_safe_rrules (ss, thm) = |
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19303
diff
changeset
|
530 |
maps (orient_rrule ss) (extract_rews (ss, [thm])); |
10413 | 531 |
|
532 |
||
20028
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset
|
533 |
(* add/del rules explicitly *) |
10413 | 534 |
|
20028
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset
|
535 |
fun comb_simps comb mk_rrule (ss, thms) = |
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset
|
536 |
let |
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset
|
537 |
val rews = extract_rews (ss, thms); |
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset
|
538 |
in fold (fold comb o mk_rrule) rews ss end; |
10413 | 539 |
|
20028
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset
|
540 |
fun ss addsimps thms = |
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset
|
541 |
comb_simps insert_rrule (mk_rrule ss) (ss, thms); |
10413 | 542 |
|
15023 | 543 |
fun ss delsimps thms = |
20028
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset
|
544 |
comb_simps del_rrule (map mk_rrule2 o mk_rrule ss) (ss, thms); |
15023 | 545 |
|
27558 | 546 |
fun add_simp thm ss = ss addsimps [thm]; |
547 |
fun del_simp thm ss = ss delsimps [thm]; |
|
15023 | 548 |
|
30318
3d03190d2864
replaced archaic use of rep_ss by Simplifier.mksimps;
wenzelm
parents:
29269
diff
changeset
|
549 |
|
15023 | 550 |
(* congs *) |
10413 | 551 |
|
15023 | 552 |
local |
553 |
||
554 |
fun is_full_cong_prems [] [] = true |
|
555 |
| is_full_cong_prems [] _ = false |
|
556 |
| is_full_cong_prems (p :: prems) varpairs = |
|
557 |
(case Logic.strip_assums_concl p of |
|
558 |
Const ("==", _) $ lhs $ rhs => |
|
559 |
let val (x, xs) = strip_comb lhs and (y, ys) = strip_comb rhs in |
|
560 |
is_Var x andalso forall is_Bound xs andalso |
|
20972 | 561 |
not (has_duplicates (op =) xs) andalso xs = ys andalso |
20671 | 562 |
member (op =) varpairs (x, y) andalso |
19303 | 563 |
is_full_cong_prems prems (remove (op =) (x, y) varpairs) |
15023 | 564 |
end |
565 |
| _ => false); |
|
566 |
||
567 |
fun is_full_cong thm = |
|
10413 | 568 |
let |
43597 | 569 |
val prems = Thm.prems_of thm and concl = Thm.concl_of thm; |
15023 | 570 |
val (lhs, rhs) = Logic.dest_equals concl; |
571 |
val (f, xs) = strip_comb lhs and (g, ys) = strip_comb rhs; |
|
10413 | 572 |
in |
20972 | 573 |
f = g andalso not (has_duplicates (op =) (xs @ ys)) andalso length xs = length ys andalso |
15023 | 574 |
is_full_cong_prems prems (xs ~~ ys) |
10413 | 575 |
end; |
576 |
||
45620
f2a587696afb
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45405
diff
changeset
|
577 |
fun mk_cong (ss as Simpset (_, {mk_rews = {mk_cong = f, ...}, ...})) = f ss; |
f2a587696afb
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45405
diff
changeset
|
578 |
|
f2a587696afb
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45405
diff
changeset
|
579 |
in |
f2a587696afb
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45405
diff
changeset
|
580 |
|
f2a587696afb
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45405
diff
changeset
|
581 |
fun add_eqcong thm ss = ss |> |
15023 | 582 |
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) => |
583 |
let |
|
45621 | 584 |
val (lhs, _) = Logic.dest_equals (Thm.concl_of thm) |
15023 | 585 |
handle TERM _ => raise SIMPLIFIER ("Congruence not a meta-equality", thm); |
18929 | 586 |
(*val lhs = Envir.eta_contract lhs;*) |
45621 | 587 |
val a = the (cong_name (head_of lhs)) handle Option.Option => |
15023 | 588 |
raise SIMPLIFIER ("Congruence must start with a constant or free variable", thm); |
22221
8a8aa6114a89
changed cong alist - now using AList operations instead of overwrite_warn
haftmann
parents:
22008
diff
changeset
|
589 |
val (xs, weak) = congs; |
38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
590 |
val _ = |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
591 |
if AList.defined (op =) xs a |
51590 | 592 |
then if_visible ss warning ("Overwriting congruence rule for " ^ quote (#2 a)) |
22221
8a8aa6114a89
changed cong alist - now using AList operations instead of overwrite_warn
haftmann
parents:
22008
diff
changeset
|
593 |
else (); |
30908
7ccf4a3d764c
replace type cong = {thm : thm, lhs : term} by plain thm -- the other component has been unused for a long time.
krauss
parents:
30552
diff
changeset
|
594 |
val xs' = AList.update (op =) (a, thm) xs; |
22221
8a8aa6114a89
changed cong alist - now using AList operations instead of overwrite_warn
haftmann
parents:
22008
diff
changeset
|
595 |
val weak' = if is_full_cong thm then weak else a :: weak; |
8a8aa6114a89
changed cong alist - now using AList operations instead of overwrite_warn
haftmann
parents:
22008
diff
changeset
|
596 |
in ((xs', weak'), procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) end); |
10413 | 597 |
|
45620
f2a587696afb
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45405
diff
changeset
|
598 |
fun del_eqcong thm ss = ss |> |
15023 | 599 |
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) => |
600 |
let |
|
45621 | 601 |
val (lhs, _) = Logic.dest_equals (Thm.concl_of thm) |
602 |
handle TERM _ => raise SIMPLIFIER ("Congruence not a meta-equality", thm); |
|
18929 | 603 |
(*val lhs = Envir.eta_contract lhs;*) |
20057 | 604 |
val a = the (cong_name (head_of lhs)) handle Option.Option => |
15023 | 605 |
raise SIMPLIFIER ("Congruence must start with a constant", thm); |
22221
8a8aa6114a89
changed cong alist - now using AList operations instead of overwrite_warn
haftmann
parents:
22008
diff
changeset
|
606 |
val (xs, _) = congs; |
51590 | 607 |
val xs' = filter_out (fn (x : cong_name, _) => x = a) xs; |
30908
7ccf4a3d764c
replace type cong = {thm : thm, lhs : term} by plain thm -- the other component has been unused for a long time.
krauss
parents:
30552
diff
changeset
|
608 |
val weak' = xs' |> map_filter (fn (a, thm) => |
15531 | 609 |
if is_full_cong thm then NONE else SOME a); |
22221
8a8aa6114a89
changed cong alist - now using AList operations instead of overwrite_warn
haftmann
parents:
22008
diff
changeset
|
610 |
in ((xs', weak'), procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) end); |
10413 | 611 |
|
45620
f2a587696afb
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45405
diff
changeset
|
612 |
fun add_cong thm ss = add_eqcong (mk_cong ss thm) ss; |
f2a587696afb
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45405
diff
changeset
|
613 |
fun del_cong thm ss = del_eqcong (mk_cong ss thm) ss; |
15023 | 614 |
|
615 |
end; |
|
10413 | 616 |
|
617 |
||
15023 | 618 |
(* simprocs *) |
619 |
||
22234 | 620 |
datatype simproc = |
621 |
Simproc of |
|
622 |
{name: string, |
|
623 |
lhss: cterm list, |
|
624 |
proc: morphism -> simpset -> cterm -> thm option, |
|
625 |
id: stamp * thm list}; |
|
626 |
||
627 |
fun eq_simproc (Simproc {id = id1, ...}, Simproc {id = id2, ...}) = eq_procid (id1, id2); |
|
22008 | 628 |
|
45290 | 629 |
fun transform_simproc phi (Simproc {name, lhss, proc, id = (s, ths)}) = |
22234 | 630 |
Simproc |
631 |
{name = name, |
|
632 |
lhss = map (Morphism.cterm phi) lhss, |
|
22669 | 633 |
proc = Morphism.transform phi proc, |
22234 | 634 |
id = (s, Morphism.fact phi ths)}; |
635 |
||
636 |
fun make_simproc {name, lhss, proc, identifier} = |
|
637 |
Simproc {name = name, lhss = lhss, proc = proc, id = (stamp (), identifier)}; |
|
22008 | 638 |
|
639 |
fun mk_simproc name lhss proc = |
|
22234 | 640 |
make_simproc {name = name, lhss = lhss, proc = fn _ => fn ss => fn ct => |
42360 | 641 |
proc (Proof_Context.theory_of (the_context ss)) ss (Thm.term_of ct), identifier = []}; |
22008 | 642 |
|
35845
e5980f0ad025
renamed varify/unvarify operations to varify_global/unvarify_global to emphasize that these only work in a global situation;
wenzelm
parents:
35408
diff
changeset
|
643 |
(* FIXME avoid global thy and Logic.varify_global *) |
38715
6513ea67d95d
renamed Simplifier.simproc(_i) to Simplifier.simproc_global(_i) to emphasize that this is not the real thing;
wenzelm
parents:
36944
diff
changeset
|
644 |
fun simproc_global_i thy name = mk_simproc name o map (Thm.cterm_of thy o Logic.varify_global); |
6513ea67d95d
renamed Simplifier.simproc(_i) to Simplifier.simproc_global(_i) to emphasize that this is not the real thing;
wenzelm
parents:
36944
diff
changeset
|
645 |
fun simproc_global thy name = simproc_global_i thy name o map (Syntax.read_term_global thy); |
22008 | 646 |
|
647 |
||
15023 | 648 |
local |
10413 | 649 |
|
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset
|
650 |
fun add_proc (proc as Proc {name, lhs, ...}) ss = |
22254 | 651 |
(trace_cterm false (fn () => "Adding simplification procedure " ^ quote name ^ " for") ss lhs; |
15023 | 652 |
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) => |
16807 | 653 |
(congs, Net.insert_term eq_proc (term_of lhs, proc) procs, |
15023 | 654 |
mk_rews, termless, subgoal_tac, loop_tacs, solvers)) ss |
655 |
handle Net.INSERT => |
|
38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
656 |
(if_visible ss warning ("Ignoring duplicate simplification procedure " ^ quote name); ss)); |
10413 | 657 |
|
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset
|
658 |
fun del_proc (proc as Proc {name, lhs, ...}) ss = |
15023 | 659 |
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) => |
16807 | 660 |
(congs, Net.delete_term eq_proc (term_of lhs, proc) procs, |
15023 | 661 |
mk_rews, termless, subgoal_tac, loop_tacs, solvers)) ss |
662 |
handle Net.DELETE => |
|
38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
663 |
(if_visible ss warning ("Simplification procedure " ^ quote name ^ " not in simpset"); ss); |
10413 | 664 |
|
22234 | 665 |
fun prep_procs (Simproc {name, lhss, proc, id}) = |
22669 | 666 |
lhss |> map (fn lhs => Proc {name = name, lhs = lhs, proc = Morphism.form proc, id = id}); |
22234 | 667 |
|
15023 | 668 |
in |
10413 | 669 |
|
22234 | 670 |
fun ss addsimprocs ps = fold (fold add_proc o prep_procs) ps ss; |
671 |
fun ss delsimprocs ps = fold (fold del_proc o prep_procs) ps ss; |
|
10413 | 672 |
|
15023 | 673 |
end; |
10413 | 674 |
|
675 |
||
676 |
(* mk_rews *) |
|
677 |
||
15023 | 678 |
local |
679 |
||
18208 | 680 |
fun map_mk_rews f = map_simpset2 (fn (congs, procs, {mk, mk_cong, mk_sym, mk_eq_True, reorient}, |
15023 | 681 |
termless, subgoal_tac, loop_tacs, solvers) => |
18208 | 682 |
let |
683 |
val (mk', mk_cong', mk_sym', mk_eq_True', reorient') = |
|
684 |
f (mk, mk_cong, mk_sym, mk_eq_True, reorient); |
|
685 |
val mk_rews' = {mk = mk', mk_cong = mk_cong', mk_sym = mk_sym', mk_eq_True = mk_eq_True', |
|
686 |
reorient = reorient'}; |
|
687 |
in (congs, procs, mk_rews', termless, subgoal_tac, loop_tacs, solvers) end); |
|
15023 | 688 |
|
689 |
in |
|
10413 | 690 |
|
36543
0e7fc5bf38de
proper context for mksimps etc. -- via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset
|
691 |
fun mksimps (ss as Simpset (_, {mk_rews = {mk, ...}, ...})) = mk ss; |
30318
3d03190d2864
replaced archaic use of rep_ss by Simplifier.mksimps;
wenzelm
parents:
29269
diff
changeset
|
692 |
|
45625
750c5a47400b
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45621
diff
changeset
|
693 |
fun set_mksimps mk = map_mk_rews (fn (_, mk_cong, mk_sym, mk_eq_True, reorient) => |
18208 | 694 |
(mk, mk_cong, mk_sym, mk_eq_True, reorient)); |
15023 | 695 |
|
45625
750c5a47400b
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45621
diff
changeset
|
696 |
fun set_mkcong mk_cong = map_mk_rews (fn (mk, _, mk_sym, mk_eq_True, reorient) => |
18208 | 697 |
(mk, mk_cong, mk_sym, mk_eq_True, reorient)); |
10413 | 698 |
|
45625
750c5a47400b
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45621
diff
changeset
|
699 |
fun set_mksym mk_sym = map_mk_rews (fn (mk, mk_cong, _, mk_eq_True, reorient) => |
18208 | 700 |
(mk, mk_cong, mk_sym, mk_eq_True, reorient)); |
10413 | 701 |
|
45625
750c5a47400b
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45621
diff
changeset
|
702 |
fun set_mkeqTrue mk_eq_True = map_mk_rews (fn (mk, mk_cong, mk_sym, _, reorient) => |
18208 | 703 |
(mk, mk_cong, mk_sym, mk_eq_True, reorient)); |
704 |
||
705 |
fun set_reorient reorient = map_mk_rews (fn (mk, mk_cong, mk_sym, mk_eq_True, _) => |
|
706 |
(mk, mk_cong, mk_sym, mk_eq_True, reorient)); |
|
15023 | 707 |
|
708 |
end; |
|
709 |
||
14242
ec70653a02bf
Added access to the mk_rews field (and friends).
skalberg
parents:
14040
diff
changeset
|
710 |
|
10413 | 711 |
(* termless *) |
712 |
||
45625
750c5a47400b
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45621
diff
changeset
|
713 |
fun set_termless termless = |
15023 | 714 |
map_simpset2 (fn (congs, procs, mk_rews, _, subgoal_tac, loop_tacs, solvers) => |
715 |
(congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers)); |
|
15006
107e4dfd3b96
Merging the meta-simplifier with the Provers-simplifier. Next step:
skalberg
parents:
15001
diff
changeset
|
716 |
|
107e4dfd3b96
Merging the meta-simplifier with the Provers-simplifier. Next step:
skalberg
parents:
15001
diff
changeset
|
717 |
|
15023 | 718 |
(* tactics *) |
15006
107e4dfd3b96
Merging the meta-simplifier with the Provers-simplifier. Next step:
skalberg
parents:
15001
diff
changeset
|
719 |
|
45625
750c5a47400b
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45621
diff
changeset
|
720 |
fun set_subgoaler subgoal_tac = |
15023 | 721 |
map_simpset2 (fn (congs, procs, mk_rews, termless, _, loop_tacs, solvers) => |
722 |
(congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers)); |
|
15006
107e4dfd3b96
Merging the meta-simplifier with the Provers-simplifier. Next step:
skalberg
parents:
15001
diff
changeset
|
723 |
|
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset
|
724 |
fun ss setloop' tac = ss |> |
15023 | 725 |
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, _, solvers) => |
726 |
(congs, procs, mk_rews, termless, subgoal_tac, [("", tac)], solvers)); |
|
15006
107e4dfd3b96
Merging the meta-simplifier with the Provers-simplifier. Next step:
skalberg
parents:
15001
diff
changeset
|
727 |
|
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset
|
728 |
fun ss setloop tac = ss setloop' (K tac); |
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset
|
729 |
|
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset
|
730 |
fun ss addloop' (name, tac) = ss |> |
15023 | 731 |
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) => |
732 |
(congs, procs, mk_rews, termless, subgoal_tac, |
|
38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
733 |
(if AList.defined (op =) loop_tacs name |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
734 |
then if_visible ss warning ("Overwriting looper " ^ quote name) |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
735 |
else (); AList.update (op =) (name, tac) loop_tacs), solvers)); |
15006
107e4dfd3b96
Merging the meta-simplifier with the Provers-simplifier. Next step:
skalberg
parents:
15001
diff
changeset
|
736 |
|
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset
|
737 |
fun ss addloop (name, tac) = ss addloop' (name, K tac); |
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset
|
738 |
|
15023 | 739 |
fun ss delloop name = ss |> |
740 |
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) => |
|
21286
b5e7b80caa6a
introduces canonical AList functions for loop_tacs
haftmann
parents:
20972
diff
changeset
|
741 |
(congs, procs, mk_rews, termless, subgoal_tac, |
38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
742 |
(if AList.defined (op =) loop_tacs name then () |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
743 |
else if_visible ss warning ("No such looper in simpset: " ^ quote name); |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
744 |
AList.delete (op =) name loop_tacs), solvers)); |
15006
107e4dfd3b96
Merging the meta-simplifier with the Provers-simplifier. Next step:
skalberg
parents:
15001
diff
changeset
|
745 |
|
15023 | 746 |
fun ss setSSolver solver = ss |> map_simpset2 (fn (congs, procs, mk_rews, termless, |
747 |
subgoal_tac, loop_tacs, (unsafe_solvers, _)) => |
|
748 |
(congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, (unsafe_solvers, [solver]))); |
|
15006
107e4dfd3b96
Merging the meta-simplifier with the Provers-simplifier. Next step:
skalberg
parents:
15001
diff
changeset
|
749 |
|
15023 | 750 |
fun ss addSSolver solver = ss |> map_simpset2 (fn (congs, procs, mk_rews, termless, |
751 |
subgoal_tac, loop_tacs, (unsafe_solvers, solvers)) => (congs, procs, mk_rews, termless, |
|
22717 | 752 |
subgoal_tac, loop_tacs, (unsafe_solvers, insert eq_solver solver solvers))); |
15006
107e4dfd3b96
Merging the meta-simplifier with the Provers-simplifier. Next step:
skalberg
parents:
15001
diff
changeset
|
753 |
|
15023 | 754 |
fun ss setSolver solver = ss |> map_simpset2 (fn (congs, procs, mk_rews, termless, |
755 |
subgoal_tac, loop_tacs, (_, solvers)) => (congs, procs, mk_rews, termless, |
|
756 |
subgoal_tac, loop_tacs, ([solver], solvers))); |
|
15006
107e4dfd3b96
Merging the meta-simplifier with the Provers-simplifier. Next step:
skalberg
parents:
15001
diff
changeset
|
757 |
|
15023 | 758 |
fun ss addSolver solver = ss |> map_simpset2 (fn (congs, procs, mk_rews, termless, |
759 |
subgoal_tac, loop_tacs, (unsafe_solvers, solvers)) => (congs, procs, mk_rews, termless, |
|
22717 | 760 |
subgoal_tac, loop_tacs, (insert eq_solver solver unsafe_solvers, solvers))); |
15006
107e4dfd3b96
Merging the meta-simplifier with the Provers-simplifier. Next step:
skalberg
parents:
15001
diff
changeset
|
761 |
|
15023 | 762 |
fun set_solvers solvers = map_simpset2 (fn (congs, procs, mk_rews, termless, |
763 |
subgoal_tac, loop_tacs, _) => (congs, procs, mk_rews, termless, |
|
764 |
subgoal_tac, loop_tacs, (solvers, solvers))); |
|
15006
107e4dfd3b96
Merging the meta-simplifier with the Provers-simplifier. Next step:
skalberg
parents:
15001
diff
changeset
|
765 |
|
107e4dfd3b96
Merging the meta-simplifier with the Provers-simplifier. Next step:
skalberg
parents:
15001
diff
changeset
|
766 |
|
18208 | 767 |
(* empty *) |
768 |
||
769 |
fun init_ss mk_rews termless subgoal_tac solvers = |
|
32738 | 770 |
make_simpset ((Net.empty, [], (0, []), (0, Unsynchronized.ref false), NONE), |
18208 | 771 |
(([], []), Net.empty, mk_rews, termless, subgoal_tac, [], solvers)); |
772 |
||
773 |
fun clear_ss (ss as Simpset (_, {mk_rews, termless, subgoal_tac, solvers, ...})) = |
|
774 |
init_ss mk_rews termless subgoal_tac solvers |
|
775 |
|> inherit_context ss; |
|
776 |
||
47239 | 777 |
fun default_mk_sym _ th = SOME (th RS Drule.symmetric_thm); |
778 |
||
36543
0e7fc5bf38de
proper context for mksimps etc. -- via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset
|
779 |
val empty_ss = |
0e7fc5bf38de
proper context for mksimps etc. -- via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset
|
780 |
init_ss |
0e7fc5bf38de
proper context for mksimps etc. -- via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset
|
781 |
{mk = fn _ => fn th => if can Logic.dest_equals (Thm.concl_of th) then [th] else [], |
0e7fc5bf38de
proper context for mksimps etc. -- via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset
|
782 |
mk_cong = K I, |
47239 | 783 |
mk_sym = default_mk_sym, |
36543
0e7fc5bf38de
proper context for mksimps etc. -- via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset
|
784 |
mk_eq_True = K (K NONE), |
0e7fc5bf38de
proper context for mksimps etc. -- via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset
|
785 |
reorient = default_reorient} |
0e7fc5bf38de
proper context for mksimps etc. -- via simpset of the running Simplifier;
wenzelm
parents:
36354
diff
changeset
|
786 |
Term_Ord.termless (K (K no_tac)) ([], []); |
18208 | 787 |
|
788 |
||
789 |
(* merge *) (*NOTE: ignores some fields of 2nd simpset*) |
|
790 |
||
791 |
fun merge_ss (ss1, ss2) = |
|
24358 | 792 |
if pointer_eq (ss1, ss2) then ss1 |
793 |
else |
|
794 |
let |
|
795 |
val Simpset ({rules = rules1, prems = prems1, bounds = bounds1, depth = depth1, context = _}, |
|
796 |
{congs = (congs1, weak1), procs = procs1, mk_rews, termless, subgoal_tac, |
|
797 |
loop_tacs = loop_tacs1, solvers = (unsafe_solvers1, solvers1)}) = ss1; |
|
798 |
val Simpset ({rules = rules2, prems = prems2, bounds = bounds2, depth = depth2, context = _}, |
|
799 |
{congs = (congs2, weak2), procs = procs2, mk_rews = _, termless = _, subgoal_tac = _, |
|
800 |
loop_tacs = loop_tacs2, solvers = (unsafe_solvers2, solvers2)}) = ss2; |
|
30356 | 801 |
|
24358 | 802 |
val rules' = Net.merge eq_rrule (rules1, rules2); |
33520 | 803 |
val prems' = Thm.merge_thms (prems1, prems2); |
24358 | 804 |
val bounds' = if #1 bounds1 < #1 bounds2 then bounds2 else bounds1; |
805 |
val depth' = if #1 depth1 < #1 depth2 then depth2 else depth1; |
|
31298 | 806 |
val congs' = merge (Thm.eq_thm_prop o pairself #2) (congs1, congs2); |
24358 | 807 |
val weak' = merge (op =) (weak1, weak2); |
808 |
val procs' = Net.merge eq_proc (procs1, procs2); |
|
809 |
val loop_tacs' = AList.merge (op =) (K true) (loop_tacs1, loop_tacs2); |
|
810 |
val unsafe_solvers' = merge eq_solver (unsafe_solvers1, unsafe_solvers2); |
|
811 |
val solvers' = merge eq_solver (solvers1, solvers2); |
|
812 |
in |
|
813 |
make_simpset ((rules', prems', bounds', depth', NONE), ((congs', weak'), procs', |
|
814 |
mk_rews, termless, subgoal_tac, loop_tacs', (unsafe_solvers', solvers'))) |
|
815 |
end; |
|
18208 | 816 |
|
817 |
||
30356 | 818 |
(* dest_ss *) |
819 |
||
820 |
fun dest_ss (Simpset ({rules, ...}, {congs, procs, loop_tacs, solvers, ...})) = |
|
821 |
{simps = Net.entries rules |
|
822 |
|> map (fn {name, thm, ...} => (name, thm)), |
|
823 |
procs = Net.entries procs |
|
824 |
|> map (fn Proc {name, lhs, id, ...} => ((name, lhs), id)) |
|
825 |
|> partition_eq (eq_snd eq_procid) |
|
826 |
|> map (fn ps => (fst (fst (hd ps)), map (snd o fst) ps)), |
|
30908
7ccf4a3d764c
replace type cong = {thm : thm, lhs : term} by plain thm -- the other component has been unused for a long time.
krauss
parents:
30552
diff
changeset
|
827 |
congs = #1 congs, |
30356 | 828 |
weak_congs = #2 congs, |
829 |
loopers = map fst loop_tacs, |
|
830 |
unsafe_solvers = map solver_name (#1 solvers), |
|
831 |
safe_solvers = map solver_name (#2 solvers)}; |
|
832 |
||
833 |
||
15006
107e4dfd3b96
Merging the meta-simplifier with the Provers-simplifier. Next step:
skalberg
parents:
15001
diff
changeset
|
834 |
|
10413 | 835 |
(** rewriting **) |
836 |
||
837 |
(* |
|
838 |
Uses conversions, see: |
|
839 |
L C Paulson, A higher-order implementation of rewriting, |
|
840 |
Science of Computer Programming 3 (1983), pages 119-149. |
|
841 |
*) |
|
842 |
||
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset
|
843 |
fun check_conv msg ss thm thm' = |
10413 | 844 |
let |
36944 | 845 |
val thm'' = Thm.transitive thm thm' handle THM _ => |
846 |
Thm.transitive thm (Thm.transitive |
|
847 |
(Thm.symmetric (Drule.beta_eta_conversion (Thm.lhs_of thm'))) thm') |
|
22254 | 848 |
in if msg then trace_thm (fn () => "SUCCEEDED") ss thm' else (); SOME thm'' end |
10413 | 849 |
handle THM _ => |
26626
c6231d64d264
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26424
diff
changeset
|
850 |
let |
c6231d64d264
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26424
diff
changeset
|
851 |
val _ $ _ $ prop0 = Thm.prop_of thm; |
c6231d64d264
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26424
diff
changeset
|
852 |
in |
22254 | 853 |
trace_thm (fn () => "Proved wrong thm (Check subgoaler?)") ss thm'; |
35979
12bb31230550
replaced references 'trace_simp' and 'debug_simp' by configuration options stored in the context
boehmes
parents:
35845
diff
changeset
|
854 |
trace_term false (fn () => "Should have proved:") ss prop0; |
15531 | 855 |
NONE |
10413 | 856 |
end; |
857 |
||
858 |
||
859 |
(* mk_procrule *) |
|
860 |
||
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset
|
861 |
fun mk_procrule ss thm = |
15023 | 862 |
let val (_, prems, lhs, elhs, rhs, _) = decomp_simp thm in |
863 |
if rewrite_rule_extra_vars prems lhs rhs |
|
38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
864 |
then (cond_warn_thm "Extra vars on rhs:" ss thm; []) |
15023 | 865 |
else [mk_rrule2 {thm = thm, name = "", lhs = lhs, elhs = elhs, perm = false}] |
10413 | 866 |
end; |
867 |
||
868 |
||
15023 | 869 |
(* rewritec: conversion to apply the meta simpset to a term *) |
10413 | 870 |
|
15023 | 871 |
(*Since the rewriting strategy is bottom-up, we avoid re-normalizing already |
872 |
normalized terms by carrying around the rhs of the rewrite rule just |
|
873 |
applied. This is called the `skeleton'. It is decomposed in parallel |
|
874 |
with the term. Once a Var is encountered, the corresponding term is |
|
875 |
already in normal form. |
|
876 |
skel0 is a dummy skeleton that is to enforce complete normalization.*) |
|
877 |
||
10413 | 878 |
val skel0 = Bound 0; |
879 |
||
15023 | 880 |
(*Use rhs as skeleton only if the lhs does not contain unnormalized bits. |
881 |
The latter may happen iff there are weak congruence rules for constants |
|
882 |
in the lhs.*) |
|
10413 | 883 |
|
15023 | 884 |
fun uncond_skel ((_, weak), (lhs, rhs)) = |
885 |
if null weak then rhs (*optimization*) |
|
51591
e4aeb102ad70
amended uncond_skel to observe notion of cong_name properly -- may affect simplification with Free congs;
wenzelm
parents:
51590
diff
changeset
|
886 |
else if exists_subterm |
e4aeb102ad70
amended uncond_skel to observe notion of cong_name properly -- may affect simplification with Free congs;
wenzelm
parents:
51590
diff
changeset
|
887 |
(fn Const (a, _) => member (op =) weak (true, a) |
e4aeb102ad70
amended uncond_skel to observe notion of cong_name properly -- may affect simplification with Free congs;
wenzelm
parents:
51590
diff
changeset
|
888 |
| Free (a, _) => member (op =) weak (false, a) |
e4aeb102ad70
amended uncond_skel to observe notion of cong_name properly -- may affect simplification with Free congs;
wenzelm
parents:
51590
diff
changeset
|
889 |
| _ => false) lhs then skel0 |
15023 | 890 |
else rhs; |
891 |
||
892 |
(*Behaves like unconditional rule if rhs does not contain vars not in the lhs. |
|
893 |
Otherwise those vars may become instantiated with unnormalized terms |
|
894 |
while the premises are solved.*) |
|
895 |
||
32797 | 896 |
fun cond_skel (args as (_, (lhs, rhs))) = |
33038 | 897 |
if subset (op =) (Term.add_vars rhs [], Term.add_vars lhs []) then uncond_skel args |
10413 | 898 |
else skel0; |
899 |
||
900 |
(* |
|
15023 | 901 |
Rewriting -- we try in order: |
10413 | 902 |
(1) beta reduction |
903 |
(2) unconditional rewrite rules |
|
904 |
(3) conditional rewrite rules |
|
905 |
(4) simplification procedures |
|
906 |
||
907 |
IMPORTANT: rewrite rules must not introduce new Vars or TVars! |
|
908 |
*) |
|
909 |
||
16458 | 910 |
fun rewritec (prover, thyt, maxt) ss t = |
10413 | 911 |
let |
24124
4399175e3014
turned simp_depth_limit into configuration option;
wenzelm
parents:
23938
diff
changeset
|
912 |
val ctxt = the_context ss; |
15023 | 913 |
val Simpset ({rules, ...}, {congs, procs, termless, ...}) = ss; |
10413 | 914 |
val eta_thm = Thm.eta_conversion t; |
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset
|
915 |
val eta_t' = Thm.rhs_of eta_thm; |
10413 | 916 |
val eta_t = term_of eta_t'; |
20546
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
917 |
fun rew {thm, name, lhs, elhs, extra, fo, perm} = |
10413 | 918 |
let |
32797 | 919 |
val prop = Thm.prop_of thm; |
20546
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
920 |
val (rthm, elhs') = |
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset
|
921 |
if maxt = ~1 orelse not extra then (thm, elhs) |
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset
|
922 |
else (Thm.incr_indexes (maxt + 1) thm, Thm.incr_indexes_cterm (maxt + 1) elhs); |
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset
|
923 |
val insts = |
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset
|
924 |
if fo then Thm.first_order_match (elhs', eta_t') |
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset
|
925 |
else Thm.match (elhs', eta_t'); |
10413 | 926 |
val thm' = Thm.instantiate insts (Thm.rename_boundvars lhs eta_t rthm); |
14643 | 927 |
val prop' = Thm.prop_of thm'; |
21576 | 928 |
val unconditional = (Logic.count_prems prop' = 0); |
10413 | 929 |
val (lhs', rhs') = Logic.dest_equals (Logic.strip_imp_concl prop') |
930 |
in |
|
11295 | 931 |
if perm andalso not (termless (rhs', lhs')) |
22254 | 932 |
then (trace_named_thm (fn () => "Cannot apply permutative rewrite rule") ss (thm, name); |
933 |
trace_thm (fn () => "Term does not become smaller:") ss thm'; NONE) |
|
934 |
else (trace_named_thm (fn () => "Applying instance of rewrite rule") ss (thm, name); |
|
10413 | 935 |
if unconditional |
936 |
then |
|
22254 | 937 |
(trace_thm (fn () => "Rewriting:") ss thm'; |
38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
938 |
let |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
939 |
val lr = Logic.dest_equals prop; |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
940 |
val SOME thm'' = check_conv false ss eta_thm thm'; |
15531 | 941 |
in SOME (thm'', uncond_skel (congs, lr)) end) |
10413 | 942 |
else |
22254 | 943 |
(trace_thm (fn () => "Trying to rewrite:") ss thm'; |
24124
4399175e3014
turned simp_depth_limit into configuration option;
wenzelm
parents:
23938
diff
changeset
|
944 |
if simp_depth ss > Config.get ctxt simp_depth_limit |
38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
945 |
then |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
946 |
let |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
947 |
val s = "simp_depth_limit exceeded - giving up"; |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
948 |
val _ = trace false (fn () => s) ss; |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
949 |
val _ = if_visible ss warning s; |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
950 |
in NONE end |
16042 | 951 |
else |
952 |
case prover ss thm' of |
|
22254 | 953 |
NONE => (trace_thm (fn () => "FAILED") ss thm'; NONE) |
15531 | 954 |
| SOME thm2 => |
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset
|
955 |
(case check_conv true ss eta_thm thm2 of |
15531 | 956 |
NONE => NONE | |
957 |
SOME thm2' => |
|
10413 | 958 |
let val concl = Logic.strip_imp_concl prop |
959 |
val lr = Logic.dest_equals concl |
|
16042 | 960 |
in SOME (thm2', cond_skel (congs, lr)) end))) |
10413 | 961 |
end |
962 |
||
15531 | 963 |
fun rews [] = NONE |
10413 | 964 |
| rews (rrule :: rrules) = |
15531 | 965 |
let val opt = rew rrule handle Pattern.MATCH => NONE |
966 |
in case opt of NONE => rews rrules | some => some end; |
|
10413 | 967 |
|
38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
968 |
fun sort_rrules rrs = |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
969 |
let |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
970 |
fun is_simple ({thm, ...}: rrule) = |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
971 |
(case Thm.prop_of thm of |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
972 |
Const ("==", _) $ _ $ _ => true |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
973 |
| _ => false); |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
974 |
fun sort [] (re1, re2) = re1 @ re2 |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
975 |
| sort (rr :: rrs) (re1, re2) = |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
976 |
if is_simple rr |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
977 |
then sort rrs (rr :: re1, re2) |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
978 |
else sort rrs (re1, rr :: re2); |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
979 |
in sort rrs ([], []) end; |
10413 | 980 |
|
15531 | 981 |
fun proc_rews [] = NONE |
15023 | 982 |
| proc_rews (Proc {name, proc, lhs, ...} :: ps) = |
17203 | 983 |
if Pattern.matches thyt (Thm.term_of lhs, Thm.term_of t) then |
35979
12bb31230550
replaced references 'trace_simp' and 'debug_simp' by configuration options stored in the context
boehmes
parents:
35845
diff
changeset
|
984 |
(debug_term false (fn () => "Trying procedure " ^ quote name ^ " on:") ss eta_t; |
23938 | 985 |
case proc ss eta_t' of |
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multi-threaded simplification);
wenzelm
parents:
22717
diff
changeset
|
986 |
NONE => (debug false (fn () => "FAILED") ss; proc_rews ps) |
15531 | 987 |
| SOME raw_thm => |
22254 | 988 |
(trace_thm (fn () => "Procedure " ^ quote name ^ " produced rewrite rule:") |
989 |
ss raw_thm; |
|
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset
|
990 |
(case rews (mk_procrule ss raw_thm) of |
22254 | 991 |
NONE => (trace_cterm true (fn () => "IGNORED result of simproc " ^ quote name ^ |
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset
|
992 |
" -- does not match") ss t; proc_rews ps) |
10413 | 993 |
| some => some))) |
994 |
else proc_rews ps; |
|
38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
995 |
in |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
996 |
(case eta_t of |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
997 |
Abs _ $ _ => SOME (Thm.transitive eta_thm (Thm.beta_conversion false eta_t'), skel0) |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
998 |
| _ => |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
999 |
(case rews (sort_rrules (Net.match_term rules eta_t)) of |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
1000 |
NONE => proc_rews (Net.match_term procs eta_t) |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
1001 |
| some => some)) |
10413 | 1002 |
end; |
1003 |
||
1004 |
||
1005 |
(* conversion to apply a congruence rule to a term *) |
|
1006 |
||
30908
7ccf4a3d764c
replace type cong = {thm : thm, lhs : term} by plain thm -- the other component has been unused for a long time.
krauss
parents:
30552
diff
changeset
|
1007 |
fun congc prover ss maxt cong t = |
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset
|
1008 |
let val rthm = Thm.incr_indexes (maxt + 1) cong; |
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset
|
1009 |
val rlhs = fst (Thm.dest_equals (Drule.strip_imp_concl (cprop_of rthm))); |
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset
|
1010 |
val insts = Thm.match (rlhs, t) |
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset
|
1011 |
(* Thm.match can raise Pattern.MATCH; |
10413 | 1012 |
is handled when congc is called *) |
1013 |
val thm' = Thm.instantiate insts (Thm.rename_boundvars (term_of rlhs) (term_of t) rthm); |
|
32797 | 1014 |
val _ = trace_thm (fn () => "Applying congruence rule:") ss thm'; |
22254 | 1015 |
fun err (msg, thm) = (trace_thm (fn () => msg) ss thm; NONE) |
38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
1016 |
in |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
1017 |
(case prover thm' of |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
1018 |
NONE => err ("Congruence proof failed. Could not prove", thm') |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
1019 |
| SOME thm2 => |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
1020 |
(case check_conv true ss (Drule.beta_eta_conversion t) thm2 of |
15531 | 1021 |
NONE => err ("Congruence proof failed. Should not have proved", thm2) |
1022 |
| SOME thm2' => |
|
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset
|
1023 |
if op aconv (pairself term_of (Thm.dest_equals (cprop_of thm2'))) |
38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
1024 |
then NONE else SOME thm2')) |
10413 | 1025 |
end; |
1026 |
||
1027 |
val (cA, (cB, cC)) = |
|
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset
|
1028 |
apsnd Thm.dest_equals (Thm.dest_implies (hd (cprems_of Drule.imp_cong))); |
10413 | 1029 |
|
15531 | 1030 |
fun transitive1 NONE NONE = NONE |
1031 |
| transitive1 (SOME thm1) NONE = SOME thm1 |
|
1032 |
| transitive1 NONE (SOME thm2) = SOME thm2 |
|
36944 | 1033 |
| transitive1 (SOME thm1) (SOME thm2) = SOME (Thm.transitive thm1 thm2) |
10413 | 1034 |
|
15531 | 1035 |
fun transitive2 thm = transitive1 (SOME thm); |
1036 |
fun transitive3 thm = transitive1 thm o SOME; |
|
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset
|
1037 |
|
16458 | 1038 |
fun bottomc ((simprem, useprem, mutsimp), prover, thy, maxidx) = |
10413 | 1039 |
let |
15023 | 1040 |
fun botc skel ss t = |
15531 | 1041 |
if is_Var skel then NONE |
10413 | 1042 |
else |
15023 | 1043 |
(case subc skel ss t of |
15531 | 1044 |
some as SOME thm1 => |
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset
|
1045 |
(case rewritec (prover, thy, maxidx) ss (Thm.rhs_of thm1) of |
15531 | 1046 |
SOME (thm2, skel2) => |
36944 | 1047 |
transitive2 (Thm.transitive thm1 thm2) |
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset
|
1048 |
(botc skel2 ss (Thm.rhs_of thm2)) |
15531 | 1049 |
| NONE => some) |
1050 |
| NONE => |
|
16458 | 1051 |
(case rewritec (prover, thy, maxidx) ss t of |
15531 | 1052 |
SOME (thm2, skel2) => transitive2 thm2 |
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset
|
1053 |
(botc skel2 ss (Thm.rhs_of thm2)) |
15531 | 1054 |
| NONE => NONE)) |
10413 | 1055 |
|
15023 | 1056 |
and try_botc ss t = |
1057 |
(case botc skel0 ss t of |
|
36944 | 1058 |
SOME trec1 => trec1 | NONE => (Thm.reflexive t)) |
10413 | 1059 |
|
15023 | 1060 |
and subc skel (ss as Simpset ({bounds, ...}, {congs, ...})) t0 = |
10413 | 1061 |
(case term_of t0 of |
32797 | 1062 |
Abs (a, T, _) => |
15023 | 1063 |
let |
20079
ec5c8584487c
replaced Term.variant(list) by Name.variant(_list);
wenzelm
parents:
20057
diff
changeset
|
1064 |
val b = Name.bound (#1 bounds); |
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset
|
1065 |
val (v, t') = Thm.dest_abs (SOME b) t0; |
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset
|
1066 |
val b' = #1 (Term.dest_Free (Thm.term_of v)); |
21962 | 1067 |
val _ = |
1068 |
if b <> b' then |
|
35231 | 1069 |
warning ("Simplifier: renamed bound variable " ^ |
48992 | 1070 |
quote b ^ " to " ^ quote b' ^ Position.here (Position.thread_data ())) |
21962 | 1071 |
else (); |
17614 | 1072 |
val ss' = add_bound ((b', T), a) ss; |
15023 | 1073 |
val skel' = case skel of Abs (_, _, sk) => sk | _ => skel0; |
1074 |
in case botc skel' ss' t' of |
|
36944 | 1075 |
SOME thm => SOME (Thm.abstract_rule a v thm) |
15531 | 1076 |
| NONE => NONE |
10413 | 1077 |
end |
1078 |
| t $ _ => (case t of |
|
15023 | 1079 |
Const ("==>", _) $ _ => impc t0 ss |
10413 | 1080 |
| Abs _ => |
36944 | 1081 |
let val thm = Thm.beta_conversion false t0 |
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset
|
1082 |
in case subc skel0 ss (Thm.rhs_of thm) of |
15531 | 1083 |
NONE => SOME thm |
36944 | 1084 |
| SOME thm' => SOME (Thm.transitive thm thm') |
10413 | 1085 |
end |
1086 |
| _ => |
|
1087 |
let fun appc () = |
|
1088 |
let |
|
1089 |
val (tskel, uskel) = case skel of |
|
1090 |
tskel $ uskel => (tskel, uskel) |
|
1091 |
| _ => (skel0, skel0); |
|
10767
8fa4aafa7314
Thm: dest_comb, dest_abs, capply, cabs no longer global;
wenzelm
parents:
10413
diff
changeset
|
1092 |
val (ct, cu) = Thm.dest_comb t0 |
10413 | 1093 |
in |
15023 | 1094 |
(case botc tskel ss ct of |
15531 | 1095 |
SOME thm1 => |
15023 | 1096 |
(case botc uskel ss cu of |
36944 | 1097 |
SOME thm2 => SOME (Thm.combination thm1 thm2) |
1098 |
| NONE => SOME (Thm.combination thm1 (Thm.reflexive cu))) |
|
15531 | 1099 |
| NONE => |
15023 | 1100 |
(case botc uskel ss cu of |
36944 | 1101 |
SOME thm1 => SOME (Thm.combination (Thm.reflexive ct) thm1) |
15531 | 1102 |
| NONE => NONE)) |
10413 | 1103 |
end |
1104 |
val (h, ts) = strip_comb t |
|
13835
12b2ffbe543a
Change to meta simplifier: congruence rules may now have frees as head of term.
ballarin
parents:
13828
diff
changeset
|
1105 |
in case cong_name h of |
15531 | 1106 |
SOME a => |
17232 | 1107 |
(case AList.lookup (op =) (fst congs) a of |
15531 | 1108 |
NONE => appc () |
1109 |
| SOME cong => |
|
15023 | 1110 |
(*post processing: some partial applications h t1 ... tj, j <= length ts, |
1111 |
may be a redex. Example: map (%x. x) = (%xs. xs) wrt map_cong*) |
|
10413 | 1112 |
(let |
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset
|
1113 |
val thm = congc (prover ss) ss maxidx cong t0; |
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset
|
1114 |
val t = the_default t0 (Option.map Thm.rhs_of thm); |
10767
8fa4aafa7314
Thm: dest_comb, dest_abs, capply, cabs no longer global;
wenzelm
parents:
10413
diff
changeset
|
1115 |
val (cl, cr) = Thm.dest_comb t |
10413 | 1116 |
val dVar = Var(("", 0), dummyT) |
1117 |
val skel = |
|
1118 |
list_comb (h, replicate (length ts) dVar) |
|
15023 | 1119 |
in case botc skel ss cl of |
15531 | 1120 |
NONE => thm |
1121 |
| SOME thm' => transitive3 thm |
|
36944 | 1122 |
(Thm.combination thm' (Thm.reflexive cr)) |
20057 | 1123 |
end handle Pattern.MATCH => appc ())) |
10413 | 1124 |
| _ => appc () |
1125 |
end) |
|
15531 | 1126 |
| _ => NONE) |
10413 | 1127 |
|
15023 | 1128 |
and impc ct ss = |
1129 |
if mutsimp then mut_impc0 [] ct [] [] ss else nonmut_impc ct ss |
|
10413 | 1130 |
|
15023 | 1131 |
and rules_of_prem ss prem = |
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset
|
1132 |
if maxidx_of_term (term_of prem) <> ~1 |
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset
|
1133 |
then (trace_cterm true |
22254 | 1134 |
(fn () => "Cannot add premise as rewrite rule because it contains (type) unknowns:") |
1135 |
ss prem; ([], NONE)) |
|
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset
|
1136 |
else |
36944 | 1137 |
let val asm = Thm.assume prem |
15531 | 1138 |
in (extract_safe_rrules (ss, asm), SOME asm) end |
10413 | 1139 |
|
15023 | 1140 |
and add_rrules (rrss, asms) ss = |
20028
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset
|
1141 |
(fold o fold) insert_rrule rrss ss |> add_prems (map_filter I asms) |
10413 | 1142 |
|
23178 | 1143 |
and disch r prem eq = |
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset
|
1144 |
let |
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset
|
1145 |
val (lhs, rhs) = Thm.dest_equals (Thm.cprop_of eq); |
36944 | 1146 |
val eq' = Thm.implies_elim (Thm.instantiate |
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset
|
1147 |
([], [(cA, prem), (cB, lhs), (cC, rhs)]) Drule.imp_cong) |
36944 | 1148 |
(Thm.implies_intr prem eq) |
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset
|
1149 |
in if not r then eq' else |
10413 | 1150 |
let |
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset
|
1151 |
val (prem', concl) = Thm.dest_implies lhs; |
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset
|
1152 |
val (prem'', _) = Thm.dest_implies rhs |
36944 | 1153 |
in Thm.transitive (Thm.transitive |
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset
|
1154 |
(Thm.instantiate ([], [(cA, prem'), (cB, prem), (cC, concl)]) |
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset
|
1155 |
Drule.swap_prems_eq) eq') |
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset
|
1156 |
(Thm.instantiate ([], [(cA, prem), (cB, prem''), (cC, concl)]) |
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset
|
1157 |
Drule.swap_prems_eq) |
10413 | 1158 |
end |
1159 |
end |
|
1160 |
||
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset
|
1161 |
and rebuild [] _ _ _ _ eq = eq |
32797 | 1162 |
| rebuild (prem :: prems) concl (_ :: rrss) (_ :: asms) ss eq = |
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset
|
1163 |
let |
15023 | 1164 |
val ss' = add_rrules (rev rrss, rev asms) ss; |
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset
|
1165 |
val concl' = |
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset
|
1166 |
Drule.mk_implies (prem, the_default concl (Option.map Thm.rhs_of eq)); |
23178 | 1167 |
val dprem = Option.map (disch false prem) |
38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
1168 |
in |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
1169 |
(case rewritec (prover, thy, maxidx) ss' concl' of |
15531 | 1170 |
NONE => rebuild prems concl' rrss asms ss (dprem eq) |
23178 | 1171 |
| SOME (eq', _) => transitive2 (fold (disch false) |
1172 |
prems (the (transitive3 (dprem eq) eq'))) |
|
38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
1173 |
(mut_impc0 (rev prems) (Thm.rhs_of eq') (rev rrss) (rev asms) ss)) |
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset
|
1174 |
end |
15023 | 1175 |
|
1176 |
and mut_impc0 prems concl rrss asms ss = |
|
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset
|
1177 |
let |
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset
|
1178 |
val prems' = strip_imp_prems concl; |
15023 | 1179 |
val (rrss', asms') = split_list (map (rules_of_prem ss) prems') |
38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
1180 |
in |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
1181 |
mut_impc (prems @ prems') (strip_imp_concl concl) (rrss @ rrss') |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
1182 |
(asms @ asms') [] [] [] [] ss ~1 ~1 |
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset
|
1183 |
end |
15023 | 1184 |
|
1185 |
and mut_impc [] concl [] [] prems' rrss' asms' eqns ss changed k = |
|
33245 | 1186 |
transitive1 (fold (fn (eq1, prem) => fn eq2 => transitive1 eq1 |
1187 |
(Option.map (disch false prem) eq2)) (eqns ~~ prems') NONE) |
|
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset
|
1188 |
(if changed > 0 then |
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset
|
1189 |
mut_impc (rev prems') concl (rev rrss') (rev asms') |
15023 | 1190 |
[] [] [] [] ss ~1 changed |
1191 |
else rebuild prems' concl rrss' asms' ss |
|
1192 |
(botc skel0 (add_rrules (rev rrss', rev asms') ss) concl)) |
|
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset
|
1193 |
|
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset
|
1194 |
| mut_impc (prem :: prems) concl (rrs :: rrss) (asm :: asms) |
15023 | 1195 |
prems' rrss' asms' eqns ss changed k = |
15531 | 1196 |
case (if k = 0 then NONE else botc skel0 (add_rrules |
15023 | 1197 |
(rev rrss' @ rrss, rev asms' @ asms) ss) prem) of |
15531 | 1198 |
NONE => mut_impc prems concl rrss asms (prem :: prems') |
1199 |
(rrs :: rrss') (asm :: asms') (NONE :: eqns) ss changed |
|
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset
|
1200 |
(if k = 0 then 0 else k - 1) |
15531 | 1201 |
| SOME eqn => |
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset
|
1202 |
let |
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset
|
1203 |
val prem' = Thm.rhs_of eqn; |
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset
|
1204 |
val tprems = map term_of prems; |
33029 | 1205 |
val i = 1 + fold Integer.max (map (fn p => |
44058 | 1206 |
find_index (fn q => q aconv p) tprems) (Thm.hyps_of eqn)) ~1; |
15023 | 1207 |
val (rrs', asm') = rules_of_prem ss prem' |
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset
|
1208 |
in mut_impc prems concl rrss asms (prem' :: prems') |
23178 | 1209 |
(rrs' :: rrss') (asm' :: asms') (SOME (fold_rev (disch true) |
33957 | 1210 |
(take i prems) |
36944 | 1211 |
(Drule.imp_cong_rule eqn (Thm.reflexive (Drule.list_implies |
33957 | 1212 |
(drop i prems, concl))))) :: eqns) |
20671 | 1213 |
ss (length prems') ~1 |
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset
|
1214 |
end |
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset
|
1215 |
|
15023 | 1216 |
(*legacy code - only for backwards compatibility*) |
38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
1217 |
and nonmut_impc ct ss = |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
1218 |
let |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
1219 |
val (prem, conc) = Thm.dest_implies ct; |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
1220 |
val thm1 = if simprem then botc skel0 ss prem else NONE; |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
1221 |
val prem1 = the_default prem (Option.map Thm.rhs_of thm1); |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
1222 |
val ss1 = |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
1223 |
if not useprem then ss |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
1224 |
else add_rrules (apsnd single (apfst single (rules_of_prem ss prem1))) ss |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
1225 |
in |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
1226 |
(case botc skel0 ss1 conc of |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
1227 |
NONE => |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
1228 |
(case thm1 of |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
1229 |
NONE => NONE |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
1230 |
| SOME thm1' => SOME (Drule.imp_cong_rule thm1' (Thm.reflexive conc))) |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
1231 |
| SOME thm2 => |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
1232 |
let val thm2' = disch false prem1 thm2 in |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
1233 |
(case thm1 of |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
1234 |
NONE => SOME thm2' |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
1235 |
| SOME thm1' => |
36944 | 1236 |
SOME (Thm.transitive (Drule.imp_cong_rule thm1' (Thm.reflexive conc)) thm2')) |
38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
1237 |
end) |
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
1238 |
end |
10413 | 1239 |
|
15023 | 1240 |
in try_botc end; |
10413 | 1241 |
|
1242 |
||
15023 | 1243 |
(* Meta-rewriting: rewrites t to u and returns the theorem t==u *) |
10413 | 1244 |
|
1245 |
(* |
|
1246 |
Parameters: |
|
1247 |
mode = (simplify A, |
|
1248 |
use A in simplifying B, |
|
1249 |
use prems of B (if B is again a meta-impl.) to simplify A) |
|
1250 |
when simplifying A ==> B |
|
1251 |
prover: how to solve premises in conditional rewrites and congruences |
|
1252 |
*) |
|
1253 |
||
32738 | 1254 |
val debug_bounds = Unsynchronized.ref false; |
17705 | 1255 |
|
21962 | 1256 |
fun check_bounds ss ct = |
1257 |
if ! debug_bounds then |
|
1258 |
let |
|
1259 |
val Simpset ({bounds = (_, bounds), ...}, _) = ss; |
|
1260 |
val bs = fold_aterms (fn Free (x, _) => |
|
1261 |
if Name.is_bound x andalso not (AList.defined eq_bound bounds x) |
|
1262 |
then insert (op =) x else I |
|
1263 |
| _ => I) (term_of ct) []; |
|
1264 |
in |
|
1265 |
if null bs then () |
|
35979
12bb31230550
replaced references 'trace_simp' and 'debug_simp' by configuration options stored in the context
boehmes
parents:
35845
diff
changeset
|
1266 |
else print_term_global ss true ("Simplifier: term contains loose bounds: " ^ commas_quote bs) |
21962 | 1267 |
(Thm.theory_of_cterm ct) (Thm.term_of ct) |
1268 |
end |
|
1269 |
else (); |
|
17614 | 1270 |
|
19052
113dbd65319e
rewrite_cterm: Thm.adjust_maxidx prevents unnecessary increments on rules;
wenzelm
parents:
18929
diff
changeset
|
1271 |
fun rewrite_cterm mode prover raw_ss raw_ct = |
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset
|
1272 |
let |
26626
c6231d64d264
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26424
diff
changeset
|
1273 |
val thy = Thm.theory_of_cterm raw_ct; |
20260 | 1274 |
val ct = Thm.adjust_maxidx_cterm ~1 raw_ct; |
32797 | 1275 |
val {maxidx, ...} = Thm.rep_cterm ct; |
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multi-threaded simplification);
wenzelm
parents:
22717
diff
changeset
|
1276 |
val ss = inc_simp_depth (activate_context thy raw_ss); |
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multi-threaded simplification);
wenzelm
parents:
22717
diff
changeset
|
1277 |
val depth = simp_depth ss; |
21962 | 1278 |
val _ = |
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multi-threaded simplification);
wenzelm
parents:
22717
diff
changeset
|
1279 |
if depth mod 20 = 0 then |
38834
658fcba35ed7
more careful treatment of context visibility flag wrt. spurious warnings;
wenzelm
parents:
38715
diff
changeset
|
1280 |
if_visible ss warning ("Simplification depth " ^ string_of_int depth) |
21962 | 1281 |
else (); |
22254 | 1282 |
val _ = trace_cterm false (fn () => "SIMPLIFIER INVOKED ON THE FOLLOWING TERM:") ss ct; |
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset
|
1283 |
val _ = check_bounds ss ct; |
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multi-threaded simplification);
wenzelm
parents:
22717
diff
changeset
|
1284 |
in bottomc (mode, Option.map Drule.flexflex_unique oo prover, thy, maxidx) ss ct end; |
10413 | 1285 |
|
21708 | 1286 |
val simple_prover = |
43597 | 1287 |
SINGLE o (fn ss => ALLGOALS (resolve_tac (prems_of ss))); |
21708 | 1288 |
|
1289 |
fun rewrite _ [] ct = Thm.reflexive ct |
|
27582 | 1290 |
| rewrite full thms ct = rewrite_cterm (full, false, false) simple_prover |
35232
f588e1169c8b
renamed Simplifier.theory_context to Simplifier.global_context to emphasize that this is not the real thing;
wenzelm
parents:
35231
diff
changeset
|
1291 |
(global_context (Thm.theory_of_cterm ct) empty_ss addsimps thms) ct; |
11672 | 1292 |
|
23598 | 1293 |
fun simplify full thms = Conv.fconv_rule (rewrite full thms); |
21708 | 1294 |
val rewrite_rule = simplify true; |
1295 |
||
15023 | 1296 |
(*simple term rewriting -- no proof*) |
16458 | 1297 |
fun rewrite_term thy rules procs = |
17203 | 1298 |
Pattern.rewrite_term thy (map decomp_simp' rules) procs; |
15023 | 1299 |
|
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset
|
1300 |
fun rewrite_thm mode prover ss = Conv.fconv_rule (rewrite_cterm mode prover ss); |
10413 | 1301 |
|
23536
60a1672e298e
moved (asm_)rewrite_goal_tac from goal.ML to meta_simplifier.ML (no longer depends on SELECT_GOAL);
wenzelm
parents:
23221
diff
changeset
|
1302 |
(*Rewrite the subgoals of a proof state (represented by a theorem)*) |
21708 | 1303 |
fun rewrite_goals_rule thms th = |
23584 | 1304 |
Conv.fconv_rule (Conv.prems_conv ~1 (rewrite_cterm (true, true, true) simple_prover |
35232
f588e1169c8b
renamed Simplifier.theory_context to Simplifier.global_context to emphasize that this is not the real thing;
wenzelm
parents:
35231
diff
changeset
|
1305 |
(global_context (Thm.theory_of_thm th) empty_ss addsimps thms))) th; |
10413 | 1306 |
|
20228
e0f9e8a6556b
moved Goal.norm_hhf(_protect) to meta_simplifier.ML (pervasive);
wenzelm
parents:
20197
diff
changeset
|
1307 |
|
21708 | 1308 |
(** meta-rewriting tactics **) |
1309 |
||
28839
32d498cf7595
eliminated rewrite_tac/fold_tac, which are not well-formed tactics due to change of main conclusion;
wenzelm
parents:
28620
diff
changeset
|
1310 |
(*Rewrite all subgoals*) |
21708 | 1311 |
fun rewrite_goals_tac defs = PRIMITIVE (rewrite_goals_rule defs); |
1312 |
||
28839
32d498cf7595
eliminated rewrite_tac/fold_tac, which are not well-formed tactics due to change of main conclusion;
wenzelm
parents:
28620
diff
changeset
|
1313 |
(*Rewrite one subgoal*) |
46465 | 1314 |
fun generic_rewrite_goal_tac mode prover_tac ss i thm = |
25203
e5b2dd8db7c8
asm_rewrite_goal_tac: avoiding PRIMITIVE lets informative exceptions (from simprocs) get through;
wenzelm
parents:
24707
diff
changeset
|
1315 |
if 0 < i andalso i <= Thm.nprems_of thm then |
e5b2dd8db7c8
asm_rewrite_goal_tac: avoiding PRIMITIVE lets informative exceptions (from simprocs) get through;
wenzelm
parents:
24707
diff
changeset
|
1316 |
Seq.single (Conv.gconv_rule (rewrite_cterm mode (SINGLE o prover_tac) ss) i thm) |
e5b2dd8db7c8
asm_rewrite_goal_tac: avoiding PRIMITIVE lets informative exceptions (from simprocs) get through;
wenzelm
parents:
24707
diff
changeset
|
1317 |
else Seq.empty; |
23536
60a1672e298e
moved (asm_)rewrite_goal_tac from goal.ML to meta_simplifier.ML (no longer depends on SELECT_GOAL);
wenzelm
parents:
23221
diff
changeset
|
1318 |
|
60a1672e298e
moved (asm_)rewrite_goal_tac from goal.ML to meta_simplifier.ML (no longer depends on SELECT_GOAL);
wenzelm
parents:
23221
diff
changeset
|
1319 |
fun rewrite_goal_tac rews = |
60a1672e298e
moved (asm_)rewrite_goal_tac from goal.ML to meta_simplifier.ML (no longer depends on SELECT_GOAL);
wenzelm
parents:
23221
diff
changeset
|
1320 |
let val ss = empty_ss addsimps rews in |
46465 | 1321 |
fn i => fn st => generic_rewrite_goal_tac (true, false, false) (K no_tac) |
35232
f588e1169c8b
renamed Simplifier.theory_context to Simplifier.global_context to emphasize that this is not the real thing;
wenzelm
parents:
35231
diff
changeset
|
1322 |
(global_context (Thm.theory_of_thm st) ss) i st |
23536
60a1672e298e
moved (asm_)rewrite_goal_tac from goal.ML to meta_simplifier.ML (no longer depends on SELECT_GOAL);
wenzelm
parents:
23221
diff
changeset
|
1323 |
end; |
60a1672e298e
moved (asm_)rewrite_goal_tac from goal.ML to meta_simplifier.ML (no longer depends on SELECT_GOAL);
wenzelm
parents:
23221
diff
changeset
|
1324 |
|
46707 | 1325 |
(*Prunes all redundant parameters from the proof state by rewriting.*) |
46186 | 1326 |
val prune_params_tac = rewrite_goals_tac [Drule.triv_forall_equality]; |
21708 | 1327 |
|
1328 |
||
1329 |
(* for folding definitions, handling critical pairs *) |
|
1330 |
||
1331 |
(*The depth of nesting in a term*) |
|
32797 | 1332 |
fun term_depth (Abs (_, _, t)) = 1 + term_depth t |
1333 |
| term_depth (f $ t) = 1 + Int.max (term_depth f, term_depth t) |
|
21708 | 1334 |
| term_depth _ = 0; |
1335 |
||
1336 |
val lhs_of_thm = #1 o Logic.dest_equals o prop_of; |
|
1337 |
||
1338 |
(*folding should handle critical pairs! E.g. K == Inl(0), S == Inr(Inl(0)) |
|
1339 |
Returns longest lhs first to avoid folding its subexpressions.*) |
|
1340 |
fun sort_lhs_depths defs = |
|
1341 |
let val keylist = AList.make (term_depth o lhs_of_thm) defs |
|
1342 |
val keys = sort_distinct (rev_order o int_ord) (map #2 keylist) |
|
1343 |
in map (AList.find (op =) keylist) keys end; |
|
1344 |
||
36944 | 1345 |
val rev_defs = sort_lhs_depths o map Thm.symmetric; |
21708 | 1346 |
|
1347 |
fun fold_rule defs = fold rewrite_rule (rev_defs defs); |
|
1348 |
fun fold_goals_tac defs = EVERY (map rewrite_goals_tac (rev_defs defs)); |
|
1349 |
||
1350 |
||
20228
e0f9e8a6556b
moved Goal.norm_hhf(_protect) to meta_simplifier.ML (pervasive);
wenzelm
parents:
20197
diff
changeset
|
1351 |
(* HHF normal form: !! before ==>, outermost !! generalized *) |
e0f9e8a6556b
moved Goal.norm_hhf(_protect) to meta_simplifier.ML (pervasive);
wenzelm
parents:
20197
diff
changeset
|
1352 |
|
e0f9e8a6556b
moved Goal.norm_hhf(_protect) to meta_simplifier.ML (pervasive);
wenzelm
parents:
20197
diff
changeset
|
1353 |
local |
e0f9e8a6556b
moved Goal.norm_hhf(_protect) to meta_simplifier.ML (pervasive);
wenzelm
parents:
20197
diff
changeset
|
1354 |
|
21565 | 1355 |
fun gen_norm_hhf ss th = |
1356 |
(if Drule.is_norm_hhf (Thm.prop_of th) then th |
|
26424 | 1357 |
else Conv.fconv_rule |
35232
f588e1169c8b
renamed Simplifier.theory_context to Simplifier.global_context to emphasize that this is not the real thing;
wenzelm
parents:
35231
diff
changeset
|
1358 |
(rewrite_cterm (true, false, false) (K (K NONE)) (global_context (Thm.theory_of_thm th) ss)) th) |
21565 | 1359 |
|> Thm.adjust_maxidx_thm ~1 |
1360 |
|> Drule.gen_all; |
|
20228
e0f9e8a6556b
moved Goal.norm_hhf(_protect) to meta_simplifier.ML (pervasive);
wenzelm
parents:
20197
diff
changeset
|
1361 |
|
28620 | 1362 |
val hhf_ss = empty_ss addsimps Drule.norm_hhf_eqs; |
20228
e0f9e8a6556b
moved Goal.norm_hhf(_protect) to meta_simplifier.ML (pervasive);
wenzelm
parents:
20197
diff
changeset
|
1363 |
|
e0f9e8a6556b
moved Goal.norm_hhf(_protect) to meta_simplifier.ML (pervasive);
wenzelm
parents:
20197
diff
changeset
|
1364 |
in |
e0f9e8a6556b
moved Goal.norm_hhf(_protect) to meta_simplifier.ML (pervasive);
wenzelm
parents:
20197
diff
changeset
|
1365 |
|
26424 | 1366 |
val norm_hhf = gen_norm_hhf hhf_ss; |
45620
f2a587696afb
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45405
diff
changeset
|
1367 |
val norm_hhf_protect = gen_norm_hhf (hhf_ss |> add_eqcong Drule.protect_cong); |
20228
e0f9e8a6556b
moved Goal.norm_hhf(_protect) to meta_simplifier.ML (pervasive);
wenzelm
parents:
20197
diff
changeset
|
1368 |
|
e0f9e8a6556b
moved Goal.norm_hhf(_protect) to meta_simplifier.ML (pervasive);
wenzelm
parents:
20197
diff
changeset
|
1369 |
end; |
e0f9e8a6556b
moved Goal.norm_hhf(_protect) to meta_simplifier.ML (pervasive);
wenzelm
parents:
20197
diff
changeset
|
1370 |
|
10413 | 1371 |
end; |
1372 |
||
41228
e1fce873b814
renamed structure MetaSimplifier to raw_Simplifer, to emphasize its meaning;
wenzelm
parents:
41227
diff
changeset
|
1373 |
structure Basic_Meta_Simplifier: BASIC_RAW_SIMPLIFIER = Raw_Simplifier; |
32738 | 1374 |
open Basic_Meta_Simplifier; |