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