src/Pure/Isar/method.ML
author wenzelm
Thu Nov 10 20:57:11 2005 +0100 (2005-11-10)
changeset 18145 6757627acf59
parent 18039 500b7ed7b2bd
child 18227 d4cfa0fee007
permissions -rw-r--r--
renamed Thm.cgoal_of to Thm.cprem_of;
wenzelm@5824
     1
(*  Title:      Pure/Isar/method.ML
wenzelm@5824
     2
    ID:         $Id$
wenzelm@5824
     3
    Author:     Markus Wenzel, TU Muenchen
wenzelm@5824
     4
wenzelm@17110
     5
Isar proof methods.
wenzelm@5824
     6
*)
wenzelm@5824
     7
wenzelm@5824
     8
signature BASIC_METHOD =
wenzelm@5824
     9
sig
wenzelm@17110
    10
  val FINDGOAL: (int -> thm -> 'a Seq.seq) -> thm -> 'a Seq.seq
wenzelm@17110
    11
  val HEADGOAL: (int -> thm -> 'a Seq.seq) -> thm -> 'a Seq.seq
wenzelm@17110
    12
  type method
wenzelm@11731
    13
  val trace_rules: bool ref
wenzelm@5824
    14
  val print_methods: theory -> unit
wenzelm@17110
    15
  val Method: bstring -> (Args.src -> ProofContext.context -> method) -> string -> unit
wenzelm@5824
    16
end;
wenzelm@5824
    17
wenzelm@5824
    18
signature METHOD =
wenzelm@5824
    19
sig
wenzelm@5824
    20
  include BASIC_METHOD
wenzelm@7419
    21
  val multi_resolve: thm list -> thm -> thm Seq.seq
wenzelm@7419
    22
  val multi_resolves: thm list -> thm list -> thm Seq.seq
wenzelm@17110
    23
  val apply: method -> thm list -> RuleCases.tactic;
wenzelm@17110
    24
  val RAW_METHOD_CASES: (thm list -> RuleCases.tactic) -> method
wenzelm@17110
    25
  val RAW_METHOD: (thm list -> tactic) -> method
wenzelm@17110
    26
  val METHOD_CASES: (thm list -> RuleCases.tactic) -> method
wenzelm@17110
    27
  val METHOD: (thm list -> tactic) -> method
wenzelm@17110
    28
  val fail: method
wenzelm@17110
    29
  val succeed: method
wenzelm@17110
    30
  val insert_tac: thm list -> int -> tactic
wenzelm@17110
    31
  val insert: thm list -> method
wenzelm@17110
    32
  val insert_facts: method
wenzelm@17110
    33
  val SIMPLE_METHOD: tactic -> method
wenzelm@17110
    34
  val SIMPLE_METHOD': ((int -> tactic) -> tactic) -> (int -> tactic) -> method
wenzelm@17110
    35
  val defer: int option -> method
wenzelm@17110
    36
  val prefer: int -> method
wenzelm@17356
    37
  val cheating: bool -> ProofContext.context -> method
wenzelm@17110
    38
  val intro: thm list -> method
wenzelm@17110
    39
  val elim: thm list -> method
wenzelm@17110
    40
  val unfold: thm list -> method
wenzelm@17110
    41
  val fold: thm list -> method
wenzelm@17110
    42
  val atomize: bool -> method
wenzelm@17110
    43
  val this: method
wenzelm@18039
    44
  val fact: thm list -> ProofContext.context -> method
wenzelm@17110
    45
  val assumption: ProofContext.context -> method
wenzelm@17110
    46
  val close: bool -> ProofContext.context -> method
wenzelm@17110
    47
  val trace: ProofContext.context -> thm list -> unit
wenzelm@6091
    48
  val rule_tac: thm list -> thm list -> int -> tactic
wenzelm@17110
    49
  val some_rule_tac: thm list -> ProofContext.context -> thm list -> int -> tactic
wenzelm@17110
    50
  val rule: thm list -> method
wenzelm@17110
    51
  val erule: int -> thm list -> method
wenzelm@17110
    52
  val drule: int -> thm list -> method
wenzelm@17110
    53
  val frule: int -> thm list -> method
nipkow@17587
    54
  val iprover_tac: ProofContext.context -> int option -> int -> tactic
wenzelm@17110
    55
  val bires_inst_tac: bool -> ProofContext.context -> (indexname * string) list ->
wenzelm@17110
    56
    thm -> int -> tactic
wenzelm@17110
    57
  val set_tactic: (ProofContext.context -> thm list -> tactic) -> unit
wenzelm@17110
    58
  val tactic: string -> ProofContext.context -> method
wenzelm@17110
    59
  type src
wenzelm@5824
    60
  datatype text =
wenzelm@17110
    61
    Basic of (ProofContext.context -> method) |
wenzelm@15703
    62
    Source of src |
wenzelm@5824
    63
    Then of text list |
wenzelm@5824
    64
    Orelse of text list |
wenzelm@5824
    65
    Try of text |
wenzelm@5824
    66
    Repeat1 of text
wenzelm@17857
    67
  val primitive_text: (thm -> thm) -> text
wenzelm@17857
    68
  val succeed_text: text
wenzelm@17110
    69
  val default_text: text
wenzelm@17110
    70
  val this_text: text
wenzelm@17110
    71
  val done_text: text
wenzelm@17356
    72
  val sorry_text: bool -> text
wenzelm@17356
    73
  val finish_text: text option * bool -> text
wenzelm@17110
    74
  exception METHOD_FAIL of (string * Position.T) * exn
wenzelm@17110
    75
  val method: theory -> src -> ProofContext.context -> method
wenzelm@17110
    76
  val add_methods: (bstring * (src -> ProofContext.context -> method) * string) list
wenzelm@17110
    77
    -> theory -> theory
wenzelm@17110
    78
  val add_method: bstring * (src -> ProofContext.context -> method) * string
wenzelm@17110
    79
    -> theory -> theory
wenzelm@17356
    80
  val method_setup: bstring * string * string -> theory -> theory
wenzelm@17110
    81
  val syntax: (ProofContext.context * Args.T list -> 'a * (ProofContext.context * Args.T list))
wenzelm@17110
    82
    -> src -> ProofContext.context -> ProofContext.context * 'a
wenzelm@17110
    83
  val simple_args: (Args.T list -> 'a * Args.T list)
wenzelm@17110
    84
    -> ('a -> ProofContext.context -> method) -> src -> ProofContext.context -> method
wenzelm@17110
    85
  val ctxt_args: (ProofContext.context -> method) -> src -> ProofContext.context -> method
wenzelm@17110
    86
  val no_args: method -> src -> ProofContext.context -> method
wenzelm@17110
    87
  type modifier
wenzelm@17110
    88
  val sectioned_args: (ProofContext.context * Args.T list ->
wenzelm@17110
    89
      'a * (ProofContext.context * Args.T list)) ->
wenzelm@17110
    90
    (Args.T list -> modifier * Args.T list) list ->
wenzelm@17110
    91
    ('a -> ProofContext.context -> 'b) -> src -> ProofContext.context -> 'b
wenzelm@17110
    92
  val bang_sectioned_args:
wenzelm@17110
    93
    (Args.T list -> modifier * Args.T list) list ->
wenzelm@17110
    94
    (thm list -> ProofContext.context -> 'a) -> src -> ProofContext.context -> 'a
wenzelm@17110
    95
  val bang_sectioned_args':
wenzelm@17110
    96
    (Args.T list -> modifier * Args.T list) list ->
wenzelm@17110
    97
    (ProofContext.context * Args.T list -> 'a * (ProofContext.context * Args.T list)) ->
wenzelm@17110
    98
    ('a -> thm list -> ProofContext.context -> 'b) -> src -> ProofContext.context -> 'b
wenzelm@17110
    99
  val only_sectioned_args:
wenzelm@17110
   100
    (Args.T list -> modifier * Args.T list) list ->
wenzelm@17110
   101
    (ProofContext.context -> 'a) -> src -> ProofContext.context -> 'a
wenzelm@17110
   102
  val thms_ctxt_args: (thm list -> ProofContext.context -> 'a) -> src ->
wenzelm@17110
   103
    ProofContext.context -> 'a
wenzelm@17110
   104
  val thms_args: (thm list -> 'a) -> src -> ProofContext.context -> 'a
wenzelm@17110
   105
  val thm_args: (thm -> 'a) -> src -> ProofContext.context -> 'a
wenzelm@9539
   106
  val goal_args: (Args.T list -> 'a * Args.T list) -> ('a -> int -> tactic)
wenzelm@17110
   107
    -> src -> ProofContext.context -> method
wenzelm@17110
   108
  val goal_args': (ProofContext.context * Args.T list ->
wenzelm@17110
   109
      'a * (ProofContext.context * Args.T list))
wenzelm@17110
   110
    -> ('a -> int -> tactic) -> src -> ProofContext.context -> method
wenzelm@17110
   111
  val goal_args_ctxt: (Args.T list -> 'a * Args.T list) ->
wenzelm@17110
   112
    (ProofContext.context -> 'a -> int -> tactic) -> src -> ProofContext.context -> method
wenzelm@17110
   113
  val goal_args_ctxt': (ProofContext.context * Args.T list ->
wenzelm@17110
   114
    'a * (ProofContext.context * Args.T list)) ->
wenzelm@17110
   115
    (ProofContext.context -> 'a -> int -> tactic) -> src -> ProofContext.context -> method
wenzelm@5824
   116
end;
wenzelm@5824
   117
wenzelm@5824
   118
structure Method: METHOD =
wenzelm@5824
   119
struct
wenzelm@5824
   120
wenzelm@17110
   121
(** generic tools **)
wenzelm@17110
   122
wenzelm@17110
   123
(* goal addressing *)
wenzelm@17110
   124
wenzelm@17110
   125
fun FINDGOAL tac st =
wenzelm@17110
   126
  let fun find i n = if i > n then Seq.fail else Seq.APPEND (tac i, find (i + 1) n)
wenzelm@17110
   127
  in find 1 (Thm.nprems_of st) st end;
wenzelm@17110
   128
wenzelm@17110
   129
fun HEADGOAL tac = tac 1;
wenzelm@17110
   130
wenzelm@17110
   131
wenzelm@17110
   132
(* multi_resolve *)
wenzelm@17110
   133
wenzelm@17110
   134
local
wenzelm@17110
   135
wenzelm@17110
   136
fun res th i rule =
wenzelm@17110
   137
  Thm.biresolution false [(false, th)] i rule handle THM _ => Seq.empty;
wenzelm@17110
   138
wenzelm@17110
   139
fun multi_res _ [] rule = Seq.single rule
wenzelm@17356
   140
  | multi_res i (th :: ths) rule = Seq.maps (res th i) (multi_res (i + 1) ths rule);
wenzelm@17110
   141
wenzelm@17110
   142
in
wenzelm@17110
   143
wenzelm@17110
   144
val multi_resolve = multi_res 1;
wenzelm@17356
   145
fun multi_resolves facts rules = Seq.maps (multi_resolve facts) (Seq.of_list rules);
wenzelm@17110
   146
wenzelm@17110
   147
end;
wenzelm@17110
   148
wenzelm@15703
   149
wenzelm@5824
   150
wenzelm@12324
   151
(** proof methods **)
wenzelm@12324
   152
wenzelm@17110
   153
(* datatype method *)
wenzelm@11731
   154
wenzelm@17756
   155
datatype method = Meth of thm list -> RuleCases.tactic;
wenzelm@11731
   156
wenzelm@17756
   157
fun apply (Meth m) = m;
wenzelm@11731
   158
wenzelm@17756
   159
val RAW_METHOD_CASES = Meth;
wenzelm@11731
   160
wenzelm@17110
   161
fun RAW_METHOD tac = RAW_METHOD_CASES (NO_CASES o tac);
wenzelm@12144
   162
wenzelm@17110
   163
fun METHOD_CASES tac = RAW_METHOD_CASES (fn facts =>
wenzelm@17110
   164
  Seq.THEN (TRY Tactic.conjunction_tac, tac facts));
wenzelm@8372
   165
wenzelm@17110
   166
fun METHOD tac = RAW_METHOD (fn facts =>
wenzelm@17110
   167
  TRY Tactic.conjunction_tac THEN tac facts);
wenzelm@5824
   168
wenzelm@5824
   169
val fail = METHOD (K no_tac);
wenzelm@5824
   170
val succeed = METHOD (K all_tac);
wenzelm@5824
   171
wenzelm@5824
   172
wenzelm@17110
   173
(* insert facts *)
wenzelm@7419
   174
wenzelm@7419
   175
local
wenzelm@5824
   176
wenzelm@6981
   177
fun cut_rule_tac raw_rule =
wenzelm@6981
   178
  let
wenzelm@6981
   179
    val rule = Drule.forall_intr_vars raw_rule;
wenzelm@18039
   180
    val revcut_rl = Drule.incr_indexes rule Drule.revcut_rl;
wenzelm@7555
   181
  in Tactic.rtac (rule COMP revcut_rl) end;
wenzelm@6981
   182
wenzelm@7419
   183
in
wenzelm@5824
   184
wenzelm@7419
   185
fun insert_tac [] i = all_tac
wenzelm@7419
   186
  | insert_tac facts i = EVERY (map (fn th => cut_rule_tac th i) facts);
wenzelm@6981
   187
wenzelm@7555
   188
val insert_facts = METHOD (ALLGOALS o insert_tac);
wenzelm@7664
   189
fun insert thms = METHOD (fn _ => ALLGOALS (insert_tac thms));
wenzelm@7419
   190
wenzelm@9706
   191
fun SIMPLE_METHOD tac = METHOD (fn facts => ALLGOALS (insert_tac facts) THEN tac);
wenzelm@9706
   192
fun SIMPLE_METHOD' quant tac = METHOD (fn facts => quant (insert_tac facts THEN' tac));
wenzelm@9706
   193
wenzelm@12324
   194
end;
wenzelm@12324
   195
wenzelm@9706
   196
wenzelm@17110
   197
(* shuffle subgoals *)
wenzelm@17110
   198
wenzelm@17110
   199
fun prefer i = METHOD (K (Tactic.defer_tac i THEN PRIMITIVE (Thm.permute_prems 0 ~1)));
wenzelm@17110
   200
fun defer opt_i = METHOD (K (Tactic.defer_tac (if_none opt_i 1)));
wenzelm@17110
   201
wenzelm@17110
   202
wenzelm@17356
   203
(* cheating *)
wenzelm@17356
   204
wenzelm@17356
   205
fun cheating int ctxt = METHOD (K (setmp quick_and_dirty (int orelse ! quick_and_dirty)
wenzelm@17356
   206
    (SkipProof.cheat_tac (ProofContext.theory_of ctxt))));
wenzelm@17356
   207
wenzelm@17356
   208
wenzelm@17110
   209
(* unfold intro/elim rules *)
wenzelm@17110
   210
wenzelm@17110
   211
fun intro ths = SIMPLE_METHOD' HEADGOAL (CHANGED_PROP o REPEAT_ALL_NEW (Tactic.match_tac ths));
wenzelm@17110
   212
fun elim ths = SIMPLE_METHOD' HEADGOAL (CHANGED_PROP o REPEAT_ALL_NEW (Tactic.ematch_tac ths));
wenzelm@17110
   213
wenzelm@17110
   214
wenzelm@12384
   215
(* unfold/fold definitions *)
wenzelm@12384
   216
wenzelm@16145
   217
fun unfold_meth ths = SIMPLE_METHOD (CHANGED_PROP (rewrite_goals_tac ths));
wenzelm@16145
   218
fun fold_meth ths = SIMPLE_METHOD (CHANGED_PROP (fold_goals_tac ths));
wenzelm@6532
   219
wenzelm@12384
   220
wenzelm@12829
   221
(* atomize rule statements *)
wenzelm@12829
   222
wenzelm@12829
   223
fun atomize false = SIMPLE_METHOD' HEADGOAL (CHANGED_PROP o ObjectLogic.atomize_tac)
wenzelm@12829
   224
  | atomize true = RAW_METHOD (K (HEADGOAL (CHANGED_PROP o ObjectLogic.full_atomize_tac)));
wenzelm@12829
   225
wenzelm@12829
   226
wenzelm@18039
   227
(* this -- resolve facts directly *)
wenzelm@12384
   228
wenzelm@17110
   229
val this = METHOD (EVERY o map (HEADGOAL o Tactic.rtac));
wenzelm@9484
   230
wenzelm@9484
   231
wenzelm@18039
   232
(* fact -- composition by facts from context *)
wenzelm@18039
   233
wenzelm@18039
   234
fun fact_tac [] ctxt [] = ProofContext.some_fact_tac ctxt
wenzelm@18039
   235
  | fact_tac ths _ [] = ProofContext.fact_tac ths
wenzelm@18039
   236
  | fact_tac _ _ facts = EVERY' (map (ProofContext.fact_tac o single) facts);
wenzelm@18039
   237
wenzelm@18039
   238
fun fact rules ctxt = METHOD (fn facts => HEADGOAL (fact_tac rules ctxt facts));
wenzelm@18039
   239
wenzelm@18039
   240
wenzelm@17110
   241
(* assumption *)
wenzelm@7419
   242
wenzelm@7419
   243
local
wenzelm@7419
   244
wenzelm@17110
   245
fun asm_tac ths =
wenzelm@17110
   246
  foldr (op APPEND') (K no_tac) (map (fn th => Tactic.rtac th THEN_ALL_NEW assume_tac) ths);
wenzelm@17110
   247
wenzelm@17110
   248
val refl_tac = SUBGOAL (fn (prop, i) =>
wenzelm@17110
   249
  if can Logic.dest_equals (Logic.strip_assums_concl prop)
wenzelm@17110
   250
  then Tactic.rtac Drule.reflexive_thm i else no_tac);
wenzelm@7419
   251
wenzelm@17110
   252
fun assm_tac ctxt =
wenzelm@17110
   253
  assume_tac APPEND'
wenzelm@17110
   254
  asm_tac (ProofContext.prems_of ctxt) APPEND'
wenzelm@17110
   255
  refl_tac;
wenzelm@17110
   256
wenzelm@17110
   257
fun assumption_tac ctxt [] = assm_tac ctxt
wenzelm@17110
   258
  | assumption_tac _ [fact] = asm_tac [fact]
wenzelm@17110
   259
  | assumption_tac _ _ = K no_tac;
wenzelm@7419
   260
wenzelm@7419
   261
in
wenzelm@7419
   262
wenzelm@17110
   263
fun assumption ctxt = METHOD (HEADGOAL o assumption_tac ctxt);
wenzelm@17356
   264
fun close immed ctxt = METHOD (K
wenzelm@17356
   265
  (FILTER Thm.no_prems ((if immed then ALLGOALS (assm_tac ctxt) else all_tac) THEN flexflex_tac)));
wenzelm@7419
   266
wenzelm@7419
   267
end;
wenzelm@7419
   268
wenzelm@7419
   269
wenzelm@17110
   270
(* rule etc. -- single-step refinements *)
wenzelm@12347
   271
wenzelm@17110
   272
val trace_rules = ref false;
wenzelm@12347
   273
wenzelm@17110
   274
fun trace ctxt rules =
wenzelm@17110
   275
  conditional (! trace_rules andalso not (null rules)) (fn () =>
wenzelm@17110
   276
    Pretty.big_list "rules:" (map (ProofContext.pretty_thm ctxt) rules)
wenzelm@17110
   277
    |> Pretty.string_of |> tracing);
wenzelm@12347
   278
wenzelm@12347
   279
local
wenzelm@12347
   280
wenzelm@10541
   281
fun gen_rule_tac tac rules [] i st = tac rules i st
wenzelm@12324
   282
  | gen_rule_tac tac rules facts i st =
wenzelm@17356
   283
      Seq.maps (fn rule => (tac o single) rule i st) (multi_resolves facts rules);
wenzelm@7130
   284
wenzelm@10744
   285
fun gen_arule_tac tac j rules facts =
wenzelm@10744
   286
  EVERY' (gen_rule_tac tac rules facts :: replicate j Tactic.assume_tac);
wenzelm@10744
   287
wenzelm@11785
   288
fun gen_some_rule_tac tac arg_rules ctxt facts = SUBGOAL (fn (goal, i) =>
wenzelm@11785
   289
  let
wenzelm@11785
   290
    val rules =
wenzelm@11785
   291
      if not (null arg_rules) then arg_rules
skalberg@15570
   292
      else List.concat (ContextRules.find_rules false facts goal ctxt)
wenzelm@12055
   293
  in trace ctxt rules; tac rules facts i end);
wenzelm@10309
   294
wenzelm@10744
   295
fun meth tac x = METHOD (HEADGOAL o tac x);
wenzelm@10744
   296
fun meth' tac x y = METHOD (HEADGOAL o tac x y);
wenzelm@8220
   297
wenzelm@7419
   298
in
wenzelm@7419
   299
wenzelm@10744
   300
val rule_tac = gen_rule_tac Tactic.resolve_tac;
wenzelm@10744
   301
val rule = meth rule_tac;
wenzelm@10744
   302
val some_rule_tac = gen_some_rule_tac rule_tac;
wenzelm@10744
   303
val some_rule = meth' some_rule_tac;
wenzelm@10744
   304
wenzelm@10744
   305
val erule = meth' (gen_arule_tac Tactic.eresolve_tac);
wenzelm@10744
   306
val drule = meth' (gen_arule_tac Tactic.dresolve_tac);
wenzelm@10744
   307
val frule = meth' (gen_arule_tac Tactic.forward_tac);
wenzelm@5824
   308
wenzelm@7419
   309
end;
wenzelm@7419
   310
wenzelm@7419
   311
nipkow@17587
   312
(* iprover -- intuitionistic proof search *)
wenzelm@17110
   313
wenzelm@17110
   314
local
wenzelm@17110
   315
wenzelm@17110
   316
val remdups_tac = SUBGOAL (fn (g, i) =>
wenzelm@17110
   317
  let val prems = Logic.strip_assums_hyp g in
wenzelm@17110
   318
    REPEAT_DETERM_N (length prems - length (gen_distinct op aconv prems))
wenzelm@17110
   319
    (Tactic.ematch_tac [Drule.remdups_rl] i THEN Tactic.eq_assume_tac i)
wenzelm@17110
   320
  end);
wenzelm@17110
   321
wenzelm@17110
   322
fun REMDUPS tac = tac THEN_ALL_NEW remdups_tac;
wenzelm@17110
   323
wenzelm@17110
   324
fun gen_eq_set e s1 s2 =
wenzelm@17110
   325
  length s1 = length s2 andalso
wenzelm@17110
   326
  gen_subset e (s1, s2) andalso gen_subset e (s2, s1);
wenzelm@17110
   327
wenzelm@17110
   328
val bires_tac = Tactic.biresolution_from_nets_tac ContextRules.orderlist;
wenzelm@17110
   329
wenzelm@17110
   330
fun safe_step_tac ctxt =
wenzelm@17110
   331
  ContextRules.Swrap ctxt
wenzelm@17110
   332
   (eq_assume_tac ORELSE'
wenzelm@17110
   333
    bires_tac true (ContextRules.netpair_bang ctxt));
wenzelm@8195
   334
wenzelm@17110
   335
fun unsafe_step_tac ctxt =
wenzelm@17110
   336
  ContextRules.wrap ctxt
wenzelm@17110
   337
   (assume_tac APPEND'
wenzelm@17110
   338
    bires_tac false (ContextRules.netpair_bang ctxt) APPEND'
wenzelm@17110
   339
    bires_tac false (ContextRules.netpair ctxt));
wenzelm@17110
   340
wenzelm@17110
   341
fun step_tac ctxt i =
wenzelm@17110
   342
  REPEAT_DETERM1 (REMDUPS (safe_step_tac ctxt) i) ORELSE
wenzelm@17110
   343
  REMDUPS (unsafe_step_tac ctxt) i;
wenzelm@17110
   344
wenzelm@17110
   345
fun intprover_tac ctxt gs d lim = SUBGOAL (fn (g, i) => if d > lim then no_tac else
wenzelm@17110
   346
  let
wenzelm@17110
   347
    val ps = Logic.strip_assums_hyp g;
wenzelm@17110
   348
    val c = Logic.strip_assums_concl g;
wenzelm@17110
   349
  in
wenzelm@17110
   350
    if gen_mem (fn ((ps1, c1), (ps2, c2)) =>
wenzelm@17110
   351
      c1 aconv c2 andalso gen_eq_set op aconv ps1 ps2) ((ps, c), gs) then no_tac
wenzelm@17110
   352
    else (step_tac ctxt THEN_ALL_NEW intprover_tac ctxt ((ps, c) :: gs) (d + 1) lim) i
wenzelm@17110
   353
  end);
wenzelm@17110
   354
wenzelm@17110
   355
in
wenzelm@17110
   356
nipkow@17587
   357
fun iprover_tac ctxt opt_lim =
wenzelm@17110
   358
  SELECT_GOAL (DEEPEN (2, if_none opt_lim 20) (intprover_tac ctxt [] 0) 4 1);
wenzelm@17110
   359
wenzelm@17110
   360
end;
wenzelm@8195
   361
wenzelm@8195
   362
wenzelm@17110
   363
(* rule_tac etc. -- refer to dynamic goal state!! *)
wenzelm@12119
   364
ballarin@14174
   365
fun bires_inst_tac bires_flag ctxt insts thm =
ballarin@14174
   366
  let
wenzelm@17110
   367
    val thy = ProofContext.theory_of ctxt;
ballarin@14174
   368
    (* Separate type and term insts *)
ballarin@14174
   369
    fun has_type_var ((x, _), _) = (case Symbol.explode x of
ballarin@14174
   370
          "'"::cs => true | cs => false);
skalberg@15570
   371
    val Tinsts = List.filter has_type_var insts;
ballarin@14174
   372
    val tinsts = filter_out has_type_var insts;
ballarin@14174
   373
    (* Tactic *)
ballarin@14174
   374
    fun tac i st =
ballarin@14174
   375
      let
ballarin@14174
   376
        (* Preprocess state: extract environment information:
ballarin@14174
   377
           - variables and their types
ballarin@14174
   378
           - type variables and their sorts
ballarin@14174
   379
           - parameters and their types *)
ballarin@14174
   380
        val (types, sorts) = types_sorts st;
ballarin@14174
   381
    (* Process type insts: Tinsts_env *)
ballarin@14174
   382
    fun absent xi = error
wenzelm@14718
   383
          ("No such variable in theorem: " ^ Syntax.string_of_vname xi);
ballarin@14174
   384
    val (rtypes, rsorts) = types_sorts thm;
ballarin@14174
   385
    fun readT (xi, s) =
skalberg@15531
   386
        let val S = case rsorts xi of SOME S => S | NONE => absent xi;
wenzelm@17110
   387
            val T = Sign.read_typ (thy, sorts) s;
berghofe@15798
   388
            val U = TVar (xi, S);
wenzelm@17110
   389
        in if Sign.typ_instance thy (T, U) then (U, T)
ballarin@14174
   390
           else error
ballarin@14174
   391
             ("Instantiation of " ^ Syntax.string_of_vname xi ^ " fails")
ballarin@14174
   392
        end;
ballarin@14174
   393
    val Tinsts_env = map readT Tinsts;
ballarin@14174
   394
    (* Preprocess rule: extract vars and their types, apply Tinsts *)
ballarin@14174
   395
    fun get_typ xi =
ballarin@14174
   396
      (case rtypes xi of
berghofe@15798
   397
           SOME T => typ_subst_atomic Tinsts_env T
skalberg@15531
   398
         | NONE => absent xi);
ballarin@14174
   399
    val (xis, ss) = Library.split_list tinsts;
ballarin@14174
   400
    val Ts = map get_typ xis;
wenzelm@14718
   401
        val (_, _, Bi, _) = dest_state(st,i)
wenzelm@14718
   402
        val params = Logic.strip_params Bi
wenzelm@14718
   403
                             (* params of subgoal i as string typ pairs *)
wenzelm@14718
   404
        val params = rev(Term.rename_wrt_term Bi params)
wenzelm@14718
   405
                           (* as they are printed: bound variables with *)
ballarin@14508
   406
                           (* the same name are renamed during printing *)
haftmann@17314
   407
        fun types' (a, ~1) = (case AList.lookup (op =) params a of
skalberg@15531
   408
                NONE => types (a, ~1)
ballarin@14174
   409
              | some => some)
ballarin@14174
   410
          | types' xi = types xi;
wenzelm@15973
   411
        fun internal x = is_some (types' (x, ~1));
wenzelm@15703
   412
        val used = Drule.add_used thm (Drule.add_used st []);
wenzelm@14718
   413
        val (ts, envT) =
wenzelm@14718
   414
          ProofContext.read_termTs_schematic ctxt internal types' sorts used (ss ~~ Ts);
berghofe@15798
   415
        val envT' = map (fn (ixn, T) =>
wenzelm@15973
   416
          (TVar (ixn, the (rsorts ixn)), T)) envT @ Tinsts_env;
wenzelm@14718
   417
        val cenv =
wenzelm@14718
   418
          map
wenzelm@14718
   419
            (fn (xi, t) =>
wenzelm@17110
   420
              pairself (Thm.cterm_of thy) (Var (xi, fastype_of t), t))
wenzelm@14718
   421
            (gen_distinct
wenzelm@14718
   422
              (fn ((x1, t1), (x2, t2)) => x1 = x2 andalso t1 aconv t2)
wenzelm@14718
   423
              (xis ~~ ts));
wenzelm@14718
   424
        (* Lift and instantiate rule *)
wenzelm@14718
   425
        val {maxidx, ...} = rep_thm st;
wenzelm@14718
   426
        val paramTs = map #2 params
wenzelm@14718
   427
        and inc = maxidx+1
wenzelm@14718
   428
        fun liftvar (Var ((a,j), T)) =
wenzelm@16876
   429
              Var((a, j+inc), paramTs ---> Logic.incr_tvar inc T)
wenzelm@14718
   430
          | liftvar t = raise TERM("Variable expected", [t]);
wenzelm@14718
   431
        fun liftterm t = list_abs_free
wenzelm@14718
   432
              (params, Logic.incr_indexes(paramTs,inc) t)
wenzelm@14718
   433
        fun liftpair (cv,ct) =
wenzelm@14718
   434
              (cterm_fun liftvar cv, cterm_fun liftterm ct)
wenzelm@17110
   435
        val lifttvar = pairself (ctyp_of thy o Logic.incr_tvar inc);
wenzelm@14718
   436
        val rule = Drule.instantiate
berghofe@15798
   437
              (map lifttvar envT', map liftpair cenv)
wenzelm@18145
   438
              (Thm.lift_rule (Thm.cprem_of st i) thm)
ballarin@14174
   439
      in
wenzelm@14718
   440
        if i > nprems_of st then no_tac st
wenzelm@14718
   441
        else st |>
wenzelm@14718
   442
          compose_tac (bires_flag, rule, nprems_of thm) i
ballarin@14174
   443
      end
wenzelm@14718
   444
           handle TERM (msg,_)   => (warning msg; no_tac st)
wenzelm@14718
   445
                | THM  (msg,_,_) => (warning msg; no_tac st);
ballarin@14174
   446
  in
ballarin@14174
   447
    tac
ballarin@14174
   448
  end;
wenzelm@8238
   449
wenzelm@17110
   450
local
wenzelm@17110
   451
ballarin@14174
   452
fun gen_inst _ tac _ (quant, ([], thms)) =
ballarin@14174
   453
      METHOD (fn facts => quant (insert_tac facts THEN' tac thms))
ballarin@14174
   454
  | gen_inst inst_tac _ ctxt (quant, (insts, [thm])) =
ballarin@14174
   455
      METHOD (fn facts =>
ballarin@14174
   456
        quant (insert_tac facts THEN' inst_tac ctxt insts thm))
ballarin@14174
   457
  | gen_inst _ _ _ _ = error "Cannot have instantiations with multiple rules";
wenzelm@14718
   458
ballarin@14174
   459
(* Preserve Var indexes of rl; increment revcut_rl instead.
ballarin@14174
   460
   Copied from tactic.ML *)
ballarin@14174
   461
fun make_elim_preserve rl =
ballarin@14174
   462
  let val {maxidx,...} = rep_thm rl
wenzelm@17110
   463
      fun cvar xi = cterm_of ProtoPure.thy (Var(xi,propT));
ballarin@14174
   464
      val revcut_rl' =
ballarin@14174
   465
          instantiate ([],  [(cvar("V",0), cvar("V",maxidx+1)),
ballarin@14174
   466
                             (cvar("W",0), cvar("W",maxidx+1))]) revcut_rl
ballarin@14174
   467
      val arg = (false, rl, nprems_of rl)
ballarin@14174
   468
      val [th] = Seq.list_of (bicompose false arg 1 revcut_rl')
ballarin@14174
   469
  in  th  end
ballarin@14174
   470
  handle Bind => raise THM("make_elim_preserve", 1, [rl]);
wenzelm@8238
   471
wenzelm@17110
   472
in
wenzelm@17110
   473
wenzelm@17110
   474
val res_inst_meth = gen_inst (bires_inst_tac false) Tactic.resolve_tac;
wenzelm@17110
   475
wenzelm@17110
   476
val eres_inst_meth = gen_inst (bires_inst_tac true) Tactic.eresolve_tac;
wenzelm@17110
   477
ballarin@14174
   478
val cut_inst_meth =
ballarin@14174
   479
  gen_inst
wenzelm@17110
   480
    (fn ctxt => fn insts => bires_inst_tac false ctxt insts o make_elim_preserve)
ballarin@14174
   481
    Tactic.cut_rules_tac;
ballarin@14174
   482
ballarin@14174
   483
val dres_inst_meth =
ballarin@14174
   484
  gen_inst
wenzelm@17110
   485
    (fn ctxt => fn insts => bires_inst_tac true ctxt insts o make_elim_preserve)
ballarin@14174
   486
    Tactic.dresolve_tac;
ballarin@14174
   487
ballarin@14174
   488
val forw_inst_meth =
ballarin@14174
   489
  gen_inst
ballarin@14174
   490
    (fn ctxt => fn insts => fn rule =>
ballarin@14174
   491
       bires_inst_tac false ctxt insts (make_elim_preserve rule) THEN'
ballarin@14174
   492
       assume_tac)
ballarin@14174
   493
    Tactic.forward_tac;
ballarin@14174
   494
ballarin@14174
   495
fun subgoal_tac ctxt sprop =
wenzelm@17110
   496
  DETERM o bires_inst_tac false ctxt [(("psi", 0), sprop)] cut_rl;
ballarin@14174
   497
ballarin@14174
   498
fun subgoals_tac ctxt sprops = EVERY' (map (subgoal_tac ctxt) sprops);
ballarin@14174
   499
ballarin@14174
   500
fun thin_tac ctxt s =
ballarin@14174
   501
  bires_inst_tac true ctxt [(("V", 0), s)] thin_rl;
wenzelm@8238
   502
wenzelm@17110
   503
end;
wenzelm@8329
   504
wenzelm@8329
   505
wenzelm@8351
   506
(* ML tactics *)
wenzelm@8351
   507
wenzelm@17110
   508
val tactic_ref = ref ((fn _ => raise Match): ProofContext.context -> thm list -> tactic);
wenzelm@8351
   509
fun set_tactic f = tactic_ref := f;
wenzelm@8351
   510
wenzelm@8351
   511
fun tactic txt ctxt = METHOD (fn facts =>
wenzelm@9631
   512
  (Context.use_mltext
wenzelm@17110
   513
    ("let fun tactic (ctxt: ProofContext.context) (facts: thm list) : tactic = \
wenzelm@16500
   514
       \let val thm = ProofContext.get_thm_closure ctxt o PureThy.Name\n\
wenzelm@16500
   515
       \  and thms = ProofContext.get_thms_closure ctxt o PureThy.Name in\n"
wenzelm@16500
   516
       ^ txt ^
wenzelm@16500
   517
       "\nend in Method.set_tactic tactic end")
skalberg@15531
   518
    false NONE;
skalberg@15531
   519
    Context.setmp (SOME (ProofContext.theory_of ctxt)) (! tactic_ref ctxt) facts));
wenzelm@8351
   520
wenzelm@8351
   521
wenzelm@5824
   522
wenzelm@17110
   523
(** method syntax **)
wenzelm@17110
   524
wenzelm@17110
   525
(* method text *)
wenzelm@17110
   526
wenzelm@17110
   527
type src = Args.src;
wenzelm@5824
   528
wenzelm@17110
   529
datatype text =
wenzelm@17110
   530
  Basic of (ProofContext.context -> method) |
wenzelm@17110
   531
  Source of src |
wenzelm@17110
   532
  Then of text list |
wenzelm@17110
   533
  Orelse of text list |
wenzelm@17110
   534
  Try of text |
wenzelm@17110
   535
  Repeat1 of text;
wenzelm@17110
   536
wenzelm@17857
   537
val primitive_text = Basic o K o SIMPLE_METHOD o PRIMITIVE;
wenzelm@17857
   538
val succeed_text = Basic (K succeed);
wenzelm@17110
   539
val default_text = Source (Args.src (("default", []), Position.none));
wenzelm@17110
   540
val this_text = Basic (K this);
wenzelm@17110
   541
val done_text = Basic (K (SIMPLE_METHOD all_tac));
wenzelm@17356
   542
val sorry_text = Basic o cheating;
wenzelm@17110
   543
wenzelm@17356
   544
fun finish_text (NONE, immed) = Basic (close immed)
wenzelm@17356
   545
  | finish_text (SOME txt, immed) = Then [txt, Basic (close immed)];
wenzelm@17110
   546
wenzelm@17110
   547
wenzelm@17110
   548
(* method definitions *)
wenzelm@5824
   549
wenzelm@16448
   550
structure MethodsData = TheoryDataFun
wenzelm@16448
   551
(struct
wenzelm@5824
   552
  val name = "Isar/methods";
wenzelm@17110
   553
  type T = (((src -> ProofContext.context -> method) * string) * stamp) NameSpace.table;
wenzelm@5824
   554
wenzelm@16347
   555
  val empty = NameSpace.empty_table;
wenzelm@6546
   556
  val copy = I;
wenzelm@16448
   557
  val extend = I;
haftmann@17496
   558
  fun merge _ tables = NameSpace.merge_tables (eq_snd (op =)) tables handle Symtab.DUPS dups =>
wenzelm@16347
   559
    error ("Attempt to merge different versions of method(s) " ^ commas_quote dups);
wenzelm@5824
   560
wenzelm@16347
   561
  fun print _ meths =
wenzelm@5824
   562
    let
wenzelm@5824
   563
      fun prt_meth (name, ((_, comment), _)) = Pretty.block
wenzelm@6849
   564
        [Pretty.str (name ^ ":"), Pretty.brk 2, Pretty.str comment];
wenzelm@5824
   565
    in
wenzelm@16347
   566
      [Pretty.big_list "methods:" (map prt_meth (NameSpace.extern_table meths))]
wenzelm@9222
   567
      |> Pretty.chunks |> Pretty.writeln
wenzelm@5824
   568
    end;
wenzelm@16448
   569
end);
wenzelm@5824
   570
wenzelm@15801
   571
val _ = Context.add_setup [MethodsData.init];
wenzelm@5824
   572
val print_methods = MethodsData.print;
wenzelm@7611
   573
wenzelm@5824
   574
wenzelm@5824
   575
(* get methods *)
wenzelm@5824
   576
wenzelm@5916
   577
exception METHOD_FAIL of (string * Position.T) * exn;
wenzelm@5916
   578
wenzelm@5824
   579
fun method thy =
wenzelm@5824
   580
  let
wenzelm@16347
   581
    val (space, meths) = MethodsData.get thy;
wenzelm@5884
   582
    fun meth src =
wenzelm@5884
   583
      let
wenzelm@5884
   584
        val ((raw_name, _), pos) = Args.dest_src src;
wenzelm@5884
   585
        val name = NameSpace.intern space raw_name;
wenzelm@5884
   586
      in
wenzelm@17412
   587
        (case Symtab.lookup meths name of
skalberg@15531
   588
          NONE => error ("Unknown proof method: " ^ quote name ^ Position.str_of pos)
skalberg@15531
   589
        | SOME ((mth, _), _) => transform_failure (curry METHOD_FAIL (name, pos)) (mth src))
wenzelm@5824
   590
      end;
wenzelm@5824
   591
  in meth end;
wenzelm@5824
   592
wenzelm@5824
   593
wenzelm@17110
   594
(* add method *)
wenzelm@5824
   595
wenzelm@5824
   596
fun add_methods raw_meths thy =
wenzelm@5824
   597
  let
wenzelm@16145
   598
    val new_meths = raw_meths |> map (fn (name, f, comment) =>
wenzelm@16347
   599
      (name, ((f, comment), stamp ())));
wenzelm@5824
   600
wenzelm@17110
   601
    fun add meths = NameSpace.extend_table (Sign.naming_of thy) (meths, new_meths)
wenzelm@16347
   602
      handle Symtab.DUPS dups =>
wenzelm@16347
   603
        error ("Duplicate declaration of method(s) " ^ commas_quote dups);
wenzelm@16347
   604
  in MethodsData.map add thy end;
wenzelm@5824
   605
wenzelm@9194
   606
val add_method = add_methods o Library.single;
wenzelm@9194
   607
wenzelm@5824
   608
fun Method name meth cmt = Context.>> (add_methods [(name, meth, cmt)]);
wenzelm@5824
   609
wenzelm@5824
   610
wenzelm@17356
   611
(* method_setup *)
wenzelm@17356
   612
wenzelm@17356
   613
fun method_setup (name, txt, cmt) =
wenzelm@17356
   614
  Context.use_let
wenzelm@17356
   615
    "val thm = PureThy.get_thm_closure (Context.the_context ()) o PureThy.Name;\n\
wenzelm@17356
   616
    \val thms = PureThy.get_thms_closure (Context.the_context ()) o PureThy.Name;\n\
wenzelm@17356
   617
    \val method: bstring * (Method.src -> ProofContext.context -> Proof.method) * string"
wenzelm@17356
   618
    "Method.add_method method"
wenzelm@17356
   619
    ("(" ^ Library.quote name ^ ", " ^ txt ^ ", " ^ Library.quote cmt ^ ")");
wenzelm@17356
   620
wenzelm@17356
   621
wenzelm@5884
   622
wenzelm@17110
   623
(** concrete syntax **)
wenzelm@5824
   624
wenzelm@5884
   625
(* basic *)
wenzelm@5884
   626
wenzelm@17110
   627
fun syntax (scan:
wenzelm@17110
   628
    (ProofContext.context * Args.T list -> 'a * (ProofContext.context * Args.T list))) =
wenzelm@5884
   629
  Args.syntax "method" scan;
wenzelm@5824
   630
wenzelm@17110
   631
fun simple_args scan f src ctxt : method =
wenzelm@8351
   632
  #2 (syntax (Scan.lift (scan >> (fn x => f x ctxt))) src ctxt);
wenzelm@8351
   633
wenzelm@17110
   634
fun ctxt_args (f: ProofContext.context -> method) src ctxt =
wenzelm@8282
   635
  #2 (syntax (Scan.succeed (f ctxt)) src ctxt);
wenzelm@7555
   636
wenzelm@7555
   637
fun no_args m = ctxt_args (K m);
wenzelm@5884
   638
wenzelm@5884
   639
wenzelm@5884
   640
(* sections *)
wenzelm@5824
   641
wenzelm@17110
   642
type modifier = (ProofContext.context -> ProofContext.context) * ProofContext.context attribute;
wenzelm@7268
   643
wenzelm@7268
   644
local
wenzelm@7268
   645
wenzelm@8381
   646
fun sect ss = Scan.first (map Scan.lift ss);
wenzelm@5884
   647
fun thms ss = Scan.unless (sect ss) Attrib.local_thms;
skalberg@15570
   648
fun thmss ss = Scan.repeat (thms ss) >> List.concat;
wenzelm@5884
   649
wenzelm@7268
   650
fun apply (f, att) (ctxt, ths) = Thm.applys_attributes ((f ctxt, ths), [att]);
wenzelm@5824
   651
wenzelm@7268
   652
fun section ss = (sect ss -- thmss ss) :-- (fn (m, ths) => Scan.depend (fn ctxt =>
wenzelm@7268
   653
  Scan.succeed (apply m (ctxt, ths)))) >> #2;
wenzelm@5884
   654
wenzelm@7601
   655
fun sectioned args ss = args -- Scan.repeat (section ss);
wenzelm@5884
   656
wenzelm@7268
   657
in
wenzelm@5824
   658
wenzelm@5884
   659
fun sectioned_args args ss f src ctxt =
wenzelm@8282
   660
  let val (ctxt', (x, _)) = syntax (sectioned args ss) src ctxt
wenzelm@5921
   661
  in f x ctxt' end;
wenzelm@5884
   662
wenzelm@7601
   663
fun bang_sectioned_args ss f = sectioned_args Args.bang_facts ss f;
wenzelm@9777
   664
fun bang_sectioned_args' ss scan f =
wenzelm@9777
   665
  sectioned_args (Args.bang_facts -- scan >> swap) ss (uncurry f);
wenzelm@7601
   666
fun only_sectioned_args ss f = sectioned_args (Scan.succeed ()) ss (fn () => f);
wenzelm@7268
   667
wenzelm@8093
   668
fun thms_ctxt_args f = sectioned_args (thmss []) [] f;
wenzelm@8093
   669
fun thms_args f = thms_ctxt_args (K o f);
wenzelm@9706
   670
fun thm_args f = thms_args (fn [thm] => f thm | _ => error "Single theorem expected");
wenzelm@5824
   671
wenzelm@7268
   672
end;
wenzelm@7268
   673
wenzelm@5824
   674
nipkow@17587
   675
(* iprover syntax *)
wenzelm@12347
   676
wenzelm@12347
   677
local
wenzelm@12347
   678
wenzelm@12347
   679
val introN = "intro";
wenzelm@12347
   680
val elimN = "elim";
wenzelm@12347
   681
val destN = "dest";
wenzelm@12347
   682
val ruleN = "rule";
wenzelm@12347
   683
wenzelm@12347
   684
fun modifier name kind kind' att =
skalberg@15531
   685
  Args.$$$ name |-- (kind >> K NONE || kind' |-- Args.nat --| Args.colon >> SOME)
wenzelm@17110
   686
    >> (pair (I: ProofContext.context -> ProofContext.context) o att);
wenzelm@12347
   687
nipkow@17587
   688
val iprover_modifiers =
wenzelm@12384
   689
 [modifier destN Args.bang_colon Args.bang ContextRules.dest_bang_local,
wenzelm@12350
   690
  modifier destN Args.colon (Scan.succeed ()) ContextRules.dest_local,
wenzelm@12350
   691
  modifier elimN Args.bang_colon Args.bang ContextRules.elim_bang_local,
wenzelm@12350
   692
  modifier elimN Args.colon (Scan.succeed ()) ContextRules.elim_local,
wenzelm@12350
   693
  modifier introN Args.bang_colon Args.bang ContextRules.intro_bang_local,
wenzelm@12350
   694
  modifier introN Args.colon (Scan.succeed ()) ContextRules.intro_local,
wenzelm@12350
   695
  Args.del -- Args.colon >> K (I, ContextRules.rule_del_local)];
wenzelm@12347
   696
wenzelm@12347
   697
in
wenzelm@12347
   698
nipkow@17587
   699
fun iprover_args m = bang_sectioned_args' iprover_modifiers (Scan.lift (Scan.option Args.nat)) m;
wenzelm@12347
   700
nipkow@17587
   701
fun iprover_meth n prems ctxt = METHOD (fn facts =>
nipkow@17587
   702
  HEADGOAL (insert_tac (prems @ facts) THEN' ObjectLogic.atomize_tac THEN' iprover_tac ctxt n));
wenzelm@12347
   703
wenzelm@12347
   704
end;
wenzelm@12347
   705
wenzelm@12347
   706
wenzelm@9539
   707
(* tactic syntax *)
wenzelm@8238
   708
wenzelm@10744
   709
fun nat_thms_args f = uncurry f oo
wenzelm@10744
   710
  (#2 oo syntax (Scan.lift (Scan.optional (Args.parens Args.nat) 0) -- Attrib.local_thmss));
wenzelm@10744
   711
wenzelm@8238
   712
val insts =
wenzelm@9539
   713
  Scan.optional
wenzelm@9565
   714
    (Args.enum1 "and" (Scan.lift (Args.name -- (Args.$$$ "=" |-- Args.!!! Args.name))) --|
wenzelm@9565
   715
      Scan.lift (Args.$$$ "in")) [] -- Attrib.local_thmss;
wenzelm@8238
   716
wenzelm@12119
   717
fun inst_args f src ctxt = f ctxt (#2 (syntax (Args.goal_spec HEADGOAL -- insts) src ctxt));
wenzelm@8537
   718
ballarin@14174
   719
val insts_var =
ballarin@14174
   720
  Scan.optional
ballarin@14174
   721
    (Args.enum1 "and" (Scan.lift (Args.var -- (Args.$$$ "=" |-- Args.!!! Args.name))) --|
ballarin@14174
   722
      Scan.lift (Args.$$$ "in")) [] -- Attrib.local_thmss;
ballarin@14174
   723
wenzelm@17110
   724
fun inst_args_var f src ctxt =
wenzelm@17110
   725
  f ctxt (#2 (syntax (Args.goal_spec HEADGOAL -- insts_var) src ctxt));
wenzelm@8537
   726
wenzelm@12119
   727
fun goal_args' args tac src ctxt = #2 (syntax (Args.goal_spec HEADGOAL -- args >>
ballarin@14215
   728
  (fn (quant, s) => SIMPLE_METHOD' quant (tac s))) src ctxt);
wenzelm@8537
   729
wenzelm@9539
   730
fun goal_args args tac = goal_args' (Scan.lift args) tac;
wenzelm@8238
   731
ballarin@14174
   732
fun goal_args_ctxt' args tac src ctxt =
ballarin@14174
   733
  #2 (syntax (Args.goal_spec HEADGOAL -- args >>
ballarin@14174
   734
  (fn (quant, s) => SIMPLE_METHOD' quant (tac ctxt s))) src ctxt);
wenzelm@8238
   735
ballarin@14174
   736
fun goal_args_ctxt args tac = goal_args_ctxt' (Scan.lift args) tac;
wenzelm@5824
   737
wenzelm@14718
   738
wenzelm@9539
   739
(* misc tactic emulations *)
wenzelm@9539
   740
ballarin@14174
   741
val subgoal_meth = goal_args_ctxt (Scan.repeat1 Args.name) subgoals_tac;
ballarin@14174
   742
val thin_meth = goal_args_ctxt Args.name thin_tac;
wenzelm@9539
   743
val rename_meth = goal_args (Scan.repeat1 Args.name) Tactic.rename_params_tac;
wenzelm@9631
   744
val rotate_meth = goal_args (Scan.optional Args.int 1) Tactic.rotate_tac;
wenzelm@9539
   745
wenzelm@9539
   746
wenzelm@5824
   747
(* pure_methods *)
wenzelm@5824
   748
wenzelm@5824
   749
val pure_methods =
wenzelm@5824
   750
 [("fail", no_args fail, "force failure"),
wenzelm@5824
   751
  ("succeed", no_args succeed, "succeed"),
wenzelm@9587
   752
  ("-", no_args insert_facts, "do nothing (insert current facts only)"),
wenzelm@9539
   753
  ("insert", thms_args insert, "insert theorems, ignoring facts (improper)"),
wenzelm@16145
   754
  ("unfold", thms_args unfold_meth, "unfold definitions"),
wenzelm@12384
   755
  ("intro", thms_args intro, "repeatedly apply introduction rules"),
wenzelm@12384
   756
  ("elim", thms_args elim, "repeatedly apply elimination rules"),
wenzelm@16145
   757
  ("fold", thms_args fold_meth, "fold definitions"),
wenzelm@12829
   758
  ("atomize", (atomize o #2) oo syntax (Args.mode "full"),
wenzelm@11962
   759
    "present local premises as object-level statements"),
nipkow@17587
   760
  ("iprover", iprover_args iprover_meth, "intuitionistic proof search"),
wenzelm@12384
   761
  ("rule", thms_ctxt_args some_rule, "apply some intro/elim rule"),
wenzelm@10744
   762
  ("erule", nat_thms_args erule, "apply rule in elimination manner (improper)"),
wenzelm@10744
   763
  ("drule", nat_thms_args drule, "apply rule in destruct manner (improper)"),
wenzelm@10744
   764
  ("frule", nat_thms_args frule, "apply rule in forward manner (improper)"),
wenzelm@8195
   765
  ("this", no_args this, "apply current facts as rules"),
wenzelm@18039
   766
  ("fact", thms_ctxt_args fact, "composition by facts from context"),
wenzelm@8238
   767
  ("assumption", ctxt_args assumption, "proof by assumption, preferring facts"),
ballarin@14174
   768
  ("rule_tac", inst_args_var res_inst_meth, "apply rule (dynamic instantiation)"),
ballarin@14174
   769
  ("erule_tac", inst_args_var eres_inst_meth, "apply rule in elimination manner (dynamic instantiation)"),
ballarin@14174
   770
  ("drule_tac", inst_args_var dres_inst_meth, "apply rule in destruct manner (dynamic instantiation)"),
ballarin@14174
   771
  ("frule_tac", inst_args_var forw_inst_meth, "apply rule in forward manner (dynamic instantiation)"),
ballarin@14174
   772
  ("cut_tac", inst_args_var cut_inst_meth, "cut rule (dynamic instantiation)"),
ballarin@14174
   773
  ("subgoal_tac", subgoal_meth, "insert subgoal (dynamic instantiation)"),
ballarin@14174
   774
  ("thin_tac", thin_meth, "remove premise (dynamic instantiation)"),
ballarin@14174
   775
  ("rename_tac", rename_meth, "rename parameters of goal (dynamic instantiation)"),
wenzelm@9631
   776
  ("rotate_tac", rotate_meth, "rotate assumptions of goal"),
wenzelm@8351
   777
  ("tactic", simple_args Args.name tactic, "ML tactic as proof method")];
wenzelm@5824
   778
wenzelm@15801
   779
val _ = Context.add_setup [add_methods pure_methods];
wenzelm@5824
   780
wenzelm@5824
   781
wenzelm@16145
   782
(*final declarations of this structure!*)
wenzelm@16145
   783
val unfold = unfold_meth;
wenzelm@16145
   784
val fold = fold_meth;
wenzelm@16145
   785
wenzelm@5824
   786
end;
wenzelm@5824
   787
wenzelm@5824
   788
structure BasicMethod: BASIC_METHOD = Method;
wenzelm@5824
   789
open BasicMethod;