src/Provers/classical.ML
author wenzelm
Wed, 10 Jun 1998 18:07:07 +0200
changeset 5028 61c10aad3d71
parent 5001 9de7fda0a6df
child 5523 dc8cdc192cd0
permissions -rw-r--r--
Context.the_context;
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
     1
(*  Title: 	Provers/classical.ML
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     2
    ID:         $Id$
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     3
    Author: 	Lawrence C Paulson, Cambridge University Computer Laboratory
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     4
    Copyright   1992  University of Cambridge
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     5
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     6
Theorem prover for classical reasoning, including predicate calculus, set
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     7
theory, etc.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     8
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
     9
Rules must be classified as intr, elim, safe, hazardous (unsafe).
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    10
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    11
A rule is unsafe unless it can be applied blindly without harmful results.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    12
For a rule to be safe, its premises and conclusion should be logically
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    13
equivalent.  There should be no variables in the premises that are not in
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    14
the conclusion.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    15
*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    16
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    17
(*higher precedence than := facilitates use of references*)
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    18
infix 4 addSIs addSEs addSDs addIs addEs addDs delrules
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
    19
  addSWrapper delSWrapper addWrapper delWrapper
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    20
  addSbefore addSaltern addbefore addaltern;
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    21
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    22
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    23
(*should be a type abbreviation in signature CLASSICAL*)
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    24
type netpair = (int * (bool * thm)) Net.net * (int * (bool * thm)) Net.net;
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
    25
type wrapper = (int -> tactic) -> (int -> tactic);
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    26
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    27
signature CLASET_THY_DATA =
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    28
sig
5001
9de7fda0a6df accomodate tuned version of theory data;
wenzelm
parents: 4854
diff changeset
    29
  val clasetN: string
9de7fda0a6df accomodate tuned version of theory data;
wenzelm
parents: 4854
diff changeset
    30
  val clasetK: Object.kind
9de7fda0a6df accomodate tuned version of theory data;
wenzelm
parents: 4854
diff changeset
    31
  exception ClasetData of Object.T ref
4854
d1850e0964f2 tuned setup;
wenzelm
parents: 4792
diff changeset
    32
  val setup: (theory -> theory) list
5001
9de7fda0a6df accomodate tuned version of theory data;
wenzelm
parents: 4854
diff changeset
    33
  val fix_methods: Object.T * (Object.T -> Object.T) *
9de7fda0a6df accomodate tuned version of theory data;
wenzelm
parents: 4854
diff changeset
    34
    (Object.T * Object.T -> Object.T) * (Sign.sg -> Object.T -> unit) -> unit
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    35
end;
2868
17a23a62f82a New DEEPEN allows giving an upper bound for deepen_tac
paulson
parents: 2813
diff changeset
    36
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    37
signature CLASSICAL_DATA =
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    38
sig
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
    39
  val mp	: thm    	(* [| P-->Q;  P |] ==> Q *)
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
    40
  val not_elim	: thm		(* [| ~P;  P |] ==> R *)
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
    41
  val classical	: thm		(* (~P ==> P) ==> P *)
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
    42
  val sizef 	: thm -> int	(* size function for BEST_FIRST *)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    43
  val hyp_subst_tacs: (int -> tactic) list
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    44
end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    45
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    46
signature CLASSICAL =
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    47
sig
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    48
  type claset
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    49
  val empty_cs: claset
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    50
  val print_cs: claset -> unit
4380
0a32020760fa added print_claset;
wenzelm
parents: 4271
diff changeset
    51
  val print_claset: theory -> unit
4653
d60f76680bf4 renamed rep_claset to rep_cs
oheimb
parents: 4651
diff changeset
    52
  val rep_cs: (* BLAST_DATA in blast.ML dependent on this *)
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    53
    claset -> {safeIs: thm list, safeEs: thm list,
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    54
		 hazIs: thm list, hazEs: thm list,
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
    55
		 swrappers: (string * wrapper) list, 
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
    56
		 uwrappers: (string * wrapper) list,
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    57
		 safe0_netpair: netpair, safep_netpair: netpair,
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    58
		 haz_netpair: netpair, dup_netpair: netpair}
1711
c06d01f75764 Provides merge_cs to support default clasets
paulson
parents: 1587
diff changeset
    59
  val merge_cs		: claset * claset -> claset
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
    60
  val addDs 		: claset * thm list -> claset
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
    61
  val addEs 		: claset * thm list -> claset
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
    62
  val addIs 		: claset * thm list -> claset
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
    63
  val addSDs		: claset * thm list -> claset
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
    64
  val addSEs		: claset * thm list -> claset
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
    65
  val addSIs		: claset * thm list -> claset
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
    66
  val delrules		: claset * thm list -> claset
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
    67
  val addSWrapper 	: claset * (string * wrapper) -> claset
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
    68
  val delSWrapper 	: claset *  string            -> claset
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
    69
  val addWrapper 	: claset * (string * wrapper) -> claset
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
    70
  val delWrapper 	: claset *  string            -> claset
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
    71
  val addSbefore 	: claset * (string * (int -> tactic)) -> claset
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
    72
  val addSaltern 	: claset * (string * (int -> tactic)) -> claset
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
    73
  val addbefore 	: claset * (string * (int -> tactic)) -> claset
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
    74
  val addaltern	 	: claset * (string * (int -> tactic)) -> claset
4765
d2c41c8b545f merge_cs now also merges safe and unsafe wrappers
oheimb
parents: 4742
diff changeset
    75
  val appSWrappers	: claset -> wrapper
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
    76
  val appWrappers	: claset -> wrapper
982
4fe0b642b7d5 Addition of wrappers for integration with the simplifier.
lcp
parents: 747
diff changeset
    77
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    78
  val claset_ref_of_sg: Sign.sg -> claset ref
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    79
  val claset_ref_of: theory -> claset ref
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    80
  val claset_of_sg: Sign.sg -> claset
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    81
  val claset_of: theory -> claset
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    82
  val CLASET: (claset -> tactic) -> tactic
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    83
  val CLASET': (claset -> 'a -> tactic) -> 'a -> tactic
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    84
  val claset: unit -> claset
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    85
  val claset_ref: unit -> claset ref
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    86
1587
e7d8a4957bac Now provides astar versions (thanks to Norbert Voelker)
paulson
parents: 1524
diff changeset
    87
  val fast_tac 		: claset -> int -> tactic
e7d8a4957bac Now provides astar versions (thanks to Norbert Voelker)
paulson
parents: 1524
diff changeset
    88
  val slow_tac 		: claset -> int -> tactic
e7d8a4957bac Now provides astar versions (thanks to Norbert Voelker)
paulson
parents: 1524
diff changeset
    89
  val weight_ASTAR	: int ref
e7d8a4957bac Now provides astar versions (thanks to Norbert Voelker)
paulson
parents: 1524
diff changeset
    90
  val astar_tac		: claset -> int -> tactic
e7d8a4957bac Now provides astar versions (thanks to Norbert Voelker)
paulson
parents: 1524
diff changeset
    91
  val slow_astar_tac 	: claset -> int -> tactic
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
    92
  val best_tac 		: claset -> int -> tactic
1587
e7d8a4957bac Now provides astar versions (thanks to Norbert Voelker)
paulson
parents: 1524
diff changeset
    93
  val slow_best_tac 	: claset -> int -> tactic
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
    94
  val depth_tac		: claset -> int -> int -> tactic
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
    95
  val deepen_tac	: claset -> int -> int -> tactic
1587
e7d8a4957bac Now provides astar versions (thanks to Norbert Voelker)
paulson
parents: 1524
diff changeset
    96
e7d8a4957bac Now provides astar versions (thanks to Norbert Voelker)
paulson
parents: 1524
diff changeset
    97
  val contr_tac 	: int -> tactic
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
    98
  val dup_elim		: thm -> thm
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
    99
  val dup_intr		: thm -> thm
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   100
  val dup_step_tac	: claset -> int -> tactic
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   101
  val eq_mp_tac		: int -> tactic
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   102
  val haz_step_tac 	: claset -> int -> tactic
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   103
  val joinrules 	: thm list * thm list -> (bool * thm) list
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   104
  val mp_tac		: int -> tactic
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   105
  val safe_tac 		: claset -> tactic
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   106
  val safe_step_tac 	: claset -> int -> tactic
3705
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   107
  val clarify_tac 	: claset -> int -> tactic
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   108
  val clarify_step_tac 	: claset -> int -> tactic
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   109
  val step_tac 		: claset -> int -> tactic
2630
7a962f6829ca moved THEN_MAYBE to Pure/tctical.ML
oheimb
parents: 2173
diff changeset
   110
  val slow_step_tac	: claset -> int -> tactic
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   111
  val swap		: thm                 (* ~P ==> (~Q ==> P) ==> Q *)
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   112
  val swapify 		: thm list -> thm list
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   113
  val swap_res_tac 	: thm list -> int -> tactic
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   114
  val inst_step_tac 	: claset -> int -> tactic
747
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   115
  val inst0_step_tac 	: claset -> int -> tactic
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   116
  val instp_step_tac 	: claset -> int -> tactic
1724
bb02e6976258 Added functions for default claset.
berghofe
parents: 1711
diff changeset
   117
bb02e6976258 Added functions for default claset.
berghofe
parents: 1711
diff changeset
   118
  val AddDs 		: thm list -> unit
bb02e6976258 Added functions for default claset.
berghofe
parents: 1711
diff changeset
   119
  val AddEs 		: thm list -> unit
bb02e6976258 Added functions for default claset.
berghofe
parents: 1711
diff changeset
   120
  val AddIs 		: thm list -> unit
bb02e6976258 Added functions for default claset.
berghofe
parents: 1711
diff changeset
   121
  val AddSDs		: thm list -> unit
bb02e6976258 Added functions for default claset.
berghofe
parents: 1711
diff changeset
   122
  val AddSEs		: thm list -> unit
bb02e6976258 Added functions for default claset.
berghofe
parents: 1711
diff changeset
   123
  val AddSIs		: thm list -> unit
1807
3ff66483a8d4 Now exports Delrules
paulson
parents: 1800
diff changeset
   124
  val Delrules		: thm list -> unit
3727
ed63c05d7992 Added Safe_tac; all other default claset tactics now dereference "claset"
paulson
parents: 3705
diff changeset
   125
  val Safe_tac         	: tactic
1814
89f8d4a88cca Addition of Safe_step_tac
paulson
parents: 1807
diff changeset
   126
  val Safe_step_tac	: int -> tactic
3705
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   127
  val Clarify_tac 	: int -> tactic
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   128
  val Clarify_step_tac 	: int -> tactic
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   129
  val Step_tac 		: int -> tactic
1724
bb02e6976258 Added functions for default claset.
berghofe
parents: 1711
diff changeset
   130
  val Fast_tac 		: int -> tactic
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   131
  val Best_tac 		: int -> tactic
2066
b9063086ef56 Introduction of Slow_tac and Slow_best_tac
paulson
parents: 1938
diff changeset
   132
  val Slow_tac 		: int -> tactic
b9063086ef56 Introduction of Slow_tac and Slow_best_tac
paulson
parents: 1938
diff changeset
   133
  val Slow_best_tac     : int -> tactic
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   134
  val Deepen_tac	: int -> int -> tactic
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   135
end;
1724
bb02e6976258 Added functions for default claset.
berghofe
parents: 1711
diff changeset
   136
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   137
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   138
structure ClasetThyData: CLASET_THY_DATA =
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   139
struct
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   140
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   141
(* data kind claset -- forward declaration *)
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   142
5001
9de7fda0a6df accomodate tuned version of theory data;
wenzelm
parents: 4854
diff changeset
   143
val clasetN = "Provers/claset";
9de7fda0a6df accomodate tuned version of theory data;
wenzelm
parents: 4854
diff changeset
   144
val clasetK = Object.kind clasetN;
9de7fda0a6df accomodate tuned version of theory data;
wenzelm
parents: 4854
diff changeset
   145
exception ClasetData of Object.T ref;
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   146
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   147
local
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   148
  fun undef _ = raise Match;
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   149
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   150
  val empty_ref = ref ERROR;
5001
9de7fda0a6df accomodate tuned version of theory data;
wenzelm
parents: 4854
diff changeset
   151
  val prep_ext_fn = ref (undef: Object.T -> Object.T);
9de7fda0a6df accomodate tuned version of theory data;
wenzelm
parents: 4854
diff changeset
   152
  val merge_fn = ref (undef: Object.T * Object.T -> Object.T);
9de7fda0a6df accomodate tuned version of theory data;
wenzelm
parents: 4854
diff changeset
   153
  val print_fn = ref (undef: Sign.sg -> Object.T -> unit);
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   154
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   155
  val empty = ClasetData empty_ref;
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   156
  fun prep_ext exn = ! prep_ext_fn exn;
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   157
  fun merge exn = ! merge_fn exn;
4259
adbe3f4e7caf adapted print methods;
wenzelm
parents: 4124
diff changeset
   158
  fun print sg exn = ! print_fn sg exn;
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   159
in
5001
9de7fda0a6df accomodate tuned version of theory data;
wenzelm
parents: 4854
diff changeset
   160
  val setup = [Theory.init_data clasetK (empty, prep_ext, merge, print)];
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   161
  fun fix_methods (e, ext, mrg, prt) =
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   162
    (empty_ref := e; prep_ext_fn := ext; merge_fn := mrg; print_fn := prt);
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   163
end;
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   164
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   165
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   166
end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   167
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   168
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   169
functor ClassicalFun(Data: CLASSICAL_DATA): CLASSICAL = 
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   170
struct
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   171
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   172
local open ClasetThyData Data in
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   173
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   174
(*** Useful tactics for classical reasoning ***)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   175
1524
524879632d88 imp_elim and swap are now stored in thm database
paulson
parents: 1231
diff changeset
   176
val imp_elim = (*cannot use bind_thm within a structure!*)
524879632d88 imp_elim and swap are now stored in thm database
paulson
parents: 1231
diff changeset
   177
  store_thm ("imp_elim", make_elim mp);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   178
4392
ea41d9c1b0ef More deterministic (?) contr_tac
paulson
parents: 4380
diff changeset
   179
(*Prove goal that assumes both P and ~P.  
ea41d9c1b0ef More deterministic (?) contr_tac
paulson
parents: 4380
diff changeset
   180
  No backtracking if it finds an equal assumption.  Perhaps should call
ea41d9c1b0ef More deterministic (?) contr_tac
paulson
parents: 4380
diff changeset
   181
  ematch_tac instead of eresolve_tac, but then cannot prove ZF/cantor.*)
ea41d9c1b0ef More deterministic (?) contr_tac
paulson
parents: 4380
diff changeset
   182
val contr_tac = eresolve_tac [not_elim]  THEN'  
ea41d9c1b0ef More deterministic (?) contr_tac
paulson
parents: 4380
diff changeset
   183
                (eq_assume_tac ORELSE' assume_tac);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   184
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   185
(*Finds P-->Q and P in the assumptions, replaces implication by Q.
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   186
  Could do the same thing for P<->Q and P... *)
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   187
fun mp_tac i = eresolve_tac [not_elim, imp_elim] i  THEN  assume_tac i;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   188
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   189
(*Like mp_tac but instantiates no variables*)
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   190
fun eq_mp_tac i = ematch_tac [not_elim, imp_elim] i  THEN  eq_assume_tac i;
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   191
1524
524879632d88 imp_elim and swap are now stored in thm database
paulson
parents: 1231
diff changeset
   192
val swap =
524879632d88 imp_elim and swap are now stored in thm database
paulson
parents: 1231
diff changeset
   193
  store_thm ("swap", rule_by_tactic (etac thin_rl 1) (not_elim RS classical));
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   194
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   195
(*Creates rules to eliminate ~A, from rules to introduce A*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   196
fun swapify intrs = intrs RLN (2, [swap]);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   197
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   198
(*Uses introduction rules in the normal way, or on negated assumptions,
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   199
  trying rules in order. *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   200
fun swap_res_tac rls = 
54
3dea30013b58 classical/swap_res_tac: recoded to allow backtracking
lcp
parents: 0
diff changeset
   201
    let fun addrl (rl,brls) = (false, rl) :: (true, rl RSN (2,swap)) :: brls
3dea30013b58 classical/swap_res_tac: recoded to allow backtracking
lcp
parents: 0
diff changeset
   202
    in  assume_tac 	ORELSE' 
3dea30013b58 classical/swap_res_tac: recoded to allow backtracking
lcp
parents: 0
diff changeset
   203
	contr_tac 	ORELSE' 
3dea30013b58 classical/swap_res_tac: recoded to allow backtracking
lcp
parents: 0
diff changeset
   204
        biresolve_tac (foldr addrl (rls,[]))
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   205
    end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   206
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   207
(*Duplication of hazardous rules, for complete provers*)
2689
6d3d893453de dup_intr & dup_elim no longer call standard -- this
paulson
parents: 2630
diff changeset
   208
fun dup_intr th = zero_var_indexes (th RS classical);
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   209
4646
f6298426f5a7 Catches bad elim rules, handling exception OPTION
paulson
parents: 4625
diff changeset
   210
fun dup_elim th = 
f6298426f5a7 Catches bad elim rules, handling exception OPTION
paulson
parents: 4625
diff changeset
   211
    th RSN (2, revcut_rl) |> assumption 2 |> Seq.hd |> 
f6298426f5a7 Catches bad elim rules, handling exception OPTION
paulson
parents: 4625
diff changeset
   212
    rule_by_tactic (TRYALL (etac revcut_rl))
f6298426f5a7 Catches bad elim rules, handling exception OPTION
paulson
parents: 4625
diff changeset
   213
    handle _ => error ("Bad format for elimination rule\n" ^ string_of_thm th);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   214
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   215
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   216
(**** Classical rule sets ****)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   217
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   218
datatype claset =
982
4fe0b642b7d5 Addition of wrappers for integration with the simplifier.
lcp
parents: 747
diff changeset
   219
  CS of {safeIs		: thm list,		(*safe introduction rules*)
4fe0b642b7d5 Addition of wrappers for integration with the simplifier.
lcp
parents: 747
diff changeset
   220
	 safeEs		: thm list,		(*safe elimination rules*)
4fe0b642b7d5 Addition of wrappers for integration with the simplifier.
lcp
parents: 747
diff changeset
   221
	 hazIs		: thm list,		(*unsafe introduction rules*)
4fe0b642b7d5 Addition of wrappers for integration with the simplifier.
lcp
parents: 747
diff changeset
   222
	 hazEs		: thm list,		(*unsafe elimination rules*)
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   223
	 swrappers	: (string * wrapper) list, (*for transf. safe_step_tac*)
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   224
	 uwrappers	: (string * wrapper) list, (*for transforming step_tac*)
982
4fe0b642b7d5 Addition of wrappers for integration with the simplifier.
lcp
parents: 747
diff changeset
   225
	 safe0_netpair	: netpair,		(*nets for trivial cases*)
4fe0b642b7d5 Addition of wrappers for integration with the simplifier.
lcp
parents: 747
diff changeset
   226
	 safep_netpair	: netpair,		(*nets for >0 subgoals*)
4fe0b642b7d5 Addition of wrappers for integration with the simplifier.
lcp
parents: 747
diff changeset
   227
	 haz_netpair  	: netpair,		(*nets for unsafe rules*)
4fe0b642b7d5 Addition of wrappers for integration with the simplifier.
lcp
parents: 747
diff changeset
   228
	 dup_netpair	: netpair};		(*nets for duplication*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   229
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   230
(*Desired invariants are
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   231
	safe0_netpair = build safe0_brls,
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   232
	safep_netpair = build safep_brls,
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   233
	haz_netpair = build (joinrules(hazIs, hazEs)),
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   234
	dup_netpair = build (joinrules(map dup_intr hazIs, 
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   235
				       map dup_elim hazEs))}
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   236
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   237
where build = build_netpair(Net.empty,Net.empty), 
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   238
      safe0_brls contains all brules that solve the subgoal, and
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   239
      safep_brls contains all brules that generate 1 or more new subgoals.
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   240
The theorem lists are largely comments, though they are used in merge_cs and print_cs.
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   241
Nets must be built incrementally, to save space and time.
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   242
*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   243
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   244
val empty_cs = 
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   245
  CS{safeIs	= [],
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   246
     safeEs	= [],
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   247
     hazIs	= [],
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   248
     hazEs	= [],
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   249
     swrappers  = [],
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   250
     uwrappers  = [],
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   251
     safe0_netpair = (Net.empty,Net.empty),
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   252
     safep_netpair = (Net.empty,Net.empty),
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   253
     haz_netpair   = (Net.empty,Net.empty),
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   254
     dup_netpair   = (Net.empty,Net.empty)};
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   255
3546
de164676a202 improved print_cs;
wenzelm
parents: 3537
diff changeset
   256
fun print_cs (CS {safeIs, safeEs, hazIs, hazEs, ...}) =
de164676a202 improved print_cs;
wenzelm
parents: 3537
diff changeset
   257
  let val pretty_thms = map Display.pretty_thm in
de164676a202 improved print_cs;
wenzelm
parents: 3537
diff changeset
   258
    Pretty.writeln (Pretty.big_list "safe introduction rules:" (pretty_thms safeIs));
4624
795b5b624c02 tuned print_cs;
wenzelm
parents: 4392
diff changeset
   259
    Pretty.writeln (Pretty.big_list "unsafe introduction rules:" (pretty_thms hazIs));
4625
wenzelm
parents: 4624
diff changeset
   260
    Pretty.writeln (Pretty.big_list "safe elimination rules:" (pretty_thms safeEs));
wenzelm
parents: 4624
diff changeset
   261
    Pretty.writeln (Pretty.big_list "unsafe elimination rules:" (pretty_thms hazEs))
3546
de164676a202 improved print_cs;
wenzelm
parents: 3537
diff changeset
   262
  end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   263
4653
d60f76680bf4 renamed rep_claset to rep_cs
oheimb
parents: 4651
diff changeset
   264
fun rep_cs (CS args) = args;
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   265
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   266
local 
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   267
  fun calc_wrap l tac = foldr (fn ((name,tacf),w) => tacf w) (l, tac);
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   268
in 
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   269
  fun appSWrappers (CS{swrappers,...}) = calc_wrap swrappers;
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   270
  fun appWrappers  (CS{uwrappers,...}) = calc_wrap uwrappers;
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   271
end;
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   272
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   273
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   274
(*** Adding (un)safe introduction or elimination rules.
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   275
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   276
    In case of overlap, new rules are tried BEFORE old ones!!
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   277
***)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   278
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   279
(*For use with biresolve_tac.  Combines intr rules with swap to handle negated
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   280
  assumptions.  Pairs elim rules with true. *)
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   281
fun joinrules (intrs,elims) =  
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   282
    (map (pair true) (elims @ swapify intrs)  @
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   283
     map (pair false) intrs);
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   284
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   285
(*Priority: prefer rules with fewest subgoals, 
1231
91d2c1bb5803 clarified comment
paulson
parents: 1073
diff changeset
   286
  then rules added most recently (preferring the head of the list).*)
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   287
fun tag_brls k [] = []
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   288
  | tag_brls k (brl::brls) =
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   289
      (1000000*subgoals_of_brl brl + k, brl) :: 
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   290
      tag_brls (k+1) brls;
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   291
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   292
fun insert_tagged_list kbrls netpr = foldr insert_tagged_brl (kbrls, netpr);
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   293
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   294
(*Insert into netpair that already has nI intr rules and nE elim rules.
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   295
  Count the intr rules double (to account for swapify).  Negate to give the
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   296
  new insertions the lowest priority.*)
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   297
fun insert (nI,nE) = insert_tagged_list o (tag_brls (~(2*nI+nE))) o joinrules;
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   298
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   299
fun delete_tagged_list brls netpr = foldr delete_tagged_brl (brls, netpr);
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   300
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   301
val delete = delete_tagged_list o joinrules;
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   302
2813
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   303
val mem_thm = gen_mem eq_thm
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   304
and rem_thm = gen_rem eq_thm;
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   305
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   306
(*Warn if the rule is already present ELSEWHERE in the claset.  The addition
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   307
  is still allowed.*)
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   308
fun warn_dup th (CS{safeIs, safeEs, hazIs, hazEs, ...}) = 
2813
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   309
       if mem_thm (th, safeIs) then 
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   310
	 warning ("Rule already in claset as Safe Intr\n" ^ string_of_thm th)
2813
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   311
  else if mem_thm (th, safeEs) then
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   312
         warning ("Rule already in claset as Safe Elim\n" ^ string_of_thm th)
2813
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   313
  else if mem_thm (th, hazIs) then 
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   314
         warning ("Rule already in claset as unsafe Intr\n" ^ string_of_thm th)
2813
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   315
  else if mem_thm (th, hazEs) then 
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   316
         warning ("Rule already in claset as unsafe Elim\n" ^ string_of_thm th)
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   317
  else ();
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   318
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   319
(*** Safe rules ***)
982
4fe0b642b7d5 Addition of wrappers for integration with the simplifier.
lcp
parents: 747
diff changeset
   320
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   321
fun addSI (cs as CS{safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, 
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   322
	      safe0_netpair, safep_netpair, haz_netpair, dup_netpair},
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   323
	   th)  =
2813
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   324
  if mem_thm (th, safeIs) then 
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   325
	 (warning ("Ignoring duplicate Safe Intr\n" ^ string_of_thm th);
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   326
	  cs)
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   327
  else
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   328
  let val (safe0_rls, safep_rls) = (*0 subgoals vs 1 or more*)
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   329
          partition (fn rl => nprems_of rl=0) [th]
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   330
      val nI = length safeIs + 1
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   331
      and nE = length safeEs
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   332
  in warn_dup th cs;
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   333
     CS{safeIs	= th::safeIs,
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   334
        safe0_netpair = insert (nI,nE) (safe0_rls, []) safe0_netpair,
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   335
	safep_netpair = insert (nI,nE) (safep_rls, []) safep_netpair,
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   336
	safeEs	= safeEs,
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   337
	hazIs	= hazIs,
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   338
	hazEs	= hazEs,
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   339
	swrappers    = swrappers,
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   340
	uwrappers    = uwrappers,
2630
7a962f6829ca moved THEN_MAYBE to Pure/tctical.ML
oheimb
parents: 2173
diff changeset
   341
	haz_netpair  = haz_netpair,
7a962f6829ca moved THEN_MAYBE to Pure/tctical.ML
oheimb
parents: 2173
diff changeset
   342
	dup_netpair  = dup_netpair}
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   343
  end;
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   344
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   345
fun addSE (cs as CS{safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, 
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   346
		    safe0_netpair, safep_netpair, haz_netpair, dup_netpair},
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   347
	   th)  =
2813
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   348
  if mem_thm (th, safeEs) then 
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   349
	 (warning ("Ignoring duplicate Safe Elim\n" ^ string_of_thm th);
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   350
	  cs)
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   351
  else
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   352
  let val (safe0_rls, safep_rls) = (*0 subgoals vs 1 or more*)
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   353
          partition (fn rl => nprems_of rl=1) [th]
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   354
      val nI = length safeIs
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   355
      and nE = length safeEs + 1
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   356
  in warn_dup th cs;
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   357
     CS{safeEs	= th::safeEs,
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   358
        safe0_netpair = insert (nI,nE) ([], safe0_rls) safe0_netpair,
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   359
	safep_netpair = insert (nI,nE) ([], safep_rls) safep_netpair,
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   360
	safeIs	= safeIs,
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   361
	hazIs	= hazIs,
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   362
	hazEs	= hazEs,
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   363
	swrappers    = swrappers,
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   364
	uwrappers    = uwrappers,
2630
7a962f6829ca moved THEN_MAYBE to Pure/tctical.ML
oheimb
parents: 2173
diff changeset
   365
	haz_netpair  = haz_netpair,
7a962f6829ca moved THEN_MAYBE to Pure/tctical.ML
oheimb
parents: 2173
diff changeset
   366
	dup_netpair  = dup_netpair}
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   367
  end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   368
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   369
fun rev_foldl f (e, l) = foldl f (e, rev l);
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   370
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   371
val op addSIs = rev_foldl addSI;
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   372
val op addSEs = rev_foldl addSE;
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   373
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   374
fun cs addSDs ths = cs addSEs (map make_elim ths);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   375
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   376
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   377
(*** Hazardous (unsafe) rules ***)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   378
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   379
fun addI (cs as CS{safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, 
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   380
		   safe0_netpair, safep_netpair, haz_netpair, dup_netpair},
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   381
	  th)=
2813
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   382
  if mem_thm (th, hazIs) then 
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   383
	 (warning ("Ignoring duplicate unsafe Intr\n" ^ string_of_thm th);
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   384
	  cs)
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   385
  else
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   386
  let val nI = length hazIs + 1
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   387
      and nE = length hazEs
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   388
  in warn_dup th cs;
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   389
     CS{hazIs	= th::hazIs,
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   390
	haz_netpair = insert (nI,nE) ([th], []) haz_netpair,
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   391
	dup_netpair = insert (nI,nE) (map dup_intr [th], []) dup_netpair,
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   392
	safeIs 	= safeIs, 
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   393
	safeEs	= safeEs,
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   394
	hazEs	= hazEs,
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   395
	swrappers     = swrappers,
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   396
	uwrappers     = uwrappers,
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   397
	safe0_netpair = safe0_netpair,
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   398
	safep_netpair = safep_netpair}
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   399
  end;
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   400
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   401
fun addE (cs as CS{safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, 
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   402
		   safe0_netpair, safep_netpair, haz_netpair, dup_netpair},
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   403
	  th) =
2813
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   404
  if mem_thm (th, hazEs) then 
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   405
	 (warning ("Ignoring duplicate unsafe Elim\n" ^ string_of_thm th);
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   406
	  cs)
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   407
  else
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   408
  let val nI = length hazIs 
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   409
      and nE = length hazEs + 1
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   410
  in warn_dup th cs;
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   411
     CS{hazEs	= th::hazEs,
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   412
	haz_netpair = insert (nI,nE) ([], [th]) haz_netpair,
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   413
	dup_netpair = insert (nI,nE) ([], map dup_elim [th]) dup_netpair,
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   414
	safeIs	= safeIs, 
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   415
	safeEs	= safeEs,
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   416
	hazIs	= hazIs,
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   417
	swrappers     = swrappers,
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   418
	uwrappers     = uwrappers,
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   419
	safe0_netpair = safe0_netpair,
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   420
	safep_netpair = safep_netpair}
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   421
  end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   422
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   423
val op addIs = rev_foldl addI;
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   424
val op addEs = rev_foldl addE;
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   425
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   426
fun cs addDs ths = cs addEs (map make_elim ths);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   427
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   428
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   429
(*** Deletion of rules 
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   430
     Working out what to delete, requires repeating much of the code used
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   431
	to insert.
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   432
     Separate functions delSI, etc., are not exported; instead delrules
2813
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   433
        searches in all the lists and chooses the relevant delXX functions.
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   434
***)
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   435
2813
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   436
fun delSI th 
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   437
          (cs as CS{safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, 
2813
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   438
		    safe0_netpair, safep_netpair, haz_netpair, dup_netpair}) =
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   439
 if mem_thm (th, safeIs) then
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   440
   let val (safe0_rls, safep_rls) = partition (fn rl => nprems_of rl=0) [th]
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   441
   in CS{safe0_netpair = delete (safe0_rls, []) safe0_netpair,
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   442
	 safep_netpair = delete (safep_rls, []) safep_netpair,
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   443
	 safeIs	= rem_thm (safeIs,th),
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   444
	 safeEs	= safeEs,
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   445
	 hazIs	= hazIs,
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   446
	 hazEs	= hazEs,
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   447
	 swrappers    = swrappers,
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   448
	 uwrappers    = uwrappers,
2813
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   449
	 haz_netpair  = haz_netpair,
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   450
	 dup_netpair  = dup_netpair}
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   451
   end
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   452
 else cs;
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   453
2813
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   454
fun delSE th
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   455
          (cs as CS{safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, 
2813
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   456
	            safe0_netpair, safep_netpair, haz_netpair, dup_netpair}) =
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   457
 if mem_thm (th, safeEs) then
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   458
   let val (safe0_rls, safep_rls) = partition (fn rl => nprems_of rl=1) [th]
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   459
   in CS{safe0_netpair = delete ([], safe0_rls) safe0_netpair,
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   460
	 safep_netpair = delete ([], safep_rls) safep_netpair,
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   461
	 safeIs	= safeIs,
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   462
	 safeEs	= rem_thm (safeEs,th),
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   463
	 hazIs	= hazIs,
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   464
	 hazEs	= hazEs,
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   465
	 swrappers    = swrappers,
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   466
	 uwrappers    = uwrappers,
2813
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   467
	 haz_netpair  = haz_netpair,
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   468
	 dup_netpair  = dup_netpair}
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   469
   end
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   470
 else cs;
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   471
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   472
2813
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   473
fun delI th
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   474
         (cs as CS{safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, 
2813
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   475
	           safe0_netpair, safep_netpair, haz_netpair, dup_netpair}) =
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   476
 if mem_thm (th, hazIs) then
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   477
     CS{haz_netpair = delete ([th], []) haz_netpair,
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   478
	dup_netpair = delete ([dup_intr th], []) dup_netpair,
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   479
	safeIs 	= safeIs, 
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   480
	safeEs	= safeEs,
2813
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   481
	hazIs	= rem_thm (hazIs,th),
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   482
	hazEs	= hazEs,
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   483
	swrappers     = swrappers,
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   484
	uwrappers     = uwrappers,
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   485
	safe0_netpair = safe0_netpair,
2813
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   486
	safep_netpair = safep_netpair}
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   487
 else cs;
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   488
2813
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   489
fun delE th
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   490
	 (cs as CS{safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, 
2813
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   491
	           safe0_netpair, safep_netpair, haz_netpair, dup_netpair}) =
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   492
 if mem_thm (th, hazEs) then
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   493
     CS{haz_netpair = delete ([], [th]) haz_netpair,
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   494
	dup_netpair = delete ([], [dup_elim th]) dup_netpair,
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   495
	safeIs	= safeIs, 
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   496
	safeEs	= safeEs,
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   497
	hazIs	= hazIs,
2813
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   498
	hazEs	= rem_thm (hazEs,th),
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   499
	swrappers     = swrappers,
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   500
	uwrappers     = uwrappers,
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   501
	safe0_netpair = safe0_netpair,
2813
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   502
	safep_netpair = safep_netpair}
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   503
 else cs;
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   504
2813
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   505
(*Delete ALL occurrences of "th" in the claset (perhaps from several lists)*)
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   506
fun delrule (cs as CS{safeIs, safeEs, hazIs, hazEs, ...}, th) =
2813
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   507
       if mem_thm (th, safeIs) orelse mem_thm (th, safeEs) orelse
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   508
	  mem_thm (th, hazIs)  orelse mem_thm (th, hazEs) 
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   509
       then delSI th (delSE th (delI th (delE th cs)))
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   510
       else (warning ("Rule not in claset\n" ^ (string_of_thm th)); 
2813
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   511
	     cs);
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   512
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   513
val op delrules = foldl delrule;
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   514
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   515
4767
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   516
(*** Modifying the wrapper tacticals ***)
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   517
fun update_swrappers 
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   518
(CS{safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, 
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   519
    safe0_netpair, safep_netpair, haz_netpair, dup_netpair}) f =
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   520
 CS{safeIs = safeIs, safeEs = safeEs, hazIs = hazIs, hazEs = hazEs,
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   521
    swrappers = f swrappers, uwrappers = uwrappers,
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   522
    safe0_netpair = safe0_netpair, safep_netpair = safep_netpair,
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   523
    haz_netpair = haz_netpair, dup_netpair = dup_netpair};
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   524
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   525
fun update_uwrappers 
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   526
(CS{safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, 
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   527
    safe0_netpair, safep_netpair, haz_netpair, dup_netpair}) f =
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   528
 CS{safeIs = safeIs, safeEs = safeEs, hazIs = hazIs, hazEs = hazEs,
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   529
    swrappers = swrappers, uwrappers = f uwrappers,
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   530
    safe0_netpair = safe0_netpair, safep_netpair = safep_netpair,
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   531
    haz_netpair = haz_netpair, dup_netpair = dup_netpair};
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   532
982
4fe0b642b7d5 Addition of wrappers for integration with the simplifier.
lcp
parents: 747
diff changeset
   533
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   534
(*Add/replace a safe wrapper*)
4767
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   535
fun cs addSWrapper new_swrapper = update_swrappers cs (fn swrappers =>
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   536
    (case assoc_string (swrappers,(fst new_swrapper)) of None =>()
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   537
	   | Some x => warning("overwriting safe wrapper "^fst new_swrapper); 
4767
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   538
		   overwrite (swrappers, new_swrapper)));
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   539
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   540
(*Add/replace an unsafe wrapper*)
4767
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   541
fun cs addWrapper new_uwrapper = update_uwrappers cs (fn uwrappers =>
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   542
    (case assoc_string (uwrappers,(fst new_uwrapper)) of None =>()
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   543
	   | Some x => warning ("overwriting unsafe wrapper "^fst new_uwrapper);
4767
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   544
		   overwrite (uwrappers, new_uwrapper)));
982
4fe0b642b7d5 Addition of wrappers for integration with the simplifier.
lcp
parents: 747
diff changeset
   545
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   546
(*Remove a safe wrapper*)
4767
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   547
fun cs delSWrapper name = update_swrappers cs (fn swrappers =>
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   548
    let val (del,rest) = partition (fn (n,_) => n=name) swrappers
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   549
    in if null del then (warning ("No such safe wrapper in claset: "^ name); 
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   550
			 swrappers) else rest end);
982
4fe0b642b7d5 Addition of wrappers for integration with the simplifier.
lcp
parents: 747
diff changeset
   551
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   552
(*Remove an unsafe wrapper*)
4767
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   553
fun cs delWrapper name = update_uwrappers cs (fn uwrappers =>
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   554
    let val (del,rest) = partition (fn (n,_) => n=name) uwrappers
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   555
    in if null del then (warning ("No such unsafe wrapper in claset: " ^ name);
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   556
                         uwrappers) else rest end);
982
4fe0b642b7d5 Addition of wrappers for integration with the simplifier.
lcp
parents: 747
diff changeset
   557
2630
7a962f6829ca moved THEN_MAYBE to Pure/tctical.ML
oheimb
parents: 2173
diff changeset
   558
(*compose a safe tactic sequentially before/alternatively after safe_step_tac*)
4767
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   559
fun cs addSbefore  (name,    tac1) = 
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   560
    cs addSWrapper (name, fn tac2 => tac1 THEN_MAYBE' tac2);
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   561
fun cs addSaltern  (name,    tac2) = 
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   562
    cs addSWrapper (name, fn tac1 => tac1 ORELSE'     tac2);
982
4fe0b642b7d5 Addition of wrappers for integration with the simplifier.
lcp
parents: 747
diff changeset
   563
2630
7a962f6829ca moved THEN_MAYBE to Pure/tctical.ML
oheimb
parents: 2173
diff changeset
   564
(*compose a tactic sequentially before/alternatively after the step tactic*)
4767
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   565
fun cs addbefore   (name,    tac1) = 
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   566
    cs addWrapper  (name, fn tac2 => tac1 THEN_MAYBE' tac2);
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   567
fun cs addaltern   (name,    tac2) =
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   568
    cs addWrapper  (name, fn tac1 => tac1 APPEND'     tac2);
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   569
982
4fe0b642b7d5 Addition of wrappers for integration with the simplifier.
lcp
parents: 747
diff changeset
   570
1711
c06d01f75764 Provides merge_cs to support default clasets
paulson
parents: 1587
diff changeset
   571
(*Merge works by adding all new rules of the 2nd claset into the 1st claset.
c06d01f75764 Provides merge_cs to support default clasets
paulson
parents: 1587
diff changeset
   572
  Merging the term nets may look more efficient, but the rather delicate
c06d01f75764 Provides merge_cs to support default clasets
paulson
parents: 1587
diff changeset
   573
  treatment of priority might get muddled up.*)
c06d01f75764 Provides merge_cs to support default clasets
paulson
parents: 1587
diff changeset
   574
fun merge_cs
2630
7a962f6829ca moved THEN_MAYBE to Pure/tctical.ML
oheimb
parents: 2173
diff changeset
   575
    (cs as CS{safeIs, safeEs, hazIs, hazEs, ...},
4765
d2c41c8b545f merge_cs now also merges safe and unsafe wrappers
oheimb
parents: 4742
diff changeset
   576
     CS{safeIs=safeIs2, safeEs=safeEs2, hazIs=hazIs2, hazEs=hazEs2,
d2c41c8b545f merge_cs now also merges safe and unsafe wrappers
oheimb
parents: 4742
diff changeset
   577
	swrappers, uwrappers, ...}) =
1711
c06d01f75764 Provides merge_cs to support default clasets
paulson
parents: 1587
diff changeset
   578
  let val safeIs' = gen_rems eq_thm (safeIs2,safeIs)
c06d01f75764 Provides merge_cs to support default clasets
paulson
parents: 1587
diff changeset
   579
      val safeEs' = gen_rems eq_thm (safeEs2,safeEs)
2630
7a962f6829ca moved THEN_MAYBE to Pure/tctical.ML
oheimb
parents: 2173
diff changeset
   580
      val  hazIs' = gen_rems eq_thm ( hazIs2, hazIs)
7a962f6829ca moved THEN_MAYBE to Pure/tctical.ML
oheimb
parents: 2173
diff changeset
   581
      val  hazEs' = gen_rems eq_thm ( hazEs2, hazEs)
4767
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   582
      val cs1   = cs addSIs safeIs'
4765
d2c41c8b545f merge_cs now also merges safe and unsafe wrappers
oheimb
parents: 4742
diff changeset
   583
		     addSEs safeEs'
d2c41c8b545f merge_cs now also merges safe and unsafe wrappers
oheimb
parents: 4742
diff changeset
   584
		     addIs  hazIs'
d2c41c8b545f merge_cs now also merges safe and unsafe wrappers
oheimb
parents: 4742
diff changeset
   585
		     addEs  hazEs'
4767
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   586
      val cs2 = update_swrappers cs1 (fn ws => merge_alists ws swrappers);
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   587
      val cs3 = update_uwrappers cs2 (fn ws => merge_alists ws uwrappers);
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   588
  in cs3 
1711
c06d01f75764 Provides merge_cs to support default clasets
paulson
parents: 1587
diff changeset
   589
  end;
c06d01f75764 Provides merge_cs to support default clasets
paulson
parents: 1587
diff changeset
   590
982
4fe0b642b7d5 Addition of wrappers for integration with the simplifier.
lcp
parents: 747
diff changeset
   591
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   592
(**** Simple tactics for theorem proving ****)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   593
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   594
(*Attack subgoals using safe inferences -- matching, not resolution*)
2630
7a962f6829ca moved THEN_MAYBE to Pure/tctical.ML
oheimb
parents: 2173
diff changeset
   595
fun safe_step_tac (cs as CS{safe0_netpair,safep_netpair,...}) = 
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   596
  appSWrappers cs (FIRST' [
2630
7a962f6829ca moved THEN_MAYBE to Pure/tctical.ML
oheimb
parents: 2173
diff changeset
   597
	eq_assume_tac,
7a962f6829ca moved THEN_MAYBE to Pure/tctical.ML
oheimb
parents: 2173
diff changeset
   598
	eq_mp_tac,
7a962f6829ca moved THEN_MAYBE to Pure/tctical.ML
oheimb
parents: 2173
diff changeset
   599
	bimatch_from_nets_tac safe0_netpair,
7a962f6829ca moved THEN_MAYBE to Pure/tctical.ML
oheimb
parents: 2173
diff changeset
   600
	FIRST' hyp_subst_tacs,
7a962f6829ca moved THEN_MAYBE to Pure/tctical.ML
oheimb
parents: 2173
diff changeset
   601
	bimatch_from_nets_tac safep_netpair]);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   602
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   603
(*Repeatedly attack subgoals using safe inferences -- it's deterministic!*)
2630
7a962f6829ca moved THEN_MAYBE to Pure/tctical.ML
oheimb
parents: 2173
diff changeset
   604
fun safe_tac cs = REPEAT_DETERM_FIRST 
7a962f6829ca moved THEN_MAYBE to Pure/tctical.ML
oheimb
parents: 2173
diff changeset
   605
	(fn i => COND (has_fewer_prems i) no_tac (safe_step_tac cs i));
747
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   606
3705
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   607
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   608
(*** Clarify_tac: do safe steps without causing branching ***)
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   609
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   610
fun nsubgoalsP n (k,brl) = (subgoals_of_brl brl = n);
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   611
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   612
(*version of bimatch_from_nets_tac that only applies rules that
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   613
  create precisely n subgoals.*)
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   614
fun n_bimatch_from_nets_tac n = 
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   615
    biresolution_from_nets_tac (orderlist o filter (nsubgoalsP n)) true;
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   616
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   617
fun eq_contr_tac i = ematch_tac [not_elim] i  THEN  eq_assume_tac i;
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   618
val eq_assume_contr_tac = eq_assume_tac ORELSE' eq_contr_tac;
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   619
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   620
(*Two-way branching is allowed only if one of the branches immediately closes*)
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   621
fun bimatch2_tac netpair i =
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   622
    n_bimatch_from_nets_tac 2 netpair i THEN
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   623
    (eq_assume_contr_tac i ORELSE eq_assume_contr_tac (i+1));
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   624
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   625
(*Attack subgoals using safe inferences -- matching, not resolution*)
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   626
fun clarify_step_tac (cs as CS{safe0_netpair,safep_netpair,...}) = 
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   627
  appSWrappers cs (FIRST' [
3705
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   628
	eq_assume_contr_tac,
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   629
	bimatch_from_nets_tac safe0_netpair,
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   630
	FIRST' hyp_subst_tacs,
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   631
	n_bimatch_from_nets_tac 1 safep_netpair,
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   632
        bimatch2_tac safep_netpair]);
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   633
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   634
fun clarify_tac cs = SELECT_GOAL (REPEAT_DETERM (clarify_step_tac cs 1));
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   635
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   636
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   637
(*** Unsafe steps instantiate variables or lose information ***)
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   638
4066
7b508ac609f7 Fixed comments
paulson
parents: 3727
diff changeset
   639
(*Backtracking is allowed among the various these unsafe ways of
7b508ac609f7 Fixed comments
paulson
parents: 3727
diff changeset
   640
  proving a subgoal.  *)
747
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   641
fun inst0_step_tac (CS{safe0_netpair,safep_netpair,...}) =
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   642
  assume_tac 			  APPEND' 
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   643
  contr_tac 			  APPEND' 
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   644
  biresolve_from_nets_tac safe0_netpair;
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   645
4066
7b508ac609f7 Fixed comments
paulson
parents: 3727
diff changeset
   646
(*These unsafe steps could generate more subgoals.*)
747
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   647
fun instp_step_tac (CS{safep_netpair,...}) =
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   648
  biresolve_from_nets_tac safep_netpair;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   649
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   650
(*These steps could instantiate variables and are therefore unsafe.*)
747
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   651
fun inst_step_tac cs = inst0_step_tac cs APPEND' instp_step_tac cs;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   652
982
4fe0b642b7d5 Addition of wrappers for integration with the simplifier.
lcp
parents: 747
diff changeset
   653
fun haz_step_tac (CS{haz_netpair,...}) = 
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   654
  biresolve_from_nets_tac haz_netpair;
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   655
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   656
(*Single step for the prover.  FAILS unless it makes progress. *)
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   657
fun step_tac cs i = appWrappers cs 
2630
7a962f6829ca moved THEN_MAYBE to Pure/tctical.ML
oheimb
parents: 2173
diff changeset
   658
	(K (safe_tac cs) ORELSE' (inst_step_tac cs ORELSE' haz_step_tac cs)) i;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   659
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   660
(*Using a "safe" rule to instantiate variables is unsafe.  This tactic
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   661
  allows backtracking from "safe" rules to "unsafe" rules here.*)
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   662
fun slow_step_tac cs i = appWrappers cs 
2630
7a962f6829ca moved THEN_MAYBE to Pure/tctical.ML
oheimb
parents: 2173
diff changeset
   663
	(K (safe_tac cs) ORELSE' (inst_step_tac cs APPEND' haz_step_tac cs)) i;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   664
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   665
(**** The following tactics all fail unless they solve one goal ****)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   666
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   667
(*Dumb but fast*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   668
fun fast_tac cs = SELECT_GOAL (DEPTH_SOLVE (step_tac cs 1));
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   669
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   670
(*Slower but smarter than fast_tac*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   671
fun best_tac cs = 
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   672
  SELECT_GOAL (BEST_FIRST (has_fewer_prems 1, sizef) (step_tac cs 1));
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   673
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   674
fun slow_tac cs = SELECT_GOAL (DEPTH_SOLVE (slow_step_tac cs 1));
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   675
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   676
fun slow_best_tac cs = 
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   677
  SELECT_GOAL (BEST_FIRST (has_fewer_prems 1, sizef) (slow_step_tac cs 1));
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   678
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   679
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   680
(***ASTAR with weight weight_ASTAR, by Norbert Voelker*) 
1587
e7d8a4957bac Now provides astar versions (thanks to Norbert Voelker)
paulson
parents: 1524
diff changeset
   681
val weight_ASTAR = ref 5; 
e7d8a4957bac Now provides astar versions (thanks to Norbert Voelker)
paulson
parents: 1524
diff changeset
   682
e7d8a4957bac Now provides astar versions (thanks to Norbert Voelker)
paulson
parents: 1524
diff changeset
   683
fun astar_tac cs = 
e7d8a4957bac Now provides astar versions (thanks to Norbert Voelker)
paulson
parents: 1524
diff changeset
   684
  SELECT_GOAL ( ASTAR (has_fewer_prems 1
e7d8a4957bac Now provides astar versions (thanks to Norbert Voelker)
paulson
parents: 1524
diff changeset
   685
	      , fn level =>(fn thm =>size_of_thm thm + !weight_ASTAR *level)) 
e7d8a4957bac Now provides astar versions (thanks to Norbert Voelker)
paulson
parents: 1524
diff changeset
   686
	      (step_tac cs 1));
e7d8a4957bac Now provides astar versions (thanks to Norbert Voelker)
paulson
parents: 1524
diff changeset
   687
e7d8a4957bac Now provides astar versions (thanks to Norbert Voelker)
paulson
parents: 1524
diff changeset
   688
fun slow_astar_tac cs = 
e7d8a4957bac Now provides astar versions (thanks to Norbert Voelker)
paulson
parents: 1524
diff changeset
   689
  SELECT_GOAL ( ASTAR (has_fewer_prems 1
e7d8a4957bac Now provides astar versions (thanks to Norbert Voelker)
paulson
parents: 1524
diff changeset
   690
	      , fn level =>(fn thm =>size_of_thm thm + !weight_ASTAR *level)) 
e7d8a4957bac Now provides astar versions (thanks to Norbert Voelker)
paulson
parents: 1524
diff changeset
   691
	      (slow_step_tac cs 1));
e7d8a4957bac Now provides astar versions (thanks to Norbert Voelker)
paulson
parents: 1524
diff changeset
   692
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   693
(**** Complete tactic, loosely based upon LeanTaP.  This tactic is the outcome
747
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   694
  of much experimentation!  Changing APPEND to ORELSE below would prove
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   695
  easy theorems faster, but loses completeness -- and many of the harder
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   696
  theorems such as 43. ****)
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   697
747
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   698
(*Non-deterministic!  Could always expand the first unsafe connective.
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   699
  That's hard to implement and did not perform better in experiments, due to
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   700
  greater search depth required.*)
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   701
fun dup_step_tac (cs as (CS{dup_netpair,...})) = 
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   702
  biresolve_from_nets_tac dup_netpair;
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   703
747
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   704
(*Searching to depth m.*)
3537
79ac9b475621 Removal of the tactical STATE
paulson
parents: 3204
diff changeset
   705
fun depth_tac cs m i state = 
747
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   706
  SELECT_GOAL 
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   707
   (appWrappers cs
3204
c1653e2e146d corrected depth_tac: no call for safe_step_tac if subgoal not present
oheimb
parents: 2868
diff changeset
   708
    (fn i => REPEAT_DETERM1 (COND (has_fewer_prems i) no_tac
c1653e2e146d corrected depth_tac: no call for safe_step_tac if subgoal not present
oheimb
parents: 2868
diff changeset
   709
			     (safe_step_tac cs i)) THEN_ELSE
2630
7a962f6829ca moved THEN_MAYBE to Pure/tctical.ML
oheimb
parents: 2173
diff changeset
   710
     (DEPTH_SOLVE (depth_tac cs m i),
7a962f6829ca moved THEN_MAYBE to Pure/tctical.ML
oheimb
parents: 2173
diff changeset
   711
      inst0_step_tac cs i  APPEND
747
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   712
      COND (K(m=0)) no_tac
2630
7a962f6829ca moved THEN_MAYBE to Pure/tctical.ML
oheimb
parents: 2173
diff changeset
   713
        ((instp_step_tac cs i APPEND dup_step_tac cs i)
7a962f6829ca moved THEN_MAYBE to Pure/tctical.ML
oheimb
parents: 2173
diff changeset
   714
	 THEN DEPTH_SOLVE (depth_tac cs (m-1) i)))) 1)
3537
79ac9b475621 Removal of the tactical STATE
paulson
parents: 3204
diff changeset
   715
  i state;
747
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   716
2173
08c68550460b Added a comment
paulson
parents: 2066
diff changeset
   717
(*Search, with depth bound m.  
08c68550460b Added a comment
paulson
parents: 2066
diff changeset
   718
  This is the "entry point", which does safe inferences first.*)
747
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   719
fun safe_depth_tac cs m = 
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   720
  SUBGOAL 
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   721
    (fn (prem,i) =>
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   722
      let val deti =
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   723
	  (*No Vars in the goal?  No need to backtrack between goals.*)
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   724
	  case term_vars prem of
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   725
	      []	=> DETERM 
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   726
	    | _::_	=> I
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   727
      in  SELECT_GOAL (TRY (safe_tac cs) THEN 
747
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   728
		       DEPTH_SOLVE (deti (depth_tac cs m 1))) i
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   729
      end);
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   730
2868
17a23a62f82a New DEEPEN allows giving an upper bound for deepen_tac
paulson
parents: 2813
diff changeset
   731
fun deepen_tac cs = DEEPEN (2,10) (safe_depth_tac cs);
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   732
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   733
1724
bb02e6976258 Added functions for default claset.
berghofe
parents: 1711
diff changeset
   734
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   735
(** claset theory data **)
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   736
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   737
(* init data kind claset *)
1724
bb02e6976258 Added functions for default claset.
berghofe
parents: 1711
diff changeset
   738
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   739
exception CSData of claset ref;
1724
bb02e6976258 Added functions for default claset.
berghofe
parents: 1711
diff changeset
   740
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   741
local
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   742
  val empty = CSData (ref empty_cs);
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   743
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   744
  (*create new references*)
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   745
  fun prep_ext (ClasetData (ref (CSData (ref cs)))) =
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   746
    ClasetData (ref (CSData (ref cs)));
1724
bb02e6976258 Added functions for default claset.
berghofe
parents: 1711
diff changeset
   747
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   748
  fun merge (ClasetData (ref (CSData (ref cs1))), ClasetData (ref (CSData (ref cs2)))) =
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   749
    ClasetData (ref (CSData (ref (merge_cs (cs1, cs2)))));
1724
bb02e6976258 Added functions for default claset.
berghofe
parents: 1711
diff changeset
   750
4259
adbe3f4e7caf adapted print methods;
wenzelm
parents: 4124
diff changeset
   751
  fun print (_: Sign.sg) (ClasetData (ref (CSData (ref cs)))) = print_cs cs;
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   752
in
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   753
  val _ = fix_methods (empty, prep_ext, merge, print);
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   754
end;
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   755
1724
bb02e6976258 Added functions for default claset.
berghofe
parents: 1711
diff changeset
   756
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   757
(* access claset *)
1724
bb02e6976258 Added functions for default claset.
berghofe
parents: 1711
diff changeset
   758
5001
9de7fda0a6df accomodate tuned version of theory data;
wenzelm
parents: 4854
diff changeset
   759
val print_claset = Theory.print_data clasetK;
4380
0a32020760fa added print_claset;
wenzelm
parents: 4271
diff changeset
   760
5001
9de7fda0a6df accomodate tuned version of theory data;
wenzelm
parents: 4854
diff changeset
   761
val claset_ref_of_sg = Sign.get_data clasetK (fn ClasetData (ref (CSData r)) => r);
1807
3ff66483a8d4 Now exports Delrules
paulson
parents: 1800
diff changeset
   762
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   763
val claset_ref_of = claset_ref_of_sg o sign_of;
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   764
val claset_of_sg = ! o claset_ref_of_sg;
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   765
val claset_of = claset_of_sg o sign_of;
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   766
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   767
fun CLASET tacf state = tacf (claset_of_sg (sign_of_thm state)) state;
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   768
fun CLASET' tacf i state = tacf (claset_of_sg (sign_of_thm state)) i state;
3705
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   769
5028
61c10aad3d71 Context.the_context;
wenzelm
parents: 5001
diff changeset
   770
val claset = claset_of o Context.the_context;
61c10aad3d71 Context.the_context;
wenzelm
parents: 5001
diff changeset
   771
val claset_ref = claset_ref_of_sg o sign_of o Context.the_context;
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   772
3705
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   773
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   774
(* change claset *)
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   775
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   776
fun change_claset f x = claset_ref () := (f (claset (), x));
1724
bb02e6976258 Added functions for default claset.
berghofe
parents: 1711
diff changeset
   777
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   778
val AddDs = change_claset (op addDs);
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   779
val AddEs = change_claset (op addEs);
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   780
val AddIs = change_claset (op addIs);
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   781
val AddSDs = change_claset (op addSDs);
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   782
val AddSEs = change_claset (op addSEs);
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   783
val AddSIs = change_claset (op addSIs);
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   784
val Delrules = change_claset (op delrules);
3727
ed63c05d7992 Added Safe_tac; all other default claset tactics now dereference "claset"
paulson
parents: 3705
diff changeset
   785
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   786
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   787
(* tactics referring to the implicit claset *)
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   788
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   789
(*the abstraction over the proof state delays the dereferencing*)
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   790
fun Safe_tac st		  = safe_tac (claset()) st;
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   791
fun Safe_step_tac i st	  = safe_step_tac (claset()) i st;
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   792
fun Clarify_step_tac i st = clarify_step_tac (claset()) i st;
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   793
fun Clarify_tac i st	  = clarify_tac (claset()) i st;
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   794
fun Step_tac i st	  = step_tac (claset()) i st;
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   795
fun Fast_tac i st	  = fast_tac (claset()) i st;
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   796
fun Best_tac i st	  = best_tac (claset()) i st;
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   797
fun Slow_tac i st	  = slow_tac (claset()) i st;
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   798
fun Slow_best_tac i st	  = slow_best_tac (claset()) i st;
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   799
fun Deepen_tac m	  = deepen_tac (claset()) m;
2066
b9063086ef56 Introduction of Slow_tac and Slow_best_tac
paulson
parents: 1938
diff changeset
   800
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   801
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   802
end; 
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   803
end;