src/Provers/clasimp.ML
author paulson
Tue Aug 16 15:36:28 2005 +0200 (2005-08-16)
changeset 17084 fb0a80aef0be
parent 16019 0e1405402d53
child 17879 88844eea4ce2
permissions -rw-r--r--
classical rules must have names for ATP integration
wenzelm@9772
     1
(*  Title:      Provers/clasimp.ML
oheimb@4652
     2
    ID:         $Id$
oheimb@4652
     3
    Author:     David von Oheimb, TU Muenchen
oheimb@4652
     4
wenzelm@5219
     5
Combination of classical reasoner and simplifier (depends on
wenzelm@16019
     6
splitter.ML, classical.ML, blast.ML).
oheimb@4652
     7
*)
oheimb@4652
     8
wenzelm@9860
     9
infix 4 addSIs2 addSEs2 addSDs2 addIs2 addEs2 addDs2 addsimps2 delsimps2
berghofe@13603
    10
  addSss addss addss' addIffs delIffs;
oheimb@4652
    11
wenzelm@5219
    12
signature CLASIMP_DATA =
wenzelm@5219
    13
sig
wenzelm@5219
    14
  structure Simplifier: SIMPLIFIER
wenzelm@8469
    15
  structure Splitter: SPLITTER
wenzelm@5219
    16
  structure Classical: CLASSICAL
wenzelm@5219
    17
  structure Blast: BLAST
wenzelm@5219
    18
  sharing type Classical.claset = Blast.claset
wenzelm@9860
    19
  val notE: thm
wenzelm@9860
    20
  val iffD1: thm
wenzelm@9860
    21
  val iffD2: thm
wenzelm@9860
    22
  val cla_make_elim: thm -> thm
wenzelm@5219
    23
end
wenzelm@5219
    24
oheimb@4652
    25
signature CLASIMP =
oheimb@4652
    26
sig
wenzelm@5219
    27
  include CLASIMP_DATA
wenzelm@5219
    28
  type claset
wenzelm@5219
    29
  type simpset
wenzelm@5219
    30
  type clasimpset
wenzelm@10317
    31
  val clasimpset: unit -> clasimpset
wenzelm@9860
    32
  val addSIs2: clasimpset * thm list -> clasimpset
wenzelm@9860
    33
  val addSEs2: clasimpset * thm list -> clasimpset
wenzelm@9860
    34
  val addSDs2: clasimpset * thm list -> clasimpset
wenzelm@9860
    35
  val addIs2: clasimpset * thm list -> clasimpset
wenzelm@9860
    36
  val addEs2: clasimpset * thm list -> clasimpset
wenzelm@9860
    37
  val addDs2: clasimpset * thm list -> clasimpset
wenzelm@9860
    38
  val addsimps2: clasimpset * thm list -> clasimpset
wenzelm@9860
    39
  val delsimps2: clasimpset * thm list -> clasimpset
wenzelm@9860
    40
  val addSss: claset * simpset -> claset
wenzelm@9860
    41
  val addss: claset * simpset -> claset
berghofe@13603
    42
  val addss': claset * simpset -> claset
wenzelm@9860
    43
  val addIffs: clasimpset * thm list -> clasimpset
wenzelm@9860
    44
  val delIffs: clasimpset * thm list -> clasimpset
wenzelm@9860
    45
  val AddIffs: thm list -> unit
wenzelm@9860
    46
  val DelIffs: thm list -> unit
wenzelm@9860
    47
  val CLASIMPSET: (clasimpset -> tactic) -> tactic
wenzelm@9860
    48
  val CLASIMPSET': (clasimpset -> 'a -> tactic) -> 'a -> tactic
oheimb@5483
    49
  val clarsimp_tac: clasimpset -> int -> tactic
wenzelm@9860
    50
  val Clarsimp_tac: int -> tactic
wenzelm@9860
    51
  val mk_auto_tac: clasimpset -> int -> int -> tactic
wenzelm@9860
    52
  val auto_tac: clasimpset -> tactic
wenzelm@9860
    53
  val Auto_tac: tactic
wenzelm@9860
    54
  val auto: unit -> unit
wenzelm@9860
    55
  val force_tac: clasimpset  -> int -> tactic
wenzelm@9860
    56
  val Force_tac: int -> tactic
wenzelm@9860
    57
  val force: int -> unit
wenzelm@9860
    58
  val fast_simp_tac: clasimpset -> int -> tactic
wenzelm@9860
    59
  val slow_simp_tac: clasimpset -> int -> tactic
wenzelm@9860
    60
  val best_simp_tac: clasimpset -> int -> tactic
wenzelm@8639
    61
  val change_global_css: (clasimpset * thm list -> clasimpset) -> theory attribute
wenzelm@8639
    62
  val change_local_css: (clasimpset * thm list -> clasimpset) -> Proof.context attribute
wenzelm@9506
    63
  val get_local_clasimpset: Proof.context -> clasimpset
wenzelm@15032
    64
  val local_clasimpset_of: Proof.context -> clasimpset
wenzelm@9860
    65
  val iff_add_global: theory attribute
wenzelm@10033
    66
  val iff_add_global': theory attribute
wenzelm@9860
    67
  val iff_del_global: theory attribute
wenzelm@9860
    68
  val iff_add_local: Proof.context attribute
wenzelm@10033
    69
  val iff_add_local': Proof.context attribute
wenzelm@9860
    70
  val iff_del_local: Proof.context attribute
wenzelm@9860
    71
  val iff_modifiers: (Args.T list -> (Method.modifier * Args.T list)) list
wenzelm@9506
    72
  val clasimp_modifiers: (Args.T list -> (Method.modifier * Args.T list)) list
wenzelm@9860
    73
  val setup: (theory -> theory) list
oheimb@4652
    74
end;
oheimb@4652
    75
wenzelm@5219
    76
functor ClasimpFun(Data: CLASIMP_DATA): CLASIMP =
oheimb@4652
    77
struct
oheimb@4652
    78
wenzelm@5219
    79
open Data;
wenzelm@5219
    80
wenzelm@5219
    81
type claset = Classical.claset;
wenzelm@5219
    82
type simpset = Simplifier.simpset;
wenzelm@5219
    83
type clasimpset = claset * simpset;
wenzelm@5219
    84
wenzelm@10317
    85
fun clasimpset () = (Classical.claset (), Simplifier.simpset ());
wenzelm@10317
    86
wenzelm@5219
    87
wenzelm@5219
    88
(* clasimpset operations *)
wenzelm@5219
    89
wenzelm@5219
    90
(*this interface for updating a clasimpset is rudimentary and just for
wenzelm@5219
    91
  convenience for the most common cases*)
wenzelm@5219
    92
wenzelm@5219
    93
fun pair_upd1 f ((a,b),x) = (f(a,x), b);
wenzelm@5219
    94
fun pair_upd2 f ((a,b),x) = (a, f(b,x));
wenzelm@5219
    95
wenzelm@5219
    96
fun op addSIs2   arg = pair_upd1 Classical.addSIs arg;
wenzelm@5219
    97
fun op addSEs2   arg = pair_upd1 Classical.addSEs arg;
wenzelm@5219
    98
fun op addSDs2   arg = pair_upd1 Classical.addSDs arg;
wenzelm@5219
    99
fun op addIs2    arg = pair_upd1 Classical.addIs arg;
wenzelm@5219
   100
fun op addEs2    arg = pair_upd1 Classical.addEs arg;
wenzelm@5219
   101
fun op addDs2    arg = pair_upd1 Classical.addDs arg;
wenzelm@5219
   102
fun op addsimps2 arg = pair_upd2 Simplifier.addsimps arg;
wenzelm@5219
   103
fun op delsimps2 arg = pair_upd2 Simplifier.delsimps arg;
oheimb@4652
   104
oheimb@9402
   105
(*not totally safe: may instantiate unknowns that appear also in other subgoals*)
oheimb@9402
   106
val safe_asm_full_simp_tac = Simplifier.generic_simp_tac true (true,true,true);
oheimb@9402
   107
oheimb@4652
   108
(*Add a simpset to a classical set!*)
oheimb@4652
   109
(*Caution: only one simpset added can be added by each of addSss and addss*)
oheimb@11181
   110
fun cs addSss ss = Classical.addSafter (cs, ("safe_asm_full_simp_tac",
wenzelm@9772
   111
                            CHANGED o safe_asm_full_simp_tac ss));
wenzelm@9772
   112
fun cs addss  ss = Classical.addbefore  (cs, ("asm_full_simp_tac",
wenzelm@9772
   113
                            CHANGED o Simplifier.asm_full_simp_tac ss));
berghofe@13603
   114
fun cs addss' ss = Classical.addbefore  (cs, ("asm_full_simp_tac",
berghofe@13603
   115
                            CHANGED o Simplifier.asm_lr_simp_tac ss));
oheimb@4652
   116
paulson@17084
   117
(*Attach a suffix, provided we have a name to start with.*)
paulson@17084
   118
fun suffix_thm "" _ th = th
paulson@17084
   119
  | suffix_thm a b th = Thm.name_thm (a^b, th);
wenzelm@9860
   120
wenzelm@9860
   121
(* iffs: addition of rules to simpsets and clasets simultaneously *)
wenzelm@9860
   122
oheimb@11344
   123
(*Takes (possibly conditional) theorems of the form A<->B to
wenzelm@9860
   124
        the Safe Intr     rule B==>A and
wenzelm@9860
   125
        the Safe Destruct rule A==>B.
wenzelm@9860
   126
  Also ~A goes to the Safe Elim rule A ==> ?R
paulson@11462
   127
  Failing other cases, A is added as a Safe Intr rule*)
wenzelm@9860
   128
local
wenzelm@9860
   129
wenzelm@13026
   130
fun addIff decls1 decls2 simp ((cs, ss), th) =
wenzelm@13026
   131
  let
paulson@17084
   132
    val name = Thm.name_of_thm th;
wenzelm@13026
   133
    val n = nprems_of th;
paulson@17084
   134
    val (elim, intro) = if n = 0 then decls1 else decls2;
wenzelm@13026
   135
    val zero_rotate = zero_var_indexes o rotate_prems n;
wenzelm@13026
   136
  in
paulson@17084
   137
    (elim (intro (cs, [suffix_thm name "_iff2" (zero_rotate (th RS Data.iffD2))]),
paulson@17084
   138
           [suffix_thm name "_iff1" (Data.cla_make_elim (zero_rotate (th RS Data.iffD1)))])
paulson@17084
   139
      handle THM _ => (elim (cs, [suffix_thm name "_iff" (zero_rotate (th RS Data.notE))])
wenzelm@11902
   140
        handle THM _ => intro (cs, [th])),
wenzelm@11902
   141
     simp (ss, [th]))
wenzelm@11902
   142
  end;
wenzelm@9860
   143
wenzelm@12375
   144
fun delIff delcs delss ((cs, ss), th) =
wenzelm@11902
   145
  let val zero_rotate = zero_var_indexes o rotate_prems (nprems_of th) in
wenzelm@12375
   146
    (delcs (cs, [zero_rotate (th RS Data.iffD2),
wenzelm@11902
   147
        Data.cla_make_elim (zero_rotate (th RS Data.iffD1))])
wenzelm@12375
   148
      handle THM _ => (delcs (cs, [zero_rotate (th RS Data.notE)])
wenzelm@12375
   149
        handle THM _ => delcs (cs, [th])),
wenzelm@12375
   150
     delss (ss, [th]))
wenzelm@11902
   151
  end;
wenzelm@9860
   152
wenzelm@10033
   153
fun store_clasimp (cs, ss) =
wenzelm@10033
   154
  (Classical.claset_ref () := cs; Simplifier.simpset_ref () := ss);
wenzelm@9860
   155
wenzelm@9860
   156
in
wenzelm@9860
   157
wenzelm@10033
   158
val op addIffs =
paulson@17084
   159
  Library.foldl 
paulson@17084
   160
      (addIff (Classical.addSEs, Classical.addSIs)
paulson@17084
   161
              (Classical.addEs, Classical.addIs) 
paulson@17084
   162
              Simplifier.addsimps);
skalberg@15570
   163
val op delIffs = Library.foldl (delIff Classical.delrules Simplifier.delsimps);
wenzelm@10033
   164
wenzelm@10317
   165
fun AddIffs thms = store_clasimp (clasimpset () addIffs thms);
wenzelm@10317
   166
fun DelIffs thms = store_clasimp (clasimpset () delIffs thms);
wenzelm@9860
   167
wenzelm@12375
   168
fun addIffs_global (thy, ths) =
skalberg@15570
   169
  Library.foldl (addIff
paulson@17084
   170
    (ContextRules.addXEs_global, ContextRules.addXIs_global)
paulson@17084
   171
    (ContextRules.addXEs_global, ContextRules.addXIs_global) #1)
wenzelm@13026
   172
  ((thy, ()), ths) |> #1;
wenzelm@12375
   173
wenzelm@12375
   174
fun addIffs_local (ctxt, ths) =
skalberg@15570
   175
  Library.foldl (addIff
paulson@17084
   176
    (ContextRules.addXEs_local, ContextRules.addXIs_local)
paulson@17084
   177
    (ContextRules.addXEs_local, ContextRules.addXIs_local) #1)
wenzelm@13026
   178
  ((ctxt, ()), ths) |> #1;
wenzelm@12375
   179
wenzelm@12375
   180
fun delIffs_global (thy, ths) =
skalberg@15570
   181
  Library.foldl (delIff ContextRules.delrules_global #1) ((thy, ()), ths) |> #1;
wenzelm@12375
   182
wenzelm@12375
   183
fun delIffs_local (ctxt, ths) =
skalberg@15570
   184
  Library.foldl (delIff ContextRules.delrules_local #1) ((ctxt, ()), ths) |> #1;
wenzelm@12375
   185
wenzelm@9860
   186
end;
wenzelm@9860
   187
wenzelm@9860
   188
wenzelm@5219
   189
(* tacticals *)
wenzelm@5219
   190
wenzelm@5219
   191
fun CLASIMPSET tacf state =
wenzelm@5219
   192
  Classical.CLASET (fn cs => Simplifier.SIMPSET (fn ss => tacf (cs, ss))) state;
wenzelm@5219
   193
wenzelm@5219
   194
fun CLASIMPSET' tacf i state =
wenzelm@5219
   195
  Classical.CLASET (fn cs => Simplifier.SIMPSET (fn ss => tacf (cs, ss) i)) state;
wenzelm@4888
   196
wenzelm@4888
   197
wenzelm@12375
   198
fun clarsimp_tac (cs, ss) =
wenzelm@12375
   199
  safe_asm_full_simp_tac ss THEN_ALL_NEW
wenzelm@12375
   200
  Classical.clarify_tac (cs addSss ss);
wenzelm@12375
   201
wenzelm@10317
   202
fun Clarsimp_tac i = clarsimp_tac (clasimpset ()) i;
oheimb@5483
   203
oheimb@5483
   204
wenzelm@5219
   205
(* auto_tac *)
oheimb@4652
   206
wenzelm@5219
   207
fun blast_depth_tac cs m i thm =
wenzelm@9772
   208
    Blast.depth_tac cs m i thm
oheimb@5554
   209
      handle Blast.TRANS s => (warning ("Blast_tac: " ^ s); Seq.empty);
wenzelm@9772
   210
wenzelm@9772
   211
(* a variant of depth_tac that avoids interference of the simplifier
wenzelm@5219
   212
   with dup_step_tac when they are combined by auto_tac *)
oheimb@5756
   213
local
wenzelm@9772
   214
fun slow_step_tac' cs = Classical.appWrappers cs
wenzelm@9772
   215
        (Classical.instp_step_tac cs APPEND' Classical.haz_step_tac cs);
wenzelm@9772
   216
in fun nodup_depth_tac cs m i state = SELECT_GOAL
wenzelm@9772
   217
   (Classical.safe_steps_tac cs 1 THEN_ELSE
wenzelm@9772
   218
        (DEPTH_SOLVE (nodup_depth_tac cs m 1),
wenzelm@9772
   219
         Classical.inst0_step_tac cs 1 APPEND COND (K (m=0)) no_tac
wenzelm@9772
   220
             (slow_step_tac' cs 1 THEN DEPTH_SOLVE (nodup_depth_tac cs (m-1) 1))
oheimb@5756
   221
        )) i state;
oheimb@5756
   222
end;
oheimb@4652
   223
oheimb@9402
   224
(*Designed to be idempotent, except if blast_depth_tac instantiates variables
oheimb@4652
   225
  in some of the subgoals*)
oheimb@4652
   226
fun mk_auto_tac (cs, ss) m n =
wenzelm@5219
   227
    let val cs' = cs addss ss
wenzelm@9772
   228
        val maintac =
wenzelm@9772
   229
          blast_depth_tac cs m               (* fast but can't use wrappers *)
oheimb@4652
   230
          ORELSE'
oheimb@5756
   231
          (CHANGED o nodup_depth_tac cs' n); (* slower but more general *)
wenzelm@5219
   232
    in  EVERY [ALLGOALS (Simplifier.asm_full_simp_tac ss),
wenzelm@9772
   233
               TRY (Classical.safe_tac cs),
wenzelm@9772
   234
               REPEAT (FIRSTGOAL maintac),
wenzelm@5219
   235
               TRY (Classical.safe_tac (cs addSss ss)),
wenzelm@9772
   236
               prune_params_tac]
oheimb@4652
   237
    end;
oheimb@4652
   238
wenzelm@9772
   239
fun auto_tac css = mk_auto_tac css 4 2;
wenzelm@10317
   240
fun Auto_tac st = auto_tac (clasimpset ()) st;
oheimb@4652
   241
fun auto () = by Auto_tac;
oheimb@4652
   242
wenzelm@9772
   243
wenzelm@5219
   244
(* force_tac *)
wenzelm@5219
   245
oheimb@4659
   246
(* aimed to solve the given subgoal totally, using whatever tools possible *)
oheimb@4717
   247
fun force_tac (cs,ss) = let val cs' = cs addss ss in SELECT_GOAL (EVERY [
wenzelm@9772
   248
        Classical.clarify_tac cs' 1,
wenzelm@9772
   249
        IF_UNSOLVED (Simplifier.asm_full_simp_tac ss 1),
wenzelm@9772
   250
        ALLGOALS (Classical.first_best_tac cs')]) end;
wenzelm@10317
   251
fun Force_tac i = force_tac (clasimpset ()) i;
oheimb@4717
   252
fun force i = by (Force_tac i);
oheimb@4659
   253
wenzelm@5219
   254
wenzelm@9805
   255
(* basic combinations *)
wenzelm@9805
   256
wenzelm@9805
   257
fun ADDSS tac (cs, ss) = let val cs' = cs addss ss in tac cs' end;
wenzelm@9591
   258
wenzelm@9805
   259
val fast_simp_tac = ADDSS Classical.fast_tac;
wenzelm@9805
   260
val slow_simp_tac = ADDSS Classical.slow_tac;
wenzelm@9805
   261
val best_simp_tac = ADDSS Classical.best_tac;
wenzelm@9591
   262
wenzelm@9591
   263
wenzelm@9860
   264
(* access clasimpset *)
wenzelm@8639
   265
wenzelm@8639
   266
fun change_global_css f (thy, th) =
wenzelm@8639
   267
  let
wenzelm@8639
   268
    val cs_ref = Classical.claset_ref_of thy;
wenzelm@8639
   269
    val ss_ref = Simplifier.simpset_ref_of thy;
wenzelm@8639
   270
    val (cs', ss') = f ((! cs_ref, ! ss_ref), [th]);
wenzelm@8639
   271
  in cs_ref := cs'; ss_ref := ss'; (thy, th) end;
wenzelm@8639
   272
wenzelm@8639
   273
fun change_local_css f (ctxt, th) =
wenzelm@8639
   274
  let
wenzelm@8639
   275
    val cs = Classical.get_local_claset ctxt;
wenzelm@8639
   276
    val ss = Simplifier.get_local_simpset ctxt;
wenzelm@8639
   277
    val (cs', ss') = f ((cs, ss), [th]);
wenzelm@8639
   278
    val ctxt' =
wenzelm@8639
   279
      ctxt
wenzelm@8639
   280
      |> Classical.put_local_claset cs'
wenzelm@8639
   281
      |> Simplifier.put_local_simpset ss';
wenzelm@8639
   282
  in (ctxt', th) end;
wenzelm@8639
   283
wenzelm@7153
   284
fun get_local_clasimpset ctxt =
wenzelm@7153
   285
  (Classical.get_local_claset ctxt, Simplifier.get_local_simpset ctxt);
wenzelm@5926
   286
wenzelm@15032
   287
fun local_clasimpset_of ctxt =
wenzelm@15032
   288
  (Classical.local_claset_of ctxt, Simplifier.local_simpset_of ctxt);
wenzelm@15032
   289
wenzelm@9860
   290
wenzelm@9860
   291
(* attributes *)
wenzelm@9860
   292
wenzelm@12375
   293
fun change_rules f (x, th) = (f (x, [th]), th);
wenzelm@12375
   294
wenzelm@9860
   295
val iff_add_global = change_global_css (op addIffs);
wenzelm@12375
   296
val iff_add_global' = change_rules addIffs_global;
wenzelm@12375
   297
val iff_del_global = change_global_css (op delIffs) o change_rules delIffs_global;
wenzelm@9860
   298
val iff_add_local = change_local_css (op addIffs);
wenzelm@12375
   299
val iff_add_local' = change_rules addIffs_local;
wenzelm@12375
   300
val iff_del_local = change_local_css (op delIffs) o change_rules delIffs_local;
wenzelm@9860
   301
wenzelm@10033
   302
fun iff_att add add' del = Attrib.syntax (Scan.lift
wenzelm@10033
   303
 (Args.del >> K del ||
wenzelm@10033
   304
  Scan.option Args.add -- Args.query >> K add' ||
wenzelm@10033
   305
  Scan.option Args.add >> K add));
wenzelm@10033
   306
wenzelm@9860
   307
val iff_attr =
wenzelm@10033
   308
 (iff_att iff_add_global iff_add_global' iff_del_global,
wenzelm@10033
   309
  iff_att iff_add_local iff_add_local' iff_del_local);
wenzelm@9860
   310
wenzelm@9860
   311
wenzelm@9860
   312
(* method modifiers *)
wenzelm@9860
   313
wenzelm@9860
   314
val iffN = "iff";
wenzelm@9860
   315
wenzelm@9860
   316
val iff_modifiers =
wenzelm@10033
   317
 [Args.$$$ iffN -- Scan.option Args.add -- Args.colon >> K ((I, iff_add_local): Method.modifier),
wenzelm@10033
   318
  Args.$$$ iffN -- Scan.option Args.add -- Args.query_colon >> K (I, iff_add_local'),
wenzelm@10033
   319
  Args.$$$ iffN -- Args.del -- Args.colon >> K (I, iff_del_local)];
wenzelm@9860
   320
wenzelm@8469
   321
val clasimp_modifiers =
wenzelm@9860
   322
  Simplifier.simp_modifiers @ Splitter.split_modifiers @
wenzelm@9860
   323
  Classical.cla_modifiers @ iff_modifiers;
wenzelm@9860
   324
wenzelm@9860
   325
wenzelm@9860
   326
(* methods *)
wenzelm@5926
   327
wenzelm@7559
   328
fun clasimp_meth tac prems ctxt = Method.METHOD (fn facts =>
wenzelm@15032
   329
  ALLGOALS (Method.insert_tac (prems @ facts)) THEN tac (local_clasimpset_of ctxt));
wenzelm@7132
   330
wenzelm@7559
   331
fun clasimp_meth' tac prems ctxt = Method.METHOD (fn facts =>
wenzelm@15032
   332
  HEADGOAL (Method.insert_tac (prems @ facts) THEN' tac (local_clasimpset_of ctxt)));
wenzelm@5926
   333
wenzelm@7559
   334
val clasimp_method = Method.bang_sectioned_args clasimp_modifiers o clasimp_meth;
wenzelm@7559
   335
val clasimp_method' = Method.bang_sectioned_args clasimp_modifiers o clasimp_meth';
wenzelm@5926
   336
wenzelm@5926
   337
wenzelm@9772
   338
fun auto_args m =
wenzelm@9772
   339
  Method.bang_sectioned_args' clasimp_modifiers (Scan.lift (Scan.option (Args.nat -- Args.nat))) m;
wenzelm@9772
   340
skalberg@15531
   341
fun auto_meth NONE = clasimp_meth (CHANGED_PROP o auto_tac)
skalberg@15531
   342
  | auto_meth (SOME (m, n)) = clasimp_meth (CHANGED_PROP o (fn css => mk_auto_tac css m n));
wenzelm@9772
   343
wenzelm@9772
   344
wenzelm@9772
   345
(* theory setup *)
wenzelm@9772
   346
wenzelm@5926
   347
val setup =
wenzelm@9860
   348
 [Attrib.add_attributes
wenzelm@9893
   349
  [("iff", iff_attr, "declaration of Simplifier / Classical rules")],
wenzelm@9860
   350
  Method.add_methods
wenzelm@9591
   351
   [("fastsimp", clasimp_method' fast_simp_tac, "combined fast and simp"),
wenzelm@9805
   352
    ("slowsimp", clasimp_method' slow_simp_tac, "combined slow and simp"),
wenzelm@9805
   353
    ("bestsimp", clasimp_method' best_simp_tac, "combined best and simp"),
wenzelm@9591
   354
    ("force", clasimp_method' force_tac, "force"),
wenzelm@9772
   355
    ("auto", auto_args auto_meth, "auto"),
wenzelm@10821
   356
    ("clarsimp", clasimp_method' (CHANGED_PROP oo clarsimp_tac), "clarify simplified goal")]];
wenzelm@5926
   357
oheimb@4652
   358
end;