src/Provers/simplifier.ML
author wenzelm
Thu Aug 05 22:09:23 1999 +0200 (1999-08-05 ago)
changeset 7177 6bb7ad30f3da
parent 7132 5c31d06ead04
child 7214 381d6987f68d
permissions -rw-r--r--
change_simpset_of;
clasohm@1243
     1
(*  Title:      Provers/simplifier.ML
nipkow@1
     2
    ID:         $Id$
wenzelm@3557
     3
    Author:     Tobias Nipkow and Markus Wenzel, TU Muenchen
nipkow@1
     4
wenzelm@4795
     5
Generic simplifier, suitable for most logics.  See Pure/thm.ML for the
wenzelm@4795
     6
actual meta-level rewriting engine.
nipkow@1
     7
*)
clasohm@1260
     8
wenzelm@3551
     9
infix 4
nipkow@4682
    10
  setsubgoaler setloop addloop delloop setSSolver addSSolver setSolver
nipkow@4677
    11
  addSolver addsimps delsimps addeqcongs deleqcongs
nipkow@4677
    12
  setmksimps setmkeqTrue setmksym settermless addsimprocs delsimprocs;
oheimb@2567
    13
wenzelm@4795
    14
signature BASIC_SIMPLIFIER =
clasohm@0
    15
sig
wenzelm@2509
    16
  type simproc
wenzelm@3577
    17
  val mk_simproc: string -> cterm list
wenzelm@3577
    18
    -> (Sign.sg -> thm list -> term -> thm option) -> simproc
clasohm@0
    19
  type simpset
wenzelm@2503
    20
  val empty_ss: simpset
wenzelm@3551
    21
  val rep_ss: simpset ->
wenzelm@3551
    22
   {mss: meta_simpset,
wenzelm@3551
    23
    subgoal_tac:        simpset -> int -> tactic,
nipkow@4668
    24
    loop_tacs:          (string * (int -> tactic))list,
wenzelm@3551
    25
           finish_tac: thm list -> int -> tactic,
wenzelm@3551
    26
    unsafe_finish_tac: thm list -> int -> tactic};
wenzelm@3551
    27
  val print_ss: simpset -> unit
wenzelm@4366
    28
  val print_simpset: theory -> unit
oheimb@2629
    29
  val setsubgoaler: simpset *  (simpset -> int -> tactic) -> simpset
oheimb@2629
    30
  val setloop:      simpset *             (int -> tactic) -> simpset
nipkow@4668
    31
  val addloop:      simpset *  (string * (int -> tactic)) -> simpset
nipkow@4682
    32
  val delloop:      simpset *   string                    -> simpset
oheimb@2629
    33
  val setSSolver:   simpset * (thm list -> int -> tactic) -> simpset
oheimb@2629
    34
  val addSSolver:   simpset * (thm list -> int -> tactic) -> simpset
oheimb@2629
    35
  val setSolver:    simpset * (thm list -> int -> tactic) -> simpset
oheimb@2629
    36
  val addSolver:    simpset * (thm list -> int -> tactic) -> simpset
wenzelm@3577
    37
  val setmksimps:   simpset * (thm -> thm list) -> simpset
nipkow@4677
    38
  val setmkeqTrue:  simpset * (thm -> thm option) -> simpset
nipkow@4677
    39
  val setmksym:     simpset * (thm -> thm option) -> simpset
wenzelm@3577
    40
  val settermless:  simpset * (term * term -> bool) -> simpset
wenzelm@3577
    41
  val addsimps:     simpset * thm list -> simpset
wenzelm@3577
    42
  val delsimps:     simpset * thm list -> simpset
wenzelm@3577
    43
  val addeqcongs:   simpset * thm list -> simpset
wenzelm@3577
    44
  val deleqcongs:   simpset * thm list -> simpset
wenzelm@3577
    45
  val addsimprocs:  simpset * simproc list -> simpset
wenzelm@3577
    46
  val delsimprocs:  simpset * simproc list -> simpset
wenzelm@3577
    47
  val merge_ss:     simpset * simpset -> simpset
wenzelm@3577
    48
  val prems_of_ss:  simpset -> thm list
wenzelm@4080
    49
  val simpset_ref_of_sg: Sign.sg -> simpset ref
wenzelm@4080
    50
  val simpset_ref_of: theory -> simpset ref
wenzelm@4080
    51
  val simpset_of_sg: Sign.sg -> simpset
wenzelm@4080
    52
  val simpset_of: theory -> simpset
wenzelm@4080
    53
  val SIMPSET: (simpset -> tactic) -> tactic
wenzelm@4080
    54
  val SIMPSET': (simpset -> 'a -> tactic) -> 'a -> tactic
wenzelm@4080
    55
  val simpset: unit -> simpset
wenzelm@4080
    56
  val simpset_ref: unit -> simpset ref
clasohm@1243
    57
  val Addsimps: thm list -> unit
clasohm@1243
    58
  val Delsimps: thm list -> unit
wenzelm@2509
    59
  val Addsimprocs: simproc list -> unit
wenzelm@2509
    60
  val Delsimprocs: simproc list -> unit
oheimb@2629
    61
  val               simp_tac: simpset -> int -> tactic
oheimb@2629
    62
  val           asm_simp_tac: simpset -> int -> tactic
oheimb@2629
    63
  val          full_simp_tac: simpset -> int -> tactic
nipkow@4722
    64
  val        asm_lr_simp_tac: simpset -> int -> tactic
oheimb@2629
    65
  val      asm_full_simp_tac: simpset -> int -> tactic
oheimb@2629
    66
  val safe_asm_full_simp_tac: simpset -> int -> tactic
oheimb@2629
    67
  val               Simp_tac:            int -> tactic
oheimb@2629
    68
  val           Asm_simp_tac:            int -> tactic
oheimb@2629
    69
  val          Full_simp_tac:            int -> tactic
nipkow@4722
    70
  val        Asm_lr_simp_tac:            int -> tactic
oheimb@2629
    71
  val      Asm_full_simp_tac:            int -> tactic
wenzelm@3557
    72
  val          simplify: simpset -> thm -> thm
wenzelm@3557
    73
  val      asm_simplify: simpset -> thm -> thm
wenzelm@3557
    74
  val     full_simplify: simpset -> thm -> thm
wenzelm@3557
    75
  val asm_full_simplify: simpset -> thm -> thm
clasohm@0
    76
end;
clasohm@0
    77
wenzelm@4795
    78
signature SIMPLIFIER =
wenzelm@4795
    79
sig
wenzelm@4795
    80
  include BASIC_SIMPLIFIER
wenzelm@5082
    81
  val          rewrite: simpset -> cterm -> thm
wenzelm@5082
    82
  val      asm_rewrite: simpset -> cterm -> thm
wenzelm@5082
    83
  val     full_rewrite: simpset -> cterm -> thm
wenzelm@5082
    84
  val asm_full_rewrite: simpset -> cterm -> thm
wenzelm@5842
    85
  val print_local_simpset: Proof.context -> unit
wenzelm@5842
    86
  val get_local_simpset: Proof.context -> simpset
wenzelm@5842
    87
  val put_local_simpset: simpset -> Proof.context -> Proof.context
wenzelm@4855
    88
  val simp_add_global: theory attribute
wenzelm@4855
    89
  val simp_del_global: theory attribute
wenzelm@6911
    90
  val simp_only_global: theory attribute
wenzelm@5842
    91
  val simp_add_local: Proof.context attribute
wenzelm@5842
    92
  val simp_del_local: Proof.context attribute
wenzelm@6911
    93
  val simp_only_local: Proof.context attribute
wenzelm@7177
    94
  val change_simpset_of: (simpset * 'a -> simpset) -> 'a -> theory -> theory
wenzelm@5928
    95
  val simp_modifiers: (Args.T list -> (Proof.context attribute * Args.T list)) list
wenzelm@5842
    96
  val setup: (theory -> theory) list
wenzelm@4795
    97
end;
wenzelm@2503
    98
wenzelm@2503
    99
structure Simplifier: SIMPLIFIER =
clasohm@0
   100
struct
clasohm@0
   101
wenzelm@2509
   102
wenzelm@2509
   103
(** simplification procedures **)
wenzelm@2509
   104
wenzelm@2509
   105
(* datatype simproc *)
wenzelm@2509
   106
wenzelm@2509
   107
datatype simproc =
wenzelm@3577
   108
  Simproc of string * cterm list * (Sign.sg -> thm list -> term -> thm option) * stamp;
wenzelm@2509
   109
wenzelm@3557
   110
fun mk_simproc name lhss proc =
wenzelm@3557
   111
  Simproc (name, map (Thm.cterm_fun Logic.varify) lhss, proc, stamp ());
wenzelm@3557
   112
wenzelm@3551
   113
fun rep_simproc (Simproc args) = args;
wenzelm@2509
   114
wenzelm@2509
   115
wenzelm@2509
   116
wenzelm@2503
   117
(** simplification sets **)
wenzelm@2503
   118
wenzelm@2503
   119
(* type simpset *)
wenzelm@2503
   120
clasohm@0
   121
datatype simpset =
wenzelm@2503
   122
  Simpset of {
wenzelm@2503
   123
    mss: meta_simpset,
oheimb@2629
   124
    subgoal_tac:        simpset -> int -> tactic,
nipkow@4668
   125
    loop_tacs:          (string * (int -> tactic))list,
oheimb@2629
   126
           finish_tac: thm list -> int -> tactic,
oheimb@2629
   127
    unsafe_finish_tac: thm list -> int -> tactic};
wenzelm@2503
   128
nipkow@4668
   129
fun make_ss (mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac) =
nipkow@4668
   130
  Simpset {mss = mss, subgoal_tac = subgoal_tac, loop_tacs = loop_tacs,
oheimb@2629
   131
    finish_tac = finish_tac, unsafe_finish_tac = unsafe_finish_tac};
clasohm@0
   132
clasohm@0
   133
val empty_ss =
wenzelm@6911
   134
  let val mss = Thm.set_mk_sym (Thm.empty_mss, Some o symmetric_fun)
nipkow@4677
   135
  in make_ss (mss, K (K no_tac), [], K (K no_tac), K (K no_tac)) end;
wenzelm@3551
   136
wenzelm@3551
   137
fun rep_ss (Simpset args) = args;
wenzelm@3551
   138
fun prems_of_ss (Simpset {mss, ...}) = Thm.prems_of_mss mss;
wenzelm@3551
   139
wenzelm@3551
   140
wenzelm@3551
   141
(* print simpsets *)
wenzelm@2503
   142
wenzelm@3551
   143
fun print_ss ss =
wenzelm@3551
   144
  let
wenzelm@3551
   145
    val Simpset {mss, ...} = ss;
wenzelm@3551
   146
    val {simps, procs, congs} = Thm.dest_mss mss;
wenzelm@2503
   147
wenzelm@3551
   148
    val pretty_thms = map Display.pretty_thm;
wenzelm@3551
   149
    fun pretty_proc (name, lhss) =
wenzelm@3551
   150
      Pretty.big_list (name ^ ":") (map Display.pretty_cterm lhss);
wenzelm@3551
   151
  in
wenzelm@3551
   152
    Pretty.writeln (Pretty.big_list "simplification rules:" (pretty_thms simps));
wenzelm@3551
   153
    Pretty.writeln (Pretty.big_list "simplification procedures:" (map pretty_proc procs));
wenzelm@3551
   154
    Pretty.writeln (Pretty.big_list "congruences:" (pretty_thms congs))
wenzelm@3551
   155
  end;
wenzelm@2503
   156
wenzelm@2503
   157
wenzelm@2503
   158
(* extend simpsets *)
wenzelm@2503
   159
nipkow@4668
   160
fun (Simpset {mss, subgoal_tac = _, loop_tacs, finish_tac, unsafe_finish_tac})
wenzelm@3551
   161
    setsubgoaler subgoal_tac =
nipkow@4668
   162
  make_ss (mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac);
oheimb@2629
   163
nipkow@4668
   164
fun (Simpset {mss, subgoal_tac, loop_tacs = _, finish_tac, unsafe_finish_tac})
nipkow@4668
   165
    setloop tac =
nipkow@4668
   166
  make_ss (mss, subgoal_tac, [("",tac)], finish_tac, unsafe_finish_tac);
wenzelm@2503
   167
nipkow@4668
   168
fun (Simpset {mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac})
oheimb@4741
   169
    addloop tac = make_ss (mss, subgoal_tac, 
wenzelm@5886
   170
        (case assoc_string (loop_tacs,(fst tac)) of None => () | Some x => 
wenzelm@5886
   171
         warning ("overwriting looper "^fst tac); overwrite(loop_tacs,tac)),
nipkow@4668
   172
           finish_tac, unsafe_finish_tac);
oheimb@2567
   173
wenzelm@6911
   174
fun (ss as Simpset {mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac}) delloop name =
wenzelm@6911
   175
  let val (del, rest) = partition (fn (n, _) => n = name) loop_tacs in
wenzelm@6911
   176
    if null del then (warning ("No such looper in simpset: " ^ name); ss)
wenzelm@6911
   177
    else make_ss (mss, subgoal_tac, rest, finish_tac, unsafe_finish_tac)
nipkow@4682
   178
  end;
nipkow@4682
   179
nipkow@4668
   180
fun (Simpset {mss, subgoal_tac, loop_tacs, finish_tac = _, unsafe_finish_tac})
wenzelm@3551
   181
    setSSolver finish_tac =
nipkow@4668
   182
  make_ss (mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac);
wenzelm@2503
   183
nipkow@4668
   184
fun (Simpset {mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac})
wenzelm@3551
   185
    addSSolver tac =
nipkow@4668
   186
  make_ss (mss, subgoal_tac, loop_tacs, fn hyps => finish_tac hyps ORELSE' tac hyps,
wenzelm@3551
   187
    unsafe_finish_tac);
wenzelm@2503
   188
nipkow@4668
   189
fun (Simpset {mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac = _})
wenzelm@3551
   190
    setSolver unsafe_finish_tac =
nipkow@4668
   191
  make_ss (mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac);
wenzelm@2503
   192
nipkow@4668
   193
fun (Simpset {mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac})
wenzelm@3551
   194
    addSolver tac =
nipkow@4668
   195
  make_ss (mss, subgoal_tac, loop_tacs, finish_tac,
wenzelm@3551
   196
    fn hyps => unsafe_finish_tac hyps ORELSE' tac hyps);
wenzelm@2503
   197
nipkow@4668
   198
fun (Simpset {mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac})
wenzelm@3551
   199
    setmksimps mk_simps =
wenzelm@2645
   200
  make_ss (Thm.set_mk_rews (mss, map (Thm.strip_shyps o Drule.zero_var_indexes) o mk_simps),
nipkow@4668
   201
    subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac);
wenzelm@2509
   202
nipkow@4677
   203
fun (Simpset {mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac})
nipkow@4677
   204
    setmkeqTrue mk_eq_True =
nipkow@4677
   205
  make_ss (Thm.set_mk_eq_True (mss, mk_eq_True),
nipkow@4677
   206
    subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac);
nipkow@4677
   207
nipkow@4677
   208
fun (Simpset {mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac})
nipkow@4677
   209
    setmksym mksym =
nipkow@4677
   210
  make_ss (Thm.set_mk_sym (mss, mksym),
nipkow@4677
   211
    subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac);
nipkow@4677
   212
nipkow@4668
   213
fun (Simpset {mss, subgoal_tac, loop_tacs,  finish_tac, unsafe_finish_tac})
wenzelm@3551
   214
    settermless termless =
nipkow@4668
   215
  make_ss (Thm.set_termless (mss, termless), subgoal_tac, loop_tacs,
wenzelm@3551
   216
    finish_tac, unsafe_finish_tac);
wenzelm@3551
   217
nipkow@4668
   218
fun (Simpset {mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac})
wenzelm@3551
   219
    addsimps rews =
wenzelm@6911
   220
  make_ss (Thm.add_simps (mss, rews), subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac);
wenzelm@2503
   221
nipkow@4668
   222
fun (Simpset {mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac})
wenzelm@3551
   223
    delsimps rews =
wenzelm@6911
   224
  make_ss (Thm.del_simps (mss, rews), subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac);
wenzelm@2503
   225
nipkow@4668
   226
fun (Simpset {mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac})
wenzelm@3551
   227
    addeqcongs newcongs =
wenzelm@6911
   228
  make_ss (Thm.add_congs (mss, newcongs), subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac);
wenzelm@2509
   229
nipkow@4668
   230
fun (Simpset {mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac})
wenzelm@3551
   231
    deleqcongs oldcongs =
wenzelm@6911
   232
  make_ss (Thm.del_congs (mss, oldcongs), subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac);
oheimb@2629
   233
nipkow@4668
   234
fun (Simpset {mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac})
wenzelm@3551
   235
    addsimprocs simprocs =
wenzelm@3551
   236
  make_ss
wenzelm@3551
   237
    (Thm.add_simprocs (mss, map rep_simproc simprocs),
nipkow@4668
   238
      subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac);
wenzelm@2509
   239
nipkow@4668
   240
fun (Simpset {mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac})
wenzelm@3551
   241
    delsimprocs simprocs =
wenzelm@3551
   242
  make_ss
wenzelm@3551
   243
    (Thm.del_simprocs (mss, map rep_simproc simprocs),
nipkow@4668
   244
      subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac);
wenzelm@2503
   245
wenzelm@6911
   246
fun onlysimps (Simpset {mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac}, rews) =
wenzelm@6911
   247
  make_ss (Thm.clear_mss mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac)
wenzelm@6911
   248
    addsimps rews;
wenzelm@6911
   249
wenzelm@2503
   250
wenzelm@5886
   251
(* merge simpsets *)    (*NOTE: ignores tactics of 2nd simpset (except loopers)*)
wenzelm@2503
   252
wenzelm@3551
   253
fun merge_ss
wenzelm@4795
   254
   (Simpset {mss = mss1, loop_tacs = loop_tacs1, subgoal_tac, finish_tac, unsafe_finish_tac},
nipkow@4668
   255
    Simpset {mss = mss2, loop_tacs = loop_tacs2, ...}) =
nipkow@4668
   256
  make_ss (Thm.merge_mss (mss1, mss2), subgoal_tac,
wenzelm@4795
   257
    merge_alists loop_tacs1 loop_tacs2, finish_tac, unsafe_finish_tac);
wenzelm@2503
   258
wenzelm@2503
   259
wenzelm@3557
   260
wenzelm@5024
   261
(** global and local simpset data **)
wenzelm@4080
   262
wenzelm@5842
   263
(* theory data kind 'Provers/simpset' *)
wenzelm@4795
   264
wenzelm@5842
   265
structure GlobalSimpsetArgs =
wenzelm@5024
   266
struct
wenzelm@5842
   267
  val name = "Provers/simpset";
wenzelm@5024
   268
  type T = simpset ref;
clasohm@0
   269
wenzelm@5024
   270
  val empty = ref empty_ss;
wenzelm@6556
   271
  fun copy (ref ss) = (ref ss): T;            (*create new reference!*)
wenzelm@6556
   272
  val prep_ext = copy;
wenzelm@5024
   273
  fun merge (ref ss1, ref ss2) = ref (merge_ss (ss1, ss2));
wenzelm@5024
   274
  fun print _ (ref ss) = print_ss ss;
wenzelm@5024
   275
end;
wenzelm@4080
   276
wenzelm@5842
   277
structure GlobalSimpset = TheoryDataFun(GlobalSimpsetArgs);
wenzelm@5842
   278
val print_simpset = GlobalSimpset.print;
wenzelm@5842
   279
val simpset_ref_of_sg = GlobalSimpset.get_sg;
wenzelm@5842
   280
val simpset_ref_of = GlobalSimpset.get;
wenzelm@4080
   281
wenzelm@4080
   282
wenzelm@4795
   283
(* access global simpset *)
clasohm@0
   284
wenzelm@4080
   285
val simpset_of_sg = ! o simpset_ref_of_sg;
wenzelm@6391
   286
val simpset_of = simpset_of_sg o Theory.sign_of;
wenzelm@4080
   287
wenzelm@6391
   288
fun SIMPSET tacf state = tacf (simpset_of_sg (Thm.sign_of_thm state)) state;
wenzelm@6391
   289
fun SIMPSET' tacf i state = tacf (simpset_of_sg (Thm.sign_of_thm state)) i state;
clasohm@0
   290
wenzelm@5028
   291
val simpset = simpset_of o Context.the_context;
wenzelm@6391
   292
val simpset_ref = simpset_ref_of_sg o Theory.sign_of o Context.the_context;
wenzelm@4080
   293
wenzelm@4080
   294
wenzelm@4795
   295
(* change global simpset *)
wenzelm@4080
   296
wenzelm@7177
   297
fun change_simpset_of f x thy =
wenzelm@7177
   298
  let val r = simpset_ref_of thy
wenzelm@7177
   299
  in r := f (! r, x); thy end;
wenzelm@7177
   300
wenzelm@7177
   301
fun change_simpset f x = (change_simpset_of f x (Context.the_context ()); ());
wenzelm@4080
   302
wenzelm@4080
   303
val Addsimps = change_simpset (op addsimps);
wenzelm@4080
   304
val Delsimps = change_simpset (op delsimps);
wenzelm@4080
   305
val Addsimprocs = change_simpset (op addsimprocs);
wenzelm@4080
   306
val Delsimprocs = change_simpset (op delsimprocs);
wenzelm@2509
   307
clasohm@0
   308
wenzelm@5842
   309
(* proof data kind 'Provers/simpset' *)
wenzelm@4795
   310
wenzelm@5842
   311
structure LocalSimpsetArgs =
wenzelm@5842
   312
struct
wenzelm@5842
   313
  val name = "Provers/simpset";
wenzelm@5842
   314
  type T = simpset;
wenzelm@5842
   315
  val init = simpset_of;
wenzelm@5842
   316
  fun print _ ss = print_ss ss;
wenzelm@5842
   317
end;
wenzelm@4795
   318
wenzelm@5842
   319
structure LocalSimpset = ProofDataFun(LocalSimpsetArgs);
wenzelm@5842
   320
val print_local_simpset = LocalSimpset.print;
wenzelm@5842
   321
val get_local_simpset = LocalSimpset.get;
wenzelm@5842
   322
val put_local_simpset = LocalSimpset.put;
wenzelm@4795
   323
wenzelm@4795
   324
wenzelm@5886
   325
(* attributes *)
wenzelm@5886
   326
wenzelm@5886
   327
fun change_global_ss f (thy, th) =
wenzelm@5886
   328
  let val r = simpset_ref_of thy
wenzelm@6096
   329
  in r := f (! r, [th]); (thy, th) end;
wenzelm@5886
   330
wenzelm@5886
   331
fun change_local_ss f (ctxt, th) =
wenzelm@6096
   332
  let val ss = f (get_local_simpset ctxt, [th])
wenzelm@5886
   333
  in (put_local_simpset ss ctxt, th) end;
wenzelm@5886
   334
wenzelm@5886
   335
val simp_add_global = change_global_ss (op addsimps);
wenzelm@5886
   336
val simp_del_global = change_global_ss (op delsimps);
wenzelm@6911
   337
val simp_only_global = change_global_ss onlysimps;
wenzelm@5886
   338
val simp_add_local = change_local_ss (op addsimps);
wenzelm@5886
   339
val simp_del_local = change_local_ss (op delsimps);
wenzelm@6911
   340
val simp_only_local = change_local_ss onlysimps;
wenzelm@5886
   341
wenzelm@5886
   342
wenzelm@3557
   343
wenzelm@2503
   344
(** simplification tactics **)
clasohm@0
   345
nipkow@4668
   346
fun solve_all_tac (subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac) mss =
wenzelm@3557
   347
  let
wenzelm@3557
   348
    val ss =
nipkow@4668
   349
      make_ss (mss, subgoal_tac, loop_tacs, unsafe_finish_tac, unsafe_finish_tac);
nipkow@4612
   350
    val solve1_tac = (subgoal_tac ss THEN_ALL_NEW (K no_tac)) 1
wenzelm@3557
   351
  in DEPTH_SOLVE solve1_tac end;
wenzelm@3557
   352
nipkow@4668
   353
fun loop_tac loop_tacs = FIRST'(map snd loop_tacs);
wenzelm@3557
   354
oheimb@2629
   355
(*not totally safe: may instantiate unknowns that appear also in other subgoals*)
oheimb@2629
   356
fun basic_gen_simp_tac mode =
nipkow@4668
   357
  fn (Simpset {mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac}) =>
wenzelm@3551
   358
    let
nipkow@4612
   359
      fun simp_loop_tac i =
nipkow@4612
   360
        asm_rewrite_goal_tac mode
nipkow@4668
   361
          (solve_all_tac (subgoal_tac,loop_tacs,finish_tac,unsafe_finish_tac))
nipkow@4612
   362
          mss i
nipkow@4612
   363
        THEN (finish_tac (prems_of_mss mss) i ORELSE
nipkow@4668
   364
              TRY ((loop_tac loop_tacs THEN_ALL_NEW simp_loop_tac) i))
nipkow@4612
   365
    in simp_loop_tac end;
clasohm@0
   366
wenzelm@3551
   367
fun gen_simp_tac mode (ss as Simpset {unsafe_finish_tac, ...}) =
wenzelm@3551
   368
  basic_gen_simp_tac mode (ss setSSolver unsafe_finish_tac);
wenzelm@3551
   369
nipkow@4713
   370
val          simp_tac = gen_simp_tac (false, false, false);
nipkow@4713
   371
val      asm_simp_tac = gen_simp_tac (false, true, false);
nipkow@4713
   372
val     full_simp_tac = gen_simp_tac (true,  false, false);
nipkow@4722
   373
val   asm_lr_simp_tac = gen_simp_tac (true,  true, false);
nipkow@4722
   374
val asm_full_simp_tac = gen_simp_tac (true,  true, true);
clasohm@0
   375
oheimb@2629
   376
(*not totally safe: may instantiate unknowns that appear also in other subgoals*)
nipkow@4713
   377
val safe_asm_full_simp_tac = basic_gen_simp_tac (true, true, false);
oheimb@2629
   378
wenzelm@4795
   379
(*the abstraction over the proof state delays the dereferencing*)
wenzelm@4080
   380
fun          Simp_tac i st =          simp_tac (simpset ()) i st;
wenzelm@4080
   381
fun      Asm_simp_tac i st =      asm_simp_tac (simpset ()) i st;
wenzelm@4080
   382
fun     Full_simp_tac i st =     full_simp_tac (simpset ()) i st;
nipkow@4722
   383
fun   Asm_lr_simp_tac i st =   asm_lr_simp_tac (simpset ()) i st;
wenzelm@4080
   384
fun Asm_full_simp_tac i st = asm_full_simp_tac (simpset ()) i st;
nipkow@406
   385
wenzelm@3557
   386
wenzelm@4795
   387
wenzelm@5082
   388
(** simplification rules and conversions **)
wenzelm@3557
   389
wenzelm@5082
   390
fun simp rew mode (Simpset {mss, subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac}) thm =
wenzelm@3557
   391
  let
nipkow@4668
   392
    val tacf = solve_all_tac (subgoal_tac, loop_tacs, finish_tac, unsafe_finish_tac);
wenzelm@4271
   393
    fun prover m th = apsome fst (Seq.pull (tacf m th));
wenzelm@5082
   394
  in rew mode prover mss thm end;
wenzelm@5082
   395
wenzelm@5082
   396
val simp_thm = simp Drule.rewrite_thm;
wenzelm@5082
   397
val simp_cterm = simp Drule.rewrite_cterm;
wenzelm@3557
   398
wenzelm@5082
   399
val          simplify = simp_thm (false, false, false);
wenzelm@5082
   400
val      asm_simplify = simp_thm (false, true, false);
wenzelm@5082
   401
val     full_simplify = simp_thm (true, false, false);
wenzelm@5082
   402
val asm_full_simplify = simp_thm (true, true, false);
wenzelm@5082
   403
wenzelm@5082
   404
val          rewrite = simp_cterm (false, false, false);
wenzelm@5082
   405
val      asm_rewrite = simp_cterm (false, true, false);
wenzelm@5082
   406
val     full_rewrite = simp_cterm (true, false, false);
wenzelm@5082
   407
val asm_full_rewrite = simp_cterm (true, true, false);
wenzelm@3557
   408
wenzelm@3557
   409
wenzelm@4795
   410
wenzelm@5886
   411
(** concrete syntax of attributes **)
wenzelm@5842
   412
wenzelm@5886
   413
(* add / del *)
wenzelm@5842
   414
wenzelm@5928
   415
val simpN = "simp";
wenzelm@6911
   416
val asm_simpN = "asm_simp";
wenzelm@5928
   417
val addN = "add";
wenzelm@5928
   418
val delN = "del";
wenzelm@6911
   419
val onlyN = "only";
wenzelm@5928
   420
val otherN = "other";
wenzelm@5842
   421
wenzelm@5886
   422
fun simp_att change =
wenzelm@5928
   423
  (Args.$$$ addN >> K (op addsimps) ||
wenzelm@5928
   424
    Args.$$$ delN >> K (op delsimps) ||
wenzelm@6911
   425
    Args.$$$ onlyN >> K onlysimps ||
wenzelm@5886
   426
    Scan.succeed (op addsimps))
wenzelm@5886
   427
  >> change
wenzelm@5886
   428
  |> Scan.lift
wenzelm@5886
   429
  |> Attrib.syntax;
wenzelm@5842
   430
wenzelm@5886
   431
val simp_attr = (simp_att change_global_ss, simp_att change_local_ss);
wenzelm@5842
   432
wenzelm@5842
   433
wenzelm@5842
   434
(* conversions *)
wenzelm@5842
   435
wenzelm@5842
   436
fun conv_attr f =
wenzelm@6096
   437
  (Attrib.no_args (Drule.rule_attribute (f o simpset_of)),
wenzelm@6096
   438
    Attrib.no_args (Drule.rule_attribute (f o get_local_simpset)));
wenzelm@5842
   439
wenzelm@5842
   440
wenzelm@5842
   441
(* setup_attrs *)
wenzelm@5842
   442
wenzelm@5842
   443
val setup_attrs = Attrib.add_attributes
wenzelm@5928
   444
 [(simpN,               simp_attr, "simplification rule"),
wenzelm@5842
   445
  ("simplify",          conv_attr simplify, "simplify rule"),
wenzelm@5842
   446
  ("asm_simplify",      conv_attr asm_simplify, "simplify rule, using assumptions"),
wenzelm@5842
   447
  ("full_simplify",     conv_attr full_simplify, "fully simplify rule"),
wenzelm@5842
   448
  ("asm_full_simplify", conv_attr asm_full_simplify, "fully simplify rule, using assumptions")];
wenzelm@5842
   449
wenzelm@5842
   450
wenzelm@5842
   451
wenzelm@5842
   452
(** proof methods **)
wenzelm@5842
   453
wenzelm@5842
   454
(* simplification *)
wenzelm@5842
   455
wenzelm@5928
   456
val simp_modifiers =
wenzelm@5928
   457
 [Args.$$$ simpN -- Args.$$$ addN >> K simp_add_local,
wenzelm@5928
   458
  Args.$$$ simpN -- Args.$$$ delN >> K simp_del_local,
wenzelm@6911
   459
  Args.$$$ simpN -- Args.$$$ onlyN >> K simp_only_local,
wenzelm@6911
   460
  Args.$$$ otherN >> K I];
wenzelm@5928
   461
wenzelm@5928
   462
val simp_modifiers' =
wenzelm@5928
   463
 [Args.$$$ addN >> K simp_add_local,
wenzelm@5928
   464
  Args.$$$ delN >> K simp_del_local,
wenzelm@6911
   465
  Args.$$$ onlyN >> K simp_only_local,
wenzelm@5928
   466
  Args.$$$ otherN >> K I];
wenzelm@5928
   467
wenzelm@5928
   468
val simp_args = Method.only_sectioned_args simp_modifiers';
wenzelm@5842
   469
wenzelm@6911
   470
fun simp_meth thin cut tac ctxt = Method.METHOD (fn facts =>
wenzelm@6534
   471
  FIRSTGOAL
wenzelm@6911
   472
    ((if thin then REPEAT_DETERM o etac Drule.thin_rl else K all_tac)
wenzelm@6994
   473
      THEN' (if cut then Method.same_tac facts else K all_tac)
wenzelm@6534
   474
      THEN' tac (get_local_simpset ctxt)));
wenzelm@5842
   475
wenzelm@6911
   476
val simp_method = simp_args ooo simp_meth;
wenzelm@5842
   477
wenzelm@5842
   478
wenzelm@5842
   479
(* setup_methods *)
wenzelm@5842
   480
wenzelm@5842
   481
val setup_methods = Method.add_methods
wenzelm@6911
   482
 [(simpN,               simp_method true true asm_full_simp_tac, "simplification"),
wenzelm@6911
   483
  (asm_simpN,           simp_method false true asm_full_simp_tac,
wenzelm@6911
   484
    "simplification (including assumption)"),
wenzelm@7132
   485
  ("simp_tac",          simp_method false false simp_tac, "simp_tac (improper!)"),
wenzelm@7132
   486
  ("asm_simp_tac",      simp_method false false asm_simp_tac, "asm_simp_tac (improper!)"),
wenzelm@7132
   487
  ("full_simp_tac",     simp_method false false full_simp_tac, "full_simp_tac (improper!)"),
wenzelm@7132
   488
  ("asm_full_simp_tac", simp_method false false asm_full_simp_tac, "asm_full_simp_tac (improper!)"),
wenzelm@7132
   489
  ("asm_lr_simp_tac",   simp_method false false asm_lr_simp_tac, "asm_lr_simp_tac (improper!)")];
wenzelm@5842
   490
wenzelm@5842
   491
wenzelm@5842
   492
wenzelm@4795
   493
(** theory setup **)
wenzelm@4795
   494
wenzelm@5842
   495
val setup = [GlobalSimpset.init, LocalSimpset.init, setup_attrs, setup_methods];
wenzelm@4795
   496
wenzelm@4795
   497
clasohm@1243
   498
end;
wenzelm@4795
   499
wenzelm@4795
   500
wenzelm@4795
   501
structure BasicSimplifier: BASIC_SIMPLIFIER = Simplifier;
wenzelm@4795
   502
open BasicSimplifier;