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