author  wenzelm 
Wed, 30 Sep 2009 23:49:53 +0200  
changeset 32797  2e8fae2d998c 
parent 32738  15bb09ca0378 
child 33029  2fefe039edf1 
child 33037  b22e44496dc2 
permissions  rwrr 
10413  1 
(* Title: Pure/meta_simplifier.ML 
29269
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
28839
diff
changeset

2 
Author: Tobias Nipkow and Stefan Berghofer, TU Muenchen 
10413  3 

11672  4 
Metalevel Simplification. 
10413  5 
*) 
6 

15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

7 
infix 4 
15023  8 
addsimps delsimps addeqcongs deleqcongs addcongs delcongs addsimprocs delsimprocs 
15199  9 
setmksimps setmkcong setmksym setmkeqTrue settermless setsubgoaler 
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

10 
setloop' setloop addloop addloop' delloop setSSolver addSSolver setSolver addSolver; 
15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

11 

11672  12 
signature BASIC_META_SIMPLIFIER = 
13 
sig 

32738  14 
val debug_simp: bool Unsynchronized.ref 
15 
val trace_simp: bool Unsynchronized.ref 

16 
val trace_simp_depth_limit: int Unsynchronized.ref 

15023  17 
type rrule 
16807  18 
val eq_rrule: rrule * rrule > bool 
15023  19 
type simpset 
20 
type proc 

17614  21 
type solver 
22 
val mk_solver': string > (simpset > int > tactic) > solver 

23 
val mk_solver: string > (thm list > int > tactic) > solver 

15023  24 
val empty_ss: simpset 
25 
val merge_ss: simpset * simpset > simpset 

30356  26 
val dest_ss: simpset > 
27 
{simps: (string * thm) list, 

28 
procs: (string * cterm list) list, 

29 
congs: (string * thm) list, 

30 
weak_congs: string list, 

31 
loopers: string list, 

32 
unsafe_solvers: string list, 

33 
safe_solvers: string list} 

15023  34 
type simproc 
22234  35 
val eq_simproc: simproc * simproc > bool 
36 
val morph_simproc: morphism > simproc > simproc 

37 
val make_simproc: {name: string, lhss: cterm list, 

38 
proc: morphism > simpset > cterm > thm option, identifier: thm list} > simproc 

22008  39 
val mk_simproc: string > cterm list > (theory > simpset > term > thm option) > simproc 
15023  40 
val add_prems: thm list > simpset > simpset 
41 
val prems_of_ss: simpset > thm list 

42 
val addsimps: simpset * thm list > simpset 

43 
val delsimps: simpset * thm list > simpset 

44 
val addeqcongs: simpset * thm list > simpset 

45 
val deleqcongs: simpset * thm list > simpset 

46 
val addcongs: simpset * thm list > simpset 

47 
val delcongs: simpset * thm list > simpset 

48 
val addsimprocs: simpset * simproc list > simpset 

49 
val delsimprocs: simpset * simproc list > simpset 

30318
3d03190d2864
replaced archaic use of rep_ss by Simplifier.mksimps;
wenzelm
parents:
29269
diff
changeset

50 
val mksimps: simpset > thm > thm list 
15023  51 
val setmksimps: simpset * (thm > thm list) > simpset 
52 
val setmkcong: simpset * (thm > thm) > simpset 

53 
val setmksym: simpset * (thm > thm option) > simpset 

54 
val setmkeqTrue: simpset * (thm > thm option) > simpset 

55 
val settermless: simpset * (term * term > bool) > simpset 

56 
val setsubgoaler: simpset * (simpset > int > tactic) > simpset 

17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

57 
val setloop': simpset * (simpset > int > tactic) > simpset 
15023  58 
val setloop: simpset * (int > tactic) > simpset 
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

59 
val addloop': simpset * (string * (simpset > int > tactic)) > simpset 
15023  60 
val addloop: simpset * (string * (int > tactic)) > simpset 
61 
val delloop: simpset * string > simpset 

62 
val setSSolver: simpset * solver > simpset 

63 
val addSSolver: simpset * solver > simpset 

64 
val setSolver: simpset * solver > simpset 

65 
val addSolver: simpset * solver > simpset 

21708  66 

67 
val rewrite_rule: thm list > thm > thm 

68 
val rewrite_goals_rule: thm list > thm > thm 

69 
val rewrite_goals_tac: thm list > tactic 

23536
60a1672e298e
moved (asm_)rewrite_goal_tac from goal.ML to meta_simplifier.ML (no longer depends on SELECT_GOAL);
wenzelm
parents:
23221
diff
changeset

70 
val rewrite_goal_tac: thm list > int > tactic 
21708  71 
val rewtac: thm > tactic 
72 
val prune_params_tac: tactic 

73 
val fold_rule: thm list > thm > thm 

74 
val fold_goals_tac: thm list > tactic 

30552
58db56278478
provide Simplifier.norm_hhf(_protect) as regular simplifier operation;
wenzelm
parents:
30356
diff
changeset

75 
val norm_hhf: thm > thm 
58db56278478
provide Simplifier.norm_hhf(_protect) as regular simplifier operation;
wenzelm
parents:
30356
diff
changeset

76 
val norm_hhf_protect: thm > thm 
15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

77 
end; 
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

78 

10413  79 
signature META_SIMPLIFIER = 
80 
sig 

11672  81 
include BASIC_META_SIMPLIFIER 
10413  82 
exception SIMPLIFIER of string * thm 
30336  83 
val internal_ss: simpset > 
84 
{rules: rrule Net.net, 

85 
prems: thm list, 

86 
bounds: int * ((string * typ) * string) list, 

32738  87 
depth: int * bool Unsynchronized.ref, 
30336  88 
context: Proof.context option} * 
30908
7ccf4a3d764c
replace type cong = {thm : thm, lhs : term} by plain thm  the other component has been unused for a long time.
krauss
parents:
30552
diff
changeset

89 
{congs: (string * thm) list * string list, 
30336  90 
procs: proc Net.net, 
91 
mk_rews: 

92 
{mk: thm > thm list, 

93 
mk_cong: thm > thm, 

94 
mk_sym: thm > thm option, 

95 
mk_eq_True: thm > thm option, 

96 
reorient: theory > term list > term > term > bool}, 

97 
termless: term * term > bool, 

98 
subgoal_tac: simpset > int > tactic, 

99 
loop_tacs: (string * (simpset > int > tactic)) list, 

100 
solvers: solver list * solver list} 

27558  101 
val add_simp: thm > simpset > simpset 
102 
val del_simp: thm > simpset > simpset 

17966
34e420fa03ad
moved various simplification tactics and rules to simplifier.ML;
wenzelm
parents:
17897
diff
changeset

103 
val solver: simpset > solver > int > tactic 
24124
4399175e3014
turned simp_depth_limit into configuration option;
wenzelm
parents:
23938
diff
changeset

104 
val simp_depth_limit_value: Config.value Config.T 
4399175e3014
turned simp_depth_limit into configuration option;
wenzelm
parents:
23938
diff
changeset

105 
val simp_depth_limit: int Config.T 
15023  106 
val clear_ss: simpset > simpset 
16458  107 
val simproc_i: theory > string > term list 
108 
> (theory > simpset > term > thm option) > simproc 

109 
val simproc: theory > string > string list 

110 
> (theory > simpset > term > thm option) > simproc 

17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

111 
val inherit_context: simpset > simpset > simpset 
20289  112 
val the_context: simpset > Proof.context 
113 
val context: Proof.context > simpset > simpset 

17897  114 
val theory_context: theory > simpset > simpset 
32738  115 
val debug_bounds: bool Unsynchronized.ref 
18208  116 
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

117 
val set_solvers: solver list > simpset > simpset 
23598  118 
val rewrite_cterm: bool * bool * bool > (simpset > thm > thm option) > simpset > conv 
16458  119 
val rewrite_term: theory > thm list > (term > term option) list > term > term 
15023  120 
val rewrite_thm: bool * bool * bool > 
121 
(simpset > thm > thm option) > simpset > thm > thm 

122 
val rewrite_goal_rule: bool * bool * bool > 

123 
(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

124 
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

125 
(simpset > tactic) > simpset > int > tactic 
23598  126 
val rewrite: bool > thm list > conv 
21708  127 
val simplify: bool > thm list > thm > thm 
10413  128 
end; 
129 

15023  130 
structure MetaSimplifier: META_SIMPLIFIER = 
10413  131 
struct 
132 

15023  133 
(** datatype simpset **) 
134 

135 
(* rewrite rules *) 

10413  136 

20546
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

137 
type rrule = 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

138 
{thm: thm, (*the rewrite rule*) 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

139 
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

140 
lhs: term, (*the lefthand side*) 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

141 
elhs: cterm, (*the etaccontracted lhs*) 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

142 
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

143 
fo: bool, (*use firstorder matching*) 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

144 
perm: bool}; (*the rewrite rule is permutative*) 
15023  145 

20546
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

146 
(* 
12603  147 
Remarks: 
10413  148 
 elhs is used for matching, 
15023  149 
lhs only for preservation of bound variable names; 
10413  150 
 fo is set iff 
151 
either elhs is firstorder (no Var is applied), 

15023  152 
in which case fomatching is complete, 
10413  153 
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

154 
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

155 
*) 
10413  156 

157 
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

158 
Thm.eq_thm_prop (thm1, thm2); 
15023  159 

160 

17614  161 
(* simplification sets, procedures, and solvers *) 
15023  162 

163 
(*A simpset contains data required during conversion: 

10413  164 
rules: discrimination net of rewrite rules; 
15023  165 
prems: current premises; 
15249
0da6b3075bfa
Replaced list of bound variables in simpset by maximal index of bound
berghofe
parents:
15199
diff
changeset

166 
bounds: maximal index of bound variables already used 
15023  167 
(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 multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

168 
depth: simp_depth and exceeded flag; 
10413  169 
congs: association list of congruence rules and 
170 
a list of `weak' congruence constants. 

171 
A congruence is `weak' if it avoids normalization of some argument. 

172 
procs: discrimination net of simplification procedures 

173 
(functions that prove rewrite rules on the fly); 

15023  174 
mk_rews: 
175 
mk: turn simplification thms into rewrite rules; 

176 
mk_cong: prepare congruence rules; 

177 
mk_sym: turn == around; 

178 
mk_eq_True: turn P into P == True; 

179 
termless: relation for ordered rewriting;*) 

15011  180 

15023  181 
type mk_rews = 
182 
{mk: thm > thm list, 

183 
mk_cong: thm > thm, 

184 
mk_sym: thm > thm option, 

18208  185 
mk_eq_True: thm > thm option, 
186 
reorient: theory > term list > term > term > bool}; 

15023  187 

188 
datatype simpset = 

189 
Simpset of 

190 
{rules: rrule Net.net, 

10413  191 
prems: thm list, 
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

192 
bounds: int * ((string * typ) * string) list, 
32738  193 
depth: int * bool Unsynchronized.ref, 
20289  194 
context: Proof.context option} * 
30908
7ccf4a3d764c
replace type cong = {thm : thm, lhs : term} by plain thm  the other component has been unused for a long time.
krauss
parents:
30552
diff
changeset

195 
{congs: (string * thm) list * string list, 
15023  196 
procs: proc Net.net, 
197 
mk_rews: mk_rews, 

11504  198 
termless: term * term > bool, 
15011  199 
subgoal_tac: simpset > int > tactic, 
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

200 
loop_tacs: (string * (simpset > int > tactic)) list, 
15023  201 
solvers: solver list * solver list} 
202 
and proc = 

203 
Proc of 

204 
{name: string, 

205 
lhs: cterm, 

22008  206 
proc: simpset > cterm > thm option, 
22234  207 
id: stamp * thm list} 
17614  208 
and solver = 
209 
Solver of 

210 
{name: string, 

211 
solver: simpset > int > tactic, 

15023  212 
id: stamp}; 
213 

214 

30336  215 
fun internal_ss (Simpset args) = args; 
10413  216 

22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

217 
fun make_ss1 (rules, prems, bounds, depth, context) = 
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

218 
{rules = rules, prems = prems, bounds = bounds, depth = depth, context = context}; 
15023  219 

22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

220 
fun map_ss1 f {rules, prems, bounds, depth, context} = 
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

221 
make_ss1 (f (rules, prems, bounds, depth, context)); 
10413  222 

15023  223 
fun make_ss2 (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) = 
224 
{congs = congs, procs = procs, mk_rews = mk_rews, termless = termless, 

225 
subgoal_tac = subgoal_tac, loop_tacs = loop_tacs, solvers = solvers}; 

226 

227 
fun map_ss2 f {congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers} = 

228 
make_ss2 (f (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers)); 

229 

230 
fun make_simpset (args1, args2) = Simpset (make_ss1 args1, make_ss2 args2); 

10413  231 

15023  232 
fun map_simpset1 f (Simpset (r1, r2)) = Simpset (map_ss1 f r1, r2); 
233 
fun map_simpset2 f (Simpset (r1, r2)) = Simpset (r1, map_ss2 f r2); 

234 

17614  235 
fun prems_of_ss (Simpset ({prems, ...}, _)) = prems; 
236 

22234  237 
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

238 
s1 = s2 andalso eq_list Thm.eq_thm (ths1, ths2); 
22234  239 
fun eq_proc (Proc {id = id1, ...}, Proc {id = id2, ...}) = eq_procid (id1, id2); 
17614  240 

241 
fun mk_solver' name solver = Solver {name = name, solver = solver, id = stamp ()}; 

242 
fun mk_solver name solver = mk_solver' name (solver o prems_of_ss); 

243 

244 
fun solver_name (Solver {name, ...}) = name; 

17966
34e420fa03ad
moved various simplification tactics and rules to simplifier.ML;
wenzelm
parents:
17897
diff
changeset

245 
fun solver ss (Solver {solver = tac, ...}) = tac ss; 
17614  246 
fun eq_solver (Solver {id = id1, ...}, Solver {id = id2, ...}) = (id1 = id2); 
247 

15023  248 

22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

249 
(* simp depth *) 
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

250 

24124
4399175e3014
turned simp_depth_limit into configuration option;
wenzelm
parents:
23938
diff
changeset

251 
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

252 
val simp_depth_limit = Config.int simp_depth_limit_value; 
4399175e3014
turned simp_depth_limit into configuration option;
wenzelm
parents:
23938
diff
changeset

253 

32738  254 
val trace_simp_depth_limit = Unsynchronized.ref 1; 
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

255 

c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

256 
fun trace_depth (Simpset ({depth = (depth, exceeded), ...}, _)) msg = 
23938  257 
if depth > ! trace_simp_depth_limit then 
258 
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 multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

259 
else 
23938  260 
(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 multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

261 

c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

262 
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 multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

263 
(rules, prems, bounds, 
32738  264 
(depth + 1, 
265 
if depth = ! trace_simp_depth_limit then Unsynchronized.ref false else exceeded), context)); 

22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

266 

c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

267 
fun simp_depth (Simpset ({depth = (depth, _), ...}, _)) = depth; 
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

268 

c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

269 

16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

270 
(* diagnostics *) 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

271 

7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

272 
exception SIMPLIFIER of string * thm; 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

273 

32738  274 
val debug_simp = Unsynchronized.ref false; 
275 
val trace_simp = Unsynchronized.ref false; 

22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

276 

16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

277 
local 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

278 

22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

279 
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

280 

7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

281 
fun show_bounds (Simpset ({bounds = (_, bs), ...}, _)) t = 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

282 
let 
20146  283 
val names = Term.declare_term_names t Name.context; 
284 
val xs = rev (#1 (Name.variants (rev (map #2 bs)) names)); 

17614  285 
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

286 
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

287 

17705  288 
in 
289 

22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

290 
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

291 
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

292 

22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

293 
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 multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

294 
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

295 

22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

296 
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 multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

297 
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

298 

7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

299 
fun trace_cterm warn a ss ct = 
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

300 
if ! trace_simp then print_term ss warn (a ()) (Thm.theory_of_cterm ct) (Thm.term_of ct) 
22254  301 
else (); 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

302 

7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

303 
fun trace_thm a ss th = 
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

304 
if ! trace_simp then print_term ss false (a ()) (Thm.theory_of_thm th) (Thm.full_prop_of th) 
22254  305 
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_named_thm a ss (th, name) = 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

308 
if ! trace_simp then 
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

309 
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

310 
(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

311 
else (); 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

312 

22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

313 
fun warn_thm a ss th = 
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

314 
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

315 

20028
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset

316 
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

317 
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

318 

16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

319 
end; 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

320 

7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

321 

10413  322 

323 
(** simpset operations **) 

324 

17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

325 
(* context *) 
10413  326 

17614  327 
fun eq_bound (x: string, (y, _)) = x = y; 
328 

22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

329 
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 multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

330 
(rules, prems, (count + 1, bound :: bounds), depth, context)); 
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

331 

22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

332 
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 multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

333 
(rules, ths @ prems, bounds, depth, context)); 
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

334 

22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

335 
fun inherit_context (Simpset ({bounds, depth, context, ...}, _)) = 
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

336 
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

337 

17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

338 
fun the_context (Simpset ({context = SOME ctxt, ...}, _)) = ctxt 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

339 
 the_context _ = raise Fail "Simplifier: no proof context in simpset"; 
10413  340 

17897  341 
fun context ctxt = 
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

342 
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

343 

21516  344 
val theory_context = context o ProofContext.init; 
17897  345 

27312
2a884461a9f3
activate_context: strict the_context, no fallback on theory context;
wenzelm
parents:
27022
diff
changeset

346 
fun activate_context thy ss = 
2a884461a9f3
activate_context: strict the_context, no fallback on theory context;
wenzelm
parents:
27022
diff
changeset

347 
let 
2a884461a9f3
activate_context: strict the_context, no fallback on theory context;
wenzelm
parents:
27022
diff
changeset

348 
val ctxt = the_context ss; 
2a884461a9f3
activate_context: strict the_context, no fallback on theory context;
wenzelm
parents:
27022
diff
changeset

349 
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

350 
in context ctxt' ss end; 
17897  351 

352 

20028
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset

353 
(* maintain simp rules *) 
10413  354 

20546
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

355 
(* 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

356 
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

357 
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

358 
*) 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

359 
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

360 
let 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

361 
val elhss = elhs :: prems; 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

362 
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

363 
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

364 
in 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

365 
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

366 
(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

367 
erhs > Term.exists_subterm 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

368 
(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

369 
end; 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

370 

8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

371 
fun rrule_extra_vars elhs thm = 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

372 
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

373 

15023  374 
fun mk_rrule2 {thm, name, lhs, elhs, perm} = 
375 
let 

20546
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

376 
val t = term_of elhs; 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

377 
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

378 
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

379 
in {thm = thm, name = name, lhs = lhs, elhs = elhs, extra = extra, fo = fo, perm = perm} end; 
10413  380 

20028
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset

381 
fun del_rrule (rrule as {thm, elhs, ...}) ss = 
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

382 
ss > map_simpset1 (fn (rules, prems, bounds, depth, context) => 
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

383 
(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

384 
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

385 

32797  386 
fun insert_rrule (rrule as {thm, name, ...}) ss = 
22254  387 
(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 multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

388 
ss > map_simpset1 (fn (rules, prems, bounds, depth, context) => 
15023  389 
let 
390 
val rrule2 as {elhs, ...} = mk_rrule2 rrule; 

16807  391 
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 multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

392 
in (rules', prems, bounds, depth, context) end) 
20028
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset

393 
handle Net.INSERT => (cond_warn_thm "Ignoring duplicate rewrite rule:" ss thm; ss)); 
10413  394 

395 
fun vperm (Var _, Var _) = true 

396 
 vperm (Abs (_, _, s), Abs (_, _, t)) = vperm (s, t) 

397 
 vperm (t1 $ t2, u1 $ u2) = vperm (t1, u1) andalso vperm (t2, u2) 

398 
 vperm (t, u) = (t = u); 

399 

400 
fun var_perm (t, u) = 

20197
ffc64d90fc1f
use Term.add_vars instead of obsolete term_varnames;
wenzelm
parents:
20146
diff
changeset

401 
vperm (t, u) andalso gen_eq_set (op =) (Term.add_vars t [], Term.add_vars u []); 
10413  402 

15023  403 
(*simple test for looping rewrite rules and stupid orientations*) 
18208  404 
fun default_reorient thy prems lhs rhs = 
15023  405 
rewrite_rule_extra_vars prems lhs rhs 
406 
orelse 

407 
is_Var (head_of lhs) 

408 
orelse 

16305  409 
(* turns t = x around, which causes a headache if x is a local variable  
410 
usually it is very useful :( 

411 
is_Free rhs andalso not(is_Free lhs) andalso not(Logic.occs(rhs,lhs)) 

412 
andalso not(exists_subterm is_Var lhs) 

413 
orelse 

414 
*) 

16842  415 
exists (fn t => Logic.occs (lhs, t)) (rhs :: prems) 
15023  416 
orelse 
17203  417 
null prems andalso Pattern.matches thy (lhs, rhs) 
10413  418 
(*the condition "null prems" is necessary because conditional rewrites 
419 
with extra variables in the conditions may terminate although 

15023  420 
the rhs is an instance of the lhs; example: ?m < ?n ==> f(?n) == f(?m)*) 
421 
orelse 

422 
is_Const lhs andalso not (is_Const rhs); 

10413  423 

424 
fun decomp_simp thm = 

15023  425 
let 
26626
c6231d64d264
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26424
diff
changeset

426 
val thy = Thm.theory_of_thm thm; 
c6231d64d264
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26424
diff
changeset

427 
val prop = Thm.prop_of thm; 
15023  428 
val prems = Logic.strip_imp_prems prop; 
429 
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

430 
val (lhs, rhs) = Thm.dest_equals concl handle TERM _ => 
15023  431 
raise SIMPLIFIER ("Rewrite rule not a metaequality", thm); 
20579  432 
val elhs = Thm.dest_arg (Thm.cprop_of (Thm.eta_conversion lhs)); 
16665  433 
val elhs = if term_of elhs aconv term_of lhs then lhs else elhs; (*share identical copies*) 
18929  434 
val erhs = Envir.eta_contract (term_of rhs); 
15023  435 
val perm = 
436 
var_perm (term_of elhs, erhs) andalso 

437 
not (term_of elhs aconv erhs) andalso 

438 
not (is_Var (term_of elhs)); 

16458  439 
in (thy, prems, term_of lhs, elhs, term_of rhs, perm) end; 
10413  440 

12783  441 
fun decomp_simp' thm = 
12979
4c76bce4ce39
decomp_simp': use lhs instead of elhs (preserves more bound variable names);
wenzelm
parents:
12783
diff
changeset

442 
let val (_, _, lhs, _, rhs, _) = decomp_simp thm in 
12783  443 
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

444 
else (lhs, rhs) 
12783  445 
end; 
446 

15023  447 
fun mk_eq_True (Simpset (_, {mk_rews = {mk_eq_True, ...}, ...})) (thm, name) = 
448 
(case mk_eq_True thm of 

15531  449 
NONE => [] 
450 
 SOME eq_True => 

20546
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

451 
let 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

452 
val (_, _, lhs, elhs, _, _) = decomp_simp eq_True; 
15023  453 
in [{thm = eq_True, name = name, lhs = lhs, elhs = elhs, perm = false}] end); 
10413  454 

15023  455 
(*create the rewrite rule and possibly also the eq_True variant, 
456 
in case there are extra vars on the rhs*) 

457 
fun rrule_eq_True (thm, name, lhs, elhs, rhs, ss, thm2) = 

458 
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

459 
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

460 
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

461 
else [rrule] 
10413  462 
end; 
463 

15023  464 
fun mk_rrule ss (thm, name) = 
465 
let val (_, prems, lhs, elhs, rhs, perm) = decomp_simp thm in 

466 
if perm then [{thm = thm, name = name, lhs = lhs, elhs = elhs, perm = true}] 

467 
else 

468 
(*weak test for loops*) 

469 
if rewrite_rule_extra_vars prems lhs rhs orelse is_Var (term_of elhs) 

470 
then mk_eq_True ss (thm, name) 

471 
else rrule_eq_True (thm, name, lhs, elhs, rhs, ss, thm) 

10413  472 
end; 
473 

15023  474 
fun orient_rrule ss (thm, name) = 
18208  475 
let 
476 
val (thy, prems, lhs, elhs, rhs, perm) = decomp_simp thm; 

477 
val Simpset (_, {mk_rews = {reorient, mk_sym, ...}, ...}) = ss; 

478 
in 

15023  479 
if perm then [{thm = thm, name = name, lhs = lhs, elhs = elhs, perm = true}] 
16458  480 
else if reorient thy prems lhs rhs then 
481 
if reorient thy prems rhs lhs 

15023  482 
then mk_eq_True ss (thm, name) 
483 
else 

18208  484 
(case mk_sym thm of 
485 
NONE => [] 

486 
 SOME thm' => 

487 
let val (_, _, lhs', elhs', rhs', _) = decomp_simp thm' 

488 
in rrule_eq_True (thm', name, lhs', elhs', rhs', ss, thm) end) 

15023  489 
else rrule_eq_True (thm, name, lhs, elhs, rhs, ss, thm) 
10413  490 
end; 
491 

15199  492 
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

493 
maps (fn thm => map (rpair (Thm.get_name_hint thm)) (mk thm)) thms; 
10413  494 

15023  495 
fun extract_safe_rrules (ss, thm) = 
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19303
diff
changeset

496 
maps (orient_rrule ss) (extract_rews (ss, [thm])); 
10413  497 

498 

20028
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset

499 
(* add/del rules explicitly *) 
10413  500 

20028
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset

501 
fun comb_simps comb mk_rrule (ss, thms) = 
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset

502 
let 
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset

503 
val rews = extract_rews (ss, thms); 
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset

504 
in fold (fold comb o mk_rrule) rews ss end; 
10413  505 

20028
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset

506 
fun ss addsimps thms = 
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset

507 
comb_simps insert_rrule (mk_rrule ss) (ss, thms); 
10413  508 

15023  509 
fun ss delsimps thms = 
20028
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset

510 
comb_simps del_rrule (map mk_rrule2 o mk_rrule ss) (ss, thms); 
15023  511 

27558  512 
fun add_simp thm ss = ss addsimps [thm]; 
513 
fun del_simp thm ss = ss delsimps [thm]; 

15023  514 

30318
3d03190d2864
replaced archaic use of rep_ss by Simplifier.mksimps;
wenzelm
parents:
29269
diff
changeset

515 

15023  516 
(* congs *) 
10413  517 

15531  518 
fun cong_name (Const (a, _)) = SOME a 
519 
 cong_name (Free (a, _)) = SOME ("Free: " ^ a) 

520 
 cong_name _ = NONE; 

13835
12b2ffbe543a
Change to meta simplifier: congruence rules may now have frees as head of term.
ballarin
parents:
13828
diff
changeset

521 

15023  522 
local 
523 

524 
fun is_full_cong_prems [] [] = true 

525 
 is_full_cong_prems [] _ = false 

526 
 is_full_cong_prems (p :: prems) varpairs = 

527 
(case Logic.strip_assums_concl p of 

528 
Const ("==", _) $ lhs $ rhs => 

529 
let val (x, xs) = strip_comb lhs and (y, ys) = strip_comb rhs in 

530 
is_Var x andalso forall is_Bound xs andalso 

20972  531 
not (has_duplicates (op =) xs) andalso xs = ys andalso 
20671  532 
member (op =) varpairs (x, y) andalso 
19303  533 
is_full_cong_prems prems (remove (op =) (x, y) varpairs) 
15023  534 
end 
535 
 _ => false); 

536 

537 
fun is_full_cong thm = 

10413  538 
let 
15023  539 
val prems = prems_of thm and concl = concl_of thm; 
540 
val (lhs, rhs) = Logic.dest_equals concl; 

541 
val (f, xs) = strip_comb lhs and (g, ys) = strip_comb rhs; 

10413  542 
in 
20972  543 
f = g andalso not (has_duplicates (op =) (xs @ ys)) andalso length xs = length ys andalso 
15023  544 
is_full_cong_prems prems (xs ~~ ys) 
10413  545 
end; 
546 

15023  547 
fun add_cong (ss, thm) = ss > 
548 
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) => 

549 
let 

22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

550 
val (lhs, _) = Thm.dest_equals (Drule.strip_imp_concl (Thm.cprop_of thm)) 
15023  551 
handle TERM _ => raise SIMPLIFIER ("Congruence not a metaequality", thm); 
18929  552 
(*val lhs = Envir.eta_contract lhs;*) 
20057  553 
val a = the (cong_name (head_of (term_of lhs))) handle Option.Option => 
15023  554 
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

555 
val (xs, weak) = congs; 
8a8aa6114a89
changed cong alist  now using AList operations instead of overwrite_warn
haftmann
parents:
22008
diff
changeset

556 
val _ = if AList.defined (op =) xs a 
8a8aa6114a89
changed cong alist  now using AList operations instead of overwrite_warn
haftmann
parents:
22008
diff
changeset

557 
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

558 
else (); 
30908
7ccf4a3d764c
replace type cong = {thm : thm, lhs : term} by plain thm  the other component has been unused for a long time.
krauss
parents:
30552
diff
changeset

559 
val xs' = AList.update (op =) (a, thm) xs; 
22221
8a8aa6114a89
changed cong alist  now using AList operations instead of overwrite_warn
haftmann
parents:
22008
diff
changeset

560 
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

561 
in ((xs', weak'), procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) end); 
10413  562 

15023  563 
fun del_cong (ss, thm) = ss > 
564 
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) => 

565 
let 

566 
val (lhs, _) = Logic.dest_equals (Thm.concl_of thm) handle TERM _ => 

567 
raise SIMPLIFIER ("Congruence not a metaequality", thm); 

18929  568 
(*val lhs = Envir.eta_contract lhs;*) 
20057  569 
val a = the (cong_name (head_of lhs)) handle Option.Option => 
15023  570 
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

571 
val (xs, _) = congs; 
8a8aa6114a89
changed cong alist  now using AList operations instead of overwrite_warn
haftmann
parents:
22008
diff
changeset

572 
val xs' = filter_out (fn (x : string, _) => x = a) xs; 
30908
7ccf4a3d764c
replace type cong = {thm : thm, lhs : term} by plain thm  the other component has been unused for a long time.
krauss
parents:
30552
diff
changeset

573 
val weak' = xs' > map_filter (fn (a, thm) => 
15531  574 
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

575 
in ((xs', weak'), procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) end); 
10413  576 

15023  577 
fun mk_cong (Simpset (_, {mk_rews = {mk_cong = f, ...}, ...})) = f; 
578 

579 
in 

580 

15570  581 
val (op addeqcongs) = Library.foldl add_cong; 
582 
val (op deleqcongs) = Library.foldl del_cong; 

15023  583 

584 
fun ss addcongs congs = ss addeqcongs map (mk_cong ss) congs; 

585 
fun ss delcongs congs = ss deleqcongs map (mk_cong ss) congs; 

586 

587 
end; 

10413  588 

589 

15023  590 
(* simprocs *) 
591 

22234  592 
datatype simproc = 
593 
Simproc of 

594 
{name: string, 

595 
lhss: cterm list, 

596 
proc: morphism > simpset > cterm > thm option, 

597 
id: stamp * thm list}; 

598 

599 
fun eq_simproc (Simproc {id = id1, ...}, Simproc {id = id2, ...}) = eq_procid (id1, id2); 

22008  600 

22234  601 
fun morph_simproc phi (Simproc {name, lhss, proc, id = (s, ths)}) = 
602 
Simproc 

603 
{name = name, 

604 
lhss = map (Morphism.cterm phi) lhss, 

22669  605 
proc = Morphism.transform phi proc, 
22234  606 
id = (s, Morphism.fact phi ths)}; 
607 

608 
fun make_simproc {name, lhss, proc, identifier} = 

609 
Simproc {name = name, lhss = lhss, proc = proc, id = (stamp (), identifier)}; 

22008  610 

611 
fun mk_simproc name lhss proc = 

22234  612 
make_simproc {name = name, lhss = lhss, proc = fn _ => fn ss => fn ct => 
613 
proc (ProofContext.theory_of (the_context ss)) ss (Thm.term_of ct), identifier = []}; 

22008  614 

615 
(* FIXME avoid global thy and Logic.varify *) 

616 
fun simproc_i thy name = mk_simproc name o map (Thm.cterm_of thy o Logic.varify); 

24707  617 
fun simproc thy name = simproc_i thy name o map (Syntax.read_term_global thy); 
22008  618 

619 

15023  620 
local 
10413  621 

16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

622 
fun add_proc (proc as Proc {name, lhs, ...}) ss = 
22254  623 
(trace_cterm false (fn () => "Adding simplification procedure " ^ quote name ^ " for") ss lhs; 
15023  624 
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) => 
16807  625 
(congs, Net.insert_term eq_proc (term_of lhs, proc) procs, 
15023  626 
mk_rews, termless, subgoal_tac, loop_tacs, solvers)) ss 
627 
handle Net.INSERT => 

628 
(warning ("Ignoring duplicate simplification procedure " ^ quote name); ss)); 

10413  629 

16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

630 
fun del_proc (proc as Proc {name, lhs, ...}) ss = 
15023  631 
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) => 
16807  632 
(congs, Net.delete_term eq_proc (term_of lhs, proc) procs, 
15023  633 
mk_rews, termless, subgoal_tac, loop_tacs, solvers)) ss 
634 
handle Net.DELETE => 

635 
(warning ("Simplification procedure " ^ quote name ^ " not in simpset"); ss); 

10413  636 

22234  637 
fun prep_procs (Simproc {name, lhss, proc, id}) = 
22669  638 
lhss > map (fn lhs => Proc {name = name, lhs = lhs, proc = Morphism.form proc, id = id}); 
22234  639 

15023  640 
in 
10413  641 

22234  642 
fun ss addsimprocs ps = fold (fold add_proc o prep_procs) ps ss; 
643 
fun ss delsimprocs ps = fold (fold del_proc o prep_procs) ps ss; 

10413  644 

15023  645 
end; 
10413  646 

647 

648 
(* mk_rews *) 

649 

15023  650 
local 
651 

18208  652 
fun map_mk_rews f = map_simpset2 (fn (congs, procs, {mk, mk_cong, mk_sym, mk_eq_True, reorient}, 
15023  653 
termless, subgoal_tac, loop_tacs, solvers) => 
18208  654 
let 
655 
val (mk', mk_cong', mk_sym', mk_eq_True', reorient') = 

656 
f (mk, mk_cong, mk_sym, mk_eq_True, reorient); 

657 
val mk_rews' = {mk = mk', mk_cong = mk_cong', mk_sym = mk_sym', mk_eq_True = mk_eq_True', 

658 
reorient = reorient'}; 

659 
in (congs, procs, mk_rews', termless, subgoal_tac, loop_tacs, solvers) end); 

15023  660 

661 
in 

10413  662 

30336  663 
fun mksimps (Simpset (_, {mk_rews = {mk, ...}, ...})) = mk; 
30318
3d03190d2864
replaced archaic use of rep_ss by Simplifier.mksimps;
wenzelm
parents:
29269
diff
changeset

664 

18208  665 
fun ss setmksimps mk = ss > map_mk_rews (fn (_, mk_cong, mk_sym, mk_eq_True, reorient) => 
666 
(mk, mk_cong, mk_sym, mk_eq_True, reorient)); 

15023  667 

18208  668 
fun ss setmkcong mk_cong = ss > map_mk_rews (fn (mk, _, mk_sym, mk_eq_True, reorient) => 
669 
(mk, mk_cong, mk_sym, mk_eq_True, reorient)); 

10413  670 

18208  671 
fun ss setmksym mk_sym = ss > map_mk_rews (fn (mk, mk_cong, _, mk_eq_True, reorient) => 
672 
(mk, mk_cong, mk_sym, mk_eq_True, reorient)); 

10413  673 

18208  674 
fun ss setmkeqTrue mk_eq_True = ss > map_mk_rews (fn (mk, mk_cong, mk_sym, _, reorient) => 
675 
(mk, mk_cong, mk_sym, mk_eq_True, reorient)); 

676 

677 
fun set_reorient reorient = map_mk_rews (fn (mk, mk_cong, mk_sym, mk_eq_True, _) => 

678 
(mk, mk_cong, mk_sym, mk_eq_True, reorient)); 

15023  679 

680 
end; 

681 

14242
ec70653a02bf
Added access to the mk_rews field (and friends).
skalberg
parents:
14040
diff
changeset

682 

10413  683 
(* termless *) 
684 

15023  685 
fun ss settermless termless = ss > 
686 
map_simpset2 (fn (congs, procs, mk_rews, _, subgoal_tac, loop_tacs, solvers) => 

687 
(congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers)); 

15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

688 

107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

689 

15023  690 
(* tactics *) 
15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

691 

15023  692 
fun ss setsubgoaler subgoal_tac = ss > 
693 
map_simpset2 (fn (congs, procs, mk_rews, termless, _, loop_tacs, solvers) => 

694 
(congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers)); 

15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

695 

17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

696 
fun ss setloop' tac = ss > 
15023  697 
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, _, solvers) => 
698 
(congs, procs, mk_rews, termless, subgoal_tac, [("", tac)], solvers)); 

15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

699 

17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

700 
fun ss setloop tac = ss setloop' (K tac); 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

701 

b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

702 
fun ss addloop' (name, tac) = ss > 
15023  703 
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) => 
704 
(congs, procs, mk_rews, termless, subgoal_tac, 

21286
b5e7b80caa6a
introduces canonical AList functions for loop_tacs
haftmann
parents:
20972
diff
changeset

705 
(if AList.defined (op =) loop_tacs name 
b5e7b80caa6a
introduces canonical AList functions for loop_tacs
haftmann
parents:
20972
diff
changeset

706 
then warning ("Overwriting looper " ^ quote name) 
b5e7b80caa6a
introduces canonical AList functions for loop_tacs
haftmann
parents:
20972
diff
changeset

707 
else (); AList.update (op =) (name, tac) loop_tacs), 
15023  708 
solvers)); 
15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

709 

17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

710 
fun ss addloop (name, tac) = ss addloop' (name, K tac); 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

711 

15023  712 
fun ss delloop name = ss > 
713 
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

714 
(congs, procs, mk_rews, termless, subgoal_tac, 
b5e7b80caa6a
introduces canonical AList functions for loop_tacs
haftmann
parents:
20972
diff
changeset

715 
(if AList.defined (op =) loop_tacs name 
b5e7b80caa6a
introduces canonical AList functions for loop_tacs
haftmann
parents:
20972
diff
changeset

716 
then () 
b5e7b80caa6a
introduces canonical AList functions for loop_tacs
haftmann
parents:
20972
diff
changeset

717 
else warning ("No such looper in simpset: " ^ quote name); 
b5e7b80caa6a
introduces canonical AList functions for loop_tacs
haftmann
parents:
20972
diff
changeset

718 
AList.delete (op =) name loop_tacs), solvers)); 
15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

719 

15023  720 
fun ss setSSolver solver = ss > map_simpset2 (fn (congs, procs, mk_rews, termless, 
721 
subgoal_tac, loop_tacs, (unsafe_solvers, _)) => 

722 
(congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, (unsafe_solvers, [solver]))); 

15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

723 

15023  724 
fun ss addSSolver solver = ss > map_simpset2 (fn (congs, procs, mk_rews, termless, 
725 
subgoal_tac, loop_tacs, (unsafe_solvers, solvers)) => (congs, procs, mk_rews, termless, 

22717  726 
subgoal_tac, loop_tacs, (unsafe_solvers, insert eq_solver solver solvers))); 
15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

727 

15023  728 
fun ss setSolver solver = ss > map_simpset2 (fn (congs, procs, mk_rews, termless, 
729 
subgoal_tac, loop_tacs, (_, solvers)) => (congs, procs, mk_rews, termless, 

730 
subgoal_tac, loop_tacs, ([solver], solvers))); 

15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

731 

15023  732 
fun ss addSolver solver = ss > map_simpset2 (fn (congs, procs, mk_rews, termless, 
733 
subgoal_tac, loop_tacs, (unsafe_solvers, solvers)) => (congs, procs, mk_rews, termless, 

22717  734 
subgoal_tac, loop_tacs, (insert eq_solver solver unsafe_solvers, solvers))); 
15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

735 

15023  736 
fun set_solvers solvers = map_simpset2 (fn (congs, procs, mk_rews, termless, 
737 
subgoal_tac, loop_tacs, _) => (congs, procs, mk_rews, termless, 

738 
subgoal_tac, loop_tacs, (solvers, solvers))); 

15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

739 

107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

740 

18208  741 
(* empty *) 
742 

743 
fun init_ss mk_rews termless subgoal_tac solvers = 

32738  744 
make_simpset ((Net.empty, [], (0, []), (0, Unsynchronized.ref false), NONE), 
18208  745 
(([], []), Net.empty, mk_rews, termless, subgoal_tac, [], solvers)); 
746 

747 
fun clear_ss (ss as Simpset (_, {mk_rews, termless, subgoal_tac, solvers, ...})) = 

748 
init_ss mk_rews termless subgoal_tac solvers 

749 
> inherit_context ss; 

750 

751 
val basic_mk_rews: mk_rews = 

752 
{mk = fn th => if can Logic.dest_equals (Thm.concl_of th) then [th] else [], 

753 
mk_cong = I, 

754 
mk_sym = SOME o Drule.symmetric_fun, 

755 
mk_eq_True = K NONE, 

756 
reorient = default_reorient}; 

757 

29269
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
28839
diff
changeset

758 
val empty_ss = init_ss basic_mk_rews TermOrd.termless (K (K no_tac)) ([], []); 
18208  759 

760 

761 
(* merge *) (*NOTE: ignores some fields of 2nd simpset*) 

762 

763 
fun merge_ss (ss1, ss2) = 

24358  764 
if pointer_eq (ss1, ss2) then ss1 
765 
else 

766 
let 

767 
val Simpset ({rules = rules1, prems = prems1, bounds = bounds1, depth = depth1, context = _}, 

768 
{congs = (congs1, weak1), procs = procs1, mk_rews, termless, subgoal_tac, 

769 
loop_tacs = loop_tacs1, solvers = (unsafe_solvers1, solvers1)}) = ss1; 

770 
val Simpset ({rules = rules2, prems = prems2, bounds = bounds2, depth = depth2, context = _}, 

771 
{congs = (congs2, weak2), procs = procs2, mk_rews = _, termless = _, subgoal_tac = _, 

772 
loop_tacs = loop_tacs2, solvers = (unsafe_solvers2, solvers2)}) = ss2; 

30356  773 

24358  774 
val rules' = Net.merge eq_rrule (rules1, rules2); 
775 
val prems' = merge Thm.eq_thm_prop (prems1, prems2); 

776 
val bounds' = if #1 bounds1 < #1 bounds2 then bounds2 else bounds1; 

777 
val depth' = if #1 depth1 < #1 depth2 then depth2 else depth1; 

31298  778 
val congs' = merge (Thm.eq_thm_prop o pairself #2) (congs1, congs2); 
24358  779 
val weak' = merge (op =) (weak1, weak2); 
780 
val procs' = Net.merge eq_proc (procs1, procs2); 

781 
val loop_tacs' = AList.merge (op =) (K true) (loop_tacs1, loop_tacs2); 

782 
val unsafe_solvers' = merge eq_solver (unsafe_solvers1, unsafe_solvers2); 

783 
val solvers' = merge eq_solver (solvers1, solvers2); 

784 
in 

785 
make_simpset ((rules', prems', bounds', depth', NONE), ((congs', weak'), procs', 

786 
mk_rews, termless, subgoal_tac, loop_tacs', (unsafe_solvers', solvers'))) 

787 
end; 

18208  788 

789 

30356  790 
(* dest_ss *) 
791 

792 
fun dest_ss (Simpset ({rules, ...}, {congs, procs, loop_tacs, solvers, ...})) = 

793 
{simps = Net.entries rules 

794 
> map (fn {name, thm, ...} => (name, thm)), 

795 
procs = Net.entries procs 

796 
> map (fn Proc {name, lhs, id, ...} => ((name, lhs), id)) 

797 
> partition_eq (eq_snd eq_procid) 

798 
> map (fn ps => (fst (fst (hd ps)), map (snd o fst) ps)), 

30908
7ccf4a3d764c
replace type cong = {thm : thm, lhs : term} by plain thm  the other component has been unused for a long time.
krauss
parents:
30552
diff
changeset

799 
congs = #1 congs, 
30356  800 
weak_congs = #2 congs, 
801 
loopers = map fst loop_tacs, 

802 
unsafe_solvers = map solver_name (#1 solvers), 

803 
safe_solvers = map solver_name (#2 solvers)}; 

804 

805 

15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

806 

10413  807 
(** rewriting **) 
808 

809 
(* 

810 
Uses conversions, see: 

811 
L C Paulson, A higherorder implementation of rewriting, 

812 
Science of Computer Programming 3 (1983), pages 119149. 

813 
*) 

814 

16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

815 
fun check_conv msg ss thm thm' = 
10413  816 
let 
25472
3276a14d06a6
check_conv now only performs betaetanormalization when equations
berghofe
parents:
25203
diff
changeset

817 
val thm'' = transitive thm thm' handle THM _ => 
3276a14d06a6
check_conv now only performs betaetanormalization when equations
berghofe
parents:
25203
diff
changeset

818 
transitive thm (transitive 
3276a14d06a6
check_conv now only performs betaetanormalization when equations
berghofe
parents:
25203
diff
changeset

819 
(symmetric (Drule.beta_eta_conversion (Thm.lhs_of thm'))) thm') 
22254  820 
in if msg then trace_thm (fn () => "SUCCEEDED") ss thm' else (); SOME thm'' end 
10413  821 
handle THM _ => 
26626
c6231d64d264
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26424
diff
changeset

822 
let 
c6231d64d264
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26424
diff
changeset

823 
val thy = Thm.theory_of_thm thm; 
c6231d64d264
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26424
diff
changeset

824 
val _ $ _ $ prop0 = Thm.prop_of thm; 
c6231d64d264
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26424
diff
changeset

825 
in 
22254  826 
trace_thm (fn () => "Proved wrong thm (Check subgoaler?)") ss thm'; 
827 
trace_term false (fn () => "Should have proved:") ss thy prop0; 

15531  828 
NONE 
10413  829 
end; 
830 

831 

832 
(* mk_procrule *) 

833 

16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

834 
fun mk_procrule ss thm = 
15023  835 
let val (_, prems, lhs, elhs, rhs, _) = decomp_simp thm in 
836 
if rewrite_rule_extra_vars prems lhs rhs 

16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

837 
then (warn_thm "Extra vars on rhs:" ss thm; []) 
15023  838 
else [mk_rrule2 {thm = thm, name = "", lhs = lhs, elhs = elhs, perm = false}] 
10413  839 
end; 
840 

841 

15023  842 
(* rewritec: conversion to apply the meta simpset to a term *) 
10413  843 

15023  844 
(*Since the rewriting strategy is bottomup, we avoid renormalizing already 
845 
normalized terms by carrying around the rhs of the rewrite rule just 

846 
applied. This is called the `skeleton'. It is decomposed in parallel 

847 
with the term. Once a Var is encountered, the corresponding term is 

848 
already in normal form. 

849 
skel0 is a dummy skeleton that is to enforce complete normalization.*) 

850 

10413  851 
val skel0 = Bound 0; 
852 

15023  853 
(*Use rhs as skeleton only if the lhs does not contain unnormalized bits. 
854 
The latter may happen iff there are weak congruence rules for constants 

855 
in the lhs.*) 

10413  856 

15023  857 
fun uncond_skel ((_, weak), (lhs, rhs)) = 
858 
if null weak then rhs (*optimization*) 

20671  859 
else if exists_Const (member (op =) weak o #1) lhs then skel0 
15023  860 
else rhs; 
861 

862 
(*Behaves like unconditional rule if rhs does not contain vars not in the lhs. 

863 
Otherwise those vars may become instantiated with unnormalized terms 

864 
while the premises are solved.*) 

865 

32797  866 
fun cond_skel (args as (_, (lhs, rhs))) = 
20197
ffc64d90fc1f
use Term.add_vars instead of obsolete term_varnames;
wenzelm
parents:
20146
diff
changeset

867 
if Term.add_vars rhs [] subset Term.add_vars lhs [] then uncond_skel args 
10413  868 
else skel0; 
869 

870 
(* 

15023  871 
Rewriting  we try in order: 
10413  872 
(1) beta reduction 
873 
(2) unconditional rewrite rules 

874 
(3) conditional rewrite rules 

875 
(4) simplification procedures 

876 

877 
IMPORTANT: rewrite rules must not introduce new Vars or TVars! 

878 
*) 

879 

16458  880 
fun rewritec (prover, thyt, maxt) ss t = 
10413  881 
let 
24124
4399175e3014
turned simp_depth_limit into configuration option;
wenzelm
parents:
23938
diff
changeset

882 
val ctxt = the_context ss; 
15023  883 
val Simpset ({rules, ...}, {congs, procs, termless, ...}) = ss; 
10413  884 
val eta_thm = Thm.eta_conversion t; 
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

885 
val eta_t' = Thm.rhs_of eta_thm; 
10413  886 
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

887 
fun rew {thm, name, lhs, elhs, extra, fo, perm} = 
10413  888 
let 
32797  889 
val prop = Thm.prop_of thm; 
20546
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

890 
val (rthm, elhs') = 
8923deb735ad
rrule: maintain 'extra' field for rule that contain extra vars outside elhs;
wenzelm
parents:
20330
diff
changeset

891 
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

892 
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

893 
val insts = 
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

894 
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

895 
else Thm.match (elhs', eta_t'); 
10413  896 
val thm' = Thm.instantiate insts (Thm.rename_boundvars lhs eta_t rthm); 
14643  897 
val prop' = Thm.prop_of thm'; 
21576  898 
val unconditional = (Logic.count_prems prop' = 0); 
10413  899 
val (lhs', rhs') = Logic.dest_equals (Logic.strip_imp_concl prop') 
900 
in 

11295  901 
if perm andalso not (termless (rhs', lhs')) 
22254  902 
then (trace_named_thm (fn () => "Cannot apply permutative rewrite rule") ss (thm, name); 
903 
trace_thm (fn () => "Term does not become smaller:") ss thm'; NONE) 

904 
else (trace_named_thm (fn () => "Applying instance of rewrite rule") ss (thm, name); 

10413  905 
if unconditional 
906 
then 

22254  907 
(trace_thm (fn () => "Rewriting:") ss thm'; 
10413  908 
let val lr = Logic.dest_equals prop; 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

909 
val SOME thm'' = check_conv false ss eta_thm thm' 
15531  910 
in SOME (thm'', uncond_skel (congs, lr)) end) 
10413  911 
else 
22254  912 
(trace_thm (fn () => "Trying to rewrite:") ss thm'; 
24124
4399175e3014
turned simp_depth_limit into configuration option;
wenzelm
parents:
23938
diff
changeset

913 
if simp_depth ss > Config.get ctxt simp_depth_limit 
16042  914 
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 multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

915 
in trace false (fn () => s) ss; warning s; NONE end 
16042  916 
else 
917 
case prover ss thm' of 

22254  918 
NONE => (trace_thm (fn () => "FAILED") ss thm'; NONE) 
15531  919 
 SOME thm2 => 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

920 
(case check_conv true ss eta_thm thm2 of 
15531  921 
NONE => NONE  
922 
SOME thm2' => 

10413  923 
let val concl = Logic.strip_imp_concl prop 
924 
val lr = Logic.dest_equals concl 

16042  925 
in SOME (thm2', cond_skel (congs, lr)) end))) 
10413  926 
end 
927 

15531  928 
fun rews [] = NONE 
10413  929 
 rews (rrule :: rrules) = 
15531  930 
let val opt = rew rrule handle Pattern.MATCH => NONE 
931 
in case opt of NONE => rews rrules  some => some end; 

10413  932 

933 
fun sort_rrules rrs = let 

14643  934 
fun is_simple({thm, ...}:rrule) = case Thm.prop_of thm of 
10413  935 
Const("==",_) $ _ $ _ => true 
12603  936 
 _ => false 
10413  937 
fun sort [] (re1,re2) = re1 @ re2 
12603  938 
 sort (rr::rrs) (re1,re2) = if is_simple rr 
10413  939 
then sort rrs (rr::re1,re2) 
940 
else sort rrs (re1,rr::re2) 

941 
in sort rrs ([],[]) end 

942 

15531  943 
fun proc_rews [] = NONE 
15023  944 
 proc_rews (Proc {name, proc, lhs, ...} :: ps) = 
17203  945 
if Pattern.matches thyt (Thm.term_of lhs, Thm.term_of t) then 
22254  946 
(debug_term false (fn () => "Trying procedure " ^ quote name ^ " on:") ss thyt eta_t; 
23938  947 
case proc ss eta_t' of 
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

948 
NONE => (debug false (fn () => "FAILED") ss; proc_rews ps) 
15531  949 
 SOME raw_thm => 
22254  950 
(trace_thm (fn () => "Procedure " ^ quote name ^ " produced rewrite rule:") 
951 
ss raw_thm; 

16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

952 
(case rews (mk_procrule ss raw_thm) of 
22254  953 
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

954 
"  does not match") ss t; proc_rews ps) 
10413  955 
 some => some))) 
956 
else proc_rews ps; 

957 
in case eta_t of 

15531  958 
Abs _ $ _ => SOME (transitive eta_thm 
12155
13c5469b4bb3
congc now returns None if congruence rule has no effect.
berghofe
parents:
11886
diff
changeset

959 
(beta_conversion false eta_t'), skel0) 
10413  960 
 _ => (case rews (sort_rrules (Net.match_term rules eta_t)) of 
15531  961 
NONE => proc_rews (Net.match_term procs eta_t) 
10413  962 
 some => some) 
963 
end; 

964 

965 

966 
(* conversion to apply a congruence rule to a term *) 

967 

30908
7ccf4a3d764c
replace type cong = {thm : thm, lhs : term} by plain thm  the other component has been unused for a long time.
krauss
parents:
30552
diff
changeset

968 
fun congc prover ss maxt cong t = 
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

969 
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

970 
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

971 
val insts = Thm.match (rlhs, t) 
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

972 
(* Thm.match can raise Pattern.MATCH; 
10413  973 
is handled when congc is called *) 
974 
val thm' = Thm.instantiate insts (Thm.rename_boundvars (term_of rlhs) (term_of t) rthm); 

32797  975 
val _ = trace_thm (fn () => "Applying congruence rule:") ss thm'; 
22254  976 
fun err (msg, thm) = (trace_thm (fn () => msg) ss thm; NONE) 
10413  977 
in case prover thm' of 
15531  978 
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

979 
 SOME thm2 => (case check_conv true ss (Drule.beta_eta_conversion t) thm2 of 
15531  980 
NONE => err ("Congruence proof failed. Should not have proved", thm2) 
981 
 SOME thm2' => 

22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

982 
if op aconv (pairself term_of (Thm.dest_equals (cprop_of thm2'))) 
15531  983 
then NONE else SOME thm2') 
10413  984 
end; 
985 

986 
val (cA, (cB, cC)) = 

22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

987 
apsnd Thm.dest_equals (Thm.dest_implies (hd (cprems_of Drule.imp_cong))); 
10413  988 

15531  989 
fun transitive1 NONE NONE = NONE 
990 
 transitive1 (SOME thm1) NONE = SOME thm1 

991 
 transitive1 NONE (SOME thm2) = SOME thm2 

992 
 transitive1 (SOME thm1) (SOME thm2) = SOME (transitive thm1 thm2) 

10413  993 

15531  994 
fun transitive2 thm = transitive1 (SOME thm); 
995 
fun transitive3 thm = transitive1 thm o SOME; 

13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

996 

16458  997 
fun bottomc ((simprem, useprem, mutsimp), prover, thy, maxidx) = 
10413  998 
let 
15023  999 
fun botc skel ss t = 
15531  1000 
if is_Var skel then NONE 
10413  1001 
else 
15023  1002 
(case subc skel ss t of 
15531  1003 
some as SOME thm1 => 
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

1004 
(case rewritec (prover, thy, maxidx) ss (Thm.rhs_of thm1) of 
15531  1005 
SOME (thm2, skel2) => 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1006 
transitive2 (transitive thm1 thm2) 
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

1007 
(botc skel2 ss (Thm.rhs_of thm2)) 
15531  1008 
 NONE => some) 
1009 
 NONE => 

16458  1010 
(case rewritec (prover, thy, maxidx) ss t of 
15531  1011 
SOME (thm2, skel2) => transitive2 thm2 
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

1012 
(botc skel2 ss (Thm.rhs_of thm2)) 
15531  1013 
 NONE => NONE)) 
10413  1014 

15023  1015 
and try_botc ss t = 
1016 
(case botc skel0 ss t of 

15531  1017 
SOME trec1 => trec1  NONE => (reflexive t)) 
10413  1018 

15023  1019 
and subc skel (ss as Simpset ({bounds, ...}, {congs, ...})) t0 = 
10413  1020 
(case term_of t0 of 
32797  1021 
Abs (a, T, _) => 
15023  1022 
let 
20079
ec5c8584487c
replaced Term.variant(list) by Name.variant(_list);
wenzelm
parents:
20057
diff
changeset

1023 
val b = Name.bound (#1 bounds); 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

1024 
val (v, t') = Thm.dest_abs (SOME b) t0; 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

1025 
val b' = #1 (Term.dest_Free (Thm.term_of v)); 
21962  1026 
val _ = 
1027 
if b <> b' then 

1028 
warning ("Simplifier: renamed bound variable " ^ quote b ^ " to " ^ quote b') 

1029 
else (); 

17614  1030 
val ss' = add_bound ((b', T), a) ss; 
15023  1031 
val skel' = case skel of Abs (_, _, sk) => sk  _ => skel0; 
1032 
in case botc skel' ss' t' of 

15531  1033 
SOME thm => SOME (abstract_rule a v thm) 
1034 
 NONE => NONE 

10413  1035 
end 
1036 
 t $ _ => (case t of 

15023  1037 
Const ("==>", _) $ _ => impc t0 ss 
10413  1038 
 Abs _ => 
1039 
let val thm = beta_conversion false t0 

22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

1040 
in case subc skel0 ss (Thm.rhs_of thm) of 
15531  1041 
NONE => SOME thm 
1042 
 SOME thm' => SOME (transitive thm thm') 

10413  1043 
end 
1044 
 _ => 

1045 
let fun appc () = 

1046 
let 

1047 
val (tskel, uskel) = case skel of 

1048 
tskel $ uskel => (tskel, uskel) 

1049 
 _ => (skel0, skel0); 

10767
8fa4aafa7314
Thm: dest_comb, dest_abs, capply, cabs no longer global;
wenzelm
parents:
10413
diff
changeset

1050 
val (ct, cu) = Thm.dest_comb t0 
10413  1051 
in 
15023  1052 
(case botc tskel ss ct of 
15531  1053 
SOME thm1 => 
15023  1054 
(case botc uskel ss cu of 
15531  1055 
SOME thm2 => SOME (combination thm1 thm2) 
1056 
 NONE => SOME (combination thm1 (reflexive cu))) 

1057 
 NONE => 

15023  1058 
(case botc uskel ss cu of 
15531  1059 
SOME thm1 => SOME (combination (reflexive ct) thm1) 
1060 
 NONE => NONE)) 

10413  1061 
end 
1062 
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

1063 
in case cong_name h of 
15531  1064 
SOME a => 
17232  1065 
(case AList.lookup (op =) (fst congs) a of 
15531  1066 
NONE => appc () 
1067 
 SOME cong => 

15023  1068 
(*post processing: some partial applications h t1 ... tj, j <= length ts, 
1069 
may be a redex. Example: map (%x. x) = (%xs. xs) wrt map_cong*) 

10413  1070 
(let 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

1071 
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

1072 
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

1073 
val (cl, cr) = Thm.dest_comb t 
10413  1074 
val dVar = Var(("", 0), dummyT) 
1075 
val skel = 

1076 
list_comb (h, replicate (length ts) dVar) 

15023  1077 
in case botc skel ss cl of 
15531  1078 
NONE => thm 
1079 
 SOME thm' => transitive3 thm 

12155
13c5469b4bb3
congc now returns None if congruence rule has no effect.
berghofe
parents:
11886
diff
changeset

1080 
(combination thm' (reflexive cr)) 
20057  1081 
end handle Pattern.MATCH => appc ())) 
10413  1082 
 _ => appc () 
1083 
end) 

15531  1084 
 _ => NONE) 
10413  1085 

15023  1086 
and impc ct ss = 
1087 
if mutsimp then mut_impc0 [] ct [] [] ss else nonmut_impc ct ss 

10413  1088 

15023  1089 
and rules_of_prem ss prem = 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1090 
if maxidx_of_term (term_of prem) <> ~1 
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1091 
then (trace_cterm true 
22254  1092 
(fn () => "Cannot add premise as rewrite rule because it contains (type) unknowns:") 
1093 
ss prem; ([], NONE)) 

13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1094 
else 
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1095 
let val asm = assume prem 
15531  1096 
in (extract_safe_rrules (ss, asm), SOME asm) end 
10413  1097 

15023  1098 
and add_rrules (rrss, asms) ss = 
20028
b9752164ad92
add/del_simps: warning for inactive simpset (no context);
wenzelm
parents:
19798
diff
changeset

1099 
(fold o fold) insert_rrule rrss ss > add_prems (map_filter I asms) 
10413  1100 

23178  1101 
and disch r prem eq = 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1102 
let 
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

1103 
val (lhs, rhs) = Thm.dest_equals (Thm.cprop_of eq); 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1104 
val eq' = implies_elim (Thm.instantiate 
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1105 
([], [(cA, prem), (cB, lhs), (cC, rhs)]) Drule.imp_cong) 
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1106 
(implies_intr prem eq) 
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1107 
in if not r then eq' else 
10413  1108 
let 
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

1109 
val (prem', concl) = Thm.dest_implies lhs; 
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

1110 
val (prem'', _) = Thm.dest_implies rhs 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1111 
in transitive (transitive 
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1112 
(Thm.instantiate ([], [(cA, prem'), (cB, prem), (cC, concl)]) 
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1113 
Drule.swap_prems_eq) eq') 
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1114 
(Thm.instantiate ([], [(cA, prem), (cB, prem''), (cC, concl)]) 
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1115 
Drule.swap_prems_eq) 
10413  1116 
end 
1117 
end 

1118 

13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1119 
and rebuild [] _ _ _ _ eq = eq 
32797  1120 
 rebuild (prem :: prems) concl (_ :: rrss) (_ :: asms) ss eq = 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1121 
let 
15023  1122 
val ss' = add_rrules (rev rrss, rev asms) ss; 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1123 
val concl' = 
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

1124 
Drule.mk_implies (prem, the_default concl (Option.map Thm.rhs_of eq)); 
23178  1125 
val dprem = Option.map (disch false prem) 
16458  1126 
in case rewritec (prover, thy, maxidx) ss' concl' of 
15531  1127 
NONE => rebuild prems concl' rrss asms ss (dprem eq) 
23178  1128 
 SOME (eq', _) => transitive2 (fold (disch false) 
1129 
prems (the (transitive3 (dprem eq) eq'))) 

22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

1130 
(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

1131 
end 
15023  1132 

1133 
and mut_impc0 prems concl rrss asms ss = 

13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1134 
let 
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1135 
val prems' = strip_imp_prems concl; 
15023  1136 
val (rrss', asms') = split_list (map (rules_of_prem ss) prems') 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1137 
in mut_impc (prems @ prems') (strip_imp_concl concl) (rrss @ rrss') 
15023  1138 
(asms @ asms') [] [] [] [] ss ~1 ~1 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1139 
end 
15023  1140 

1141 
and mut_impc [] concl [] [] prems' rrss' asms' eqns ss changed k = 

15570  1142 
transitive1 (Library.foldl (fn (eq2, (eq1, prem)) => transitive1 eq1 
23178  1143 
(Option.map (disch false prem) eq2)) (NONE, eqns ~~ prems')) 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1144 
(if changed > 0 then 
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1145 
mut_impc (rev prems') concl (rev rrss') (rev asms') 
15023  1146 
[] [] [] [] ss ~1 changed 
1147 
else rebuild prems' concl rrss' asms' ss 

1148 
(botc skel0 (add_rrules (rev rrss', rev asms') ss) concl)) 

13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1149 

6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1150 
 mut_impc (prem :: prems) concl (rrs :: rrss) (asm :: asms) 
15023  1151 
prems' rrss' asms' eqns ss changed k = 
15531  1152 
case (if k = 0 then NONE else botc skel0 (add_rrules 
15023  1153 
(rev rrss' @ rrss, rev asms' @ asms) ss) prem) of 
15531  1154 
NONE => mut_impc prems concl rrss asms (prem :: prems') 
1155 
(rrs :: rrss') (asm :: asms') (NONE :: eqns) ss changed 

13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1156 
(if k = 0 then 0 else k  1) 
15531  1157 
 SOME eqn => 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1158 
let 
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

1159 
val prem' = Thm.rhs_of eqn; 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1160 
val tprems = map term_of prems; 
15570  1161 
val i = 1 + Library.foldl Int.max (~1, map (fn p => 
19618  1162 
find_index (fn q => q aconv p) tprems) (#hyps (rep_thm eqn))); 
15023  1163 
val (rrs', asm') = rules_of_prem ss prem' 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1164 
in mut_impc prems concl rrss asms (prem' :: prems') 
23178  1165 
(rrs' :: rrss') (asm' :: asms') (SOME (fold_rev (disch true) 
1166 
(Library.take (i, prems)) 

18470  1167 
(Drule.imp_cong_rule eqn (reflexive (Drule.list_implies 
23178  1168 
(Library.drop (i, prems), concl))))) :: eqns) 
20671  1169 
ss (length prems') ~1 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1170 
end 
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1171 

15023  1172 
(*legacy code  only for backwards compatibility*) 
1173 
and nonmut_impc ct ss = 

22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

1174 
let val (prem, conc) = Thm.dest_implies ct; 
15531  1175 
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

1176 
val prem1 = the_default prem (Option.map Thm.rhs_of thm1); 
15023  1177 
val ss1 = if not useprem then ss else add_rrules 
1178 
(apsnd single (apfst single (rules_of_prem ss prem1))) ss 

1179 
in (case botc skel0 ss1 conc of 

15531  1180 
NONE => (case thm1 of 
1181 
NONE => NONE 

18470  1182 
 SOME thm1' => SOME (Drule.imp_cong_rule thm1' (reflexive conc))) 
15531  1183 
 SOME thm2 => 
23178  1184 
let val thm2' = disch false prem1 thm2 
10413  1185 
in (case thm1 of 
15531  1186 
NONE => SOME thm2' 
1187 
 SOME thm1' => 

18470  1188 
SOME (transitive (Drule.imp_cong_rule thm1' (reflexive conc)) thm2')) 
10413  1189 
end) 
1190 
end 

1191 

15023  1192 
in try_botc end; 
10413  1193 

1194 

15023  1195 
(* Metarewriting: rewrites t to u and returns the theorem t==u *) 
10413  1196 

1197 
(* 

1198 
Parameters: 

1199 
mode = (simplify A, 

1200 
use A in simplifying B, 

1201 
use prems of B (if B is again a metaimpl.) to simplify A) 

1202 
when simplifying A ==> B 

1203 
prover: how to solve premises in conditional rewrites and congruences 

1204 
*) 

1205 

32738  1206 
val debug_bounds = Unsynchronized.ref false; 
17705  1207 

21962  1208 
fun check_bounds ss ct = 
1209 
if ! debug_bounds then 

1210 
let 

1211 
val Simpset ({bounds = (_, bounds), ...}, _) = ss; 

1212 
val bs = fold_aterms (fn Free (x, _) => 

1213 
if Name.is_bound x andalso not (AList.defined eq_bound bounds x) 

1214 
then insert (op =) x else I 

1215 
 _ => I) (term_of ct) []; 

1216 
in 

1217 
if null bs then () 

22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

1218 
else print_term ss true ("Simplifier: term contains loose bounds: " ^ commas_quote bs) 
21962  1219 
(Thm.theory_of_cterm ct) (Thm.term_of ct) 
1220 
end 

1221 
else (); 

17614  1222 

19052
113dbd65319e
rewrite_cterm: Thm.adjust_maxidx prevents unnecessary increments on rules;
wenzelm
parents:
18929
diff
changeset

1223 
fun rewrite_cterm mode prover raw_ss raw_ct = 
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

1224 
let 
26626
c6231d64d264
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26424
diff
changeset

1225 
val thy = Thm.theory_of_cterm raw_ct; 
20260  1226 
val ct = Thm.adjust_maxidx_cterm ~1 raw_ct; 
32797  1227 
val {maxidx, ...} = Thm.rep_cterm ct; 
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

1228 
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 multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

1229 
val depth = simp_depth ss; 
21962  1230 
val _ = 
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

1231 
if depth mod 20 = 0 then 
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

1232 
warning ("Simplification depth " ^ string_of_int depth) 
21962  1233 
else (); 
22254  1234 
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

1235 
val _ = check_bounds ss ct; 
22892
c77a1e1c7323
simp_depth: now proper value in simpset (prevents problems with lost exception trace, enables multithreaded simplification);
wenzelm
parents:
22717
diff
changeset

1236 
in bottomc (mode, Option.map Drule.flexflex_unique oo prover, thy, maxidx) ss ct end; 
10413  1237 

21708  1238 
val simple_prover = 
1239 
SINGLE o (fn ss => ALLGOALS (resolve_tac (prems_of_ss ss))); 

1240 

1241 
fun rewrite _ [] ct = Thm.reflexive ct 

27582  1242 
 rewrite full thms ct = rewrite_cterm (full, false, false) simple_prover 
1243 
(theory_context (Thm.theory_of_cterm ct) empty_ss addsimps thms) ct; 

11672  1244 

23598  1245 
fun simplify full thms = Conv.fconv_rule (rewrite full thms); 
21708  1246 
val rewrite_rule = simplify true; 
1247 

15023  1248 
(*simple term rewriting  no proof*) 
16458  1249 
fun rewrite_term thy rules procs = 
17203  1250 
Pattern.rewrite_term thy (map decomp_simp' rules) procs; 
15023  1251 

22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22892
diff
changeset

1252 
fun rewrite_thm mode prover ss = Conv.fconv_rule (rewrite_cterm mode prover ss); 
10413  1253 

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

1254 
(*Rewrite the subgoals of a proof state (represented by a theorem)*) 
21708 