src/Pure/tactic.ML
author wenzelm
Sun, 11 Nov 2012 20:31:46 +0100
changeset 50081 9b92ee8dec98
parent 49865 eeaf1ec7eac2
child 50239 fb579401dc26
permissions -rw-r--r--
tuned;
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
10805
89a29437cebc added norm_hhf(_tac);
wenzelm
parents: 10444
diff changeset
     1
(*  Title:      Pure/tactic.ML
89a29437cebc added norm_hhf(_tac);
wenzelm
parents: 10444
diff changeset
     2
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     3
29276
94b1ffec9201 qualified Term.rename_wrt_term;
wenzelm
parents: 27243
diff changeset
     4
Fundamental tactics.
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     5
*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     6
11774
3bc4f67d7fe1 qualify some names;
wenzelm
parents: 11768
diff changeset
     7
signature BASIC_TACTIC =
3bc4f67d7fe1 qualify some names;
wenzelm
parents: 11768
diff changeset
     8
sig
23223
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
     9
  val trace_goalno_tac: (int -> tactic) -> int -> tactic
36546
a9873318fe30 proper context for rule_by_tactic;
wenzelm
parents: 36354
diff changeset
    10
  val rule_by_tactic: Proof.context -> tactic -> thm -> thm
23223
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    11
  val assume_tac: int -> tactic
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    12
  val eq_assume_tac: int -> tactic
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    13
  val compose_tac: (bool * thm * int) -> int -> tactic
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    14
  val make_elim: thm -> thm
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    15
  val biresolve_tac: (bool * thm) list -> int -> tactic
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    16
  val resolve_tac: thm list -> int -> tactic
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    17
  val eresolve_tac: thm list -> int -> tactic
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    18
  val forward_tac: thm list -> int -> tactic
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    19
  val dresolve_tac: thm list -> int -> tactic
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    20
  val atac: int -> tactic
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    21
  val rtac: thm -> int -> tactic
31251
6ff48aa6142c tuned whitespace
haftmann
parents: 30558
diff changeset
    22
  val dtac: thm -> int -> tactic
6ff48aa6142c tuned whitespace
haftmann
parents: 30558
diff changeset
    23
  val etac: thm -> int -> tactic
6ff48aa6142c tuned whitespace
haftmann
parents: 30558
diff changeset
    24
  val ftac: thm -> int -> tactic
23223
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    25
  val ares_tac: thm list -> int -> tactic
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    26
  val solve_tac: thm list -> int -> tactic
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    27
  val bimatch_tac: (bool * thm) list -> int -> tactic
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    28
  val match_tac: thm list -> int -> tactic
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    29
  val ematch_tac: thm list -> int -> tactic
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    30
  val dmatch_tac: thm list -> int -> tactic
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    31
  val flexflex_tac: tactic
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    32
  val distinct_subgoal_tac: int -> tactic
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    33
  val distinct_subgoals_tac: tactic
46704
f800eb467515 simplified cut_tac (cf. d549b5b0f344);
wenzelm
parents: 46472
diff changeset
    34
  val cut_tac: thm -> int -> tactic
23223
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    35
  val cut_rules_tac: thm list -> int -> tactic
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    36
  val cut_facts_tac: thm list -> int -> tactic
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    37
  val filter_thms: (term * term -> bool) -> int * term * thm list -> thm list
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    38
  val biresolution_from_nets_tac: ('a list -> (bool * thm) list) ->
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    39
    bool -> 'a Net.net * 'a Net.net -> int -> tactic
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    40
  val biresolve_from_nets_tac: (int * (bool * thm)) Net.net * (int * (bool * thm)) Net.net ->
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    41
    int -> tactic
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    42
  val bimatch_from_nets_tac: (int * (bool * thm)) Net.net * (int * (bool * thm)) Net.net ->
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    43
    int -> tactic
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    44
  val net_biresolve_tac: (bool * thm) list -> int -> tactic
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    45
  val net_bimatch_tac: (bool * thm) list -> int -> tactic
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    46
  val filt_resolve_tac: thm list -> int -> int -> tactic
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    47
  val resolve_from_net_tac: (int * thm) Net.net -> int -> tactic
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    48
  val match_from_net_tac: (int * thm) Net.net -> int -> tactic
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    49
  val net_resolve_tac: thm list -> int -> tactic
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    50
  val net_match_tac: thm list -> int -> tactic
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    51
  val subgoals_of_brl: bool * thm -> int
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    52
  val lessb: (bool * thm) * (bool * thm) -> bool
27243
d549b5b0f344 removed obsolete global instantiation tactics (cf. Isar/rule_insts.ML);
wenzelm
parents: 27209
diff changeset
    53
  val rename_tac: string list -> int -> tactic
23223
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    54
  val rotate_tac: int -> int -> tactic
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    55
  val defer_tac: int -> tactic
49865
eeaf1ec7eac2 clarified defer/prefer: more specific errors;
wenzelm
parents: 46704
diff changeset
    56
  val prefer_tac: int -> tactic
23223
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    57
  val filter_prems_tac: (term -> bool) -> int -> tactic
11774
3bc4f67d7fe1 qualify some names;
wenzelm
parents: 11768
diff changeset
    58
end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    59
11774
3bc4f67d7fe1 qualify some names;
wenzelm
parents: 11768
diff changeset
    60
signature TACTIC =
3bc4f67d7fe1 qualify some names;
wenzelm
parents: 11768
diff changeset
    61
sig
3bc4f67d7fe1 qualify some names;
wenzelm
parents: 11768
diff changeset
    62
  include BASIC_TACTIC
23223
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    63
  val insert_tagged_brl: 'a * (bool * thm) ->
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    64
    ('a * (bool * thm)) Net.net * ('a * (bool * thm)) Net.net ->
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    65
      ('a * (bool * thm)) Net.net * ('a * (bool * thm)) Net.net
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    66
  val build_netpair: (int * (bool * thm)) Net.net * (int * (bool * thm)) Net.net ->
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    67
    (bool * thm) list -> (int * (bool * thm)) Net.net * (int * (bool * thm)) Net.net
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    68
  val delete_tagged_brl: bool * thm ->
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    69
    ('a * (bool * thm)) Net.net * ('a * (bool * thm)) Net.net ->
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    70
      ('a * (bool * thm)) Net.net * ('a * (bool * thm)) Net.net
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
    71
  val eq_kbrl: ('a * (bool * thm)) * ('a * (bool * thm)) -> bool
32971
55ba9b6648ef less pervasive names;
wenzelm
parents: 31945
diff changeset
    72
  val build_net: thm list -> (int * thm) Net.net
11774
3bc4f67d7fe1 qualify some names;
wenzelm
parents: 11768
diff changeset
    73
end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    74
11774
3bc4f67d7fe1 qualify some names;
wenzelm
parents: 11768
diff changeset
    75
structure Tactic: TACTIC =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    76
struct
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    77
1501
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
    78
(*Discover which goal is chosen:  SOMEGOAL(trace_goalno_tac tac) *)
10817
083d4a6734b4 tuned norm_hhf(_tac);
wenzelm
parents: 10805
diff changeset
    79
fun trace_goalno_tac tac i st =
4270
957c887b89b5 changed Sequence interface (now Seq, in seq.ML);
wenzelm
parents: 4213
diff changeset
    80
    case Seq.pull(tac i st) of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15464
diff changeset
    81
        NONE    => Seq.empty
12262
11ff5f47df6e use tracing function for trace output;
wenzelm
parents: 12212
diff changeset
    82
      | seqcell => (tracing ("Subgoal " ^ string_of_int i ^ " selected");
10805
89a29437cebc added norm_hhf(_tac);
wenzelm
parents: 10444
diff changeset
    83
                         Seq.make(fn()=> seqcell));
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    84
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    85
(*Makes a rule by applying a tactic to an existing rule*)
36546
a9873318fe30 proper context for rule_by_tactic;
wenzelm
parents: 36354
diff changeset
    86
fun rule_by_tactic ctxt tac rl =
19925
3f9341831812 eliminated freeze/varify in favour of Variable.import/export/trade;
wenzelm
parents: 19743
diff changeset
    87
  let
36546
a9873318fe30 proper context for rule_by_tactic;
wenzelm
parents: 36354
diff changeset
    88
    val ctxt' = Variable.declare_thm rl ctxt;
a9873318fe30 proper context for rule_by_tactic;
wenzelm
parents: 36354
diff changeset
    89
    val ((_, [st]), ctxt'') = Variable.import true [rl] ctxt';
19925
3f9341831812 eliminated freeze/varify in favour of Variable.import/export/trade;
wenzelm
parents: 19743
diff changeset
    90
  in
3f9341831812 eliminated freeze/varify in favour of Variable.import/export/trade;
wenzelm
parents: 19743
diff changeset
    91
    (case Seq.pull (tac st) of
3f9341831812 eliminated freeze/varify in favour of Variable.import/export/trade;
wenzelm
parents: 19743
diff changeset
    92
      NONE => raise THM ("rule_by_tactic", 0, [rl])
36546
a9873318fe30 proper context for rule_by_tactic;
wenzelm
parents: 36354
diff changeset
    93
    | SOME (st', _) => zero_var_indexes (singleton (Variable.export ctxt'' ctxt') st'))
2688
889a1cbd1aca rule_by_tactic no longer standardizes its result
paulson
parents: 2672
diff changeset
    94
  end;
10817
083d4a6734b4 tuned norm_hhf(_tac);
wenzelm
parents: 10805
diff changeset
    95
19925
3f9341831812 eliminated freeze/varify in favour of Variable.import/export/trade;
wenzelm
parents: 19743
diff changeset
    96
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    97
(*** Basic tactics ***)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    98
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    99
(*** The following fail if the goal number is out of range:
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   100
     thus (REPEAT (resolve_tac rules i)) stops once subgoal i disappears. *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   101
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   102
(*Solve subgoal i by assumption*)
31945
d5f186aa0bed structure Thm: less pervasive names;
wenzelm
parents: 31794
diff changeset
   103
fun assume_tac i = PRIMSEQ (Thm.assumption i);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   104
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   105
(*Solve subgoal i by assumption, using no unification*)
31945
d5f186aa0bed structure Thm: less pervasive names;
wenzelm
parents: 31794
diff changeset
   106
fun eq_assume_tac i = PRIMITIVE (Thm.eq_assumption i);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   107
23223
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
   108
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   109
(** Resolution/matching tactics **)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   110
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   111
(*The composition rule/state: no lifting or var renaming.
31945
d5f186aa0bed structure Thm: less pervasive names;
wenzelm
parents: 31794
diff changeset
   112
  The arg = (bires_flg, orule, m);  see Thm.bicompose for explanation.*)
d5f186aa0bed structure Thm: less pervasive names;
wenzelm
parents: 31794
diff changeset
   113
fun compose_tac arg i = PRIMSEQ (Thm.bicompose false arg i);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   114
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   115
(*Converts a "destruct" rule like P&Q==>P to an "elimination" rule
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   116
  like [| P&Q; P==>R |] ==> R *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   117
fun make_elim rl = zero_var_indexes (rl RS revcut_rl);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   118
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   119
(*Attack subgoal i by resolution, using flags to indicate elimination rules*)
31945
d5f186aa0bed structure Thm: less pervasive names;
wenzelm
parents: 31794
diff changeset
   120
fun biresolve_tac brules i = PRIMSEQ (Thm.biresolution false brules i);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   121
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   122
(*Resolution: the simple case, works for introduction rules*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   123
fun resolve_tac rules = biresolve_tac (map (pair false) rules);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   124
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   125
(*Resolution with elimination rules only*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   126
fun eresolve_tac rules = biresolve_tac (map (pair true) rules);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   127
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   128
(*Forward reasoning using destruction rules.*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   129
fun forward_tac rls = resolve_tac (map make_elim rls) THEN' assume_tac;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   130
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   131
(*Like forward_tac, but deletes the assumption after use.*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   132
fun dresolve_tac rls = eresolve_tac (map make_elim rls);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   133
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   134
(*Shorthand versions: for resolution with a single theorem*)
7491
95a4af0e10a7 added ftac, eatac, datac, fatac
oheimb
parents: 7248
diff changeset
   135
val atac    =   assume_tac;
95a4af0e10a7 added ftac, eatac, datac, fatac
oheimb
parents: 7248
diff changeset
   136
fun rtac rl =  resolve_tac [rl];
95a4af0e10a7 added ftac, eatac, datac, fatac
oheimb
parents: 7248
diff changeset
   137
fun dtac rl = dresolve_tac [rl];
1460
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   138
fun etac rl = eresolve_tac [rl];
7491
95a4af0e10a7 added ftac, eatac, datac, fatac
oheimb
parents: 7248
diff changeset
   139
fun ftac rl =  forward_tac [rl];
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   140
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   141
(*Use an assumption or some rules ... A popular combination!*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   142
fun ares_tac rules = assume_tac  ORELSE'  resolve_tac rules;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   143
5263
8862ed2db431 added solve_tac;
wenzelm
parents: 4713
diff changeset
   144
fun solve_tac rules = resolve_tac rules THEN_ALL_NEW assume_tac;
8862ed2db431 added solve_tac;
wenzelm
parents: 4713
diff changeset
   145
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   146
(*Matching tactics -- as above, but forbid updating of state*)
31945
d5f186aa0bed structure Thm: less pervasive names;
wenzelm
parents: 31794
diff changeset
   147
fun bimatch_tac brules i = PRIMSEQ (Thm.biresolution true brules i);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   148
fun match_tac rules  = bimatch_tac (map (pair false) rules);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   149
fun ematch_tac rules = bimatch_tac (map (pair true) rules);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   150
fun dmatch_tac rls   = ematch_tac (map make_elim rls);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   151
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   152
(*Smash all flex-flex disagreement pairs in the proof state.*)
36944
dbf831a50e4a less pervasive names from structure Thm;
wenzelm
parents: 36546
diff changeset
   153
val flexflex_tac = PRIMSEQ Thm.flexflex_rule;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   154
19056
6ac9dfe98e54 sane version of distinct_subgoals_tac, based on composition with Drule.distinct_prems_rl;
wenzelm
parents: 18977
diff changeset
   155
(*Remove duplicate subgoals.*)
50081
wenzelm
parents: 49865
diff changeset
   156
val permute_tac = PRIMITIVE oo Thm.permute_prems;
22560
f19ddf96c323 now exports distinct_subgoal_tac (needed by MetisAPI)
paulson
parents: 22360
diff changeset
   157
fun distinct_tac (i, k) =
50081
wenzelm
parents: 49865
diff changeset
   158
  permute_tac 0 (i - 1) THEN
wenzelm
parents: 49865
diff changeset
   159
  permute_tac 1 (k - 1) THEN
22560
f19ddf96c323 now exports distinct_subgoal_tac (needed by MetisAPI)
paulson
parents: 22360
diff changeset
   160
  DETERM (PRIMSEQ (fn st =>
f19ddf96c323 now exports distinct_subgoal_tac (needed by MetisAPI)
paulson
parents: 22360
diff changeset
   161
    Thm.compose_no_flatten false (st, 0) 1
f19ddf96c323 now exports distinct_subgoal_tac (needed by MetisAPI)
paulson
parents: 22360
diff changeset
   162
      (Drule.incr_indexes st Drule.distinct_prems_rl))) THEN
50081
wenzelm
parents: 49865
diff changeset
   163
  permute_tac 1 (1 - k) THEN
wenzelm
parents: 49865
diff changeset
   164
  permute_tac 0 (1 - i);
22560
f19ddf96c323 now exports distinct_subgoal_tac (needed by MetisAPI)
paulson
parents: 22360
diff changeset
   165
f19ddf96c323 now exports distinct_subgoal_tac (needed by MetisAPI)
paulson
parents: 22360
diff changeset
   166
fun distinct_subgoal_tac i st =
33957
e9afca2118d4 normalized uncurry take/drop
haftmann
parents: 33955
diff changeset
   167
  (case drop (i - 1) (Thm.prems_of st) of
22560
f19ddf96c323 now exports distinct_subgoal_tac (needed by MetisAPI)
paulson
parents: 22360
diff changeset
   168
    [] => no_tac st
f19ddf96c323 now exports distinct_subgoal_tac (needed by MetisAPI)
paulson
parents: 22360
diff changeset
   169
  | A :: Bs =>
f19ddf96c323 now exports distinct_subgoal_tac (needed by MetisAPI)
paulson
parents: 22360
diff changeset
   170
      st |> EVERY (fold (fn (B, k) =>
23223
7791128b39a9 cleaned up signature;
wenzelm
parents: 23178
diff changeset
   171
        if A aconv B then cons (distinct_tac (i, k)) else I) (Bs ~~ (1 upto length Bs)) []));
22560
f19ddf96c323 now exports distinct_subgoal_tac (needed by MetisAPI)
paulson
parents: 22360
diff changeset
   172
10817
083d4a6734b4 tuned norm_hhf(_tac);
wenzelm
parents: 10805
diff changeset
   173
fun distinct_subgoals_tac state =
19056
6ac9dfe98e54 sane version of distinct_subgoals_tac, based on composition with Drule.distinct_prems_rl;
wenzelm
parents: 18977
diff changeset
   174
  let
6ac9dfe98e54 sane version of distinct_subgoals_tac, based on composition with Drule.distinct_prems_rl;
wenzelm
parents: 18977
diff changeset
   175
    val goals = Thm.prems_of state;
6ac9dfe98e54 sane version of distinct_subgoals_tac, based on composition with Drule.distinct_prems_rl;
wenzelm
parents: 18977
diff changeset
   176
    val dups = distinct (eq_fst (op aconv)) (goals ~~ (1 upto length goals));
6ac9dfe98e54 sane version of distinct_subgoals_tac, based on composition with Drule.distinct_prems_rl;
wenzelm
parents: 18977
diff changeset
   177
  in EVERY (rev (map (distinct_subgoal_tac o snd) dups)) state end;
3409
c0466958df5d Tidying of signature. More robust renaming in freeze_thaw.
paulson
parents: 2814
diff changeset
   178
1951
f2b8005bdc6e Declared thin_tac
paulson
parents: 1801
diff changeset
   179
270
d506ea00c825 tactic/make_elim_preserve: recoded to avoid using lift_inst_rule. Instead
lcp
parents: 230
diff changeset
   180
(*** Applications of cut_rl ***)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   181
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   182
(*The conclusion of the rule gets assumed in subgoal i,
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   183
  while subgoal i+1,... are the premises of the rule.*)
46704
f800eb467515 simplified cut_tac (cf. d549b5b0f344);
wenzelm
parents: 46472
diff changeset
   184
fun cut_tac rule i = rtac cut_rl i THEN rtac rule (i + 1);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   185
13650
31bd2a8cdbe2 fixing the cut_tac method to work when there are no instantiations and the
paulson
parents: 13559
diff changeset
   186
(*"Cut" a list of rules into the goal.  Their premises will become new
31bd2a8cdbe2 fixing the cut_tac method to work when there are no instantiations and the
paulson
parents: 13559
diff changeset
   187
  subgoals.*)
46704
f800eb467515 simplified cut_tac (cf. d549b5b0f344);
wenzelm
parents: 46472
diff changeset
   188
fun cut_rules_tac ths i = EVERY (map (fn th => cut_tac th i) ths);
13650
31bd2a8cdbe2 fixing the cut_tac method to work when there are no instantiations and the
paulson
parents: 13559
diff changeset
   189
31bd2a8cdbe2 fixing the cut_tac method to work when there are no instantiations and the
paulson
parents: 13559
diff changeset
   190
(*As above, but inserts only facts (unconditional theorems);
31bd2a8cdbe2 fixing the cut_tac method to work when there are no instantiations and the
paulson
parents: 13559
diff changeset
   191
  generates no additional subgoals. *)
20232
31998a8c7f25 removed obsolete is_fact (cf. Thm.no_prems);
wenzelm
parents: 20218
diff changeset
   192
fun cut_facts_tac ths = cut_rules_tac (filter Thm.no_prems ths);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   193
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   194
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   195
(**** Indexing and filtering of theorems ****)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   196
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   197
(*Returns the list of potentially resolvable theorems for the goal "prem",
10805
89a29437cebc added norm_hhf(_tac);
wenzelm
parents: 10444
diff changeset
   198
        using the predicate  could(subgoal,concl).
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   199
  Resulting list is no longer than "limit"*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   200
fun filter_thms could (limit, prem, ths) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   201
  let val pb = Logic.strip_assums_concl prem;   (*delete assumptions*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   202
      fun filtr (limit, []) = []
10805
89a29437cebc added norm_hhf(_tac);
wenzelm
parents: 10444
diff changeset
   203
        | filtr (limit, th::ths) =
89a29437cebc added norm_hhf(_tac);
wenzelm
parents: 10444
diff changeset
   204
            if limit=0 then  []
89a29437cebc added norm_hhf(_tac);
wenzelm
parents: 10444
diff changeset
   205
            else if could(pb, concl_of th)  then th :: filtr(limit-1, ths)
89a29437cebc added norm_hhf(_tac);
wenzelm
parents: 10444
diff changeset
   206
            else filtr(limit,ths)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   207
  in  filtr(limit,ths)  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   208
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   209
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   210
(*** biresolution and resolution using nets ***)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   211
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   212
(** To preserve the order of the rules, tag them with increasing integers **)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   213
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   214
(*insert one tagged brl into the pair of nets*)
23178
07ba6b58b3d2 simplified/unified list fold;
wenzelm
parents: 22583
diff changeset
   215
fun insert_tagged_brl (kbrl as (k, (eres, th))) (inet, enet) =
12320
6e70d870ddf0 general type of delete_tagged_brl;
wenzelm
parents: 12262
diff changeset
   216
  if eres then
6e70d870ddf0 general type of delete_tagged_brl;
wenzelm
parents: 12262
diff changeset
   217
    (case try Thm.major_prem_of th of
16809
8ca51a846576 export eq_brl;
wenzelm
parents: 16666
diff changeset
   218
      SOME prem => (inet, Net.insert_term (K false) (prem, kbrl) enet)
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15464
diff changeset
   219
    | NONE => error "insert_tagged_brl: elimination rule with no premises")
16809
8ca51a846576 export eq_brl;
wenzelm
parents: 16666
diff changeset
   220
  else (Net.insert_term (K false) (concl_of th, kbrl) inet, enet);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   221
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   222
(*build a pair of nets for biresolution*)
10817
083d4a6734b4 tuned norm_hhf(_tac);
wenzelm
parents: 10805
diff changeset
   223
fun build_netpair netpair brls =
30558
2ef9892114fd renamed Tactic.taglist/untaglist/orderlist to tag_list/untag_list/order_list (in library.ML);
wenzelm
parents: 29276
diff changeset
   224
    fold_rev insert_tagged_brl (tag_list 1 brls) netpair;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   225
12320
6e70d870ddf0 general type of delete_tagged_brl;
wenzelm
parents: 12262
diff changeset
   226
(*delete one kbrl from the pair of nets*)
22360
26ead7ed4f4b moved eq_thm etc. to structure Thm in Pure/more_thm.ML;
wenzelm
parents: 21708
diff changeset
   227
fun eq_kbrl ((_, (_, th)), (_, (_, th'))) = Thm.eq_thm_prop (th, th')
16809
8ca51a846576 export eq_brl;
wenzelm
parents: 16666
diff changeset
   228
23178
07ba6b58b3d2 simplified/unified list fold;
wenzelm
parents: 22583
diff changeset
   229
fun delete_tagged_brl (brl as (eres, th)) (inet, enet) =
13925
761af5c2fd59 catches exception DELETE
paulson
parents: 13650
diff changeset
   230
  (if eres then
12320
6e70d870ddf0 general type of delete_tagged_brl;
wenzelm
parents: 12262
diff changeset
   231
    (case try Thm.major_prem_of th of
16809
8ca51a846576 export eq_brl;
wenzelm
parents: 16666
diff changeset
   232
      SOME prem => (inet, Net.delete_term eq_kbrl (prem, ((), brl)) enet)
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15464
diff changeset
   233
    | NONE => (inet, enet))  (*no major premise: ignore*)
16809
8ca51a846576 export eq_brl;
wenzelm
parents: 16666
diff changeset
   234
  else (Net.delete_term eq_kbrl (Thm.concl_of th, ((), brl)) inet, enet))
13925
761af5c2fd59 catches exception DELETE
paulson
parents: 13650
diff changeset
   235
  handle Net.DELETE => (inet,enet);
1801
927a31ba4346 Added delete function for brls
paulson
parents: 1501
diff changeset
   236
927a31ba4346 Added delete function for brls
paulson
parents: 1501
diff changeset
   237
10817
083d4a6734b4 tuned norm_hhf(_tac);
wenzelm
parents: 10805
diff changeset
   238
(*biresolution using a pair of nets rather than rules.
3706
e57b5902822f Generalized and exported biresolution_from_nets_tac to allow the declaration
paulson
parents: 3575
diff changeset
   239
    function "order" must sort and possibly filter the list of brls.
e57b5902822f Generalized and exported biresolution_from_nets_tac to allow the declaration
paulson
parents: 3575
diff changeset
   240
    boolean "match" indicates matching or unification.*)
e57b5902822f Generalized and exported biresolution_from_nets_tac to allow the declaration
paulson
parents: 3575
diff changeset
   241
fun biresolution_from_nets_tac order match (inet,enet) =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   242
  SUBGOAL
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   243
    (fn (prem,i) =>
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   244
      let val hyps = Logic.strip_assums_hyp prem
10817
083d4a6734b4 tuned norm_hhf(_tac);
wenzelm
parents: 10805
diff changeset
   245
          and concl = Logic.strip_assums_concl prem
19482
9f11af8f7ef9 tuned basic list operators (flat, maps, map_filter);
wenzelm
parents: 19473
diff changeset
   246
          val kbrls = Net.unify_term inet concl @ maps (Net.unify_term enet) hyps
31945
d5f186aa0bed structure Thm: less pervasive names;
wenzelm
parents: 31794
diff changeset
   247
      in PRIMSEQ (Thm.biresolution match (order kbrls) i) end);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   248
3706
e57b5902822f Generalized and exported biresolution_from_nets_tac to allow the declaration
paulson
parents: 3575
diff changeset
   249
(*versions taking pre-built nets.  No filtering of brls*)
30558
2ef9892114fd renamed Tactic.taglist/untaglist/orderlist to tag_list/untag_list/order_list (in library.ML);
wenzelm
parents: 29276
diff changeset
   250
val biresolve_from_nets_tac = biresolution_from_nets_tac order_list false;
2ef9892114fd renamed Tactic.taglist/untaglist/orderlist to tag_list/untag_list/order_list (in library.ML);
wenzelm
parents: 29276
diff changeset
   251
val bimatch_from_nets_tac   = biresolution_from_nets_tac order_list true;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   252
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   253
(*fast versions using nets internally*)
670
ff4c6691de9d Pure/tactic/build_netpair: now takes two arguments
lcp
parents: 439
diff changeset
   254
val net_biresolve_tac =
ff4c6691de9d Pure/tactic/build_netpair: now takes two arguments
lcp
parents: 439
diff changeset
   255
    biresolve_from_nets_tac o build_netpair(Net.empty,Net.empty);
ff4c6691de9d Pure/tactic/build_netpair: now takes two arguments
lcp
parents: 439
diff changeset
   256
ff4c6691de9d Pure/tactic/build_netpair: now takes two arguments
lcp
parents: 439
diff changeset
   257
val net_bimatch_tac =
ff4c6691de9d Pure/tactic/build_netpair: now takes two arguments
lcp
parents: 439
diff changeset
   258
    bimatch_from_nets_tac o build_netpair(Net.empty,Net.empty);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   259
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   260
(*** Simpler version for resolve_tac -- only one net, and no hyps ***)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   261
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   262
(*insert one tagged rl into the net*)
23178
07ba6b58b3d2 simplified/unified list fold;
wenzelm
parents: 22583
diff changeset
   263
fun insert_krl (krl as (k,th)) =
07ba6b58b3d2 simplified/unified list fold;
wenzelm
parents: 22583
diff changeset
   264
  Net.insert_term (K false) (concl_of th, krl);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   265
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   266
(*build a net of rules for resolution*)
10817
083d4a6734b4 tuned norm_hhf(_tac);
wenzelm
parents: 10805
diff changeset
   267
fun build_net rls =
30558
2ef9892114fd renamed Tactic.taglist/untaglist/orderlist to tag_list/untag_list/order_list (in library.ML);
wenzelm
parents: 29276
diff changeset
   268
  fold_rev insert_krl (tag_list 1 rls) Net.empty;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   269
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   270
(*resolution using a net rather than rules; pred supports filt_resolve_tac*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   271
fun filt_resolution_from_net_tac match pred net =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   272
  SUBGOAL
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   273
    (fn (prem,i) =>
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   274
      let val krls = Net.unify_term net (Logic.strip_assums_concl prem)
10817
083d4a6734b4 tuned norm_hhf(_tac);
wenzelm
parents: 10805
diff changeset
   275
      in
083d4a6734b4 tuned norm_hhf(_tac);
wenzelm
parents: 10805
diff changeset
   276
         if pred krls
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   277
         then PRIMSEQ
31945
d5f186aa0bed structure Thm: less pervasive names;
wenzelm
parents: 31794
diff changeset
   278
                (Thm.biresolution match (map (pair false) (order_list krls)) i)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   279
         else no_tac
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   280
      end);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   281
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   282
(*Resolve the subgoal using the rules (making a net) unless too flexible,
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   283
   which means more than maxr rules are unifiable.      *)
10817
083d4a6734b4 tuned norm_hhf(_tac);
wenzelm
parents: 10805
diff changeset
   284
fun filt_resolve_tac rules maxr =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   285
    let fun pred krls = length krls <= maxr
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   286
    in  filt_resolution_from_net_tac false pred (build_net rules)  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   287
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   288
(*versions taking pre-built nets*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   289
val resolve_from_net_tac = filt_resolution_from_net_tac false (K true);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   290
val match_from_net_tac = filt_resolution_from_net_tac true (K true);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   291
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   292
(*fast versions using nets internally*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   293
val net_resolve_tac = resolve_from_net_tac o build_net;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   294
val net_match_tac = match_from_net_tac o build_net;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   295
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   296
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   297
(*** For Natural Deduction using (bires_flg, rule) pairs ***)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   298
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   299
(*The number of new subgoals produced by the brule*)
1077
c2df11ae8b55 Renamed insert_kbrl to insert_tagged_brl and exported it. Now
lcp
parents: 952
diff changeset
   300
fun subgoals_of_brl (true,rule)  = nprems_of rule - 1
c2df11ae8b55 Renamed insert_kbrl to insert_tagged_brl and exported it. Now
lcp
parents: 952
diff changeset
   301
  | subgoals_of_brl (false,rule) = nprems_of rule;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   302
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   303
(*Less-than test: for sorting to minimize number of new subgoals*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   304
fun lessb (brl1,brl2) = subgoals_of_brl brl1 < subgoals_of_brl brl2;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   305
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   306
27243
d549b5b0f344 removed obsolete global instantiation tactics (cf. Isar/rule_insts.ML);
wenzelm
parents: 27209
diff changeset
   307
(*Renaming of parameters in a subgoal*)
d549b5b0f344 removed obsolete global instantiation tactics (cf. Isar/rule_insts.ML);
wenzelm
parents: 27209
diff changeset
   308
fun rename_tac xs i =
42290
b1f544c84040 discontinued special treatment of structure Lexicon;
wenzelm
parents: 36944
diff changeset
   309
  case Library.find_first (not o Lexicon.is_identifier) xs of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15464
diff changeset
   310
      SOME x => error ("Not an identifier: " ^ x)
31945
d5f186aa0bed structure Thm: less pervasive names;
wenzelm
parents: 31794
diff changeset
   311
    | NONE => PRIMITIVE (Thm.rename_params_rule (xs, i));
9535
a60b0be5ee96 added rename_params_tac;
wenzelm
parents: 8977
diff changeset
   312
1501
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
   313
(*rotate_tac n i: rotate the assumptions of subgoal i by n positions, from
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
   314
  right to left if n is positive, and from left to right if n is negative.*)
2672
85d7e800d754 Replaced "flat" by the Basis Library function List.concat
paulson
parents: 2580
diff changeset
   315
fun rotate_tac 0 i = all_tac
31945
d5f186aa0bed structure Thm: less pervasive names;
wenzelm
parents: 31794
diff changeset
   316
  | rotate_tac k i = PRIMITIVE (Thm.rotate_rule k i);
1209
03dc596b3a18 added rotate_tac.
nipkow
parents: 1077
diff changeset
   317
7248
322151fe6f02 new primitive rule permute_prems to underlie defer_tac and rotate_prems
paulson
parents: 6979
diff changeset
   318
(*Rotates the given subgoal to be the last.*)
31945
d5f186aa0bed structure Thm: less pervasive names;
wenzelm
parents: 31794
diff changeset
   319
fun defer_tac i = PRIMITIVE (Thm.permute_prems (i - 1) 1);
7248
322151fe6f02 new primitive rule permute_prems to underlie defer_tac and rotate_prems
paulson
parents: 6979
diff changeset
   320
49865
eeaf1ec7eac2 clarified defer/prefer: more specific errors;
wenzelm
parents: 46704
diff changeset
   321
(*Rotates the given subgoal to be the first.*)
eeaf1ec7eac2 clarified defer/prefer: more specific errors;
wenzelm
parents: 46704
diff changeset
   322
fun prefer_tac i = PRIMITIVE (Thm.permute_prems (i - 1) 1 #> Thm.permute_prems 0 ~1);
eeaf1ec7eac2 clarified defer/prefer: more specific errors;
wenzelm
parents: 46704
diff changeset
   323
5974
6acf3ff0f486 Added filter_prems_tac
nipkow
parents: 5956
diff changeset
   324
(* remove premises that do not satisfy p; fails if all prems satisfy p *)
6acf3ff0f486 Added filter_prems_tac
nipkow
parents: 5956
diff changeset
   325
fun filter_prems_tac p =
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15464
diff changeset
   326
  let fun Then NONE tac = SOME tac
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15464
diff changeset
   327
        | Then (SOME tac) tac' = SOME(tac THEN' tac');
19473
wenzelm
parents: 19423
diff changeset
   328
      fun thins H (tac,n) =
5974
6acf3ff0f486 Added filter_prems_tac
nipkow
parents: 5956
diff changeset
   329
        if p H then (tac,n+1)
6acf3ff0f486 Added filter_prems_tac
nipkow
parents: 5956
diff changeset
   330
        else (Then tac (rotate_tac n THEN' etac thin_rl),0);
6acf3ff0f486 Added filter_prems_tac
nipkow
parents: 5956
diff changeset
   331
  in SUBGOAL(fn (subg,n) =>
6acf3ff0f486 Added filter_prems_tac
nipkow
parents: 5956
diff changeset
   332
       let val Hs = Logic.strip_assums_hyp subg
19473
wenzelm
parents: 19423
diff changeset
   333
       in case fst(fold thins Hs (NONE,0)) of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15464
diff changeset
   334
            NONE => no_tac | SOME tac => tac n
5974
6acf3ff0f486 Added filter_prems_tac
nipkow
parents: 5956
diff changeset
   335
       end)
6acf3ff0f486 Added filter_prems_tac
nipkow
parents: 5956
diff changeset
   336
  end;
6acf3ff0f486 Added filter_prems_tac
nipkow
parents: 5956
diff changeset
   337
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   338
end;
1501
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
   339
32971
55ba9b6648ef less pervasive names;
wenzelm
parents: 31945
diff changeset
   340
structure Basic_Tactic: BASIC_TACTIC = Tactic;
55ba9b6648ef less pervasive names;
wenzelm
parents: 31945
diff changeset
   341
open Basic_Tactic;