src/Provers/classical.ML
author wenzelm
Fri, 12 Apr 2013 17:21:51 +0200
changeset 51703 f2e92fc0c8aa
parent 51688 27ecd33d3366
child 51717 9e7d1c139569
permissions -rw-r--r--
modifiers for classical wrappers operate on Proof.context instead of claset;
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
     1
(*  Title:      Provers/classical.ML
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
     2
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     3
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     4
Theorem prover for classical reasoning, including predicate calculus, set
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     5
theory, etc.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     6
9563
216d053992a5 fixed classification of rules in atts and modifiers (final!?);
wenzelm
parents: 9513
diff changeset
     7
Rules must be classified as intro, elim, safe, hazardous (unsafe).
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     8
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     9
A rule is unsafe unless it can be applied blindly without harmful results.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    10
For a rule to be safe, its premises and conclusion should be logically
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    11
equivalent.  There should be no variables in the premises that are not in
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    12
the conclusion.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    13
*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    14
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    15
(*higher precedence than := facilitates use of references*)
12376
480303e3fa08 simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents: 12362
diff changeset
    16
infix 4 addSIs addSEs addSDs addIs addEs addDs delrules
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
    17
  addSWrapper delSWrapper addWrapper delWrapper
11181
d04f57b91166 renamed addaltern to addafter, addSaltern to addSafter
oheimb
parents: 11168
diff changeset
    18
  addSbefore addSafter addbefore addafter
5523
dc8cdc192cd0 added addD2, addE2, addSD2, and addSE2
oheimb
parents: 5028
diff changeset
    19
  addD2 addE2 addSD2 addSE2;
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    20
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    21
signature CLASSICAL_DATA =
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    22
sig
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
    23
  val imp_elim: thm  (* P --> Q ==> (~ R ==> P) ==> (Q ==> R) ==> R *)
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
    24
  val not_elim: thm  (* ~P ==> P ==> R *)
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
    25
  val swap: thm  (* ~ P ==> (~ R ==> P) ==> R *)
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
    26
  val classical: thm  (* (~ P ==> P) ==> P *)
50062
e038198f7d08 more concise/precise documentation;
wenzelm
parents: 48126
diff changeset
    27
  val sizef: thm -> int  (* size function for BEST_FIRST, typically size_of_thm *)
e038198f7d08 more concise/precise documentation;
wenzelm
parents: 48126
diff changeset
    28
  val hyp_subst_tacs: (int -> tactic) list (* optional tactics for substitution in
e038198f7d08 more concise/precise documentation;
wenzelm
parents: 48126
diff changeset
    29
    the hypotheses; assumed to be safe! *)
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    30
end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    31
5841
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
    32
signature BASIC_CLASSICAL =
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    33
sig
42812
dda4aef7cba4 tuned signature;
wenzelm
parents: 42810
diff changeset
    34
  type wrapper = (int -> tactic) -> int -> tactic
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    35
  type claset
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
    36
  val print_claset: Proof.context -> unit
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
    37
  val addDs: Proof.context * thm list -> Proof.context
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
    38
  val addEs: Proof.context * thm list -> Proof.context
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
    39
  val addIs: Proof.context * thm list -> Proof.context
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
    40
  val addSDs: Proof.context * thm list -> Proof.context
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
    41
  val addSEs: Proof.context * thm list -> Proof.context
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
    42
  val addSIs: Proof.context * thm list -> Proof.context
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
    43
  val delrules: Proof.context * thm list -> Proof.context
51703
f2e92fc0c8aa modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents: 51688
diff changeset
    44
  val addSWrapper: Proof.context * (string * (Proof.context -> wrapper)) -> Proof.context
f2e92fc0c8aa modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents: 51688
diff changeset
    45
  val delSWrapper: Proof.context * string -> Proof.context
f2e92fc0c8aa modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents: 51688
diff changeset
    46
  val addWrapper: Proof.context * (string * (Proof.context -> wrapper)) -> Proof.context
f2e92fc0c8aa modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents: 51688
diff changeset
    47
  val delWrapper: Proof.context * string -> Proof.context
f2e92fc0c8aa modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents: 51688
diff changeset
    48
  val addSbefore: Proof.context * (string * (int -> tactic)) -> Proof.context
f2e92fc0c8aa modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents: 51688
diff changeset
    49
  val addSafter: Proof.context * (string * (int -> tactic)) -> Proof.context
f2e92fc0c8aa modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents: 51688
diff changeset
    50
  val addbefore: Proof.context * (string * (int -> tactic)) -> Proof.context
f2e92fc0c8aa modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents: 51688
diff changeset
    51
  val addafter: Proof.context * (string * (int -> tactic)) -> Proof.context
f2e92fc0c8aa modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents: 51688
diff changeset
    52
  val addD2: Proof.context * (string * thm) -> Proof.context
f2e92fc0c8aa modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents: 51688
diff changeset
    53
  val addE2: Proof.context * (string * thm) -> Proof.context
f2e92fc0c8aa modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents: 51688
diff changeset
    54
  val addSD2: Proof.context * (string * thm) -> Proof.context
f2e92fc0c8aa modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents: 51688
diff changeset
    55
  val addSE2: Proof.context * (string * thm) -> Proof.context
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
    56
  val appSWrappers: Proof.context -> wrapper
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
    57
  val appWrappers: Proof.context -> wrapper
982
4fe0b642b7d5 Addition of wrappers for integration with the simplifier.
lcp
parents: 747
diff changeset
    58
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
    59
  val claset_of: Proof.context -> claset
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
    60
  val map_claset: (claset -> claset) -> Proof.context -> Proof.context
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
    61
  val put_claset: claset -> Proof.context -> Proof.context
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    62
51703
f2e92fc0c8aa modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents: 51688
diff changeset
    63
  val map_theory_claset: (Proof.context -> Proof.context) -> theory -> theory
f2e92fc0c8aa modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents: 51688
diff changeset
    64
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
    65
  val fast_tac: Proof.context -> int -> tactic
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
    66
  val slow_tac: Proof.context -> int -> tactic
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
    67
  val astar_tac: Proof.context -> int -> tactic
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
    68
  val slow_astar_tac: Proof.context -> int -> tactic
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
    69
  val best_tac: Proof.context -> int -> tactic
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
    70
  val first_best_tac: Proof.context -> int -> tactic
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
    71
  val slow_best_tac: Proof.context -> int -> tactic
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
    72
  val depth_tac: Proof.context -> int -> int -> tactic
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
    73
  val deepen_tac: Proof.context -> int -> int -> tactic
1587
e7d8a4957bac Now provides astar versions (thanks to Norbert Voelker)
paulson
parents: 1524
diff changeset
    74
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
    75
  val contr_tac: int -> tactic
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
    76
  val dup_elim: thm -> thm
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
    77
  val dup_intr: thm -> thm
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
    78
  val dup_step_tac: Proof.context -> int -> tactic
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
    79
  val eq_mp_tac: int -> tactic
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
    80
  val haz_step_tac: Proof.context -> int -> tactic
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
    81
  val joinrules: thm list * thm list -> (bool * thm) list
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
    82
  val mp_tac: int -> tactic
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
    83
  val safe_tac: Proof.context -> tactic
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
    84
  val safe_steps_tac: Proof.context -> int -> tactic
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
    85
  val safe_step_tac: Proof.context -> int -> tactic
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
    86
  val clarify_tac: Proof.context -> int -> tactic
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
    87
  val clarify_step_tac: Proof.context -> int -> tactic
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
    88
  val step_tac: Proof.context -> int -> tactic
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
    89
  val slow_step_tac: Proof.context -> int -> tactic
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
    90
  val swapify: thm list -> thm list
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
    91
  val swap_res_tac: thm list -> int -> tactic
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
    92
  val inst_step_tac: Proof.context -> int -> tactic
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
    93
  val inst0_step_tac: Proof.context -> int -> tactic
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
    94
  val instp_step_tac: Proof.context -> int -> tactic
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    95
end;
1724
bb02e6976258 Added functions for default claset.
berghofe
parents: 1711
diff changeset
    96
5841
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
    97
signature CLASSICAL =
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
    98
sig
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
    99
  include BASIC_CLASSICAL
18534
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   100
  val classical_rule: thm -> thm
42812
dda4aef7cba4 tuned signature;
wenzelm
parents: 42810
diff changeset
   101
  type netpair = (int * (bool * thm)) Net.net * (int * (bool * thm)) Net.net
dda4aef7cba4 tuned signature;
wenzelm
parents: 42810
diff changeset
   102
  val rep_cs: claset ->
dda4aef7cba4 tuned signature;
wenzelm
parents: 42810
diff changeset
   103
   {safeIs: thm Item_Net.T,
dda4aef7cba4 tuned signature;
wenzelm
parents: 42810
diff changeset
   104
    safeEs: thm Item_Net.T,
dda4aef7cba4 tuned signature;
wenzelm
parents: 42810
diff changeset
   105
    hazIs: thm Item_Net.T,
dda4aef7cba4 tuned signature;
wenzelm
parents: 42810
diff changeset
   106
    hazEs: thm Item_Net.T,
dda4aef7cba4 tuned signature;
wenzelm
parents: 42810
diff changeset
   107
    swrappers: (string * (Proof.context -> wrapper)) list,
dda4aef7cba4 tuned signature;
wenzelm
parents: 42810
diff changeset
   108
    uwrappers: (string * (Proof.context -> wrapper)) list,
dda4aef7cba4 tuned signature;
wenzelm
parents: 42810
diff changeset
   109
    safe0_netpair: netpair,
dda4aef7cba4 tuned signature;
wenzelm
parents: 42810
diff changeset
   110
    safep_netpair: netpair,
dda4aef7cba4 tuned signature;
wenzelm
parents: 42810
diff changeset
   111
    haz_netpair: netpair,
dda4aef7cba4 tuned signature;
wenzelm
parents: 42810
diff changeset
   112
    dup_netpair: netpair,
dda4aef7cba4 tuned signature;
wenzelm
parents: 42810
diff changeset
   113
    xtra_netpair: Context_Rules.netpair}
24021
491c68f40bc4 added get_cs/map_cs;
wenzelm
parents: 23594
diff changeset
   114
  val get_cs: Context.generic -> claset
491c68f40bc4 added get_cs/map_cs;
wenzelm
parents: 23594
diff changeset
   115
  val map_cs: (claset -> claset) -> Context.generic -> Context.generic
18728
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
   116
  val safe_dest: int option -> attribute
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
   117
  val safe_elim: int option -> attribute
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
   118
  val safe_intro: int option -> attribute
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
   119
  val haz_dest: int option -> attribute
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
   120
  val haz_elim: int option -> attribute
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
   121
  val haz_intro: int option -> attribute
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
   122
  val rule_del: attribute
30513
1796b8ea88aa eliminated type Args.T;
wenzelm
parents: 30510
diff changeset
   123
  val cla_modifiers: Method.modifier parser list
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   124
  val cla_method:
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   125
    (Proof.context -> tactic) -> (Proof.context -> Proof.method) context_parser
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   126
  val cla_method':
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   127
    (Proof.context -> int -> tactic) -> (Proof.context -> Proof.method) context_parser
18708
4b3dadb4fe33 setup: theory -> theory;
wenzelm
parents: 18691
diff changeset
   128
  val setup: theory -> theory
5841
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   129
end;
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   130
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   131
42799
4e33894aec6d modernized functor names;
wenzelm
parents: 42798
diff changeset
   132
functor Classical(Data: CLASSICAL_DATA): CLASSICAL =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   133
struct
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   134
18534
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   135
(** classical elimination rules **)
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   136
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   137
(*
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   138
Classical reasoning requires stronger elimination rules.  For
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   139
instance, make_elim of Pure transforms the HOL rule injD into
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   140
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   141
    [| inj f; f x = f y; x = y ==> PROP W |] ==> PROP W
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   142
26938
64e850c3da9e tuned comments;
wenzelm
parents: 26928
diff changeset
   143
Such rules can cause fast_tac to fail and blast_tac to report "PROOF
18534
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   144
FAILED"; classical_rule will strenthen this to
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   145
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   146
    [| inj f; ~ W ==> f x = f y; x = y ==> W |] ==> W
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   147
*)
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   148
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   149
fun classical_rule rule =
41581
72a02e3dec7e clarified pretty_statement: more robust treatment of fixes and conclusion of elimination (e.g. for classical rule);
wenzelm
parents: 36960
diff changeset
   150
  if is_some (Object_Logic.elim_concl rule) then
18534
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   151
    let
42792
85fb70b0c5e8 do not open ML structures;
wenzelm
parents: 42791
diff changeset
   152
      val rule' = rule RS Data.classical;
18534
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   153
      val concl' = Thm.concl_of rule';
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   154
      fun redundant_hyp goal =
19257
4463aee061bc ObjectLogic.is_elim;
wenzelm
parents: 19110
diff changeset
   155
        concl' aconv Logic.strip_assums_concl goal orelse
18534
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   156
          (case Logic.strip_assums_hyp goal of
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   157
            hyp :: hyps => exists (fn t => t aconv hyp) hyps
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   158
          | _ => false);
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   159
      val rule'' =
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   160
        rule' |> ALLGOALS (SUBGOAL (fn (goal, i) =>
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   161
          if i = 1 orelse redundant_hyp goal
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   162
          then Tactic.etac thin_rl i
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   163
          else all_tac))
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   164
        |> Seq.hd
21963
416a5338d2bb removed obsolete name_hint handling;
wenzelm
parents: 21689
diff changeset
   165
        |> Drule.zero_var_indexes;
22360
26ead7ed4f4b moved eq_thm etc. to structure Thm in Pure/more_thm.ML;
wenzelm
parents: 22095
diff changeset
   166
    in if Thm.equiv_thm (rule, rule'') then rule else rule'' end
18534
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   167
  else rule;
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   168
23594
e65e466dda01 renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents: 23178
diff changeset
   169
(*flatten nested meta connectives in prems*)
35625
9c818cab0dd0 modernized structure Object_Logic;
wenzelm
parents: 35613
diff changeset
   170
val flat_rule = Conv.fconv_rule (Conv.prems_conv ~1 Object_Logic.atomize_prems);
18534
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   171
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   172
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   173
(*** Useful tactics for classical reasoning ***)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   174
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   175
(*Prove goal that assumes both P and ~P.
4392
ea41d9c1b0ef More deterministic (?) contr_tac
paulson
parents: 4380
diff changeset
   176
  No backtracking if it finds an equal assumption.  Perhaps should call
ea41d9c1b0ef More deterministic (?) contr_tac
paulson
parents: 4380
diff changeset
   177
  ematch_tac instead of eresolve_tac, but then cannot prove ZF/cantor.*)
42792
85fb70b0c5e8 do not open ML structures;
wenzelm
parents: 42791
diff changeset
   178
val contr_tac =
85fb70b0c5e8 do not open ML structures;
wenzelm
parents: 42791
diff changeset
   179
  eresolve_tac [Data.not_elim] THEN' (eq_assume_tac ORELSE' assume_tac);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   180
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   181
(*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
   182
  Could do the same thing for P<->Q and P... *)
42792
85fb70b0c5e8 do not open ML structures;
wenzelm
parents: 42791
diff changeset
   183
fun mp_tac i = eresolve_tac [Data.not_elim, Data.imp_elim] i THEN assume_tac i;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   184
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   185
(*Like mp_tac but instantiates no variables*)
42792
85fb70b0c5e8 do not open ML structures;
wenzelm
parents: 42791
diff changeset
   186
fun eq_mp_tac i = ematch_tac [Data.not_elim, Data.imp_elim] i THEN eq_assume_tac i;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   187
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   188
(*Creates rules to eliminate ~A, from rules to introduce A*)
26412
0918f5c0bbca pass imp_elim (instead of mp) and swap explicitly -- avoids store_thm;
wenzelm
parents: 24867
diff changeset
   189
fun swapify intrs = intrs RLN (2, [Data.swap]);
30528
7173bf123335 simplified attribute setup;
wenzelm
parents: 30513
diff changeset
   190
val swapped = Thm.rule_attribute (fn _ => fn th => th RSN (2, Data.swap));
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   191
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   192
(*Uses introduction rules in the normal way, or on negated assumptions,
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   193
  trying rules in order. *)
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   194
fun swap_res_tac rls =
42792
85fb70b0c5e8 do not open ML structures;
wenzelm
parents: 42791
diff changeset
   195
  let fun addrl rl brls = (false, rl) :: (true, rl RSN (2, Data.swap)) :: brls in
85fb70b0c5e8 do not open ML structures;
wenzelm
parents: 42791
diff changeset
   196
    assume_tac ORELSE'
85fb70b0c5e8 do not open ML structures;
wenzelm
parents: 42791
diff changeset
   197
    contr_tac ORELSE'
85fb70b0c5e8 do not open ML structures;
wenzelm
parents: 42791
diff changeset
   198
    biresolve_tac (fold_rev addrl rls [])
85fb70b0c5e8 do not open ML structures;
wenzelm
parents: 42791
diff changeset
   199
  end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   200
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   201
(*Duplication of hazardous rules, for complete provers*)
42792
85fb70b0c5e8 do not open ML structures;
wenzelm
parents: 42791
diff changeset
   202
fun dup_intr th = zero_var_indexes (th RS Data.classical);
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   203
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   204
fun dup_elim th =  (* FIXME proper context!? *)
36546
a9873318fe30 proper context for rule_by_tactic;
wenzelm
parents: 35625
diff changeset
   205
  let
a9873318fe30 proper context for rule_by_tactic;
wenzelm
parents: 35625
diff changeset
   206
    val rl = (th RSN (2, revcut_rl)) |> Thm.assumption 2 |> Seq.hd;
42361
23f352990944 modernized structure Proof_Context;
wenzelm
parents: 41581
diff changeset
   207
    val ctxt = Proof_Context.init_global (Thm.theory_of_thm rl);
36546
a9873318fe30 proper context for rule_by_tactic;
wenzelm
parents: 35625
diff changeset
   208
  in rule_by_tactic ctxt (TRYALL (etac revcut_rl)) rl end;
a9873318fe30 proper context for rule_by_tactic;
wenzelm
parents: 35625
diff changeset
   209
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   210
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   211
(**** Classical rule sets ****)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   212
42812
dda4aef7cba4 tuned signature;
wenzelm
parents: 42810
diff changeset
   213
type netpair = (int * (bool * thm)) Net.net * (int * (bool * thm)) Net.net;
dda4aef7cba4 tuned signature;
wenzelm
parents: 42810
diff changeset
   214
type wrapper = (int -> tactic) -> int -> tactic;
dda4aef7cba4 tuned signature;
wenzelm
parents: 42810
diff changeset
   215
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   216
datatype claset =
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   217
  CS of
42810
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   218
   {safeIs         : thm Item_Net.T,          (*safe introduction rules*)
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   219
    safeEs         : thm Item_Net.T,          (*safe elimination rules*)
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   220
    hazIs          : thm Item_Net.T,          (*unsafe introduction rules*)
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   221
    hazEs          : thm Item_Net.T,          (*unsafe elimination rules*)
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   222
    swrappers      : (string * (Proof.context -> wrapper)) list, (*for transforming safe_step_tac*)
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   223
    uwrappers      : (string * (Proof.context -> wrapper)) list, (*for transforming step_tac*)
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   224
    safe0_netpair  : netpair,                 (*nets for trivial cases*)
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   225
    safep_netpair  : netpair,                 (*nets for >0 subgoals*)
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   226
    haz_netpair    : netpair,                 (*nets for unsafe rules*)
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   227
    dup_netpair    : netpair,                 (*nets for duplication*)
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   228
    xtra_netpair   : Context_Rules.netpair};  (*nets for extra rules*)
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
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   231
        safe0_netpair = build safe0_brls,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   232
        safep_netpair = build safep_brls,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   233
        haz_netpair = build (joinrules(hazIs, hazEs)),
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   234
        dup_netpair = build (joinrules(map dup_intr hazIs,
12376
480303e3fa08 simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents: 12362
diff changeset
   235
                                       map dup_elim hazEs))
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   236
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   237
where build = build_netpair(Net.empty,Net.empty),
1073
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
6502
bc30e13b36a8 improved 'single' method;
wenzelm
parents: 6492
diff changeset
   244
val empty_netpair = (Net.empty, Net.empty);
bc30e13b36a8 improved 'single' method;
wenzelm
parents: 6492
diff changeset
   245
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   246
val empty_cs =
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   247
  CS
42810
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   248
   {safeIs = Thm.full_rules,
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   249
    safeEs = Thm.full_rules,
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   250
    hazIs = Thm.full_rules,
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   251
    hazEs = Thm.full_rules,
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   252
    swrappers = [],
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   253
    uwrappers = [],
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   254
    safe0_netpair = empty_netpair,
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   255
    safep_netpair = empty_netpair,
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   256
    haz_netpair = empty_netpair,
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   257
    dup_netpair = empty_netpair,
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   258
    xtra_netpair = empty_netpair};
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   259
4653
d60f76680bf4 renamed rep_claset to rep_cs
oheimb
parents: 4651
diff changeset
   260
fun rep_cs (CS args) = args;
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   261
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   262
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   263
(*** Adding (un)safe introduction or elimination rules.
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   264
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   265
    In case of overlap, new rules are tried BEFORE old ones!!
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   266
***)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   267
12376
480303e3fa08 simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents: 12362
diff changeset
   268
(*For use with biresolve_tac.  Combines intro rules with swap to handle negated
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   269
  assumptions.  Pairs elim rules with true. *)
12376
480303e3fa08 simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents: 12362
diff changeset
   270
fun joinrules (intrs, elims) =
18557
60a0f9caa0a2 Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents: 18534
diff changeset
   271
  (map (pair true) (elims @ swapify intrs)) @ map (pair false) intrs;
12376
480303e3fa08 simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents: 12362
diff changeset
   272
12401
4363432ef0cd added 'swapped' attribute;
wenzelm
parents: 12376
diff changeset
   273
fun joinrules' (intrs, elims) =
18557
60a0f9caa0a2 Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents: 18534
diff changeset
   274
  map (pair true) elims @ map (pair false) intrs;
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   275
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   276
(*Priority: prefer rules with fewest subgoals,
1231
91d2c1bb5803 clarified comment
paulson
parents: 1073
diff changeset
   277
  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
   278
fun tag_brls k [] = []
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   279
  | tag_brls k (brl::brls) =
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   280
      (1000000*subgoals_of_brl brl + k, brl) ::
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   281
      tag_brls (k+1) brls;
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   282
12401
4363432ef0cd added 'swapped' attribute;
wenzelm
parents: 12376
diff changeset
   283
fun tag_brls' _ _ [] = []
4363432ef0cd added 'swapped' attribute;
wenzelm
parents: 12376
diff changeset
   284
  | tag_brls' w k (brl::brls) = ((w, k), brl) :: tag_brls' w (k + 1) brls;
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   285
23178
07ba6b58b3d2 simplified/unified list fold;
wenzelm
parents: 22846
diff changeset
   286
fun insert_tagged_list rls = fold_rev Tactic.insert_tagged_brl rls;
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   287
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   288
(*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
   289
  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
   290
  new insertions the lowest priority.*)
12376
480303e3fa08 simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents: 12362
diff changeset
   291
fun insert (nI, nE) = insert_tagged_list o (tag_brls (~(2*nI+nE))) o joinrules;
12401
4363432ef0cd added 'swapped' attribute;
wenzelm
parents: 12376
diff changeset
   292
fun insert' w (nI, nE) = insert_tagged_list o tag_brls' w (~(nI + nE)) o joinrules';
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   293
23178
07ba6b58b3d2 simplified/unified list fold;
wenzelm
parents: 22846
diff changeset
   294
fun delete_tagged_list rls = fold_rev Tactic.delete_tagged_brl rls;
12362
57cd572103c4 made SML/NJ happy;
wenzelm
parents: 12311
diff changeset
   295
fun delete x = delete_tagged_list (joinrules x);
12401
4363432ef0cd added 'swapped' attribute;
wenzelm
parents: 12376
diff changeset
   296
fun delete' x = delete_tagged_list (joinrules' x);
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   297
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   298
fun string_of_thm NONE = Display.string_of_thm_without_context
42817
wenzelm
parents: 42812
diff changeset
   299
  | string_of_thm (SOME context) = Display.string_of_thm (Context.proof_of context);
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   300
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   301
fun make_elim context th =
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   302
  if has_fewer_prems 1 th then
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   303
    error ("Ill-formed destruction rule\n" ^ string_of_thm context th)
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   304
  else Tactic.make_elim th;
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   305
46874
993c413746f4 tuned signature;
wenzelm
parents: 46459
diff changeset
   306
fun warn_thm opt_context msg th =
993c413746f4 tuned signature;
wenzelm
parents: 46459
diff changeset
   307
  if (case opt_context of SOME context => Context_Position.is_visible_proof context | NONE => false)
993c413746f4 tuned signature;
wenzelm
parents: 46459
diff changeset
   308
  then warning (msg ^ string_of_thm opt_context th)
42807
e639d91d9073 more precise warnings: observe context visibility;
wenzelm
parents: 42799
diff changeset
   309
  else ();
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   310
42807
e639d91d9073 more precise warnings: observe context visibility;
wenzelm
parents: 42799
diff changeset
   311
fun warn_rules context msg rules th =
42810
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   312
  Item_Net.member rules th andalso (warn_thm context msg th; true);
42807
e639d91d9073 more precise warnings: observe context visibility;
wenzelm
parents: 42799
diff changeset
   313
e639d91d9073 more precise warnings: observe context visibility;
wenzelm
parents: 42799
diff changeset
   314
fun warn_claset context th (CS {safeIs, safeEs, hazIs, hazEs, ...}) =
e639d91d9073 more precise warnings: observe context visibility;
wenzelm
parents: 42799
diff changeset
   315
  warn_rules context "Rule already declared as safe introduction (intro!)\n" safeIs th orelse
e639d91d9073 more precise warnings: observe context visibility;
wenzelm
parents: 42799
diff changeset
   316
  warn_rules context "Rule already declared as safe elimination (elim!)\n" safeEs th orelse
e639d91d9073 more precise warnings: observe context visibility;
wenzelm
parents: 42799
diff changeset
   317
  warn_rules context "Rule already declared as introduction (intro)\n" hazIs th orelse
e639d91d9073 more precise warnings: observe context visibility;
wenzelm
parents: 42799
diff changeset
   318
  warn_rules context "Rule already declared as elimination (elim)\n" hazEs th;
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   319
12376
480303e3fa08 simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents: 12362
diff changeset
   320
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   321
(*** Safe rules ***)
982
4fe0b642b7d5 Addition of wrappers for integration with the simplifier.
lcp
parents: 747
diff changeset
   322
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   323
fun addSI w context th
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   324
    (cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   325
      safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
42807
e639d91d9073 more precise warnings: observe context visibility;
wenzelm
parents: 42799
diff changeset
   326
  if warn_rules context "Ignoring duplicate safe introduction (intro!)\n" safeIs th then cs
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   327
  else
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   328
    let
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   329
      val th' = flat_rule th;
23594
e65e466dda01 renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents: 23178
diff changeset
   330
      val (safe0_rls, safep_rls) = (*0 subgoals vs 1 or more*)
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   331
        List.partition Thm.no_prems [th'];
42810
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   332
      val nI = Item_Net.length safeIs + 1;
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   333
      val nE = Item_Net.length safeEs;
42807
e639d91d9073 more precise warnings: observe context visibility;
wenzelm
parents: 42799
diff changeset
   334
      val _ = warn_claset context th cs;
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   335
    in
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   336
      CS
42810
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   337
       {safeIs = Item_Net.update th safeIs,
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   338
        safe0_netpair = insert (nI,nE) (safe0_rls, []) safe0_netpair,
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   339
        safep_netpair = insert (nI,nE) (safep_rls, []) safep_netpair,
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   340
        safeEs = safeEs,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   341
        hazIs = hazIs,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   342
        hazEs = hazEs,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   343
        swrappers = swrappers,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   344
        uwrappers = uwrappers,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   345
        haz_netpair = haz_netpair,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   346
        dup_netpair = dup_netpair,
18691
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   347
        xtra_netpair = insert' (the_default 0 w) (nI,nE) ([th], []) xtra_netpair}
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   348
    end;
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   349
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   350
fun addSE w context th
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   351
    (cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   352
      safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
42807
e639d91d9073 more precise warnings: observe context visibility;
wenzelm
parents: 42799
diff changeset
   353
  if warn_rules context "Ignoring duplicate safe elimination (elim!)\n" safeEs th then cs
18557
60a0f9caa0a2 Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents: 18534
diff changeset
   354
  else if has_fewer_prems 1 th then
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   355
    error ("Ill-formed elimination rule\n" ^ string_of_thm context th)
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   356
  else
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   357
    let
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   358
      val th' = classical_rule (flat_rule th);
18534
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   359
      val (safe0_rls, safep_rls) = (*0 subgoals vs 1 or more*)
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   360
        List.partition (fn rl => nprems_of rl=1) [th'];
42810
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   361
      val nI = Item_Net.length safeIs;
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   362
      val nE = Item_Net.length safeEs + 1;
42807
e639d91d9073 more precise warnings: observe context visibility;
wenzelm
parents: 42799
diff changeset
   363
      val _ = warn_claset context th cs;
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   364
    in
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   365
      CS
42810
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   366
       {safeEs = Item_Net.update th safeEs,
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   367
        safe0_netpair = insert (nI,nE) ([], safe0_rls) safe0_netpair,
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   368
        safep_netpair = insert (nI,nE) ([], safep_rls) safep_netpair,
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   369
        safeIs = safeIs,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   370
        hazIs = hazIs,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   371
        hazEs = hazEs,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   372
        swrappers = swrappers,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   373
        uwrappers = uwrappers,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   374
        haz_netpair = haz_netpair,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   375
        dup_netpair = dup_netpair,
18691
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   376
        xtra_netpair = insert' (the_default 0 w) (nI,nE) ([], [th]) xtra_netpair}
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   377
    end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   378
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   379
fun addSD w context th = addSE w context (make_elim context th);
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   380
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   381
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   382
(*** Hazardous (unsafe) rules ***)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   383
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   384
fun addI w context th
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   385
    (cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   386
      safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
42807
e639d91d9073 more precise warnings: observe context visibility;
wenzelm
parents: 42799
diff changeset
   387
  if warn_rules context "Ignoring duplicate introduction (intro)\n" hazIs th then cs
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   388
  else
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   389
    let
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   390
      val th' = flat_rule th;
42810
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   391
      val nI = Item_Net.length hazIs + 1;
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   392
      val nE = Item_Net.length hazEs;
42807
e639d91d9073 more precise warnings: observe context visibility;
wenzelm
parents: 42799
diff changeset
   393
      val _ = warn_claset context th cs;
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   394
    in
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   395
      CS
42810
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   396
       {hazIs = Item_Net.update th hazIs,
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   397
        haz_netpair = insert (nI, nE) ([th'], []) haz_netpair,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   398
        dup_netpair = insert (nI, nE) ([dup_intr th'], []) dup_netpair,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   399
        safeIs = safeIs,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   400
        safeEs = safeEs,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   401
        hazEs = hazEs,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   402
        swrappers = swrappers,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   403
        uwrappers = uwrappers,
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   404
        safe0_netpair = safe0_netpair,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   405
        safep_netpair = safep_netpair,
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   406
        xtra_netpair = insert' (the_default 1 w) (nI, nE) ([th], []) xtra_netpair}
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   407
    end
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   408
    handle THM ("RSN: no unifiers", _, _) => (*from dup_intr*)  (* FIXME !? *)
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   409
      error ("Ill-formed introduction rule\n" ^ string_of_thm context th);
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   410
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   411
fun addE w context th
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   412
    (cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   413
      safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
42807
e639d91d9073 more precise warnings: observe context visibility;
wenzelm
parents: 42799
diff changeset
   414
  if warn_rules context "Ignoring duplicate elimination (elim)\n" hazEs th then cs
18557
60a0f9caa0a2 Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents: 18534
diff changeset
   415
  else if has_fewer_prems 1 th then
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   416
    error ("Ill-formed elimination rule\n" ^ string_of_thm context th)
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   417
  else
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   418
    let
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   419
      val th' = classical_rule (flat_rule th);
42810
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   420
      val nI = Item_Net.length hazIs;
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   421
      val nE = Item_Net.length hazEs + 1;
42807
e639d91d9073 more precise warnings: observe context visibility;
wenzelm
parents: 42799
diff changeset
   422
      val _ = warn_claset context th cs;
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   423
    in
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   424
      CS
42810
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   425
       {hazEs = Item_Net.update th hazEs,
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   426
        haz_netpair = insert (nI, nE) ([], [th']) haz_netpair,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   427
        dup_netpair = insert (nI, nE) ([], [dup_elim th']) dup_netpair,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   428
        safeIs = safeIs,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   429
        safeEs = safeEs,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   430
        hazIs = hazIs,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   431
        swrappers = swrappers,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   432
        uwrappers = uwrappers,
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   433
        safe0_netpair = safe0_netpair,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   434
        safep_netpair = safep_netpair,
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   435
        xtra_netpair = insert' (the_default 1 w) (nI, nE) ([], [th]) xtra_netpair}
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   436
    end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   437
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   438
fun addD w context th = addE w context (make_elim context th);
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   439
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   440
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   441
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   442
(*** Deletion of rules
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   443
     Working out what to delete, requires repeating much of the code used
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   444
        to insert.
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   445
***)
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   446
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   447
fun delSI th
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   448
    (cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   449
      safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
42810
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   450
  if Item_Net.member safeIs th then
18534
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   451
    let
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   452
      val th' = flat_rule th;
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   453
      val (safe0_rls, safep_rls) = List.partition Thm.no_prems [th'];
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   454
    in
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   455
      CS
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   456
       {safe0_netpair = delete (safe0_rls, []) safe0_netpair,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   457
        safep_netpair = delete (safep_rls, []) safep_netpair,
42810
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   458
        safeIs = Item_Net.remove th safeIs,
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   459
        safeEs = safeEs,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   460
        hazIs = hazIs,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   461
        hazEs = hazEs,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   462
        swrappers = swrappers,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   463
        uwrappers = uwrappers,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   464
        haz_netpair = haz_netpair,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   465
        dup_netpair = dup_netpair,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   466
        xtra_netpair = delete' ([th], []) xtra_netpair}
18534
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   467
    end
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   468
  else cs;
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   469
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   470
fun delSE th
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   471
    (cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   472
      safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
42810
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   473
  if Item_Net.member safeEs th then
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   474
    let
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   475
      val th' = classical_rule (flat_rule th);
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   476
      val (safe0_rls, safep_rls) = List.partition (fn rl => nprems_of rl = 1) [th'];
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   477
    in
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   478
      CS
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   479
       {safe0_netpair = delete ([], safe0_rls) safe0_netpair,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   480
        safep_netpair = delete ([], safep_rls) safep_netpair,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   481
        safeIs = safeIs,
42810
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   482
        safeEs = Item_Net.remove th safeEs,
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   483
        hazIs = hazIs,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   484
        hazEs = hazEs,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   485
        swrappers = swrappers,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   486
        uwrappers = uwrappers,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   487
        haz_netpair = haz_netpair,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   488
        dup_netpair = dup_netpair,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   489
        xtra_netpair = delete' ([], [th]) xtra_netpair}
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   490
    end
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   491
  else cs;
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   492
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   493
fun delI context th
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   494
    (cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   495
      safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
42810
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   496
  if Item_Net.member hazIs th then
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   497
    let val th' = flat_rule th in
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   498
      CS
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   499
       {haz_netpair = delete ([th'], []) haz_netpair,
23594
e65e466dda01 renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents: 23178
diff changeset
   500
        dup_netpair = delete ([dup_intr th'], []) dup_netpair,
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   501
        safeIs = safeIs,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   502
        safeEs = safeEs,
42810
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   503
        hazIs = Item_Net.remove th hazIs,
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   504
        hazEs = hazEs,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   505
        swrappers = swrappers,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   506
        uwrappers = uwrappers,
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   507
        safe0_netpair = safe0_netpair,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   508
        safep_netpair = safep_netpair,
12401
4363432ef0cd added 'swapped' attribute;
wenzelm
parents: 12376
diff changeset
   509
        xtra_netpair = delete' ([th], []) xtra_netpair}
23594
e65e466dda01 renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents: 23178
diff changeset
   510
    end
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   511
  else cs
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   512
  handle THM ("RSN: no unifiers", _, _) => (*from dup_intr*)  (* FIXME !? *)
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   513
    error ("Ill-formed introduction rule\n" ^ string_of_thm context th);
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   514
2813
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   515
fun delE th
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   516
    (cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   517
      safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
42810
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   518
  if Item_Net.member hazEs th then
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   519
    let val th' = classical_rule (flat_rule th) in
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   520
      CS
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   521
       {haz_netpair = delete ([], [th']) haz_netpair,
18534
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   522
        dup_netpair = delete ([], [dup_elim th']) dup_netpair,
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   523
        safeIs = safeIs,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   524
        safeEs = safeEs,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   525
        hazIs = hazIs,
42810
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   526
        hazEs = Item_Net.remove th hazEs,
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   527
        swrappers = swrappers,
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   528
        uwrappers = uwrappers,
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   529
        safe0_netpair = safe0_netpair,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   530
        safep_netpair = safep_netpair,
12401
4363432ef0cd added 'swapped' attribute;
wenzelm
parents: 12376
diff changeset
   531
        xtra_netpair = delete' ([], [th]) xtra_netpair}
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   532
    end
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   533
  else cs;
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   534
2813
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   535
(*Delete ALL occurrences of "th" in the claset (perhaps from several lists)*)
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   536
fun delrule context th (cs as CS {safeIs, safeEs, hazIs, hazEs, ...}) =
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   537
  let val th' = Tactic.make_elim th in
42810
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   538
    if Item_Net.member safeIs th orelse Item_Net.member safeEs th orelse
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   539
      Item_Net.member hazIs th orelse Item_Net.member hazEs th orelse
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   540
      Item_Net.member safeEs th' orelse Item_Net.member hazEs th'
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   541
    then delSI th (delSE th (delI context th (delE th (delSE th' (delE th' cs)))))
42807
e639d91d9073 more precise warnings: observe context visibility;
wenzelm
parents: 42799
diff changeset
   542
    else (warn_thm context "Undeclared classical rule\n" th; cs)
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   543
  end;
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   544
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   545
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   546
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   547
(** claset data **)
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   548
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   549
(* wrappers *)
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   550
22674
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   551
fun map_swrappers f
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   552
  (CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   553
    safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   554
  CS {safeIs = safeIs, safeEs = safeEs, hazIs = hazIs, hazEs = hazEs,
4767
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   555
    swrappers = f swrappers, uwrappers = uwrappers,
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   556
    safe0_netpair = safe0_netpair, safep_netpair = safep_netpair,
6955
9e2d97ef55d2 type claset: added extra I/E rules;
wenzelm
parents: 6556
diff changeset
   557
    haz_netpair = haz_netpair, dup_netpair = dup_netpair, xtra_netpair = xtra_netpair};
4767
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   558
22674
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   559
fun map_uwrappers f
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   560
  (CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
22674
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   561
    safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   562
  CS {safeIs = safeIs, safeEs = safeEs, hazIs = hazIs, hazEs = hazEs,
4767
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   563
    swrappers = swrappers, uwrappers = f uwrappers,
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   564
    safe0_netpair = safe0_netpair, safep_netpair = safep_netpair,
6955
9e2d97ef55d2 type claset: added extra I/E rules;
wenzelm
parents: 6556
diff changeset
   565
    haz_netpair = haz_netpair, dup_netpair = dup_netpair, xtra_netpair = xtra_netpair};
4767
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   566
22674
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   567
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   568
(* merge_cs *)
982
4fe0b642b7d5 Addition of wrappers for integration with the simplifier.
lcp
parents: 747
diff changeset
   569
42810
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   570
(*Merge works by adding all new rules of the 2nd claset into the 1st claset,
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   571
  in order to preserve priorities reliably.*)
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   572
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   573
fun merge_thms add thms1 thms2 =
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   574
  fold_rev (fn thm => if Item_Net.member thms1 thm then I else add thm) (Item_Net.content thms2);
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   575
22674
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   576
fun merge_cs (cs as CS {safeIs, safeEs, hazIs, hazEs, ...},
24358
d75af3e90e82 tuned merge operations via pointer_eq;
wenzelm
parents: 24218
diff changeset
   577
    cs' as CS {safeIs = safeIs2, safeEs = safeEs2, hazIs = hazIs2, hazEs = hazEs2,
22674
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   578
      swrappers, uwrappers, ...}) =
24358
d75af3e90e82 tuned merge operations via pointer_eq;
wenzelm
parents: 24218
diff changeset
   579
  if pointer_eq (cs, cs') then cs
d75af3e90e82 tuned merge operations via pointer_eq;
wenzelm
parents: 24218
diff changeset
   580
  else
42810
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   581
    cs
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   582
    |> merge_thms (addSI NONE NONE) safeIs safeIs2
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   583
    |> merge_thms (addSE NONE NONE) safeEs safeEs2
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   584
    |> merge_thms (addI NONE NONE) hazIs hazIs2
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   585
    |> merge_thms (addE NONE NONE) hazEs hazEs2
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   586
    |> map_swrappers (fn ws => AList.merge (op =) (K true) (ws, swrappers))
2425068fe13a slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;
wenzelm
parents: 42807
diff changeset
   587
    |> map_uwrappers (fn ws => AList.merge (op =) (K true) (ws, uwrappers));
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   588
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   589
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   590
(* data *)
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   591
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   592
structure Claset = Generic_Data
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   593
(
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   594
  type T = claset;
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   595
  val empty = empty_cs;
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   596
  val extend = I;
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   597
  val merge = merge_cs;
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   598
);
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   599
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   600
val claset_of = Claset.get o Context.Proof;
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   601
val rep_claset_of = rep_cs o claset_of;
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   602
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   603
val get_cs = Claset.get;
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   604
val map_cs = Claset.map;
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   605
51703
f2e92fc0c8aa modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents: 51688
diff changeset
   606
fun map_theory_claset f thy =
f2e92fc0c8aa modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents: 51688
diff changeset
   607
  let
f2e92fc0c8aa modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents: 51688
diff changeset
   608
    val ctxt' = f (Proof_Context.init_global thy);
f2e92fc0c8aa modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents: 51688
diff changeset
   609
    val thy' = Proof_Context.theory_of ctxt';
f2e92fc0c8aa modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents: 51688
diff changeset
   610
  in Context.theory_map (Claset.map (K (claset_of ctxt'))) thy' end;
f2e92fc0c8aa modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents: 51688
diff changeset
   611
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   612
fun map_claset f = Context.proof_map (map_cs f);
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   613
fun put_claset cs = map_claset (K cs);
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   614
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   615
fun print_claset ctxt =
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   616
  let
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   617
    val {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, ...} = rep_claset_of ctxt;
51584
98029ceda8ce more item markup;
wenzelm
parents: 51580
diff changeset
   618
    val pretty_thms = map (Display.pretty_thm_item ctxt) o Item_Net.content;
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   619
  in
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   620
    [Pretty.big_list "safe introduction rules (intro!):" (pretty_thms safeIs),
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   621
      Pretty.big_list "introduction rules (intro):" (pretty_thms hazIs),
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   622
      Pretty.big_list "safe elimination rules (elim!):" (pretty_thms safeEs),
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   623
      Pretty.big_list "elimination rules (elim):" (pretty_thms hazEs),
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   624
      Pretty.strs ("safe wrappers:" :: map #1 swrappers),
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   625
      Pretty.strs ("unsafe wrappers:" :: map #1 uwrappers)]
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   626
    |> Pretty.chunks |> Pretty.writeln
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   627
  end;
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   628
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   629
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   630
(* old-style declarations *)
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   631
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   632
fun decl f (ctxt, ths) = map_claset (fold_rev (f (SOME (Context.Proof ctxt))) ths) ctxt;
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   633
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   634
val op addSIs = decl (addSI NONE);
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   635
val op addSEs = decl (addSE NONE);
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   636
val op addSDs = decl (addSD NONE);
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   637
val op addIs = decl (addI NONE);
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   638
val op addEs = decl (addE NONE);
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   639
val op addDs = decl (addD NONE);
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   640
val op delrules = decl delrule;
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   641
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   642
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   643
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   644
(*** Modifying the wrapper tacticals ***)
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   645
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   646
fun appSWrappers ctxt = fold (fn (_, w) => w ctxt) (#swrappers (rep_claset_of ctxt));
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   647
fun appWrappers ctxt = fold (fn (_, w) => w ctxt) (#uwrappers (rep_claset_of ctxt));
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   648
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   649
fun update_warn msg (p as (key : string, _)) xs =
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   650
  (if AList.defined (op =) xs key then warning msg else (); AList.update (op =) p xs);
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   651
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   652
fun delete_warn msg (key : string) xs =
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   653
  if AList.defined (op =) xs key then AList.delete (op =) key xs
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   654
  else (warning msg; xs);
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   655
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   656
(*Add/replace a safe wrapper*)
51703
f2e92fc0c8aa modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents: 51688
diff changeset
   657
fun ctxt addSWrapper new_swrapper = ctxt |> map_claset
f2e92fc0c8aa modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents: 51688
diff changeset
   658
  (map_swrappers (update_warn ("Overwriting safe wrapper " ^ fst new_swrapper) new_swrapper));
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   659
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   660
(*Add/replace an unsafe wrapper*)
51703
f2e92fc0c8aa modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents: 51688
diff changeset
   661
fun ctxt addWrapper new_uwrapper = ctxt |> map_claset
f2e92fc0c8aa modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents: 51688
diff changeset
   662
  (map_uwrappers (update_warn ("Overwriting unsafe wrapper " ^ fst new_uwrapper) new_uwrapper));
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   663
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   664
(*Remove a safe wrapper*)
51703
f2e92fc0c8aa modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents: 51688
diff changeset
   665
fun ctxt delSWrapper name = ctxt |> map_claset
f2e92fc0c8aa modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents: 51688
diff changeset
   666
  (map_swrappers (delete_warn ("No such safe wrapper in claset: " ^ name) name));
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   667
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   668
(*Remove an unsafe wrapper*)
51703
f2e92fc0c8aa modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents: 51688
diff changeset
   669
fun ctxt delWrapper name = ctxt |> map_claset
f2e92fc0c8aa modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents: 51688
diff changeset
   670
  (map_uwrappers (delete_warn ("No such unsafe wrapper in claset: " ^ name) name));
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   671
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   672
(* compose a safe tactic alternatively before/after safe_step_tac *)
51703
f2e92fc0c8aa modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents: 51688
diff changeset
   673
fun ctxt addSbefore (name, tac1) = ctxt addSWrapper (name, fn _ => fn tac2 => tac1 ORELSE' tac2);
f2e92fc0c8aa modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents: 51688
diff changeset
   674
fun ctxt addSafter (name, tac2) = ctxt addSWrapper (name, fn _ => fn tac1 => tac1 ORELSE' tac2);
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   675
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   676
(*compose a tactic alternatively before/after the step tactic *)
51703
f2e92fc0c8aa modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents: 51688
diff changeset
   677
fun ctxt addbefore (name, tac1) = ctxt addWrapper (name, fn _ => fn tac2 => tac1 APPEND' tac2);
f2e92fc0c8aa modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents: 51688
diff changeset
   678
fun ctxt addafter (name, tac2) = ctxt addWrapper (name, fn _ => fn tac1 => tac1 APPEND' tac2);
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   679
51703
f2e92fc0c8aa modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents: 51688
diff changeset
   680
fun ctxt addD2 (name, thm) = ctxt addafter (name, dtac thm THEN' assume_tac);
f2e92fc0c8aa modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents: 51688
diff changeset
   681
fun ctxt addE2 (name, thm) = ctxt addafter (name, etac thm THEN' assume_tac);
f2e92fc0c8aa modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents: 51688
diff changeset
   682
fun ctxt addSD2 (name, thm) = ctxt addSafter (name, dmatch_tac [thm] THEN' eq_assume_tac);
f2e92fc0c8aa modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents: 51688
diff changeset
   683
fun ctxt addSE2 (name, thm) = ctxt addSafter (name, ematch_tac [thm] THEN' eq_assume_tac);
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   684
1711
c06d01f75764 Provides merge_cs to support default clasets
paulson
parents: 1587
diff changeset
   685
982
4fe0b642b7d5 Addition of wrappers for integration with the simplifier.
lcp
parents: 747
diff changeset
   686
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   687
(**** Simple tactics for theorem proving ****)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   688
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   689
(*Attack subgoals using safe inferences -- matching, not resolution*)
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   690
fun safe_step_tac ctxt =
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   691
  let val {safe0_netpair, safep_netpair, ...} = rep_claset_of ctxt in
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   692
    appSWrappers ctxt
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   693
      (FIRST'
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   694
       [eq_assume_tac,
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   695
        eq_mp_tac,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   696
        bimatch_from_nets_tac safe0_netpair,
42792
85fb70b0c5e8 do not open ML structures;
wenzelm
parents: 42791
diff changeset
   697
        FIRST' Data.hyp_subst_tacs,
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   698
        bimatch_from_nets_tac safep_netpair])
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   699
  end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   700
5757
0ad476dabbc6 corrected (and simplified) depth_tac
oheimb
parents: 5523
diff changeset
   701
(*Repeatedly attack a subgoal using safe inferences -- it's deterministic!*)
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   702
fun safe_steps_tac ctxt =
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   703
  REPEAT_DETERM1 o (fn i => COND (has_fewer_prems i) no_tac (safe_step_tac ctxt i));
5757
0ad476dabbc6 corrected (and simplified) depth_tac
oheimb
parents: 5523
diff changeset
   704
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   705
(*Repeatedly attack subgoals using safe inferences -- it's deterministic!*)
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   706
fun safe_tac ctxt = REPEAT_DETERM1 (FIRSTGOAL (safe_steps_tac ctxt));
747
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   707
3705
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   708
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   709
(*** 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
   710
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   711
fun nsubgoalsP n (k, brl) = (subgoals_of_brl brl = n);
3705
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   712
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   713
(*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
   714
  create precisely n subgoals.*)
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   715
fun n_bimatch_from_nets_tac n =
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   716
  biresolution_from_nets_tac (order_list o filter (nsubgoalsP n)) true;
3705
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   717
42792
85fb70b0c5e8 do not open ML structures;
wenzelm
parents: 42791
diff changeset
   718
fun eq_contr_tac i = ematch_tac [Data.not_elim] i THEN eq_assume_tac i;
3705
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   719
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
   720
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   721
(*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
   722
fun bimatch2_tac netpair i =
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   723
  n_bimatch_from_nets_tac 2 netpair i THEN
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   724
  (eq_assume_contr_tac i ORELSE eq_assume_contr_tac (i + 1));
3705
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   725
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   726
(*Attack subgoals using safe inferences -- matching, not resolution*)
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   727
fun clarify_step_tac ctxt =
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   728
  let val {safe0_netpair, safep_netpair, ...} = rep_claset_of ctxt in
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   729
    appSWrappers ctxt
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   730
     (FIRST'
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   731
       [eq_assume_contr_tac,
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   732
        bimatch_from_nets_tac safe0_netpair,
42792
85fb70b0c5e8 do not open ML structures;
wenzelm
parents: 42791
diff changeset
   733
        FIRST' Data.hyp_subst_tacs,
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   734
        n_bimatch_from_nets_tac 1 safep_netpair,
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   735
        bimatch2_tac safep_netpair])
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   736
  end;
3705
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   737
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   738
fun clarify_tac ctxt = SELECT_GOAL (REPEAT_DETERM (clarify_step_tac ctxt 1));
3705
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   739
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   740
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   741
(*** 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
   742
4066
7b508ac609f7 Fixed comments
paulson
parents: 3727
diff changeset
   743
(*Backtracking is allowed among the various these unsafe ways of
7b508ac609f7 Fixed comments
paulson
parents: 3727
diff changeset
   744
  proving a subgoal.  *)
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   745
fun inst0_step_tac ctxt =
32862
1fc86cec3bdf eliminated dead code and redundant parameters;
wenzelm
parents: 32740
diff changeset
   746
  assume_tac APPEND'
1fc86cec3bdf eliminated dead code and redundant parameters;
wenzelm
parents: 32740
diff changeset
   747
  contr_tac APPEND'
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   748
  biresolve_from_nets_tac (#safe0_netpair (rep_claset_of ctxt));
747
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   749
4066
7b508ac609f7 Fixed comments
paulson
parents: 3727
diff changeset
   750
(*These unsafe steps could generate more subgoals.*)
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   751
fun instp_step_tac ctxt =
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   752
  biresolve_from_nets_tac (#safep_netpair (rep_claset_of ctxt));
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   753
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   754
(*These steps could instantiate variables and are therefore unsafe.*)
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   755
fun inst_step_tac ctxt = inst0_step_tac ctxt APPEND' instp_step_tac ctxt;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   756
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   757
fun haz_step_tac ctxt =
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   758
  biresolve_from_nets_tac (#haz_netpair (rep_claset_of ctxt));
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   759
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   760
(*Single step for the prover.  FAILS unless it makes progress. *)
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   761
fun step_tac ctxt i =
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   762
  safe_tac ctxt ORELSE appWrappers ctxt (inst_step_tac ctxt ORELSE' haz_step_tac ctxt) i;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   763
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   764
(*Using a "safe" rule to instantiate variables is unsafe.  This tactic
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   765
  allows backtracking from "safe" rules to "unsafe" rules here.*)
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   766
fun slow_step_tac ctxt i =
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   767
  safe_tac ctxt ORELSE appWrappers ctxt (inst_step_tac ctxt APPEND' haz_step_tac ctxt) i;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   768
42791
36f787ae5f70 eliminated weight_ASTAR: int Unsynchronized.ref (astar_tac appears to be obsolete anyway);
wenzelm
parents: 42790
diff changeset
   769
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   770
(**** The following tactics all fail unless they solve one goal ****)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   771
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   772
(*Dumb but fast*)
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   773
fun fast_tac ctxt =
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   774
  Object_Logic.atomize_prems_tac THEN' SELECT_GOAL (DEPTH_SOLVE (step_tac ctxt 1));
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   775
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   776
(*Slower but smarter than fast_tac*)
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   777
fun best_tac ctxt =
35625
9c818cab0dd0 modernized structure Object_Logic;
wenzelm
parents: 35613
diff changeset
   778
  Object_Logic.atomize_prems_tac THEN'
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   779
  SELECT_GOAL (BEST_FIRST (has_fewer_prems 1, Data.sizef) (step_tac ctxt 1));
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   780
9402
480a1b40fdd6 strengthened force_tac by using new first_best_tac
oheimb
parents: 9184
diff changeset
   781
(*even a bit smarter than best_tac*)
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   782
fun first_best_tac ctxt =
35625
9c818cab0dd0 modernized structure Object_Logic;
wenzelm
parents: 35613
diff changeset
   783
  Object_Logic.atomize_prems_tac THEN'
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   784
  SELECT_GOAL (BEST_FIRST (has_fewer_prems 1, Data.sizef) (FIRSTGOAL (step_tac ctxt)));
9402
480a1b40fdd6 strengthened force_tac by using new first_best_tac
oheimb
parents: 9184
diff changeset
   785
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   786
fun slow_tac ctxt =
35625
9c818cab0dd0 modernized structure Object_Logic;
wenzelm
parents: 35613
diff changeset
   787
  Object_Logic.atomize_prems_tac THEN'
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   788
  SELECT_GOAL (DEPTH_SOLVE (slow_step_tac ctxt 1));
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   789
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   790
fun slow_best_tac ctxt =
35625
9c818cab0dd0 modernized structure Object_Logic;
wenzelm
parents: 35613
diff changeset
   791
  Object_Logic.atomize_prems_tac THEN'
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   792
  SELECT_GOAL (BEST_FIRST (has_fewer_prems 1, Data.sizef) (slow_step_tac ctxt 1));
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   793
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   794
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   795
(***ASTAR with weight weight_ASTAR, by Norbert Voelker*)
42791
36f787ae5f70 eliminated weight_ASTAR: int Unsynchronized.ref (astar_tac appears to be obsolete anyway);
wenzelm
parents: 42790
diff changeset
   796
36f787ae5f70 eliminated weight_ASTAR: int Unsynchronized.ref (astar_tac appears to be obsolete anyway);
wenzelm
parents: 42790
diff changeset
   797
val weight_ASTAR = 5;
1587
e7d8a4957bac Now provides astar versions (thanks to Norbert Voelker)
paulson
parents: 1524
diff changeset
   798
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   799
fun astar_tac ctxt =
35625
9c818cab0dd0 modernized structure Object_Logic;
wenzelm
parents: 35613
diff changeset
   800
  Object_Logic.atomize_prems_tac THEN'
10382
1fb807260ff1 atomize: all automated tactics that "solve" goals;
wenzelm
parents: 10309
diff changeset
   801
  SELECT_GOAL
42791
36f787ae5f70 eliminated weight_ASTAR: int Unsynchronized.ref (astar_tac appears to be obsolete anyway);
wenzelm
parents: 42790
diff changeset
   802
    (ASTAR (has_fewer_prems 1, fn lev => fn thm => size_of_thm thm + weight_ASTAR * lev)
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   803
      (step_tac ctxt 1));
1587
e7d8a4957bac Now provides astar versions (thanks to Norbert Voelker)
paulson
parents: 1524
diff changeset
   804
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   805
fun slow_astar_tac ctxt =
35625
9c818cab0dd0 modernized structure Object_Logic;
wenzelm
parents: 35613
diff changeset
   806
  Object_Logic.atomize_prems_tac THEN'
10382
1fb807260ff1 atomize: all automated tactics that "solve" goals;
wenzelm
parents: 10309
diff changeset
   807
  SELECT_GOAL
42791
36f787ae5f70 eliminated weight_ASTAR: int Unsynchronized.ref (astar_tac appears to be obsolete anyway);
wenzelm
parents: 42790
diff changeset
   808
    (ASTAR (has_fewer_prems 1, fn lev => fn thm => size_of_thm thm + weight_ASTAR * lev)
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   809
      (slow_step_tac ctxt 1));
1587
e7d8a4957bac Now provides astar versions (thanks to Norbert Voelker)
paulson
parents: 1524
diff changeset
   810
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   811
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   812
(**** 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
   813
  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
   814
  easy theorems faster, but loses completeness -- and many of the harder
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   815
  theorems such as 43. ****)
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   816
747
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   817
(*Non-deterministic!  Could always expand the first unsafe connective.
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   818
  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
   819
  greater search depth required.*)
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   820
fun dup_step_tac ctxt =
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   821
  biresolve_from_nets_tac (#dup_netpair (rep_claset_of ctxt));
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   822
5523
dc8cdc192cd0 added addD2, addE2, addSD2, and addSE2
oheimb
parents: 5028
diff changeset
   823
(*Searching to depth m. A variant called nodup_depth_tac appears in clasimp.ML*)
5757
0ad476dabbc6 corrected (and simplified) depth_tac
oheimb
parents: 5523
diff changeset
   824
local
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   825
  fun slow_step_tac' ctxt = appWrappers ctxt (instp_step_tac ctxt APPEND' dup_step_tac ctxt);
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   826
in
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   827
  fun depth_tac ctxt m i state = SELECT_GOAL
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   828
    (safe_steps_tac ctxt 1 THEN_ELSE
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   829
      (DEPTH_SOLVE (depth_tac ctxt m 1),
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   830
        inst0_step_tac ctxt 1 APPEND COND (K (m = 0)) no_tac
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   831
          (slow_step_tac' ctxt 1 THEN DEPTH_SOLVE (depth_tac ctxt (m - 1) 1)))) i state;
5757
0ad476dabbc6 corrected (and simplified) depth_tac
oheimb
parents: 5523
diff changeset
   832
end;
747
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   833
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   834
(*Search, with depth bound m.
2173
08c68550460b Added a comment
paulson
parents: 2066
diff changeset
   835
  This is the "entry point", which does safe inferences first.*)
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   836
fun safe_depth_tac ctxt m = SUBGOAL (fn (prem, i) =>
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   837
  let
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   838
    val deti = (*No Vars in the goal?  No need to backtrack between goals.*)
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   839
      if exists_subterm (fn Var _ => true | _ => false) prem then DETERM else I;
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   840
  in
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   841
    SELECT_GOAL (TRY (safe_tac ctxt) THEN DEPTH_SOLVE (deti (depth_tac ctxt m 1))) i
42790
e07e56300faa misc tuning and simplification;
wenzelm
parents: 42439
diff changeset
   842
  end);
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   843
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   844
fun deepen_tac ctxt = DEEPEN (2, 10) (safe_depth_tac ctxt);
24021
491c68f40bc4 added get_cs/map_cs;
wenzelm
parents: 23594
diff changeset
   845
491c68f40bc4 added get_cs/map_cs;
wenzelm
parents: 23594
diff changeset
   846
5885
6c920d876098 tuned attribute names;
wenzelm
parents: 5841
diff changeset
   847
(* attributes *)
6c920d876098 tuned attribute names;
wenzelm
parents: 5841
diff changeset
   848
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   849
fun attrib f =
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   850
  Thm.declaration_attribute (fn th => fn context => map_cs (f (SOME context) th) context);
5885
6c920d876098 tuned attribute names;
wenzelm
parents: 5841
diff changeset
   851
18691
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   852
val safe_elim = attrib o addSE;
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   853
val safe_intro = attrib o addSI;
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   854
val safe_dest = attrib o addSD;
18691
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   855
val haz_elim = attrib o addE;
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   856
val haz_intro = attrib o addI;
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   857
val haz_dest = attrib o addD;
45375
7fe19930dfc9 more explicit representation of rule_attribute vs. declaration_attribute vs. mixed_attribute;
wenzelm
parents: 42817
diff changeset
   858
7fe19930dfc9 more explicit representation of rule_attribute vs. declaration_attribute vs. mixed_attribute;
wenzelm
parents: 42817
diff changeset
   859
val rule_del =
7fe19930dfc9 more explicit representation of rule_attribute vs. declaration_attribute vs. mixed_attribute;
wenzelm
parents: 42817
diff changeset
   860
  Thm.declaration_attribute (fn th => fn context =>
7fe19930dfc9 more explicit representation of rule_attribute vs. declaration_attribute vs. mixed_attribute;
wenzelm
parents: 42817
diff changeset
   861
    context |> map_cs (delrule (SOME context) th) |>
7fe19930dfc9 more explicit representation of rule_attribute vs. declaration_attribute vs. mixed_attribute;
wenzelm
parents: 42817
diff changeset
   862
    Thm.attribute_declaration Context_Rules.rule_del th);
5885
6c920d876098 tuned attribute names;
wenzelm
parents: 5841
diff changeset
   863
6c920d876098 tuned attribute names;
wenzelm
parents: 5841
diff changeset
   864
5841
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   865
5885
6c920d876098 tuned attribute names;
wenzelm
parents: 5841
diff changeset
   866
(** concrete syntax of attributes **)
5841
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   867
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   868
val introN = "intro";
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   869
val elimN = "elim";
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   870
val destN = "dest";
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   871
30528
7173bf123335 simplified attribute setup;
wenzelm
parents: 30513
diff changeset
   872
val setup_attrs =
7173bf123335 simplified attribute setup;
wenzelm
parents: 30513
diff changeset
   873
  Attrib.setup @{binding swapped} (Scan.succeed swapped)
7173bf123335 simplified attribute setup;
wenzelm
parents: 30513
diff changeset
   874
    "classical swap of introduction rule" #>
33369
470a7b233ee5 modernized structure Context_Rules;
wenzelm
parents: 33339
diff changeset
   875
  Attrib.setup @{binding dest} (Context_Rules.add safe_dest haz_dest Context_Rules.dest_query)
30528
7173bf123335 simplified attribute setup;
wenzelm
parents: 30513
diff changeset
   876
    "declaration of Classical destruction rule" #>
33369
470a7b233ee5 modernized structure Context_Rules;
wenzelm
parents: 33339
diff changeset
   877
  Attrib.setup @{binding elim} (Context_Rules.add safe_elim haz_elim Context_Rules.elim_query)
30528
7173bf123335 simplified attribute setup;
wenzelm
parents: 30513
diff changeset
   878
    "declaration of Classical elimination rule" #>
33369
470a7b233ee5 modernized structure Context_Rules;
wenzelm
parents: 33339
diff changeset
   879
  Attrib.setup @{binding intro} (Context_Rules.add safe_intro haz_intro Context_Rules.intro_query)
30528
7173bf123335 simplified attribute setup;
wenzelm
parents: 30513
diff changeset
   880
    "declaration of Classical introduction rule" #>
7173bf123335 simplified attribute setup;
wenzelm
parents: 30513
diff changeset
   881
  Attrib.setup @{binding rule} (Scan.lift Args.del >> K rule_del)
7173bf123335 simplified attribute setup;
wenzelm
parents: 30513
diff changeset
   882
    "remove declaration of intro/elim/dest rule";
5841
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   883
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   884
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   885
7230
4ca0d7839ff1 renamed 'single' to 'some_rule';
wenzelm
parents: 7154
diff changeset
   886
(** proof methods **)
4ca0d7839ff1 renamed 'single' to 'some_rule';
wenzelm
parents: 7154
diff changeset
   887
4ca0d7839ff1 renamed 'single' to 'some_rule';
wenzelm
parents: 7154
diff changeset
   888
local
4ca0d7839ff1 renamed 'single' to 'some_rule';
wenzelm
parents: 7154
diff changeset
   889
30609
983e8b6e4e69 Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents: 30558
diff changeset
   890
fun some_rule_tac ctxt facts = SUBGOAL (fn (goal, i) =>
5841
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   891
  let
33369
470a7b233ee5 modernized structure Context_Rules;
wenzelm
parents: 33339
diff changeset
   892
    val [rules1, rules2, rules4] = Context_Rules.find_rules false facts goal ctxt;
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   893
    val {xtra_netpair, ...} = rep_claset_of ctxt;
33369
470a7b233ee5 modernized structure Context_Rules;
wenzelm
parents: 33339
diff changeset
   894
    val rules3 = Context_Rules.find_rules_netpair true facts goal xtra_netpair;
12376
480303e3fa08 simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents: 12362
diff changeset
   895
    val rules = rules1 @ rules2 @ rules3 @ rules4;
18223
20830cb4428c Drule.multi_resolves;
wenzelm
parents: 18015
diff changeset
   896
    val ruleq = Drule.multi_resolves facts rules;
12376
480303e3fa08 simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents: 12362
diff changeset
   897
  in
480303e3fa08 simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents: 12362
diff changeset
   898
    Method.trace ctxt rules;
32952
aeb1e44fbc19 replaced String.concat by implode;
wenzelm
parents: 32863
diff changeset
   899
    fn st => Seq.maps (fn rule => Tactic.rtac rule i st) ruleq
18834
7e94af77cfce default rule step: norm_hhf_tac;
wenzelm
parents: 18728
diff changeset
   900
  end)
21687
f689f729afab reorganized structure Goal vs. Tactic;
wenzelm
parents: 21646
diff changeset
   901
  THEN_ALL_NEW Goal.norm_hhf_tac;
5841
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   902
30609
983e8b6e4e69 Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents: 30558
diff changeset
   903
in
7281
2f454e1fd372 renamed 'some_rule' to 'rule';
wenzelm
parents: 7272
diff changeset
   904
30609
983e8b6e4e69 Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents: 30558
diff changeset
   905
fun rule_tac ctxt [] facts = some_rule_tac ctxt facts
983e8b6e4e69 Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents: 30558
diff changeset
   906
  | rule_tac _ rules facts = Method.rule_tac rules facts;
983e8b6e4e69 Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents: 30558
diff changeset
   907
983e8b6e4e69 Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents: 30558
diff changeset
   908
fun default_tac ctxt rules facts =
983e8b6e4e69 Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents: 30558
diff changeset
   909
  HEADGOAL (rule_tac ctxt rules facts) ORELSE
26470
e44d24620515 unfold_locales now part of default tactic
haftmann
parents: 26425
diff changeset
   910
  Class.default_intro_tac ctxt facts;
10309
a7f961fb62c6 intro_classes by default;
wenzelm
parents: 10185
diff changeset
   911
7230
4ca0d7839ff1 renamed 'single' to 'some_rule';
wenzelm
parents: 7154
diff changeset
   912
end;
5841
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   913
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   914
6502
bc30e13b36a8 improved 'single' method;
wenzelm
parents: 6492
diff changeset
   915
(* automatic methods *)
5841
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   916
5927
991483daa1a4 expoer cla_method('), cla_modifiers;
wenzelm
parents: 5885
diff changeset
   917
val cla_modifiers =
18728
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
   918
 [Args.$$$ destN -- Args.bang_colon >> K ((I, safe_dest NONE): Method.modifier),
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
   919
  Args.$$$ destN -- Args.colon >> K (I, haz_dest NONE),
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
   920
  Args.$$$ elimN -- Args.bang_colon >> K (I, safe_elim NONE),
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
   921
  Args.$$$ elimN -- Args.colon >> K (I, haz_elim NONE),
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
   922
  Args.$$$ introN -- Args.bang_colon >> K (I, safe_intro NONE),
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
   923
  Args.$$$ introN -- Args.colon >> K (I, haz_intro NONE),
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
   924
  Args.del -- Args.colon >> K (I, rule_del)];
5927
991483daa1a4 expoer cla_method('), cla_modifiers;
wenzelm
parents: 5885
diff changeset
   925
42793
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   926
fun cla_method tac = Method.sections cla_modifiers >> K (SIMPLE_METHOD o tac);
88bee9f6eec7 proper Proof.context for classical tactics;
wenzelm
parents: 42792
diff changeset
   927
fun cla_method' tac = Method.sections cla_modifiers >> K (SIMPLE_METHOD' o tac);
5841
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   928
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   929
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   930
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   931
(** setup_methods **)
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   932
30541
9f168bdc468a simplified method setup;
wenzelm
parents: 30528
diff changeset
   933
val setup_methods =
30609
983e8b6e4e69 Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents: 30558
diff changeset
   934
  Method.setup @{binding default}
983e8b6e4e69 Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents: 30558
diff changeset
   935
   (Attrib.thms >> (fn rules => fn ctxt => METHOD (default_tac ctxt rules)))
30541
9f168bdc468a simplified method setup;
wenzelm
parents: 30528
diff changeset
   936
    "apply some intro/elim rule (potentially classical)" #>
30609
983e8b6e4e69 Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents: 30558
diff changeset
   937
  Method.setup @{binding rule}
983e8b6e4e69 Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents: 30558
diff changeset
   938
    (Attrib.thms >> (fn rules => fn ctxt => METHOD (HEADGOAL o rule_tac ctxt rules)))
30541
9f168bdc468a simplified method setup;
wenzelm
parents: 30528
diff changeset
   939
    "apply some intro/elim rule (potentially classical)" #>
50112
11cd86c5af3a tuned -- eliminate pointless ML method definition;
wenzelm
parents: 50108
diff changeset
   940
  Method.setup @{binding contradiction}
11cd86c5af3a tuned -- eliminate pointless ML method definition;
wenzelm
parents: 50108
diff changeset
   941
    (Scan.succeed (K (Method.rule [Data.not_elim, Drule.rotate_prems 1 Data.not_elim])))
30541
9f168bdc468a simplified method setup;
wenzelm
parents: 30528
diff changeset
   942
    "proof by contradiction" #>
9f168bdc468a simplified method setup;
wenzelm
parents: 30528
diff changeset
   943
  Method.setup @{binding clarify} (cla_method' (CHANGED_PROP oo clarify_tac))
9f168bdc468a simplified method setup;
wenzelm
parents: 30528
diff changeset
   944
    "repeatedly apply safe steps" #>
9f168bdc468a simplified method setup;
wenzelm
parents: 30528
diff changeset
   945
  Method.setup @{binding fast} (cla_method' fast_tac) "classical prover (depth-first)" #>
9f168bdc468a simplified method setup;
wenzelm
parents: 30528
diff changeset
   946
  Method.setup @{binding slow} (cla_method' slow_tac) "classical prover (slow depth-first)" #>
9f168bdc468a simplified method setup;
wenzelm
parents: 30528
diff changeset
   947
  Method.setup @{binding best} (cla_method' best_tac) "classical prover (best-first)" #>
42798
02c88bdabe75 method "deepen" with optional limit;
wenzelm
parents: 42793
diff changeset
   948
  Method.setup @{binding deepen}
02c88bdabe75 method "deepen" with optional limit;
wenzelm
parents: 42793
diff changeset
   949
    (Scan.lift (Scan.optional Parse.nat 4) --| Method.sections cla_modifiers
02c88bdabe75 method "deepen" with optional limit;
wenzelm
parents: 42793
diff changeset
   950
      >> (fn n => fn ctxt => SIMPLE_METHOD' (deepen_tac ctxt n)))
30541
9f168bdc468a simplified method setup;
wenzelm
parents: 30528
diff changeset
   951
    "classical prover (iterative deepening)" #>
9f168bdc468a simplified method setup;
wenzelm
parents: 30528
diff changeset
   952
  Method.setup @{binding safe} (cla_method (CHANGED_PROP o safe_tac))
50108
f171b5240c31 method setup for Classical steps;
wenzelm
parents: 50062
diff changeset
   953
    "classical prover (apply safe rules)" #>
f171b5240c31 method setup for Classical steps;
wenzelm
parents: 50062
diff changeset
   954
  Method.setup @{binding safe_step} (cla_method' safe_step_tac)
f171b5240c31 method setup for Classical steps;
wenzelm
parents: 50062
diff changeset
   955
    "single classical step (safe rules)" #>
f171b5240c31 method setup for Classical steps;
wenzelm
parents: 50062
diff changeset
   956
  Method.setup @{binding inst_step} (cla_method' inst_step_tac)
f171b5240c31 method setup for Classical steps;
wenzelm
parents: 50062
diff changeset
   957
    "single classical step (safe rules, allow instantiations)" #>
f171b5240c31 method setup for Classical steps;
wenzelm
parents: 50062
diff changeset
   958
  Method.setup @{binding step} (cla_method' step_tac)
f171b5240c31 method setup for Classical steps;
wenzelm
parents: 50062
diff changeset
   959
    "single classical step (safe and unsafe rules)" #>
f171b5240c31 method setup for Classical steps;
wenzelm
parents: 50062
diff changeset
   960
  Method.setup @{binding slow_step} (cla_method' slow_step_tac)
f171b5240c31 method setup for Classical steps;
wenzelm
parents: 50062
diff changeset
   961
    "single classical step (safe and unsafe rules, allow backtracking)" #>
f171b5240c31 method setup for Classical steps;
wenzelm
parents: 50062
diff changeset
   962
  Method.setup @{binding clarify_step} (cla_method' clarify_step_tac)
f171b5240c31 method setup for Classical steps;
wenzelm
parents: 50062
diff changeset
   963
    "single classical step (safe rules, without splitting)";
5841
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   964
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   965
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   966
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   967
(** theory setup **)
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   968
26497
1873915c64a9 purely functional setup of claset/simpset/clasimpset;
wenzelm
parents: 26470
diff changeset
   969
val setup = setup_attrs #> setup_methods;
5841
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   970
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   971
8667
4230d17073ea print_simpset / print_claset command;
wenzelm
parents: 8519
diff changeset
   972
4230d17073ea print_simpset / print_claset command;
wenzelm
parents: 8519
diff changeset
   973
(** outer syntax **)
4230d17073ea print_simpset / print_claset command;
wenzelm
parents: 8519
diff changeset
   974
24867
e5b55d7be9bb simplified interfaces for outer syntax;
wenzelm
parents: 24358
diff changeset
   975
val _ =
46961
5c6955f487e5 outer syntax command definitions based on formal command_spec derived from theory header declarations;
wenzelm
parents: 46874
diff changeset
   976
  Outer_Syntax.improper_command @{command_spec "print_claset"} "print context of Classical Reasoner"
51658
21c10672633b discontinued Toplevel.no_timing complication -- also recovers timing of diagnostic commands, e.g. 'find_theorems';
wenzelm
parents: 51584
diff changeset
   977
    (Scan.succeed (Toplevel.unknown_context o Toplevel.keep (print_claset o Toplevel.context_of)));
8667
4230d17073ea print_simpset / print_claset command;
wenzelm
parents: 8519
diff changeset
   978
5841
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   979
end;