src/Pure/meta_simplifier.ML
author skalberg
Thu Mar 03 12:43:01 2005 +0100 (2005-03-03)
changeset 15570 8d8c70b41bab
parent 15531 08c8dad8e399
child 15574 b1d1b5bfc464
permissions -rw-r--r--
Move towards standard functions.
berghofe@10413
     1
(*  Title:      Pure/meta_simplifier.ML
berghofe@10413
     2
    ID:         $Id$
wenzelm@11672
     3
    Author:     Tobias Nipkow and Stefan Berghofer
berghofe@10413
     4
wenzelm@11672
     5
Meta-level Simplification.
berghofe@10413
     6
*)
berghofe@10413
     7
skalberg@15006
     8
infix 4
wenzelm@15023
     9
  addsimps delsimps addeqcongs deleqcongs addcongs delcongs addsimprocs delsimprocs
nipkow@15199
    10
  setmksimps setmkcong setmksym setmkeqTrue settermless setsubgoaler
wenzelm@15023
    11
  setloop addloop delloop setSSolver addSSolver setSolver addSolver;
skalberg@15006
    12
wenzelm@11672
    13
signature BASIC_META_SIMPLIFIER =
wenzelm@11672
    14
sig
wenzelm@15023
    15
  val debug_simp: bool ref
wenzelm@11672
    16
  val trace_simp: bool ref
nipkow@13828
    17
  val simp_depth_limit: int ref
wenzelm@15023
    18
  type rrule
wenzelm@15023
    19
  type cong
skalberg@15006
    20
  type solver
skalberg@15006
    21
  val mk_solver: string -> (thm list -> int -> tactic) -> solver
wenzelm@15023
    22
  type simpset
wenzelm@15023
    23
  type proc
skalberg@15006
    24
  val rep_ss: simpset ->
wenzelm@15023
    25
   {rules: rrule Net.net,
wenzelm@15023
    26
    prems: thm list,
berghofe@15249
    27
    bounds: int,
wenzelm@15023
    28
    depth: int} *
wenzelm@15023
    29
   {congs: (string * cong) list * string list,
wenzelm@15023
    30
    procs: proc Net.net,
wenzelm@15023
    31
    mk_rews:
wenzelm@15023
    32
     {mk: thm -> thm list,
wenzelm@15023
    33
      mk_cong: thm -> thm,
wenzelm@15023
    34
      mk_sym: thm -> thm option,
wenzelm@15023
    35
      mk_eq_True: thm -> thm option},
wenzelm@15023
    36
    termless: term * term -> bool,
skalberg@15006
    37
    subgoal_tac: simpset -> int -> tactic,
skalberg@15006
    38
    loop_tacs: (string * (int -> tactic)) list,
wenzelm@15023
    39
    solvers: solver list * solver list}
skalberg@15006
    40
  val print_ss: simpset -> unit
wenzelm@15023
    41
  val empty_ss: simpset
wenzelm@15023
    42
  val merge_ss: simpset * simpset -> simpset
wenzelm@15023
    43
  type simproc
wenzelm@15023
    44
  val mk_simproc: string -> cterm list ->
wenzelm@15023
    45
    (Sign.sg -> simpset -> term -> thm option) -> simproc
wenzelm@15023
    46
  val add_prems: thm list -> simpset -> simpset
wenzelm@15023
    47
  val prems_of_ss: simpset -> thm list
wenzelm@15023
    48
  val addsimps: simpset * thm list -> simpset
wenzelm@15023
    49
  val delsimps: simpset * thm list -> simpset
wenzelm@15023
    50
  val addeqcongs: simpset * thm list -> simpset
wenzelm@15023
    51
  val deleqcongs: simpset * thm list -> simpset
wenzelm@15023
    52
  val addcongs: simpset * thm list -> simpset
wenzelm@15023
    53
  val delcongs: simpset * thm list -> simpset
wenzelm@15023
    54
  val addsimprocs: simpset * simproc list -> simpset
wenzelm@15023
    55
  val delsimprocs: simpset * simproc list -> simpset
wenzelm@15023
    56
  val setmksimps: simpset * (thm -> thm list) -> simpset
wenzelm@15023
    57
  val setmkcong: simpset * (thm -> thm) -> simpset
wenzelm@15023
    58
  val setmksym: simpset * (thm -> thm option) -> simpset
wenzelm@15023
    59
  val setmkeqTrue: simpset * (thm -> thm option) -> simpset
wenzelm@15023
    60
  val settermless: simpset * (term * term -> bool) -> simpset
wenzelm@15023
    61
  val setsubgoaler: simpset * (simpset -> int -> tactic) -> simpset
wenzelm@15023
    62
  val setloop: simpset * (int -> tactic) -> simpset
wenzelm@15023
    63
  val addloop: simpset * (string * (int -> tactic)) -> simpset
wenzelm@15023
    64
  val delloop: simpset * string -> simpset
wenzelm@15023
    65
  val setSSolver: simpset * solver -> simpset
wenzelm@15023
    66
  val addSSolver: simpset * solver -> simpset
wenzelm@15023
    67
  val setSolver: simpset * solver -> simpset
wenzelm@15023
    68
  val addSolver: simpset * solver -> simpset
skalberg@15006
    69
  val generic_simp_tac: bool -> bool * bool * bool -> simpset -> int -> tactic
skalberg@15006
    70
end;
skalberg@15006
    71
berghofe@10413
    72
signature META_SIMPLIFIER =
berghofe@10413
    73
sig
wenzelm@11672
    74
  include BASIC_META_SIMPLIFIER
berghofe@10413
    75
  exception SIMPLIFIER of string * thm
wenzelm@15023
    76
  val clear_ss: simpset -> simpset
wenzelm@15023
    77
  exception SIMPROC_FAIL of string * exn
wenzelm@15023
    78
  val simproc_i: Sign.sg -> string -> term list
wenzelm@15023
    79
    -> (Sign.sg -> simpset -> term -> thm option) -> simproc
wenzelm@15023
    80
  val simproc: Sign.sg -> string -> string list
wenzelm@15023
    81
    -> (Sign.sg -> simpset -> term -> thm option) -> simproc
wenzelm@11672
    82
  val rewrite_cterm: bool * bool * bool ->
wenzelm@15023
    83
    (simpset -> thm -> thm option) -> simpset -> cterm -> thm
wenzelm@15023
    84
  val rewrite_aux: (simpset -> thm -> thm option) -> bool -> thm list -> cterm -> thm
wenzelm@15023
    85
  val simplify_aux: (simpset -> thm -> thm option) -> bool -> thm list -> thm -> thm
berghofe@13196
    86
  val rewrite_term: Sign.sg -> thm list -> (term -> term option) list -> term -> term
wenzelm@15023
    87
  val rewrite_thm: bool * bool * bool ->
wenzelm@15023
    88
    (simpset -> thm -> thm option) -> simpset -> thm -> thm
wenzelm@15023
    89
  val rewrite_goals_rule_aux: (simpset -> thm -> thm option) -> thm list -> thm -> thm
wenzelm@15023
    90
  val rewrite_goal_rule: bool * bool * bool ->
wenzelm@15023
    91
    (simpset -> thm -> thm option) -> simpset -> int -> thm -> thm
wenzelm@15023
    92
  val asm_rewrite_goal_tac: bool * bool * bool ->
wenzelm@15023
    93
    (simpset -> tactic) -> simpset -> int -> tactic
wenzelm@15023
    94
  val simp_thm: bool * bool * bool -> simpset -> thm -> thm
wenzelm@15023
    95
  val simp_cterm: bool * bool * bool -> simpset -> cterm -> thm
berghofe@10413
    96
end;
berghofe@10413
    97
wenzelm@15023
    98
structure MetaSimplifier: META_SIMPLIFIER =
berghofe@10413
    99
struct
berghofe@10413
   100
wenzelm@15023
   101
berghofe@10413
   102
(** diagnostics **)
berghofe@10413
   103
berghofe@10413
   104
exception SIMPLIFIER of string * thm;
berghofe@10413
   105
wenzelm@15023
   106
val debug_simp = ref false;
wenzelm@15023
   107
val trace_simp = ref false;
nipkow@11505
   108
val simp_depth = ref 0;
nipkow@13828
   109
val simp_depth_limit = ref 1000;
nipkow@11505
   110
wenzelm@12603
   111
local
wenzelm@12603
   112
wenzelm@12603
   113
fun println a =
wenzelm@15023
   114
  tracing (case ! simp_depth of 0 => a | n => enclose "[" "]" (string_of_int n) ^ a);
nipkow@11505
   115
nipkow@11505
   116
fun prnt warn a = if warn then warning a else println a;
wenzelm@15023
   117
fun prtm warn a sg t = prnt warn (a ^ "\n" ^ Sign.string_of_term sg t);
wenzelm@12603
   118
fun prctm warn a t = prnt warn (a ^ "\n" ^ Display.string_of_cterm t);
berghofe@10413
   119
wenzelm@12603
   120
in
berghofe@10413
   121
wenzelm@15023
   122
fun debug warn a = if ! debug_simp then prnt warn a else ();
wenzelm@15023
   123
fun trace warn a = if ! trace_simp then prnt warn a else ();
berghofe@10413
   124
wenzelm@15023
   125
fun debug_term warn a sign t = if ! debug_simp then prtm warn a sign t else ();
wenzelm@15023
   126
fun trace_term warn a sign t = if ! trace_simp then prtm warn a sign t else ();
wenzelm@15023
   127
fun trace_cterm warn a ct = if ! trace_simp then prctm warn a ct else ();
wenzelm@15023
   128
fun trace_thm a th = if ! trace_simp then prctm false a (Thm.cprop_of th) else ();
nipkow@13569
   129
berghofe@13607
   130
fun trace_named_thm a (thm, name) =
wenzelm@15023
   131
  if ! trace_simp then
wenzelm@15023
   132
    prctm false (if name = "" then a else a ^ " " ^ quote name ^ ":") (Thm.cprop_of thm)
wenzelm@15023
   133
  else ();
wenzelm@15023
   134
wenzelm@15023
   135
fun warn_thm a = prctm true a o Thm.cprop_of;
berghofe@10413
   136
wenzelm@12603
   137
end;
berghofe@10413
   138
berghofe@10413
   139
berghofe@10413
   140
wenzelm@15023
   141
(** datatype simpset **)
wenzelm@15023
   142
wenzelm@15023
   143
(* rewrite rules *)
berghofe@10413
   144
berghofe@13607
   145
type rrule = {thm: thm, name: string, lhs: term, elhs: cterm, fo: bool, perm: bool};
wenzelm@15023
   146
wenzelm@15023
   147
(*thm: the rewrite rule;
wenzelm@15023
   148
  name: name of theorem from which rewrite rule was extracted;
wenzelm@15023
   149
  lhs: the left-hand side;
wenzelm@15023
   150
  elhs: the etac-contracted lhs;
wenzelm@15023
   151
  fo: use first-order matching;
wenzelm@15023
   152
  perm: the rewrite rule is permutative;
wenzelm@15023
   153
wenzelm@12603
   154
Remarks:
berghofe@10413
   155
  - elhs is used for matching,
wenzelm@15023
   156
    lhs only for preservation of bound variable names;
berghofe@10413
   157
  - fo is set iff
berghofe@10413
   158
    either elhs is first-order (no Var is applied),
wenzelm@15023
   159
      in which case fo-matching is complete,
berghofe@10413
   160
    or elhs is not a pattern,
wenzelm@15023
   161
      in which case there is nothing better to do;*)
berghofe@10413
   162
berghofe@10413
   163
fun eq_rrule ({thm = thm1, ...}: rrule, {thm = thm2, ...}: rrule) =
wenzelm@15023
   164
  Drule.eq_thm_prop (thm1, thm2);
wenzelm@15023
   165
wenzelm@15023
   166
wenzelm@15023
   167
(* congruences *)
wenzelm@15023
   168
wenzelm@15023
   169
type cong = {thm: thm, lhs: cterm};
berghofe@10413
   170
wenzelm@12603
   171
fun eq_cong ({thm = thm1, ...}: cong, {thm = thm2, ...}: cong) =
wenzelm@15023
   172
  Drule.eq_thm_prop (thm1, thm2);
berghofe@10413
   173
berghofe@10413
   174
wenzelm@15023
   175
(* solvers *)
wenzelm@15023
   176
wenzelm@15023
   177
datatype solver =
wenzelm@15023
   178
  Solver of
wenzelm@15023
   179
   {name: string,
wenzelm@15023
   180
    solver: thm list -> int -> tactic,
wenzelm@15023
   181
    id: stamp};
wenzelm@15023
   182
wenzelm@15023
   183
fun mk_solver name solver = Solver {name = name, solver = solver, id = stamp ()};
wenzelm@15023
   184
wenzelm@15034
   185
fun solver_name (Solver {name, ...}) = name;
wenzelm@15023
   186
fun solver ths (Solver {solver = tacf, ...}) = tacf ths;
wenzelm@15023
   187
fun eq_solver (Solver {id = id1, ...}, Solver {id = id2, ...}) = (id1 = id2);
wenzelm@15023
   188
val merge_solvers = gen_merge_lists eq_solver;
wenzelm@15023
   189
wenzelm@15023
   190
wenzelm@15023
   191
(* simplification sets and procedures *)
wenzelm@15023
   192
wenzelm@15023
   193
(*A simpset contains data required during conversion:
berghofe@10413
   194
    rules: discrimination net of rewrite rules;
wenzelm@15023
   195
    prems: current premises;
berghofe@15249
   196
    bounds: maximal index of bound variables already used
wenzelm@15023
   197
      (for generating new names when rewriting under lambda abstractions);
wenzelm@15023
   198
    depth: depth of conditional rewriting;
berghofe@10413
   199
    congs: association list of congruence rules and
berghofe@10413
   200
           a list of `weak' congruence constants.
berghofe@10413
   201
           A congruence is `weak' if it avoids normalization of some argument.
berghofe@10413
   202
    procs: discrimination net of simplification procedures
berghofe@10413
   203
      (functions that prove rewrite rules on the fly);
wenzelm@15023
   204
    mk_rews:
wenzelm@15023
   205
      mk: turn simplification thms into rewrite rules;
wenzelm@15023
   206
      mk_cong: prepare congruence rules;
wenzelm@15023
   207
      mk_sym: turn == around;
wenzelm@15023
   208
      mk_eq_True: turn P into P == True;
wenzelm@15023
   209
    termless: relation for ordered rewriting;*)
skalberg@15011
   210
wenzelm@15023
   211
type mk_rews =
wenzelm@15023
   212
 {mk: thm -> thm list,
wenzelm@15023
   213
  mk_cong: thm -> thm,
wenzelm@15023
   214
  mk_sym: thm -> thm option,
wenzelm@15023
   215
  mk_eq_True: thm -> thm option};
wenzelm@15023
   216
wenzelm@15023
   217
datatype simpset =
wenzelm@15023
   218
  Simpset of
wenzelm@15023
   219
   {rules: rrule Net.net,
berghofe@10413
   220
    prems: thm list,
berghofe@15249
   221
    bounds: int,
wenzelm@15023
   222
    depth: int} *
wenzelm@15023
   223
   {congs: (string * cong) list * string list,
wenzelm@15023
   224
    procs: proc Net.net,
wenzelm@15023
   225
    mk_rews: mk_rews,
nipkow@11504
   226
    termless: term * term -> bool,
skalberg@15011
   227
    subgoal_tac: simpset -> int -> tactic,
skalberg@15011
   228
    loop_tacs: (string * (int -> tactic)) list,
wenzelm@15023
   229
    solvers: solver list * solver list}
wenzelm@15023
   230
and proc =
wenzelm@15023
   231
  Proc of
wenzelm@15023
   232
   {name: string,
wenzelm@15023
   233
    lhs: cterm,
wenzelm@15023
   234
    proc: Sign.sg -> simpset -> term -> thm option,
wenzelm@15023
   235
    id: stamp};
wenzelm@15023
   236
wenzelm@15023
   237
fun eq_proc (Proc {id = id1, ...}, Proc {id = id2, ...}) = (id1 = id2);
wenzelm@15023
   238
wenzelm@15023
   239
fun rep_ss (Simpset args) = args;
berghofe@10413
   240
wenzelm@15023
   241
fun make_ss1 (rules, prems, bounds, depth) =
wenzelm@15023
   242
  {rules = rules, prems = prems, bounds = bounds, depth = depth};
wenzelm@15023
   243
wenzelm@15023
   244
fun map_ss1 f {rules, prems, bounds, depth} =
wenzelm@15023
   245
  make_ss1 (f (rules, prems, bounds, depth));
berghofe@10413
   246
wenzelm@15023
   247
fun make_ss2 (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) =
wenzelm@15023
   248
  {congs = congs, procs = procs, mk_rews = mk_rews, termless = termless,
wenzelm@15023
   249
    subgoal_tac = subgoal_tac, loop_tacs = loop_tacs, solvers = solvers};
wenzelm@15023
   250
wenzelm@15023
   251
fun map_ss2 f {congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers} =
wenzelm@15023
   252
  make_ss2 (f (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers));
wenzelm@15023
   253
wenzelm@15023
   254
fun make_simpset (args1, args2) = Simpset (make_ss1 args1, make_ss2 args2);
berghofe@10413
   255
wenzelm@15023
   256
fun map_simpset f (Simpset ({rules, prems, bounds, depth},
wenzelm@15023
   257
    {congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers})) =
wenzelm@15023
   258
  make_simpset (f ((rules, prems, bounds, depth),
wenzelm@15023
   259
    (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers)));
berghofe@10413
   260
wenzelm@15023
   261
fun map_simpset1 f (Simpset (r1, r2)) = Simpset (map_ss1 f r1, r2);
wenzelm@15023
   262
fun map_simpset2 f (Simpset (r1, r2)) = Simpset (r1, map_ss2 f r2);
wenzelm@15023
   263
wenzelm@15023
   264
wenzelm@15023
   265
(* print simpsets *)
berghofe@10413
   266
wenzelm@15023
   267
fun print_ss ss =
wenzelm@15023
   268
  let
wenzelm@15034
   269
    val pretty_thms = map Display.pretty_thm;
wenzelm@15023
   270
wenzelm@15034
   271
    fun pretty_cong (name, th) =
wenzelm@15034
   272
      Pretty.block [Pretty.str (name ^ ":"), Pretty.brk 1, Display.pretty_thm th];
wenzelm@15023
   273
    fun pretty_proc (name, lhss) =
wenzelm@15023
   274
      Pretty.big_list (name ^ ":") (map Display.pretty_cterm lhss);
wenzelm@15034
   275
wenzelm@15034
   276
    val Simpset ({rules, ...}, {congs, procs, loop_tacs, solvers, ...}) = ss;
wenzelm@15034
   277
    val smps = map (#thm o #2) (Net.dest rules);
wenzelm@15034
   278
    val cngs = map (fn (name, {thm, ...}) => (name, thm)) (#1 congs);
wenzelm@15034
   279
    val prcs = Net.dest procs |>
wenzelm@15034
   280
      map (fn (_, Proc {name, lhs, id, ...}) => ((name, lhs), id))
wenzelm@15034
   281
      |> partition_eq eq_snd
wenzelm@15034
   282
      |> map (fn ps => (#1 (#1 (hd ps)), map (#2 o #1) ps))
wenzelm@15034
   283
      |> Library.sort_wrt #1;
wenzelm@15023
   284
  in
wenzelm@15034
   285
    [Pretty.big_list "simplification rules:" (pretty_thms smps),
wenzelm@15034
   286
      Pretty.big_list "simplification procedures:" (map pretty_proc prcs),
wenzelm@15034
   287
      Pretty.big_list "congruences:" (map pretty_cong cngs),
wenzelm@15088
   288
      Pretty.strs ("loopers:" :: map (quote o #1) loop_tacs),
wenzelm@15088
   289
      Pretty.strs ("unsafe solvers:" :: map (quote o solver_name) (#1 solvers)),
wenzelm@15088
   290
      Pretty.strs ("safe solvers:" :: map (quote o solver_name) (#2 solvers))]
wenzelm@15023
   291
    |> Pretty.chunks |> Pretty.writeln
nipkow@13828
   292
  end;
berghofe@10413
   293
wenzelm@15023
   294
wenzelm@15023
   295
(* empty simpsets *)
wenzelm@15023
   296
wenzelm@15023
   297
local
wenzelm@15023
   298
wenzelm@15023
   299
fun init_ss mk_rews termless subgoal_tac solvers =
berghofe@15249
   300
  make_simpset ((Net.empty, [], 0, 0),
wenzelm@15023
   301
    (([], []), Net.empty, mk_rews, termless, subgoal_tac, [], solvers));
wenzelm@15023
   302
wenzelm@15023
   303
val basic_mk_rews: mk_rews =
wenzelm@15023
   304
 {mk = fn th => if can Logic.dest_equals (Thm.concl_of th) then [th] else [],
wenzelm@15023
   305
  mk_cong = I,
skalberg@15531
   306
  mk_sym = SOME o Drule.symmetric_fun,
skalberg@15531
   307
  mk_eq_True = K NONE};
wenzelm@15023
   308
wenzelm@15023
   309
in
wenzelm@15023
   310
wenzelm@15023
   311
val empty_ss = init_ss basic_mk_rews Term.termless (K (K no_tac)) ([], []);
wenzelm@15023
   312
wenzelm@15023
   313
fun clear_ss (Simpset (_, {mk_rews, termless, subgoal_tac, solvers, ...})) =
wenzelm@15023
   314
  init_ss mk_rews termless subgoal_tac solvers;
wenzelm@15023
   315
wenzelm@15023
   316
end;
wenzelm@15023
   317
wenzelm@15023
   318
wenzelm@15023
   319
(* merge simpsets *)            (*NOTE: ignores some fields of 2nd simpset*)
skalberg@15011
   320
wenzelm@15023
   321
fun merge_ss (ss1, ss2) =
wenzelm@15023
   322
  let
wenzelm@15023
   323
    val Simpset ({rules = rules1, prems = prems1, bounds = bounds1, depth},
wenzelm@15023
   324
     {congs = (congs1, weak1), procs = procs1, mk_rews, termless, subgoal_tac,
wenzelm@15023
   325
      loop_tacs = loop_tacs1, solvers = (unsafe_solvers1, solvers1)}) = ss1;
wenzelm@15023
   326
    val Simpset ({rules = rules2, prems = prems2, bounds = bounds2, depth = _},
wenzelm@15023
   327
     {congs = (congs2, weak2), procs = procs2, mk_rews = _, termless = _, subgoal_tac = _,
wenzelm@15023
   328
      loop_tacs = loop_tacs2, solvers = (unsafe_solvers2, solvers2)}) = ss2;
skalberg@15011
   329
wenzelm@15023
   330
    val rules' = Net.merge (rules1, rules2, eq_rrule);
wenzelm@15023
   331
    val prems' = gen_merge_lists Drule.eq_thm_prop prems1 prems2;
berghofe@15249
   332
    val bounds' = Int.max (bounds1, bounds2);
wenzelm@15023
   333
    val congs' = gen_merge_lists (eq_cong o pairself #2) congs1 congs2;
wenzelm@15023
   334
    val weak' = merge_lists weak1 weak2;
wenzelm@15023
   335
    val procs' = Net.merge (procs1, procs2, eq_proc);
wenzelm@15023
   336
    val loop_tacs' = merge_alists loop_tacs1 loop_tacs2;
wenzelm@15023
   337
    val unsafe_solvers' = merge_solvers unsafe_solvers1 unsafe_solvers2;
wenzelm@15023
   338
    val solvers' = merge_solvers solvers1 solvers2;
wenzelm@15023
   339
  in
wenzelm@15023
   340
    make_simpset ((rules', prems', bounds', depth), ((congs', weak'), procs',
wenzelm@15023
   341
      mk_rews, termless, subgoal_tac, loop_tacs', (unsafe_solvers', solvers')))
wenzelm@15023
   342
  end;
wenzelm@15023
   343
wenzelm@15023
   344
wenzelm@15023
   345
(* simprocs *)
wenzelm@15023
   346
wenzelm@15023
   347
exception SIMPROC_FAIL of string * exn;
wenzelm@15023
   348
wenzelm@15023
   349
datatype simproc = Simproc of proc list;
wenzelm@15023
   350
wenzelm@15023
   351
fun mk_simproc name lhss proc =
wenzelm@15023
   352
  let val id = stamp () in
wenzelm@15023
   353
    Simproc (lhss |> map (fn lhs =>
wenzelm@15023
   354
      Proc {name = name, lhs = lhs, proc = proc, id = id}))
wenzelm@15023
   355
  end;
wenzelm@15023
   356
wenzelm@15023
   357
fun simproc_i sg name = mk_simproc name o map (Thm.cterm_of sg o Logic.varify);
wenzelm@15023
   358
fun simproc sg name = simproc_i sg name o map (Sign.simple_read_term sg TypeInfer.logicT);
wenzelm@15023
   359
skalberg@15011
   360
berghofe@10413
   361
berghofe@10413
   362
(** simpset operations **)
berghofe@10413
   363
wenzelm@15023
   364
(* bounds and prems *)
berghofe@10413
   365
berghofe@15249
   366
val incr_bounds = map_simpset1 (fn (rules, prems, bounds, depth) =>
berghofe@15249
   367
  (rules, prems, bounds + 1, depth));
berghofe@10413
   368
wenzelm@15023
   369
fun add_prems ths = map_simpset1 (fn (rules, prems, bounds, depth) =>
wenzelm@15023
   370
  (rules, ths @ prems, bounds, depth));
wenzelm@15023
   371
wenzelm@15023
   372
fun prems_of_ss (Simpset ({prems, ...}, _)) = prems;
berghofe@10413
   373
berghofe@10413
   374
wenzelm@15023
   375
(* addsimps *)
berghofe@10413
   376
wenzelm@15023
   377
fun mk_rrule2 {thm, name, lhs, elhs, perm} =
wenzelm@15023
   378
  let
wenzelm@15023
   379
    val fo = Pattern.first_order (term_of elhs) orelse not (Pattern.pattern (term_of elhs))
wenzelm@15023
   380
  in {thm = thm, name = name, lhs = lhs, elhs = elhs, fo = fo, perm = perm} end;
berghofe@10413
   381
wenzelm@15023
   382
fun insert_rrule quiet (ss, rrule as {thm, name, lhs, elhs, perm}) =
wenzelm@15023
   383
 (trace_named_thm "Adding rewrite rule" (thm, name);
wenzelm@15023
   384
  ss |> map_simpset1 (fn (rules, prems, bounds, depth) =>
wenzelm@15023
   385
    let
wenzelm@15023
   386
      val rrule2 as {elhs, ...} = mk_rrule2 rrule;
wenzelm@15023
   387
      val rules' = Net.insert_term ((term_of elhs, rrule2), rules, eq_rrule);
wenzelm@15023
   388
    in (rules', prems, bounds, depth) end)
wenzelm@15023
   389
  handle Net.INSERT =>
wenzelm@15023
   390
    (if quiet then () else warn_thm "Ignoring duplicate rewrite rule:" thm; ss));
berghofe@10413
   391
berghofe@10413
   392
fun vperm (Var _, Var _) = true
berghofe@10413
   393
  | vperm (Abs (_, _, s), Abs (_, _, t)) = vperm (s, t)
berghofe@10413
   394
  | vperm (t1 $ t2, u1 $ u2) = vperm (t1, u1) andalso vperm (t2, u2)
berghofe@10413
   395
  | vperm (t, u) = (t = u);
berghofe@10413
   396
berghofe@10413
   397
fun var_perm (t, u) =
berghofe@10413
   398
  vperm (t, u) andalso eq_set (term_varnames t, term_varnames u);
berghofe@10413
   399
berghofe@10413
   400
(* FIXME: it seems that the conditions on extra variables are too liberal if
berghofe@10413
   401
prems are nonempty: does solving the prems really guarantee instantiation of
berghofe@10413
   402
all its Vars? Better: a dynamic check each time a rule is applied.
berghofe@10413
   403
*)
berghofe@10413
   404
fun rewrite_rule_extra_vars prems elhs erhs =
skalberg@15570
   405
  not (term_varnames erhs subset Library.foldl add_term_varnames (term_varnames elhs, prems))
berghofe@10413
   406
  orelse
wenzelm@15023
   407
  not (term_tvars erhs subset (term_tvars elhs union List.concat (map term_tvars prems)));
berghofe@10413
   408
wenzelm@15023
   409
(*simple test for looping rewrite rules and stupid orientations*)
berghofe@10413
   410
fun reorient sign prems lhs rhs =
wenzelm@15023
   411
  rewrite_rule_extra_vars prems lhs rhs
wenzelm@15023
   412
    orelse
wenzelm@15023
   413
  is_Var (head_of lhs)
wenzelm@15023
   414
    orelse
wenzelm@15023
   415
  exists (apl (lhs, Logic.occs)) (rhs :: prems)
wenzelm@15023
   416
    orelse
wenzelm@15023
   417
  null prems andalso Pattern.matches (Sign.tsig_of sign) (lhs, rhs)
berghofe@10413
   418
    (*the condition "null prems" is necessary because conditional rewrites
berghofe@10413
   419
      with extra variables in the conditions may terminate although
wenzelm@15023
   420
      the rhs is an instance of the lhs; example: ?m < ?n ==> f(?n) == f(?m)*)
wenzelm@15023
   421
    orelse
wenzelm@15023
   422
  is_Const lhs andalso not (is_Const rhs);
berghofe@10413
   423
berghofe@10413
   424
fun decomp_simp thm =
wenzelm@15023
   425
  let
wenzelm@15023
   426
    val {sign, prop, ...} = Thm.rep_thm thm;
wenzelm@15023
   427
    val prems = Logic.strip_imp_prems prop;
wenzelm@15023
   428
    val concl = Drule.strip_imp_concl (Thm.cprop_of thm);
wenzelm@15023
   429
    val (lhs, rhs) = Drule.dest_equals concl handle TERM _ =>
wenzelm@15023
   430
      raise SIMPLIFIER ("Rewrite rule not a meta-equality", thm);
wenzelm@15023
   431
    val (_, elhs) = Drule.dest_equals (Thm.cprop_of (Thm.eta_conversion lhs));
wenzelm@15023
   432
    val elhs = if elhs = lhs then lhs else elhs;  (*share identical copies*)
wenzelm@15023
   433
    val erhs = Pattern.eta_contract (term_of rhs);
wenzelm@15023
   434
    val perm =
wenzelm@15023
   435
      var_perm (term_of elhs, erhs) andalso
wenzelm@15023
   436
      not (term_of elhs aconv erhs) andalso
wenzelm@15023
   437
      not (is_Var (term_of elhs));
berghofe@10413
   438
  in (sign, prems, term_of lhs, elhs, term_of rhs, perm) end;
berghofe@10413
   439
wenzelm@12783
   440
fun decomp_simp' thm =
wenzelm@12979
   441
  let val (_, _, lhs, _, rhs, _) = decomp_simp thm in
wenzelm@12783
   442
    if Thm.nprems_of thm > 0 then raise SIMPLIFIER ("Bad conditional rewrite rule", thm)
wenzelm@12979
   443
    else (lhs, rhs)
wenzelm@12783
   444
  end;
wenzelm@12783
   445
wenzelm@15023
   446
fun mk_eq_True (Simpset (_, {mk_rews = {mk_eq_True, ...}, ...})) (thm, name) =
wenzelm@15023
   447
  (case mk_eq_True thm of
skalberg@15531
   448
    NONE => []
skalberg@15531
   449
  | SOME eq_True =>
wenzelm@15023
   450
      let val (_, _, lhs, elhs, _, _) = decomp_simp eq_True
wenzelm@15023
   451
      in [{thm = eq_True, name = name, lhs = lhs, elhs = elhs, perm = false}] end);
berghofe@10413
   452
wenzelm@15023
   453
(*create the rewrite rule and possibly also the eq_True variant,
wenzelm@15023
   454
  in case there are extra vars on the rhs*)
wenzelm@15023
   455
fun rrule_eq_True (thm, name, lhs, elhs, rhs, ss, thm2) =
wenzelm@15023
   456
  let val rrule = {thm = thm, name = name, lhs = lhs, elhs = elhs, perm = false} in
wenzelm@15023
   457
    if term_varnames rhs subset term_varnames lhs andalso
wenzelm@15023
   458
      term_tvars rhs subset term_tvars lhs then [rrule]
wenzelm@15023
   459
    else mk_eq_True ss (thm2, name) @ [rrule]
berghofe@10413
   460
  end;
berghofe@10413
   461
wenzelm@15023
   462
fun mk_rrule ss (thm, name) =
wenzelm@15023
   463
  let val (_, prems, lhs, elhs, rhs, perm) = decomp_simp thm in
wenzelm@15023
   464
    if perm then [{thm = thm, name = name, lhs = lhs, elhs = elhs, perm = true}]
wenzelm@15023
   465
    else
wenzelm@15023
   466
      (*weak test for loops*)
wenzelm@15023
   467
      if rewrite_rule_extra_vars prems lhs rhs orelse is_Var (term_of elhs)
wenzelm@15023
   468
      then mk_eq_True ss (thm, name)
wenzelm@15023
   469
      else rrule_eq_True (thm, name, lhs, elhs, rhs, ss, thm)
berghofe@10413
   470
  end;
berghofe@10413
   471
wenzelm@15023
   472
fun orient_rrule ss (thm, name) =
wenzelm@15023
   473
  let val (sign, prems, lhs, elhs, rhs, perm) = decomp_simp thm in
wenzelm@15023
   474
    if perm then [{thm = thm, name = name, lhs = lhs, elhs = elhs, perm = true}]
wenzelm@15023
   475
    else if reorient sign prems lhs rhs then
wenzelm@15023
   476
      if reorient sign prems rhs lhs
wenzelm@15023
   477
      then mk_eq_True ss (thm, name)
wenzelm@15023
   478
      else
wenzelm@15023
   479
        let val Simpset (_, {mk_rews = {mk_sym, ...}, ...}) = ss in
wenzelm@15023
   480
          (case mk_sym thm of
skalberg@15531
   481
            NONE => []
skalberg@15531
   482
          | SOME thm' =>
wenzelm@15023
   483
              let val (_, _, lhs', elhs', rhs', _) = decomp_simp thm'
wenzelm@15023
   484
              in rrule_eq_True (thm', name, lhs', elhs', rhs', ss, thm) end)
wenzelm@15023
   485
        end
wenzelm@15023
   486
    else rrule_eq_True (thm, name, lhs, elhs, rhs, ss, thm)
berghofe@10413
   487
  end;
berghofe@10413
   488
nipkow@15199
   489
fun extract_rews (Simpset (_, {mk_rews = {mk, ...}, ...}), thms) =
skalberg@15570
   490
  List.concat (map (fn thm => map (rpair (Thm.name_of_thm thm)) (mk thm)) thms);
berghofe@10413
   491
wenzelm@15023
   492
fun orient_comb_simps comb mk_rrule (ss, thms) =
wenzelm@15023
   493
  let
wenzelm@15023
   494
    val rews = extract_rews (ss, thms);
skalberg@15570
   495
    val rrules = List.concat (map mk_rrule rews);
skalberg@15570
   496
  in Library.foldl comb (ss, rrules) end;
berghofe@10413
   497
wenzelm@15023
   498
fun extract_safe_rrules (ss, thm) =
skalberg@15570
   499
  List.concat (map (orient_rrule ss) (extract_rews (ss, [thm])));
berghofe@10413
   500
wenzelm@15023
   501
(*add rewrite rules explicitly; do not reorient!*)
wenzelm@15023
   502
fun ss addsimps thms =
wenzelm@15023
   503
  orient_comb_simps (insert_rrule false) (mk_rrule ss) (ss, thms);
berghofe@10413
   504
berghofe@10413
   505
wenzelm@15023
   506
(* delsimps *)
berghofe@10413
   507
wenzelm@15023
   508
fun del_rrule (ss, rrule as {thm, elhs, ...}) =
wenzelm@15023
   509
  ss |> map_simpset1 (fn (rules, prems, bounds, depth) =>
wenzelm@15023
   510
    (Net.delete_term ((term_of elhs, rrule), rules, eq_rrule), prems, bounds, depth))
wenzelm@15023
   511
  handle Net.DELETE => (warn_thm "Rewrite rule not in simpset:" thm; ss);
berghofe@10413
   512
wenzelm@15023
   513
fun ss delsimps thms =
wenzelm@15023
   514
  orient_comb_simps del_rrule (map mk_rrule2 o mk_rrule ss) (ss, thms);
wenzelm@15023
   515
wenzelm@15023
   516
wenzelm@15023
   517
(* congs *)
berghofe@10413
   518
skalberg@15531
   519
fun cong_name (Const (a, _)) = SOME a
skalberg@15531
   520
  | cong_name (Free (a, _)) = SOME ("Free: " ^ a)
skalberg@15531
   521
  | cong_name _ = NONE;
ballarin@13835
   522
wenzelm@15023
   523
local
wenzelm@15023
   524
wenzelm@15023
   525
fun is_full_cong_prems [] [] = true
wenzelm@15023
   526
  | is_full_cong_prems [] _ = false
wenzelm@15023
   527
  | is_full_cong_prems (p :: prems) varpairs =
wenzelm@15023
   528
      (case Logic.strip_assums_concl p of
wenzelm@15023
   529
        Const ("==", _) $ lhs $ rhs =>
wenzelm@15023
   530
          let val (x, xs) = strip_comb lhs and (y, ys) = strip_comb rhs in
wenzelm@15023
   531
            is_Var x andalso forall is_Bound xs andalso
wenzelm@15023
   532
            null (findrep xs) andalso xs = ys andalso
wenzelm@15023
   533
            (x, y) mem varpairs andalso
wenzelm@15023
   534
            is_full_cong_prems prems (varpairs \ (x, y))
wenzelm@15023
   535
          end
wenzelm@15023
   536
      | _ => false);
wenzelm@15023
   537
wenzelm@15023
   538
fun is_full_cong thm =
berghofe@10413
   539
  let
wenzelm@15023
   540
    val prems = prems_of thm and concl = concl_of thm;
wenzelm@15023
   541
    val (lhs, rhs) = Logic.dest_equals concl;
wenzelm@15023
   542
    val (f, xs) = strip_comb lhs and (g, ys) = strip_comb rhs;
berghofe@10413
   543
  in
wenzelm@15023
   544
    f = g andalso null (findrep (xs @ ys)) andalso length xs = length ys andalso
wenzelm@15023
   545
    is_full_cong_prems prems (xs ~~ ys)
berghofe@10413
   546
  end;
berghofe@10413
   547
wenzelm@15023
   548
fun add_cong (ss, thm) = ss |>
wenzelm@15023
   549
  map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) =>
wenzelm@15023
   550
    let
wenzelm@15023
   551
      val (lhs, _) = Drule.dest_equals (Drule.strip_imp_concl (Thm.cprop_of thm))
wenzelm@15023
   552
        handle TERM _ => raise SIMPLIFIER ("Congruence not a meta-equality", thm);
wenzelm@15023
   553
    (*val lhs = Pattern.eta_contract lhs;*)
skalberg@15570
   554
      val a = valOf (cong_name (head_of (term_of lhs))) handle Option =>
wenzelm@15023
   555
        raise SIMPLIFIER ("Congruence must start with a constant or free variable", thm);
wenzelm@15023
   556
      val (alist, weak) = congs;
wenzelm@15023
   557
      val alist2 = overwrite_warn (alist, (a, {lhs = lhs, thm = thm}))
wenzelm@15023
   558
        ("Overwriting congruence rule for " ^ quote a);
wenzelm@15023
   559
      val weak2 = if is_full_cong thm then weak else a :: weak;
wenzelm@15023
   560
    in ((alist2, weak2), procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) end);
berghofe@10413
   561
wenzelm@15023
   562
fun del_cong (ss, thm) = ss |>
wenzelm@15023
   563
  map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) =>
wenzelm@15023
   564
    let
wenzelm@15023
   565
      val (lhs, _) = Logic.dest_equals (Thm.concl_of thm) handle TERM _ =>
wenzelm@15023
   566
        raise SIMPLIFIER ("Congruence not a meta-equality", thm);
wenzelm@15023
   567
    (*val lhs = Pattern.eta_contract lhs;*)
skalberg@15570
   568
      val a = valOf (cong_name (head_of lhs)) handle Option =>
wenzelm@15023
   569
        raise SIMPLIFIER ("Congruence must start with a constant", thm);
wenzelm@15023
   570
      val (alist, _) = congs;
skalberg@15570
   571
      val alist2 = List.filter (fn (x, _) => x <> a) alist;
skalberg@15570
   572
      val weak2 = alist2 |> List.mapPartial (fn (a, {thm, ...}) =>
skalberg@15531
   573
        if is_full_cong thm then NONE else SOME a);
wenzelm@15023
   574
    in ((alist2, weak2), procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) end);
berghofe@10413
   575
wenzelm@15023
   576
fun mk_cong (Simpset (_, {mk_rews = {mk_cong = f, ...}, ...})) = f;
wenzelm@15023
   577
wenzelm@15023
   578
in
wenzelm@15023
   579
skalberg@15570
   580
val (op addeqcongs) = Library.foldl add_cong;
skalberg@15570
   581
val (op deleqcongs) = Library.foldl del_cong;
wenzelm@15023
   582
wenzelm@15023
   583
fun ss addcongs congs = ss addeqcongs map (mk_cong ss) congs;
wenzelm@15023
   584
fun ss delcongs congs = ss deleqcongs map (mk_cong ss) congs;
wenzelm@15023
   585
wenzelm@15023
   586
end;
berghofe@10413
   587
berghofe@10413
   588
wenzelm@15023
   589
(* simprocs *)
wenzelm@15023
   590
wenzelm@15023
   591
local
berghofe@10413
   592
wenzelm@15023
   593
fun add_proc (ss, proc as Proc {name, lhs, ...}) =
wenzelm@15023
   594
 (trace_cterm false ("Adding simplification procedure " ^ quote name ^ " for") lhs;
wenzelm@15023
   595
  map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) =>
wenzelm@15023
   596
    (congs, Net.insert_term ((term_of lhs, proc), procs, eq_proc),
wenzelm@15023
   597
      mk_rews, termless, subgoal_tac, loop_tacs, solvers)) ss
wenzelm@15023
   598
  handle Net.INSERT =>
wenzelm@15023
   599
    (warning ("Ignoring duplicate simplification procedure " ^ quote name); ss));
berghofe@10413
   600
wenzelm@15023
   601
fun del_proc (ss, proc as Proc {name, lhs, ...}) =
wenzelm@15023
   602
  map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) =>
wenzelm@15023
   603
    (congs, Net.delete_term ((term_of lhs, proc), procs, eq_proc),
wenzelm@15023
   604
      mk_rews, termless, subgoal_tac, loop_tacs, solvers)) ss
wenzelm@15023
   605
  handle Net.DELETE =>
wenzelm@15023
   606
    (warning ("Simplification procedure " ^ quote name ^ " not in simpset"); ss);
berghofe@10413
   607
wenzelm@15023
   608
in
berghofe@10413
   609
skalberg@15570
   610
val (op addsimprocs) = Library.foldl (fn (ss, Simproc procs) => Library.foldl add_proc (ss, procs));
skalberg@15570
   611
val (op delsimprocs) = Library.foldl (fn (ss, Simproc procs) => Library.foldl del_proc (ss, procs));
berghofe@10413
   612
wenzelm@15023
   613
end;
berghofe@10413
   614
berghofe@10413
   615
berghofe@10413
   616
(* mk_rews *)
berghofe@10413
   617
wenzelm@15023
   618
local
wenzelm@15023
   619
nipkow@15199
   620
fun map_mk_rews f = map_simpset2 (fn (congs, procs, {mk, mk_cong, mk_sym, mk_eq_True},
wenzelm@15023
   621
      termless, subgoal_tac, loop_tacs, solvers) =>
nipkow@15199
   622
  let val (mk', mk_cong', mk_sym', mk_eq_True') = f (mk, mk_cong, mk_sym, mk_eq_True) in
nipkow@15199
   623
    (congs, procs, {mk = mk', mk_cong = mk_cong', mk_sym = mk_sym', mk_eq_True = mk_eq_True'},
wenzelm@15023
   624
      termless, subgoal_tac, loop_tacs, solvers)
wenzelm@15023
   625
  end);
wenzelm@15023
   626
wenzelm@15023
   627
in
berghofe@10413
   628
nipkow@15199
   629
fun ss setmksimps mk = ss |> map_mk_rews (fn (_, mk_cong, mk_sym, mk_eq_True) =>
nipkow@15199
   630
  (mk, mk_cong, mk_sym, mk_eq_True));
wenzelm@15023
   631
nipkow@15199
   632
fun ss setmkcong mk_cong = ss |> map_mk_rews (fn (mk, _, mk_sym, mk_eq_True) =>
nipkow@15199
   633
  (mk, mk_cong, mk_sym, mk_eq_True));
berghofe@10413
   634
nipkow@15199
   635
fun ss setmksym mk_sym = ss |> map_mk_rews (fn (mk, mk_cong, _, mk_eq_True) =>
nipkow@15199
   636
  (mk, mk_cong, mk_sym, mk_eq_True));
berghofe@10413
   637
nipkow@15199
   638
fun ss setmkeqTrue mk_eq_True = ss |> map_mk_rews (fn (mk, mk_cong, mk_sym, _) =>
nipkow@15199
   639
  (mk, mk_cong, mk_sym, mk_eq_True));
wenzelm@15023
   640
wenzelm@15023
   641
end;
wenzelm@15023
   642
skalberg@14242
   643
berghofe@10413
   644
(* termless *)
berghofe@10413
   645
wenzelm@15023
   646
fun ss settermless termless = ss |>
wenzelm@15023
   647
  map_simpset2 (fn (congs, procs, mk_rews, _, subgoal_tac, loop_tacs, solvers) =>
wenzelm@15023
   648
   (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers));
skalberg@15006
   649
skalberg@15006
   650
wenzelm@15023
   651
(* tactics *)
skalberg@15006
   652
wenzelm@15023
   653
fun ss setsubgoaler subgoal_tac = ss |>
wenzelm@15023
   654
  map_simpset2 (fn (congs, procs, mk_rews, termless, _, loop_tacs, solvers) =>
wenzelm@15023
   655
   (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers));
skalberg@15006
   656
wenzelm@15023
   657
fun ss setloop tac = ss |>
wenzelm@15023
   658
  map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, _, solvers) =>
wenzelm@15023
   659
   (congs, procs, mk_rews, termless, subgoal_tac, [("", tac)], solvers));
skalberg@15006
   660
wenzelm@15023
   661
fun ss addloop (name, tac) = ss |>
wenzelm@15023
   662
  map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) =>
wenzelm@15023
   663
    (congs, procs, mk_rews, termless, subgoal_tac,
wenzelm@15023
   664
      overwrite_warn (loop_tacs, (name, tac)) ("Overwriting looper " ^ quote name),
wenzelm@15023
   665
      solvers));
skalberg@15006
   666
wenzelm@15023
   667
fun ss delloop name = ss |>
wenzelm@15023
   668
  map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) =>
wenzelm@15034
   669
    let val loop_tacs' = filter_out (equal name o #1) loop_tacs in
wenzelm@15034
   670
      if length loop_tacs <> length loop_tacs' then ()
wenzelm@15034
   671
      else warning ("No such looper in simpset: " ^ quote name);
wenzelm@15034
   672
      (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs', solvers)
wenzelm@15023
   673
    end);
skalberg@15006
   674
wenzelm@15023
   675
fun ss setSSolver solver = ss |> map_simpset2 (fn (congs, procs, mk_rews, termless,
wenzelm@15023
   676
  subgoal_tac, loop_tacs, (unsafe_solvers, _)) =>
wenzelm@15023
   677
    (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, (unsafe_solvers, [solver])));
skalberg@15006
   678
wenzelm@15023
   679
fun ss addSSolver solver = ss |> map_simpset2 (fn (congs, procs, mk_rews, termless,
wenzelm@15023
   680
  subgoal_tac, loop_tacs, (unsafe_solvers, solvers)) => (congs, procs, mk_rews, termless,
wenzelm@15023
   681
    subgoal_tac, loop_tacs, (unsafe_solvers, merge_solvers solvers [solver])));
skalberg@15006
   682
wenzelm@15023
   683
fun ss setSolver solver = ss |> map_simpset2 (fn (congs, procs, mk_rews, termless,
wenzelm@15023
   684
  subgoal_tac, loop_tacs, (_, solvers)) => (congs, procs, mk_rews, termless,
wenzelm@15023
   685
    subgoal_tac, loop_tacs, ([solver], solvers)));
skalberg@15006
   686
wenzelm@15023
   687
fun ss addSolver solver = ss |> map_simpset2 (fn (congs, procs, mk_rews, termless,
wenzelm@15023
   688
  subgoal_tac, loop_tacs, (unsafe_solvers, solvers)) => (congs, procs, mk_rews, termless,
wenzelm@15023
   689
    subgoal_tac, loop_tacs, (merge_solvers unsafe_solvers [solver], solvers)));
skalberg@15006
   690
wenzelm@15023
   691
fun set_solvers solvers = map_simpset2 (fn (congs, procs, mk_rews, termless,
wenzelm@15023
   692
  subgoal_tac, loop_tacs, _) => (congs, procs, mk_rews, termless,
wenzelm@15023
   693
  subgoal_tac, loop_tacs, (solvers, solvers)));
skalberg@15006
   694
skalberg@15006
   695
skalberg@15006
   696
berghofe@10413
   697
(** rewriting **)
berghofe@10413
   698
berghofe@10413
   699
(*
berghofe@10413
   700
  Uses conversions, see:
berghofe@10413
   701
    L C Paulson, A higher-order implementation of rewriting,
berghofe@10413
   702
    Science of Computer Programming 3 (1983), pages 119-149.
berghofe@10413
   703
*)
berghofe@10413
   704
wenzelm@15023
   705
val dest_eq = Drule.dest_equals o Thm.cprop_of;
wenzelm@15023
   706
val lhs_of = #1 o dest_eq;
wenzelm@15023
   707
val rhs_of = #2 o dest_eq;
berghofe@10413
   708
berghofe@10413
   709
fun check_conv msg thm thm' =
berghofe@10413
   710
  let
berghofe@10413
   711
    val thm'' = transitive thm (transitive
skalberg@15001
   712
      (symmetric (Drule.beta_eta_conversion (lhs_of thm'))) thm')
skalberg@15531
   713
  in if msg then trace_thm "SUCCEEDED" thm' else (); SOME thm'' end
berghofe@10413
   714
  handle THM _ =>
wenzelm@15023
   715
    let val {sign, prop = _ $ _ $ prop0, ...} = Thm.rep_thm thm in
wenzelm@15023
   716
      trace_thm "Proved wrong thm (Check subgoaler?)" thm';
wenzelm@15023
   717
      trace_term false "Should have proved:" sign prop0;
skalberg@15531
   718
      NONE
berghofe@10413
   719
    end;
berghofe@10413
   720
berghofe@10413
   721
berghofe@10413
   722
(* mk_procrule *)
berghofe@10413
   723
berghofe@10413
   724
fun mk_procrule thm =
wenzelm@15023
   725
  let val (_, prems, lhs, elhs, rhs, _) = decomp_simp thm in
wenzelm@15023
   726
    if rewrite_rule_extra_vars prems lhs rhs
wenzelm@15023
   727
    then (warn_thm "Extra vars on rhs:" thm; [])
wenzelm@15023
   728
    else [mk_rrule2 {thm = thm, name = "", lhs = lhs, elhs = elhs, perm = false}]
berghofe@10413
   729
  end;
berghofe@10413
   730
berghofe@10413
   731
wenzelm@15023
   732
(* rewritec: conversion to apply the meta simpset to a term *)
berghofe@10413
   733
wenzelm@15023
   734
(*Since the rewriting strategy is bottom-up, we avoid re-normalizing already
wenzelm@15023
   735
  normalized terms by carrying around the rhs of the rewrite rule just
wenzelm@15023
   736
  applied. This is called the `skeleton'. It is decomposed in parallel
wenzelm@15023
   737
  with the term. Once a Var is encountered, the corresponding term is
wenzelm@15023
   738
  already in normal form.
wenzelm@15023
   739
  skel0 is a dummy skeleton that is to enforce complete normalization.*)
wenzelm@15023
   740
berghofe@10413
   741
val skel0 = Bound 0;
berghofe@10413
   742
wenzelm@15023
   743
(*Use rhs as skeleton only if the lhs does not contain unnormalized bits.
wenzelm@15023
   744
  The latter may happen iff there are weak congruence rules for constants
wenzelm@15023
   745
  in the lhs.*)
berghofe@10413
   746
wenzelm@15023
   747
fun uncond_skel ((_, weak), (lhs, rhs)) =
wenzelm@15023
   748
  if null weak then rhs  (*optimization*)
wenzelm@15023
   749
  else if exists_Const (fn (c, _) => c mem weak) lhs then skel0
wenzelm@15023
   750
  else rhs;
wenzelm@15023
   751
wenzelm@15023
   752
(*Behaves like unconditional rule if rhs does not contain vars not in the lhs.
wenzelm@15023
   753
  Otherwise those vars may become instantiated with unnormalized terms
wenzelm@15023
   754
  while the premises are solved.*)
wenzelm@15023
   755
wenzelm@15023
   756
fun cond_skel (args as (congs, (lhs, rhs))) =
wenzelm@15023
   757
  if term_varnames rhs subset term_varnames lhs then uncond_skel args
berghofe@10413
   758
  else skel0;
berghofe@10413
   759
wenzelm@15023
   760
fun incr_depth ss =
wenzelm@15023
   761
  let
wenzelm@15023
   762
    val ss' = ss |> map_simpset1 (fn (rules, prems, bounds, depth) =>
wenzelm@15023
   763
      (rules, prems, bounds, depth + 1));
wenzelm@15023
   764
    val Simpset ({depth = depth', ...}, _) = ss';
wenzelm@15023
   765
  in
wenzelm@15023
   766
    if depth' > ! simp_depth_limit
skalberg@15531
   767
    then (warning "simp_depth_limit exceeded - giving up"; NONE)
wenzelm@15023
   768
    else
wenzelm@15023
   769
     (if depth' mod 10 = 0
wenzelm@15023
   770
      then warning ("Simplification depth " ^ string_of_int depth')
wenzelm@15023
   771
      else ();
skalberg@15531
   772
      SOME ss')
wenzelm@15023
   773
  end;
wenzelm@15023
   774
berghofe@10413
   775
(*
wenzelm@15023
   776
  Rewriting -- we try in order:
berghofe@10413
   777
    (1) beta reduction
berghofe@10413
   778
    (2) unconditional rewrite rules
berghofe@10413
   779
    (3) conditional rewrite rules
berghofe@10413
   780
    (4) simplification procedures
berghofe@10413
   781
berghofe@10413
   782
  IMPORTANT: rewrite rules must not introduce new Vars or TVars!
berghofe@10413
   783
*)
berghofe@10413
   784
wenzelm@15023
   785
fun rewritec (prover, signt, maxt) ss t =
berghofe@10413
   786
  let
wenzelm@15023
   787
    val Simpset ({rules, ...}, {congs, procs, termless, ...}) = ss;
berghofe@10413
   788
    val eta_thm = Thm.eta_conversion t;
berghofe@10413
   789
    val eta_t' = rhs_of eta_thm;
berghofe@10413
   790
    val eta_t = term_of eta_t';
berghofe@10413
   791
    val tsigt = Sign.tsig_of signt;
berghofe@13607
   792
    fun rew {thm, name, lhs, elhs, fo, perm} =
berghofe@10413
   793
      let
berghofe@10413
   794
        val {sign, prop, maxidx, ...} = rep_thm thm;
berghofe@10413
   795
        val (rthm, elhs') = if maxt = ~1 then (thm, elhs)
berghofe@10413
   796
          else (Thm.incr_indexes (maxt+1) thm, Thm.cterm_incr_indexes (maxt+1) elhs);
berghofe@10413
   797
        val insts = if fo then Thm.cterm_first_order_match (elhs', eta_t')
berghofe@10413
   798
                          else Thm.cterm_match (elhs', eta_t');
berghofe@10413
   799
        val thm' = Thm.instantiate insts (Thm.rename_boundvars lhs eta_t rthm);
wenzelm@14643
   800
        val prop' = Thm.prop_of thm';
berghofe@10413
   801
        val unconditional = (Logic.count_prems (prop',0) = 0);
berghofe@10413
   802
        val (lhs', rhs') = Logic.dest_equals (Logic.strip_imp_concl prop')
berghofe@10413
   803
      in
nipkow@11295
   804
        if perm andalso not (termless (rhs', lhs'))
berghofe@13607
   805
        then (trace_named_thm "Cannot apply permutative rewrite rule" (thm, name);
skalberg@15531
   806
              trace_thm "Term does not become smaller:" thm'; NONE)
berghofe@13607
   807
        else (trace_named_thm "Applying instance of rewrite rule" (thm, name);
berghofe@10413
   808
           if unconditional
berghofe@10413
   809
           then
nipkow@13569
   810
             (trace_thm "Rewriting:" thm';
berghofe@10413
   811
              let val lr = Logic.dest_equals prop;
skalberg@15531
   812
                  val SOME thm'' = check_conv false eta_thm thm'
skalberg@15531
   813
              in SOME (thm'', uncond_skel (congs, lr)) end)
berghofe@10413
   814
           else
nipkow@13569
   815
             (trace_thm "Trying to rewrite:" thm';
wenzelm@15023
   816
              case incr_depth ss of
skalberg@15531
   817
                NONE => (trace_thm "FAILED - reached depth limit" thm'; NONE)
skalberg@15531
   818
              | SOME ss' =>
wenzelm@15023
   819
              (case prover ss' thm' of
skalberg@15531
   820
                NONE => (trace_thm "FAILED" thm'; NONE)
skalberg@15531
   821
              | SOME thm2 =>
berghofe@10413
   822
                  (case check_conv true eta_thm thm2 of
skalberg@15531
   823
                     NONE => NONE |
skalberg@15531
   824
                     SOME thm2' =>
berghofe@10413
   825
                       let val concl = Logic.strip_imp_concl prop
berghofe@10413
   826
                           val lr = Logic.dest_equals concl
skalberg@15531
   827
                       in SOME (thm2', cond_skel (congs, lr)) end))))
berghofe@10413
   828
      end
berghofe@10413
   829
skalberg@15531
   830
    fun rews [] = NONE
berghofe@10413
   831
      | rews (rrule :: rrules) =
skalberg@15531
   832
          let val opt = rew rrule handle Pattern.MATCH => NONE
skalberg@15531
   833
          in case opt of NONE => rews rrules | some => some end;
berghofe@10413
   834
berghofe@10413
   835
    fun sort_rrules rrs = let
wenzelm@14643
   836
      fun is_simple({thm, ...}:rrule) = case Thm.prop_of thm of
berghofe@10413
   837
                                      Const("==",_) $ _ $ _ => true
wenzelm@12603
   838
                                      | _                   => false
berghofe@10413
   839
      fun sort []        (re1,re2) = re1 @ re2
wenzelm@12603
   840
        | sort (rr::rrs) (re1,re2) = if is_simple rr
berghofe@10413
   841
                                     then sort rrs (rr::re1,re2)
berghofe@10413
   842
                                     else sort rrs (re1,rr::re2)
berghofe@10413
   843
    in sort rrs ([],[]) end
berghofe@10413
   844
skalberg@15531
   845
    fun proc_rews [] = NONE
wenzelm@15023
   846
      | proc_rews (Proc {name, proc, lhs, ...} :: ps) =
wenzelm@15023
   847
          if Pattern.matches tsigt (Thm.term_of lhs, Thm.term_of t) then
berghofe@10413
   848
            (debug_term false ("Trying procedure " ^ quote name ^ " on:") signt eta_t;
wenzelm@13486
   849
             case transform_failure (curry SIMPROC_FAIL name)
wenzelm@15023
   850
                 (fn () => proc signt ss eta_t) () of
skalberg@15531
   851
               NONE => (debug false "FAILED"; proc_rews ps)
skalberg@15531
   852
             | SOME raw_thm =>
nipkow@13569
   853
                 (trace_thm ("Procedure " ^ quote name ^ " produced rewrite rule:") raw_thm;
berghofe@10413
   854
                  (case rews (mk_procrule raw_thm) of
skalberg@15531
   855
                    NONE => (trace_cterm true ("IGNORED result of simproc " ^ quote name ^
wenzelm@13486
   856
                      " -- does not match") t; proc_rews ps)
berghofe@10413
   857
                  | some => some)))
berghofe@10413
   858
          else proc_rews ps;
berghofe@10413
   859
  in case eta_t of
skalberg@15531
   860
       Abs _ $ _ => SOME (transitive eta_thm
berghofe@12155
   861
         (beta_conversion false eta_t'), skel0)
berghofe@10413
   862
     | _ => (case rews (sort_rrules (Net.match_term rules eta_t)) of
skalberg@15531
   863
               NONE => proc_rews (Net.match_term procs eta_t)
berghofe@10413
   864
             | some => some)
berghofe@10413
   865
  end;
berghofe@10413
   866
berghofe@10413
   867
berghofe@10413
   868
(* conversion to apply a congruence rule to a term *)
berghofe@10413
   869
berghofe@10413
   870
fun congc (prover,signt,maxt) {thm=cong,lhs=lhs} t =
wenzelm@14643
   871
  let val sign = Thm.sign_of_thm cong
berghofe@10413
   872
      val rthm = if maxt = ~1 then cong else Thm.incr_indexes (maxt+1) cong;
berghofe@10413
   873
      val rlhs = fst (Drule.dest_equals (Drule.strip_imp_concl (cprop_of rthm)));
berghofe@10413
   874
      val insts = Thm.cterm_match (rlhs, t)
berghofe@10413
   875
      (* Pattern.match can raise Pattern.MATCH;
berghofe@10413
   876
         is handled when congc is called *)
berghofe@10413
   877
      val thm' = Thm.instantiate insts (Thm.rename_boundvars (term_of rlhs) (term_of t) rthm);
nipkow@13569
   878
      val unit = trace_thm "Applying congruence rule:" thm';
skalberg@15531
   879
      fun err (msg, thm) = (trace_thm msg thm; NONE)
berghofe@10413
   880
  in case prover thm' of
skalberg@15531
   881
       NONE => err ("Congruence proof failed.  Could not prove", thm')
skalberg@15531
   882
     | SOME thm2 => (case check_conv true (Drule.beta_eta_conversion t) thm2 of
skalberg@15531
   883
          NONE => err ("Congruence proof failed.  Should not have proved", thm2)
skalberg@15531
   884
        | SOME thm2' =>
berghofe@12155
   885
            if op aconv (pairself term_of (dest_equals (cprop_of thm2')))
skalberg@15531
   886
            then NONE else SOME thm2')
berghofe@10413
   887
  end;
berghofe@10413
   888
berghofe@10413
   889
val (cA, (cB, cC)) =
berghofe@10413
   890
  apsnd dest_equals (dest_implies (hd (cprems_of Drule.imp_cong)));
berghofe@10413
   891
skalberg@15531
   892
fun transitive1 NONE NONE = NONE
skalberg@15531
   893
  | transitive1 (SOME thm1) NONE = SOME thm1
skalberg@15531
   894
  | transitive1 NONE (SOME thm2) = SOME thm2
skalberg@15531
   895
  | transitive1 (SOME thm1) (SOME thm2) = SOME (transitive thm1 thm2)
berghofe@10413
   896
skalberg@15531
   897
fun transitive2 thm = transitive1 (SOME thm);
skalberg@15531
   898
fun transitive3 thm = transitive1 thm o SOME;
berghofe@13607
   899
wenzelm@15023
   900
fun bottomc ((simprem, useprem, mutsimp), prover, sign, maxidx) =
berghofe@10413
   901
  let
wenzelm@15023
   902
    fun botc skel ss t =
skalberg@15531
   903
          if is_Var skel then NONE
berghofe@10413
   904
          else
wenzelm@15023
   905
          (case subc skel ss t of
skalberg@15531
   906
             some as SOME thm1 =>
wenzelm@15023
   907
               (case rewritec (prover, sign, maxidx) ss (rhs_of thm1) of
skalberg@15531
   908
                  SOME (thm2, skel2) =>
berghofe@13607
   909
                    transitive2 (transitive thm1 thm2)
wenzelm@15023
   910
                      (botc skel2 ss (rhs_of thm2))
skalberg@15531
   911
                | NONE => some)
skalberg@15531
   912
           | NONE =>
wenzelm@15023
   913
               (case rewritec (prover, sign, maxidx) ss t of
skalberg@15531
   914
                  SOME (thm2, skel2) => transitive2 thm2
wenzelm@15023
   915
                    (botc skel2 ss (rhs_of thm2))
skalberg@15531
   916
                | NONE => NONE))
berghofe@10413
   917
wenzelm@15023
   918
    and try_botc ss t =
wenzelm@15023
   919
          (case botc skel0 ss t of
skalberg@15531
   920
             SOME trec1 => trec1 | NONE => (reflexive t))
berghofe@10413
   921
wenzelm@15023
   922
    and subc skel (ss as Simpset ({bounds, ...}, {congs, ...})) t0 =
berghofe@10413
   923
       (case term_of t0 of
berghofe@10413
   924
           Abs (a, T, t) =>
wenzelm@15023
   925
             let
skalberg@15531
   926
                 val (v, t') = Thm.dest_abs (SOME ("." ^ a ^ "." ^ string_of_int bounds)) t0;
berghofe@15249
   927
                 val ss' = incr_bounds ss;
wenzelm@15023
   928
                 val skel' = case skel of Abs (_, _, sk) => sk | _ => skel0;
wenzelm@15023
   929
             in case botc skel' ss' t' of
skalberg@15531
   930
                  SOME thm => SOME (abstract_rule a v thm)
skalberg@15531
   931
                | NONE => NONE
berghofe@10413
   932
             end
berghofe@10413
   933
         | t $ _ => (case t of
wenzelm@15023
   934
             Const ("==>", _) $ _  => impc t0 ss
berghofe@10413
   935
           | Abs _ =>
berghofe@10413
   936
               let val thm = beta_conversion false t0
wenzelm@15023
   937
               in case subc skel0 ss (rhs_of thm) of
skalberg@15531
   938
                    NONE => SOME thm
skalberg@15531
   939
                  | SOME thm' => SOME (transitive thm thm')
berghofe@10413
   940
               end
berghofe@10413
   941
           | _  =>
berghofe@10413
   942
               let fun appc () =
berghofe@10413
   943
                     let
berghofe@10413
   944
                       val (tskel, uskel) = case skel of
berghofe@10413
   945
                           tskel $ uskel => (tskel, uskel)
berghofe@10413
   946
                         | _ => (skel0, skel0);
wenzelm@10767
   947
                       val (ct, cu) = Thm.dest_comb t0
berghofe@10413
   948
                     in
wenzelm@15023
   949
                     (case botc tskel ss ct of
skalberg@15531
   950
                        SOME thm1 =>
wenzelm@15023
   951
                          (case botc uskel ss cu of
skalberg@15531
   952
                             SOME thm2 => SOME (combination thm1 thm2)
skalberg@15531
   953
                           | NONE => SOME (combination thm1 (reflexive cu)))
skalberg@15531
   954
                      | NONE =>
wenzelm@15023
   955
                          (case botc uskel ss cu of
skalberg@15531
   956
                             SOME thm1 => SOME (combination (reflexive ct) thm1)
skalberg@15531
   957
                           | NONE => NONE))
berghofe@10413
   958
                     end
berghofe@10413
   959
                   val (h, ts) = strip_comb t
ballarin@13835
   960
               in case cong_name h of
skalberg@15531
   961
                    SOME a =>
berghofe@10413
   962
                      (case assoc_string (fst congs, a) of
skalberg@15531
   963
                         NONE => appc ()
skalberg@15531
   964
                       | SOME cong =>
wenzelm@15023
   965
  (*post processing: some partial applications h t1 ... tj, j <= length ts,
wenzelm@15023
   966
    may be a redex. Example: map (%x. x) = (%xs. xs) wrt map_cong*)
berghofe@10413
   967
                          (let
wenzelm@15023
   968
                             val thm = congc (prover ss, sign, maxidx) cong t0;
skalberg@15570
   969
                             val t = getOpt (Option.map rhs_of thm, t0);
wenzelm@10767
   970
                             val (cl, cr) = Thm.dest_comb t
berghofe@10413
   971
                             val dVar = Var(("", 0), dummyT)
berghofe@10413
   972
                             val skel =
berghofe@10413
   973
                               list_comb (h, replicate (length ts) dVar)
wenzelm@15023
   974
                           in case botc skel ss cl of
skalberg@15531
   975
                                NONE => thm
skalberg@15531
   976
                              | SOME thm' => transitive3 thm
berghofe@12155
   977
                                  (combination thm' (reflexive cr))
berghofe@10413
   978
                           end handle TERM _ => error "congc result"
berghofe@10413
   979
                                    | Pattern.MATCH => appc ()))
berghofe@10413
   980
                  | _ => appc ()
berghofe@10413
   981
               end)
skalberg@15531
   982
         | _ => NONE)
berghofe@10413
   983
wenzelm@15023
   984
    and impc ct ss =
wenzelm@15023
   985
      if mutsimp then mut_impc0 [] ct [] [] ss else nonmut_impc ct ss
berghofe@10413
   986
wenzelm@15023
   987
    and rules_of_prem ss prem =
berghofe@13607
   988
      if maxidx_of_term (term_of prem) <> ~1
berghofe@13607
   989
      then (trace_cterm true
skalberg@15531
   990
        "Cannot add premise as rewrite rule because it contains (type) unknowns:" prem; ([], NONE))
berghofe@13607
   991
      else
berghofe@13607
   992
        let val asm = assume prem
skalberg@15531
   993
        in (extract_safe_rrules (ss, asm), SOME asm) end
berghofe@10413
   994
wenzelm@15023
   995
    and add_rrules (rrss, asms) ss =
skalberg@15570
   996
      Library.foldl (insert_rrule true) (ss, List.concat rrss) |> add_prems (List.mapPartial I asms)
berghofe@10413
   997
berghofe@13607
   998
    and disch r (prem, eq) =
berghofe@13607
   999
      let
berghofe@13607
  1000
        val (lhs, rhs) = dest_eq eq;
berghofe@13607
  1001
        val eq' = implies_elim (Thm.instantiate
berghofe@13607
  1002
          ([], [(cA, prem), (cB, lhs), (cC, rhs)]) Drule.imp_cong)
berghofe@13607
  1003
          (implies_intr prem eq)
berghofe@13607
  1004
      in if not r then eq' else
berghofe@10413
  1005
        let
berghofe@13607
  1006
          val (prem', concl) = dest_implies lhs;
berghofe@13607
  1007
          val (prem'', _) = dest_implies rhs
berghofe@13607
  1008
        in transitive (transitive
berghofe@13607
  1009
          (Thm.instantiate ([], [(cA, prem'), (cB, prem), (cC, concl)])
berghofe@13607
  1010
             Drule.swap_prems_eq) eq')
berghofe@13607
  1011
          (Thm.instantiate ([], [(cA, prem), (cB, prem''), (cC, concl)])
berghofe@13607
  1012
             Drule.swap_prems_eq)
berghofe@10413
  1013
        end
berghofe@10413
  1014
      end
berghofe@10413
  1015
berghofe@13607
  1016
    and rebuild [] _ _ _ _ eq = eq
wenzelm@15023
  1017
      | rebuild (prem :: prems) concl (rrs :: rrss) (asm :: asms) ss eq =
berghofe@13607
  1018
          let
wenzelm@15023
  1019
            val ss' = add_rrules (rev rrss, rev asms) ss;
berghofe@13607
  1020
            val concl' =
skalberg@15570
  1021
              Drule.mk_implies (prem, getOpt (Option.map rhs_of eq, concl));
skalberg@15570
  1022
            val dprem = Option.map (curry (disch false) prem)
wenzelm@15023
  1023
          in case rewritec (prover, sign, maxidx) ss' concl' of
skalberg@15531
  1024
              NONE => rebuild prems concl' rrss asms ss (dprem eq)
skalberg@15570
  1025
            | SOME (eq', _) => transitive2 (Library.foldl (disch false o swap)
skalberg@15570
  1026
                  (valOf (transitive3 (dprem eq) eq'), prems))
wenzelm@15023
  1027
                (mut_impc0 (rev prems) (rhs_of eq') (rev rrss) (rev asms) ss)
berghofe@13607
  1028
          end
wenzelm@15023
  1029
wenzelm@15023
  1030
    and mut_impc0 prems concl rrss asms ss =
berghofe@13607
  1031
      let
berghofe@13607
  1032
        val prems' = strip_imp_prems concl;
wenzelm@15023
  1033
        val (rrss', asms') = split_list (map (rules_of_prem ss) prems')
berghofe@13607
  1034
      in mut_impc (prems @ prems') (strip_imp_concl concl) (rrss @ rrss')
wenzelm@15023
  1035
        (asms @ asms') [] [] [] [] ss ~1 ~1
berghofe@13607
  1036
      end
wenzelm@15023
  1037
wenzelm@15023
  1038
    and mut_impc [] concl [] [] prems' rrss' asms' eqns ss changed k =
skalberg@15570
  1039
        transitive1 (Library.foldl (fn (eq2, (eq1, prem)) => transitive1 eq1
skalberg@15570
  1040
            (Option.map (curry (disch false) prem) eq2)) (NONE, eqns ~~ prems'))
berghofe@13607
  1041
          (if changed > 0 then
berghofe@13607
  1042
             mut_impc (rev prems') concl (rev rrss') (rev asms')
wenzelm@15023
  1043
               [] [] [] [] ss ~1 changed
wenzelm@15023
  1044
           else rebuild prems' concl rrss' asms' ss
wenzelm@15023
  1045
             (botc skel0 (add_rrules (rev rrss', rev asms') ss) concl))
berghofe@13607
  1046
berghofe@13607
  1047
      | mut_impc (prem :: prems) concl (rrs :: rrss) (asm :: asms)
wenzelm@15023
  1048
          prems' rrss' asms' eqns ss changed k =
skalberg@15531
  1049
        case (if k = 0 then NONE else botc skel0 (add_rrules
wenzelm@15023
  1050
          (rev rrss' @ rrss, rev asms' @ asms) ss) prem) of
skalberg@15531
  1051
            NONE => mut_impc prems concl rrss asms (prem :: prems')
skalberg@15531
  1052
              (rrs :: rrss') (asm :: asms') (NONE :: eqns) ss changed
berghofe@13607
  1053
              (if k = 0 then 0 else k - 1)
skalberg@15531
  1054
          | SOME eqn =>
berghofe@13607
  1055
            let
berghofe@13607
  1056
              val prem' = rhs_of eqn;
berghofe@13607
  1057
              val tprems = map term_of prems;
skalberg@15570
  1058
              val i = 1 + Library.foldl Int.max (~1, map (fn p =>
berghofe@13607
  1059
                find_index_eq p tprems) (#hyps (rep_thm eqn)));
wenzelm@15023
  1060
              val (rrs', asm') = rules_of_prem ss prem'
berghofe@13607
  1061
            in mut_impc prems concl rrss asms (prem' :: prems')
skalberg@15570
  1062
              (rrs' :: rrss') (asm' :: asms') (SOME (Library.foldr (disch true)
skalberg@15570
  1063
                (Library.take (i, prems), Drule.imp_cong' eqn (reflexive (Drule.list_implies
skalberg@15570
  1064
                  (Library.drop (i, prems), concl))))) :: eqns) ss (length prems') ~1
berghofe@13607
  1065
            end
berghofe@13607
  1066
wenzelm@15023
  1067
     (*legacy code - only for backwards compatibility*)
wenzelm@15023
  1068
     and nonmut_impc ct ss =
berghofe@13607
  1069
       let val (prem, conc) = dest_implies ct;
skalberg@15531
  1070
           val thm1 = if simprem then botc skel0 ss prem else NONE;
skalberg@15570
  1071
           val prem1 = getOpt (Option.map rhs_of thm1, prem);
wenzelm@15023
  1072
           val ss1 = if not useprem then ss else add_rrules
wenzelm@15023
  1073
             (apsnd single (apfst single (rules_of_prem ss prem1))) ss
wenzelm@15023
  1074
       in (case botc skel0 ss1 conc of
skalberg@15531
  1075
           NONE => (case thm1 of
skalberg@15531
  1076
               NONE => NONE
skalberg@15531
  1077
             | SOME thm1' => SOME (Drule.imp_cong' thm1' (reflexive conc)))
skalberg@15531
  1078
         | SOME thm2 =>
berghofe@13607
  1079
           let val thm2' = disch false (prem1, thm2)
berghofe@10413
  1080
           in (case thm1 of
skalberg@15531
  1081
               NONE => SOME thm2'
skalberg@15531
  1082
             | SOME thm1' =>
skalberg@15531
  1083
                 SOME (transitive (Drule.imp_cong' thm1' (reflexive conc)) thm2'))
berghofe@10413
  1084
           end)
berghofe@10413
  1085
       end
berghofe@10413
  1086
wenzelm@15023
  1087
 in try_botc end;
berghofe@10413
  1088
berghofe@10413
  1089
wenzelm@15023
  1090
(* Meta-rewriting: rewrites t to u and returns the theorem t==u *)
berghofe@10413
  1091
berghofe@10413
  1092
(*
berghofe@10413
  1093
  Parameters:
berghofe@10413
  1094
    mode = (simplify A,
berghofe@10413
  1095
            use A in simplifying B,
berghofe@10413
  1096
            use prems of B (if B is again a meta-impl.) to simplify A)
berghofe@10413
  1097
           when simplifying A ==> B
berghofe@10413
  1098
    prover: how to solve premises in conditional rewrites and congruences
berghofe@10413
  1099
*)
berghofe@10413
  1100
wenzelm@15023
  1101
fun rewrite_cterm mode prover ss ct =
wenzelm@15023
  1102
  let
wenzelm@15023
  1103
    val Simpset ({depth, ...}, _) = ss;
wenzelm@15023
  1104
    val {sign, t, maxidx, ...} = Thm.rep_cterm ct;
wenzelm@15023
  1105
  in
wenzelm@15023
  1106
    trace_cterm false "SIMPLIFIER INVOKED ON THE FOLLOWING TERM:" ct;
wenzelm@15023
  1107
    simp_depth := depth;
wenzelm@15023
  1108
    bottomc (mode, prover, sign, maxidx) ss ct
wenzelm@15023
  1109
  end handle THM (s, _, thms) =>
berghofe@10413
  1110
    error ("Exception THM was raised in simplifier:\n" ^ s ^ "\n" ^
wenzelm@11886
  1111
      Pretty.string_of (Display.pretty_thms thms));
berghofe@10413
  1112
wenzelm@11760
  1113
(*Rewrite a cterm*)
wenzelm@11767
  1114
fun rewrite_aux _ _ [] = (fn ct => Thm.reflexive ct)
wenzelm@15023
  1115
  | rewrite_aux prover full thms =
wenzelm@15023
  1116
      rewrite_cterm (full, false, false) prover (empty_ss addsimps thms);
wenzelm@11672
  1117
berghofe@10413
  1118
(*Rewrite a theorem*)
wenzelm@11767
  1119
fun simplify_aux _ _ [] = (fn th => th)
wenzelm@11767
  1120
  | simplify_aux prover full thms =
wenzelm@15023
  1121
      Drule.fconv_rule (rewrite_cterm (full, false, false) prover (empty_ss addsimps thms));
berghofe@10413
  1122
wenzelm@15023
  1123
(*simple term rewriting -- no proof*)
wenzelm@15023
  1124
fun rewrite_term sg rules procs =
wenzelm@15023
  1125
  Pattern.rewrite_term (Sign.tsig_of sg) (map decomp_simp' rules) procs;
wenzelm@15023
  1126
wenzelm@15023
  1127
fun rewrite_thm mode prover ss = Drule.fconv_rule (rewrite_cterm mode prover ss);
berghofe@10413
  1128
berghofe@10413
  1129
(*Rewrite the subgoals of a proof state (represented by a theorem) *)
berghofe@10413
  1130
fun rewrite_goals_rule_aux _ []   th = th
berghofe@10413
  1131
  | rewrite_goals_rule_aux prover thms th =
skalberg@15001
  1132
      Drule.fconv_rule (Drule.goals_conv (K true) (rewrite_cterm (true, true, false) prover
wenzelm@15023
  1133
        (empty_ss addsimps thms))) th;
berghofe@10413
  1134
wenzelm@15023
  1135
(*Rewrite the subgoal of a proof state (represented by a theorem)*)
skalberg@15011
  1136
fun rewrite_goal_rule mode prover ss i thm =
berghofe@10413
  1137
  if 0 < i  andalso  i <= nprems_of thm
skalberg@15011
  1138
  then Drule.fconv_rule (Drule.goals_conv (fn j => j=i) (rewrite_cterm mode prover ss)) thm
berghofe@10413
  1139
  else raise THM("rewrite_goal_rule",i,[thm]);
berghofe@10413
  1140
wenzelm@15023
  1141
(*Rewrite subgoal i only.  SELECT_GOAL avoids inefficiencies in goals_conv.*)
wenzelm@15023
  1142
fun asm_rewrite_goal_tac mode prover_tac ss =
wenzelm@15023
  1143
  SELECT_GOAL
wenzelm@15023
  1144
    (PRIMITIVE (rewrite_goal_rule mode (SINGLE o prover_tac) ss 1));
wenzelm@12783
  1145
wenzelm@15023
  1146
skalberg@15006
  1147
wenzelm@15023
  1148
(** simplification tactics and rules **)
skalberg@15006
  1149
wenzelm@15023
  1150
fun solve_all_tac solvers ss =
skalberg@15006
  1151
  let
wenzelm@15023
  1152
    val Simpset (_, {subgoal_tac, ...}) = ss;
wenzelm@15023
  1153
    val solve_tac = subgoal_tac (set_solvers solvers ss) THEN_ALL_NEW (K no_tac);
wenzelm@15023
  1154
  in DEPTH_SOLVE (solve_tac 1) end;
skalberg@15006
  1155
wenzelm@15023
  1156
(*NOTE: may instantiate unknowns that appear also in other subgoals*)
wenzelm@15023
  1157
fun generic_simp_tac safe mode ss =
wenzelm@15023
  1158
  let
wenzelm@15023
  1159
    val Simpset ({prems, ...}, {loop_tacs, solvers = (unsafe_solvers, solvers), ...}) = ss;
wenzelm@15023
  1160
    val loop_tac = FIRST' (map #2 loop_tacs);
wenzelm@15023
  1161
    val solve_tac = FIRST' (map (solver prems) (if safe then solvers else unsafe_solvers));
skalberg@15006
  1162
wenzelm@15023
  1163
    fun simp_loop_tac i =
wenzelm@15023
  1164
      asm_rewrite_goal_tac mode (solve_all_tac unsafe_solvers) ss i THEN
wenzelm@15023
  1165
      (solve_tac i ORELSE TRY ((loop_tac THEN_ALL_NEW simp_loop_tac) i));
wenzelm@15023
  1166
  in simp_loop_tac end;
skalberg@15006
  1167
wenzelm@15023
  1168
fun simp rew mode ss thm =
skalberg@15006
  1169
  let
wenzelm@15023
  1170
    val Simpset (_, {solvers = (unsafe_solvers, _), ...}) = ss;
wenzelm@15023
  1171
    val tacf = solve_all_tac unsafe_solvers;
skalberg@15570
  1172
    fun prover s th = Option.map #1 (Seq.pull (tacf s th));
skalberg@15011
  1173
  in rew mode prover ss thm end;
skalberg@15006
  1174
skalberg@15006
  1175
val simp_thm = simp rewrite_thm;
skalberg@15006
  1176
val simp_cterm = simp rewrite_cterm;
skalberg@15006
  1177
berghofe@10413
  1178
end;
berghofe@10413
  1179
wenzelm@11672
  1180
structure BasicMetaSimplifier: BASIC_META_SIMPLIFIER = MetaSimplifier;
wenzelm@11672
  1181
open BasicMetaSimplifier;