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