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