src/Provers/classical.ML
author wenzelm
Sat Dec 31 21:49:42 2005 +0100 (2005-12-31)
changeset 18534 6799b38ed872
parent 18374 598e7fd7438b
child 18557 60a0f9caa0a2
permissions -rw-r--r--
added classical_rule, which replaces Data.make_elim;
removed obsolete Data.make_elim and classical elim_format attribute;
tuned;
wenzelm@9938
     1
(*  Title:      Provers/classical.ML
clasohm@0
     2
    ID:         $Id$
wenzelm@9938
     3
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
clasohm@0
     4
    Copyright   1992  University of Cambridge
clasohm@0
     5
clasohm@0
     6
Theorem prover for classical reasoning, including predicate calculus, set
clasohm@0
     7
theory, etc.
clasohm@0
     8
wenzelm@9563
     9
Rules must be classified as intro, elim, safe, hazardous (unsafe).
clasohm@0
    10
clasohm@0
    11
A rule is unsafe unless it can be applied blindly without harmful results.
clasohm@0
    12
For a rule to be safe, its premises and conclusion should be logically
clasohm@0
    13
equivalent.  There should be no variables in the premises that are not in
clasohm@0
    14
the conclusion.
clasohm@0
    15
*)
clasohm@0
    16
wenzelm@4079
    17
(*higher precedence than := facilitates use of references*)
wenzelm@12376
    18
infix 4 addSIs addSEs addSDs addIs addEs addDs delrules
oheimb@4651
    19
  addSWrapper delSWrapper addWrapper delWrapper
oheimb@11181
    20
  addSbefore addSafter addbefore addafter
oheimb@5523
    21
  addD2 addE2 addSD2 addSE2;
wenzelm@4079
    22
wenzelm@4079
    23
wenzelm@4079
    24
(*should be a type abbreviation in signature CLASSICAL*)
wenzelm@4079
    25
type netpair = (int * (bool * thm)) Net.net * (int * (bool * thm)) Net.net;
oheimb@4651
    26
type wrapper = (int -> tactic) -> (int -> tactic);
wenzelm@4079
    27
clasohm@0
    28
signature CLASSICAL_DATA =
wenzelm@4079
    29
sig
wenzelm@9938
    30
  val mp        : thm           (* [| P-->Q;  P |] ==> Q *)
wenzelm@9938
    31
  val not_elim  : thm           (* [| ~P;  P |] ==> R *)
wenzelm@9938
    32
  val classical : thm           (* (~P ==> P) ==> P *)
wenzelm@9938
    33
  val sizef     : thm -> int    (* size function for BEST_FIRST *)
clasohm@0
    34
  val hyp_subst_tacs: (int -> tactic) list
wenzelm@4079
    35
end;
clasohm@0
    36
wenzelm@5841
    37
signature BASIC_CLASSICAL =
wenzelm@4079
    38
sig
clasohm@0
    39
  type claset
wenzelm@4079
    40
  val empty_cs: claset
wenzelm@4079
    41
  val print_cs: claset -> unit
wenzelm@4380
    42
  val print_claset: theory -> unit
wenzelm@18534
    43
  val rep_cs:
wenzelm@4079
    44
    claset -> {safeIs: thm list, safeEs: thm list,
wenzelm@9938
    45
                 hazIs: thm list, hazEs: thm list,
wenzelm@10736
    46
                 swrappers: (string * wrapper) list,
wenzelm@9938
    47
                 uwrappers: (string * wrapper) list,
wenzelm@9938
    48
                 safe0_netpair: netpair, safep_netpair: netpair,
wenzelm@12401
    49
                 haz_netpair: netpair, dup_netpair: netpair,
wenzelm@12401
    50
                 xtra_netpair: ContextRules.netpair}
wenzelm@9938
    51
  val merge_cs          : claset * claset -> claset
wenzelm@9938
    52
  val addDs             : claset * thm list -> claset
wenzelm@9938
    53
  val addEs             : claset * thm list -> claset
wenzelm@9938
    54
  val addIs             : claset * thm list -> claset
wenzelm@9938
    55
  val addSDs            : claset * thm list -> claset
wenzelm@9938
    56
  val addSEs            : claset * thm list -> claset
wenzelm@9938
    57
  val addSIs            : claset * thm list -> claset
wenzelm@9938
    58
  val delrules          : claset * thm list -> claset
wenzelm@9938
    59
  val addSWrapper       : claset * (string * wrapper) -> claset
wenzelm@9938
    60
  val delSWrapper       : claset *  string            -> claset
wenzelm@9938
    61
  val addWrapper        : claset * (string * wrapper) -> claset
wenzelm@9938
    62
  val delWrapper        : claset *  string            -> claset
wenzelm@9938
    63
  val addSbefore        : claset * (string * (int -> tactic)) -> claset
oheimb@11181
    64
  val addSafter         : claset * (string * (int -> tactic)) -> claset
wenzelm@9938
    65
  val addbefore         : claset * (string * (int -> tactic)) -> claset
oheimb@11181
    66
  val addafter          : claset * (string * (int -> tactic)) -> claset
oheimb@5523
    67
  val addD2             : claset * (string * thm) -> claset
oheimb@5523
    68
  val addE2             : claset * (string * thm) -> claset
oheimb@5523
    69
  val addSD2            : claset * (string * thm) -> claset
oheimb@5523
    70
  val addSE2            : claset * (string * thm) -> claset
wenzelm@9938
    71
  val appSWrappers      : claset -> wrapper
wenzelm@9938
    72
  val appWrappers       : claset -> wrapper
lcp@982
    73
wenzelm@17880
    74
  val change_claset_of: theory -> (claset -> claset) -> unit
wenzelm@17880
    75
  val change_claset: (claset -> claset) -> unit
wenzelm@4079
    76
  val claset_of: theory -> claset
wenzelm@17880
    77
  val claset: unit -> claset
wenzelm@4079
    78
  val CLASET: (claset -> tactic) -> tactic
wenzelm@4079
    79
  val CLASET': (claset -> 'a -> tactic) -> 'a -> tactic
wenzelm@15036
    80
  val local_claset_of   : Proof.context -> claset
wenzelm@4079
    81
wenzelm@9938
    82
  val fast_tac          : claset -> int -> tactic
wenzelm@9938
    83
  val slow_tac          : claset -> int -> tactic
wenzelm@9938
    84
  val weight_ASTAR      : int ref
wenzelm@9938
    85
  val astar_tac         : claset -> int -> tactic
wenzelm@9938
    86
  val slow_astar_tac    : claset -> int -> tactic
wenzelm@9938
    87
  val best_tac          : claset -> int -> tactic
wenzelm@9938
    88
  val first_best_tac    : claset -> int -> tactic
wenzelm@9938
    89
  val slow_best_tac     : claset -> int -> tactic
wenzelm@9938
    90
  val depth_tac         : claset -> int -> int -> tactic
wenzelm@9938
    91
  val deepen_tac        : claset -> int -> int -> tactic
paulson@1587
    92
wenzelm@9938
    93
  val contr_tac         : int -> tactic
wenzelm@9938
    94
  val dup_elim          : thm -> thm
wenzelm@9938
    95
  val dup_intr          : thm -> thm
wenzelm@9938
    96
  val dup_step_tac      : claset -> int -> tactic
wenzelm@9938
    97
  val eq_mp_tac         : int -> tactic
wenzelm@9938
    98
  val haz_step_tac      : claset -> int -> tactic
wenzelm@9938
    99
  val joinrules         : thm list * thm list -> (bool * thm) list
wenzelm@9938
   100
  val mp_tac            : int -> tactic
wenzelm@9938
   101
  val safe_tac          : claset -> tactic
wenzelm@9938
   102
  val safe_steps_tac    : claset -> int -> tactic
wenzelm@9938
   103
  val safe_step_tac     : claset -> int -> tactic
wenzelm@9938
   104
  val clarify_tac       : claset -> int -> tactic
wenzelm@9938
   105
  val clarify_step_tac  : claset -> int -> tactic
wenzelm@9938
   106
  val step_tac          : claset -> int -> tactic
wenzelm@9938
   107
  val slow_step_tac     : claset -> int -> tactic
wenzelm@9938
   108
  val swapify           : thm list -> thm list
wenzelm@9938
   109
  val swap_res_tac      : thm list -> int -> tactic
wenzelm@9938
   110
  val inst_step_tac     : claset -> int -> tactic
wenzelm@9938
   111
  val inst0_step_tac    : claset -> int -> tactic
wenzelm@9938
   112
  val instp_step_tac    : claset -> int -> tactic
berghofe@1724
   113
wenzelm@9938
   114
  val AddDs             : thm list -> unit
wenzelm@9938
   115
  val AddEs             : thm list -> unit
wenzelm@9938
   116
  val AddIs             : thm list -> unit
wenzelm@9938
   117
  val AddSDs            : thm list -> unit
wenzelm@9938
   118
  val AddSEs            : thm list -> unit
wenzelm@9938
   119
  val AddSIs            : thm list -> unit
wenzelm@9938
   120
  val Delrules          : thm list -> unit
wenzelm@9938
   121
  val Safe_tac          : tactic
wenzelm@9938
   122
  val Safe_step_tac     : int -> tactic
wenzelm@9938
   123
  val Clarify_tac       : int -> tactic
wenzelm@9938
   124
  val Clarify_step_tac  : int -> tactic
wenzelm@9938
   125
  val Step_tac          : int -> tactic
wenzelm@9938
   126
  val Fast_tac          : int -> tactic
wenzelm@9938
   127
  val Best_tac          : int -> tactic
wenzelm@9938
   128
  val Slow_tac          : int -> tactic
paulson@2066
   129
  val Slow_best_tac     : int -> tactic
wenzelm@9938
   130
  val Deepen_tac        : int -> int -> tactic
wenzelm@4079
   131
end;
berghofe@1724
   132
wenzelm@5841
   133
signature CLASSICAL =
wenzelm@5841
   134
sig
wenzelm@5841
   135
  include BASIC_CLASSICAL
wenzelm@18374
   136
  val swap: thm  (* ~P ==> (~Q ==> P) ==> Q *)
wenzelm@18534
   137
  val classical_rule: thm -> thm
wenzelm@15036
   138
  val add_context_safe_wrapper: string * (Proof.context -> wrapper) -> theory -> theory
wenzelm@15036
   139
  val del_context_safe_wrapper: string -> theory -> theory
wenzelm@15036
   140
  val add_context_unsafe_wrapper: string * (Proof.context -> wrapper) -> theory -> theory
wenzelm@15036
   141
  val del_context_unsafe_wrapper: string -> theory -> theory
wenzelm@17880
   142
  val get_claset: theory -> claset
wenzelm@5841
   143
  val print_local_claset: Proof.context -> unit
wenzelm@5841
   144
  val get_local_claset: Proof.context -> claset
wenzelm@5841
   145
  val put_local_claset: claset -> Proof.context -> Proof.context
wenzelm@5841
   146
  val safe_dest_global: theory attribute
wenzelm@5841
   147
  val safe_elim_global: theory attribute
wenzelm@5841
   148
  val safe_intro_global: theory attribute
wenzelm@6955
   149
  val haz_dest_global: theory attribute
wenzelm@6955
   150
  val haz_elim_global: theory attribute
wenzelm@6955
   151
  val haz_intro_global: theory attribute
wenzelm@9938
   152
  val rule_del_global: theory attribute
wenzelm@6955
   153
  val safe_dest_local: Proof.context attribute
wenzelm@6955
   154
  val safe_elim_local: Proof.context attribute
wenzelm@6955
   155
  val safe_intro_local: Proof.context attribute
wenzelm@5885
   156
  val haz_dest_local: Proof.context attribute
wenzelm@5885
   157
  val haz_elim_local: Proof.context attribute
wenzelm@5885
   158
  val haz_intro_local: Proof.context attribute
wenzelm@9938
   159
  val rule_del_local: Proof.context attribute
wenzelm@7272
   160
  val cla_modifiers: (Args.T list -> (Method.modifier * Args.T list)) list
wenzelm@7559
   161
  val cla_meth: (claset -> tactic) -> thm list -> Proof.context -> Proof.method
wenzelm@7559
   162
  val cla_meth': (claset -> int -> tactic) -> thm list -> Proof.context -> Proof.method
wenzelm@15703
   163
  val cla_method: (claset -> tactic) -> Method.src -> Proof.context -> Proof.method
wenzelm@15703
   164
  val cla_method': (claset -> int -> tactic) -> Method.src -> Proof.context -> Proof.method
wenzelm@5841
   165
  val setup: (theory -> theory) list
wenzelm@5841
   166
end;
wenzelm@5841
   167
clasohm@0
   168
wenzelm@5927
   169
functor ClassicalFun(Data: CLASSICAL_DATA): CLASSICAL =
clasohm@0
   170
struct
clasohm@0
   171
wenzelm@7354
   172
local open Data in
clasohm@0
   173
wenzelm@18534
   174
(** classical elimination rules **)
wenzelm@18534
   175
wenzelm@18534
   176
(*
wenzelm@18534
   177
Classical reasoning requires stronger elimination rules.  For
wenzelm@18534
   178
instance, make_elim of Pure transforms the HOL rule injD into
wenzelm@18534
   179
wenzelm@18534
   180
    [| inj f; f x = f y; x = y ==> PROP W |] ==> PROP W
wenzelm@18534
   181
wenzelm@18534
   182
Such rules can cause Fast_tac to fail and Blast_tac to report "PROOF
wenzelm@18534
   183
FAILED"; classical_rule will strenthen this to
wenzelm@18534
   184
wenzelm@18534
   185
    [| inj f; ~ W ==> f x = f y; x = y ==> W |] ==> W
wenzelm@18534
   186
*)
wenzelm@18534
   187
wenzelm@18534
   188
local
wenzelm@18534
   189
wenzelm@18534
   190
fun equal_concl concl prop =
wenzelm@18534
   191
  concl aconv Logic.strip_assums_concl prop;
wenzelm@18534
   192
wenzelm@18534
   193
fun is_elim rule =
wenzelm@18534
   194
  let
wenzelm@18534
   195
    val thy = Thm.theory_of_thm rule;
wenzelm@18534
   196
    val concl = Thm.concl_of rule;
wenzelm@18534
   197
  in
wenzelm@18534
   198
    Term.is_Var (ObjectLogic.drop_judgment thy concl) andalso
wenzelm@18534
   199
    exists (equal_concl concl) (Thm.prems_of rule)
wenzelm@18534
   200
  end;
wenzelm@18534
   201
wenzelm@18534
   202
in
wenzelm@18534
   203
wenzelm@18534
   204
fun classical_rule rule =
wenzelm@18534
   205
  if is_elim rule then
wenzelm@18534
   206
    let
wenzelm@18534
   207
      val rule' = rule RS classical;
wenzelm@18534
   208
      val concl' = Thm.concl_of rule';
wenzelm@18534
   209
      fun redundant_hyp goal =
wenzelm@18534
   210
         equal_concl concl' goal orelse
wenzelm@18534
   211
          (case Logic.strip_assums_hyp goal of
wenzelm@18534
   212
            hyp :: hyps => exists (fn t => t aconv hyp) hyps
wenzelm@18534
   213
          | _ => false);
wenzelm@18534
   214
      val rule'' =
wenzelm@18534
   215
        rule' |> ALLGOALS (SUBGOAL (fn (goal, i) =>
wenzelm@18534
   216
          if i = 1 orelse redundant_hyp goal
wenzelm@18534
   217
          then Tactic.etac thin_rl i
wenzelm@18534
   218
          else all_tac))
wenzelm@18534
   219
        |> Seq.hd
wenzelm@18534
   220
        |> Drule.zero_var_indexes;
wenzelm@18534
   221
    in if Drule.weak_eq_thm (rule, rule'') then rule else rule'' end
wenzelm@18534
   222
  else rule;
wenzelm@18534
   223
wenzelm@18534
   224
end;
wenzelm@18534
   225
wenzelm@18534
   226
paulson@1800
   227
(*** Useful tactics for classical reasoning ***)
clasohm@0
   228
paulson@1524
   229
val imp_elim = (*cannot use bind_thm within a structure!*)
wenzelm@18534
   230
  store_thm ("imp_elim", classical_rule (Tactic.make_elim mp));
clasohm@0
   231
wenzelm@10736
   232
(*Prove goal that assumes both P and ~P.
paulson@4392
   233
  No backtracking if it finds an equal assumption.  Perhaps should call
paulson@4392
   234
  ematch_tac instead of eresolve_tac, but then cannot prove ZF/cantor.*)
wenzelm@10736
   235
val contr_tac = eresolve_tac [not_elim]  THEN'
paulson@4392
   236
                (eq_assume_tac ORELSE' assume_tac);
clasohm@0
   237
lcp@681
   238
(*Finds P-->Q and P in the assumptions, replaces implication by Q.
lcp@681
   239
  Could do the same thing for P<->Q and P... *)
lcp@681
   240
fun mp_tac i = eresolve_tac [not_elim, imp_elim] i  THEN  assume_tac i;
clasohm@0
   241
clasohm@0
   242
(*Like mp_tac but instantiates no variables*)
lcp@681
   243
fun eq_mp_tac i = ematch_tac [not_elim, imp_elim] i  THEN  eq_assume_tac i;
lcp@681
   244
paulson@1524
   245
val swap =
paulson@1524
   246
  store_thm ("swap", rule_by_tactic (etac thin_rl 1) (not_elim RS classical));
clasohm@0
   247
clasohm@0
   248
(*Creates rules to eliminate ~A, from rules to introduce A*)
clasohm@0
   249
fun swapify intrs = intrs RLN (2, [swap]);
wenzelm@12401
   250
fun swapped x = Attrib.no_args (fn (x, th) => (x, th RSN (2, swap))) x;
clasohm@0
   251
clasohm@0
   252
(*Uses introduction rules in the normal way, or on negated assumptions,
clasohm@0
   253
  trying rules in order. *)
wenzelm@10736
   254
fun swap_res_tac rls =
lcp@54
   255
    let fun addrl (rl,brls) = (false, rl) :: (true, rl RSN (2,swap)) :: brls
wenzelm@10736
   256
    in  assume_tac      ORELSE'
wenzelm@10736
   257
        contr_tac       ORELSE'
skalberg@15574
   258
        biresolve_tac (foldr addrl [] rls)
clasohm@0
   259
    end;
clasohm@0
   260
lcp@681
   261
(*Duplication of hazardous rules, for complete provers*)
paulson@2689
   262
fun dup_intr th = zero_var_indexes (th RS classical);
lcp@681
   263
wenzelm@6967
   264
fun dup_elim th =
wenzelm@13525
   265
  (case try (fn () =>
wenzelm@13525
   266
    rule_by_tactic (TRYALL (etac revcut_rl))
haftmann@17257
   267
      ((th RSN (2, revcut_rl)) |> assumption 2 |> Seq.hd)) () of
skalberg@15531
   268
    SOME th' => th'
wenzelm@6967
   269
  | _ => error ("Bad format for elimination rule\n" ^ string_of_thm th));
clasohm@0
   270
lcp@1073
   271
paulson@1800
   272
(**** Classical rule sets ****)
clasohm@0
   273
clasohm@0
   274
datatype claset =
wenzelm@12401
   275
  CS of {safeIs         : thm list,                (*safe introduction rules*)
wenzelm@12401
   276
         safeEs         : thm list,                (*safe elimination rules*)
wenzelm@12401
   277
         hazIs          : thm list,                (*unsafe introduction rules*)
wenzelm@12401
   278
         hazEs          : thm list,                (*unsafe elimination rules*)
wenzelm@12401
   279
         swrappers      : (string * wrapper) list, (*for transforming safe_step_tac*)
wenzelm@9938
   280
         uwrappers      : (string * wrapper) list, (*for transforming step_tac*)
wenzelm@12401
   281
         safe0_netpair  : netpair,                 (*nets for trivial cases*)
wenzelm@12401
   282
         safep_netpair  : netpair,                 (*nets for >0 subgoals*)
wenzelm@12401
   283
         haz_netpair    : netpair,                 (*nets for unsafe rules*)
wenzelm@12401
   284
         dup_netpair    : netpair,                 (*nets for duplication*)
wenzelm@12401
   285
         xtra_netpair   : ContextRules.netpair};   (*nets for extra rules*)
clasohm@0
   286
lcp@1073
   287
(*Desired invariants are
wenzelm@9938
   288
        safe0_netpair = build safe0_brls,
wenzelm@9938
   289
        safep_netpair = build safep_brls,
wenzelm@9938
   290
        haz_netpair = build (joinrules(hazIs, hazEs)),
wenzelm@10736
   291
        dup_netpair = build (joinrules(map dup_intr hazIs,
wenzelm@12376
   292
                                       map dup_elim hazEs))
lcp@1073
   293
wenzelm@10736
   294
where build = build_netpair(Net.empty,Net.empty),
lcp@1073
   295
      safe0_brls contains all brules that solve the subgoal, and
lcp@1073
   296
      safep_brls contains all brules that generate 1 or more new subgoals.
wenzelm@4079
   297
The theorem lists are largely comments, though they are used in merge_cs and print_cs.
lcp@1073
   298
Nets must be built incrementally, to save space and time.
lcp@1073
   299
*)
clasohm@0
   300
wenzelm@6502
   301
val empty_netpair = (Net.empty, Net.empty);
wenzelm@6502
   302
wenzelm@10736
   303
val empty_cs =
wenzelm@9938
   304
  CS{safeIs     = [],
wenzelm@9938
   305
     safeEs     = [],
wenzelm@9938
   306
     hazIs      = [],
wenzelm@9938
   307
     hazEs      = [],
oheimb@4651
   308
     swrappers  = [],
oheimb@4651
   309
     uwrappers  = [],
wenzelm@6502
   310
     safe0_netpair = empty_netpair,
wenzelm@6502
   311
     safep_netpair = empty_netpair,
wenzelm@6502
   312
     haz_netpair   = empty_netpair,
wenzelm@6955
   313
     dup_netpair   = empty_netpair,
wenzelm@6955
   314
     xtra_netpair  = empty_netpair};
clasohm@0
   315
wenzelm@15036
   316
fun print_cs (CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, ...}) =
wenzelm@3546
   317
  let val pretty_thms = map Display.pretty_thm in
wenzelm@9760
   318
    [Pretty.big_list "safe introduction rules (intro!):" (pretty_thms safeIs),
wenzelm@9760
   319
      Pretty.big_list "introduction rules (intro):" (pretty_thms hazIs),
wenzelm@9760
   320
      Pretty.big_list "safe elimination rules (elim!):" (pretty_thms safeEs),
wenzelm@15036
   321
      Pretty.big_list "elimination rules (elim):" (pretty_thms hazEs),
wenzelm@15036
   322
      Pretty.strs ("safe wrappers:" :: map #1 swrappers),
wenzelm@15036
   323
      Pretty.strs ("unsafe wrappers:" :: map #1 uwrappers)]
wenzelm@8727
   324
    |> Pretty.chunks |> Pretty.writeln
wenzelm@3546
   325
  end;
clasohm@0
   326
oheimb@4653
   327
fun rep_cs (CS args) = args;
lcp@1073
   328
wenzelm@10736
   329
local
skalberg@15574
   330
  fun wrap l tac = foldr (fn ((name,tacf),w) => tacf w) tac l;
wenzelm@10736
   331
in
wenzelm@12376
   332
  fun appSWrappers (CS{swrappers,...}) = wrap swrappers;
wenzelm@12376
   333
  fun appWrappers  (CS{uwrappers,...}) = wrap uwrappers;
oheimb@4651
   334
end;
lcp@1073
   335
wenzelm@4079
   336
paulson@1800
   337
(*** Adding (un)safe introduction or elimination rules.
lcp@1073
   338
lcp@1073
   339
    In case of overlap, new rules are tried BEFORE old ones!!
paulson@1800
   340
***)
clasohm@0
   341
wenzelm@12376
   342
(*For use with biresolve_tac.  Combines intro rules with swap to handle negated
lcp@1073
   343
  assumptions.  Pairs elim rules with true. *)
wenzelm@12376
   344
fun joinrules (intrs, elims) =
wenzelm@12376
   345
  (map (pair true) (elims @ swapify intrs) @ map (pair false) intrs);
wenzelm@12376
   346
wenzelm@12401
   347
fun joinrules' (intrs, elims) =
wenzelm@12376
   348
  (map (pair true) elims @ map (pair false) intrs);
lcp@1073
   349
wenzelm@10736
   350
(*Priority: prefer rules with fewest subgoals,
paulson@1231
   351
  then rules added most recently (preferring the head of the list).*)
lcp@1073
   352
fun tag_brls k [] = []
lcp@1073
   353
  | tag_brls k (brl::brls) =
wenzelm@10736
   354
      (1000000*subgoals_of_brl brl + k, brl) ::
lcp@1073
   355
      tag_brls (k+1) brls;
lcp@1073
   356
wenzelm@12401
   357
fun tag_brls' _ _ [] = []
wenzelm@12401
   358
  | tag_brls' w k (brl::brls) = ((w, k), brl) :: tag_brls' w (k + 1) brls;
wenzelm@10736
   359
skalberg@15574
   360
fun insert_tagged_list kbrls netpr = foldr Tactic.insert_tagged_brl netpr kbrls;
lcp@1073
   361
lcp@1073
   362
(*Insert into netpair that already has nI intr rules and nE elim rules.
lcp@1073
   363
  Count the intr rules double (to account for swapify).  Negate to give the
lcp@1073
   364
  new insertions the lowest priority.*)
wenzelm@12376
   365
fun insert (nI, nE) = insert_tagged_list o (tag_brls (~(2*nI+nE))) o joinrules;
wenzelm@12401
   366
fun insert' w (nI, nE) = insert_tagged_list o tag_brls' w (~(nI + nE)) o joinrules';
lcp@1073
   367
skalberg@15574
   368
fun delete_tagged_list brls netpr = foldr Tactic.delete_tagged_brl netpr brls;
wenzelm@12362
   369
fun delete x = delete_tagged_list (joinrules x);
wenzelm@12401
   370
fun delete' x = delete_tagged_list (joinrules' x);
paulson@1800
   371
wenzelm@13105
   372
val mem_thm = gen_mem Drule.eq_thm_prop
wenzelm@13105
   373
and rem_thm = gen_rem Drule.eq_thm_prop;
paulson@2813
   374
paulson@1927
   375
(*Warn if the rule is already present ELSEWHERE in the claset.  The addition
paulson@1927
   376
  is still allowed.*)
wenzelm@12376
   377
fun warn_dup th (CS{safeIs, safeEs, hazIs, hazEs, ...}) =
wenzelm@10736
   378
       if mem_thm (th, safeIs) then
wenzelm@9938
   379
         warning ("Rule already declared as safe introduction (intro!)\n" ^ string_of_thm th)
paulson@2813
   380
  else if mem_thm (th, safeEs) then
wenzelm@9408
   381
         warning ("Rule already declared as safe elimination (elim!)\n" ^ string_of_thm th)
wenzelm@10736
   382
  else if mem_thm (th, hazIs) then
wenzelm@9760
   383
         warning ("Rule already declared as introduction (intro)\n" ^ string_of_thm th)
wenzelm@10736
   384
  else if mem_thm (th, hazEs) then
wenzelm@9760
   385
         warning ("Rule already declared as elimination (elim)\n" ^ string_of_thm th)
paulson@1927
   386
  else ();
paulson@1927
   387
wenzelm@12376
   388
paulson@1800
   389
(*** Safe rules ***)
lcp@982
   390
wenzelm@18534
   391
fun addSI th
wenzelm@18534
   392
  (cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
wenzelm@18534
   393
             safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
wenzelm@10736
   394
  if mem_thm (th, safeIs) then
wenzelm@9938
   395
         (warning ("Ignoring duplicate safe introduction (intro!)\n" ^ string_of_thm th);
wenzelm@9938
   396
          cs)
paulson@1927
   397
  else
lcp@1073
   398
  let val (safe0_rls, safep_rls) = (*0 subgoals vs 1 or more*)
skalberg@15570
   399
          List.partition Thm.no_prems [th]
paulson@1927
   400
      val nI = length safeIs + 1
lcp@1073
   401
      and nE = length safeEs
paulson@1927
   402
  in warn_dup th cs;
wenzelm@9938
   403
     CS{safeIs  = th::safeIs,
lcp@1073
   404
        safe0_netpair = insert (nI,nE) (safe0_rls, []) safe0_netpair,
wenzelm@9938
   405
        safep_netpair = insert (nI,nE) (safep_rls, []) safep_netpair,
wenzelm@9938
   406
        safeEs  = safeEs,
wenzelm@9938
   407
        hazIs   = hazIs,
wenzelm@9938
   408
        hazEs   = hazEs,
wenzelm@9938
   409
        swrappers    = swrappers,
wenzelm@9938
   410
        uwrappers    = uwrappers,
wenzelm@9938
   411
        haz_netpair  = haz_netpair,
wenzelm@9938
   412
        dup_netpair  = dup_netpair,
wenzelm@12401
   413
        xtra_netpair = insert' 0 (nI,nE) ([th], []) xtra_netpair}
lcp@1073
   414
  end;
lcp@1073
   415
wenzelm@18534
   416
fun addSE th
wenzelm@18534
   417
  (cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
wenzelm@18534
   418
             safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
wenzelm@10736
   419
  if mem_thm (th, safeEs) then
wenzelm@9938
   420
         (warning ("Ignoring duplicate safe elimination (elim!)\n" ^ string_of_thm th);
wenzelm@9938
   421
          cs)
paulson@1927
   422
  else
wenzelm@18534
   423
  let
wenzelm@18534
   424
      val th' = classical_rule th
wenzelm@18534
   425
      val (safe0_rls, safep_rls) = (*0 subgoals vs 1 or more*)
wenzelm@18534
   426
          List.partition (fn rl => nprems_of rl=1) [th']
lcp@1073
   427
      val nI = length safeIs
paulson@1927
   428
      and nE = length safeEs + 1
paulson@1927
   429
  in warn_dup th cs;
wenzelm@9938
   430
     CS{safeEs  = th::safeEs,
lcp@1073
   431
        safe0_netpair = insert (nI,nE) ([], safe0_rls) safe0_netpair,
wenzelm@9938
   432
        safep_netpair = insert (nI,nE) ([], safep_rls) safep_netpair,
wenzelm@9938
   433
        safeIs  = safeIs,
wenzelm@9938
   434
        hazIs   = hazIs,
wenzelm@9938
   435
        hazEs   = hazEs,
wenzelm@9938
   436
        swrappers    = swrappers,
wenzelm@9938
   437
        uwrappers    = uwrappers,
wenzelm@9938
   438
        haz_netpair  = haz_netpair,
wenzelm@9938
   439
        dup_netpair  = dup_netpair,
wenzelm@12401
   440
        xtra_netpair = insert' 0 (nI,nE) ([], [th]) xtra_netpair}
lcp@1073
   441
  end;
clasohm@0
   442
wenzelm@18534
   443
fun cs addSIs ths = fold_rev addSI ths cs;
wenzelm@18534
   444
fun cs addSEs ths = fold_rev addSE ths cs;
paulson@1927
   445
paulson@17084
   446
(*Give new theorem a name, if it has one already.*)
paulson@17084
   447
fun name_make_elim th =
paulson@17084
   448
    case Thm.name_of_thm th of
wenzelm@18534
   449
        "" => Tactic.make_elim th
wenzelm@18534
   450
      | a  => Thm.name_thm (a ^ "_dest", Tactic.make_elim th);
paulson@17084
   451
paulson@17084
   452
fun cs addSDs ths = cs addSEs (map name_make_elim ths);
clasohm@0
   453
lcp@1073
   454
paulson@1800
   455
(*** Hazardous (unsafe) rules ***)
clasohm@0
   456
wenzelm@18534
   457
fun addI th
wenzelm@18534
   458
  (cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
wenzelm@18534
   459
             safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
wenzelm@10736
   460
  if mem_thm (th, hazIs) then
wenzelm@9938
   461
         (warning ("Ignoring duplicate introduction (intro)\n" ^ string_of_thm th);
wenzelm@9938
   462
          cs)
paulson@1927
   463
  else
paulson@1927
   464
  let val nI = length hazIs + 1
lcp@1073
   465
      and nE = length hazEs
paulson@1927
   466
  in warn_dup th cs;
wenzelm@9938
   467
     CS{hazIs   = th::hazIs,
wenzelm@9938
   468
        haz_netpair = insert (nI,nE) ([th], []) haz_netpair,
wenzelm@9938
   469
        dup_netpair = insert (nI,nE) (map dup_intr [th], []) dup_netpair,
wenzelm@10736
   470
        safeIs  = safeIs,
wenzelm@9938
   471
        safeEs  = safeEs,
wenzelm@9938
   472
        hazEs   = hazEs,
wenzelm@9938
   473
        swrappers     = swrappers,
wenzelm@9938
   474
        uwrappers     = uwrappers,
wenzelm@9938
   475
        safe0_netpair = safe0_netpair,
wenzelm@9938
   476
        safep_netpair = safep_netpair,
wenzelm@12401
   477
        xtra_netpair = insert' 1 (nI,nE) ([th], []) xtra_netpair}
lcp@1073
   478
  end;
lcp@1073
   479
wenzelm@18534
   480
fun addE th
wenzelm@18534
   481
  (cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
wenzelm@18534
   482
            safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
wenzelm@10736
   483
  if mem_thm (th, hazEs) then
wenzelm@9938
   484
         (warning ("Ignoring duplicate elimination (elim)\n" ^ string_of_thm th);
wenzelm@9938
   485
          cs)
paulson@1927
   486
  else
wenzelm@18534
   487
  let
wenzelm@18534
   488
      val th' = classical_rule th
wenzelm@18534
   489
      val nI = length hazIs
paulson@1927
   490
      and nE = length hazEs + 1
paulson@1927
   491
  in warn_dup th cs;
wenzelm@9938
   492
     CS{hazEs   = th::hazEs,
wenzelm@18534
   493
        haz_netpair = insert (nI,nE) ([], [th']) haz_netpair,
wenzelm@18534
   494
        dup_netpair = insert (nI,nE) ([], map dup_elim [th']) dup_netpair,
wenzelm@10736
   495
        safeIs  = safeIs,
wenzelm@9938
   496
        safeEs  = safeEs,
wenzelm@9938
   497
        hazIs   = hazIs,
wenzelm@9938
   498
        swrappers     = swrappers,
wenzelm@9938
   499
        uwrappers     = uwrappers,
wenzelm@9938
   500
        safe0_netpair = safe0_netpair,
wenzelm@9938
   501
        safep_netpair = safep_netpair,
wenzelm@12401
   502
        xtra_netpair = insert' 1 (nI,nE) ([], [th]) xtra_netpair}
lcp@1073
   503
  end;
clasohm@0
   504
wenzelm@18534
   505
fun cs addIs ths = fold_rev addI ths cs;
wenzelm@18534
   506
fun cs addEs ths = fold_rev addE ths cs;
paulson@1927
   507
paulson@17084
   508
fun cs addDs ths = cs addEs (map name_make_elim ths);
clasohm@0
   509
lcp@1073
   510
wenzelm@10736
   511
(*** Deletion of rules
paulson@1800
   512
     Working out what to delete, requires repeating much of the code used
wenzelm@9938
   513
        to insert.
paulson@1927
   514
     Separate functions delSI, etc., are not exported; instead delrules
paulson@2813
   515
        searches in all the lists and chooses the relevant delXX functions.
paulson@1800
   516
***)
paulson@1800
   517
wenzelm@10736
   518
fun delSI th
wenzelm@12376
   519
          (cs as CS{safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
wenzelm@9938
   520
                    safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
paulson@2813
   521
 if mem_thm (th, safeIs) then
skalberg@15570
   522
   let val (safe0_rls, safep_rls) = List.partition Thm.no_prems [th]
paulson@2813
   523
   in CS{safe0_netpair = delete (safe0_rls, []) safe0_netpair,
wenzelm@9938
   524
         safep_netpair = delete (safep_rls, []) safep_netpair,
wenzelm@9938
   525
         safeIs = rem_thm (safeIs,th),
wenzelm@9938
   526
         safeEs = safeEs,
wenzelm@9938
   527
         hazIs  = hazIs,
wenzelm@9938
   528
         hazEs  = hazEs,
wenzelm@9938
   529
         swrappers    = swrappers,
wenzelm@9938
   530
         uwrappers    = uwrappers,
wenzelm@9938
   531
         haz_netpair  = haz_netpair,
wenzelm@9938
   532
         dup_netpair  = dup_netpair,
wenzelm@12401
   533
         xtra_netpair = delete' ([th], []) xtra_netpair}
paulson@2813
   534
   end
paulson@2813
   535
 else cs;
paulson@1800
   536
paulson@2813
   537
fun delSE th
wenzelm@12376
   538
          (cs as CS{safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
wenzelm@9938
   539
                    safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
wenzelm@18534
   540
  if mem_thm (th, safeEs) then
wenzelm@18534
   541
    let
wenzelm@18534
   542
      val th' = classical_rule th
wenzelm@18534
   543
      val (safe0_rls, safep_rls) = List.partition (fn rl => nprems_of rl=1) [th']
wenzelm@18534
   544
    in CS{safe0_netpair = delete ([], safe0_rls) safe0_netpair,
wenzelm@9938
   545
         safep_netpair = delete ([], safep_rls) safep_netpair,
wenzelm@9938
   546
         safeIs = safeIs,
wenzelm@9938
   547
         safeEs = rem_thm (safeEs,th),
wenzelm@9938
   548
         hazIs  = hazIs,
wenzelm@9938
   549
         hazEs  = hazEs,
wenzelm@9938
   550
         swrappers    = swrappers,
wenzelm@9938
   551
         uwrappers    = uwrappers,
wenzelm@9938
   552
         haz_netpair  = haz_netpair,
wenzelm@9938
   553
         dup_netpair  = dup_netpair,
wenzelm@12401
   554
         xtra_netpair = delete' ([], [th]) xtra_netpair}
wenzelm@18534
   555
    end
wenzelm@18534
   556
  else cs;
paulson@1800
   557
paulson@1800
   558
paulson@2813
   559
fun delI th
wenzelm@12376
   560
         (cs as CS{safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
wenzelm@9938
   561
                   safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
paulson@2813
   562
 if mem_thm (th, hazIs) then
paulson@2813
   563
     CS{haz_netpair = delete ([th], []) haz_netpair,
wenzelm@9938
   564
        dup_netpair = delete ([dup_intr th], []) dup_netpair,
wenzelm@10736
   565
        safeIs  = safeIs,
wenzelm@9938
   566
        safeEs  = safeEs,
wenzelm@9938
   567
        hazIs   = rem_thm (hazIs,th),
wenzelm@9938
   568
        hazEs   = hazEs,
wenzelm@9938
   569
        swrappers     = swrappers,
wenzelm@9938
   570
        uwrappers     = uwrappers,
wenzelm@9938
   571
        safe0_netpair = safe0_netpair,
wenzelm@9938
   572
        safep_netpair = safep_netpair,
wenzelm@12401
   573
        xtra_netpair = delete' ([th], []) xtra_netpair}
paulson@2813
   574
 else cs;
paulson@1800
   575
paulson@2813
   576
fun delE th
wenzelm@12376
   577
         (cs as CS{safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
wenzelm@9938
   578
                   safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
wenzelm@18534
   579
  let val th' = classical_rule th in
wenzelm@18534
   580
    if mem_thm (th, hazEs) then
wenzelm@18534
   581
     CS{haz_netpair = delete ([], [th']) haz_netpair,
wenzelm@18534
   582
        dup_netpair = delete ([], [dup_elim th']) dup_netpair,
wenzelm@10736
   583
        safeIs  = safeIs,
wenzelm@9938
   584
        safeEs  = safeEs,
wenzelm@9938
   585
        hazIs   = hazIs,
wenzelm@9938
   586
        hazEs   = rem_thm (hazEs,th),
wenzelm@9938
   587
        swrappers     = swrappers,
wenzelm@9938
   588
        uwrappers     = uwrappers,
wenzelm@9938
   589
        safe0_netpair = safe0_netpair,
wenzelm@9938
   590
        safep_netpair = safep_netpair,
wenzelm@12401
   591
        xtra_netpair = delete' ([], [th]) xtra_netpair}
wenzelm@18534
   592
     else cs
wenzelm@18534
   593
   end;
wenzelm@6955
   594
paulson@1800
   595
paulson@2813
   596
(*Delete ALL occurrences of "th" in the claset (perhaps from several lists)*)
wenzelm@18534
   597
fun delrule th (cs as CS {safeIs, safeEs, hazIs, hazEs, ...}) =
wenzelm@18534
   598
  let val th' = Tactic.make_elim th in
wenzelm@9938
   599
    if mem_thm (th, safeIs) orelse mem_thm (th, safeEs) orelse
wenzelm@9938
   600
      mem_thm (th, hazIs)  orelse mem_thm (th, hazEs) orelse
wenzelm@12376
   601
      mem_thm (th', safeEs) orelse mem_thm (th', hazEs)
wenzelm@12376
   602
    then delSI th (delSE th (delI th (delE th (delSE th' (delE th' cs)))))
wenzelm@18534
   603
    else (warning ("Undeclared classical rule\n" ^ string_of_thm th); cs)
wenzelm@9938
   604
  end;
paulson@1800
   605
wenzelm@18534
   606
fun cs delrules ths = fold delrule ths cs;
paulson@1800
   607
paulson@1800
   608
oheimb@4767
   609
(*** Modifying the wrapper tacticals ***)
wenzelm@10736
   610
fun update_swrappers
wenzelm@12376
   611
(CS{safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
wenzelm@6955
   612
    safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) f =
oheimb@4767
   613
 CS{safeIs = safeIs, safeEs = safeEs, hazIs = hazIs, hazEs = hazEs,
oheimb@4767
   614
    swrappers = f swrappers, uwrappers = uwrappers,
oheimb@4767
   615
    safe0_netpair = safe0_netpair, safep_netpair = safep_netpair,
wenzelm@6955
   616
    haz_netpair = haz_netpair, dup_netpair = dup_netpair, xtra_netpair = xtra_netpair};
oheimb@4767
   617
wenzelm@10736
   618
fun update_uwrappers
wenzelm@12376
   619
(CS{safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
wenzelm@6955
   620
    safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) f =
oheimb@4767
   621
 CS{safeIs = safeIs, safeEs = safeEs, hazIs = hazIs, hazEs = hazEs,
oheimb@4767
   622
    swrappers = swrappers, uwrappers = f uwrappers,
oheimb@4767
   623
    safe0_netpair = safe0_netpair, safep_netpair = safep_netpair,
wenzelm@6955
   624
    haz_netpair = haz_netpair, dup_netpair = dup_netpair, xtra_netpair = xtra_netpair};
oheimb@4767
   625
lcp@982
   626
oheimb@4651
   627
(*Add/replace a safe wrapper*)
oheimb@4767
   628
fun cs addSWrapper new_swrapper = update_swrappers cs (fn swrappers =>
nipkow@9721
   629
    overwrite_warn (swrappers, new_swrapper)
nipkow@9721
   630
       ("Overwriting safe wrapper " ^ fst new_swrapper));
oheimb@4651
   631
oheimb@4651
   632
(*Add/replace an unsafe wrapper*)
oheimb@4767
   633
fun cs addWrapper new_uwrapper = update_uwrappers cs (fn uwrappers =>
nipkow@9721
   634
    overwrite_warn (uwrappers, new_uwrapper)
wenzelm@9938
   635
        ("Overwriting unsafe wrapper "^fst new_uwrapper));
lcp@982
   636
oheimb@4651
   637
(*Remove a safe wrapper*)
oheimb@4767
   638
fun cs delSWrapper name = update_swrappers cs (fn swrappers =>
wenzelm@17795
   639
  let val swrappers' = filter_out (equal name o fst) swrappers in
wenzelm@15036
   640
    if length swrappers <> length swrappers' then swrappers'
wenzelm@15036
   641
    else (warning ("No such safe wrapper in claset: "^ name); swrappers)
wenzelm@15036
   642
  end);
lcp@982
   643
oheimb@4651
   644
(*Remove an unsafe wrapper*)
oheimb@4767
   645
fun cs delWrapper name = update_uwrappers cs (fn uwrappers =>
wenzelm@17795
   646
  let val uwrappers' = filter_out (equal name o fst) uwrappers in
wenzelm@15036
   647
    if length uwrappers <> length uwrappers' then uwrappers'
wenzelm@15036
   648
    else (warning ("No such unsafe wrapper in claset: " ^ name); uwrappers)
wenzelm@15036
   649
  end);
lcp@982
   650
oheimb@11168
   651
(* compose a safe tactic alternatively before/after safe_step_tac *)
wenzelm@10736
   652
fun cs addSbefore  (name,    tac1) =
oheimb@5523
   653
    cs addSWrapper (name, fn tac2 => tac1 ORELSE' tac2);
oheimb@11181
   654
fun cs addSafter   (name,    tac2) =
oheimb@5523
   655
    cs addSWrapper (name, fn tac1 => tac1 ORELSE' tac2);
lcp@982
   656
oheimb@11168
   657
(*compose a tactic alternatively before/after the step tactic *)
wenzelm@10736
   658
fun cs addbefore   (name,    tac1) =
oheimb@5523
   659
    cs addWrapper  (name, fn tac2 => tac1 APPEND' tac2);
oheimb@11181
   660
fun cs addafter    (name,    tac2) =
oheimb@5523
   661
    cs addWrapper  (name, fn tac1 => tac1 APPEND' tac2);
oheimb@4767
   662
wenzelm@10736
   663
fun cs addD2     (name, thm) =
oheimb@11181
   664
    cs addafter  (name, datac thm 1);
wenzelm@10736
   665
fun cs addE2     (name, thm) =
oheimb@11181
   666
    cs addafter  (name, eatac thm 1);
oheimb@11181
   667
fun cs addSD2    (name, thm) =
oheimb@11181
   668
    cs addSafter (name, dmatch_tac [thm] THEN' eq_assume_tac);
oheimb@11181
   669
fun cs addSE2    (name, thm) =
oheimb@11181
   670
    cs addSafter (name, ematch_tac [thm] THEN' eq_assume_tac);
lcp@982
   671
paulson@1711
   672
(*Merge works by adding all new rules of the 2nd claset into the 1st claset.
paulson@1711
   673
  Merging the term nets may look more efficient, but the rather delicate
paulson@1711
   674
  treatment of priority might get muddled up.*)
wenzelm@12376
   675
fun merge_cs (cs as CS{safeIs, safeEs, hazIs, hazEs, ...},
wenzelm@12376
   676
     CS{safeIs=safeIs2, safeEs=safeEs2, hazIs=hazIs2, hazEs=hazEs2, swrappers, uwrappers, ...}) =
wenzelm@13105
   677
  let val safeIs' = gen_rems Drule.eq_thm_prop (safeIs2,safeIs)
wenzelm@13105
   678
      val safeEs' = gen_rems Drule.eq_thm_prop (safeEs2,safeEs)
wenzelm@13105
   679
      val hazIs' = gen_rems Drule.eq_thm_prop (hazIs2, hazIs)
wenzelm@13105
   680
      val hazEs' = gen_rems Drule.eq_thm_prop (hazEs2, hazEs)
oheimb@4767
   681
      val cs1   = cs addSIs safeIs'
wenzelm@9938
   682
                     addSEs safeEs'
wenzelm@9938
   683
                     addIs  hazIs'
wenzelm@9938
   684
                     addEs  hazEs'
oheimb@4767
   685
      val cs2 = update_swrappers cs1 (fn ws => merge_alists ws swrappers);
oheimb@4767
   686
      val cs3 = update_uwrappers cs2 (fn ws => merge_alists ws uwrappers);
wenzelm@10736
   687
  in cs3
paulson@1711
   688
  end;
paulson@1711
   689
lcp@982
   690
paulson@1800
   691
(**** Simple tactics for theorem proving ****)
clasohm@0
   692
clasohm@0
   693
(*Attack subgoals using safe inferences -- matching, not resolution*)
wenzelm@10736
   694
fun safe_step_tac (cs as CS{safe0_netpair,safep_netpair,...}) =
oheimb@4651
   695
  appSWrappers cs (FIRST' [
wenzelm@9938
   696
        eq_assume_tac,
wenzelm@9938
   697
        eq_mp_tac,
wenzelm@9938
   698
        bimatch_from_nets_tac safe0_netpair,
wenzelm@9938
   699
        FIRST' hyp_subst_tacs,
wenzelm@9938
   700
        bimatch_from_nets_tac safep_netpair]);
clasohm@0
   701
oheimb@5757
   702
(*Repeatedly attack a subgoal using safe inferences -- it's deterministic!*)
wenzelm@10736
   703
fun safe_steps_tac cs = REPEAT_DETERM1 o
wenzelm@9938
   704
        (fn i => COND (has_fewer_prems i) no_tac (safe_step_tac cs i));
oheimb@5757
   705
clasohm@0
   706
(*Repeatedly attack subgoals using safe inferences -- it's deterministic!*)
oheimb@5757
   707
fun safe_tac cs = REPEAT_DETERM1 (FIRSTGOAL (safe_steps_tac cs));
lcp@747
   708
paulson@3705
   709
paulson@3705
   710
(*** Clarify_tac: do safe steps without causing branching ***)
paulson@3705
   711
paulson@3705
   712
fun nsubgoalsP n (k,brl) = (subgoals_of_brl brl = n);
paulson@3705
   713
paulson@3705
   714
(*version of bimatch_from_nets_tac that only applies rules that
paulson@3705
   715
  create precisely n subgoals.*)
wenzelm@10736
   716
fun n_bimatch_from_nets_tac n =
skalberg@15570
   717
    biresolution_from_nets_tac (Tactic.orderlist o List.filter (nsubgoalsP n)) true;
paulson@3705
   718
paulson@3705
   719
fun eq_contr_tac i = ematch_tac [not_elim] i  THEN  eq_assume_tac i;
paulson@3705
   720
val eq_assume_contr_tac = eq_assume_tac ORELSE' eq_contr_tac;
paulson@3705
   721
paulson@3705
   722
(*Two-way branching is allowed only if one of the branches immediately closes*)
paulson@3705
   723
fun bimatch2_tac netpair i =
paulson@3705
   724
    n_bimatch_from_nets_tac 2 netpair i THEN
paulson@3705
   725
    (eq_assume_contr_tac i ORELSE eq_assume_contr_tac (i+1));
paulson@3705
   726
paulson@3705
   727
(*Attack subgoals using safe inferences -- matching, not resolution*)
wenzelm@10736
   728
fun clarify_step_tac (cs as CS{safe0_netpair,safep_netpair,...}) =
oheimb@4651
   729
  appSWrappers cs (FIRST' [
wenzelm@9938
   730
        eq_assume_contr_tac,
wenzelm@9938
   731
        bimatch_from_nets_tac safe0_netpair,
wenzelm@9938
   732
        FIRST' hyp_subst_tacs,
wenzelm@9938
   733
        n_bimatch_from_nets_tac 1 safep_netpair,
paulson@3705
   734
        bimatch2_tac safep_netpair]);
paulson@3705
   735
paulson@3705
   736
fun clarify_tac cs = SELECT_GOAL (REPEAT_DETERM (clarify_step_tac cs 1));
paulson@3705
   737
paulson@3705
   738
paulson@3705
   739
(*** Unsafe steps instantiate variables or lose information ***)
paulson@3705
   740
paulson@4066
   741
(*Backtracking is allowed among the various these unsafe ways of
paulson@4066
   742
  proving a subgoal.  *)
lcp@747
   743
fun inst0_step_tac (CS{safe0_netpair,safep_netpair,...}) =
wenzelm@10736
   744
  assume_tac                      APPEND'
wenzelm@10736
   745
  contr_tac                       APPEND'
lcp@747
   746
  biresolve_from_nets_tac safe0_netpair;
lcp@747
   747
paulson@4066
   748
(*These unsafe steps could generate more subgoals.*)
lcp@747
   749
fun instp_step_tac (CS{safep_netpair,...}) =
lcp@747
   750
  biresolve_from_nets_tac safep_netpair;
clasohm@0
   751
clasohm@0
   752
(*These steps could instantiate variables and are therefore unsafe.*)
lcp@747
   753
fun inst_step_tac cs = inst0_step_tac cs APPEND' instp_step_tac cs;
clasohm@0
   754
wenzelm@10736
   755
fun haz_step_tac (CS{haz_netpair,...}) =
lcp@681
   756
  biresolve_from_nets_tac haz_netpair;
lcp@681
   757
clasohm@0
   758
(*Single step for the prover.  FAILS unless it makes progress. *)
wenzelm@10736
   759
fun step_tac cs i = safe_tac cs ORELSE appWrappers cs
wenzelm@9938
   760
        (inst_step_tac cs ORELSE' haz_step_tac cs) i;
clasohm@0
   761
clasohm@0
   762
(*Using a "safe" rule to instantiate variables is unsafe.  This tactic
clasohm@0
   763
  allows backtracking from "safe" rules to "unsafe" rules here.*)
wenzelm@10736
   764
fun slow_step_tac cs i = safe_tac cs ORELSE appWrappers cs
wenzelm@9938
   765
        (inst_step_tac cs APPEND' haz_step_tac cs) i;
clasohm@0
   766
paulson@1800
   767
(**** The following tactics all fail unless they solve one goal ****)
clasohm@0
   768
clasohm@0
   769
(*Dumb but fast*)
wenzelm@10382
   770
fun fast_tac cs =
wenzelm@11754
   771
  ObjectLogic.atomize_tac THEN' SELECT_GOAL (DEPTH_SOLVE (step_tac cs 1));
clasohm@0
   772
clasohm@0
   773
(*Slower but smarter than fast_tac*)
wenzelm@10382
   774
fun best_tac cs =
wenzelm@11754
   775
  ObjectLogic.atomize_tac THEN'
clasohm@0
   776
  SELECT_GOAL (BEST_FIRST (has_fewer_prems 1, sizef) (step_tac cs 1));
clasohm@0
   777
oheimb@9402
   778
(*even a bit smarter than best_tac*)
wenzelm@10382
   779
fun first_best_tac cs =
wenzelm@11754
   780
  ObjectLogic.atomize_tac THEN'
oheimb@9402
   781
  SELECT_GOAL (BEST_FIRST (has_fewer_prems 1, sizef) (FIRSTGOAL (step_tac cs)));
oheimb@9402
   782
wenzelm@10382
   783
fun slow_tac cs =
wenzelm@11754
   784
  ObjectLogic.atomize_tac THEN'
wenzelm@10382
   785
  SELECT_GOAL (DEPTH_SOLVE (slow_step_tac cs 1));
clasohm@0
   786
wenzelm@10382
   787
fun slow_best_tac cs =
wenzelm@11754
   788
  ObjectLogic.atomize_tac THEN'
clasohm@0
   789
  SELECT_GOAL (BEST_FIRST (has_fewer_prems 1, sizef) (slow_step_tac cs 1));
clasohm@0
   790
lcp@681
   791
wenzelm@10736
   792
(***ASTAR with weight weight_ASTAR, by Norbert Voelker*)
wenzelm@10736
   793
val weight_ASTAR = ref 5;
paulson@1587
   794
wenzelm@10382
   795
fun astar_tac cs =
wenzelm@11754
   796
  ObjectLogic.atomize_tac THEN'
wenzelm@10382
   797
  SELECT_GOAL
wenzelm@10382
   798
    (ASTAR (has_fewer_prems 1, fn lev => fn thm => size_of_thm thm + !weight_ASTAR * lev)
wenzelm@10382
   799
      (step_tac cs 1));
paulson@1587
   800
wenzelm@10736
   801
fun slow_astar_tac cs =
wenzelm@11754
   802
  ObjectLogic.atomize_tac THEN'
wenzelm@10382
   803
  SELECT_GOAL
wenzelm@10382
   804
    (ASTAR (has_fewer_prems 1, fn lev => fn thm => size_of_thm thm + !weight_ASTAR * lev)
wenzelm@10382
   805
      (slow_step_tac cs 1));
paulson@1587
   806
paulson@1800
   807
(**** Complete tactic, loosely based upon LeanTaP.  This tactic is the outcome
lcp@747
   808
  of much experimentation!  Changing APPEND to ORELSE below would prove
lcp@747
   809
  easy theorems faster, but loses completeness -- and many of the harder
paulson@1800
   810
  theorems such as 43. ****)
lcp@681
   811
lcp@747
   812
(*Non-deterministic!  Could always expand the first unsafe connective.
lcp@747
   813
  That's hard to implement and did not perform better in experiments, due to
lcp@747
   814
  greater search depth required.*)
wenzelm@10736
   815
fun dup_step_tac (cs as (CS{dup_netpair,...})) =
lcp@681
   816
  biresolve_from_nets_tac dup_netpair;
lcp@681
   817
oheimb@5523
   818
(*Searching to depth m. A variant called nodup_depth_tac appears in clasimp.ML*)
oheimb@5757
   819
local
wenzelm@10736
   820
fun slow_step_tac' cs = appWrappers cs
wenzelm@9938
   821
        (instp_step_tac cs APPEND' dup_step_tac cs);
wenzelm@10736
   822
in fun depth_tac cs m i state = SELECT_GOAL
wenzelm@10736
   823
   (safe_steps_tac cs 1 THEN_ELSE
wenzelm@9938
   824
        (DEPTH_SOLVE (depth_tac cs m 1),
wenzelm@9938
   825
         inst0_step_tac cs 1 APPEND COND (K (m=0)) no_tac
wenzelm@9938
   826
                (slow_step_tac' cs 1 THEN DEPTH_SOLVE (depth_tac cs (m-1) 1))
oheimb@5757
   827
        )) i state;
oheimb@5757
   828
end;
lcp@747
   829
wenzelm@10736
   830
(*Search, with depth bound m.
paulson@2173
   831
  This is the "entry point", which does safe inferences first.*)
wenzelm@10736
   832
fun safe_depth_tac cs m =
wenzelm@10736
   833
  SUBGOAL
lcp@681
   834
    (fn (prem,i) =>
lcp@681
   835
      let val deti =
wenzelm@9938
   836
          (*No Vars in the goal?  No need to backtrack between goals.*)
wenzelm@9938
   837
          case term_vars prem of
wenzelm@10736
   838
              []        => DETERM
wenzelm@9938
   839
            | _::_      => I
wenzelm@10736
   840
      in  SELECT_GOAL (TRY (safe_tac cs) THEN
wenzelm@9938
   841
                       DEPTH_SOLVE (deti (depth_tac cs m 1))) i
lcp@747
   842
      end);
lcp@681
   843
paulson@2868
   844
fun deepen_tac cs = DEEPEN (2,10) (safe_depth_tac cs);
lcp@681
   845
wenzelm@4079
   846
berghofe@1724
   847
wenzelm@15036
   848
(** context dependent claset components **)
wenzelm@15036
   849
wenzelm@15036
   850
datatype context_cs = ContextCS of
wenzelm@15036
   851
 {swrappers: (string * (Proof.context -> wrapper)) list,
wenzelm@15036
   852
  uwrappers: (string * (Proof.context -> wrapper)) list};
wenzelm@15036
   853
wenzelm@15036
   854
fun context_cs ctxt cs (ContextCS {swrappers, uwrappers}) =
wenzelm@15036
   855
  let
wenzelm@15036
   856
    fun add_wrapper add (name, f) claset = add (claset, (name, f ctxt));
wenzelm@15036
   857
  in
wenzelm@15036
   858
    cs |> fold_rev (add_wrapper (op addSWrapper)) swrappers
wenzelm@15036
   859
    |> fold_rev (add_wrapper (op addWrapper)) uwrappers
wenzelm@15036
   860
  end;
wenzelm@15036
   861
wenzelm@15036
   862
fun make_context_cs (swrappers, uwrappers) =
wenzelm@15036
   863
  ContextCS {swrappers = swrappers, uwrappers = uwrappers};
wenzelm@15036
   864
wenzelm@15036
   865
val empty_context_cs = make_context_cs ([], []);
wenzelm@15036
   866
wenzelm@15036
   867
fun merge_context_cs (ctxt_cs1, ctxt_cs2) =
wenzelm@15036
   868
  let
wenzelm@15036
   869
    val ContextCS {swrappers = swrappers1, uwrappers = uwrappers1} = ctxt_cs1;
wenzelm@15036
   870
    val ContextCS {swrappers = swrappers2, uwrappers = uwrappers2} = ctxt_cs2;
wenzelm@15036
   871
wenzelm@15036
   872
    val swrappers' = merge_alists swrappers1 swrappers2;
wenzelm@15036
   873
    val uwrappers' = merge_alists uwrappers1 uwrappers2;
wenzelm@15036
   874
  in make_context_cs (swrappers', uwrappers') end;
wenzelm@15036
   875
wenzelm@15036
   876
wenzelm@15036
   877
wenzelm@17880
   878
(** claset data **)
wenzelm@4079
   879
wenzelm@17880
   880
(* global clasets *)
berghofe@1724
   881
wenzelm@16424
   882
structure GlobalClaset = TheoryDataFun
wenzelm@16424
   883
(struct
wenzelm@7354
   884
  val name = "Provers/claset";
wenzelm@15036
   885
  type T = claset ref * context_cs;
wenzelm@4079
   886
wenzelm@15036
   887
  val empty = (ref empty_cs, empty_context_cs);
wenzelm@16424
   888
  fun copy (ref cs, ctxt_cs) = (ref cs, ctxt_cs): T;
wenzelm@16424
   889
  val extend = copy;
wenzelm@16424
   890
  fun merge _ ((ref cs1, ctxt_cs1), (ref cs2, ctxt_cs2)) =
wenzelm@15036
   891
    (ref (merge_cs (cs1, cs2)), merge_context_cs (ctxt_cs1, ctxt_cs2));
wenzelm@15036
   892
  fun print _ (ref cs, _) = print_cs cs;
wenzelm@16424
   893
end);
berghofe@1724
   894
wenzelm@7354
   895
val print_claset = GlobalClaset.print;
wenzelm@17880
   896
val get_claset = ! o #1 o GlobalClaset.get;
wenzelm@17880
   897
wenzelm@15036
   898
val get_context_cs = #2 o GlobalClaset.get o ProofContext.theory_of;
wenzelm@15036
   899
fun map_context_cs f = GlobalClaset.map (apsnd
wenzelm@15036
   900
  (fn ContextCS {swrappers, uwrappers} => make_context_cs (f (swrappers, uwrappers))));
wenzelm@4079
   901
wenzelm@17880
   902
val change_claset_of = change o #1 o GlobalClaset.get;
wenzelm@17880
   903
fun change_claset f = change_claset_of (Context.the_context ()) f;
paulson@1800
   904
wenzelm@18534
   905
fun claset_of thy =
wenzelm@17880
   906
  let val (cs_ref, ctxt_cs) = GlobalClaset.get thy
wenzelm@17880
   907
  in context_cs (Context.init_proof thy) (! cs_ref) (ctxt_cs) end;
wenzelm@5028
   908
val claset = claset_of o Context.the_context;
wenzelm@4079
   909
wenzelm@17880
   910
fun CLASET tacf st = tacf (claset_of (Thm.theory_of_thm st)) st;
wenzelm@17880
   911
fun CLASET' tacf i st = tacf (claset_of (Thm.theory_of_thm st)) i st;
berghofe@1724
   912
wenzelm@17880
   913
fun AddDs args = change_claset (fn cs => cs addDs args);
wenzelm@17880
   914
fun AddEs args = change_claset (fn cs => cs addEs args);
wenzelm@17880
   915
fun AddIs args = change_claset (fn cs => cs addIs args);
wenzelm@17880
   916
fun AddSDs args = change_claset (fn cs => cs addSDs args);
wenzelm@17880
   917
fun AddSEs args = change_claset (fn cs => cs addSEs args);
wenzelm@17880
   918
fun AddSIs args = change_claset (fn cs => cs addSIs args);
wenzelm@17880
   919
fun Delrules args = change_claset (fn cs => cs delrules args);
paulson@3727
   920
wenzelm@4079
   921
wenzelm@15036
   922
(* context dependent components *)
wenzelm@15036
   923
wenzelm@15036
   924
fun add_context_safe_wrapper wrapper = map_context_cs (apfst (merge_alists [wrapper]));
wenzelm@15036
   925
fun del_context_safe_wrapper name = map_context_cs (apfst (filter_out (equal name o #1)));
wenzelm@15036
   926
wenzelm@15036
   927
fun add_context_unsafe_wrapper wrapper = map_context_cs (apsnd (merge_alists [wrapper]));
wenzelm@15036
   928
fun del_context_unsafe_wrapper name = map_context_cs (apsnd (filter_out (equal name o #1)));
wenzelm@15036
   929
wenzelm@15036
   930
wenzelm@5841
   931
(* proof data kind 'Provers/claset' *)
wenzelm@5841
   932
wenzelm@16424
   933
structure LocalClaset = ProofDataFun
wenzelm@16424
   934
(struct
wenzelm@5841
   935
  val name = "Provers/claset";
wenzelm@5841
   936
  type T = claset;
wenzelm@17880
   937
  val init = get_claset;
wenzelm@15036
   938
  fun print ctxt cs = print_cs (context_cs ctxt cs (get_context_cs ctxt));
wenzelm@16424
   939
end);
wenzelm@5841
   940
wenzelm@5841
   941
val print_local_claset = LocalClaset.print;
wenzelm@5841
   942
val get_local_claset = LocalClaset.get;
wenzelm@5841
   943
val put_local_claset = LocalClaset.put;
wenzelm@5841
   944
wenzelm@15036
   945
fun local_claset_of ctxt =
wenzelm@15036
   946
  context_cs ctxt (get_local_claset ctxt) (get_context_cs ctxt);
wenzelm@15036
   947
wenzelm@5841
   948
wenzelm@5885
   949
(* attributes *)
wenzelm@5885
   950
wenzelm@17880
   951
fun change_global_cs f (thy, th) = (change_claset_of thy (fn cs => f (cs, [th])); (thy, th));
wenzelm@17880
   952
fun change_local_cs f (ctxt, th) = (LocalClaset.map (fn cs => f (cs, [th])) ctxt, th);
wenzelm@5885
   953
wenzelm@5885
   954
val safe_dest_global = change_global_cs (op addSDs);
wenzelm@5885
   955
val safe_elim_global = change_global_cs (op addSEs);
wenzelm@5885
   956
val safe_intro_global = change_global_cs (op addSIs);
wenzelm@6955
   957
val haz_dest_global = change_global_cs (op addDs);
wenzelm@6955
   958
val haz_elim_global = change_global_cs (op addEs);
wenzelm@6955
   959
val haz_intro_global = change_global_cs (op addIs);
wenzelm@12376
   960
val rule_del_global = change_global_cs (op delrules) o ContextRules.rule_del_global;
wenzelm@5885
   961
wenzelm@16806
   962
val safe_dest_local = change_local_cs (op addSDs);
wenzelm@16806
   963
val safe_elim_local = change_local_cs (op addSEs);
wenzelm@16806
   964
val safe_intro_local = change_local_cs (op addSIs);
wenzelm@16806
   965
val haz_dest_local = change_local_cs (op addDs);
wenzelm@16806
   966
val haz_elim_local = change_local_cs (op addEs);
wenzelm@16806
   967
val haz_intro_local = change_local_cs (op addIs);
wenzelm@12376
   968
val rule_del_local = change_local_cs (op delrules) o ContextRules.rule_del_local;
wenzelm@5885
   969
wenzelm@5885
   970
wenzelm@4079
   971
(* tactics referring to the implicit claset *)
paulson@1800
   972
wenzelm@4079
   973
(*the abstraction over the proof state delays the dereferencing*)
wenzelm@9938
   974
fun Safe_tac st           = safe_tac (claset()) st;
wenzelm@9938
   975
fun Safe_step_tac i st    = safe_step_tac (claset()) i st;
wenzelm@4079
   976
fun Clarify_step_tac i st = clarify_step_tac (claset()) i st;
wenzelm@9938
   977
fun Clarify_tac i st      = clarify_tac (claset()) i st;
wenzelm@9938
   978
fun Step_tac i st         = step_tac (claset()) i st;
wenzelm@9938
   979
fun Fast_tac i st         = fast_tac (claset()) i st;
wenzelm@9938
   980
fun Best_tac i st         = best_tac (claset()) i st;
wenzelm@9938
   981
fun Slow_tac i st         = slow_tac (claset()) i st;
wenzelm@9938
   982
fun Slow_best_tac i st    = slow_best_tac (claset()) i st;
wenzelm@9938
   983
fun Deepen_tac m          = deepen_tac (claset()) m;
paulson@2066
   984
paulson@1800
   985
wenzelm@10736
   986
end;
wenzelm@5841
   987
wenzelm@5841
   988
wenzelm@5841
   989
wenzelm@5885
   990
(** concrete syntax of attributes **)
wenzelm@5841
   991
wenzelm@5841
   992
(* add / del rules *)
wenzelm@5841
   993
wenzelm@5841
   994
val introN = "intro";
wenzelm@5841
   995
val elimN = "elim";
wenzelm@5841
   996
val destN = "dest";
wenzelm@9938
   997
val ruleN = "rule";
wenzelm@5841
   998
wenzelm@12376
   999
fun add_rule xtra haz safe = Attrib.syntax
wenzelm@12376
  1000
 (Scan.lift (Args.query |-- Scan.option Args.nat >> xtra || Args.bang >> K safe ||
wenzelm@12376
  1001
  Scan.succeed haz));
wenzelm@5841
  1002
wenzelm@12376
  1003
fun del_rule att = Attrib.syntax (Scan.lift Args.del >> K att);
wenzelm@5841
  1004
wenzelm@5841
  1005
wenzelm@5841
  1006
(* setup_attrs *)
wenzelm@5841
  1007
wenzelm@5841
  1008
val setup_attrs = Attrib.add_attributes
wenzelm@18534
  1009
 [("swapped", (swapped, swapped), "classical swap of introduction rule"),
wenzelm@12376
  1010
  (destN,
wenzelm@12376
  1011
   (add_rule ContextRules.dest_query_global haz_dest_global safe_dest_global,
wenzelm@12376
  1012
    add_rule ContextRules.dest_query_local haz_dest_local safe_dest_local),
wenzelm@12376
  1013
    "declaration of destruction rule"),
wenzelm@12376
  1014
  (elimN,
wenzelm@12376
  1015
   (add_rule ContextRules.elim_query_global haz_elim_global safe_elim_global,
wenzelm@12376
  1016
    add_rule ContextRules.elim_query_local haz_elim_local safe_elim_local),
wenzelm@12376
  1017
    "declaration of elimination rule"),
wenzelm@12376
  1018
  (introN,
wenzelm@12376
  1019
   (add_rule ContextRules.intro_query_global haz_intro_global safe_intro_global,
wenzelm@12376
  1020
    add_rule ContextRules.intro_query_local haz_intro_local safe_intro_local),
wenzelm@12376
  1021
    "declaration of introduction rule"),
wenzelm@12376
  1022
  (ruleN, (del_rule rule_del_global, del_rule rule_del_local),
wenzelm@12376
  1023
    "remove declaration of intro/elim/dest rule")];
wenzelm@5841
  1024
wenzelm@5841
  1025
wenzelm@5841
  1026
wenzelm@7230
  1027
(** proof methods **)
wenzelm@7230
  1028
wenzelm@14605
  1029
fun METHOD_CLASET tac ctxt =
wenzelm@15036
  1030
  Method.METHOD (tac ctxt (local_claset_of ctxt));
wenzelm@5841
  1031
wenzelm@8098
  1032
fun METHOD_CLASET' tac ctxt =
wenzelm@15036
  1033
  Method.METHOD (HEADGOAL o tac ctxt (local_claset_of ctxt));
wenzelm@7230
  1034
wenzelm@7230
  1035
wenzelm@7230
  1036
local
wenzelm@7230
  1037
wenzelm@12376
  1038
fun some_rule_tac ctxt (CS {xtra_netpair, ...}) facts = SUBGOAL (fn (goal, i) =>
wenzelm@5841
  1039
  let
wenzelm@12401
  1040
    val [rules1, rules2, rules4] = ContextRules.find_rules false facts goal ctxt;
wenzelm@12401
  1041
    val rules3 = ContextRules.find_rules_netpair true facts goal xtra_netpair;
wenzelm@12376
  1042
    val rules = rules1 @ rules2 @ rules3 @ rules4;
wenzelm@18223
  1043
    val ruleq = Drule.multi_resolves facts rules;
wenzelm@12376
  1044
  in
wenzelm@12376
  1045
    Method.trace ctxt rules;
wenzelm@12376
  1046
    fn st => Seq.flat (Seq.map (fn rule => Tactic.rtac rule i st) ruleq)
wenzelm@12376
  1047
  end);
wenzelm@5841
  1048
wenzelm@12376
  1049
fun rule_tac [] ctxt cs facts = some_rule_tac ctxt cs facts
wenzelm@10394
  1050
  | rule_tac rules _ _ facts = Method.rule_tac rules facts;
wenzelm@7281
  1051
wenzelm@10382
  1052
fun default_tac rules ctxt cs facts =
wenzelm@14605
  1053
  HEADGOAL (rule_tac rules ctxt cs facts) ORELSE
wenzelm@10382
  1054
  AxClass.default_intro_classes_tac facts;
wenzelm@10309
  1055
wenzelm@7230
  1056
in
wenzelm@7281
  1057
  val rule = METHOD_CLASET' o rule_tac;
wenzelm@14605
  1058
  val default = METHOD_CLASET o default_tac;
wenzelm@7230
  1059
end;
wenzelm@5841
  1060
wenzelm@5841
  1061
wenzelm@7230
  1062
(* contradiction method *)
wenzelm@6502
  1063
wenzelm@7425
  1064
val contradiction = Method.rule [Data.not_elim, Data.not_elim COMP Drule.swap_prems_rl];
wenzelm@6502
  1065
wenzelm@6502
  1066
wenzelm@6502
  1067
(* automatic methods *)
wenzelm@5841
  1068
wenzelm@5927
  1069
val cla_modifiers =
wenzelm@12376
  1070
 [Args.$$$ destN -- Args.bang_colon >> K ((I, safe_dest_local): Method.modifier),
wenzelm@10034
  1071
  Args.$$$ destN -- Args.colon >> K (I, haz_dest_local),
wenzelm@10034
  1072
  Args.$$$ elimN -- Args.bang_colon >> K (I, safe_elim_local),
wenzelm@10034
  1073
  Args.$$$ elimN -- Args.colon >> K (I, haz_elim_local),
wenzelm@10034
  1074
  Args.$$$ introN -- Args.bang_colon >> K (I, safe_intro_local),
wenzelm@10034
  1075
  Args.$$$ introN -- Args.colon >> K (I, haz_intro_local),
wenzelm@10034
  1076
  Args.del -- Args.colon >> K (I, rule_del_local)];
wenzelm@5927
  1077
wenzelm@7559
  1078
fun cla_meth tac prems ctxt = Method.METHOD (fn facts =>
wenzelm@15036
  1079
  ALLGOALS (Method.insert_tac (prems @ facts)) THEN tac (local_claset_of ctxt));
wenzelm@7132
  1080
wenzelm@7559
  1081
fun cla_meth' tac prems ctxt = Method.METHOD (fn facts =>
wenzelm@15036
  1082
  HEADGOAL (Method.insert_tac (prems @ facts) THEN' tac (local_claset_of ctxt)));
wenzelm@5841
  1083
wenzelm@7559
  1084
val cla_method = Method.bang_sectioned_args cla_modifiers o cla_meth;
wenzelm@7559
  1085
val cla_method' = Method.bang_sectioned_args cla_modifiers o cla_meth';
wenzelm@5841
  1086
wenzelm@5841
  1087
wenzelm@5841
  1088
wenzelm@5841
  1089
(** setup_methods **)
wenzelm@5841
  1090
wenzelm@5841
  1091
val setup_methods = Method.add_methods
wenzelm@12376
  1092
 [("default", Method.thms_ctxt_args default, "apply some intro/elim rule (potentially classical)"),
wenzelm@12376
  1093
  ("rule", Method.thms_ctxt_args rule, "apply some intro/elim rule (potentially classical)"),
wenzelm@6502
  1094
  ("contradiction", Method.no_args contradiction, "proof by contradiction"),
wenzelm@10821
  1095
  ("clarify", cla_method' (CHANGED_PROP oo clarify_tac), "repeatedly apply safe steps"),
wenzelm@7004
  1096
  ("fast", cla_method' fast_tac, "classical prover (depth-first)"),
wenzelm@9806
  1097
  ("slow", cla_method' slow_tac, "classical prover (slow depth-first)"),
wenzelm@9773
  1098
  ("best", cla_method' best_tac, "classical prover (best-first)"),
berghofe@18015
  1099
  ("deepen", cla_method' (fn cs => deepen_tac cs 4), "classical prover (iterative deepening)"),
wenzelm@10821
  1100
  ("safe", cla_method (CHANGED_PROP o safe_tac), "classical prover (apply safe rules)")];
wenzelm@5841
  1101
wenzelm@5841
  1102
wenzelm@5841
  1103
wenzelm@5841
  1104
(** theory setup **)
wenzelm@5841
  1105
wenzelm@16806
  1106
val setup = [GlobalClaset.init, LocalClaset.init, setup_attrs, setup_methods];
wenzelm@5841
  1107
wenzelm@5841
  1108
wenzelm@8667
  1109
wenzelm@8667
  1110
(** outer syntax **)
wenzelm@8667
  1111
wenzelm@8667
  1112
val print_clasetP =
wenzelm@8667
  1113
  OuterSyntax.improper_command "print_claset" "print context of Classical Reasoner"
wenzelm@17057
  1114
    OuterKeyword.diag
wenzelm@9513
  1115
    (Scan.succeed (Toplevel.no_timing o Toplevel.unknown_context o (Toplevel.keep
wenzelm@9010
  1116
      (Toplevel.node_case print_claset (print_local_claset o Proof.context_of)))));
wenzelm@8667
  1117
wenzelm@8667
  1118
val _ = OuterSyntax.add_parsers [print_clasetP];
wenzelm@8667
  1119
wenzelm@8667
  1120
wenzelm@5841
  1121
end;