src/Pure/Isar/method.ML
author wenzelm
Wed Nov 29 18:41:43 2000 +0100 (2000-11-29)
changeset 10541 fdec07d4f047
parent 10529 b92c228660e4
child 10744 5d142ca01b8e
permissions -rw-r--r--
resolveq(_cases)_tac moved to HOL/Tools/induct_method.ML;
wenzelm@5824
     1
(*  Title:      Pure/Isar/method.ML
wenzelm@5824
     2
    ID:         $Id$
wenzelm@5824
     3
    Author:     Markus Wenzel, TU Muenchen
wenzelm@8807
     4
    License:    GPL (GNU GENERAL PUBLIC LICENSE)
wenzelm@5824
     5
wenzelm@5824
     6
Proof methods.
wenzelm@5824
     7
*)
wenzelm@5824
     8
wenzelm@5824
     9
signature BASIC_METHOD =
wenzelm@5824
    10
sig
wenzelm@5824
    11
  val print_methods: theory -> unit
wenzelm@5824
    12
  val Method: bstring -> (Args.src -> Proof.context -> Proof.method) -> string -> unit
wenzelm@5824
    13
end;
wenzelm@5824
    14
wenzelm@5824
    15
signature METHOD =
wenzelm@5824
    16
sig
wenzelm@5824
    17
  include BASIC_METHOD
wenzelm@8153
    18
  val print_global_rules: theory -> unit
wenzelm@8153
    19
  val print_local_rules: Proof.context -> unit
wenzelm@8153
    20
  val dest_global: theory attribute
wenzelm@8153
    21
  val elim_global: theory attribute
wenzelm@8153
    22
  val intro_global: theory attribute
wenzelm@9938
    23
  val rule_del_global: theory attribute
wenzelm@8153
    24
  val dest_local: Proof.context attribute
wenzelm@8153
    25
  val elim_local: Proof.context attribute
wenzelm@8153
    26
  val intro_local: Proof.context attribute
wenzelm@9938
    27
  val rule_del_local: Proof.context attribute
wenzelm@6091
    28
  val METHOD: (thm list -> tactic) -> Proof.method
wenzelm@8372
    29
  val METHOD_CASES:
wenzelm@8372
    30
    (thm list -> thm -> (thm * (string * RuleCases.T) list) Seq.seq) -> Proof.method
wenzelm@9706
    31
  val SIMPLE_METHOD: tactic -> Proof.method
wenzelm@9706
    32
  val SIMPLE_METHOD': ((int -> tactic) -> tactic) -> (int -> tactic) -> Proof.method
wenzelm@5824
    33
  val fail: Proof.method
wenzelm@5824
    34
  val succeed: Proof.method
wenzelm@8167
    35
  val defer: int option -> Proof.method
wenzelm@8167
    36
  val prefer: int -> Proof.method
wenzelm@7419
    37
  val insert_tac: thm list -> int -> tactic
wenzelm@7574
    38
  val insert: thm list -> Proof.method
wenzelm@7555
    39
  val insert_facts: Proof.method
wenzelm@7601
    40
  val unfold: thm list -> Proof.method
wenzelm@7419
    41
  val fold: thm list -> Proof.method
wenzelm@9484
    42
  val atomize_tac: thm list -> int -> tactic
wenzelm@9485
    43
  val atomize_goal: thm list -> int -> thm -> thm
wenzelm@7419
    44
  val multi_resolve: thm list -> thm -> thm Seq.seq
wenzelm@7419
    45
  val multi_resolves: thm list -> thm list -> thm Seq.seq
wenzelm@6091
    46
  val rule_tac: thm list -> thm list -> int -> tactic
wenzelm@9587
    47
  val erule_tac: thm list -> thm list -> int -> tactic
wenzelm@10309
    48
  val some_rule_tac: thm list -> Proof.context -> thm list -> int -> tactic
wenzelm@6091
    49
  val rule: thm list -> Proof.method
wenzelm@7130
    50
  val erule: thm list -> Proof.method
wenzelm@8220
    51
  val drule: thm list -> Proof.method
wenzelm@8220
    52
  val frule: thm list -> Proof.method
wenzelm@8195
    53
  val this: Proof.method
wenzelm@7555
    54
  val assumption: Proof.context -> Proof.method
wenzelm@8351
    55
  val set_tactic: (Proof.context -> thm list -> tactic) -> unit
wenzelm@8351
    56
  val tactic: string -> Proof.context -> Proof.method
wenzelm@5916
    57
  exception METHOD_FAIL of (string * Position.T) * exn
wenzelm@5824
    58
  val method: theory -> Args.src -> Proof.context -> Proof.method
wenzelm@9539
    59
  val add_method: bstring * (Args.src -> Proof.context -> Proof.method) * string
wenzelm@9539
    60
    -> theory -> theory
wenzelm@5824
    61
  val add_methods: (bstring * (Args.src -> Proof.context -> Proof.method) * string) list
wenzelm@5824
    62
    -> theory -> theory
wenzelm@5884
    63
  val syntax: (Proof.context * Args.T list -> 'a * (Proof.context * Args.T list)) ->
wenzelm@8282
    64
    Args.src -> Proof.context -> Proof.context * 'a
wenzelm@8351
    65
  val simple_args: (Args.T list -> 'a * Args.T list)
wenzelm@8351
    66
    -> ('a -> Proof.context -> Proof.method) -> Args.src -> Proof.context -> Proof.method
wenzelm@7555
    67
  val ctxt_args: (Proof.context -> Proof.method) -> Args.src -> Proof.context -> Proof.method
wenzelm@5884
    68
  val no_args: Proof.method -> Args.src -> Proof.context -> Proof.method
wenzelm@7268
    69
  type modifier
wenzelm@7601
    70
  val sectioned_args: (Proof.context * Args.T list -> 'a * (Proof.context * Args.T list)) ->
wenzelm@7268
    71
    (Args.T list -> modifier * Args.T list) list ->
wenzelm@9864
    72
    ('a -> Proof.context -> 'b) -> Args.src -> Proof.context -> 'b
wenzelm@7601
    73
  val bang_sectioned_args:
wenzelm@7601
    74
    (Args.T list -> modifier * Args.T list) list ->
wenzelm@9864
    75
    (thm list -> Proof.context -> 'a) -> Args.src -> Proof.context -> 'a
wenzelm@9777
    76
  val bang_sectioned_args':
wenzelm@9777
    77
    (Args.T list -> modifier * Args.T list) list ->
wenzelm@9777
    78
    (Proof.context * Args.T list -> 'a * (Proof.context * Args.T list)) ->
wenzelm@9864
    79
    ('a -> thm list -> Proof.context -> 'b) -> Args.src -> Proof.context -> 'b
wenzelm@7601
    80
  val only_sectioned_args:
wenzelm@7601
    81
    (Args.T list -> modifier * Args.T list) list ->
wenzelm@9864
    82
    (Proof.context -> 'a) -> Args.src -> Proof.context -> 'a
wenzelm@9864
    83
  val thms_ctxt_args: (thm list -> Proof.context -> 'a) -> Args.src -> Proof.context -> 'a
wenzelm@9864
    84
  val thms_args: (thm list -> 'a) -> Args.src -> Proof.context -> 'a
wenzelm@9864
    85
  val thm_args: (thm -> 'a) -> Args.src -> Proof.context -> 'a
wenzelm@5824
    86
  datatype text =
wenzelm@5824
    87
    Basic of (Proof.context -> Proof.method) |
wenzelm@5824
    88
    Source of Args.src |
wenzelm@5824
    89
    Then of text list |
wenzelm@5824
    90
    Orelse of text list |
wenzelm@5824
    91
    Try of text |
wenzelm@5824
    92
    Repeat1 of text
wenzelm@5824
    93
  val refine: text -> Proof.state -> Proof.state Seq.seq
wenzelm@8238
    94
  val refine_end: text -> Proof.state -> Proof.state Seq.seq
wenzelm@5824
    95
  val proof: text option -> Proof.state -> Proof.state Seq.seq
wenzelm@8966
    96
  val local_qed: bool -> text option
wenzelm@6981
    97
    -> ({kind: string, name: string, thm: thm} -> unit) * (thm -> unit)
wenzelm@6736
    98
    -> Proof.state -> Proof.state Seq.seq
wenzelm@6981
    99
  val local_terminal_proof: text * text option
wenzelm@6981
   100
    -> ({kind: string, name: string, thm: thm} -> unit) * (thm -> unit)
wenzelm@6736
   101
    -> Proof.state -> Proof.state Seq.seq
wenzelm@6981
   102
  val local_default_proof: ({kind: string, name: string, thm: thm} -> unit) * (thm -> unit)
wenzelm@6736
   103
    -> Proof.state -> Proof.state Seq.seq
wenzelm@8966
   104
  val local_immediate_proof: ({kind: string, name: string, thm: thm} -> unit) * (thm -> unit)
wenzelm@8966
   105
    -> Proof.state -> Proof.state Seq.seq
wenzelm@8966
   106
  val local_done_proof: ({kind: string, name: string, thm: thm} -> unit) * (thm -> unit)
wenzelm@8966
   107
    -> Proof.state -> Proof.state Seq.seq
wenzelm@8966
   108
  val global_qed: bool -> text option
wenzelm@8966
   109
    -> Proof.state -> theory * {kind: string, name: string, thm: thm}
wenzelm@6934
   110
  val global_terminal_proof: text * text option
wenzelm@6934
   111
    -> Proof.state -> theory * {kind: string, name: string, thm: thm}
wenzelm@8966
   112
  val global_default_proof: Proof.state -> theory * {kind: string, name: string, thm: thm}
wenzelm@6532
   113
  val global_immediate_proof: Proof.state -> theory * {kind: string, name: string, thm: thm}
wenzelm@8966
   114
  val global_done_proof: Proof.state -> theory * {kind: string, name: string, thm: thm}
wenzelm@9539
   115
  val goal_args: (Args.T list -> 'a * Args.T list) -> ('a -> int -> tactic)
wenzelm@9539
   116
    -> Args.src -> Proof.context -> Proof.method
wenzelm@9539
   117
  val goal_args': (Proof.context * Args.T list -> 'a * (Proof.context * Args.T list))
wenzelm@9539
   118
    -> ('a -> int -> tactic) -> Args.src -> Proof.context -> Proof.method
wenzelm@5824
   119
  val setup: (theory -> theory) list
wenzelm@5824
   120
end;
wenzelm@5824
   121
wenzelm@5824
   122
structure Method: METHOD =
wenzelm@5824
   123
struct
wenzelm@5824
   124
wenzelm@5824
   125
wenzelm@8153
   126
(** global and local rule data **)
wenzelm@8153
   127
wenzelm@10008
   128
local
wenzelm@10008
   129
  fun prt_rules kind sg ths =
wenzelm@10008
   130
    Pretty.writeln (Pretty.big_list ("standard " ^ kind ^ " rules:")
wenzelm@10008
   131
      (map (Display.pretty_thm_sg sg) ths));
wenzelm@10008
   132
in
wenzelm@10008
   133
  fun print_rules sg (intro, elim) =
wenzelm@10008
   134
    (prt_rules "introduction" sg intro; prt_rules "elimination" sg elim);
wenzelm@10008
   135
end;
wenzelm@8153
   136
wenzelm@8153
   137
wenzelm@8153
   138
(* theory data kind 'Isar/rules' *)
wenzelm@8153
   139
wenzelm@8153
   140
structure GlobalRulesArgs =
wenzelm@8153
   141
struct
wenzelm@8153
   142
  val name = "Isar/rules";
wenzelm@8153
   143
  type T = thm list * thm list;
wenzelm@8153
   144
wenzelm@8153
   145
  val empty = ([], []);
wenzelm@8153
   146
  val copy = I;
wenzelm@8153
   147
  val prep_ext = I;
wenzelm@8153
   148
  fun merge ((intro1, elim1), (intro2, elim2)) =
wenzelm@9418
   149
    (Drule.merge_rules (intro1, intro2), Drule.merge_rules (elim1, elim2));
wenzelm@10008
   150
  val print = print_rules;
wenzelm@8153
   151
end;
wenzelm@8153
   152
wenzelm@8153
   153
structure GlobalRules = TheoryDataFun(GlobalRulesArgs);
wenzelm@8153
   154
val print_global_rules = GlobalRules.print;
wenzelm@8153
   155
wenzelm@8153
   156
wenzelm@8153
   157
(* proof data kind 'Isar/rules' *)
wenzelm@8153
   158
wenzelm@8153
   159
structure LocalRulesArgs =
wenzelm@8153
   160
struct
wenzelm@8153
   161
  val name = "Isar/rules";
wenzelm@8153
   162
  type T = thm list * thm list;
wenzelm@8153
   163
wenzelm@8153
   164
  val init = GlobalRules.get;
wenzelm@10008
   165
  val print = print_rules o ProofContext.sign_of;
wenzelm@8153
   166
end;
wenzelm@8153
   167
wenzelm@8153
   168
structure LocalRules = ProofDataFun(LocalRulesArgs);
wenzelm@8153
   169
val print_local_rules = LocalRules.print;
wenzelm@8153
   170
wenzelm@8153
   171
wenzelm@8153
   172
wenzelm@8153
   173
(** attributes **)
wenzelm@8153
   174
wenzelm@8153
   175
(* add rules *)
wenzelm@8153
   176
wenzelm@8153
   177
local
wenzelm@8153
   178
wenzelm@9938
   179
fun add_dest th (intro, elim) = (intro, Drule.add_rules [Tactic.make_elim th] elim);
wenzelm@9938
   180
fun add_elim th (intro, elim) = (intro, Drule.add_rules [th] elim);
wenzelm@9938
   181
fun add_intro th (intro, elim) = (Drule.add_rules [th] intro, elim);
wenzelm@8153
   182
wenzelm@9938
   183
fun del_rule th (intro, elim) =
wenzelm@9938
   184
  let
wenzelm@9938
   185
    val th' = Tactic.make_elim th;
wenzelm@9938
   186
    val del = Drule.del_rules [th'] o Drule.del_rules [th];
wenzelm@9938
   187
  in (del intro, del elim) end;
wenzelm@8153
   188
wenzelm@9938
   189
fun mk_att f g (x, th) = (f (g th) x, th);
wenzelm@8153
   190
wenzelm@8153
   191
in
wenzelm@8153
   192
wenzelm@8153
   193
val dest_global = mk_att GlobalRules.map add_dest;
wenzelm@8153
   194
val elim_global = mk_att GlobalRules.map add_elim;
wenzelm@8153
   195
val intro_global = mk_att GlobalRules.map add_intro;
wenzelm@9938
   196
val rule_del_global = mk_att GlobalRules.map del_rule;
wenzelm@8153
   197
wenzelm@8153
   198
val dest_local = mk_att LocalRules.map add_dest;
wenzelm@8153
   199
val elim_local = mk_att LocalRules.map add_elim;
wenzelm@8153
   200
val intro_local = mk_att LocalRules.map add_intro;
wenzelm@9938
   201
val rule_del_local = mk_att LocalRules.map del_rule;
wenzelm@9938
   202
wenzelm@10034
   203
fun del_args att = Attrib.syntax (Scan.lift Args.del >> K att);
wenzelm@8153
   204
wenzelm@8153
   205
end;
wenzelm@8153
   206
wenzelm@8153
   207
wenzelm@8153
   208
(* concrete syntax *)
wenzelm@8153
   209
wenzelm@8153
   210
val rule_atts =
wenzelm@9900
   211
 [("dest", (Attrib.no_args dest_global, Attrib.no_args dest_local),
wenzelm@9900
   212
    "declaration of destruction rule"),
wenzelm@9900
   213
  ("elim", (Attrib.no_args elim_global, Attrib.no_args elim_local),
wenzelm@9900
   214
    "declaration of elimination rule"),
wenzelm@9900
   215
  ("intro", (Attrib.no_args intro_global, Attrib.no_args intro_local),
wenzelm@9900
   216
    "declaration of introduction rule"),
wenzelm@9938
   217
  ("rule", (del_args rule_del_global, del_args rule_del_local),
wenzelm@9900
   218
    "remove declaration of elim/intro rule")];
wenzelm@8153
   219
wenzelm@8153
   220
wenzelm@8153
   221
wenzelm@5824
   222
(** proof methods **)
wenzelm@5824
   223
wenzelm@8372
   224
(* make methods *)
wenzelm@5824
   225
wenzelm@6849
   226
val METHOD = Proof.method;
wenzelm@8372
   227
val METHOD_CASES = Proof.method_cases;
wenzelm@8372
   228
wenzelm@5824
   229
wenzelm@5824
   230
(* primitive *)
wenzelm@5824
   231
wenzelm@5824
   232
val fail = METHOD (K no_tac);
wenzelm@5824
   233
val succeed = METHOD (K all_tac);
wenzelm@5824
   234
wenzelm@5824
   235
wenzelm@8167
   236
(* shuffle *)
wenzelm@8167
   237
wenzelm@8240
   238
fun prefer i = METHOD (K (Tactic.defer_tac i THEN PRIMITIVE (Thm.permute_prems 0 ~1)));
wenzelm@8167
   239
fun defer opt_i = METHOD (K (Tactic.defer_tac (if_none opt_i 1)));
wenzelm@8167
   240
wenzelm@8167
   241
wenzelm@7419
   242
(* insert *)
wenzelm@7419
   243
wenzelm@7419
   244
local
wenzelm@5824
   245
wenzelm@6981
   246
fun cut_rule_tac raw_rule =
wenzelm@6981
   247
  let
wenzelm@6981
   248
    val rule = Drule.forall_intr_vars raw_rule;
wenzelm@6981
   249
    val revcut_rl = Drule.incr_indexes_wrt [] [] [] [rule] Drule.revcut_rl;
wenzelm@7555
   250
  in Tactic.rtac (rule COMP revcut_rl) end;
wenzelm@6981
   251
wenzelm@7419
   252
in
wenzelm@5824
   253
wenzelm@7419
   254
fun insert_tac [] i = all_tac
wenzelm@7419
   255
  | insert_tac facts i = EVERY (map (fn th => cut_rule_tac th i) facts);
wenzelm@6981
   256
wenzelm@7555
   257
val insert_facts = METHOD (ALLGOALS o insert_tac);
wenzelm@7664
   258
fun insert thms = METHOD (fn _ => ALLGOALS (insert_tac thms));
wenzelm@7419
   259
wenzelm@7419
   260
end;
wenzelm@5824
   261
wenzelm@5824
   262
wenzelm@9706
   263
(* simple methods *)
wenzelm@9706
   264
wenzelm@9706
   265
fun SIMPLE_METHOD tac = METHOD (fn facts => ALLGOALS (insert_tac facts) THEN tac);
wenzelm@9706
   266
fun SIMPLE_METHOD' quant tac = METHOD (fn facts => quant (insert_tac facts THEN' tac));
wenzelm@9706
   267
wenzelm@9706
   268
wenzelm@7601
   269
(* unfold / fold definitions *)
wenzelm@6532
   270
wenzelm@9706
   271
fun unfold thms = SIMPLE_METHOD (CHANGED (rewrite_goals_tac thms));
wenzelm@9706
   272
fun fold thms = SIMPLE_METHOD (CHANGED (fold_goals_tac thms));
wenzelm@9484
   273
wenzelm@9484
   274
wenzelm@9484
   275
(* atomize meta-connectives *)
wenzelm@9484
   276
wenzelm@10405
   277
fun atomize_tac rews =
wenzelm@10405
   278
  let val rew_tac = rewrite_goal_tac rews in
wenzelm@10405
   279
    fn i => fn thm =>
wenzelm@10405
   280
      if Logic.has_meta_prems (#prop (Thm.rep_thm thm)) i then rew_tac i thm
wenzelm@10405
   281
      else all_tac thm
wenzelm@10405
   282
  end;
wenzelm@10405
   283
wenzelm@10405
   284
fun atomize_goal rews =
wenzelm@10405
   285
  let val tac = atomize_tac rews
wenzelm@10405
   286
  in fn i => fn thm => (case Seq.pull (tac i thm) of None => thm | Some (thm', _) => thm') end;
wenzelm@6532
   287
wenzelm@6532
   288
wenzelm@7419
   289
(* multi_resolve *)
wenzelm@7419
   290
wenzelm@7419
   291
local
wenzelm@7419
   292
wenzelm@7419
   293
fun res th i rule =
wenzelm@7419
   294
  Thm.biresolution false [(false, th)] i rule handle THM _ => Seq.empty;
wenzelm@7419
   295
wenzelm@7419
   296
fun multi_res _ [] rule = Seq.single rule
wenzelm@7419
   297
  | multi_res i (th :: ths) rule = Seq.flat (Seq.map (res th i) (multi_res (i + 1) ths rule));
wenzelm@7419
   298
wenzelm@7419
   299
in
wenzelm@7419
   300
wenzelm@7419
   301
val multi_resolve = multi_res 1;
wenzelm@8372
   302
fun multi_resolves facts rules = Seq.flat (Seq.map (multi_resolve facts) (Seq.of_list rules));
wenzelm@7419
   303
wenzelm@7419
   304
end;
wenzelm@7419
   305
wenzelm@7419
   306
wenzelm@8372
   307
(* simple rule *)
wenzelm@8372
   308
wenzelm@7419
   309
local
wenzelm@5824
   310
wenzelm@10541
   311
fun gen_rule_tac tac rules [] i st = tac rules i st
wenzelm@10541
   312
  | gen_rule_tac tac erules facts i st =
wenzelm@10541
   313
      Seq.flat (Seq.map (fn rule => (tac o single) rule i st) (multi_resolves facts erules));
wenzelm@7130
   314
wenzelm@10309
   315
fun gen_some_rule_tac tac arg_rules ctxt facts =
wenzelm@8153
   316
  let val rules =
wenzelm@8153
   317
    if not (null arg_rules) then arg_rules
wenzelm@8153
   318
    else if null facts then #1 (LocalRules.get ctxt)
wenzelm@8153
   319
    else op @ (LocalRules.get ctxt);
wenzelm@10309
   320
  in tac rules facts end;
wenzelm@10309
   321
wenzelm@10309
   322
fun gen_rule tac rules = METHOD (HEADGOAL o tac rules);
wenzelm@10309
   323
fun gen_rule' tac arg_rules ctxt = METHOD (HEADGOAL o gen_some_rule_tac tac arg_rules ctxt);
wenzelm@8153
   324
wenzelm@8220
   325
fun setup raw_tac =
wenzelm@8220
   326
  let val tac = gen_rule_tac raw_tac
wenzelm@8220
   327
  in (tac, gen_rule tac, gen_rule' tac) end;
wenzelm@8220
   328
wenzelm@7419
   329
in
wenzelm@7419
   330
wenzelm@10309
   331
val some_rule_tac = gen_some_rule_tac (gen_rule_tac Tactic.resolve_tac);
wenzelm@8220
   332
val (rule_tac, rule, some_rule) = setup Tactic.resolve_tac;
wenzelm@8220
   333
val (erule_tac, erule, some_erule) = setup Tactic.eresolve_tac;
wenzelm@8220
   334
val (drule_tac, drule, some_drule) = setup Tactic.dresolve_tac;
wenzelm@8220
   335
val (frule_tac, frule, some_frule) = setup Tactic.forward_tac;
wenzelm@5824
   336
wenzelm@7419
   337
end;
wenzelm@7419
   338
wenzelm@7419
   339
wenzelm@8195
   340
(* this *)
wenzelm@8195
   341
wenzelm@8671
   342
val this = METHOD (EVERY o map (HEADGOAL o Tactic.rtac));
wenzelm@8195
   343
wenzelm@8195
   344
wenzelm@8195
   345
(* assumption *)
wenzelm@7555
   346
wenzelm@10378
   347
fun asm_tac ths =
wenzelm@10378
   348
  foldr (op APPEND') (map (fn th => Tactic.rtac th THEN_ALL_NEW assume_tac) ths, K no_tac);
wenzelm@10378
   349
wenzelm@10405
   350
fun assm_tac ctxt =
wenzelm@10405
   351
  assume_tac APPEND'
wenzelm@10405
   352
  asm_tac (ProofContext.prems_of ctxt) APPEND'
wenzelm@10405
   353
  Tactic.rtac Drule.reflexive_thm;
wenzelm@7419
   354
wenzelm@7555
   355
fun assumption_tac ctxt [] = assm_tac ctxt
wenzelm@10378
   356
  | assumption_tac _ [fact] = asm_tac [fact]
wenzelm@7555
   357
  | assumption_tac _ _ = K no_tac;
wenzelm@7419
   358
wenzelm@8671
   359
fun assumption ctxt = METHOD (HEADGOAL o assumption_tac ctxt);
wenzelm@7419
   360
wenzelm@7419
   361
wenzelm@9539
   362
(* res_inst_tac etc. *)
wenzelm@8238
   363
wenzelm@9539
   364
(*Note: insts refer to the implicit (!!) goal context; use at your own risk*)
wenzelm@9565
   365
fun gen_res_inst _ tac (quant, ([], thms)) =
wenzelm@9565
   366
      METHOD (fn facts => (quant (insert_tac facts THEN' tac thms)))
wenzelm@9565
   367
  | gen_res_inst tac _ (quant, (insts, [thm])) =
wenzelm@9565
   368
      METHOD (fn facts => (quant (insert_tac facts THEN' tac insts thm)))
wenzelm@9565
   369
  | gen_res_inst _ _ _ = error "Cannot have instantiations with multiple rules";
wenzelm@8238
   370
wenzelm@9565
   371
val res_inst = gen_res_inst Tactic.res_inst_tac Tactic.resolve_tac;
wenzelm@9565
   372
val eres_inst = gen_res_inst Tactic.eres_inst_tac Tactic.eresolve_tac;
wenzelm@9565
   373
val dres_inst = gen_res_inst Tactic.dres_inst_tac Tactic.dresolve_tac;
wenzelm@9565
   374
val forw_inst = gen_res_inst Tactic.forw_inst_tac Tactic.forward_tac;
wenzelm@9565
   375
val cut_inst = gen_res_inst Tactic.cut_inst_tac Tactic.cut_facts_tac;
wenzelm@8238
   376
wenzelm@8238
   377
wenzelm@8329
   378
(* simple Prolog interpreter *)
wenzelm@8329
   379
wenzelm@8329
   380
fun prolog_tac rules facts =
wenzelm@8329
   381
  DEPTH_SOLVE_1 (HEADGOAL (Tactic.assume_tac APPEND' Tactic.resolve_tac (facts @ rules)));
wenzelm@8329
   382
wenzelm@8329
   383
val prolog = METHOD o prolog_tac;
wenzelm@8329
   384
wenzelm@8329
   385
wenzelm@8351
   386
(* ML tactics *)
wenzelm@8351
   387
wenzelm@8351
   388
val tactic_ref = ref ((fn _ => raise Match): Proof.context -> thm list -> tactic);
wenzelm@8351
   389
fun set_tactic f = tactic_ref := f;
wenzelm@8351
   390
wenzelm@8351
   391
fun tactic txt ctxt = METHOD (fn facts =>
wenzelm@9631
   392
  (Context.use_mltext
wenzelm@9631
   393
    ("let fun tactic (ctxt: PureIsar.Proof.context) (facts: thm list) : tactic = \
wenzelm@9631
   394
     \let val thm = PureIsar.ProofContext.get_thm_closure ctxt\n\
wenzelm@9631
   395
     \  and thms = PureIsar.ProofContext.get_thms_closure ctxt in\n"
wenzelm@9631
   396
     ^ txt ^
wenzelm@9631
   397
     "\nend in PureIsar.Method.set_tactic tactic end")
wenzelm@9631
   398
    false None;
wenzelm@9631
   399
    Context.setmp (Some (ProofContext.theory_of ctxt)) (! tactic_ref ctxt) facts));
wenzelm@8351
   400
wenzelm@8351
   401
wenzelm@5824
   402
wenzelm@5824
   403
(** methods theory data **)
wenzelm@5824
   404
wenzelm@5824
   405
(* data kind 'Isar/methods' *)
wenzelm@5824
   406
wenzelm@5824
   407
structure MethodsDataArgs =
wenzelm@5824
   408
struct
wenzelm@5824
   409
  val name = "Isar/methods";
wenzelm@5824
   410
  type T =
wenzelm@5824
   411
    {space: NameSpace.T,
wenzelm@5824
   412
     meths: (((Args.src -> Proof.context -> Proof.method) * string) * stamp) Symtab.table};
wenzelm@5824
   413
wenzelm@5824
   414
  val empty = {space = NameSpace.empty, meths = Symtab.empty};
wenzelm@6546
   415
  val copy = I;
wenzelm@5824
   416
  val prep_ext = I;
wenzelm@5824
   417
  fun merge ({space = space1, meths = meths1}, {space = space2, meths = meths2}) =
wenzelm@5824
   418
    {space = NameSpace.merge (space1, space2),
wenzelm@5824
   419
      meths = Symtab.merge eq_snd (meths1, meths2) handle Symtab.DUPS dups =>
wenzelm@5824
   420
        error ("Attempt to merge different versions of methods " ^ commas_quote dups)};
wenzelm@5824
   421
wenzelm@9222
   422
  fun print _ {space, meths} =
wenzelm@5824
   423
    let
wenzelm@5824
   424
      fun prt_meth (name, ((_, comment), _)) = Pretty.block
wenzelm@6849
   425
        [Pretty.str (name ^ ":"), Pretty.brk 2, Pretty.str comment];
wenzelm@5824
   426
    in
wenzelm@8720
   427
      [Pretty.big_list "methods:" (map prt_meth (NameSpace.cond_extern_table space meths))]
wenzelm@9222
   428
      |> Pretty.chunks |> Pretty.writeln
wenzelm@5824
   429
    end;
wenzelm@5824
   430
end;
wenzelm@5824
   431
wenzelm@5824
   432
structure MethodsData = TheoryDataFun(MethodsDataArgs);
wenzelm@5824
   433
val print_methods = MethodsData.print;
wenzelm@7611
   434
wenzelm@5824
   435
wenzelm@5824
   436
(* get methods *)
wenzelm@5824
   437
wenzelm@5916
   438
exception METHOD_FAIL of (string * Position.T) * exn;
wenzelm@5916
   439
wenzelm@5824
   440
fun method thy =
wenzelm@5824
   441
  let
wenzelm@5824
   442
    val {space, meths} = MethodsData.get thy;
wenzelm@5824
   443
wenzelm@5884
   444
    fun meth src =
wenzelm@5884
   445
      let
wenzelm@5884
   446
        val ((raw_name, _), pos) = Args.dest_src src;
wenzelm@5884
   447
        val name = NameSpace.intern space raw_name;
wenzelm@5884
   448
      in
wenzelm@5824
   449
        (case Symtab.lookup (meths, name) of
wenzelm@5824
   450
          None => error ("Unknown proof method: " ^ quote name ^ Position.str_of pos)
wenzelm@5916
   451
        | Some ((mth, _), _) => transform_failure (curry METHOD_FAIL (name, pos)) (mth src))
wenzelm@5824
   452
      end;
wenzelm@5824
   453
  in meth end;
wenzelm@5824
   454
wenzelm@5824
   455
wenzelm@9194
   456
(* add_method(s) *)
wenzelm@5824
   457
wenzelm@5824
   458
fun add_methods raw_meths thy =
wenzelm@5824
   459
  let
wenzelm@5824
   460
    val full = Sign.full_name (Theory.sign_of thy);
wenzelm@5824
   461
    val new_meths =
wenzelm@5824
   462
      map (fn (name, f, comment) => (full name, ((f, comment), stamp ()))) raw_meths;
wenzelm@5824
   463
wenzelm@5824
   464
    val {space, meths} = MethodsData.get thy;
wenzelm@5824
   465
    val space' = NameSpace.extend (space, map fst new_meths);
wenzelm@5824
   466
    val meths' = Symtab.extend (meths, new_meths) handle Symtab.DUPS dups =>
wenzelm@5824
   467
      error ("Duplicate declaration of method(s) " ^ commas_quote dups);
wenzelm@5824
   468
  in
wenzelm@5824
   469
    thy |> MethodsData.put {space = space', meths = meths'}
wenzelm@5824
   470
  end;
wenzelm@5824
   471
wenzelm@9194
   472
val add_method = add_methods o Library.single;
wenzelm@9194
   473
wenzelm@5824
   474
(*implicit version*)
wenzelm@5824
   475
fun Method name meth cmt = Context.>> (add_methods [(name, meth, cmt)]);
wenzelm@5824
   476
wenzelm@5824
   477
wenzelm@5884
   478
wenzelm@5884
   479
(** method syntax **)
wenzelm@5824
   480
wenzelm@5884
   481
(* basic *)
wenzelm@5884
   482
wenzelm@5884
   483
fun syntax (scan: (Proof.context * Args.T list -> 'a * (Proof.context * Args.T list))) =
wenzelm@5884
   484
  Args.syntax "method" scan;
wenzelm@5824
   485
wenzelm@8351
   486
fun simple_args scan f src ctxt : Proof.method =
wenzelm@8351
   487
  #2 (syntax (Scan.lift (scan >> (fn x => f x ctxt))) src ctxt);
wenzelm@8351
   488
wenzelm@7555
   489
fun ctxt_args (f: Proof.context -> Proof.method) src ctxt =
wenzelm@8282
   490
  #2 (syntax (Scan.succeed (f ctxt)) src ctxt);
wenzelm@7555
   491
wenzelm@7555
   492
fun no_args m = ctxt_args (K m);
wenzelm@5884
   493
wenzelm@5884
   494
wenzelm@8351
   495
wenzelm@5884
   496
(* sections *)
wenzelm@5824
   497
wenzelm@7268
   498
type modifier = (Proof.context -> Proof.context) * Proof.context attribute;
wenzelm@7268
   499
wenzelm@7268
   500
local
wenzelm@7268
   501
wenzelm@8381
   502
fun sect ss = Scan.first (map Scan.lift ss);
wenzelm@5884
   503
fun thms ss = Scan.unless (sect ss) Attrib.local_thms;
wenzelm@5884
   504
fun thmss ss = Scan.repeat (thms ss) >> flat;
wenzelm@5884
   505
wenzelm@7268
   506
fun apply (f, att) (ctxt, ths) = Thm.applys_attributes ((f ctxt, ths), [att]);
wenzelm@5824
   507
wenzelm@7268
   508
fun section ss = (sect ss -- thmss ss) :-- (fn (m, ths) => Scan.depend (fn ctxt =>
wenzelm@7268
   509
  Scan.succeed (apply m (ctxt, ths)))) >> #2;
wenzelm@5884
   510
wenzelm@7601
   511
fun sectioned args ss = args -- Scan.repeat (section ss);
wenzelm@5884
   512
wenzelm@7268
   513
in
wenzelm@5824
   514
wenzelm@5884
   515
fun sectioned_args args ss f src ctxt =
wenzelm@8282
   516
  let val (ctxt', (x, _)) = syntax (sectioned args ss) src ctxt
wenzelm@5921
   517
  in f x ctxt' end;
wenzelm@5884
   518
wenzelm@7601
   519
fun bang_sectioned_args ss f = sectioned_args Args.bang_facts ss f;
wenzelm@9777
   520
fun bang_sectioned_args' ss scan f =
wenzelm@9777
   521
  sectioned_args (Args.bang_facts -- scan >> swap) ss (uncurry f);
wenzelm@7601
   522
fun only_sectioned_args ss f = sectioned_args (Scan.succeed ()) ss (fn () => f);
wenzelm@7268
   523
wenzelm@8093
   524
fun thms_ctxt_args f = sectioned_args (thmss []) [] f;
wenzelm@8093
   525
fun thms_args f = thms_ctxt_args (K o f);
wenzelm@9706
   526
fun thm_args f = thms_args (fn [thm] => f thm | _ => error "Single theorem expected");
wenzelm@5824
   527
wenzelm@7268
   528
end;
wenzelm@7268
   529
wenzelm@5824
   530
wenzelm@9539
   531
(* tactic syntax *)
wenzelm@8238
   532
wenzelm@8238
   533
val insts =
wenzelm@9539
   534
  Scan.optional
wenzelm@9565
   535
    (Args.enum1 "and" (Scan.lift (Args.name -- (Args.$$$ "=" |-- Args.!!! Args.name))) --|
wenzelm@9565
   536
      Scan.lift (Args.$$$ "in")) [] -- Attrib.local_thmss;
wenzelm@8238
   537
wenzelm@8537
   538
fun inst_args f = f oo (#2 oo syntax (Args.goal_spec HEADGOAL -- insts));
wenzelm@8537
   539
wenzelm@8537
   540
wenzelm@9539
   541
fun goal_args' args tac = #2 oo syntax (Args.goal_spec HEADGOAL -- args >>
wenzelm@9706
   542
  (fn (quant, s) => SIMPLE_METHOD' quant (tac s)));
wenzelm@8537
   543
wenzelm@9539
   544
fun goal_args args tac = goal_args' (Scan.lift args) tac;
wenzelm@8238
   545
wenzelm@8238
   546
wenzelm@5824
   547
wenzelm@5824
   548
(** method text **)
wenzelm@5824
   549
wenzelm@5824
   550
(* datatype text *)
wenzelm@5824
   551
wenzelm@5824
   552
datatype text =
wenzelm@5824
   553
  Basic of (Proof.context -> Proof.method) |
wenzelm@5824
   554
  Source of Args.src |
wenzelm@5824
   555
  Then of text list |
wenzelm@5824
   556
  Orelse of text list |
wenzelm@5824
   557
  Try of text |
wenzelm@5824
   558
  Repeat1 of text;
wenzelm@5824
   559
wenzelm@5824
   560
wenzelm@5824
   561
(* refine *)
wenzelm@5824
   562
wenzelm@8238
   563
fun gen_refine f text state =
wenzelm@5824
   564
  let
wenzelm@5824
   565
    val thy = Proof.theory_of state;
wenzelm@5824
   566
wenzelm@8238
   567
    fun eval (Basic mth) = f mth
wenzelm@8238
   568
      | eval (Source src) = f (method thy src)
wenzelm@5824
   569
      | eval (Then txts) = Seq.EVERY (map eval txts)
wenzelm@5824
   570
      | eval (Orelse txts) = Seq.FIRST (map eval txts)
wenzelm@5824
   571
      | eval (Try txt) = Seq.TRY (eval txt)
wenzelm@5824
   572
      | eval (Repeat1 txt) = Seq.REPEAT1 (eval txt);
wenzelm@5824
   573
  in eval text state end;
wenzelm@5824
   574
wenzelm@8238
   575
val refine = gen_refine Proof.refine;
wenzelm@8238
   576
val refine_end = gen_refine Proof.refine_end;
wenzelm@6404
   577
wenzelm@5824
   578
wenzelm@6404
   579
(* structured proof steps *)
wenzelm@5824
   580
wenzelm@7506
   581
val default_text = Source (Args.src (("default", []), Position.none));
wenzelm@8195
   582
val this_text = Basic (K this);
wenzelm@9706
   583
val done_text = Basic (K (SIMPLE_METHOD all_tac));
wenzelm@7555
   584
wenzelm@8966
   585
fun close_text asm = Basic (fn ctxt => METHOD (K
wenzelm@8966
   586
  (FILTER Thm.no_prems ((if asm then ALLGOALS (assm_tac ctxt) else all_tac) THEN flexflex_tac))));
wenzelm@8966
   587
wenzelm@8966
   588
fun finish_text asm None = close_text asm
wenzelm@8966
   589
  | finish_text asm (Some txt) = Then [txt, close_text asm];
wenzelm@6872
   590
wenzelm@5824
   591
fun proof opt_text state =
wenzelm@5824
   592
  state
wenzelm@5824
   593
  |> Proof.assert_backward
wenzelm@6404
   594
  |> refine (if_none opt_text default_text)
wenzelm@8242
   595
  |> Seq.map (Proof.goal_facts (K []))
wenzelm@5824
   596
  |> Seq.map Proof.enter_forward;
wenzelm@5824
   597
wenzelm@8966
   598
fun local_qed asm opt_text = Proof.local_qed (refine (finish_text asm opt_text));
wenzelm@8966
   599
fun local_terminal_proof (text, opt_text) pr =
wenzelm@8966
   600
  Seq.THEN (proof (Some text), local_qed true opt_text pr);
wenzelm@8966
   601
val local_default_proof = local_terminal_proof (default_text, None);
wenzelm@8195
   602
val local_immediate_proof = local_terminal_proof (this_text, None);
wenzelm@8966
   603
fun local_done_proof pr = Seq.THEN (proof (Some done_text), local_qed false None pr);
wenzelm@5824
   604
wenzelm@6872
   605
wenzelm@8966
   606
fun global_qeds asm opt_text = Proof.global_qed (refine (finish_text asm opt_text));
wenzelm@5824
   607
wenzelm@8966
   608
fun global_qed asm opt_text state =
wenzelm@6872
   609
  state
wenzelm@8966
   610
  |> global_qeds asm opt_text
wenzelm@6872
   611
  |> Proof.check_result "Failed to finish proof" state
wenzelm@6872
   612
  |> Seq.hd;
wenzelm@6872
   613
wenzelm@8966
   614
fun global_term_proof asm (text, opt_text) state =
wenzelm@6872
   615
  state
wenzelm@6872
   616
  |> proof (Some text)
wenzelm@6872
   617
  |> Proof.check_result "Terminal proof method failed" state
wenzelm@8966
   618
  |> (Seq.flat o Seq.map (global_qeds asm opt_text))
wenzelm@6872
   619
  |> Proof.check_result "Failed to finish proof (after successful terminal method)" state
wenzelm@6872
   620
  |> Seq.hd;
wenzelm@6872
   621
wenzelm@8966
   622
val global_terminal_proof = global_term_proof true;
wenzelm@6934
   623
val global_default_proof = global_terminal_proof (default_text, None);
wenzelm@8966
   624
val global_immediate_proof = global_terminal_proof (this_text, None);
wenzelm@8966
   625
val global_done_proof = global_term_proof false (done_text, None);
wenzelm@5824
   626
wenzelm@5824
   627
wenzelm@5824
   628
(** theory setup **)
wenzelm@5824
   629
wenzelm@9539
   630
(* misc tactic emulations *)
wenzelm@9539
   631
wenzelm@9539
   632
val subgoal_meth = goal_args (Scan.repeat1 Args.name) Tactic.subgoals_tac;
wenzelm@9539
   633
val thin_meth = goal_args Args.name Tactic.thin_tac;
wenzelm@9539
   634
val rename_meth = goal_args (Scan.repeat1 Args.name) Tactic.rename_params_tac;
wenzelm@9631
   635
val rotate_meth = goal_args (Scan.optional Args.int 1) Tactic.rotate_tac;
wenzelm@9539
   636
wenzelm@9539
   637
wenzelm@5824
   638
(* pure_methods *)
wenzelm@5824
   639
wenzelm@5824
   640
val pure_methods =
wenzelm@5824
   641
 [("fail", no_args fail, "force failure"),
wenzelm@5824
   642
  ("succeed", no_args succeed, "succeed"),
wenzelm@9587
   643
  ("-", no_args insert_facts, "do nothing (insert current facts only)"),
wenzelm@9539
   644
  ("insert", thms_args insert, "insert theorems, ignoring facts (improper)"),
wenzelm@7601
   645
  ("unfold", thms_args unfold, "unfold definitions"),
wenzelm@7601
   646
  ("fold", thms_args fold, "fold definitions"),
wenzelm@8153
   647
  ("rule", thms_ctxt_args some_rule, "apply some rule"),
wenzelm@9539
   648
  ("erule", thms_ctxt_args some_erule, "apply some rule in elimination manner (improper)"),
wenzelm@9539
   649
  ("drule", thms_ctxt_args some_drule, "apply some rule in destruct manner (improper)"),
wenzelm@9539
   650
  ("frule", thms_ctxt_args some_frule, "apply some rule in forward manner (improper)"),
wenzelm@8195
   651
  ("this", no_args this, "apply current facts as rules"),
wenzelm@8238
   652
  ("assumption", ctxt_args assumption, "proof by assumption, preferring facts"),
wenzelm@9539
   653
  ("rule_tac", inst_args res_inst, "apply rule (dynamic instantiation!)"),
wenzelm@9539
   654
  ("erule_tac", inst_args eres_inst, "apply rule in elimination manner (dynamic instantiation!)"),
wenzelm@9539
   655
  ("drule_tac", inst_args dres_inst, "apply rule in destruct manner (dynamic instantiation!)"),
wenzelm@9539
   656
  ("frule_tac", inst_args forw_inst, "apply rule in forward manner (dynamic instantiation!)"),
wenzelm@9539
   657
  ("cut_tac", inst_args cut_inst, "cut rule (dynamic instantiation!)"),
wenzelm@9565
   658
  ("subgoal_tac", subgoal_meth, "insert subgoal (dynamic instantiation!)"),
wenzelm@9565
   659
  ("thin_tac", thin_meth, "remove premise (dynamic instantiation!)"),
wenzelm@9631
   660
  ("rename_tac", rename_meth, "rename parameters of goal (dynamic instantiation!)"),
wenzelm@9631
   661
  ("rotate_tac", rotate_meth, "rotate assumptions of goal"),
wenzelm@8351
   662
  ("prolog", thms_args prolog, "simple prolog interpreter"),
wenzelm@8351
   663
  ("tactic", simple_args Args.name tactic, "ML tactic as proof method")];
wenzelm@5824
   664
wenzelm@5824
   665
wenzelm@5824
   666
(* setup *)
wenzelm@5824
   667
wenzelm@8153
   668
val setup =
wenzelm@8153
   669
 [GlobalRules.init, LocalRules.init, Attrib.add_attributes rule_atts,
wenzelm@8153
   670
  MethodsData.init, add_methods pure_methods];
wenzelm@5824
   671
wenzelm@5824
   672
wenzelm@5824
   673
end;
wenzelm@5824
   674
wenzelm@5824
   675
wenzelm@5824
   676
structure BasicMethod: BASIC_METHOD = Method;
wenzelm@5824
   677
open BasicMethod;