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