author  wenzelm 
Fri, 21 Oct 2005 18:14:46 +0200  
changeset 17966  34e420fa03ad 
parent 17897  1733b4680fde 
child 18208  dbdcf366db53 
permissions  rwrr 
10413  1 
(* Title: Pure/meta_simplifier.ML 
2 
ID: $Id$ 

11672  3 
Author: Tobias Nipkow and Stefan Berghofer 
10413  4 

11672  5 
Metalevel Simplification. 
10413  6 
*) 
7 

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

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

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

12 

11672  13 
signature BASIC_META_SIMPLIFIER = 
14 
sig 

15023  15 
val debug_simp: bool ref 
11672  16 
val trace_simp: bool ref 
13828  17 
val simp_depth_limit: int ref 
16042  18 
val trace_simp_depth_limit: int ref 
15023  19 
type rrule 
16807  20 
val eq_rrule: rrule * rrule > bool 
15023  21 
type cong 
22 
type simpset 

23 
type proc 

17614  24 
type solver 
25 
val mk_solver': string > (simpset > int > tactic) > solver 

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

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

27 
val rep_ss: simpset > 
15023  28 
{rules: rrule Net.net, 
29 
prems: thm list, 

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

30 
bounds: int * ((string * typ) * string) list, 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

31 
context: Context.proof option} * 
15023  32 
{congs: (string * cong) list * string list, 
33 
procs: proc Net.net, 

34 
mk_rews: 

35 
{mk: thm > thm list, 

36 
mk_cong: thm > thm, 

37 
mk_sym: thm > thm option, 

38 
mk_eq_True: thm > thm option}, 

39 
termless: term * term > bool, 

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

40 
subgoal_tac: simpset > int > tactic, 
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

41 
loop_tacs: (string * (simpset > int > tactic)) list, 
15023  42 
solvers: solver list * solver list} 
15006
107e4dfd3b96
Merging the metasimplifier with the Proverssimplifier. Next step:
skalberg
parents:
15001
diff
changeset

43 
val print_ss: simpset > unit 
15023  44 
val empty_ss: simpset 
45 
val merge_ss: simpset * simpset > simpset 

46 
type simproc 

47 
val mk_simproc: string > cterm list > 

16458  48 
(theory > simpset > term > thm option) > simproc 
15023  49 
val add_prems: thm list > simpset > simpset 
50 
val prems_of_ss: simpset > thm list 

51 
val addsimps: simpset * thm list > simpset 

52 
val delsimps: simpset * thm list > simpset 

53 
val addeqcongs: simpset * thm list > simpset 

54 
val deleqcongs: simpset * thm list > simpset 

55 
val addcongs: simpset * thm list > simpset 

56 
val delcongs: simpset * thm list > simpset 

57 
val addsimprocs: simpset * simproc list > simpset 

58 
val delsimprocs: simpset * simproc list > simpset 

59 
val setmksimps: simpset * (thm > thm list) > simpset 

60 
val setmkcong: simpset * (thm > thm) > simpset 

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

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

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

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

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

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

67 
val addloop': simpset * (string * (simpset > int > tactic)) > simpset 
15023  68 
val addloop: simpset * (string * (int > tactic)) > simpset 
69 
val delloop: simpset * string > simpset 

70 
val setSSolver: simpset * solver > simpset 

71 
val addSSolver: simpset * solver > simpset 

72 
val setSolver: simpset * solver > simpset 

73 
val addSolver: simpset * solver > simpset 

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

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

75 

10413  76 
signature META_SIMPLIFIER = 
77 
sig 

11672  78 
include BASIC_META_SIMPLIFIER 
10413  79 
exception SIMPLIFIER of string * thm 
17966
34e420fa03ad
moved various simplification tactics and rules to simplifier.ML;
wenzelm
parents:
17897
diff
changeset

80 
val solver: simpset > solver > int > tactic 
15023  81 
val clear_ss: simpset > simpset 
82 
exception SIMPROC_FAIL of string * exn 

16458  83 
val simproc_i: theory > string > term list 
84 
> (theory > simpset > term > thm option) > simproc 

85 
val simproc: theory > string > string list 

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

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

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

88 
val the_context: simpset > Context.proof 
17897  89 
val context: Context.proof > simpset > simpset 
90 
val theory_context: theory > simpset > simpset 

17723  91 
val debug_bounds: bool ref 
17966
34e420fa03ad
moved various simplification tactics and rules to simplifier.ML;
wenzelm
parents:
17897
diff
changeset

92 
val set_solvers: solver list > simpset > simpset 
11672  93 
val rewrite_cterm: bool * bool * bool > 
15023  94 
(simpset > thm > thm option) > simpset > cterm > thm 
95 
val rewrite_aux: (simpset > thm > thm option) > bool > thm list > cterm > thm 

96 
val simplify_aux: (simpset > thm > thm option) > bool > thm list > thm > thm 

16458  97 
val rewrite_term: theory > thm list > (term > term option) list > term > term 
15023  98 
val rewrite_thm: bool * bool * bool > 
99 
(simpset > thm > thm option) > simpset > thm > thm 

100 
val rewrite_goals_rule_aux: (simpset > thm > thm option) > thm list > thm > thm 

101 
val rewrite_goal_rule: bool * bool * bool > 

102 
(simpset > thm > thm option) > simpset > int > thm > thm 

10413  103 
end; 
104 

15023  105 
structure MetaSimplifier: META_SIMPLIFIER = 
10413  106 
struct 
107 

15023  108 

109 
(** datatype simpset **) 

110 

111 
(* rewrite rules *) 

10413  112 

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

113 
type rrule = {thm: thm, name: string, lhs: term, elhs: cterm, fo: bool, perm: bool}; 
15023  114 

115 
(*thm: the rewrite rule; 

116 
name: name of theorem from which rewrite rule was extracted; 

117 
lhs: the lefthand side; 

118 
elhs: the etaccontracted lhs; 

119 
fo: use firstorder matching; 

120 
perm: the rewrite rule is permutative; 

121 

12603  122 
Remarks: 
10413  123 
 elhs is used for matching, 
15023  124 
lhs only for preservation of bound variable names; 
10413  125 
 fo is set iff 
126 
either elhs is firstorder (no Var is applied), 

15023  127 
in which case fomatching is complete, 
10413  128 
or elhs is not a pattern, 
15023  129 
in which case there is nothing better to do;*) 
10413  130 

131 
fun eq_rrule ({thm = thm1, ...}: rrule, {thm = thm2, ...}: rrule) = 

15023  132 
Drule.eq_thm_prop (thm1, thm2); 
133 

134 

135 
(* congruences *) 

136 

137 
type cong = {thm: thm, lhs: cterm}; 

10413  138 

12603  139 
fun eq_cong ({thm = thm1, ...}: cong, {thm = thm2, ...}: cong) = 
15023  140 
Drule.eq_thm_prop (thm1, thm2); 
10413  141 

142 

17614  143 
(* simplification sets, procedures, and solvers *) 
15023  144 

145 
(*A simpset contains data required during conversion: 

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

148 
bounds: maximal index of bound variables already used 
15023  149 
(for generating new names when rewriting under lambda abstractions); 
10413  150 
congs: association list of congruence rules and 
151 
a list of `weak' congruence constants. 

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

153 
procs: discrimination net of simplification procedures 

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

15023  155 
mk_rews: 
156 
mk: turn simplification thms into rewrite rules; 

157 
mk_cong: prepare congruence rules; 

158 
mk_sym: turn == around; 

159 
mk_eq_True: turn P into P == True; 

160 
termless: relation for ordered rewriting;*) 

15011  161 

15023  162 
type mk_rews = 
163 
{mk: thm > thm list, 

164 
mk_cong: thm > thm, 

165 
mk_sym: thm > thm option, 

166 
mk_eq_True: thm > thm option}; 

167 

168 
datatype simpset = 

169 
Simpset of 

170 
{rules: rrule Net.net, 

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

172 
bounds: int * ((string * typ) * string) list, 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

173 
context: Context.proof option} * 
15023  174 
{congs: (string * cong) list * string list, 
175 
procs: proc Net.net, 

176 
mk_rews: mk_rews, 

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

179 
loop_tacs: (string * (simpset > int > tactic)) list, 
15023  180 
solvers: solver list * solver list} 
181 
and proc = 

182 
Proc of 

183 
{name: string, 

184 
lhs: cterm, 

16458  185 
proc: theory > simpset > term > thm option, 
17614  186 
id: stamp} 
187 
and solver = 

188 
Solver of 

189 
{name: string, 

190 
solver: simpset > int > tactic, 

15023  191 
id: stamp}; 
192 

193 

194 
fun rep_ss (Simpset args) = args; 

10413  195 

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

196 
fun make_ss1 (rules, prems, bounds, context) = 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

197 
{rules = rules, prems = prems, bounds = bounds, context = context}; 
15023  198 

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

199 
fun map_ss1 f {rules, prems, bounds, context} = 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

200 
make_ss1 (f (rules, prems, bounds, context)); 
10413  201 

15023  202 
fun make_ss2 (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) = 
203 
{congs = congs, procs = procs, mk_rews = mk_rews, termless = termless, 

204 
subgoal_tac = subgoal_tac, loop_tacs = loop_tacs, solvers = solvers}; 

205 

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

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

208 

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

10413  210 

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

211 
fun map_simpset f (Simpset ({rules, prems, bounds, context}, 
15023  212 
{congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers})) = 
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

213 
make_simpset (f ((rules, prems, bounds, context), 
15023  214 
(congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers))); 
10413  215 

15023  216 
fun map_simpset1 f (Simpset (r1, r2)) = Simpset (map_ss1 f r1, r2); 
217 
fun map_simpset2 f (Simpset (r1, r2)) = Simpset (r1, map_ss2 f r2); 

218 

17614  219 
fun prems_of_ss (Simpset ({prems, ...}, _)) = prems; 
220 

221 

222 
fun eq_proc (Proc {id = id1, ...}, Proc {id = id2, ...}) = (id1 = id2); 

223 

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

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

226 

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

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

228 
fun solver ss (Solver {solver = tac, ...}) = tac ss; 
17614  229 
fun eq_solver (Solver {id = id1, ...}, Solver {id = id2, ...}) = (id1 = id2); 
230 
val merge_solvers = gen_merge_lists eq_solver; 

231 

15023  232 

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

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

234 

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

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

236 

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

237 
val debug_simp = ref false; 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

238 
val trace_simp = ref false; 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

239 
val simp_depth = ref 0; 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

240 
val simp_depth_limit = ref 100; 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

241 
val trace_simp_depth_limit = ref 100; 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

242 

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

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

244 

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

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

246 
if ! simp_depth > ! trace_simp_depth_limit then () 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

247 
else tracing (enclose "[" "]" (string_of_int (! simp_depth)) ^ a); 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

248 

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

249 
fun prnt warn a = if warn then warning a else println a; 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

250 

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

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

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

253 
val used = Term.add_term_names (t, []); 
17614  254 
val xs = rev (Term.variantlist (rev (map #2 bs), used)); 
255 
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

256 
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

257 

17705  258 
in 
259 

260 
fun print_term warn a ss thy t = prnt warn (a ^ "\n" ^ 

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

261 
Sign.string_of_term thy (if ! debug_simp then t else show_bounds ss t)); 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

262 

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

263 
fun debug warn a = if ! debug_simp then prnt warn a else (); 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

264 
fun trace warn a = if ! trace_simp then prnt warn a else (); 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

265 

17705  266 
fun debug_term warn a ss thy t = if ! debug_simp then print_term warn a ss thy t else (); 
267 
fun trace_term warn a ss thy t = if ! trace_simp then print_term warn a ss thy t else (); 

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

268 

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

269 
fun trace_cterm warn a ss ct = 
17705  270 
if ! trace_simp then print_term warn a ss (Thm.theory_of_cterm ct) (Thm.term_of ct) else (); 
16985
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 
fun trace_thm a ss th = 
17705  273 
if ! trace_simp then print_term false a ss (Thm.theory_of_thm th) (Thm.full_prop_of th) else (); 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

274 

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

275 
fun trace_named_thm a ss (th, name) = 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

276 
if ! trace_simp then 
17705  277 
print_term false (if name = "" then a else a ^ " " ^ quote name ^ ":") ss 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

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

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

280 

17705  281 
fun warn_thm a ss th = print_term true a ss (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

282 

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

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

284 

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

285 

15023  286 
(* print simpsets *) 
10413  287 

15023  288 
fun print_ss ss = 
289 
let 

15034  290 
val pretty_thms = map Display.pretty_thm; 
15023  291 

15034  292 
fun pretty_cong (name, th) = 
293 
Pretty.block [Pretty.str (name ^ ":"), Pretty.brk 1, Display.pretty_thm th]; 

15023  294 
fun pretty_proc (name, lhss) = 
295 
Pretty.big_list (name ^ ":") (map Display.pretty_cterm lhss); 

15034  296 

297 
val Simpset ({rules, ...}, {congs, procs, loop_tacs, solvers, ...}) = ss; 

16807  298 
val smps = map #thm (Net.entries rules); 
15034  299 
val cngs = map (fn (name, {thm, ...}) => (name, thm)) (#1 congs); 
16807  300 
val prcs = Net.entries procs > 
301 
map (fn Proc {name, lhs, id, ...} => ((name, lhs), id)) 

17496  302 
> partition_eq (eq_snd (op =)) 
17756  303 
> map (fn ps => (fst (fst (hd ps)), map (snd o fst) ps)) 
304 
> Library.sort_wrt fst; 

15023  305 
in 
15034  306 
[Pretty.big_list "simplification rules:" (pretty_thms smps), 
307 
Pretty.big_list "simplification procedures:" (map pretty_proc prcs), 

308 
Pretty.big_list "congruences:" (map pretty_cong cngs), 

15088  309 
Pretty.strs ("loopers:" :: map (quote o #1) loop_tacs), 
310 
Pretty.strs ("unsafe solvers:" :: map (quote o solver_name) (#1 solvers)), 

311 
Pretty.strs ("safe solvers:" :: map (quote o solver_name) (#2 solvers))] 

15023  312 
> Pretty.chunks > Pretty.writeln 
13828  313 
end; 
10413  314 

15023  315 

316 
(* empty simpsets *) 

317 

318 
fun init_ss mk_rews termless subgoal_tac solvers = 

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

319 
make_simpset ((Net.empty, [], (0, []), NONE), 
15023  320 
(([], []), Net.empty, mk_rews, termless, subgoal_tac, [], solvers)); 
321 

322 
val basic_mk_rews: mk_rews = 

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

324 
mk_cong = I, 

15531  325 
mk_sym = SOME o Drule.symmetric_fun, 
326 
mk_eq_True = K NONE}; 

15023  327 

328 
val empty_ss = init_ss basic_mk_rews Term.termless (K (K no_tac)) ([], []); 

329 

330 

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

15011  332 

15023  333 
fun merge_ss (ss1, ss2) = 
334 
let 

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

335 
val Simpset ({rules = rules1, prems = prems1, bounds = bounds1, context = _}, 
15023  336 
{congs = (congs1, weak1), procs = procs1, mk_rews, termless, subgoal_tac, 
337 
loop_tacs = loop_tacs1, solvers = (unsafe_solvers1, solvers1)}) = ss1; 

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

338 
val Simpset ({rules = rules2, prems = prems2, bounds = bounds2, context = _}, 
15023  339 
{congs = (congs2, weak2), procs = procs2, mk_rews = _, termless = _, subgoal_tac = _, 
340 
loop_tacs = loop_tacs2, solvers = (unsafe_solvers2, solvers2)}) = ss2; 

15011  341 

16807  342 
val rules' = Net.merge eq_rrule (rules1, rules2); 
15023  343 
val prems' = gen_merge_lists Drule.eq_thm_prop prems1 prems2; 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

344 
val bounds' = if #1 bounds1 < #1 bounds2 then bounds2 else bounds1; 
15023  345 
val congs' = gen_merge_lists (eq_cong o pairself #2) congs1 congs2; 
346 
val weak' = merge_lists weak1 weak2; 

16807  347 
val procs' = Net.merge eq_proc (procs1, procs2); 
15023  348 
val loop_tacs' = merge_alists loop_tacs1 loop_tacs2; 
349 
val unsafe_solvers' = merge_solvers unsafe_solvers1 unsafe_solvers2; 

350 
val solvers' = merge_solvers solvers1 solvers2; 

351 
in 

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

352 
make_simpset ((rules', prems', bounds', NONE), ((congs', weak'), procs', 
15023  353 
mk_rews, termless, subgoal_tac, loop_tacs', (unsafe_solvers', solvers'))) 
354 
end; 

355 

356 

357 
(* simprocs *) 

358 

359 
exception SIMPROC_FAIL of string * exn; 

360 

361 
datatype simproc = Simproc of proc list; 

362 

363 
fun mk_simproc name lhss proc = 

364 
let val id = stamp () in 

365 
Simproc (lhss > map (fn lhs => 

366 
Proc {name = name, lhs = lhs, proc = proc, id = id})) 

367 
end; 

368 

16458  369 
fun simproc_i thy name = mk_simproc name o map (Thm.cterm_of thy o Logic.varify); 
16807  370 
fun simproc thy name = simproc_i thy name o map (Sign.read_term thy); 
15023  371 

15011  372 

10413  373 

374 
(** simpset operations **) 

375 

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

376 
(* context *) 
10413  377 

17614  378 
fun eq_bound (x: string, (y, _)) = x = y; 
379 

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

380 
fun add_bound bound = map_simpset1 (fn (rules, prems, (count, bounds), context) => 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

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

382 

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

383 
fun add_prems ths = map_simpset1 (fn (rules, prems, bounds, context) => 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

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

385 

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

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

387 
map_simpset1 (fn (rules, prems, _, _) => (rules, prems, bounds, context)); 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

388 

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

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

390 
 the_context _ = raise Fail "Simplifier: no proof context in simpset"; 
10413  391 

17897  392 
fun context ctxt = 
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

393 
map_simpset1 (fn (rules, prems, bounds, _) => (rules, prems, bounds, SOME ctxt)); 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

394 

17897  395 
val theory_context = context o Context.init_proof; 
396 

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

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

398 
 fallback_context thy ss = 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

399 
(warning "Simplifier: no proof context in simpset  fallback to theory context!"; 
17897  400 
theory_context thy ss); 
401 

402 

403 
(* clear_ss *) 

404 

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

406 
init_ss mk_rews termless subgoal_tac solvers 

407 
> inherit_context ss; 

15023  408 

10413  409 

15023  410 
(* addsimps *) 
10413  411 

15023  412 
fun mk_rrule2 {thm, name, lhs, elhs, perm} = 
413 
let 

414 
val fo = Pattern.first_order (term_of elhs) orelse not (Pattern.pattern (term_of elhs)) 

415 
in {thm = thm, name = name, lhs = lhs, elhs = elhs, fo = fo, perm = perm} end; 

10413  416 

15023  417 
fun insert_rrule quiet (ss, rrule as {thm, name, lhs, elhs, perm}) = 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

418 
(trace_named_thm "Adding rewrite rule" ss (thm, name); 
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

419 
ss > map_simpset1 (fn (rules, prems, bounds, context) => 
15023  420 
let 
421 
val rrule2 as {elhs, ...} = mk_rrule2 rrule; 

16807  422 
val rules' = Net.insert_term eq_rrule (term_of elhs, rrule2) rules; 
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

423 
in (rules', prems, bounds, context) end) 
15023  424 
handle Net.INSERT => 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

425 
(if quiet then () else warn_thm "Ignoring duplicate rewrite rule:" ss thm; ss)); 
10413  426 

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

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

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

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

431 

432 
fun var_perm (t, u) = 

433 
vperm (t, u) andalso eq_set (term_varnames t, term_varnames u); 

434 

435 
(* FIXME: it seems that the conditions on extra variables are too liberal if 

436 
prems are nonempty: does solving the prems really guarantee instantiation of 

437 
all its Vars? Better: a dynamic check each time a rule is applied. 

438 
*) 

439 
fun rewrite_rule_extra_vars prems elhs erhs = 

16861  440 
not (term_varnames erhs subset fold add_term_varnames prems (term_varnames elhs)) 
10413  441 
orelse 
15023  442 
not (term_tvars erhs subset (term_tvars elhs union List.concat (map term_tvars prems))); 
10413  443 

15023  444 
(*simple test for looping rewrite rules and stupid orientations*) 
16458  445 
fun reorient thy prems lhs rhs = 
15023  446 
rewrite_rule_extra_vars prems lhs rhs 
447 
orelse 

448 
is_Var (head_of lhs) 

449 
orelse 

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

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

453 
andalso not(exists_subterm is_Var lhs) 

454 
orelse 

455 
*) 

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

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

463 
is_Const lhs andalso not (is_Const rhs); 

10413  464 

465 
fun decomp_simp thm = 

15023  466 
let 
16458  467 
val {thy, prop, ...} = Thm.rep_thm thm; 
15023  468 
val prems = Logic.strip_imp_prems prop; 
469 
val concl = Drule.strip_imp_concl (Thm.cprop_of thm); 

470 
val (lhs, rhs) = Drule.dest_equals concl handle TERM _ => 

471 
raise SIMPLIFIER ("Rewrite rule not a metaequality", thm); 

472 
val (_, elhs) = Drule.dest_equals (Thm.cprop_of (Thm.eta_conversion lhs)); 

16665  473 
val elhs = if term_of elhs aconv term_of lhs then lhs else elhs; (*share identical copies*) 
15023  474 
val erhs = Pattern.eta_contract (term_of rhs); 
475 
val perm = 

476 
var_perm (term_of elhs, erhs) andalso 

477 
not (term_of elhs aconv erhs) andalso 

478 
not (is_Var (term_of elhs)); 

16458  479 
in (thy, prems, term_of lhs, elhs, term_of rhs, perm) end; 
10413  480 

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

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

484 
else (lhs, rhs) 
12783  485 
end; 
486 

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

15531  489 
NONE => [] 
490 
 SOME eq_True => 

15023  491 
let val (_, _, lhs, elhs, _, _) = decomp_simp eq_True 
492 
in [{thm = eq_True, name = name, lhs = lhs, elhs = elhs, perm = false}] end); 

10413  493 

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

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

497 
let val rrule = {thm = thm, name = name, lhs = lhs, elhs = elhs, perm = false} in 

498 
if term_varnames rhs subset term_varnames lhs andalso 

499 
term_tvars rhs subset term_tvars lhs then [rrule] 

500 
else mk_eq_True ss (thm2, name) @ [rrule] 

10413  501 
end; 
502 

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

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

506 
else 

507 
(*weak test for loops*) 

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

509 
then mk_eq_True ss (thm, name) 

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

10413  511 
end; 
512 

15023  513 
fun orient_rrule ss (thm, name) = 
16458  514 
let val (thy, prems, lhs, elhs, rhs, perm) = decomp_simp thm in 
15023  515 
if perm then [{thm = thm, name = name, lhs = lhs, elhs = elhs, perm = true}] 
16458  516 
else if reorient thy prems lhs rhs then 
517 
if reorient thy prems rhs lhs 

15023  518 
then mk_eq_True ss (thm, name) 
519 
else 

520 
let val Simpset (_, {mk_rews = {mk_sym, ...}, ...}) = ss in 

521 
(case mk_sym thm of 

15531  522 
NONE => [] 
523 
 SOME thm' => 

15023  524 
let val (_, _, lhs', elhs', rhs', _) = decomp_simp thm' 
525 
in rrule_eq_True (thm', name, lhs', elhs', rhs', ss, thm) end) 

526 
end 

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

10413  528 
end; 
529 

15199  530 
fun extract_rews (Simpset (_, {mk_rews = {mk, ...}, ...}), thms) = 
15570  531 
List.concat (map (fn thm => map (rpair (Thm.name_of_thm thm)) (mk thm)) thms); 
10413  532 

15023  533 
fun orient_comb_simps comb mk_rrule (ss, thms) = 
534 
let 

535 
val rews = extract_rews (ss, thms); 

15570  536 
val rrules = List.concat (map mk_rrule rews); 
537 
in Library.foldl comb (ss, rrules) end; 

10413  538 

15023  539 
fun extract_safe_rrules (ss, thm) = 
15570  540 
List.concat (map (orient_rrule ss) (extract_rews (ss, [thm]))); 
10413  541 

15023  542 
(*add rewrite rules explicitly; do not reorient!*) 
543 
fun ss addsimps thms = 

544 
orient_comb_simps (insert_rrule false) (mk_rrule ss) (ss, thms); 

10413  545 

546 

15023  547 
(* delsimps *) 
10413  548 

15023  549 
fun del_rrule (ss, rrule as {thm, elhs, ...}) = 
17882
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

550 
ss > map_simpset1 (fn (rules, prems, bounds, context) => 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

551 
(Net.delete_term eq_rrule (term_of elhs, rrule) rules, prems, bounds, context)) 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

552 
handle Net.DELETE => (warn_thm "Rewrite rule not in simpset:" ss thm; ss); 
10413  553 

15023  554 
fun ss delsimps thms = 
555 
orient_comb_simps del_rrule (map mk_rrule2 o mk_rrule ss) (ss, thms); 

556 

557 

558 
(* congs *) 

10413  559 

15531  560 
fun cong_name (Const (a, _)) = SOME a 
561 
 cong_name (Free (a, _)) = SOME ("Free: " ^ a) 

562 
 cong_name _ = NONE; 

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

563 

15023  564 
local 
565 

566 
fun is_full_cong_prems [] [] = true 

567 
 is_full_cong_prems [] _ = false 

568 
 is_full_cong_prems (p :: prems) varpairs = 

569 
(case Logic.strip_assums_concl p of 

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

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

572 
is_Var x andalso forall is_Bound xs andalso 

573 
null (findrep xs) andalso xs = ys andalso 

574 
(x, y) mem varpairs andalso 

575 
is_full_cong_prems prems (varpairs \ (x, y)) 

576 
end 

577 
 _ => false); 

578 

579 
fun is_full_cong thm = 

10413  580 
let 
15023  581 
val prems = prems_of thm and concl = concl_of thm; 
582 
val (lhs, rhs) = Logic.dest_equals concl; 

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

10413  584 
in 
15023  585 
f = g andalso null (findrep (xs @ ys)) andalso length xs = length ys andalso 
586 
is_full_cong_prems prems (xs ~~ ys) 

10413  587 
end; 
588 

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

591 
let 

592 
val (lhs, _) = Drule.dest_equals (Drule.strip_imp_concl (Thm.cprop_of thm)) 

593 
handle TERM _ => raise SIMPLIFIER ("Congruence not a metaequality", thm); 

594 
(*val lhs = Pattern.eta_contract lhs;*) 

15570  595 
val a = valOf (cong_name (head_of (term_of lhs))) handle Option => 
15023  596 
raise SIMPLIFIER ("Congruence must start with a constant or free variable", thm); 
597 
val (alist, weak) = congs; 

598 
val alist2 = overwrite_warn (alist, (a, {lhs = lhs, thm = thm})) 

599 
("Overwriting congruence rule for " ^ quote a); 

600 
val weak2 = if is_full_cong thm then weak else a :: weak; 

601 
in ((alist2, weak2), procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) end); 

10413  602 

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

605 
let 

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

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

608 
(*val lhs = Pattern.eta_contract lhs;*) 

15570  609 
val a = valOf (cong_name (head_of lhs)) handle Option => 
15023  610 
raise SIMPLIFIER ("Congruence must start with a constant", thm); 
611 
val (alist, _) = congs; 

15570  612 
val alist2 = List.filter (fn (x, _) => x <> a) alist; 
17756  613 
val weak2 = alist2 > List.mapPartial (fn (a, {thm, ...}: cong) => 
15531  614 
if is_full_cong thm then NONE else SOME a); 
15023  615 
in ((alist2, weak2), procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) end); 
10413  616 

15023  617 
fun mk_cong (Simpset (_, {mk_rews = {mk_cong = f, ...}, ...})) = f; 
618 

619 
in 

620 

15570  621 
val (op addeqcongs) = Library.foldl add_cong; 
622 
val (op deleqcongs) = Library.foldl del_cong; 

15023  623 

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

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

626 

627 
end; 

10413  628 

629 

15023  630 
(* simprocs *) 
631 

632 
local 

10413  633 

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

634 
fun add_proc (proc as Proc {name, lhs, ...}) ss = 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

635 
(trace_cterm false ("Adding simplification procedure " ^ quote name ^ " for") ss lhs; 
15023  636 
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) => 
16807  637 
(congs, Net.insert_term eq_proc (term_of lhs, proc) procs, 
15023  638 
mk_rews, termless, subgoal_tac, loop_tacs, solvers)) ss 
639 
handle Net.INSERT => 

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

10413  641 

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

642 
fun del_proc (proc as Proc {name, lhs, ...}) ss = 
15023  643 
map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) => 
16807  644 
(congs, Net.delete_term eq_proc (term_of lhs, proc) procs, 
15023  645 
mk_rews, termless, subgoal_tac, loop_tacs, solvers)) ss 
646 
handle Net.DELETE => 

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

10413  648 

15023  649 
in 
10413  650 

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

651 
fun ss addsimprocs ps = fold (fn Simproc procs => fold add_proc procs) ps ss; 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

652 
fun ss delsimprocs ps = fold (fn Simproc procs => fold del_proc procs) ps ss; 
10413  653 

15023  654 
end; 
10413  655 

656 

657 
(* mk_rews *) 

658 

15023  659 
local 
660 

15199  661 
fun map_mk_rews f = map_simpset2 (fn (congs, procs, {mk, mk_cong, mk_sym, mk_eq_True}, 
15023  662 
termless, subgoal_tac, loop_tacs, solvers) => 
15199  663 
let val (mk', mk_cong', mk_sym', mk_eq_True') = f (mk, mk_cong, mk_sym, mk_eq_True) in 
664 
(congs, procs, {mk = mk', mk_cong = mk_cong', mk_sym = mk_sym', mk_eq_True = mk_eq_True'}, 

15023  665 
termless, subgoal_tac, loop_tacs, solvers) 
666 
end); 

667 

668 
in 

10413  669 

15199  670 
fun ss setmksimps mk = ss > map_mk_rews (fn (_, mk_cong, mk_sym, mk_eq_True) => 
671 
(mk, mk_cong, mk_sym, mk_eq_True)); 

15023  672 

15199  673 
fun ss setmkcong mk_cong = ss > map_mk_rews (fn (mk, _, mk_sym, mk_eq_True) => 
674 
(mk, mk_cong, mk_sym, mk_eq_True)); 

10413  675 

15199  676 
fun ss setmksym mk_sym = ss > map_mk_rews (fn (mk, mk_cong, _, mk_eq_True) => 
677 
(mk, mk_cong, mk_sym, mk_eq_True)); 

10413  678 

15199  679 
fun ss setmkeqTrue mk_eq_True = ss > map_mk_rews (fn (mk, mk_cong, mk_sym, _) => 
680 
(mk, mk_cong, mk_sym, mk_eq_True)); 

15023  681 

682 
end; 

683 

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

684 

10413  685 
(* termless *) 
686 

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

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

690 

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

691 

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

693 

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

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

697 

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

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

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

701 

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

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

703 

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

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

707 
overwrite_warn (loop_tacs, (name, tac)) ("Overwriting looper " ^ quote name), 

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) => 

17756  714 
let val loop_tacs' = filter_out (equal name o fst) loop_tacs in 
15034  715 
if length loop_tacs <> length loop_tacs' then () 
716 
else warning ("No such looper in simpset: " ^ quote name); 

717 
(congs, procs, mk_rews, termless, subgoal_tac, loop_tacs', solvers) 

15023  718 
end); 
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, 

726 
subgoal_tac, loop_tacs, (unsafe_solvers, merge_solvers solvers [solver]))); 

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, 

734 
subgoal_tac, loop_tacs, (merge_solvers unsafe_solvers [solver], 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 

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

741 

10413  742 
(** rewriting **) 
743 

744 
(* 

745 
Uses conversions, see: 

746 
L C Paulson, A higherorder implementation of rewriting, 

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

748 
*) 

749 

15023  750 
val dest_eq = Drule.dest_equals o Thm.cprop_of; 
751 
val lhs_of = #1 o dest_eq; 

752 
val rhs_of = #2 o dest_eq; 

10413  753 

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

754 
fun check_conv msg ss thm thm' = 
10413  755 
let 
756 
val thm'' = transitive thm (transitive 

15001
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14981
diff
changeset

757 
(symmetric (Drule.beta_eta_conversion (lhs_of thm'))) thm') 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

758 
in if msg then trace_thm "SUCCEEDED" ss thm' else (); SOME thm'' end 
10413  759 
handle THM _ => 
16458  760 
let val {thy, prop = _ $ _ $ prop0, ...} = Thm.rep_thm thm in 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

761 
trace_thm "Proved wrong thm (Check subgoaler?)" ss thm'; 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

762 
trace_term false "Should have proved:" ss thy prop0; 
15531  763 
NONE 
10413  764 
end; 
765 

766 

767 
(* mk_procrule *) 

768 

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

769 
fun mk_procrule ss thm = 
15023  770 
let val (_, prems, lhs, elhs, rhs, _) = decomp_simp thm in 
771 
if rewrite_rule_extra_vars prems lhs rhs 

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

772 
then (warn_thm "Extra vars on rhs:" ss thm; []) 
15023  773 
else [mk_rrule2 {thm = thm, name = "", lhs = lhs, elhs = elhs, perm = false}] 
10413  774 
end; 
775 

776 

15023  777 
(* rewritec: conversion to apply the meta simpset to a term *) 
10413  778 

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

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

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

783 
already in normal form. 

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

785 

10413  786 
val skel0 = Bound 0; 
787 

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

790 
in the lhs.*) 

10413  791 

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

794 
else if exists_Const (fn (c, _) => c mem weak) lhs then skel0 

795 
else rhs; 

796 

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

798 
Otherwise those vars may become instantiated with unnormalized terms 

799 
while the premises are solved.*) 

800 

801 
fun cond_skel (args as (congs, (lhs, rhs))) = 

802 
if term_varnames rhs subset term_varnames lhs then uncond_skel args 

10413  803 
else skel0; 
804 

805 
(* 

15023  806 
Rewriting  we try in order: 
10413  807 
(1) beta reduction 
808 
(2) unconditional rewrite rules 

809 
(3) conditional rewrite rules 

810 
(4) simplification procedures 

811 

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

813 
*) 

814 

16458  815 
fun rewritec (prover, thyt, maxt) ss t = 
10413  816 
let 
15023  817 
val Simpset ({rules, ...}, {congs, procs, termless, ...}) = ss; 
10413  818 
val eta_thm = Thm.eta_conversion t; 
819 
val eta_t' = rhs_of eta_thm; 

820 
val eta_t = term_of eta_t'; 

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

821 
fun rew {thm, name, lhs, elhs, fo, perm} = 
10413  822 
let 
16458  823 
val {thy, prop, maxidx, ...} = rep_thm thm; 
10413  824 
val (rthm, elhs') = if maxt = ~1 then (thm, elhs) 
825 
else (Thm.incr_indexes (maxt+1) thm, Thm.cterm_incr_indexes (maxt+1) elhs); 

826 
val insts = if fo then Thm.cterm_first_order_match (elhs', eta_t') 

827 
else Thm.cterm_match (elhs', eta_t'); 

828 
val thm' = Thm.instantiate insts (Thm.rename_boundvars lhs eta_t rthm); 

14643  829 
val prop' = Thm.prop_of thm'; 
10413  830 
val unconditional = (Logic.count_prems (prop',0) = 0); 
831 
val (lhs', rhs') = Logic.dest_equals (Logic.strip_imp_concl prop') 

832 
in 

11295  833 
if perm andalso not (termless (rhs', lhs')) 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

834 
then (trace_named_thm "Cannot apply permutative rewrite rule" ss (thm, name); 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

835 
trace_thm "Term does not become smaller:" ss thm'; NONE) 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

836 
else (trace_named_thm "Applying instance of rewrite rule" ss (thm, name); 
10413  837 
if unconditional 
838 
then 

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

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

841 
val SOME thm'' = check_conv false ss eta_thm thm' 
15531  842 
in SOME (thm'', uncond_skel (congs, lr)) end) 
10413  843 
else 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

844 
(trace_thm "Trying to rewrite:" ss thm'; 
16042  845 
if !simp_depth > !simp_depth_limit 
846 
then let val s = "simp_depth_limit exceeded  giving up" 

847 
in trace false s; warning s; NONE end 

848 
else 

849 
case prover ss thm' of 

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

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

852 
(case check_conv true ss eta_thm thm2 of 
15531  853 
NONE => NONE  
854 
SOME thm2' => 

10413  855 
let val concl = Logic.strip_imp_concl prop 
856 
val lr = Logic.dest_equals concl 

16042  857 
in SOME (thm2', cond_skel (congs, lr)) end))) 
10413  858 
end 
859 

15531  860 
fun rews [] = NONE 
10413  861 
 rews (rrule :: rrules) = 
15531  862 
let val opt = rew rrule handle Pattern.MATCH => NONE 
863 
in case opt of NONE => rews rrules  some => some end; 

10413  864 

865 
fun sort_rrules rrs = let 

14643  866 
fun is_simple({thm, ...}:rrule) = case Thm.prop_of thm of 
10413  867 
Const("==",_) $ _ $ _ => true 
12603  868 
 _ => false 
10413  869 
fun sort [] (re1,re2) = re1 @ re2 
12603  870 
 sort (rr::rrs) (re1,re2) = if is_simple rr 
10413  871 
then sort rrs (rr::re1,re2) 
872 
else sort rrs (re1,rr::re2) 

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

874 

15531  875 
fun proc_rews [] = NONE 
15023  876 
 proc_rews (Proc {name, proc, lhs, ...} :: ps) = 
17203  877 
if Pattern.matches thyt (Thm.term_of lhs, Thm.term_of t) then 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

878 
(debug_term false ("Trying procedure " ^ quote name ^ " on:") ss thyt eta_t; 
13486
54464ea94d6f
exception SIMPROC_FAIL: solid error reporting of simprocs;
wenzelm
parents:
13458
diff
changeset

879 
case transform_failure (curry SIMPROC_FAIL name) 
16458  880 
(fn () => proc thyt ss eta_t) () of 
15531  881 
NONE => (debug false "FAILED"; proc_rews ps) 
882 
 SOME raw_thm => 

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

883 
(trace_thm ("Procedure " ^ quote name ^ " produced rewrite rule:") ss raw_thm; 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

884 
(case rews (mk_procrule ss raw_thm) of 
15531  885 
NONE => (trace_cterm true ("IGNORED result of simproc " ^ quote name ^ 
16985
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

886 
"  does not match") ss t; proc_rews ps) 
10413  887 
 some => some))) 
888 
else proc_rews ps; 

889 
in case eta_t of 

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

891 
(beta_conversion false eta_t'), skel0) 
10413  892 
 _ => (case rews (sort_rrules (Net.match_term rules eta_t)) of 
15531  893 
NONE => proc_rews (Net.match_term procs eta_t) 
10413  894 
 some => some) 
895 
end; 

896 

897 

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

899 

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

900 
fun congc prover ss maxt {thm=cong,lhs=lhs} t = 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

901 
let val rthm = Thm.incr_indexes (maxt+1) cong; 
10413  902 
val rlhs = fst (Drule.dest_equals (Drule.strip_imp_concl (cprop_of rthm))); 
903 
val insts = Thm.cterm_match (rlhs, t) 

904 
(* Pattern.match can raise Pattern.MATCH; 

905 
is handled when congc is called *) 

906 
val thm' = Thm.instantiate insts (Thm.rename_boundvars (term_of rlhs) (term_of t) rthm); 

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

907 
val unit = trace_thm "Applying congruence rule:" ss thm'; 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

908 
fun err (msg, thm) = (trace_thm msg ss thm; NONE) 
10413  909 
in case prover thm' of 
15531  910 
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

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

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

914 
if op aconv (pairself term_of (dest_equals (cprop_of thm2'))) 
15531  915 
then NONE else SOME thm2') 
10413  916 
end; 
917 

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

919 
apsnd dest_equals (dest_implies (hd (cprems_of Drule.imp_cong))); 

920 

15531  921 
fun transitive1 NONE NONE = NONE 
922 
 transitive1 (SOME thm1) NONE = SOME thm1 

923 
 transitive1 NONE (SOME thm2) = SOME thm2 

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

10413  925 

15531  926 
fun transitive2 thm = transitive1 (SOME thm); 
927 
fun transitive3 thm = transitive1 thm o SOME; 

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

928 

16458  929 
fun bottomc ((simprem, useprem, mutsimp), prover, thy, maxidx) = 
10413  930 
let 
15023  931 
fun botc skel ss t = 
15531  932 
if is_Var skel then NONE 
10413  933 
else 
15023  934 
(case subc skel ss t of 
15531  935 
some as SOME thm1 => 
16458  936 
(case rewritec (prover, thy, maxidx) ss (rhs_of thm1) of 
15531  937 
SOME (thm2, skel2) => 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

938 
transitive2 (transitive thm1 thm2) 
15023  939 
(botc skel2 ss (rhs_of thm2)) 
15531  940 
 NONE => some) 
941 
 NONE => 

16458  942 
(case rewritec (prover, thy, maxidx) ss t of 
15531  943 
SOME (thm2, skel2) => transitive2 thm2 
15023  944 
(botc skel2 ss (rhs_of thm2)) 
15531  945 
 NONE => NONE)) 
10413  946 

15023  947 
and try_botc ss t = 
948 
(case botc skel0 ss t of 

15531  949 
SOME trec1 => trec1  NONE => (reflexive t)) 
10413  950 

15023  951 
and subc skel (ss as Simpset ({bounds, ...}, {congs, ...})) t0 = 
10413  952 
(case term_of t0 of 
953 
Abs (a, T, t) => 

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

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

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

957 
val b' = #1 (Term.dest_Free (Thm.term_of v)); 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

958 
val _ = conditional (b <> b') (fn () => 
7df8abe926c3
improved bounds: nameless Term.bound, recover names for output;
wenzelm
parents:
16938
diff
changeset

959 
warning ("Simplifier: renamed bound variable " ^ quote b ^ " to " ^ quote b')); 
17614  960 
val ss' = add_bound ((b', T), a) ss; 
15023  961 
val skel' = case skel of Abs (_, _, sk) => sk  _ => skel0; 
962 
in case botc skel' ss' t' of 

15531  963 
SOME thm => SOME (abstract_rule a v thm) 
964 
 NONE => NONE 

10413  965 
end 
966 
 t $ _ => (case t of 

15023  967 
Const ("==>", _) $ _ => impc t0 ss 
10413  968 
 Abs _ => 
969 
let val thm = beta_conversion false t0 

15023  970 
in case subc skel0 ss (rhs_of thm) of 
15531  971 
NONE => SOME thm 
972 
 SOME thm' => SOME (transitive thm thm') 

10413  973 
end 
974 
 _ => 

975 
let fun appc () = 

976 
let 

977 
val (tskel, uskel) = case skel of 

978 
tskel $ uskel => (tskel, uskel) 

979 
 _ => (skel0, skel0); 

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

980 
val (ct, cu) = Thm.dest_comb t0 
10413  981 
in 
15023  982 
(case botc tskel ss ct of 
15531  983 
SOME thm1 => 
15023  984 
(case botc uskel ss cu of 
15531  985 
SOME thm2 => SOME (combination thm1 thm2) 
986 
 NONE => SOME (combination thm1 (reflexive cu))) 

987 
 NONE => 

15023  988 
(case botc uskel ss cu of 
15531  989 
SOME thm1 => SOME (combination (reflexive ct) thm1) 
990 
 NONE => NONE)) 

10413  991 
end 
992 
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

993 
in case cong_name h of 
15531  994 
SOME a => 
17232  995 
(case AList.lookup (op =) (fst congs) a of 
15531  996 
NONE => appc () 
997 
 SOME cong => 

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

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

1001 
val thm = congc (prover ss) ss maxidx cong t0; 
15570  1002 
val t = getOpt (Option.map rhs_of thm, t0); 
10767
8fa4aafa7314
Thm: dest_comb, dest_abs, capply, cabs no longer global;
wenzelm
parents:
10413
diff
changeset

1003 
val (cl, cr) = Thm.dest_comb t 
10413  1004 
val dVar = Var(("", 0), dummyT) 
1005 
val skel = 

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

15023  1007 
in case botc skel ss cl of 
15531  1008 
NONE => thm 
1009 
 SOME thm' => transitive3 thm 

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

1010 
(combination thm' (reflexive cr)) 
10413  1011 
end handle TERM _ => error "congc result" 
1012 
 Pattern.MATCH => appc ())) 

1013 
 _ => appc () 

1014 
end) 

15531  1015 
 _ => NONE) 
10413  1016 

15023  1017 
and impc ct ss = 
1018 
if mutsimp then mut_impc0 [] ct [] [] ss else nonmut_impc ct ss 

10413  1019 

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

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

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

1023 
"Cannot add premise as rewrite rule because it contains (type) unknowns:" ss prem; ([], NONE)) 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

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

1025 
let val asm = assume prem 
15531  1026 
in (extract_safe_rrules (ss, asm), SOME asm) end 
10413  1027 

15023  1028 
and add_rrules (rrss, asms) ss = 
15570  1029 
Library.foldl (insert_rrule true) (ss, List.concat rrss) > add_prems (List.mapPartial I asms) 
10413  1030 

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

1031 
and disch r (prem, eq) = 
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

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

1033 
val (lhs, rhs) = dest_eq eq; 
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

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

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

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

1037 
in if not r then eq' else 
10413  1038 
let 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1039 
val (prem', concl) = dest_implies lhs; 
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

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

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

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

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

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

1045 
Drule.swap_prems_eq) 
10413  1046 
end 
1047 
end 

1048 

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

1049 
and rebuild [] _ _ _ _ eq = eq 
15023  1050 
 rebuild (prem :: prems) concl (rrs :: rrss) (asm :: asms) ss eq = 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

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

1053 
val concl' = 
15570  1054 
Drule.mk_implies (prem, getOpt (Option.map rhs_of eq, concl)); 
1055 
val dprem = Option.map (curry (disch false) prem) 

16458  1056 
in case rewritec (prover, thy, maxidx) ss' concl' of 
15531  1057 
NONE => rebuild prems concl' rrss asms ss (dprem eq) 
15570  1058 
 SOME (eq', _) => transitive2 (Library.foldl (disch false o swap) 
1059 
(valOf (transitive3 (dprem eq) eq'), prems)) 

15023  1060 
(mut_impc0 (rev prems) (rhs_of eq') (rev rrss) (rev asms) ss) 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1061 
end 
15023  1062 

1063 
and mut_impc0 prems concl rrss asms ss = 

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

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

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

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

1069 
end 
15023  1070 

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

15570  1072 
transitive1 (Library.foldl (fn (eq2, (eq1, prem)) => transitive1 eq1 
1073 
(Option.map (curry (disch false) prem) eq2)) (NONE, eqns ~~ prems')) 

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

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

1075 
mut_impc (rev prems') concl (rev rrss') (rev asms') 
15023  1076 
[] [] [] [] ss ~1 changed 
1077 
else rebuild prems' concl rrss' asms' ss 

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

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

1079 

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

1080 
 mut_impc (prem :: prems) concl (rrs :: rrss) (asm :: asms) 
15023  1081 
prems' rrss' asms' eqns ss changed k = 
15531  1082 
case (if k = 0 then NONE else botc skel0 (add_rrules 
15023  1083 
(rev rrss' @ rrss, rev asms' @ asms) ss) prem) of 
15531  1084 
NONE => mut_impc prems concl rrss asms (prem :: prems') 
1085 
(rrs :: rrss') (asm :: asms') (NONE :: eqns) ss changed 

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

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

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

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

1090 
val tprems = map term_of prems; 
15570  1091 
val i = 1 + Library.foldl Int.max (~1, map (fn p => 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1092 
find_index_eq p tprems) (#hyps (rep_thm eqn))); 
15023  1093 
val (rrs', asm') = rules_of_prem ss prem' 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

1094 
in mut_impc prems concl rrss asms (prem' :: prems') 
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset

1095 
(rrs' :: rrss') (asm' :: asms') (SOME (foldr (disch true) 
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset

1096 
(Drule.imp_cong' eqn (reflexive (Drule.list_implies 
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset

1097 
(Library.drop (i, prems), concl)))) (Library.take (i, prems))) :: eqns) ss (length prems') ~1 
13607
6908230623a3
Completely reimplemented mutual simplification of premises.
berghofe
parents:
13569
diff
changeset

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

1099 

15023  1100 
(*legacy code  only for backwards compatibility*) 
1101 
and nonmut_impc ct ss = 

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

1102 
let val (prem, conc) = dest_implies ct; 
15531  1103 
val thm1 = if simprem then botc skel0 ss prem else NONE; 
15570  1104 
val prem1 = getOpt (Option.map rhs_of thm1, prem); 
15023  1105 
val ss1 = if not useprem then ss else add_rrules 
1106 
(apsnd single (apfst single (rules_of_prem ss prem1))) ss 

1107 
in (case botc skel0 ss1 conc of 

15531  1108 
NONE => (case thm1 of 
1109 
NONE => NONE 

1110 
 SOME thm1' => SOME (Drule.imp_cong' thm1' (reflexive conc))) 

1111 
 SOME thm2 => 

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

1112 
let val thm2' = disch false (prem1, thm2) 
10413  1113 
in (case thm1 of 
15531  1114 
NONE => SOME thm2' 
1115 
 SOME thm1' => 

1116 
SOME (transitive (Drule.imp_cong' thm1' (reflexive conc)) thm2')) 

10413  1117 
end) 
1118 
end 

1119 

15023  1120 
in try_botc end; 
10413  1121 

1122 

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

1125 
(* 

1126 
Parameters: 

1127 
mode = (simplify A, 

1128 
use A in simplifying B, 

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

1130 
when simplifying A ==> B 

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

1132 
*) 

1133 

17705  1134 
val debug_bounds = ref false; 
1135 

1136 
fun check_bounds ss ct = conditional (! debug_bounds) (fn () => 

17614  1137 
let 
1138 
val Simpset ({bounds = (_, bounds), ...}, _) = ss; 

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

1140 
if Term.is_bound x andalso not (AList.defined eq_bound bounds x) 

1141 
then insert (op =) x else I 

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

17705  1143 
in 
1144 
if null bs then () 

17723  1145 
else print_term true ("Simplifier: term contains loose bounds: " ^ commas_quote bs) ss 
17705  1146 
(Thm.theory_of_cterm ct) (Thm.term_of ct) 
1147 
end); 

17614  1148 

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

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

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

1151 
val {thy, t, maxidx, ...} = Thm.rep_cterm ct; 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

1152 
val ss = fallback_context thy raw_ss; 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

1153 
val _ = inc simp_depth; 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

1154 
val _ = conditional (!simp_depth mod 20 = 0) (fn () => 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

1155 
warning ("Simplification depth " ^ string_of_int (! simp_depth))); 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

1156 
val _ = trace_cterm false "SIMPLIFIER INVOKED ON THE FOLLOWING TERM:" ss ct; 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

1157 
val _ = check_bounds ss ct; 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

1158 
val res = bottomc (mode, Option.map Drule.flexflex_unique oo prover, thy, maxidx) ss ct 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

1159 
in dec simp_depth; res end 
b6e44fc46cf0
added set/addloop' for simpset dependent loopers;
wenzelm
parents:
17756
diff
changeset

1160 
handle exn => (dec simp_depth; raise exn); 
10413  1161 

11760  1162 
(*Rewrite a cterm*) 
17897  1163 
fun rewrite_aux _ _ [] ct = Thm.reflexive ct 
1164 
 rewrite_aux prover full thms ct = 

1165 
rewrite_cterm (full, false, false) prover 

1166 
(theory_context (Thm.theory_of_cterm ct) empty_ss addsimps thms) ct; 

11672  1167 

10413  1168 
(*Rewrite a theorem*) 
17897  1169 
fun simplify_aux _ _ [] th = th 
1170 
 simplify_aux prover full thms th = 

1171 
Drule.fconv_rule (rewrite_cterm (full, false, false) prover 

1172 
(theory_context (Thm.theory_of_thm th) empty_ss addsimps thms)) th; 

10413  1173 

15023  1174 
(*simple term rewriting  no proof*) 
16458  1175 
fun rewrite_term thy rules procs = 
17203  1176 
Pattern.rewrite_term thy (map decomp_simp' rules) procs; 
15023  1177 

1178 
fun rewrite_thm mode prover ss = Drule.fconv_rule (rewrite_cterm mode prover ss); 

10413  1179 

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

1181 
fun rewrite_goals_rule_aux _ [] th = th 

1182 
 rewrite_goals_rule_aux prover thms th = 

15001
fb2141a9f8c0
Moved conversion rules from MetaSimplifier to Drule. refl_implies removed
skalberg
parents:
14981
diff
changeset

1183 
Drule.fconv_rule (Drule.goals_conv (K true) (rewrite_cterm (true, true, false) prover 
17897  1184 
(theory_context (Thm.theory_of_thm th) empty_ss addsimps thms))) th; 
10413  1185 

15023  1186 
(*Rewrite the subgoal of a proof state (represented by a theorem)*) 
15011  1187 
fun rewrite_goal_rule mode prover ss i thm = 
10413  1188 
if 0 < i andalso i <= nprems_of thm 
15011  1189 
then Drule.fconv_rule (Drule.goals_conv (fn j => j=i) (rewrite_cterm mode prover ss)) thm 
10413  1190 
else raise THM("rewrite_goal_rule",i,[thm]); 
1191 

1192 
end; 

1193 

11672  1194 
structure BasicMetaSimplifier: BASIC_META_SIMPLIFIER = MetaSimplifier; 
1195 
open BasicMetaSimplifier; 