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