src/Pure/simplifier.ML
author wenzelm
Sat Apr 23 13:53:09 2011 +0200 (2011-04-23)
changeset 42464 ae16b8abf1a8
parent 42375 774df7c59508
child 42465 1ba52683512a
permissions -rw-r--r--
proper binding/report of defined simprocs;
tuned signature;
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
haftmann@41386
     5
raw_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@41228
    10
  include BASIC_RAW_SIMPLIFIER
wenzelm@17883
    11
  val change_simpset: (simpset -> simpset) -> unit
wenzelm@32148
    12
  val global_simpset_of: theory -> simpset
wenzelm@16014
    13
  val Addsimprocs: simproc list -> unit
wenzelm@16014
    14
  val Delsimprocs: simproc list -> unit
wenzelm@32148
    15
  val simpset_of: Proof.context -> simpset
wenzelm@17967
    16
  val generic_simp_tac: bool -> bool * bool * bool -> simpset -> int -> tactic
wenzelm@16014
    17
  val safe_asm_full_simp_tac: simpset -> int -> tactic
wenzelm@35613
    18
  val simp_tac: simpset -> int -> tactic
wenzelm@35613
    19
  val asm_simp_tac: simpset -> int -> tactic
wenzelm@35613
    20
  val full_simp_tac: simpset -> int -> tactic
wenzelm@35613
    21
  val asm_lr_simp_tac: simpset -> int -> tactic
wenzelm@35613
    22
  val asm_full_simp_tac: simpset -> int -> tactic
wenzelm@35613
    23
  val simplify: simpset -> thm -> thm
wenzelm@35613
    24
  val asm_simplify: simpset -> thm -> thm
wenzelm@35613
    25
  val full_simplify: simpset -> thm -> thm
wenzelm@35613
    26
  val asm_lr_simplify: simpset -> thm -> thm
wenzelm@16014
    27
  val asm_full_simplify: simpset -> thm -> thm
wenzelm@16014
    28
end;
wenzelm@16014
    29
wenzelm@16014
    30
signature SIMPLIFIER =
wenzelm@16014
    31
sig
wenzelm@16014
    32
  include BASIC_SIMPLIFIER
wenzelm@30356
    33
  val pretty_ss: Proof.context -> simpset -> Pretty.T
wenzelm@17004
    34
  val clear_ss: simpset -> simpset
wenzelm@32738
    35
  val debug_bounds: bool Unsynchronized.ref
wenzelm@41226
    36
  val add_simp: thm -> simpset -> simpset
wenzelm@41226
    37
  val del_simp: thm -> simpset -> simpset
wenzelm@41226
    38
  val add_prems: thm list -> simpset -> simpset
wenzelm@17883
    39
  val inherit_context: simpset -> simpset -> simpset
wenzelm@17898
    40
  val the_context: simpset -> Proof.context
wenzelm@17898
    41
  val context: Proof.context -> simpset -> simpset
haftmann@37441
    42
  val global_context: theory -> simpset -> simpset
wenzelm@36600
    43
  val with_context: Proof.context -> (simpset -> simpset) -> simpset -> simpset
wenzelm@38715
    44
  val simproc_global_i: theory -> string -> term list
wenzelm@16458
    45
    -> (theory -> simpset -> term -> thm option) -> simproc
wenzelm@38715
    46
  val simproc_global: theory -> string -> string list
wenzelm@16458
    47
    -> (theory -> simpset -> term -> thm option) -> simproc
wenzelm@35613
    48
  val rewrite: simpset -> conv
wenzelm@35613
    49
  val asm_rewrite: simpset -> conv
wenzelm@35613
    50
  val full_rewrite: simpset -> conv
wenzelm@35613
    51
  val asm_lr_rewrite: simpset -> conv
wenzelm@23598
    52
  val asm_full_rewrite: simpset -> conv
wenzelm@22379
    53
  val get_ss: Context.generic -> simpset
wenzelm@22379
    54
  val map_ss: (simpset -> simpset) -> Context.generic -> Context.generic
wenzelm@18728
    55
  val attrib: (simpset * thm list -> simpset) -> attribute
wenzelm@18728
    56
  val simp_add: attribute
wenzelm@18728
    57
  val simp_del: attribute
wenzelm@18728
    58
  val cong_add: attribute
wenzelm@18728
    59
  val cong_del: attribute
wenzelm@26497
    60
  val map_simpset: (simpset -> simpset) -> theory -> theory
wenzelm@42464
    61
  val get_simproc: Proof.context -> xstring * Position.T -> simproc
wenzelm@42464
    62
  val def_simproc: {name: binding, lhss: term list,
wenzelm@22236
    63
    proc: morphism -> simpset -> cterm -> thm option, identifier: thm list} ->
wenzelm@22201
    64
    local_theory -> local_theory
wenzelm@42464
    65
  val def_simproc_cmd: {name: binding, lhss: string list,
wenzelm@22236
    66
    proc: morphism -> simpset -> cterm -> thm option, identifier: thm list} ->
wenzelm@22201
    67
    local_theory -> local_theory
wenzelm@30513
    68
  val cong_modifiers: Method.modifier parser list
wenzelm@30513
    69
  val simp_modifiers': Method.modifier parser list
wenzelm@30513
    70
  val simp_modifiers: Method.modifier parser list
wenzelm@30513
    71
  val method_setup: Method.modifier parser list -> theory -> theory
wenzelm@18708
    72
  val easy_setup: thm -> thm list -> theory -> theory
wenzelm@16014
    73
end;
wenzelm@16014
    74
wenzelm@16014
    75
structure Simplifier: SIMPLIFIER =
wenzelm@16014
    76
struct
wenzelm@16014
    77
wenzelm@41228
    78
open Raw_Simplifier;
wenzelm@21708
    79
wenzelm@21708
    80
wenzelm@30356
    81
(** pretty printing **)
wenzelm@30356
    82
wenzelm@30356
    83
fun pretty_ss ctxt ss =
wenzelm@30356
    84
  let
wenzelm@30356
    85
    val pretty_cterm = Syntax.pretty_term ctxt o Thm.term_of;
wenzelm@32091
    86
    val pretty_thm = Display.pretty_thm ctxt;
wenzelm@30356
    87
    fun pretty_proc (name, lhss) = Pretty.big_list (name ^ ":") (map pretty_cterm lhss);
wenzelm@30356
    88
    fun pretty_cong (name, thm) =
wenzelm@30356
    89
      Pretty.block [Pretty.str (name ^ ":"), Pretty.brk 1, pretty_thm thm];
wenzelm@30356
    90
wenzelm@30356
    91
    val {simps, procs, congs, loopers, unsafe_solvers, safe_solvers, ...} = dest_ss ss;
wenzelm@30356
    92
  in
wenzelm@30356
    93
    [Pretty.big_list "simplification rules:" (map (pretty_thm o #2) simps),
wenzelm@30356
    94
      Pretty.big_list "simplification procedures:" (map pretty_proc (sort_wrt #1 procs)),
wenzelm@30356
    95
      Pretty.big_list "congruences:" (map pretty_cong congs),
wenzelm@30356
    96
      Pretty.strs ("loopers:" :: map quote loopers),
wenzelm@30356
    97
      Pretty.strs ("unsafe solvers:" :: map quote unsafe_solvers),
wenzelm@30356
    98
      Pretty.strs ("safe solvers:" :: map quote safe_solvers)]
wenzelm@30356
    99
    |> Pretty.chunks
wenzelm@30356
   100
  end;
wenzelm@30356
   101
wenzelm@30356
   102
wenzelm@30356
   103
wenzelm@17883
   104
(** simpset data **)
wenzelm@16014
   105
wenzelm@37216
   106
structure Simpset = Generic_Data
wenzelm@22846
   107
(
wenzelm@26497
   108
  type T = simpset;
wenzelm@26497
   109
  val empty = empty_ss;
wenzelm@41228
   110
  fun extend ss = Raw_Simplifier.inherit_context empty_ss ss;
wenzelm@33519
   111
  val merge = merge_ss;
wenzelm@22846
   112
);
wenzelm@16014
   113
wenzelm@37216
   114
val get_ss = Simpset.get;
wenzelm@41253
   115
wenzelm@41253
   116
fun map_ss f context =
wenzelm@41253
   117
  Simpset.map (Raw_Simplifier.with_context (Context.proof_of context) f) context;
wenzelm@26497
   118
wenzelm@26497
   119
wenzelm@26497
   120
(* attributes *)
wenzelm@26497
   121
wenzelm@26497
   122
fun attrib f = Thm.declaration_attribute (fn th => map_ss (fn ss => f (ss, [th])));
wenzelm@16014
   123
wenzelm@26497
   124
val simp_add = attrib (op addsimps);
wenzelm@26497
   125
val simp_del = attrib (op delsimps);
wenzelm@26497
   126
val cong_add = attrib (op addcongs);
wenzelm@26497
   127
val cong_del = attrib (op delcongs);
wenzelm@26497
   128
wenzelm@16014
   129
wenzelm@26497
   130
(* global simpset *)
wenzelm@26497
   131
wenzelm@26497
   132
fun map_simpset f = Context.theory_map (map_ss f);
wenzelm@26497
   133
fun change_simpset f = Context.>> (Context.map_theory (map_simpset f));
wenzelm@32148
   134
fun global_simpset_of thy =
wenzelm@42360
   135
  Raw_Simplifier.context (Proof_Context.init_global thy) (get_ss (Context.Theory thy));
wenzelm@16014
   136
wenzelm@17883
   137
fun Addsimprocs args = change_simpset (fn ss => ss addsimprocs args);
wenzelm@17883
   138
fun Delsimprocs args = change_simpset (fn ss => ss delsimprocs args);
wenzelm@16014
   139
wenzelm@16014
   140
wenzelm@26497
   141
(* local simpset *)
wenzelm@16014
   142
wenzelm@41228
   143
fun simpset_of ctxt = Raw_Simplifier.context ctxt (get_ss (Context.Proof ctxt));
wenzelm@16014
   144
wenzelm@27338
   145
val _ = ML_Antiquote.value "simpset"
wenzelm@32148
   146
  (Scan.succeed "Simplifier.simpset_of (ML_Context.the_local_context ())");
wenzelm@22132
   147
wenzelm@16014
   148
wenzelm@17967
   149
wenzelm@22201
   150
(** named simprocs **)
wenzelm@22201
   151
wenzelm@22204
   152
(* data *)
wenzelm@22204
   153
wenzelm@33519
   154
structure Simprocs = Generic_Data
wenzelm@22201
   155
(
wenzelm@33095
   156
  type T = simproc Name_Space.table;
wenzelm@33159
   157
  val empty : T = Name_Space.empty_table "simproc";
wenzelm@22201
   158
  val extend = I;
wenzelm@33519
   159
  fun merge simprocs = Name_Space.merge_tables simprocs;
wenzelm@22201
   160
);
wenzelm@22201
   161
wenzelm@22204
   162
wenzelm@22204
   163
(* get simprocs *)
wenzelm@22204
   164
wenzelm@42464
   165
fun get_simproc ctxt (xname, pos) =
wenzelm@22204
   166
  let
wenzelm@42464
   167
    val (space, tab) = Simprocs.get (Context.Proof ctxt);
wenzelm@33095
   168
    val name = Name_Space.intern space xname;
wenzelm@22204
   169
  in
wenzelm@22204
   170
    (case Symtab.lookup tab name of
wenzelm@42464
   171
      SOME proc => (Context_Position.report ctxt pos (Name_Space.markup space name); proc)
wenzelm@22204
   172
    | NONE => error ("Undefined simplification procedure: " ^ quote name))
wenzelm@22204
   173
  end;
wenzelm@22204
   174
wenzelm@42464
   175
val _ =
wenzelm@42464
   176
  ML_Antiquote.value "simproc" (Scan.lift (Parse.position Args.name) >> (fn x =>
wenzelm@42464
   177
    "Simplifier.get_simproc (ML_Context.the_local_context ()) " ^
wenzelm@42464
   178
      ML_Syntax.print_pair ML_Syntax.print_string  ML_Syntax.print_position x));
wenzelm@22204
   179
wenzelm@22204
   180
wenzelm@22204
   181
(* define simprocs *)
wenzelm@22201
   182
wenzelm@22201
   183
local
wenzelm@22201
   184
wenzelm@42464
   185
fun gen_simproc prep {name = b, lhss, proc, identifier} lthy =
wenzelm@22201
   186
  let
wenzelm@33671
   187
    val naming = Local_Theory.naming_of lthy;
wenzelm@22236
   188
    val simproc = make_simproc
wenzelm@33169
   189
      {name = Name_Space.full_name naming b,
wenzelm@22236
   190
       lhss =
wenzelm@22236
   191
        let
wenzelm@22236
   192
          val lhss' = prep lthy lhss;
wenzelm@22236
   193
          val ctxt' = lthy
wenzelm@22236
   194
            |> fold Variable.declare_term lhss'
wenzelm@22236
   195
            |> fold Variable.auto_fixes lhss';
wenzelm@22236
   196
        in Variable.export_terms ctxt' lthy lhss' end
wenzelm@42360
   197
        |> map (Thm.cterm_of (Proof_Context.theory_of lthy)),
wenzelm@22236
   198
       proc = proc,
wenzelm@33551
   199
       identifier = identifier};
wenzelm@22201
   200
  in
wenzelm@42375
   201
    lthy |> Local_Theory.declaration false (fn phi => fn context =>
wenzelm@22201
   202
      let
haftmann@28991
   203
        val b' = Morphism.binding phi b;
wenzelm@22236
   204
        val simproc' = morph_simproc phi simproc;
wenzelm@22201
   205
      in
wenzelm@42375
   206
        context
wenzelm@42375
   207
        |> Simprocs.map
wenzelm@42375
   208
          (#2 o Name_Space.define (Context.proof_of context) true naming (b', simproc'))
wenzelm@42375
   209
        |> map_ss (fn ss => ss addsimprocs [simproc'])
wenzelm@22201
   210
      end)
wenzelm@22201
   211
  end;
wenzelm@22201
   212
wenzelm@22201
   213
in
wenzelm@22201
   214
wenzelm@42464
   215
val def_simproc = gen_simproc Syntax.check_terms;
wenzelm@42464
   216
val def_simproc_cmd = gen_simproc Syntax.read_terms;
wenzelm@22201
   217
wenzelm@22201
   218
end;
wenzelm@22201
   219
wenzelm@22201
   220
wenzelm@22201
   221
wenzelm@17967
   222
(** simplification tactics and rules **)
wenzelm@17967
   223
wenzelm@17967
   224
fun solve_all_tac solvers ss =
wenzelm@17967
   225
  let
wenzelm@41228
   226
    val (_, {subgoal_tac, ...}) = Raw_Simplifier.internal_ss ss;
wenzelm@41228
   227
    val solve_tac = subgoal_tac (Raw_Simplifier.set_solvers solvers ss) THEN_ALL_NEW (K no_tac);
wenzelm@17967
   228
  in DEPTH_SOLVE (solve_tac 1) end;
wenzelm@17967
   229
wenzelm@17967
   230
(*NOTE: may instantiate unknowns that appear also in other subgoals*)
wenzelm@17967
   231
fun generic_simp_tac safe mode ss =
wenzelm@17967
   232
  let
wenzelm@41228
   233
    val (_, {loop_tacs, solvers = (unsafe_solvers, solvers), ...}) = Raw_Simplifier.internal_ss ss;
haftmann@21286
   234
    val loop_tac = FIRST' (map (fn (_, tac) => tac ss) (rev loop_tacs));
wenzelm@41228
   235
    val solve_tac = FIRST' (map (Raw_Simplifier.solver ss)
haftmann@22717
   236
      (rev (if safe then solvers else unsafe_solvers)));
wenzelm@17967
   237
wenzelm@17967
   238
    fun simp_loop_tac i =
wenzelm@41253
   239
      Raw_Simplifier.asm_rewrite_goal_tac mode (solve_all_tac unsafe_solvers) ss i THEN
wenzelm@17967
   240
      (solve_tac i ORELSE TRY ((loop_tac THEN_ALL_NEW simp_loop_tac) i));
wenzelm@17967
   241
  in simp_loop_tac end;
wenzelm@17967
   242
wenzelm@17967
   243
local
wenzelm@17967
   244
wenzelm@17967
   245
fun simp rew mode ss thm =
wenzelm@17967
   246
  let
wenzelm@41228
   247
    val (_, {solvers = (unsafe_solvers, _), ...}) = Raw_Simplifier.internal_ss ss;
haftmann@22717
   248
    val tacf = solve_all_tac (rev unsafe_solvers);
wenzelm@17967
   249
    fun prover s th = Option.map #1 (Seq.pull (tacf s th));
wenzelm@17967
   250
  in rew mode prover ss thm end;
wenzelm@17967
   251
wenzelm@17967
   252
in
wenzelm@17967
   253
wenzelm@41228
   254
val simp_thm = simp Raw_Simplifier.rewrite_thm;
wenzelm@41228
   255
val simp_cterm = simp Raw_Simplifier.rewrite_cterm;
wenzelm@17967
   256
wenzelm@17967
   257
end;
wenzelm@17967
   258
wenzelm@17967
   259
wenzelm@16806
   260
(* tactics *)
wenzelm@16806
   261
wenzelm@16014
   262
val simp_tac = generic_simp_tac false (false, false, false);
wenzelm@16014
   263
val asm_simp_tac = generic_simp_tac false (false, true, false);
wenzelm@16014
   264
val full_simp_tac = generic_simp_tac false (true, false, false);
wenzelm@16014
   265
val asm_lr_simp_tac = generic_simp_tac false (true, true, false);
wenzelm@16014
   266
val asm_full_simp_tac = generic_simp_tac false (true, true, true);
wenzelm@16014
   267
val safe_asm_full_simp_tac = generic_simp_tac true (true, true, true);
wenzelm@16014
   268
wenzelm@16806
   269
wenzelm@16806
   270
(* conversions *)
wenzelm@16806
   271
wenzelm@17967
   272
val          simplify = simp_thm (false, false, false);
wenzelm@17967
   273
val      asm_simplify = simp_thm (false, true, false);
wenzelm@17967
   274
val     full_simplify = simp_thm (true, false, false);
wenzelm@17967
   275
val   asm_lr_simplify = simp_thm (true, true, false);
wenzelm@17967
   276
val asm_full_simplify = simp_thm (true, true, true);
wenzelm@16014
   277
wenzelm@17967
   278
val          rewrite = simp_cterm (false, false, false);
wenzelm@17967
   279
val      asm_rewrite = simp_cterm (false, true, false);
wenzelm@17967
   280
val     full_rewrite = simp_cterm (true, false, false);
wenzelm@17967
   281
val   asm_lr_rewrite = simp_cterm (true, true, false);
wenzelm@17967
   282
val asm_full_rewrite = simp_cterm (true, true, true);
wenzelm@16014
   283
wenzelm@16014
   284
wenzelm@16014
   285
wenzelm@16014
   286
(** concrete syntax of attributes **)
wenzelm@16014
   287
wenzelm@16014
   288
(* add / del *)
wenzelm@16014
   289
wenzelm@16014
   290
val simpN = "simp";
wenzelm@16014
   291
val congN = "cong";
wenzelm@16014
   292
val onlyN = "only";
wenzelm@16014
   293
val no_asmN = "no_asm";
wenzelm@16014
   294
val no_asm_useN = "no_asm_use";
wenzelm@16014
   295
val no_asm_simpN = "no_asm_simp";
wenzelm@16014
   296
val asm_lrN = "asm_lr";
wenzelm@16014
   297
wenzelm@16014
   298
wenzelm@24024
   299
(* simprocs *)
wenzelm@24024
   300
wenzelm@24024
   301
local
wenzelm@24024
   302
wenzelm@24024
   303
val add_del =
wenzelm@24024
   304
  (Args.del -- Args.colon >> K (op delsimprocs) ||
wenzelm@24024
   305
    Scan.option (Args.add -- Args.colon) >> K (op addsimprocs))
wenzelm@24024
   306
  >> (fn f => fn simproc => fn phi => Thm.declaration_attribute
wenzelm@24024
   307
      (K (map_ss (fn ss => f (ss, [morph_simproc phi simproc])))));
wenzelm@24024
   308
wenzelm@24024
   309
in
wenzelm@24024
   310
wenzelm@30528
   311
val simproc_att =
wenzelm@30528
   312
  Scan.peek (fn context =>
wenzelm@24024
   313
    add_del :|-- (fn decl =>
wenzelm@42464
   314
      Scan.repeat1 (Args.named_attribute (decl o get_simproc (Context.proof_of context)))
wenzelm@30528
   315
      >> (Library.apply o map Morphism.form)));
wenzelm@24024
   316
wenzelm@24024
   317
end;
wenzelm@24124
   318
wenzelm@24024
   319
wenzelm@16014
   320
(* conversions *)
wenzelm@16014
   321
wenzelm@16014
   322
local
wenzelm@16014
   323
wenzelm@16014
   324
fun conv_mode x =
wenzelm@16014
   325
  ((Args.parens (Args.$$$ no_asmN) >> K simplify ||
wenzelm@16014
   326
    Args.parens (Args.$$$ no_asm_simpN) >> K asm_simplify ||
wenzelm@16014
   327
    Args.parens (Args.$$$ no_asm_useN) >> K full_simplify ||
wenzelm@16014
   328
    Scan.succeed asm_full_simplify) |> Scan.lift) x;
wenzelm@16014
   329
wenzelm@16014
   330
in
wenzelm@16014
   331
wenzelm@30528
   332
val simplified = conv_mode -- Attrib.thms >>
wenzelm@30528
   333
  (fn (f, ths) => Thm.rule_attribute (fn context =>
wenzelm@41228
   334
    f ((if null ths then I else Raw_Simplifier.clear_ss)
wenzelm@32148
   335
        (simpset_of (Context.proof_of context)) addsimps ths)));
wenzelm@16014
   336
wenzelm@16014
   337
end;
wenzelm@16014
   338
wenzelm@16014
   339
wenzelm@16014
   340
(* setup attributes *)
wenzelm@16014
   341
wenzelm@26463
   342
val _ = Context.>> (Context.map_theory
wenzelm@30528
   343
 (Attrib.setup (Binding.name simpN) (Attrib.add_del simp_add simp_del)
wenzelm@30528
   344
    "declaration of Simplifier rewrite rule" #>
wenzelm@30528
   345
  Attrib.setup (Binding.name congN) (Attrib.add_del cong_add cong_del)
wenzelm@30528
   346
    "declaration of Simplifier congruence rule" #>
wenzelm@33671
   347
  Attrib.setup (Binding.name "simproc") simproc_att
wenzelm@33671
   348
    "declaration of simplification procedures" #>
wenzelm@30528
   349
  Attrib.setup (Binding.name "simplified") simplified "simplified rule"));
wenzelm@16014
   350
wenzelm@16014
   351
wenzelm@16014
   352
wenzelm@31300
   353
(** method syntax **)
wenzelm@16014
   354
wenzelm@16014
   355
val cong_modifiers =
wenzelm@18728
   356
 [Args.$$$ congN -- Args.colon >> K ((I, cong_add): Method.modifier),
wenzelm@18728
   357
  Args.$$$ congN -- Args.add -- Args.colon >> K (I, cong_add),
wenzelm@18728
   358
  Args.$$$ congN -- Args.del -- Args.colon >> K (I, cong_del)];
wenzelm@16014
   359
wenzelm@16014
   360
val simp_modifiers =
wenzelm@18728
   361
 [Args.$$$ simpN -- Args.colon >> K (I, simp_add),
wenzelm@18728
   362
  Args.$$$ simpN -- Args.add -- Args.colon >> K (I, simp_add),
wenzelm@18728
   363
  Args.$$$ simpN -- Args.del -- Args.colon >> K (I, simp_del),
wenzelm@17883
   364
  Args.$$$ simpN -- Args.$$$ onlyN -- Args.colon
wenzelm@41228
   365
    >> K (Context.proof_map (map_ss Raw_Simplifier.clear_ss), simp_add)]
wenzelm@16014
   366
   @ cong_modifiers;
wenzelm@16014
   367
wenzelm@16014
   368
val simp_modifiers' =
wenzelm@18728
   369
 [Args.add -- Args.colon >> K (I, simp_add),
wenzelm@18728
   370
  Args.del -- Args.colon >> K (I, simp_del),
wenzelm@18688
   371
  Args.$$$ onlyN -- Args.colon
wenzelm@41228
   372
    >> K (Context.proof_map (map_ss Raw_Simplifier.clear_ss), simp_add)]
wenzelm@16014
   373
   @ cong_modifiers;
wenzelm@16014
   374
wenzelm@31300
   375
val simp_options =
wenzelm@31300
   376
 (Args.parens (Args.$$$ no_asmN) >> K simp_tac ||
wenzelm@31300
   377
  Args.parens (Args.$$$ no_asm_simpN) >> K asm_simp_tac ||
wenzelm@31300
   378
  Args.parens (Args.$$$ no_asm_useN) >> K full_simp_tac ||
wenzelm@31300
   379
  Args.parens (Args.$$$ asm_lrN) >> K asm_lr_simp_tac ||
wenzelm@31300
   380
  Scan.succeed asm_full_simp_tac);
wenzelm@16014
   381
wenzelm@31300
   382
fun simp_method more_mods meth =
wenzelm@35613
   383
  Scan.lift simp_options --|
wenzelm@31300
   384
    Method.sections (more_mods @ simp_modifiers') >>
wenzelm@35613
   385
    (fn tac => fn ctxt => METHOD (fn facts => meth ctxt tac facts));
wenzelm@16014
   386
wenzelm@16014
   387
wenzelm@16014
   388
wenzelm@18708
   389
(** setup **)
wenzelm@18708
   390
wenzelm@31300
   391
fun method_setup more_mods =
wenzelm@31300
   392
  Method.setup (Binding.name simpN)
wenzelm@31300
   393
    (simp_method more_mods (fn ctxt => fn tac => fn facts =>
wenzelm@31300
   394
      HEADGOAL (Method.insert_tac facts THEN'
wenzelm@32148
   395
        (CHANGED_PROP oo tac) (simpset_of ctxt))))
wenzelm@31300
   396
    "simplification" #>
wenzelm@31300
   397
  Method.setup (Binding.name "simp_all")
wenzelm@31300
   398
    (simp_method more_mods (fn ctxt => fn tac => fn facts =>
wenzelm@31300
   399
      ALLGOALS (Method.insert_tac facts) THEN
wenzelm@42372
   400
        (CHANGED_PROP o PARALLEL_GOALS o ALLGOALS o tac) (simpset_of ctxt)))
wenzelm@31300
   401
    "simplification (all goals)";
wenzelm@16014
   402
wenzelm@26497
   403
fun easy_setup reflect trivs = method_setup [] #> Context.theory_map (map_ss (fn _ =>
wenzelm@16014
   404
  let
wenzelm@16014
   405
    val trivialities = Drule.reflexive_thm :: trivs;
wenzelm@16014
   406
wenzelm@16014
   407
    fun unsafe_solver_tac prems = FIRST' [resolve_tac (trivialities @ prems), assume_tac];
wenzelm@16014
   408
    val unsafe_solver = mk_solver "easy unsafe" unsafe_solver_tac;
wenzelm@16014
   409
wenzelm@16014
   410
    (*no premature instantiation of variables during simplification*)
wenzelm@16014
   411
    fun safe_solver_tac prems = FIRST' [match_tac (trivialities @ prems), eq_assume_tac];
wenzelm@16014
   412
    val safe_solver = mk_solver "easy safe" safe_solver_tac;
wenzelm@16014
   413
wenzelm@16014
   414
    fun mk_eq thm =
wenzelm@20872
   415
      if can Logic.dest_equals (Thm.concl_of thm) then [thm]
wenzelm@16014
   416
      else [thm RS reflect] handle THM _ => [];
wenzelm@16014
   417
wenzelm@26653
   418
    fun mksimps thm = mk_eq (Thm.forall_elim_vars (#maxidx (Thm.rep_thm thm) + 1) thm);
wenzelm@26497
   419
  in
wenzelm@26497
   420
    empty_ss setsubgoaler asm_simp_tac
wenzelm@26497
   421
    setSSolver safe_solver
wenzelm@26497
   422
    setSolver unsafe_solver
wenzelm@36543
   423
    setmksimps (K mksimps)
wenzelm@26497
   424
  end));
wenzelm@16014
   425
wenzelm@16014
   426
end;
wenzelm@16014
   427
wenzelm@32738
   428
structure Basic_Simplifier: BASIC_SIMPLIFIER = Simplifier;
wenzelm@32738
   429
open Basic_Simplifier;