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