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