src/Pure/tactic.ML
author wenzelm
Thu Sep 02 00:48:07 2010 +0200 (2010-09-02)
changeset 38980 af73cf0dc31f
parent 36944 dbf831a50e4a
child 42290 b1f544c84040
permissions -rw-r--r--
turned show_question_marks into proper configuration option;
show_question_marks only affects regular type/term pretty printing, not raw Term.string_of_vname;
tuned;
wenzelm@10805
     1
(*  Title:      Pure/tactic.ML
wenzelm@10805
     2
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
clasohm@0
     3
wenzelm@29276
     4
Fundamental tactics.
clasohm@0
     5
*)
clasohm@0
     6
wenzelm@11774
     7
signature BASIC_TACTIC =
wenzelm@11774
     8
sig
wenzelm@23223
     9
  val trace_goalno_tac: (int -> tactic) -> int -> tactic
wenzelm@36546
    10
  val rule_by_tactic: Proof.context -> tactic -> thm -> thm
wenzelm@23223
    11
  val assume_tac: int -> tactic
wenzelm@23223
    12
  val eq_assume_tac: int -> tactic
wenzelm@23223
    13
  val compose_tac: (bool * thm * int) -> int -> tactic
wenzelm@23223
    14
  val make_elim: thm -> thm
wenzelm@23223
    15
  val biresolve_tac: (bool * thm) list -> int -> tactic
wenzelm@23223
    16
  val resolve_tac: thm list -> int -> tactic
wenzelm@23223
    17
  val eresolve_tac: thm list -> int -> tactic
wenzelm@23223
    18
  val forward_tac: thm list -> int -> tactic
wenzelm@23223
    19
  val dresolve_tac: thm list -> int -> tactic
wenzelm@23223
    20
  val atac: int -> tactic
wenzelm@23223
    21
  val rtac: thm -> int -> tactic
haftmann@31251
    22
  val dtac: thm -> int -> tactic
haftmann@31251
    23
  val etac: thm -> int -> tactic
haftmann@31251
    24
  val ftac: thm -> int -> tactic
wenzelm@23223
    25
  val datac: thm -> int -> int -> tactic
wenzelm@23223
    26
  val eatac: thm -> int -> int -> tactic
wenzelm@23223
    27
  val fatac: thm -> int -> int -> tactic
wenzelm@23223
    28
  val ares_tac: thm list -> int -> tactic
wenzelm@23223
    29
  val solve_tac: thm list -> int -> tactic
wenzelm@23223
    30
  val bimatch_tac: (bool * thm) list -> int -> tactic
wenzelm@23223
    31
  val match_tac: thm list -> int -> tactic
wenzelm@23223
    32
  val ematch_tac: thm list -> int -> tactic
wenzelm@23223
    33
  val dmatch_tac: thm list -> int -> tactic
wenzelm@23223
    34
  val flexflex_tac: tactic
wenzelm@23223
    35
  val distinct_subgoal_tac: int -> tactic
wenzelm@23223
    36
  val distinct_subgoals_tac: tactic
wenzelm@23223
    37
  val metacut_tac: thm -> int -> tactic
wenzelm@23223
    38
  val cut_rules_tac: thm list -> int -> tactic
wenzelm@23223
    39
  val cut_facts_tac: thm list -> int -> tactic
wenzelm@23223
    40
  val filter_thms: (term * term -> bool) -> int * term * thm list -> thm list
wenzelm@23223
    41
  val biresolution_from_nets_tac: ('a list -> (bool * thm) list) ->
wenzelm@23223
    42
    bool -> 'a Net.net * 'a Net.net -> int -> tactic
wenzelm@23223
    43
  val biresolve_from_nets_tac: (int * (bool * thm)) Net.net * (int * (bool * thm)) Net.net ->
wenzelm@23223
    44
    int -> tactic
wenzelm@23223
    45
  val bimatch_from_nets_tac: (int * (bool * thm)) Net.net * (int * (bool * thm)) Net.net ->
wenzelm@23223
    46
    int -> tactic
wenzelm@23223
    47
  val net_biresolve_tac: (bool * thm) list -> int -> tactic
wenzelm@23223
    48
  val net_bimatch_tac: (bool * thm) list -> int -> tactic
wenzelm@23223
    49
  val filt_resolve_tac: thm list -> int -> int -> tactic
wenzelm@23223
    50
  val resolve_from_net_tac: (int * thm) Net.net -> int -> tactic
wenzelm@23223
    51
  val match_from_net_tac: (int * thm) Net.net -> int -> tactic
wenzelm@23223
    52
  val net_resolve_tac: thm list -> int -> tactic
wenzelm@23223
    53
  val net_match_tac: thm list -> int -> tactic
wenzelm@23223
    54
  val subgoals_of_brl: bool * thm -> int
wenzelm@23223
    55
  val lessb: (bool * thm) * (bool * thm) -> bool
wenzelm@27243
    56
  val rename_tac: string list -> int -> tactic
wenzelm@23223
    57
  val rotate_tac: int -> int -> tactic
wenzelm@23223
    58
  val defer_tac: int -> tactic
wenzelm@23223
    59
  val filter_prems_tac: (term -> bool) -> int -> tactic
wenzelm@11774
    60
end;
clasohm@0
    61
wenzelm@11774
    62
signature TACTIC =
wenzelm@11774
    63
sig
wenzelm@11774
    64
  include BASIC_TACTIC
wenzelm@11929
    65
  val innermost_params: int -> thm -> (string * typ) list
wenzelm@23223
    66
  val insert_tagged_brl: 'a * (bool * thm) ->
wenzelm@23223
    67
    ('a * (bool * thm)) Net.net * ('a * (bool * thm)) Net.net ->
wenzelm@23223
    68
      ('a * (bool * thm)) Net.net * ('a * (bool * thm)) Net.net
wenzelm@23223
    69
  val build_netpair: (int * (bool * thm)) Net.net * (int * (bool * thm)) Net.net ->
wenzelm@23223
    70
    (bool * thm) list -> (int * (bool * thm)) Net.net * (int * (bool * thm)) Net.net
wenzelm@23223
    71
  val delete_tagged_brl: bool * thm ->
wenzelm@23223
    72
    ('a * (bool * thm)) Net.net * ('a * (bool * thm)) Net.net ->
wenzelm@23223
    73
      ('a * (bool * thm)) Net.net * ('a * (bool * thm)) Net.net
wenzelm@23223
    74
  val eq_kbrl: ('a * (bool * thm)) * ('a * (bool * thm)) -> bool
wenzelm@32971
    75
  val build_net: thm list -> (int * thm) Net.net
wenzelm@11774
    76
end;
clasohm@0
    77
wenzelm@11774
    78
structure Tactic: TACTIC =
clasohm@0
    79
struct
clasohm@0
    80
paulson@1501
    81
(*Discover which goal is chosen:  SOMEGOAL(trace_goalno_tac tac) *)
wenzelm@10817
    82
fun trace_goalno_tac tac i st =
wenzelm@4270
    83
    case Seq.pull(tac i st) of
skalberg@15531
    84
        NONE    => Seq.empty
wenzelm@12262
    85
      | seqcell => (tracing ("Subgoal " ^ string_of_int i ^ " selected");
wenzelm@10805
    86
                         Seq.make(fn()=> seqcell));
clasohm@0
    87
clasohm@0
    88
(*Makes a rule by applying a tactic to an existing rule*)
wenzelm@36546
    89
fun rule_by_tactic ctxt tac rl =
wenzelm@19925
    90
  let
wenzelm@36546
    91
    val ctxt' = Variable.declare_thm rl ctxt;
wenzelm@36546
    92
    val ((_, [st]), ctxt'') = Variable.import true [rl] ctxt';
wenzelm@19925
    93
  in
wenzelm@19925
    94
    (case Seq.pull (tac st) of
wenzelm@19925
    95
      NONE => raise THM ("rule_by_tactic", 0, [rl])
wenzelm@36546
    96
    | SOME (st', _) => zero_var_indexes (singleton (Variable.export ctxt'' ctxt') st'))
paulson@2688
    97
  end;
wenzelm@10817
    98
wenzelm@19925
    99
clasohm@0
   100
(*** Basic tactics ***)
clasohm@0
   101
clasohm@0
   102
(*** The following fail if the goal number is out of range:
clasohm@0
   103
     thus (REPEAT (resolve_tac rules i)) stops once subgoal i disappears. *)
clasohm@0
   104
clasohm@0
   105
(*Solve subgoal i by assumption*)
wenzelm@31945
   106
fun assume_tac i = PRIMSEQ (Thm.assumption i);
clasohm@0
   107
clasohm@0
   108
(*Solve subgoal i by assumption, using no unification*)
wenzelm@31945
   109
fun eq_assume_tac i = PRIMITIVE (Thm.eq_assumption i);
clasohm@0
   110
wenzelm@23223
   111
clasohm@0
   112
(** Resolution/matching tactics **)
clasohm@0
   113
clasohm@0
   114
(*The composition rule/state: no lifting or var renaming.
wenzelm@31945
   115
  The arg = (bires_flg, orule, m);  see Thm.bicompose for explanation.*)
wenzelm@31945
   116
fun compose_tac arg i = PRIMSEQ (Thm.bicompose false arg i);
clasohm@0
   117
clasohm@0
   118
(*Converts a "destruct" rule like P&Q==>P to an "elimination" rule
clasohm@0
   119
  like [| P&Q; P==>R |] ==> R *)
clasohm@0
   120
fun make_elim rl = zero_var_indexes (rl RS revcut_rl);
clasohm@0
   121
clasohm@0
   122
(*Attack subgoal i by resolution, using flags to indicate elimination rules*)
wenzelm@31945
   123
fun biresolve_tac brules i = PRIMSEQ (Thm.biresolution false brules i);
clasohm@0
   124
clasohm@0
   125
(*Resolution: the simple case, works for introduction rules*)
clasohm@0
   126
fun resolve_tac rules = biresolve_tac (map (pair false) rules);
clasohm@0
   127
clasohm@0
   128
(*Resolution with elimination rules only*)
clasohm@0
   129
fun eresolve_tac rules = biresolve_tac (map (pair true) rules);
clasohm@0
   130
clasohm@0
   131
(*Forward reasoning using destruction rules.*)
clasohm@0
   132
fun forward_tac rls = resolve_tac (map make_elim rls) THEN' assume_tac;
clasohm@0
   133
clasohm@0
   134
(*Like forward_tac, but deletes the assumption after use.*)
clasohm@0
   135
fun dresolve_tac rls = eresolve_tac (map make_elim rls);
clasohm@0
   136
clasohm@0
   137
(*Shorthand versions: for resolution with a single theorem*)
oheimb@7491
   138
val atac    =   assume_tac;
oheimb@7491
   139
fun rtac rl =  resolve_tac [rl];
oheimb@7491
   140
fun dtac rl = dresolve_tac [rl];
clasohm@1460
   141
fun etac rl = eresolve_tac [rl];
oheimb@7491
   142
fun ftac rl =  forward_tac [rl];
oheimb@7491
   143
fun datac thm j = EVERY' (dtac thm::replicate j atac);
oheimb@7491
   144
fun eatac thm j = EVERY' (etac thm::replicate j atac);
oheimb@7491
   145
fun fatac thm j = EVERY' (ftac thm::replicate j atac);
clasohm@0
   146
clasohm@0
   147
(*Use an assumption or some rules ... A popular combination!*)
clasohm@0
   148
fun ares_tac rules = assume_tac  ORELSE'  resolve_tac rules;
clasohm@0
   149
wenzelm@5263
   150
fun solve_tac rules = resolve_tac rules THEN_ALL_NEW assume_tac;
wenzelm@5263
   151
clasohm@0
   152
(*Matching tactics -- as above, but forbid updating of state*)
wenzelm@31945
   153
fun bimatch_tac brules i = PRIMSEQ (Thm.biresolution true brules i);
clasohm@0
   154
fun match_tac rules  = bimatch_tac (map (pair false) rules);
clasohm@0
   155
fun ematch_tac rules = bimatch_tac (map (pair true) rules);
clasohm@0
   156
fun dmatch_tac rls   = ematch_tac (map make_elim rls);
clasohm@0
   157
clasohm@0
   158
(*Smash all flex-flex disagreement pairs in the proof state.*)
wenzelm@36944
   159
val flexflex_tac = PRIMSEQ Thm.flexflex_rule;
clasohm@0
   160
wenzelm@19056
   161
(*Remove duplicate subgoals.*)
paulson@22560
   162
val perm_tac = PRIMITIVE oo Thm.permute_prems;
paulson@22560
   163
paulson@22560
   164
fun distinct_tac (i, k) =
paulson@22560
   165
  perm_tac 0 (i - 1) THEN
paulson@22560
   166
  perm_tac 1 (k - 1) THEN
paulson@22560
   167
  DETERM (PRIMSEQ (fn st =>
paulson@22560
   168
    Thm.compose_no_flatten false (st, 0) 1
paulson@22560
   169
      (Drule.incr_indexes st Drule.distinct_prems_rl))) THEN
paulson@22560
   170
  perm_tac 1 (1 - k) THEN
paulson@22560
   171
  perm_tac 0 (1 - i);
paulson@22560
   172
paulson@22560
   173
fun distinct_subgoal_tac i st =
haftmann@33957
   174
  (case drop (i - 1) (Thm.prems_of st) of
paulson@22560
   175
    [] => no_tac st
paulson@22560
   176
  | A :: Bs =>
paulson@22560
   177
      st |> EVERY (fold (fn (B, k) =>
wenzelm@23223
   178
        if A aconv B then cons (distinct_tac (i, k)) else I) (Bs ~~ (1 upto length Bs)) []));
paulson@22560
   179
wenzelm@10817
   180
fun distinct_subgoals_tac state =
wenzelm@19056
   181
  let
wenzelm@19056
   182
    val goals = Thm.prems_of state;
wenzelm@19056
   183
    val dups = distinct (eq_fst (op aconv)) (goals ~~ (1 upto length goals));
wenzelm@19056
   184
  in EVERY (rev (map (distinct_subgoal_tac o snd) dups)) state end;
paulson@3409
   185
wenzelm@11929
   186
(*Determine print names of goal parameters (reversed)*)
wenzelm@11929
   187
fun innermost_params i st =
wenzelm@36944
   188
  let val (_, _, Bi, _) = Thm.dest_state (st, i)
wenzelm@29276
   189
  in Term.rename_wrt_term Bi (Logic.strip_params Bi) end;
wenzelm@11929
   190
paulson@1951
   191
lcp@270
   192
(*** Applications of cut_rl ***)
clasohm@0
   193
clasohm@0
   194
(*The conclusion of the rule gets assumed in subgoal i,
clasohm@0
   195
  while subgoal i+1,... are the premises of the rule.*)
wenzelm@27243
   196
fun metacut_tac rule i = resolve_tac [cut_rl] i  THEN  biresolve_tac [(false, rule)] (i+1);
clasohm@0
   197
paulson@13650
   198
(*"Cut" a list of rules into the goal.  Their premises will become new
paulson@13650
   199
  subgoals.*)
paulson@13650
   200
fun cut_rules_tac ths i = EVERY (map (fn th => metacut_tac th i) ths);
paulson@13650
   201
paulson@13650
   202
(*As above, but inserts only facts (unconditional theorems);
paulson@13650
   203
  generates no additional subgoals. *)
wenzelm@20232
   204
fun cut_facts_tac ths = cut_rules_tac (filter Thm.no_prems ths);
clasohm@0
   205
clasohm@0
   206
clasohm@0
   207
(**** Indexing and filtering of theorems ****)
clasohm@0
   208
clasohm@0
   209
(*Returns the list of potentially resolvable theorems for the goal "prem",
wenzelm@10805
   210
        using the predicate  could(subgoal,concl).
clasohm@0
   211
  Resulting list is no longer than "limit"*)
clasohm@0
   212
fun filter_thms could (limit, prem, ths) =
clasohm@0
   213
  let val pb = Logic.strip_assums_concl prem;   (*delete assumptions*)
clasohm@0
   214
      fun filtr (limit, []) = []
wenzelm@10805
   215
        | filtr (limit, th::ths) =
wenzelm@10805
   216
            if limit=0 then  []
wenzelm@10805
   217
            else if could(pb, concl_of th)  then th :: filtr(limit-1, ths)
wenzelm@10805
   218
            else filtr(limit,ths)
clasohm@0
   219
  in  filtr(limit,ths)  end;
clasohm@0
   220
clasohm@0
   221
clasohm@0
   222
(*** biresolution and resolution using nets ***)
clasohm@0
   223
clasohm@0
   224
(** To preserve the order of the rules, tag them with increasing integers **)
clasohm@0
   225
clasohm@0
   226
(*insert one tagged brl into the pair of nets*)
wenzelm@23178
   227
fun insert_tagged_brl (kbrl as (k, (eres, th))) (inet, enet) =
wenzelm@12320
   228
  if eres then
wenzelm@12320
   229
    (case try Thm.major_prem_of th of
wenzelm@16809
   230
      SOME prem => (inet, Net.insert_term (K false) (prem, kbrl) enet)
skalberg@15531
   231
    | NONE => error "insert_tagged_brl: elimination rule with no premises")
wenzelm@16809
   232
  else (Net.insert_term (K false) (concl_of th, kbrl) inet, enet);
clasohm@0
   233
clasohm@0
   234
(*build a pair of nets for biresolution*)
wenzelm@10817
   235
fun build_netpair netpair brls =
wenzelm@30558
   236
    fold_rev insert_tagged_brl (tag_list 1 brls) netpair;
clasohm@0
   237
wenzelm@12320
   238
(*delete one kbrl from the pair of nets*)
wenzelm@22360
   239
fun eq_kbrl ((_, (_, th)), (_, (_, th'))) = Thm.eq_thm_prop (th, th')
wenzelm@16809
   240
wenzelm@23178
   241
fun delete_tagged_brl (brl as (eres, th)) (inet, enet) =
paulson@13925
   242
  (if eres then
wenzelm@12320
   243
    (case try Thm.major_prem_of th of
wenzelm@16809
   244
      SOME prem => (inet, Net.delete_term eq_kbrl (prem, ((), brl)) enet)
skalberg@15531
   245
    | NONE => (inet, enet))  (*no major premise: ignore*)
wenzelm@16809
   246
  else (Net.delete_term eq_kbrl (Thm.concl_of th, ((), brl)) inet, enet))
paulson@13925
   247
  handle Net.DELETE => (inet,enet);
paulson@1801
   248
paulson@1801
   249
wenzelm@10817
   250
(*biresolution using a pair of nets rather than rules.
paulson@3706
   251
    function "order" must sort and possibly filter the list of brls.
paulson@3706
   252
    boolean "match" indicates matching or unification.*)
paulson@3706
   253
fun biresolution_from_nets_tac order match (inet,enet) =
clasohm@0
   254
  SUBGOAL
clasohm@0
   255
    (fn (prem,i) =>
clasohm@0
   256
      let val hyps = Logic.strip_assums_hyp prem
wenzelm@10817
   257
          and concl = Logic.strip_assums_concl prem
wenzelm@19482
   258
          val kbrls = Net.unify_term inet concl @ maps (Net.unify_term enet) hyps
wenzelm@31945
   259
      in PRIMSEQ (Thm.biresolution match (order kbrls) i) end);
clasohm@0
   260
paulson@3706
   261
(*versions taking pre-built nets.  No filtering of brls*)
wenzelm@30558
   262
val biresolve_from_nets_tac = biresolution_from_nets_tac order_list false;
wenzelm@30558
   263
val bimatch_from_nets_tac   = biresolution_from_nets_tac order_list true;
clasohm@0
   264
clasohm@0
   265
(*fast versions using nets internally*)
lcp@670
   266
val net_biresolve_tac =
lcp@670
   267
    biresolve_from_nets_tac o build_netpair(Net.empty,Net.empty);
lcp@670
   268
lcp@670
   269
val net_bimatch_tac =
lcp@670
   270
    bimatch_from_nets_tac o build_netpair(Net.empty,Net.empty);
clasohm@0
   271
clasohm@0
   272
(*** Simpler version for resolve_tac -- only one net, and no hyps ***)
clasohm@0
   273
clasohm@0
   274
(*insert one tagged rl into the net*)
wenzelm@23178
   275
fun insert_krl (krl as (k,th)) =
wenzelm@23178
   276
  Net.insert_term (K false) (concl_of th, krl);
clasohm@0
   277
clasohm@0
   278
(*build a net of rules for resolution*)
wenzelm@10817
   279
fun build_net rls =
wenzelm@30558
   280
  fold_rev insert_krl (tag_list 1 rls) Net.empty;
clasohm@0
   281
clasohm@0
   282
(*resolution using a net rather than rules; pred supports filt_resolve_tac*)
clasohm@0
   283
fun filt_resolution_from_net_tac match pred net =
clasohm@0
   284
  SUBGOAL
clasohm@0
   285
    (fn (prem,i) =>
clasohm@0
   286
      let val krls = Net.unify_term net (Logic.strip_assums_concl prem)
wenzelm@10817
   287
      in
wenzelm@10817
   288
         if pred krls
clasohm@0
   289
         then PRIMSEQ
wenzelm@31945
   290
                (Thm.biresolution match (map (pair false) (order_list krls)) i)
clasohm@0
   291
         else no_tac
clasohm@0
   292
      end);
clasohm@0
   293
clasohm@0
   294
(*Resolve the subgoal using the rules (making a net) unless too flexible,
clasohm@0
   295
   which means more than maxr rules are unifiable.      *)
wenzelm@10817
   296
fun filt_resolve_tac rules maxr =
clasohm@0
   297
    let fun pred krls = length krls <= maxr
clasohm@0
   298
    in  filt_resolution_from_net_tac false pred (build_net rules)  end;
clasohm@0
   299
clasohm@0
   300
(*versions taking pre-built nets*)
clasohm@0
   301
val resolve_from_net_tac = filt_resolution_from_net_tac false (K true);
clasohm@0
   302
val match_from_net_tac = filt_resolution_from_net_tac true (K true);
clasohm@0
   303
clasohm@0
   304
(*fast versions using nets internally*)
clasohm@0
   305
val net_resolve_tac = resolve_from_net_tac o build_net;
clasohm@0
   306
val net_match_tac = match_from_net_tac o build_net;
clasohm@0
   307
clasohm@0
   308
clasohm@0
   309
(*** For Natural Deduction using (bires_flg, rule) pairs ***)
clasohm@0
   310
clasohm@0
   311
(*The number of new subgoals produced by the brule*)
lcp@1077
   312
fun subgoals_of_brl (true,rule)  = nprems_of rule - 1
lcp@1077
   313
  | subgoals_of_brl (false,rule) = nprems_of rule;
clasohm@0
   314
clasohm@0
   315
(*Less-than test: for sorting to minimize number of new subgoals*)
clasohm@0
   316
fun lessb (brl1,brl2) = subgoals_of_brl brl1 < subgoals_of_brl brl2;
clasohm@0
   317
clasohm@0
   318
wenzelm@27243
   319
(*Renaming of parameters in a subgoal*)
wenzelm@27243
   320
fun rename_tac xs i =
wenzelm@14673
   321
  case Library.find_first (not o Syntax.is_identifier) xs of
skalberg@15531
   322
      SOME x => error ("Not an identifier: " ^ x)
wenzelm@31945
   323
    | NONE => PRIMITIVE (Thm.rename_params_rule (xs, i));
wenzelm@9535
   324
paulson@1501
   325
(*rotate_tac n i: rotate the assumptions of subgoal i by n positions, from
paulson@1501
   326
  right to left if n is positive, and from left to right if n is negative.*)
paulson@2672
   327
fun rotate_tac 0 i = all_tac
wenzelm@31945
   328
  | rotate_tac k i = PRIMITIVE (Thm.rotate_rule k i);
nipkow@1209
   329
paulson@7248
   330
(*Rotates the given subgoal to be the last.*)
wenzelm@31945
   331
fun defer_tac i = PRIMITIVE (Thm.permute_prems (i - 1) 1);
paulson@7248
   332
nipkow@5974
   333
(* remove premises that do not satisfy p; fails if all prems satisfy p *)
nipkow@5974
   334
fun filter_prems_tac p =
skalberg@15531
   335
  let fun Then NONE tac = SOME tac
skalberg@15531
   336
        | Then (SOME tac) tac' = SOME(tac THEN' tac');
wenzelm@19473
   337
      fun thins H (tac,n) =
nipkow@5974
   338
        if p H then (tac,n+1)
nipkow@5974
   339
        else (Then tac (rotate_tac n THEN' etac thin_rl),0);
nipkow@5974
   340
  in SUBGOAL(fn (subg,n) =>
nipkow@5974
   341
       let val Hs = Logic.strip_assums_hyp subg
wenzelm@19473
   342
       in case fst(fold thins Hs (NONE,0)) of
skalberg@15531
   343
            NONE => no_tac | SOME tac => tac n
nipkow@5974
   344
       end)
nipkow@5974
   345
  end;
nipkow@5974
   346
clasohm@0
   347
end;
paulson@1501
   348
wenzelm@32971
   349
structure Basic_Tactic: BASIC_TACTIC = Tactic;
wenzelm@32971
   350
open Basic_Tactic;