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