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