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