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