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