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