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