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