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