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