src/Pure/raw_simplifier.ML
author wenzelm
Mon Feb 27 15:42:07 2012 +0100 (2012-02-27)
changeset 46707 1427dcc7c9a6
parent 46465 5ba52c337cd0
child 47239 0b1829860149
permissions -rw-r--r--
eliminated odd comment from distant past;
wenzelm@41228
     1
(*  Title:      Pure/raw_simplifier.ML
wenzelm@29269
     2
    Author:     Tobias Nipkow and Stefan Berghofer, TU Muenchen
berghofe@10413
     3
wenzelm@41228
     4
Higher-order Simplification.
berghofe@10413
     5
*)
berghofe@10413
     6
skalberg@15006
     7
infix 4
wenzelm@45620
     8
  addsimps delsimps addsimprocs delsimprocs
wenzelm@45625
     9
  setloop' setloop addloop addloop' delloop
wenzelm@45625
    10
  setSSolver addSSolver setSolver addSolver;
skalberg@15006
    11
wenzelm@41228
    12
signature BASIC_RAW_SIMPLIFIER =
wenzelm@11672
    13
sig
wenzelm@41227
    14
  val simp_depth_limit: int Config.T
wenzelm@41227
    15
  val simp_trace_depth_limit: int Config.T
wenzelm@40878
    16
  val simp_debug: bool Config.T
wenzelm@40878
    17
  val simp_trace: bool Config.T
wenzelm@15023
    18
  type rrule
wenzelm@16807
    19
  val eq_rrule: rrule * rrule -> bool
wenzelm@15023
    20
  type simpset
wenzelm@15023
    21
  type proc
wenzelm@17614
    22
  type solver
wenzelm@43596
    23
  val mk_solver: string -> (simpset -> int -> tactic) -> solver
wenzelm@15023
    24
  val empty_ss: simpset
wenzelm@15023
    25
  val merge_ss: simpset * simpset -> simpset
wenzelm@30356
    26
  val dest_ss: simpset ->
wenzelm@30356
    27
   {simps: (string * thm) list,
wenzelm@30356
    28
    procs: (string * cterm list) list,
wenzelm@30356
    29
    congs: (string * thm) list,
wenzelm@30356
    30
    weak_congs: string list,
wenzelm@30356
    31
    loopers: string list,
wenzelm@30356
    32
    unsafe_solvers: string list,
wenzelm@30356
    33
    safe_solvers: string list}
wenzelm@15023
    34
  type simproc
wenzelm@22234
    35
  val eq_simproc: simproc * simproc -> bool
wenzelm@45290
    36
  val transform_simproc: morphism -> simproc -> simproc
wenzelm@22234
    37
  val make_simproc: {name: string, lhss: cterm list,
wenzelm@22234
    38
    proc: morphism -> simpset -> cterm -> thm option, identifier: thm list} -> simproc
wenzelm@22008
    39
  val mk_simproc: string -> cterm list -> (theory -> simpset -> term -> thm option) -> simproc
wenzelm@15023
    40
  val addsimps: simpset * thm list -> simpset
wenzelm@15023
    41
  val delsimps: simpset * thm list -> simpset
wenzelm@15023
    42
  val addsimprocs: simpset * simproc list -> simpset
wenzelm@15023
    43
  val delsimprocs: simpset * simproc list -> simpset
wenzelm@17882
    44
  val setloop': simpset * (simpset -> int -> tactic) -> simpset
wenzelm@15023
    45
  val setloop: simpset * (int -> tactic) -> simpset
wenzelm@17882
    46
  val addloop': simpset * (string * (simpset -> int -> tactic)) -> simpset
wenzelm@15023
    47
  val addloop: simpset * (string * (int -> tactic)) -> simpset
wenzelm@15023
    48
  val delloop: simpset * string -> simpset
wenzelm@15023
    49
  val setSSolver: simpset * solver -> simpset
wenzelm@15023
    50
  val addSSolver: simpset * solver -> simpset
wenzelm@15023
    51
  val setSolver: simpset * solver -> simpset
wenzelm@15023
    52
  val addSolver: simpset * solver -> simpset
wenzelm@21708
    53
wenzelm@21708
    54
  val rewrite_rule: thm list -> thm -> thm
wenzelm@21708
    55
  val rewrite_goals_rule: thm list -> thm -> thm
wenzelm@21708
    56
  val rewrite_goals_tac: thm list -> tactic
wenzelm@23536
    57
  val rewrite_goal_tac: thm list -> int -> tactic
wenzelm@21708
    58
  val prune_params_tac: tactic
wenzelm@21708
    59
  val fold_rule: thm list -> thm -> thm
wenzelm@21708
    60
  val fold_goals_tac: thm list -> tactic
wenzelm@30552
    61
  val norm_hhf: thm -> thm
wenzelm@30552
    62
  val norm_hhf_protect: thm -> thm
skalberg@15006
    63
end;
skalberg@15006
    64
wenzelm@41228
    65
signature RAW_SIMPLIFIER =
berghofe@10413
    66
sig
wenzelm@41228
    67
  include BASIC_RAW_SIMPLIFIER
berghofe@10413
    68
  exception SIMPLIFIER of string * thm
wenzelm@30336
    69
  val internal_ss: simpset ->
wenzelm@30336
    70
   {rules: rrule Net.net,
wenzelm@30336
    71
    prems: thm list,
wenzelm@30336
    72
    bounds: int * ((string * typ) * string) list,
wenzelm@32738
    73
    depth: int * bool Unsynchronized.ref,
wenzelm@30336
    74
    context: Proof.context option} *
krauss@30908
    75
   {congs: (string * thm) list * string list,
wenzelm@30336
    76
    procs: proc Net.net,
wenzelm@30336
    77
    mk_rews:
wenzelm@36543
    78
     {mk: simpset -> thm -> thm list,
wenzelm@36543
    79
      mk_cong: simpset -> thm -> thm,
wenzelm@36543
    80
      mk_sym: simpset -> thm -> thm option,
wenzelm@36543
    81
      mk_eq_True: simpset -> thm -> thm option,
wenzelm@30336
    82
      reorient: theory -> term list -> term -> term -> bool},
wenzelm@30336
    83
    termless: term * term -> bool,
wenzelm@30336
    84
    subgoal_tac: simpset -> int -> tactic,
wenzelm@30336
    85
    loop_tacs: (string * (simpset -> int -> tactic)) list,
wenzelm@30336
    86
    solvers: solver list * solver list}
wenzelm@43597
    87
  val prems_of: simpset -> thm list
haftmann@27558
    88
  val add_simp: thm -> simpset -> simpset
haftmann@27558
    89
  val del_simp: thm -> simpset -> simpset
wenzelm@45620
    90
  val add_eqcong: thm -> simpset -> simpset
wenzelm@45620
    91
  val del_eqcong: thm -> simpset -> simpset
wenzelm@45620
    92
  val add_cong: thm -> simpset -> simpset
wenzelm@45620
    93
  val del_cong: thm -> simpset -> simpset
wenzelm@45625
    94
  val mksimps: simpset -> thm -> thm list
wenzelm@45625
    95
  val set_mksimps: (simpset -> thm -> thm list) -> simpset -> simpset
wenzelm@45625
    96
  val set_mkcong: (simpset -> thm -> thm) -> simpset -> simpset
wenzelm@45625
    97
  val set_mksym: (simpset -> thm -> thm option) -> simpset -> simpset
wenzelm@45625
    98
  val set_mkeqTrue: (simpset -> thm -> thm option) -> simpset -> simpset
wenzelm@45625
    99
  val set_termless: (term * term -> bool) -> simpset -> simpset
wenzelm@45625
   100
  val set_subgoaler: (simpset -> int -> tactic) -> simpset -> simpset
wenzelm@17966
   101
  val solver: simpset -> solver -> int -> tactic
wenzelm@39163
   102
  val simp_depth_limit_raw: Config.raw
wenzelm@15023
   103
  val clear_ss: simpset -> simpset
wenzelm@38715
   104
  val simproc_global_i: theory -> string -> term list
wenzelm@16458
   105
    -> (theory -> simpset -> term -> thm option) -> simproc
wenzelm@38715
   106
  val simproc_global: theory -> string -> string list
wenzelm@16458
   107
    -> (theory -> simpset -> term -> thm option) -> simproc
wenzelm@41227
   108
  val simp_trace_depth_limit_raw: Config.raw
wenzelm@41227
   109
  val simp_trace_depth_limit_default: int Unsynchronized.ref
wenzelm@41227
   110
  val simp_trace_default: bool Unsynchronized.ref
wenzelm@41227
   111
  val simp_trace_raw: Config.raw
wenzelm@41227
   112
  val simp_debug_raw: Config.raw
wenzelm@41226
   113
  val add_prems: thm list -> simpset -> simpset
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@42454
   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@46465
   126
  val generic_rewrite_goal_tac: bool * bool * bool ->
wenzelm@23536
   127
    (simpset -> tactic) -> simpset -> int -> tactic
wenzelm@23598
   128
  val rewrite: bool -> thm list -> conv
wenzelm@21708
   129
  val simplify: bool -> thm list -> thm -> thm
berghofe@10413
   130
end;
berghofe@10413
   131
wenzelm@41228
   132
structure Raw_Simplifier: RAW_SIMPLIFIER =
berghofe@10413
   133
struct
berghofe@10413
   134
wenzelm@15023
   135
(** datatype simpset **)
wenzelm@15023
   136
wenzelm@15023
   137
(* rewrite rules *)
berghofe@10413
   138
wenzelm@20546
   139
type rrule =
wenzelm@20546
   140
 {thm: thm,         (*the rewrite rule*)
wenzelm@20546
   141
  name: string,     (*name of theorem from which rewrite rule was extracted*)
wenzelm@20546
   142
  lhs: term,        (*the left-hand side*)
wenzelm@20546
   143
  elhs: cterm,      (*the etac-contracted lhs*)
wenzelm@20546
   144
  extra: bool,      (*extra variables outside of elhs*)
wenzelm@20546
   145
  fo: bool,         (*use first-order matching*)
wenzelm@20546
   146
  perm: bool};      (*the rewrite rule is permutative*)
wenzelm@15023
   147
wenzelm@20546
   148
(*
wenzelm@12603
   149
Remarks:
berghofe@10413
   150
  - elhs is used for matching,
wenzelm@15023
   151
    lhs only for preservation of bound variable names;
berghofe@10413
   152
  - fo is set iff
berghofe@10413
   153
    either elhs is first-order (no Var is applied),
wenzelm@15023
   154
      in which case fo-matching is complete,
berghofe@10413
   155
    or elhs is not a pattern,
wenzelm@20546
   156
      in which case there is nothing better to do;
wenzelm@20546
   157
*)
berghofe@10413
   158
berghofe@10413
   159
fun eq_rrule ({thm = thm1, ...}: rrule, {thm = thm2, ...}: rrule) =
wenzelm@22360
   160
  Thm.eq_thm_prop (thm1, thm2);
wenzelm@15023
   161
wenzelm@15023
   162
wenzelm@17614
   163
(* simplification sets, procedures, and solvers *)
wenzelm@15023
   164
wenzelm@15023
   165
(*A simpset contains data required during conversion:
berghofe@10413
   166
    rules: discrimination net of rewrite rules;
wenzelm@15023
   167
    prems: current premises;
berghofe@15249
   168
    bounds: maximal index of bound variables already used
wenzelm@15023
   169
      (for generating new names when rewriting under lambda abstractions);
wenzelm@22892
   170
    depth: simp_depth and exceeded flag;
berghofe@10413
   171
    congs: association list of congruence rules and
berghofe@10413
   172
           a list of `weak' congruence constants.
berghofe@10413
   173
           A congruence is `weak' if it avoids normalization of some argument.
berghofe@10413
   174
    procs: discrimination net of simplification procedures
berghofe@10413
   175
      (functions that prove rewrite rules on the fly);
wenzelm@15023
   176
    mk_rews:
wenzelm@15023
   177
      mk: turn simplification thms into rewrite rules;
wenzelm@15023
   178
      mk_cong: prepare congruence rules;
wenzelm@15023
   179
      mk_sym: turn == around;
wenzelm@15023
   180
      mk_eq_True: turn P into P == True;
wenzelm@15023
   181
    termless: relation for ordered rewriting;*)
skalberg@15011
   182
wenzelm@15023
   183
datatype simpset =
wenzelm@15023
   184
  Simpset of
wenzelm@15023
   185
   {rules: rrule Net.net,
berghofe@10413
   186
    prems: thm list,
wenzelm@17882
   187
    bounds: int * ((string * typ) * string) list,
wenzelm@32738
   188
    depth: int * bool Unsynchronized.ref,
wenzelm@20289
   189
    context: Proof.context option} *
krauss@30908
   190
   {congs: (string * thm) list * string list,
wenzelm@15023
   191
    procs: proc Net.net,
wenzelm@36543
   192
    mk_rews:
wenzelm@36543
   193
     {mk: simpset -> thm -> thm list,
wenzelm@36543
   194
      mk_cong: simpset -> thm -> thm,
wenzelm@36543
   195
      mk_sym: simpset -> thm -> thm option,
wenzelm@36543
   196
      mk_eq_True: simpset -> thm -> thm option,
wenzelm@36543
   197
      reorient: theory -> term list -> term -> term -> bool},
nipkow@11504
   198
    termless: term * term -> bool,
skalberg@15011
   199
    subgoal_tac: simpset -> int -> tactic,
wenzelm@17882
   200
    loop_tacs: (string * (simpset -> int -> tactic)) list,
wenzelm@15023
   201
    solvers: solver list * solver list}
wenzelm@15023
   202
and proc =
wenzelm@15023
   203
  Proc of
wenzelm@15023
   204
   {name: string,
wenzelm@15023
   205
    lhs: cterm,
wenzelm@22008
   206
    proc: simpset -> cterm -> thm option,
wenzelm@22234
   207
    id: stamp * thm list}
wenzelm@17614
   208
and solver =
wenzelm@17614
   209
  Solver of
wenzelm@17614
   210
   {name: string,
wenzelm@17614
   211
    solver: simpset -> int -> tactic,
wenzelm@15023
   212
    id: stamp};
wenzelm@15023
   213
wenzelm@15023
   214
wenzelm@30336
   215
fun internal_ss (Simpset args) = args;
berghofe@10413
   216
wenzelm@22892
   217
fun make_ss1 (rules, prems, bounds, depth, context) =
wenzelm@22892
   218
  {rules = rules, prems = prems, bounds = bounds, depth = depth, context = context};
wenzelm@15023
   219
wenzelm@22892
   220
fun map_ss1 f {rules, prems, bounds, depth, context} =
wenzelm@22892
   221
  make_ss1 (f (rules, prems, bounds, depth, context));
berghofe@10413
   222
wenzelm@15023
   223
fun make_ss2 (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) =
wenzelm@15023
   224
  {congs = congs, procs = procs, mk_rews = mk_rews, termless = termless,
wenzelm@15023
   225
    subgoal_tac = subgoal_tac, loop_tacs = loop_tacs, solvers = solvers};
wenzelm@15023
   226
wenzelm@15023
   227
fun map_ss2 f {congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers} =
wenzelm@15023
   228
  make_ss2 (f (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers));
wenzelm@15023
   229
wenzelm@15023
   230
fun make_simpset (args1, args2) = Simpset (make_ss1 args1, make_ss2 args2);
berghofe@10413
   231
wenzelm@15023
   232
fun map_simpset1 f (Simpset (r1, r2)) = Simpset (map_ss1 f r1, r2);
wenzelm@15023
   233
fun map_simpset2 f (Simpset (r1, r2)) = Simpset (r1, map_ss2 f r2);
wenzelm@15023
   234
wenzelm@43597
   235
fun prems_of (Simpset ({prems, ...}, _)) = prems;
wenzelm@17614
   236
wenzelm@22234
   237
fun eq_procid ((s1: stamp, ths1: thm list), (s2, ths2)) =
wenzelm@22360
   238
  s1 = s2 andalso eq_list Thm.eq_thm (ths1, ths2);
wenzelm@22234
   239
fun eq_proc (Proc {id = id1, ...}, Proc {id = id2, ...}) = eq_procid (id1, id2);
wenzelm@17614
   240
wenzelm@43596
   241
fun mk_solver name solver = Solver {name = name, solver = solver, id = stamp ()};
wenzelm@17614
   242
wenzelm@17614
   243
fun solver_name (Solver {name, ...}) = name;
wenzelm@17966
   244
fun solver ss (Solver {solver = tac, ...}) = tac ss;
wenzelm@17614
   245
fun eq_solver (Solver {id = id1, ...}, Solver {id = id2, ...}) = (id1 = id2);
wenzelm@17614
   246
wenzelm@15023
   247
wenzelm@22892
   248
(* simp depth *)
wenzelm@22892
   249
wenzelm@39163
   250
val simp_depth_limit_raw = Config.declare "simp_depth_limit" (K (Config.Int 100));
wenzelm@39163
   251
val simp_depth_limit = Config.int simp_depth_limit_raw;
wenzelm@24124
   252
boehmes@41183
   253
val simp_trace_depth_limit_default = Unsynchronized.ref 1;
boehmes@41183
   254
val simp_trace_depth_limit_raw = Config.declare "simp_trace_depth_limit"
boehmes@41183
   255
  (fn _ => Config.Int (! simp_trace_depth_limit_default));
boehmes@41183
   256
val simp_trace_depth_limit = Config.int simp_trace_depth_limit_raw;
wenzelm@22892
   257
boehmes@41183
   258
fun simp_trace_depth_limit_of NONE = ! simp_trace_depth_limit_default
boehmes@41183
   259
  | simp_trace_depth_limit_of (SOME ctxt) = Config.get ctxt simp_trace_depth_limit;
boehmes@41183
   260
boehmes@41183
   261
fun trace_depth (Simpset ({depth = (depth, exceeded), context, ...}, _)) msg =
boehmes@41183
   262
  if depth > simp_trace_depth_limit_of context then
wenzelm@40878
   263
    if ! exceeded then () else (tracing "simp_trace_depth_limit exceeded!"; exceeded := true)
wenzelm@22892
   264
  else
wenzelm@23938
   265
    (tracing (enclose "[" "]" (string_of_int depth) ^ msg); exceeded := false);
wenzelm@22892
   266
wenzelm@22892
   267
val inc_simp_depth = map_simpset1 (fn (rules, prems, bounds, (depth, exceeded), context) =>
wenzelm@22892
   268
  (rules, prems, bounds,
wenzelm@32738
   269
    (depth + 1,
boehmes@41183
   270
      if depth = simp_trace_depth_limit_of context then Unsynchronized.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@40878
   279
val simp_debug_raw = Config.declare "simp_debug" (K (Config.Bool false));
wenzelm@40878
   280
val simp_debug = Config.bool simp_debug_raw;
boehmes@35979
   281
wenzelm@40878
   282
val simp_trace_default = Unsynchronized.ref false;
wenzelm@40878
   283
val simp_trace_raw = Config.declare "simp_trace" (fn _ => Config.Bool (! simp_trace_default));
wenzelm@40878
   284
val simp_trace = Config.bool simp_trace_raw;
wenzelm@22892
   285
wenzelm@38834
   286
fun if_enabled (Simpset ({context, ...}, _)) flag f =
wenzelm@38834
   287
  (case context of
wenzelm@38834
   288
    SOME ctxt => if Config.get ctxt flag then f ctxt else ()
wenzelm@38834
   289
  | NONE => ())
wenzelm@38834
   290
wenzelm@38834
   291
fun if_visible (Simpset ({context, ...}, _)) f x =
wenzelm@38834
   292
  (case context of
wenzelm@41469
   293
    SOME ctxt => Context_Position.if_visible ctxt f x
wenzelm@38834
   294
  | NONE => ());
wenzelm@38834
   295
wenzelm@16985
   296
local
wenzelm@16985
   297
wenzelm@22892
   298
fun prnt ss warn a = if warn then warning a else trace_depth ss a;
wenzelm@16985
   299
wenzelm@16985
   300
fun show_bounds (Simpset ({bounds = (_, bs), ...}, _)) t =
wenzelm@16985
   301
  let
wenzelm@20146
   302
    val names = Term.declare_term_names t Name.context;
wenzelm@43326
   303
    val xs = rev (#1 (fold_map Name.variant (rev (map #2 bs)) names));
wenzelm@42284
   304
    fun subst (((b, T), _), x') = (Free (b, T), Syntax_Trans.mark_boundT (x', T));
wenzelm@16985
   305
  in Term.subst_atomic (ListPair.map subst (bs, xs)) t end;
wenzelm@16985
   306
boehmes@35979
   307
fun print_term ss warn a t ctxt = prnt ss warn (a () ^ "\n" ^
boehmes@35979
   308
  Syntax.string_of_term ctxt
wenzelm@40878
   309
    (if Config.get ctxt simp_debug then t else show_bounds ss t));
boehmes@35979
   310
wenzelm@17705
   311
in
wenzelm@17705
   312
boehmes@35979
   313
fun print_term_global ss warn a thy t =
wenzelm@42360
   314
  print_term ss warn (K a) t (Proof_Context.init_global thy);
wenzelm@16985
   315
wenzelm@40878
   316
fun debug warn a ss = if_enabled ss simp_debug (fn _ => prnt ss warn (a ()));
wenzelm@40878
   317
fun trace warn a ss = if_enabled ss simp_trace (fn _ => prnt ss warn (a ()));
boehmes@35979
   318
wenzelm@40878
   319
fun debug_term warn a ss t = if_enabled ss simp_debug (print_term ss warn a t);
wenzelm@40878
   320
fun trace_term warn a ss t = if_enabled ss simp_trace (print_term ss warn a t);
wenzelm@16985
   321
wenzelm@16985
   322
fun trace_cterm warn a ss ct =
wenzelm@40878
   323
  if_enabled ss simp_trace (print_term ss warn a (Thm.term_of ct));
wenzelm@16985
   324
wenzelm@16985
   325
fun trace_thm a ss th =
wenzelm@40878
   326
  if_enabled ss simp_trace (print_term ss false a (Thm.full_prop_of th));
wenzelm@16985
   327
wenzelm@16985
   328
fun trace_named_thm a ss (th, name) =
wenzelm@40878
   329
  if_enabled ss simp_trace (print_term ss false
boehmes@35979
   330
    (fn () => if name = "" then a () else a () ^ " " ^ quote name ^ ":")
boehmes@35979
   331
    (Thm.full_prop_of th));
wenzelm@16985
   332
wenzelm@22892
   333
fun warn_thm a ss th =
boehmes@35979
   334
  print_term_global ss true a (Thm.theory_of_thm th) (Thm.full_prop_of th);
wenzelm@16985
   335
wenzelm@38834
   336
fun cond_warn_thm a ss th = if_visible ss (fn () => warn_thm a ss th) ();
wenzelm@20028
   337
wenzelm@16985
   338
end;
wenzelm@16985
   339
wenzelm@16985
   340
berghofe@10413
   341
berghofe@10413
   342
(** simpset operations **)
berghofe@10413
   343
wenzelm@17882
   344
(* context *)
berghofe@10413
   345
wenzelm@17614
   346
fun eq_bound (x: string, (y, _)) = x = y;
wenzelm@17614
   347
wenzelm@22892
   348
fun add_bound bound = map_simpset1 (fn (rules, prems, (count, bounds), depth, context) =>
wenzelm@22892
   349
  (rules, prems, (count + 1, bound :: bounds), depth, context));
wenzelm@17882
   350
wenzelm@22892
   351
fun add_prems ths = map_simpset1 (fn (rules, prems, bounds, depth, context) =>
wenzelm@22892
   352
  (rules, ths @ prems, bounds, depth, context));
wenzelm@17882
   353
wenzelm@22892
   354
fun inherit_context (Simpset ({bounds, depth, context, ...}, _)) =
wenzelm@22892
   355
  map_simpset1 (fn (rules, prems, _, _, _) => (rules, prems, bounds, depth, context));
wenzelm@16985
   356
wenzelm@17882
   357
fun the_context (Simpset ({context = SOME ctxt, ...}, _)) = ctxt
wenzelm@17882
   358
  | the_context _ = raise Fail "Simplifier: no proof context in simpset";
berghofe@10413
   359
wenzelm@17897
   360
fun context ctxt =
wenzelm@22892
   361
  map_simpset1 (fn (rules, prems, bounds, depth, _) => (rules, prems, bounds, depth, SOME ctxt));
wenzelm@17882
   362
wenzelm@42360
   363
val global_context = context o Proof_Context.init_global;
wenzelm@17897
   364
wenzelm@27312
   365
fun activate_context thy ss =
wenzelm@27312
   366
  let
wenzelm@27312
   367
    val ctxt = the_context ss;
wenzelm@36545
   368
    val ctxt' = ctxt
wenzelm@42360
   369
      |> Context.raw_transfer (Theory.merge (thy, Proof_Context.theory_of ctxt))
wenzelm@36545
   370
      |> Context_Position.set_visible false;
wenzelm@27312
   371
  in context ctxt' ss end;
wenzelm@17897
   372
wenzelm@36545
   373
fun with_context ctxt f ss = inherit_context ss (f (context ctxt ss));
wenzelm@36545
   374
wenzelm@17897
   375
wenzelm@20028
   376
(* maintain simp rules *)
berghofe@10413
   377
wenzelm@20546
   378
(* FIXME: it seems that the conditions on extra variables are too liberal if
wenzelm@20546
   379
prems are nonempty: does solving the prems really guarantee instantiation of
wenzelm@20546
   380
all its Vars? Better: a dynamic check each time a rule is applied.
wenzelm@20546
   381
*)
wenzelm@20546
   382
fun rewrite_rule_extra_vars prems elhs erhs =
wenzelm@20546
   383
  let
wenzelm@20546
   384
    val elhss = elhs :: prems;
wenzelm@20546
   385
    val tvars = fold Term.add_tvars elhss [];
wenzelm@20546
   386
    val vars = fold Term.add_vars elhss [];
wenzelm@20546
   387
  in
wenzelm@20546
   388
    erhs |> Term.exists_type (Term.exists_subtype
wenzelm@20546
   389
      (fn TVar v => not (member (op =) tvars v) | _ => false)) orelse
wenzelm@20546
   390
    erhs |> Term.exists_subterm
wenzelm@20546
   391
      (fn Var v => not (member (op =) vars v) | _ => false)
wenzelm@20546
   392
  end;
wenzelm@20546
   393
wenzelm@20546
   394
fun rrule_extra_vars elhs thm =
wenzelm@20546
   395
  rewrite_rule_extra_vars [] (term_of elhs) (Thm.full_prop_of thm);
wenzelm@20546
   396
wenzelm@15023
   397
fun mk_rrule2 {thm, name, lhs, elhs, perm} =
wenzelm@15023
   398
  let
wenzelm@20546
   399
    val t = term_of elhs;
wenzelm@20546
   400
    val fo = Pattern.first_order t orelse not (Pattern.pattern t);
wenzelm@20546
   401
    val extra = rrule_extra_vars elhs thm;
wenzelm@20546
   402
  in {thm = thm, name = name, lhs = lhs, elhs = elhs, extra = extra, fo = fo, perm = perm} end;
berghofe@10413
   403
wenzelm@20028
   404
fun del_rrule (rrule as {thm, elhs, ...}) ss =
wenzelm@22892
   405
  ss |> map_simpset1 (fn (rules, prems, bounds, depth, context) =>
wenzelm@22892
   406
    (Net.delete_term eq_rrule (term_of elhs, rrule) rules, prems, bounds, depth, context))
wenzelm@20028
   407
  handle Net.DELETE => (cond_warn_thm "Rewrite rule not in simpset:" ss thm; ss);
wenzelm@20028
   408
wenzelm@32797
   409
fun insert_rrule (rrule as {thm, name, ...}) ss =
wenzelm@22254
   410
 (trace_named_thm (fn () => "Adding rewrite rule") ss (thm, name);
wenzelm@22892
   411
  ss |> map_simpset1 (fn (rules, prems, bounds, depth, context) =>
wenzelm@15023
   412
    let
wenzelm@15023
   413
      val rrule2 as {elhs, ...} = mk_rrule2 rrule;
wenzelm@16807
   414
      val rules' = Net.insert_term eq_rrule (term_of elhs, rrule2) rules;
wenzelm@22892
   415
    in (rules', prems, bounds, depth, context) end)
wenzelm@20028
   416
  handle Net.INSERT => (cond_warn_thm "Ignoring duplicate rewrite rule:" ss thm; ss));
berghofe@10413
   417
berghofe@10413
   418
fun vperm (Var _, Var _) = true
berghofe@10413
   419
  | vperm (Abs (_, _, s), Abs (_, _, t)) = vperm (s, t)
berghofe@10413
   420
  | vperm (t1 $ t2, u1 $ u2) = vperm (t1, u1) andalso vperm (t2, u2)
berghofe@10413
   421
  | vperm (t, u) = (t = u);
berghofe@10413
   422
berghofe@10413
   423
fun var_perm (t, u) =
haftmann@33038
   424
  vperm (t, u) andalso eq_set (op =) (Term.add_vars t [], Term.add_vars u []);
berghofe@10413
   425
wenzelm@15023
   426
(*simple test for looping rewrite rules and stupid orientations*)
wenzelm@18208
   427
fun default_reorient thy prems lhs rhs =
wenzelm@15023
   428
  rewrite_rule_extra_vars prems lhs rhs
wenzelm@15023
   429
    orelse
wenzelm@15023
   430
  is_Var (head_of lhs)
wenzelm@15023
   431
    orelse
nipkow@16305
   432
(* turns t = x around, which causes a headache if x is a local variable -
nipkow@16305
   433
   usually it is very useful :-(
nipkow@16305
   434
  is_Free rhs andalso not(is_Free lhs) andalso not(Logic.occs(rhs,lhs))
nipkow@16305
   435
  andalso not(exists_subterm is_Var lhs)
nipkow@16305
   436
    orelse
nipkow@16305
   437
*)
wenzelm@16842
   438
  exists (fn t => Logic.occs (lhs, t)) (rhs :: prems)
wenzelm@15023
   439
    orelse
wenzelm@17203
   440
  null prems andalso Pattern.matches thy (lhs, rhs)
berghofe@10413
   441
    (*the condition "null prems" is necessary because conditional rewrites
berghofe@10413
   442
      with extra variables in the conditions may terminate although
wenzelm@15023
   443
      the rhs is an instance of the lhs; example: ?m < ?n ==> f(?n) == f(?m)*)
wenzelm@15023
   444
    orelse
wenzelm@15023
   445
  is_Const lhs andalso not (is_Const rhs);
berghofe@10413
   446
berghofe@10413
   447
fun decomp_simp thm =
wenzelm@15023
   448
  let
wenzelm@26626
   449
    val thy = Thm.theory_of_thm thm;
wenzelm@26626
   450
    val prop = Thm.prop_of thm;
wenzelm@15023
   451
    val prems = Logic.strip_imp_prems prop;
wenzelm@15023
   452
    val concl = Drule.strip_imp_concl (Thm.cprop_of thm);
wenzelm@22902
   453
    val (lhs, rhs) = Thm.dest_equals concl handle TERM _ =>
wenzelm@15023
   454
      raise SIMPLIFIER ("Rewrite rule not a meta-equality", thm);
wenzelm@20579
   455
    val elhs = Thm.dest_arg (Thm.cprop_of (Thm.eta_conversion lhs));
wenzelm@18929
   456
    val erhs = Envir.eta_contract (term_of rhs);
wenzelm@15023
   457
    val perm =
wenzelm@15023
   458
      var_perm (term_of elhs, erhs) andalso
wenzelm@15023
   459
      not (term_of elhs aconv erhs) andalso
wenzelm@15023
   460
      not (is_Var (term_of elhs));
wenzelm@16458
   461
  in (thy, prems, term_of lhs, elhs, term_of rhs, perm) end;
berghofe@10413
   462
wenzelm@12783
   463
fun decomp_simp' thm =
wenzelm@12979
   464
  let val (_, _, lhs, _, rhs, _) = decomp_simp thm in
wenzelm@12783
   465
    if Thm.nprems_of thm > 0 then raise SIMPLIFIER ("Bad conditional rewrite rule", thm)
wenzelm@12979
   466
    else (lhs, rhs)
wenzelm@12783
   467
  end;
wenzelm@12783
   468
wenzelm@36543
   469
fun mk_eq_True (ss as Simpset (_, {mk_rews = {mk_eq_True, ...}, ...})) (thm, name) =
wenzelm@36543
   470
  (case mk_eq_True ss thm of
skalberg@15531
   471
    NONE => []
skalberg@15531
   472
  | SOME eq_True =>
wenzelm@20546
   473
      let
wenzelm@20546
   474
        val (_, _, lhs, elhs, _, _) = decomp_simp eq_True;
wenzelm@15023
   475
      in [{thm = eq_True, name = name, lhs = lhs, elhs = elhs, perm = false}] end);
berghofe@10413
   476
wenzelm@15023
   477
(*create the rewrite rule and possibly also the eq_True variant,
wenzelm@15023
   478
  in case there are extra vars on the rhs*)
wenzelm@15023
   479
fun rrule_eq_True (thm, name, lhs, elhs, rhs, ss, thm2) =
wenzelm@15023
   480
  let val rrule = {thm = thm, name = name, lhs = lhs, elhs = elhs, perm = false} in
wenzelm@20546
   481
    if rewrite_rule_extra_vars [] lhs rhs then
wenzelm@20546
   482
      mk_eq_True ss (thm2, name) @ [rrule]
wenzelm@20546
   483
    else [rrule]
berghofe@10413
   484
  end;
berghofe@10413
   485
wenzelm@15023
   486
fun mk_rrule ss (thm, name) =
wenzelm@15023
   487
  let val (_, prems, lhs, elhs, rhs, perm) = decomp_simp thm in
wenzelm@15023
   488
    if perm then [{thm = thm, name = name, lhs = lhs, elhs = elhs, perm = true}]
wenzelm@15023
   489
    else
wenzelm@15023
   490
      (*weak test for loops*)
wenzelm@15023
   491
      if rewrite_rule_extra_vars prems lhs rhs orelse is_Var (term_of elhs)
wenzelm@15023
   492
      then mk_eq_True ss (thm, name)
wenzelm@15023
   493
      else rrule_eq_True (thm, name, lhs, elhs, rhs, ss, thm)
berghofe@10413
   494
  end;
berghofe@10413
   495
wenzelm@15023
   496
fun orient_rrule ss (thm, name) =
wenzelm@18208
   497
  let
wenzelm@18208
   498
    val (thy, prems, lhs, elhs, rhs, perm) = decomp_simp thm;
wenzelm@18208
   499
    val Simpset (_, {mk_rews = {reorient, mk_sym, ...}, ...}) = ss;
wenzelm@18208
   500
  in
wenzelm@15023
   501
    if perm then [{thm = thm, name = name, lhs = lhs, elhs = elhs, perm = true}]
wenzelm@16458
   502
    else if reorient thy prems lhs rhs then
wenzelm@16458
   503
      if reorient thy prems rhs lhs
wenzelm@15023
   504
      then mk_eq_True ss (thm, name)
wenzelm@15023
   505
      else
wenzelm@36543
   506
        (case mk_sym ss thm of
wenzelm@18208
   507
          NONE => []
wenzelm@18208
   508
        | SOME thm' =>
wenzelm@18208
   509
            let val (_, _, lhs', elhs', rhs', _) = decomp_simp thm'
wenzelm@18208
   510
            in rrule_eq_True (thm', name, lhs', elhs', rhs', ss, thm) end)
wenzelm@15023
   511
    else rrule_eq_True (thm, name, lhs, elhs, rhs, ss, thm)
berghofe@10413
   512
  end;
berghofe@10413
   513
wenzelm@36543
   514
fun extract_rews (ss as Simpset (_, {mk_rews = {mk, ...}, ...}), thms) =
wenzelm@36543
   515
  maps (fn thm => map (rpair (Thm.get_name_hint thm)) (mk ss thm)) thms;
berghofe@10413
   516
wenzelm@15023
   517
fun extract_safe_rrules (ss, thm) =
wenzelm@19482
   518
  maps (orient_rrule ss) (extract_rews (ss, [thm]));
berghofe@10413
   519
berghofe@10413
   520
wenzelm@20028
   521
(* add/del rules explicitly *)
berghofe@10413
   522
wenzelm@20028
   523
fun comb_simps comb mk_rrule (ss, thms) =
wenzelm@20028
   524
  let
wenzelm@20028
   525
    val rews = extract_rews (ss, thms);
wenzelm@20028
   526
  in fold (fold comb o mk_rrule) rews ss end;
berghofe@10413
   527
wenzelm@20028
   528
fun ss addsimps thms =
wenzelm@20028
   529
  comb_simps insert_rrule (mk_rrule ss) (ss, thms);
berghofe@10413
   530
wenzelm@15023
   531
fun ss delsimps thms =
wenzelm@20028
   532
  comb_simps del_rrule (map mk_rrule2 o mk_rrule ss) (ss, thms);
wenzelm@15023
   533
haftmann@27558
   534
fun add_simp thm ss = ss addsimps [thm];
haftmann@27558
   535
fun del_simp thm ss = ss delsimps [thm];
wenzelm@15023
   536
wenzelm@30318
   537
wenzelm@15023
   538
(* congs *)
berghofe@10413
   539
skalberg@15531
   540
fun cong_name (Const (a, _)) = SOME a
skalberg@15531
   541
  | cong_name (Free (a, _)) = SOME ("Free: " ^ a)
skalberg@15531
   542
  | cong_name _ = NONE;
ballarin@13835
   543
wenzelm@15023
   544
local
wenzelm@15023
   545
wenzelm@15023
   546
fun is_full_cong_prems [] [] = true
wenzelm@15023
   547
  | is_full_cong_prems [] _ = false
wenzelm@15023
   548
  | is_full_cong_prems (p :: prems) varpairs =
wenzelm@15023
   549
      (case Logic.strip_assums_concl p of
wenzelm@15023
   550
        Const ("==", _) $ lhs $ rhs =>
wenzelm@15023
   551
          let val (x, xs) = strip_comb lhs and (y, ys) = strip_comb rhs in
wenzelm@15023
   552
            is_Var x andalso forall is_Bound xs andalso
haftmann@20972
   553
            not (has_duplicates (op =) xs) andalso xs = ys andalso
wenzelm@20671
   554
            member (op =) varpairs (x, y) andalso
wenzelm@19303
   555
            is_full_cong_prems prems (remove (op =) (x, y) varpairs)
wenzelm@15023
   556
          end
wenzelm@15023
   557
      | _ => false);
wenzelm@15023
   558
wenzelm@15023
   559
fun is_full_cong thm =
berghofe@10413
   560
  let
wenzelm@43597
   561
    val prems = Thm.prems_of thm and concl = Thm.concl_of thm;
wenzelm@15023
   562
    val (lhs, rhs) = Logic.dest_equals concl;
wenzelm@15023
   563
    val (f, xs) = strip_comb lhs and (g, ys) = strip_comb rhs;
berghofe@10413
   564
  in
haftmann@20972
   565
    f = g andalso not (has_duplicates (op =) (xs @ ys)) andalso length xs = length ys andalso
wenzelm@15023
   566
    is_full_cong_prems prems (xs ~~ ys)
berghofe@10413
   567
  end;
berghofe@10413
   568
wenzelm@45620
   569
fun mk_cong (ss as Simpset (_, {mk_rews = {mk_cong = f, ...}, ...})) = f ss;
wenzelm@45620
   570
wenzelm@45620
   571
in
wenzelm@45620
   572
wenzelm@45620
   573
fun add_eqcong thm ss = ss |>
wenzelm@15023
   574
  map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) =>
wenzelm@15023
   575
    let
wenzelm@45621
   576
      val (lhs, _) = Logic.dest_equals (Thm.concl_of thm)
wenzelm@15023
   577
        handle TERM _ => raise SIMPLIFIER ("Congruence not a meta-equality", thm);
wenzelm@18929
   578
    (*val lhs = Envir.eta_contract lhs;*)
wenzelm@45621
   579
      val a = the (cong_name (head_of lhs)) handle Option.Option =>
wenzelm@15023
   580
        raise SIMPLIFIER ("Congruence must start with a constant or free variable", thm);
haftmann@22221
   581
      val (xs, weak) = congs;
wenzelm@38834
   582
      val _ =
wenzelm@38834
   583
        if AList.defined (op =) xs a
wenzelm@38834
   584
        then if_visible ss warning ("Overwriting congruence rule for " ^ quote a)
haftmann@22221
   585
        else ();
krauss@30908
   586
      val xs' = AList.update (op =) (a, thm) xs;
haftmann@22221
   587
      val weak' = if is_full_cong thm then weak else a :: weak;
haftmann@22221
   588
    in ((xs', weak'), procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) end);
berghofe@10413
   589
wenzelm@45620
   590
fun del_eqcong thm ss = ss |>
wenzelm@15023
   591
  map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) =>
wenzelm@15023
   592
    let
wenzelm@45621
   593
      val (lhs, _) = Logic.dest_equals (Thm.concl_of thm)
wenzelm@45621
   594
        handle TERM _ => raise SIMPLIFIER ("Congruence not a meta-equality", thm);
wenzelm@18929
   595
    (*val lhs = Envir.eta_contract lhs;*)
wenzelm@20057
   596
      val a = the (cong_name (head_of lhs)) handle Option.Option =>
wenzelm@15023
   597
        raise SIMPLIFIER ("Congruence must start with a constant", thm);
haftmann@22221
   598
      val (xs, _) = congs;
haftmann@22221
   599
      val xs' = filter_out (fn (x : string, _) => x = a) xs;
krauss@30908
   600
      val weak' = xs' |> map_filter (fn (a, thm) =>
skalberg@15531
   601
        if is_full_cong thm then NONE else SOME a);
haftmann@22221
   602
    in ((xs', weak'), procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) end);
berghofe@10413
   603
wenzelm@45620
   604
fun add_cong thm ss = add_eqcong (mk_cong ss thm) ss;
wenzelm@45620
   605
fun del_cong thm ss = del_eqcong (mk_cong ss thm) ss;
wenzelm@15023
   606
wenzelm@15023
   607
end;
berghofe@10413
   608
berghofe@10413
   609
wenzelm@15023
   610
(* simprocs *)
wenzelm@15023
   611
wenzelm@22234
   612
datatype simproc =
wenzelm@22234
   613
  Simproc of
wenzelm@22234
   614
    {name: string,
wenzelm@22234
   615
     lhss: cterm list,
wenzelm@22234
   616
     proc: morphism -> simpset -> cterm -> thm option,
wenzelm@22234
   617
     id: stamp * thm list};
wenzelm@22234
   618
wenzelm@22234
   619
fun eq_simproc (Simproc {id = id1, ...}, Simproc {id = id2, ...}) = eq_procid (id1, id2);
wenzelm@22008
   620
wenzelm@45290
   621
fun transform_simproc phi (Simproc {name, lhss, proc, id = (s, ths)}) =
wenzelm@22234
   622
  Simproc
wenzelm@22234
   623
   {name = name,
wenzelm@22234
   624
    lhss = map (Morphism.cterm phi) lhss,
wenzelm@22669
   625
    proc = Morphism.transform phi proc,
wenzelm@22234
   626
    id = (s, Morphism.fact phi ths)};
wenzelm@22234
   627
wenzelm@22234
   628
fun make_simproc {name, lhss, proc, identifier} =
wenzelm@22234
   629
  Simproc {name = name, lhss = lhss, proc = proc, id = (stamp (), identifier)};
wenzelm@22008
   630
wenzelm@22008
   631
fun mk_simproc name lhss proc =
wenzelm@22234
   632
  make_simproc {name = name, lhss = lhss, proc = fn _ => fn ss => fn ct =>
wenzelm@42360
   633
    proc (Proof_Context.theory_of (the_context ss)) ss (Thm.term_of ct), identifier = []};
wenzelm@22008
   634
wenzelm@35845
   635
(* FIXME avoid global thy and Logic.varify_global *)
wenzelm@38715
   636
fun simproc_global_i thy name = mk_simproc name o map (Thm.cterm_of thy o Logic.varify_global);
wenzelm@38715
   637
fun simproc_global thy name = simproc_global_i thy name o map (Syntax.read_term_global thy);
wenzelm@22008
   638
wenzelm@22008
   639
wenzelm@15023
   640
local
berghofe@10413
   641
wenzelm@16985
   642
fun add_proc (proc as Proc {name, lhs, ...}) ss =
wenzelm@22254
   643
 (trace_cterm false (fn () => "Adding simplification procedure " ^ quote name ^ " for") ss lhs;
wenzelm@15023
   644
  map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) =>
wenzelm@16807
   645
    (congs, Net.insert_term eq_proc (term_of lhs, proc) procs,
wenzelm@15023
   646
      mk_rews, termless, subgoal_tac, loop_tacs, solvers)) ss
wenzelm@15023
   647
  handle Net.INSERT =>
wenzelm@38834
   648
    (if_visible ss warning ("Ignoring duplicate simplification procedure " ^ quote name); ss));
berghofe@10413
   649
wenzelm@16985
   650
fun del_proc (proc as Proc {name, lhs, ...}) ss =
wenzelm@15023
   651
  map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) =>
wenzelm@16807
   652
    (congs, Net.delete_term eq_proc (term_of lhs, proc) procs,
wenzelm@15023
   653
      mk_rews, termless, subgoal_tac, loop_tacs, solvers)) ss
wenzelm@15023
   654
  handle Net.DELETE =>
wenzelm@38834
   655
    (if_visible ss warning ("Simplification procedure " ^ quote name ^ " not in simpset"); ss);
berghofe@10413
   656
wenzelm@22234
   657
fun prep_procs (Simproc {name, lhss, proc, id}) =
wenzelm@22669
   658
  lhss |> map (fn lhs => Proc {name = name, lhs = lhs, proc = Morphism.form proc, id = id});
wenzelm@22234
   659
wenzelm@15023
   660
in
berghofe@10413
   661
wenzelm@22234
   662
fun ss addsimprocs ps = fold (fold add_proc o prep_procs) ps ss;
wenzelm@22234
   663
fun ss delsimprocs ps = fold (fold del_proc o prep_procs) ps ss;
berghofe@10413
   664
wenzelm@15023
   665
end;
berghofe@10413
   666
berghofe@10413
   667
berghofe@10413
   668
(* mk_rews *)
berghofe@10413
   669
wenzelm@15023
   670
local
wenzelm@15023
   671
wenzelm@18208
   672
fun map_mk_rews f = map_simpset2 (fn (congs, procs, {mk, mk_cong, mk_sym, mk_eq_True, reorient},
wenzelm@15023
   673
      termless, subgoal_tac, loop_tacs, solvers) =>
wenzelm@18208
   674
  let
wenzelm@18208
   675
    val (mk', mk_cong', mk_sym', mk_eq_True', reorient') =
wenzelm@18208
   676
      f (mk, mk_cong, mk_sym, mk_eq_True, reorient);
wenzelm@18208
   677
    val mk_rews' = {mk = mk', mk_cong = mk_cong', mk_sym = mk_sym', mk_eq_True = mk_eq_True',
wenzelm@18208
   678
      reorient = reorient'};
wenzelm@18208
   679
  in (congs, procs, mk_rews', termless, subgoal_tac, loop_tacs, solvers) end);
wenzelm@15023
   680
wenzelm@15023
   681
in
berghofe@10413
   682
wenzelm@36543
   683
fun mksimps (ss as Simpset (_, {mk_rews = {mk, ...}, ...})) = mk ss;
wenzelm@30318
   684
wenzelm@45625
   685
fun set_mksimps mk = map_mk_rews (fn (_, mk_cong, mk_sym, mk_eq_True, reorient) =>
wenzelm@18208
   686
  (mk, mk_cong, mk_sym, mk_eq_True, reorient));
wenzelm@15023
   687
wenzelm@45625
   688
fun set_mkcong mk_cong = map_mk_rews (fn (mk, _, mk_sym, mk_eq_True, reorient) =>
wenzelm@18208
   689
  (mk, mk_cong, mk_sym, mk_eq_True, reorient));
berghofe@10413
   690
wenzelm@45625
   691
fun set_mksym mk_sym = map_mk_rews (fn (mk, mk_cong, _, mk_eq_True, reorient) =>
wenzelm@18208
   692
  (mk, mk_cong, mk_sym, mk_eq_True, reorient));
berghofe@10413
   693
wenzelm@45625
   694
fun set_mkeqTrue mk_eq_True = map_mk_rews (fn (mk, mk_cong, mk_sym, _, reorient) =>
wenzelm@18208
   695
  (mk, mk_cong, mk_sym, mk_eq_True, reorient));
wenzelm@18208
   696
wenzelm@18208
   697
fun set_reorient reorient = map_mk_rews (fn (mk, mk_cong, mk_sym, mk_eq_True, _) =>
wenzelm@18208
   698
  (mk, mk_cong, mk_sym, mk_eq_True, reorient));
wenzelm@15023
   699
wenzelm@15023
   700
end;
wenzelm@15023
   701
skalberg@14242
   702
berghofe@10413
   703
(* termless *)
berghofe@10413
   704
wenzelm@45625
   705
fun set_termless termless =
wenzelm@15023
   706
  map_simpset2 (fn (congs, procs, mk_rews, _, subgoal_tac, loop_tacs, solvers) =>
wenzelm@15023
   707
   (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers));
skalberg@15006
   708
skalberg@15006
   709
wenzelm@15023
   710
(* tactics *)
skalberg@15006
   711
wenzelm@45625
   712
fun set_subgoaler subgoal_tac =
wenzelm@15023
   713
  map_simpset2 (fn (congs, procs, mk_rews, termless, _, loop_tacs, solvers) =>
wenzelm@15023
   714
   (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers));
skalberg@15006
   715
wenzelm@17882
   716
fun ss setloop' tac = ss |>
wenzelm@15023
   717
  map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, _, solvers) =>
wenzelm@15023
   718
   (congs, procs, mk_rews, termless, subgoal_tac, [("", tac)], solvers));
skalberg@15006
   719
wenzelm@17882
   720
fun ss setloop tac = ss setloop' (K tac);
wenzelm@17882
   721
wenzelm@17882
   722
fun ss addloop' (name, tac) = ss |>
wenzelm@15023
   723
  map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) =>
wenzelm@15023
   724
    (congs, procs, mk_rews, termless, subgoal_tac,
wenzelm@38834
   725
     (if AList.defined (op =) loop_tacs name
wenzelm@38834
   726
      then if_visible ss warning ("Overwriting looper " ^ quote name)
wenzelm@38834
   727
      else (); AList.update (op =) (name, tac) loop_tacs), solvers));
skalberg@15006
   728
wenzelm@17882
   729
fun ss addloop (name, tac) = ss addloop' (name, K tac);
wenzelm@17882
   730
wenzelm@15023
   731
fun ss delloop name = ss |>
wenzelm@15023
   732
  map_simpset2 (fn (congs, procs, mk_rews, termless, subgoal_tac, loop_tacs, solvers) =>
haftmann@21286
   733
    (congs, procs, mk_rews, termless, subgoal_tac,
wenzelm@38834
   734
     (if AList.defined (op =) loop_tacs name then ()
wenzelm@38834
   735
      else if_visible ss warning ("No such looper in simpset: " ^ quote name);
wenzelm@38834
   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
wenzelm@36944
   835
    val thm'' = Thm.transitive thm thm' handle THM _ =>
wenzelm@36944
   836
     Thm.transitive thm (Thm.transitive
wenzelm@36944
   837
       (Thm.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@38834
   854
    then (cond_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';
wenzelm@38834
   925
              let
wenzelm@38834
   926
                val lr = Logic.dest_equals prop;
wenzelm@38834
   927
                val SOME thm'' = check_conv false ss eta_thm thm';
skalberg@15531
   928
              in SOME (thm'', uncond_skel (congs, lr)) end)
berghofe@10413
   929
           else
wenzelm@22254
   930
             (trace_thm (fn () => "Trying to rewrite:") ss thm';
wenzelm@24124
   931
              if simp_depth ss > Config.get ctxt simp_depth_limit
wenzelm@38834
   932
              then
wenzelm@38834
   933
                let
wenzelm@38834
   934
                  val s = "simp_depth_limit exceeded - giving up";
wenzelm@38834
   935
                  val _ = trace false (fn () => s) ss;
wenzelm@38834
   936
                  val _ = if_visible ss warning s;
wenzelm@38834
   937
                in NONE end
nipkow@16042
   938
              else
nipkow@16042
   939
              case prover ss thm' of
wenzelm@22254
   940
                NONE => (trace_thm (fn () => "FAILED") ss thm'; NONE)
skalberg@15531
   941
              | SOME thm2 =>
wenzelm@16985
   942
                  (case check_conv true ss eta_thm thm2 of
skalberg@15531
   943
                     NONE => NONE |
skalberg@15531
   944
                     SOME thm2' =>
berghofe@10413
   945
                       let val concl = Logic.strip_imp_concl prop
berghofe@10413
   946
                           val lr = Logic.dest_equals concl
nipkow@16042
   947
                       in SOME (thm2', cond_skel (congs, lr)) end)))
berghofe@10413
   948
      end
berghofe@10413
   949
skalberg@15531
   950
    fun rews [] = NONE
berghofe@10413
   951
      | rews (rrule :: rrules) =
skalberg@15531
   952
          let val opt = rew rrule handle Pattern.MATCH => NONE
skalberg@15531
   953
          in case opt of NONE => rews rrules | some => some end;
berghofe@10413
   954
wenzelm@38834
   955
    fun sort_rrules rrs =
wenzelm@38834
   956
      let
wenzelm@38834
   957
        fun is_simple ({thm, ...}: rrule) =
wenzelm@38834
   958
          (case Thm.prop_of thm of
wenzelm@38834
   959
            Const ("==", _) $ _ $ _ => true
wenzelm@38834
   960
          | _ => false);
wenzelm@38834
   961
        fun sort [] (re1, re2) = re1 @ re2
wenzelm@38834
   962
          | sort (rr :: rrs) (re1, re2) =
wenzelm@38834
   963
              if is_simple rr
wenzelm@38834
   964
              then sort rrs (rr :: re1, re2)
wenzelm@38834
   965
              else sort rrs (re1, rr :: re2);
wenzelm@38834
   966
      in sort rrs ([], []) end;
berghofe@10413
   967
skalberg@15531
   968
    fun proc_rews [] = NONE
wenzelm@15023
   969
      | proc_rews (Proc {name, proc, lhs, ...} :: ps) =
wenzelm@17203
   970
          if Pattern.matches thyt (Thm.term_of lhs, Thm.term_of t) then
boehmes@35979
   971
            (debug_term false (fn () => "Trying procedure " ^ quote name ^ " on:") ss eta_t;
wenzelm@23938
   972
             case proc ss eta_t' of
wenzelm@22892
   973
               NONE => (debug false (fn () => "FAILED") ss; proc_rews ps)
skalberg@15531
   974
             | SOME raw_thm =>
wenzelm@22254
   975
                 (trace_thm (fn () => "Procedure " ^ quote name ^ " produced rewrite rule:")
wenzelm@22254
   976
                   ss raw_thm;
wenzelm@16985
   977
                  (case rews (mk_procrule ss raw_thm) of
wenzelm@22254
   978
                    NONE => (trace_cterm true (fn () => "IGNORED result of simproc " ^ quote name ^
wenzelm@16985
   979
                      " -- does not match") ss t; proc_rews ps)
berghofe@10413
   980
                  | some => some)))
berghofe@10413
   981
          else proc_rews ps;
wenzelm@38834
   982
  in
wenzelm@38834
   983
    (case eta_t of
wenzelm@38834
   984
      Abs _ $ _ => SOME (Thm.transitive eta_thm (Thm.beta_conversion false eta_t'), skel0)
wenzelm@38834
   985
    | _ =>
wenzelm@38834
   986
      (case rews (sort_rrules (Net.match_term rules eta_t)) of
wenzelm@38834
   987
        NONE => proc_rews (Net.match_term procs eta_t)
wenzelm@38834
   988
      | some => some))
berghofe@10413
   989
  end;
berghofe@10413
   990
berghofe@10413
   991
berghofe@10413
   992
(* conversion to apply a congruence rule to a term *)
berghofe@10413
   993
krauss@30908
   994
fun congc prover ss maxt cong t =
wenzelm@22902
   995
  let val rthm = Thm.incr_indexes (maxt + 1) cong;
wenzelm@22902
   996
      val rlhs = fst (Thm.dest_equals (Drule.strip_imp_concl (cprop_of rthm)));
wenzelm@22902
   997
      val insts = Thm.match (rlhs, t)
wenzelm@22902
   998
      (* Thm.match can raise Pattern.MATCH;
berghofe@10413
   999
         is handled when congc is called *)
berghofe@10413
  1000
      val thm' = Thm.instantiate insts (Thm.rename_boundvars (term_of rlhs) (term_of t) rthm);
wenzelm@32797
  1001
      val _ = trace_thm (fn () => "Applying congruence rule:") ss thm';
wenzelm@22254
  1002
      fun err (msg, thm) = (trace_thm (fn () => msg) ss thm; NONE)
wenzelm@38834
  1003
  in
wenzelm@38834
  1004
    (case prover thm' of
wenzelm@38834
  1005
      NONE => err ("Congruence proof failed.  Could not prove", thm')
wenzelm@38834
  1006
    | SOME thm2 =>
wenzelm@38834
  1007
        (case check_conv true ss (Drule.beta_eta_conversion t) thm2 of
skalberg@15531
  1008
          NONE => err ("Congruence proof failed.  Should not have proved", thm2)
skalberg@15531
  1009
        | SOME thm2' =>
wenzelm@22902
  1010
            if op aconv (pairself term_of (Thm.dest_equals (cprop_of thm2')))
wenzelm@38834
  1011
            then NONE else SOME thm2'))
berghofe@10413
  1012
  end;
berghofe@10413
  1013
berghofe@10413
  1014
val (cA, (cB, cC)) =
wenzelm@22902
  1015
  apsnd Thm.dest_equals (Thm.dest_implies (hd (cprems_of Drule.imp_cong)));
berghofe@10413
  1016
skalberg@15531
  1017
fun transitive1 NONE NONE = NONE
skalberg@15531
  1018
  | transitive1 (SOME thm1) NONE = SOME thm1
skalberg@15531
  1019
  | transitive1 NONE (SOME thm2) = SOME thm2
wenzelm@36944
  1020
  | transitive1 (SOME thm1) (SOME thm2) = SOME (Thm.transitive thm1 thm2)
berghofe@10413
  1021
skalberg@15531
  1022
fun transitive2 thm = transitive1 (SOME thm);
skalberg@15531
  1023
fun transitive3 thm = transitive1 thm o SOME;
berghofe@13607
  1024
wenzelm@16458
  1025
fun bottomc ((simprem, useprem, mutsimp), prover, thy, maxidx) =
berghofe@10413
  1026
  let
wenzelm@15023
  1027
    fun botc skel ss t =
skalberg@15531
  1028
          if is_Var skel then NONE
berghofe@10413
  1029
          else
wenzelm@15023
  1030
          (case subc skel ss t of
skalberg@15531
  1031
             some as SOME thm1 =>
wenzelm@22902
  1032
               (case rewritec (prover, thy, maxidx) ss (Thm.rhs_of thm1) of
skalberg@15531
  1033
                  SOME (thm2, skel2) =>
wenzelm@36944
  1034
                    transitive2 (Thm.transitive thm1 thm2)
wenzelm@22902
  1035
                      (botc skel2 ss (Thm.rhs_of thm2))
skalberg@15531
  1036
                | NONE => some)
skalberg@15531
  1037
           | NONE =>
wenzelm@16458
  1038
               (case rewritec (prover, thy, maxidx) ss t of
skalberg@15531
  1039
                  SOME (thm2, skel2) => transitive2 thm2
wenzelm@22902
  1040
                    (botc skel2 ss (Thm.rhs_of thm2))
skalberg@15531
  1041
                | NONE => NONE))
berghofe@10413
  1042
wenzelm@15023
  1043
    and try_botc ss t =
wenzelm@15023
  1044
          (case botc skel0 ss t of
wenzelm@36944
  1045
             SOME trec1 => trec1 | NONE => (Thm.reflexive t))
berghofe@10413
  1046
wenzelm@15023
  1047
    and subc skel (ss as Simpset ({bounds, ...}, {congs, ...})) t0 =
berghofe@10413
  1048
       (case term_of t0 of
wenzelm@32797
  1049
           Abs (a, T, _) =>
wenzelm@15023
  1050
             let
wenzelm@20079
  1051
                 val b = Name.bound (#1 bounds);
wenzelm@16985
  1052
                 val (v, t') = Thm.dest_abs (SOME b) t0;
wenzelm@16985
  1053
                 val b' = #1 (Term.dest_Free (Thm.term_of v));
wenzelm@21962
  1054
                 val _ =
wenzelm@21962
  1055
                   if b <> b' then
wenzelm@35231
  1056
                     warning ("Simplifier: renamed bound variable " ^
wenzelm@35231
  1057
                       quote b ^ " to " ^ quote b' ^ Position.str_of (Position.thread_data ()))
wenzelm@21962
  1058
                   else ();
wenzelm@17614
  1059
                 val ss' = add_bound ((b', T), a) ss;
wenzelm@15023
  1060
                 val skel' = case skel of Abs (_, _, sk) => sk | _ => skel0;
wenzelm@15023
  1061
             in case botc skel' ss' t' of
wenzelm@36944
  1062
                  SOME thm => SOME (Thm.abstract_rule a v thm)
skalberg@15531
  1063
                | NONE => NONE
berghofe@10413
  1064
             end
berghofe@10413
  1065
         | t $ _ => (case t of
wenzelm@15023
  1066
             Const ("==>", _) $ _  => impc t0 ss
berghofe@10413
  1067
           | Abs _ =>
wenzelm@36944
  1068
               let val thm = Thm.beta_conversion false t0
wenzelm@22902
  1069
               in case subc skel0 ss (Thm.rhs_of thm) of
skalberg@15531
  1070
                    NONE => SOME thm
wenzelm@36944
  1071
                  | SOME thm' => SOME (Thm.transitive thm thm')
berghofe@10413
  1072
               end
berghofe@10413
  1073
           | _  =>
berghofe@10413
  1074
               let fun appc () =
berghofe@10413
  1075
                     let
berghofe@10413
  1076
                       val (tskel, uskel) = case skel of
berghofe@10413
  1077
                           tskel $ uskel => (tskel, uskel)
berghofe@10413
  1078
                         | _ => (skel0, skel0);
wenzelm@10767
  1079
                       val (ct, cu) = Thm.dest_comb t0
berghofe@10413
  1080
                     in
wenzelm@15023
  1081
                     (case botc tskel ss ct of
skalberg@15531
  1082
                        SOME thm1 =>
wenzelm@15023
  1083
                          (case botc uskel ss cu of
wenzelm@36944
  1084
                             SOME thm2 => SOME (Thm.combination thm1 thm2)
wenzelm@36944
  1085
                           | NONE => SOME (Thm.combination thm1 (Thm.reflexive cu)))
skalberg@15531
  1086
                      | NONE =>
wenzelm@15023
  1087
                          (case botc uskel ss cu of
wenzelm@36944
  1088
                             SOME thm1 => SOME (Thm.combination (Thm.reflexive ct) thm1)
skalberg@15531
  1089
                           | NONE => NONE))
berghofe@10413
  1090
                     end
berghofe@10413
  1091
                   val (h, ts) = strip_comb t
ballarin@13835
  1092
               in case cong_name h of
skalberg@15531
  1093
                    SOME a =>
haftmann@17232
  1094
                      (case AList.lookup (op =) (fst congs) a of
skalberg@15531
  1095
                         NONE => appc ()
skalberg@15531
  1096
                       | SOME cong =>
wenzelm@15023
  1097
  (*post processing: some partial applications h t1 ... tj, j <= length ts,
wenzelm@15023
  1098
    may be a redex. Example: map (%x. x) = (%xs. xs) wrt map_cong*)
berghofe@10413
  1099
                          (let
wenzelm@16985
  1100
                             val thm = congc (prover ss) ss maxidx cong t0;
wenzelm@22902
  1101
                             val t = the_default t0 (Option.map Thm.rhs_of thm);
wenzelm@10767
  1102
                             val (cl, cr) = Thm.dest_comb t
berghofe@10413
  1103
                             val dVar = Var(("", 0), dummyT)
berghofe@10413
  1104
                             val skel =
berghofe@10413
  1105
                               list_comb (h, replicate (length ts) dVar)
wenzelm@15023
  1106
                           in case botc skel ss cl of
skalberg@15531
  1107
                                NONE => thm
skalberg@15531
  1108
                              | SOME thm' => transitive3 thm
wenzelm@36944
  1109
                                  (Thm.combination thm' (Thm.reflexive cr))
wenzelm@20057
  1110
                           end handle Pattern.MATCH => appc ()))
berghofe@10413
  1111
                  | _ => appc ()
berghofe@10413
  1112
               end)
skalberg@15531
  1113
         | _ => NONE)
berghofe@10413
  1114
wenzelm@15023
  1115
    and impc ct ss =
wenzelm@15023
  1116
      if mutsimp then mut_impc0 [] ct [] [] ss else nonmut_impc ct ss
berghofe@10413
  1117
wenzelm@15023
  1118
    and rules_of_prem ss prem =
berghofe@13607
  1119
      if maxidx_of_term (term_of prem) <> ~1
berghofe@13607
  1120
      then (trace_cterm true
wenzelm@22254
  1121
        (fn () => "Cannot add premise as rewrite rule because it contains (type) unknowns:")
wenzelm@22254
  1122
          ss prem; ([], NONE))
berghofe@13607
  1123
      else
wenzelm@36944
  1124
        let val asm = Thm.assume prem
skalberg@15531
  1125
        in (extract_safe_rrules (ss, asm), SOME asm) end
berghofe@10413
  1126
wenzelm@15023
  1127
    and add_rrules (rrss, asms) ss =
wenzelm@20028
  1128
      (fold o fold) insert_rrule rrss ss |> add_prems (map_filter I asms)
berghofe@10413
  1129
wenzelm@23178
  1130
    and disch r prem eq =
berghofe@13607
  1131
      let
wenzelm@22902
  1132
        val (lhs, rhs) = Thm.dest_equals (Thm.cprop_of eq);
wenzelm@36944
  1133
        val eq' = Thm.implies_elim (Thm.instantiate
berghofe@13607
  1134
          ([], [(cA, prem), (cB, lhs), (cC, rhs)]) Drule.imp_cong)
wenzelm@36944
  1135
          (Thm.implies_intr prem eq)
berghofe@13607
  1136
      in if not r then eq' else
berghofe@10413
  1137
        let
wenzelm@22902
  1138
          val (prem', concl) = Thm.dest_implies lhs;
wenzelm@22902
  1139
          val (prem'', _) = Thm.dest_implies rhs
wenzelm@36944
  1140
        in Thm.transitive (Thm.transitive
berghofe@13607
  1141
          (Thm.instantiate ([], [(cA, prem'), (cB, prem), (cC, concl)])
berghofe@13607
  1142
             Drule.swap_prems_eq) eq')
berghofe@13607
  1143
          (Thm.instantiate ([], [(cA, prem), (cB, prem''), (cC, concl)])
berghofe@13607
  1144
             Drule.swap_prems_eq)
berghofe@10413
  1145
        end
berghofe@10413
  1146
      end
berghofe@10413
  1147
berghofe@13607
  1148
    and rebuild [] _ _ _ _ eq = eq
wenzelm@32797
  1149
      | rebuild (prem :: prems) concl (_ :: rrss) (_ :: asms) ss eq =
berghofe@13607
  1150
          let
wenzelm@15023
  1151
            val ss' = add_rrules (rev rrss, rev asms) ss;
berghofe@13607
  1152
            val concl' =
wenzelm@22902
  1153
              Drule.mk_implies (prem, the_default concl (Option.map Thm.rhs_of eq));
wenzelm@23178
  1154
            val dprem = Option.map (disch false prem)
wenzelm@38834
  1155
          in
wenzelm@38834
  1156
            (case rewritec (prover, thy, maxidx) ss' concl' of
skalberg@15531
  1157
              NONE => rebuild prems concl' rrss asms ss (dprem eq)
wenzelm@23178
  1158
            | SOME (eq', _) => transitive2 (fold (disch false)
wenzelm@23178
  1159
                  prems (the (transitive3 (dprem eq) eq')))
wenzelm@38834
  1160
                (mut_impc0 (rev prems) (Thm.rhs_of eq') (rev rrss) (rev asms) ss))
berghofe@13607
  1161
          end
wenzelm@15023
  1162
wenzelm@15023
  1163
    and mut_impc0 prems concl rrss asms ss =
berghofe@13607
  1164
      let
berghofe@13607
  1165
        val prems' = strip_imp_prems concl;
wenzelm@15023
  1166
        val (rrss', asms') = split_list (map (rules_of_prem ss) prems')
wenzelm@38834
  1167
      in
wenzelm@38834
  1168
        mut_impc (prems @ prems') (strip_imp_concl concl) (rrss @ rrss')
wenzelm@38834
  1169
          (asms @ asms') [] [] [] [] ss ~1 ~1
berghofe@13607
  1170
      end
wenzelm@15023
  1171
wenzelm@15023
  1172
    and mut_impc [] concl [] [] prems' rrss' asms' eqns ss changed k =
wenzelm@33245
  1173
        transitive1 (fold (fn (eq1, prem) => fn eq2 => transitive1 eq1
wenzelm@33245
  1174
            (Option.map (disch false prem) eq2)) (eqns ~~ prems') NONE)
berghofe@13607
  1175
          (if changed > 0 then
berghofe@13607
  1176
             mut_impc (rev prems') concl (rev rrss') (rev asms')
wenzelm@15023
  1177
               [] [] [] [] ss ~1 changed
wenzelm@15023
  1178
           else rebuild prems' concl rrss' asms' ss
wenzelm@15023
  1179
             (botc skel0 (add_rrules (rev rrss', rev asms') ss) concl))
berghofe@13607
  1180
berghofe@13607
  1181
      | mut_impc (prem :: prems) concl (rrs :: rrss) (asm :: asms)
wenzelm@15023
  1182
          prems' rrss' asms' eqns ss changed k =
skalberg@15531
  1183
        case (if k = 0 then NONE else botc skel0 (add_rrules
wenzelm@15023
  1184
          (rev rrss' @ rrss, rev asms' @ asms) ss) prem) of
skalberg@15531
  1185
            NONE => mut_impc prems concl rrss asms (prem :: prems')
skalberg@15531
  1186
              (rrs :: rrss') (asm :: asms') (NONE :: eqns) ss changed
berghofe@13607
  1187
              (if k = 0 then 0 else k - 1)
skalberg@15531
  1188
          | SOME eqn =>
berghofe@13607
  1189
            let
wenzelm@22902
  1190
              val prem' = Thm.rhs_of eqn;
berghofe@13607
  1191
              val tprems = map term_of prems;
wenzelm@33029
  1192
              val i = 1 + fold Integer.max (map (fn p =>
wenzelm@44058
  1193
                find_index (fn q => q aconv p) tprems) (Thm.hyps_of eqn)) ~1;
wenzelm@15023
  1194
              val (rrs', asm') = rules_of_prem ss prem'
berghofe@13607
  1195
            in mut_impc prems concl rrss asms (prem' :: prems')
wenzelm@23178
  1196
              (rrs' :: rrss') (asm' :: asms') (SOME (fold_rev (disch true)
haftmann@33957
  1197
                (take i prems)
wenzelm@36944
  1198
                (Drule.imp_cong_rule eqn (Thm.reflexive (Drule.list_implies
haftmann@33957
  1199
                  (drop i prems, concl))))) :: eqns)
wenzelm@20671
  1200
                  ss (length prems') ~1
berghofe@13607
  1201
            end
berghofe@13607
  1202
wenzelm@15023
  1203
     (*legacy code - only for backwards compatibility*)
wenzelm@38834
  1204
    and nonmut_impc ct ss =
wenzelm@38834
  1205
      let
wenzelm@38834
  1206
        val (prem, conc) = Thm.dest_implies ct;
wenzelm@38834
  1207
        val thm1 = if simprem then botc skel0 ss prem else NONE;
wenzelm@38834
  1208
        val prem1 = the_default prem (Option.map Thm.rhs_of thm1);
wenzelm@38834
  1209
        val ss1 =
wenzelm@38834
  1210
          if not useprem then ss
wenzelm@38834
  1211
          else add_rrules (apsnd single (apfst single (rules_of_prem ss prem1))) ss
wenzelm@38834
  1212
      in
wenzelm@38834
  1213
        (case botc skel0 ss1 conc of
wenzelm@38834
  1214
          NONE =>
wenzelm@38834
  1215
            (case thm1 of
wenzelm@38834
  1216
              NONE => NONE
wenzelm@38834
  1217
            | SOME thm1' => SOME (Drule.imp_cong_rule thm1' (Thm.reflexive conc)))
wenzelm@38834
  1218
        | SOME thm2 =>
wenzelm@38834
  1219
            let val thm2' = disch false prem1 thm2 in
wenzelm@38834
  1220
              (case thm1 of
wenzelm@38834
  1221
                NONE => SOME thm2'
wenzelm@38834
  1222
              | SOME thm1' =>
wenzelm@36944
  1223
                 SOME (Thm.transitive (Drule.imp_cong_rule thm1' (Thm.reflexive conc)) thm2'))
wenzelm@38834
  1224
            end)
wenzelm@38834
  1225
      end
berghofe@10413
  1226
wenzelm@15023
  1227
 in try_botc end;
berghofe@10413
  1228
berghofe@10413
  1229
wenzelm@15023
  1230
(* Meta-rewriting: rewrites t to u and returns the theorem t==u *)
berghofe@10413
  1231
berghofe@10413
  1232
(*
berghofe@10413
  1233
  Parameters:
berghofe@10413
  1234
    mode = (simplify A,
berghofe@10413
  1235
            use A in simplifying B,
berghofe@10413
  1236
            use prems of B (if B is again a meta-impl.) to simplify A)
berghofe@10413
  1237
           when simplifying A ==> B
berghofe@10413
  1238
    prover: how to solve premises in conditional rewrites and congruences
berghofe@10413
  1239
*)
berghofe@10413
  1240
wenzelm@32738
  1241
val debug_bounds = Unsynchronized.ref false;
wenzelm@17705
  1242
wenzelm@21962
  1243
fun check_bounds ss ct =
wenzelm@21962
  1244
  if ! debug_bounds then
wenzelm@21962
  1245
    let
wenzelm@21962
  1246
      val Simpset ({bounds = (_, bounds), ...}, _) = ss;
wenzelm@21962
  1247
      val bs = fold_aterms (fn Free (x, _) =>
wenzelm@21962
  1248
          if Name.is_bound x andalso not (AList.defined eq_bound bounds x)
wenzelm@21962
  1249
          then insert (op =) x else I
wenzelm@21962
  1250
        | _ => I) (term_of ct) [];
wenzelm@21962
  1251
    in
wenzelm@21962
  1252
      if null bs then ()
boehmes@35979
  1253
      else print_term_global ss true ("Simplifier: term contains loose bounds: " ^ commas_quote bs)
wenzelm@21962
  1254
        (Thm.theory_of_cterm ct) (Thm.term_of ct)
wenzelm@21962
  1255
    end
wenzelm@21962
  1256
  else ();
wenzelm@17614
  1257
wenzelm@19052
  1258
fun rewrite_cterm mode prover raw_ss raw_ct =
wenzelm@17882
  1259
  let
wenzelm@26626
  1260
    val thy = Thm.theory_of_cterm raw_ct;
wenzelm@20260
  1261
    val ct = Thm.adjust_maxidx_cterm ~1 raw_ct;
wenzelm@32797
  1262
    val {maxidx, ...} = Thm.rep_cterm ct;
wenzelm@22892
  1263
    val ss = inc_simp_depth (activate_context thy raw_ss);
wenzelm@22892
  1264
    val depth = simp_depth ss;
wenzelm@21962
  1265
    val _ =
wenzelm@22892
  1266
      if depth mod 20 = 0 then
wenzelm@38834
  1267
        if_visible ss warning ("Simplification depth " ^ string_of_int depth)
wenzelm@21962
  1268
      else ();
wenzelm@22254
  1269
    val _ = trace_cterm false (fn () => "SIMPLIFIER INVOKED ON THE FOLLOWING TERM:") ss ct;
wenzelm@17882
  1270
    val _ = check_bounds ss ct;
wenzelm@22892
  1271
  in bottomc (mode, Option.map Drule.flexflex_unique oo prover, thy, maxidx) ss ct end;
berghofe@10413
  1272
wenzelm@21708
  1273
val simple_prover =
wenzelm@43597
  1274
  SINGLE o (fn ss => ALLGOALS (resolve_tac (prems_of ss)));
wenzelm@21708
  1275
wenzelm@21708
  1276
fun rewrite _ [] ct = Thm.reflexive ct
haftmann@27582
  1277
  | rewrite full thms ct = rewrite_cterm (full, false, false) simple_prover
wenzelm@35232
  1278
      (global_context (Thm.theory_of_cterm ct) empty_ss addsimps thms) ct;
wenzelm@11672
  1279
wenzelm@23598
  1280
fun simplify full thms = Conv.fconv_rule (rewrite full thms);
wenzelm@21708
  1281
val rewrite_rule = simplify true;
wenzelm@21708
  1282
wenzelm@15023
  1283
(*simple term rewriting -- no proof*)
wenzelm@16458
  1284
fun rewrite_term thy rules procs =
wenzelm@17203
  1285
  Pattern.rewrite_term thy (map decomp_simp' rules) procs;
wenzelm@15023
  1286
wenzelm@22902
  1287
fun rewrite_thm mode prover ss = Conv.fconv_rule (rewrite_cterm mode prover ss);
berghofe@10413
  1288
wenzelm@23536
  1289
(*Rewrite the subgoals of a proof state (represented by a theorem)*)
wenzelm@21708
  1290
fun rewrite_goals_rule thms th =
wenzelm@23584
  1291
  Conv.fconv_rule (Conv.prems_conv ~1 (rewrite_cterm (true, true, true) simple_prover
wenzelm@35232
  1292
    (global_context (Thm.theory_of_thm th) empty_ss addsimps thms))) th;
berghofe@10413
  1293
wenzelm@20228
  1294
wenzelm@21708
  1295
(** meta-rewriting tactics **)
wenzelm@21708
  1296
wenzelm@28839
  1297
(*Rewrite all subgoals*)
wenzelm@21708
  1298
fun rewrite_goals_tac defs = PRIMITIVE (rewrite_goals_rule defs);
wenzelm@21708
  1299
wenzelm@28839
  1300
(*Rewrite one subgoal*)
wenzelm@46465
  1301
fun generic_rewrite_goal_tac mode prover_tac ss i thm =
wenzelm@25203
  1302
  if 0 < i andalso i <= Thm.nprems_of thm then
wenzelm@25203
  1303
    Seq.single (Conv.gconv_rule (rewrite_cterm mode (SINGLE o prover_tac) ss) i thm)
wenzelm@25203
  1304
  else Seq.empty;
wenzelm@23536
  1305
wenzelm@23536
  1306
fun rewrite_goal_tac rews =
wenzelm@23536
  1307
  let val ss = empty_ss addsimps rews in
wenzelm@46465
  1308
    fn i => fn st => generic_rewrite_goal_tac (true, false, false) (K no_tac)
wenzelm@35232
  1309
      (global_context (Thm.theory_of_thm st) ss) i st
wenzelm@23536
  1310
  end;
wenzelm@23536
  1311
wenzelm@46707
  1312
(*Prunes all redundant parameters from the proof state by rewriting.*)
wenzelm@46186
  1313
val prune_params_tac = rewrite_goals_tac [Drule.triv_forall_equality];
wenzelm@21708
  1314
wenzelm@21708
  1315
wenzelm@21708
  1316
(* for folding definitions, handling critical pairs *)
wenzelm@21708
  1317
wenzelm@21708
  1318
(*The depth of nesting in a term*)
wenzelm@32797
  1319
fun term_depth (Abs (_, _, t)) = 1 + term_depth t
wenzelm@32797
  1320
  | term_depth (f $ t) = 1 + Int.max (term_depth f, term_depth t)
wenzelm@21708
  1321
  | term_depth _ = 0;
wenzelm@21708
  1322
wenzelm@21708
  1323
val lhs_of_thm = #1 o Logic.dest_equals o prop_of;
wenzelm@21708
  1324
wenzelm@21708
  1325
(*folding should handle critical pairs!  E.g. K == Inl(0),  S == Inr(Inl(0))
wenzelm@21708
  1326
  Returns longest lhs first to avoid folding its subexpressions.*)
wenzelm@21708
  1327
fun sort_lhs_depths defs =
wenzelm@21708
  1328
  let val keylist = AList.make (term_depth o lhs_of_thm) defs
wenzelm@21708
  1329
      val keys = sort_distinct (rev_order o int_ord) (map #2 keylist)
wenzelm@21708
  1330
  in map (AList.find (op =) keylist) keys end;
wenzelm@21708
  1331
wenzelm@36944
  1332
val rev_defs = sort_lhs_depths o map Thm.symmetric;
wenzelm@21708
  1333
wenzelm@21708
  1334
fun fold_rule defs = fold rewrite_rule (rev_defs defs);
wenzelm@21708
  1335
fun fold_goals_tac defs = EVERY (map rewrite_goals_tac (rev_defs defs));
wenzelm@21708
  1336
wenzelm@21708
  1337
wenzelm@20228
  1338
(* HHF normal form: !! before ==>, outermost !! generalized *)
wenzelm@20228
  1339
wenzelm@20228
  1340
local
wenzelm@20228
  1341
wenzelm@21565
  1342
fun gen_norm_hhf ss th =
wenzelm@21565
  1343
  (if Drule.is_norm_hhf (Thm.prop_of th) then th
wenzelm@26424
  1344
   else Conv.fconv_rule
wenzelm@35232
  1345
    (rewrite_cterm (true, false, false) (K (K NONE)) (global_context (Thm.theory_of_thm th) ss)) th)
wenzelm@21565
  1346
  |> Thm.adjust_maxidx_thm ~1
wenzelm@21565
  1347
  |> Drule.gen_all;
wenzelm@20228
  1348
wenzelm@28620
  1349
val hhf_ss = empty_ss addsimps Drule.norm_hhf_eqs;
wenzelm@20228
  1350
wenzelm@20228
  1351
in
wenzelm@20228
  1352
wenzelm@26424
  1353
val norm_hhf = gen_norm_hhf hhf_ss;
wenzelm@45620
  1354
val norm_hhf_protect = gen_norm_hhf (hhf_ss |> add_eqcong Drule.protect_cong);
wenzelm@20228
  1355
wenzelm@20228
  1356
end;
wenzelm@20228
  1357
berghofe@10413
  1358
end;
berghofe@10413
  1359
wenzelm@41228
  1360
structure Basic_Meta_Simplifier: BASIC_RAW_SIMPLIFIER = Raw_Simplifier;
wenzelm@32738
  1361
open Basic_Meta_Simplifier;