src/Pure/simplifier.ML
author wenzelm
Sat Mar 07 11:45:56 2009 +0100 (2009-03-07)
changeset 30336 efd1bec4630a
parent 29606 fedb8be05f24
child 30356 36d0e00af606
permissions -rw-r--r--
renamed rep_ss to MetaSimplifier.internal_ss;
wenzelm@16014
     1
(*  Title:      Pure/simplifier.ML
wenzelm@16014
     2
    Author:     Tobias Nipkow and Markus Wenzel, TU Muenchen
wenzelm@16014
     3
wenzelm@16014
     4
Generic simplifier, suitable for most logics (see also
wenzelm@16014
     5
meta_simplifier.ML for the actual meta-level rewriting engine).
wenzelm@16014
     6
*)
wenzelm@16014
     7
wenzelm@16014
     8
signature BASIC_SIMPLIFIER =
wenzelm@16014
     9
sig
wenzelm@16014
    10
  include BASIC_META_SIMPLIFIER
wenzelm@17883
    11
  val change_simpset: (simpset -> simpset) -> unit
wenzelm@16014
    12
  val simpset_of: theory -> simpset
wenzelm@17883
    13
  val simpset: unit -> simpset
wenzelm@16014
    14
  val SIMPSET: (simpset -> tactic) -> tactic
wenzelm@16014
    15
  val SIMPSET': (simpset -> 'a -> tactic) -> 'a -> tactic
wenzelm@16014
    16
  val Addsimps: thm list -> unit
wenzelm@16014
    17
  val Delsimps: thm list -> unit
wenzelm@16014
    18
  val Addsimprocs: simproc list -> unit
wenzelm@16014
    19
  val Delsimprocs: simproc list -> unit
wenzelm@16014
    20
  val Addcongs: thm list -> unit
wenzelm@16014
    21
  val Delcongs: thm list -> unit
wenzelm@16014
    22
  val local_simpset_of: Proof.context -> simpset
wenzelm@17967
    23
  val generic_simp_tac: bool -> bool * bool * bool -> simpset -> int -> tactic
wenzelm@16014
    24
  val safe_asm_full_simp_tac: simpset -> int -> tactic
wenzelm@16014
    25
  val               simp_tac: simpset -> int -> tactic
wenzelm@16014
    26
  val           asm_simp_tac: simpset -> int -> tactic
wenzelm@16014
    27
  val          full_simp_tac: simpset -> int -> tactic
wenzelm@16014
    28
  val        asm_lr_simp_tac: simpset -> int -> tactic
wenzelm@16014
    29
  val      asm_full_simp_tac: simpset -> int -> tactic
wenzelm@16014
    30
  val               Simp_tac:            int -> tactic
wenzelm@16014
    31
  val           Asm_simp_tac:            int -> tactic
wenzelm@16014
    32
  val          Full_simp_tac:            int -> tactic
wenzelm@16014
    33
  val        Asm_lr_simp_tac:            int -> tactic
wenzelm@16014
    34
  val      Asm_full_simp_tac:            int -> tactic
wenzelm@16014
    35
  val          simplify: simpset -> thm -> thm
wenzelm@16014
    36
  val      asm_simplify: simpset -> thm -> thm
wenzelm@16014
    37
  val     full_simplify: simpset -> thm -> thm
wenzelm@16014
    38
  val   asm_lr_simplify: simpset -> thm -> thm
wenzelm@16014
    39
  val asm_full_simplify: simpset -> thm -> thm
wenzelm@16014
    40
end;
wenzelm@16014
    41
wenzelm@16014
    42
signature SIMPLIFIER =
wenzelm@16014
    43
sig
wenzelm@16014
    44
  include BASIC_SIMPLIFIER
wenzelm@17004
    45
  val clear_ss: simpset -> simpset
wenzelm@17723
    46
  val debug_bounds: bool ref
wenzelm@17883
    47
  val inherit_context: simpset -> simpset -> simpset
wenzelm@17898
    48
  val the_context: simpset -> Proof.context
wenzelm@17898
    49
  val context: Proof.context -> simpset -> simpset
wenzelm@17898
    50
  val theory_context: theory  -> simpset -> simpset
wenzelm@16458
    51
  val simproc_i: theory -> string -> term list
wenzelm@16458
    52
    -> (theory -> simpset -> term -> thm option) -> simproc
wenzelm@16458
    53
  val simproc: theory -> string -> string list
wenzelm@16458
    54
    -> (theory -> simpset -> term -> thm option) -> simproc
wenzelm@23598
    55
  val          rewrite: simpset -> conv
wenzelm@23598
    56
  val      asm_rewrite: simpset -> conv
wenzelm@23598
    57
  val     full_rewrite: simpset -> conv
wenzelm@23598
    58
  val   asm_lr_rewrite: simpset -> conv
wenzelm@23598
    59
  val asm_full_rewrite: simpset -> conv
wenzelm@22379
    60
  val get_ss: Context.generic -> simpset
wenzelm@22379
    61
  val map_ss: (simpset -> simpset) -> Context.generic -> Context.generic
wenzelm@18728
    62
  val attrib: (simpset * thm list -> simpset) -> attribute
wenzelm@18728
    63
  val simp_add: attribute
wenzelm@18728
    64
  val simp_del: attribute
wenzelm@18728
    65
  val cong_add: attribute
wenzelm@18728
    66
  val cong_del: attribute
wenzelm@26497
    67
  val map_simpset: (simpset -> simpset) -> theory -> theory
wenzelm@24024
    68
  val get_simproc: Context.generic -> xstring -> simproc
wenzelm@22236
    69
  val def_simproc: {name: string, lhss: string list,
wenzelm@22236
    70
    proc: morphism -> simpset -> cterm -> thm option, identifier: thm list} ->
wenzelm@22201
    71
    local_theory -> local_theory
wenzelm@22236
    72
  val def_simproc_i: {name: string, lhss: term list,
wenzelm@22236
    73
    proc: morphism -> simpset -> cterm -> thm option, identifier: thm list} ->
wenzelm@22201
    74
    local_theory -> local_theory
wenzelm@18033
    75
  val cong_modifiers: (Args.T list -> (Method.modifier * Args.T list)) list
wenzelm@18033
    76
  val simp_modifiers': (Args.T list -> (Method.modifier * Args.T list)) list
wenzelm@16014
    77
  val simp_modifiers: (Args.T list -> (Method.modifier * Args.T list)) list
wenzelm@16014
    78
  val method_setup: (Args.T list -> (Method.modifier * Args.T list)) list
wenzelm@18708
    79
    -> theory -> theory
wenzelm@18708
    80
  val easy_setup: thm -> thm list -> theory -> theory
wenzelm@16014
    81
end;
wenzelm@16014
    82
wenzelm@16014
    83
structure Simplifier: SIMPLIFIER =
wenzelm@16014
    84
struct
wenzelm@16014
    85
wenzelm@21708
    86
open MetaSimplifier;
wenzelm@21708
    87
wenzelm@21708
    88
wenzelm@17883
    89
(** simpset data **)
wenzelm@16014
    90
wenzelm@26497
    91
structure SimpsetData = GenericDataFun
wenzelm@22846
    92
(
wenzelm@26497
    93
  type T = simpset;
wenzelm@26497
    94
  val empty = empty_ss;
wenzelm@26497
    95
  fun extend ss = MetaSimplifier.inherit_context empty_ss ss;
wenzelm@26497
    96
  fun merge _ = merge_ss;
wenzelm@22846
    97
);
wenzelm@16014
    98
wenzelm@26497
    99
val get_ss = SimpsetData.get;
wenzelm@26497
   100
val map_ss = SimpsetData.map;
wenzelm@26497
   101
wenzelm@26497
   102
wenzelm@26497
   103
(* attributes *)
wenzelm@26497
   104
wenzelm@26497
   105
fun attrib f = Thm.declaration_attribute (fn th => map_ss (fn ss => f (ss, [th])));
wenzelm@16014
   106
wenzelm@26497
   107
val simp_add = attrib (op addsimps);
wenzelm@26497
   108
val simp_del = attrib (op delsimps);
wenzelm@26497
   109
val cong_add = attrib (op addcongs);
wenzelm@26497
   110
val cong_del = attrib (op delcongs);
wenzelm@26497
   111
wenzelm@16014
   112
wenzelm@26497
   113
(* global simpset *)
wenzelm@26497
   114
wenzelm@26497
   115
fun map_simpset f = Context.theory_map (map_ss f);
wenzelm@26497
   116
fun change_simpset f = Context.>> (Context.map_theory (map_simpset f));
wenzelm@26497
   117
fun simpset_of thy = MetaSimplifier.context (ProofContext.init thy) (get_ss (Context.Theory thy));
wenzelm@26425
   118
val simpset = simpset_of o ML_Context.the_global_context;
wenzelm@16014
   119
wenzelm@17883
   120
fun SIMPSET tacf st = tacf (simpset_of (Thm.theory_of_thm st)) st;
wenzelm@17883
   121
fun SIMPSET' tacf i st = tacf (simpset_of (Thm.theory_of_thm st)) i st;
wenzelm@16014
   122
wenzelm@17883
   123
fun Addsimps args = change_simpset (fn ss => ss addsimps args);
wenzelm@17883
   124
fun Delsimps args = change_simpset (fn ss => ss delsimps args);
wenzelm@17883
   125
fun Addsimprocs args = change_simpset (fn ss => ss addsimprocs args);
wenzelm@17883
   126
fun Delsimprocs args = change_simpset (fn ss => ss delsimprocs args);
wenzelm@17883
   127
fun Addcongs args = change_simpset (fn ss => ss addcongs args);
wenzelm@17883
   128
fun Delcongs args = change_simpset (fn ss => ss delcongs args);
wenzelm@16014
   129
wenzelm@16014
   130
wenzelm@26497
   131
(* local simpset *)
wenzelm@16014
   132
wenzelm@26497
   133
fun local_simpset_of ctxt = MetaSimplifier.context ctxt (get_ss (Context.Proof ctxt));
wenzelm@16014
   134
wenzelm@27338
   135
val _ = ML_Antiquote.value "simpset"
wenzelm@27338
   136
  (Scan.succeed "Simplifier.local_simpset_of (ML_Context.the_local_context ())");
wenzelm@22132
   137
wenzelm@16014
   138
wenzelm@17967
   139
wenzelm@22201
   140
(** named simprocs **)
wenzelm@22201
   141
wenzelm@23655
   142
fun err_dup_simproc name = error ("Duplicate simproc: " ^ quote name);
wenzelm@22201
   143
wenzelm@22236
   144
wenzelm@22204
   145
(* data *)
wenzelm@22204
   146
wenzelm@22201
   147
structure Simprocs = GenericDataFun
wenzelm@22201
   148
(
wenzelm@22236
   149
  type T = simproc NameSpace.table;
wenzelm@22201
   150
  val empty = NameSpace.empty_table;
wenzelm@22201
   151
  val extend = I;
wenzelm@22236
   152
  fun merge _ simprocs = NameSpace.merge_tables eq_simproc simprocs
wenzelm@23655
   153
    handle Symtab.DUP dup => err_dup_simproc dup;
wenzelm@22201
   154
);
wenzelm@22201
   155
wenzelm@22204
   156
wenzelm@22204
   157
(* get simprocs *)
wenzelm@22204
   158
wenzelm@24024
   159
fun get_simproc context xname =
wenzelm@22204
   160
  let
wenzelm@24024
   161
    val (space, tab) = Simprocs.get context;
wenzelm@22204
   162
    val name = NameSpace.intern space xname;
wenzelm@22204
   163
  in
wenzelm@22204
   164
    (case Symtab.lookup tab name of
wenzelm@22236
   165
      SOME proc => proc
wenzelm@22204
   166
    | NONE => error ("Undefined simplification procedure: " ^ quote name))
wenzelm@22204
   167
  end;
wenzelm@22204
   168
wenzelm@27338
   169
val _ = ML_Antiquote.value "simproc" (Scan.lift Args.name >> (fn name =>
wenzelm@27338
   170
  "Simplifier.get_simproc (ML_Context.the_generic_context ()) " ^ ML_Syntax.print_string name));
wenzelm@22204
   171
wenzelm@22204
   172
wenzelm@22204
   173
(* define simprocs *)
wenzelm@22201
   174
wenzelm@22201
   175
local
wenzelm@22201
   176
wenzelm@22236
   177
fun gen_simproc prep {name, lhss, proc, identifier} lthy =
wenzelm@22201
   178
  let
haftmann@28991
   179
    val b = Binding.name name;
wenzelm@22236
   180
    val naming = LocalTheory.full_naming lthy;
wenzelm@22236
   181
    val simproc = make_simproc
haftmann@28991
   182
      {name = LocalTheory.full_name lthy b,
wenzelm@22236
   183
       lhss =
wenzelm@22236
   184
        let
wenzelm@22236
   185
          val lhss' = prep lthy lhss;
wenzelm@22236
   186
          val ctxt' = lthy
wenzelm@22236
   187
            |> fold Variable.declare_term lhss'
wenzelm@22236
   188
            |> fold Variable.auto_fixes lhss';
wenzelm@22236
   189
        in Variable.export_terms ctxt' lthy lhss' end
wenzelm@22236
   190
        |> map (Thm.cterm_of (ProofContext.theory_of lthy)),
wenzelm@22236
   191
       proc = proc,
wenzelm@22236
   192
       identifier = identifier}
wenzelm@22236
   193
      |> morph_simproc (LocalTheory.target_morphism lthy);
wenzelm@22201
   194
  in
wenzelm@24024
   195
    lthy |> LocalTheory.declaration (fn phi =>
wenzelm@22201
   196
      let
haftmann@28991
   197
        val b' = Morphism.binding phi b;
wenzelm@22236
   198
        val simproc' = morph_simproc phi simproc;
wenzelm@22201
   199
      in
wenzelm@24024
   200
        Simprocs.map (fn simprocs =>
haftmann@28965
   201
          NameSpace.bind naming (b', simproc') simprocs |> snd
haftmann@28863
   202
            handle Symtab.DUP dup => err_dup_simproc dup)
wenzelm@24024
   203
        #> map_ss (fn ss => ss addsimprocs [simproc'])
wenzelm@22201
   204
      end)
wenzelm@22201
   205
  end;
wenzelm@22201
   206
wenzelm@22201
   207
in
wenzelm@22201
   208
wenzelm@24509
   209
val def_simproc = gen_simproc Syntax.read_terms;
wenzelm@24509
   210
val def_simproc_i = gen_simproc Syntax.check_terms;
wenzelm@22201
   211
wenzelm@22201
   212
end;
wenzelm@22201
   213
wenzelm@22201
   214
wenzelm@22201
   215
wenzelm@17967
   216
(** simplification tactics and rules **)
wenzelm@17967
   217
wenzelm@17967
   218
fun solve_all_tac solvers ss =
wenzelm@17967
   219
  let
wenzelm@30336
   220
    val (_, {subgoal_tac, ...}) = MetaSimplifier.internal_ss ss;
wenzelm@17967
   221
    val solve_tac = subgoal_tac (MetaSimplifier.set_solvers solvers ss) THEN_ALL_NEW (K no_tac);
wenzelm@17967
   222
  in DEPTH_SOLVE (solve_tac 1) end;
wenzelm@17967
   223
wenzelm@17967
   224
(*NOTE: may instantiate unknowns that appear also in other subgoals*)
wenzelm@17967
   225
fun generic_simp_tac safe mode ss =
wenzelm@17967
   226
  let
wenzelm@30336
   227
    val (_, {loop_tacs, solvers = (unsafe_solvers, solvers), ...}) = MetaSimplifier.internal_ss ss;
haftmann@21286
   228
    val loop_tac = FIRST' (map (fn (_, tac) => tac ss) (rev loop_tacs));
wenzelm@17967
   229
    val solve_tac = FIRST' (map (MetaSimplifier.solver ss)
haftmann@22717
   230
      (rev (if safe then solvers else unsafe_solvers)));
wenzelm@17967
   231
wenzelm@17967
   232
    fun simp_loop_tac i =
wenzelm@23536
   233
      asm_rewrite_goal_tac mode (solve_all_tac unsafe_solvers) ss i THEN
wenzelm@17967
   234
      (solve_tac i ORELSE TRY ((loop_tac THEN_ALL_NEW simp_loop_tac) i));
wenzelm@17967
   235
  in simp_loop_tac end;
wenzelm@17967
   236
wenzelm@17967
   237
local
wenzelm@17967
   238
wenzelm@17967
   239
fun simp rew mode ss thm =
wenzelm@17967
   240
  let
wenzelm@30336
   241
    val (_, {solvers = (unsafe_solvers, _), ...}) = MetaSimplifier.internal_ss ss;
haftmann@22717
   242
    val tacf = solve_all_tac (rev unsafe_solvers);
wenzelm@17967
   243
    fun prover s th = Option.map #1 (Seq.pull (tacf s th));
wenzelm@17967
   244
  in rew mode prover ss thm end;
wenzelm@17967
   245
wenzelm@17967
   246
in
wenzelm@17967
   247
wenzelm@17967
   248
val simp_thm = simp MetaSimplifier.rewrite_thm;
wenzelm@17967
   249
val simp_cterm = simp MetaSimplifier.rewrite_cterm;
wenzelm@17967
   250
wenzelm@17967
   251
end;
wenzelm@17967
   252
wenzelm@17967
   253
wenzelm@16806
   254
(* tactics *)
wenzelm@16806
   255
wenzelm@16014
   256
val simp_tac = generic_simp_tac false (false, false, false);
wenzelm@16014
   257
val asm_simp_tac = generic_simp_tac false (false, true, false);
wenzelm@16014
   258
val full_simp_tac = generic_simp_tac false (true, false, false);
wenzelm@16014
   259
val asm_lr_simp_tac = generic_simp_tac false (true, true, false);
wenzelm@16014
   260
val asm_full_simp_tac = generic_simp_tac false (true, true, true);
wenzelm@16014
   261
val safe_asm_full_simp_tac = generic_simp_tac true (true, true, true);
wenzelm@16014
   262
wenzelm@16014
   263
(*the abstraction over the proof state delays the dereferencing*)
wenzelm@16014
   264
fun          Simp_tac i st =          simp_tac (simpset ()) i st;
wenzelm@16014
   265
fun      Asm_simp_tac i st =      asm_simp_tac (simpset ()) i st;
wenzelm@16014
   266
fun     Full_simp_tac i st =     full_simp_tac (simpset ()) i st;
wenzelm@16014
   267
fun   Asm_lr_simp_tac i st =   asm_lr_simp_tac (simpset ()) i st;
wenzelm@16014
   268
fun Asm_full_simp_tac i st = asm_full_simp_tac (simpset ()) i st;
wenzelm@16014
   269
wenzelm@16806
   270
wenzelm@16806
   271
(* conversions *)
wenzelm@16806
   272
wenzelm@17967
   273
val          simplify = simp_thm (false, false, false);
wenzelm@17967
   274
val      asm_simplify = simp_thm (false, true, false);
wenzelm@17967
   275
val     full_simplify = simp_thm (true, false, false);
wenzelm@17967
   276
val   asm_lr_simplify = simp_thm (true, true, false);
wenzelm@17967
   277
val asm_full_simplify = simp_thm (true, true, true);
wenzelm@16014
   278
wenzelm@17967
   279
val          rewrite = simp_cterm (false, false, false);
wenzelm@17967
   280
val      asm_rewrite = simp_cterm (false, true, false);
wenzelm@17967
   281
val     full_rewrite = simp_cterm (true, false, false);
wenzelm@17967
   282
val   asm_lr_rewrite = simp_cterm (true, true, false);
wenzelm@17967
   283
val asm_full_rewrite = simp_cterm (true, true, true);
wenzelm@16014
   284
wenzelm@16014
   285
wenzelm@16014
   286
wenzelm@16014
   287
(** concrete syntax of attributes **)
wenzelm@16014
   288
wenzelm@16014
   289
(* add / del *)
wenzelm@16014
   290
wenzelm@16014
   291
val simpN = "simp";
wenzelm@16014
   292
val congN = "cong";
wenzelm@16014
   293
val addN = "add";
wenzelm@16014
   294
val delN = "del";
wenzelm@16014
   295
val onlyN = "only";
wenzelm@16014
   296
val no_asmN = "no_asm";
wenzelm@16014
   297
val no_asm_useN = "no_asm_use";
wenzelm@16014
   298
val no_asm_simpN = "no_asm_simp";
wenzelm@16014
   299
val asm_lrN = "asm_lr";
wenzelm@16014
   300
wenzelm@16014
   301
wenzelm@24024
   302
(* simprocs *)
wenzelm@24024
   303
wenzelm@24024
   304
local
wenzelm@24024
   305
wenzelm@24024
   306
val add_del =
wenzelm@24024
   307
  (Args.del -- Args.colon >> K (op delsimprocs) ||
wenzelm@24024
   308
    Scan.option (Args.add -- Args.colon) >> K (op addsimprocs))
wenzelm@24024
   309
  >> (fn f => fn simproc => fn phi => Thm.declaration_attribute
wenzelm@24024
   310
      (K (map_ss (fn ss => f (ss, [morph_simproc phi simproc])))));
wenzelm@24024
   311
wenzelm@24024
   312
in
wenzelm@24024
   313
wenzelm@24024
   314
val simproc_att = Attrib.syntax
wenzelm@24024
   315
  (Scan.peek (fn context =>
wenzelm@24024
   316
    add_del :|-- (fn decl =>
wenzelm@24024
   317
      Scan.repeat1 (Args.named_attribute (decl o get_simproc context))
wenzelm@24024
   318
      >> (Library.apply o map Morphism.form))));
wenzelm@24024
   319
wenzelm@24024
   320
end;
wenzelm@24124
   321
wenzelm@24024
   322
wenzelm@16014
   323
(* conversions *)
wenzelm@16014
   324
wenzelm@16014
   325
local
wenzelm@16014
   326
wenzelm@16014
   327
fun conv_mode x =
wenzelm@16014
   328
  ((Args.parens (Args.$$$ no_asmN) >> K simplify ||
wenzelm@16014
   329
    Args.parens (Args.$$$ no_asm_simpN) >> K asm_simplify ||
wenzelm@16014
   330
    Args.parens (Args.$$$ no_asm_useN) >> K full_simplify ||
wenzelm@16014
   331
    Scan.succeed asm_full_simplify) |> Scan.lift) x;
wenzelm@16014
   332
wenzelm@16014
   333
in
wenzelm@16014
   334
wenzelm@18688
   335
val simplified =
wenzelm@27021
   336
  Attrib.syntax (conv_mode -- Attrib.thms >> (fn (f, ths) => Thm.rule_attribute (fn context =>
wenzelm@27021
   337
    f ((if null ths then I else MetaSimplifier.clear_ss)
wenzelm@27021
   338
        (local_simpset_of (Context.proof_of context)) addsimps ths))));
wenzelm@16014
   339
wenzelm@16014
   340
end;
wenzelm@16014
   341
wenzelm@16014
   342
wenzelm@16014
   343
(* setup attributes *)
wenzelm@16014
   344
wenzelm@26463
   345
val _ = Context.>> (Context.map_theory
wenzelm@18708
   346
 (Attrib.add_attributes
wenzelm@24024
   347
   [(simpN, Attrib.add_del_args simp_add simp_del, "declaration of Simplifier rewrite rule"),
wenzelm@18728
   348
    (congN, Attrib.add_del_args cong_add cong_del, "declaration of Simplifier congruence rule"),
wenzelm@24024
   349
    ("simproc", simproc_att, "declaration of simplification procedures"),
wenzelm@26463
   350
    ("simplified", simplified, "simplified rule")]));
wenzelm@16014
   351
wenzelm@16014
   352
wenzelm@16014
   353
wenzelm@16014
   354
(** proof methods **)
wenzelm@16014
   355
wenzelm@16014
   356
(* simplification *)
wenzelm@16014
   357
wenzelm@16014
   358
val simp_options =
wenzelm@16014
   359
 (Args.parens (Args.$$$ no_asmN) >> K simp_tac ||
wenzelm@16014
   360
  Args.parens (Args.$$$ no_asm_simpN) >> K asm_simp_tac ||
wenzelm@16014
   361
  Args.parens (Args.$$$ no_asm_useN) >> K full_simp_tac ||
wenzelm@16014
   362
  Args.parens (Args.$$$ asm_lrN) >> K asm_lr_simp_tac ||
wenzelm@16014
   363
  Scan.succeed asm_full_simp_tac);
wenzelm@16014
   364
wenzelm@16014
   365
val cong_modifiers =
wenzelm@18728
   366
 [Args.$$$ congN -- Args.colon >> K ((I, cong_add): Method.modifier),
wenzelm@18728
   367
  Args.$$$ congN -- Args.add -- Args.colon >> K (I, cong_add),
wenzelm@18728
   368
  Args.$$$ congN -- Args.del -- Args.colon >> K (I, cong_del)];
wenzelm@16014
   369
wenzelm@16014
   370
val simp_modifiers =
wenzelm@18728
   371
 [Args.$$$ simpN -- Args.colon >> K (I, simp_add),
wenzelm@18728
   372
  Args.$$$ simpN -- Args.add -- Args.colon >> K (I, simp_add),
wenzelm@18728
   373
  Args.$$$ simpN -- Args.del -- Args.colon >> K (I, simp_del),
wenzelm@17883
   374
  Args.$$$ simpN -- Args.$$$ onlyN -- Args.colon
wenzelm@26497
   375
    >> K (Context.proof_map (map_ss MetaSimplifier.clear_ss), simp_add)]
wenzelm@16014
   376
   @ cong_modifiers;
wenzelm@16014
   377
wenzelm@16014
   378
val simp_modifiers' =
wenzelm@18728
   379
 [Args.add -- Args.colon >> K (I, simp_add),
wenzelm@18728
   380
  Args.del -- Args.colon >> K (I, simp_del),
wenzelm@18688
   381
  Args.$$$ onlyN -- Args.colon
wenzelm@26497
   382
    >> K (Context.proof_map (map_ss MetaSimplifier.clear_ss), simp_add)]
wenzelm@16014
   383
   @ cong_modifiers;
wenzelm@16014
   384
wenzelm@16014
   385
fun simp_args more_mods =
wenzelm@24124
   386
  Method.sectioned_args (Args.bang_facts -- Scan.lift simp_options)
wenzelm@16684
   387
    (more_mods @ simp_modifiers');
wenzelm@16014
   388
wenzelm@24124
   389
fun simp_method (prems, tac) ctxt = Method.METHOD (fn facts =>
wenzelm@16014
   390
  ALLGOALS (Method.insert_tac (prems @ facts)) THEN
wenzelm@24124
   391
    (CHANGED_PROP o ALLGOALS o tac) (local_simpset_of ctxt));
wenzelm@16014
   392
wenzelm@24124
   393
fun simp_method' (prems, tac) ctxt = Method.METHOD (fn facts =>
wenzelm@16014
   394
  HEADGOAL (Method.insert_tac (prems @ facts) THEN'
wenzelm@24124
   395
      ((CHANGED_PROP) oo tac) (local_simpset_of ctxt)));
wenzelm@16014
   396
wenzelm@16014
   397
wenzelm@16014
   398
wenzelm@18708
   399
(** setup **)
wenzelm@18708
   400
wenzelm@18708
   401
fun method_setup more_mods = Method.add_methods
wenzelm@16014
   402
 [(simpN, simp_args more_mods simp_method', "simplification"),
wenzelm@16014
   403
  ("simp_all", simp_args more_mods simp_method, "simplification (all goals)")];
wenzelm@16014
   404
wenzelm@26497
   405
fun easy_setup reflect trivs = method_setup [] #> Context.theory_map (map_ss (fn _ =>
wenzelm@16014
   406
  let
wenzelm@16014
   407
    val trivialities = Drule.reflexive_thm :: trivs;
wenzelm@16014
   408
wenzelm@16014
   409
    fun unsafe_solver_tac prems = FIRST' [resolve_tac (trivialities @ prems), assume_tac];
wenzelm@16014
   410
    val unsafe_solver = mk_solver "easy unsafe" unsafe_solver_tac;
wenzelm@16014
   411
wenzelm@16014
   412
    (*no premature instantiation of variables during simplification*)
wenzelm@16014
   413
    fun safe_solver_tac prems = FIRST' [match_tac (trivialities @ prems), eq_assume_tac];
wenzelm@16014
   414
    val safe_solver = mk_solver "easy safe" safe_solver_tac;
wenzelm@16014
   415
wenzelm@16014
   416
    fun mk_eq thm =
wenzelm@20872
   417
      if can Logic.dest_equals (Thm.concl_of thm) then [thm]
wenzelm@16014
   418
      else [thm RS reflect] handle THM _ => [];
wenzelm@16014
   419
wenzelm@26653
   420
    fun mksimps thm = mk_eq (Thm.forall_elim_vars (#maxidx (Thm.rep_thm thm) + 1) thm);
wenzelm@26497
   421
  in
wenzelm@26497
   422
    empty_ss setsubgoaler asm_simp_tac
wenzelm@26497
   423
    setSSolver safe_solver
wenzelm@26497
   424
    setSolver unsafe_solver
wenzelm@26497
   425
    setmksimps mksimps
wenzelm@26497
   426
  end));
wenzelm@16014
   427
wenzelm@16014
   428
end;
wenzelm@16014
   429
wenzelm@16014
   430
structure BasicSimplifier: BASIC_SIMPLIFIER = Simplifier;
wenzelm@16014
   431
open BasicSimplifier;