src/Pure/Isar/method.ML
author kleing
Wed Feb 11 14:48:14 2009 +1100 (2009-02-11)
changeset 29857 2cc976ed8a3c
parent 29301 2b845381ba6a
child 30165 6ee87f67d9cd
child 30240 5b25fee0362c
permissions -rw-r--r--
FindTheorems: add solves feature; tidy up const name subsettin; patch by Timothy Bourke
wenzelm@5824
     1
(*  Title:      Pure/Isar/method.ML
wenzelm@5824
     2
    Author:     Markus Wenzel, TU Muenchen
wenzelm@5824
     3
wenzelm@17110
     4
Isar proof methods.
wenzelm@5824
     5
*)
wenzelm@5824
     6
wenzelm@5824
     7
signature BASIC_METHOD =
wenzelm@5824
     8
sig
wenzelm@17110
     9
  val FINDGOAL: (int -> thm -> 'a Seq.seq) -> thm -> 'a Seq.seq
wenzelm@17110
    10
  val HEADGOAL: (int -> thm -> 'a Seq.seq) -> thm -> 'a Seq.seq
wenzelm@17110
    11
  type method
wenzelm@11731
    12
  val trace_rules: bool ref
wenzelm@5824
    13
end;
wenzelm@5824
    14
wenzelm@5824
    15
signature METHOD =
wenzelm@5824
    16
sig
wenzelm@5824
    17
  include BASIC_METHOD
wenzelm@25957
    18
  val apply: Position.T -> (Proof.context -> method) -> Proof.context -> thm list -> cases_tactic
wenzelm@18227
    19
  val RAW_METHOD_CASES: (thm list -> cases_tactic) -> method
wenzelm@17110
    20
  val RAW_METHOD: (thm list -> tactic) -> method
wenzelm@18227
    21
  val METHOD_CASES: (thm list -> cases_tactic) -> method
wenzelm@17110
    22
  val METHOD: (thm list -> tactic) -> method
wenzelm@17110
    23
  val fail: method
wenzelm@17110
    24
  val succeed: method
wenzelm@17110
    25
  val insert_tac: thm list -> int -> tactic
wenzelm@17110
    26
  val insert: thm list -> method
wenzelm@17110
    27
  val insert_facts: method
wenzelm@17110
    28
  val SIMPLE_METHOD: tactic -> method
wenzelm@21592
    29
  val SIMPLE_METHOD': (int -> tactic) -> method
wenzelm@21592
    30
  val SIMPLE_METHOD'': ((int -> tactic) -> tactic) -> (int -> tactic) -> method
wenzelm@17110
    31
  val defer: int option -> method
wenzelm@17110
    32
  val prefer: int -> method
wenzelm@20289
    33
  val cheating: bool -> Proof.context -> method
wenzelm@17110
    34
  val intro: thm list -> method
wenzelm@17110
    35
  val elim: thm list -> method
wenzelm@20289
    36
  val unfold: thm list -> Proof.context -> method
wenzelm@20289
    37
  val fold: thm list -> Proof.context -> method
wenzelm@17110
    38
  val atomize: bool -> method
wenzelm@17110
    39
  val this: method
wenzelm@20289
    40
  val fact: thm list -> Proof.context -> method
kleing@29857
    41
  val assumption_tac: Proof.context -> int -> tactic
wenzelm@20289
    42
  val assumption: Proof.context -> method
wenzelm@20289
    43
  val close: bool -> Proof.context -> method
wenzelm@20289
    44
  val trace: Proof.context -> thm list -> unit
wenzelm@6091
    45
  val rule_tac: thm list -> thm list -> int -> tactic
wenzelm@20289
    46
  val some_rule_tac: thm list -> Proof.context -> thm list -> int -> tactic
haftmann@25270
    47
  val intros_tac: thm list -> thm list -> 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
wenzelm@20289
    52
  val iprover_tac: Proof.context -> int option -> int -> tactic
wenzelm@27235
    53
  val set_tactic: (thm list -> tactic) -> Proof.context -> Proof.context
wenzelm@26385
    54
  val tactic: string * Position.T -> Proof.context -> method
wenzelm@27235
    55
  val raw_tactic: string * Position.T -> Proof.context -> method
wenzelm@27729
    56
  type src = Args.src
wenzelm@5824
    57
  datatype text =
wenzelm@23349
    58
    Basic of (Proof.context -> method) * Position.T |
wenzelm@15703
    59
    Source of src |
wenzelm@20030
    60
    Source_i of src |
wenzelm@5824
    61
    Then of text list |
wenzelm@5824
    62
    Orelse of text list |
wenzelm@5824
    63
    Try of text |
wenzelm@19186
    64
    Repeat1 of text |
wenzelm@19186
    65
    SelectGoals of int * text
wenzelm@17857
    66
  val primitive_text: (thm -> thm) -> text
wenzelm@17857
    67
  val succeed_text: text
wenzelm@17110
    68
  val default_text: text
wenzelm@17110
    69
  val this_text: text
wenzelm@17110
    70
  val done_text: text
wenzelm@17356
    71
  val sorry_text: bool -> text
wenzelm@23349
    72
  val finish_text: text option * bool -> Position.T -> text
wenzelm@27729
    73
  val print_methods: theory -> unit
wenzelm@26892
    74
  val intern: theory -> xstring -> string
wenzelm@26892
    75
  val defined: theory -> string -> bool
wenzelm@20289
    76
  val method: theory -> src -> Proof.context -> method
wenzelm@20289
    77
  val method_i: theory -> src -> Proof.context -> method
wenzelm@20289
    78
  val add_methods: (bstring * (src -> Proof.context -> method) * string) list
wenzelm@17110
    79
    -> theory -> theory
wenzelm@20289
    80
  val add_method: bstring * (src -> Proof.context -> method) * string
wenzelm@17110
    81
    -> theory -> theory
wenzelm@26385
    82
  val method_setup: bstring -> string * Position.T -> string -> theory -> theory
wenzelm@18999
    83
  val syntax: (Context.generic * Args.T list -> 'a * (Context.generic * Args.T list))
haftmann@21879
    84
    -> src -> Proof.context -> 'a * Proof.context
wenzelm@17110
    85
  val simple_args: (Args.T list -> 'a * Args.T list)
wenzelm@20289
    86
    -> ('a -> Proof.context -> method) -> src -> Proof.context -> method
wenzelm@20289
    87
  val ctxt_args: (Proof.context -> method) -> src -> Proof.context -> method
wenzelm@20289
    88
  val no_args: method -> src -> Proof.context -> method
wenzelm@17110
    89
  type modifier
wenzelm@18999
    90
  val sectioned_args: (Context.generic * Args.T list -> 'a * (Context.generic * Args.T list)) ->
wenzelm@17110
    91
    (Args.T list -> modifier * Args.T list) list ->
wenzelm@20289
    92
    ('a -> Proof.context -> 'b) -> src -> Proof.context -> 'b
wenzelm@17110
    93
  val bang_sectioned_args:
wenzelm@17110
    94
    (Args.T list -> modifier * Args.T list) list ->
wenzelm@20289
    95
    (thm list -> Proof.context -> 'a) -> src -> Proof.context -> 'a
wenzelm@17110
    96
  val bang_sectioned_args':
wenzelm@17110
    97
    (Args.T list -> modifier * Args.T list) list ->
wenzelm@18999
    98
    (Context.generic * Args.T list -> 'a * (Context.generic * Args.T list)) ->
wenzelm@20289
    99
    ('a -> thm list -> Proof.context -> 'b) -> src -> Proof.context -> 'b
wenzelm@17110
   100
  val only_sectioned_args:
wenzelm@17110
   101
    (Args.T list -> modifier * Args.T list) list ->
wenzelm@20289
   102
    (Proof.context -> 'a) -> src -> Proof.context -> 'a
wenzelm@20289
   103
  val thms_ctxt_args: (thm list -> Proof.context -> 'a) -> src ->
wenzelm@20289
   104
    Proof.context -> 'a
wenzelm@20289
   105
  val thms_args: (thm list -> 'a) -> src -> Proof.context -> 'a
wenzelm@20289
   106
  val thm_args: (thm -> 'a) -> src -> Proof.context -> 'a
wenzelm@9539
   107
  val goal_args: (Args.T list -> 'a * Args.T list) -> ('a -> int -> tactic)
wenzelm@20289
   108
    -> src -> Proof.context -> method
wenzelm@18999
   109
  val goal_args': (Context.generic * Args.T list -> 'a * (Context.generic * Args.T list))
wenzelm@20289
   110
    -> ('a -> int -> tactic) -> src -> Proof.context -> method
wenzelm@17110
   111
  val goal_args_ctxt: (Args.T list -> 'a * Args.T list) ->
wenzelm@20289
   112
    (Proof.context -> 'a -> int -> tactic) -> src -> Proof.context -> method
wenzelm@18999
   113
  val goal_args_ctxt': (Context.generic * Args.T list -> 'a * (Context.generic * Args.T list)) ->
wenzelm@20289
   114
    (Proof.context -> 'a -> int -> tactic) -> src -> Proof.context -> method
wenzelm@22118
   115
  val parse: OuterLex.token list -> text * OuterLex.token list
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@5824
   132
wenzelm@12324
   133
(** proof methods **)
wenzelm@12324
   134
wenzelm@17110
   135
(* datatype method *)
wenzelm@11731
   136
wenzelm@18227
   137
datatype method = Meth of thm list -> cases_tactic;
wenzelm@11731
   138
wenzelm@25957
   139
fun apply pos meth_fun ctxt facts goal = Position.setmp_thread_data_seq pos
wenzelm@25957
   140
  (fn () => let val Meth meth = meth_fun ctxt in meth facts goal end) ();
wenzelm@11731
   141
wenzelm@17756
   142
val RAW_METHOD_CASES = Meth;
wenzelm@11731
   143
wenzelm@17110
   144
fun RAW_METHOD tac = RAW_METHOD_CASES (NO_CASES o tac);
wenzelm@12144
   145
wenzelm@17110
   146
fun METHOD_CASES tac = RAW_METHOD_CASES (fn facts =>
wenzelm@21687
   147
  Seq.THEN (ALLGOALS Goal.conjunction_tac, tac facts));
wenzelm@8372
   148
wenzelm@21687
   149
fun METHOD tac = RAW_METHOD (fn facts => ALLGOALS Goal.conjunction_tac THEN tac facts);
wenzelm@5824
   150
wenzelm@5824
   151
val fail = METHOD (K no_tac);
wenzelm@5824
   152
val succeed = METHOD (K all_tac);
wenzelm@5824
   153
wenzelm@5824
   154
wenzelm@17110
   155
(* insert facts *)
wenzelm@7419
   156
wenzelm@7419
   157
local
wenzelm@5824
   158
wenzelm@21579
   159
fun cut_rule_tac rule =
wenzelm@21579
   160
  Tactic.rtac (Drule.forall_intr_vars rule COMP_INCR revcut_rl);
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@21592
   171
fun SIMPLE_METHOD'' quant tac = METHOD (fn facts => quant (insert_tac facts THEN' tac));
wenzelm@21592
   172
val SIMPLE_METHOD' = SIMPLE_METHOD'' HEADGOAL;
wenzelm@9706
   173
wenzelm@12324
   174
end;
wenzelm@12324
   175
wenzelm@9706
   176
wenzelm@17110
   177
(* shuffle subgoals *)
wenzelm@17110
   178
wenzelm@17110
   179
fun prefer i = METHOD (K (Tactic.defer_tac i THEN PRIMITIVE (Thm.permute_prems 0 ~1)));
wenzelm@18939
   180
fun defer opt_i = METHOD (K (Tactic.defer_tac (the_default 1 opt_i)));
wenzelm@17110
   181
wenzelm@17110
   182
wenzelm@17356
   183
(* cheating *)
wenzelm@17356
   184
wenzelm@17356
   185
fun cheating int ctxt = METHOD (K (setmp quick_and_dirty (int orelse ! quick_and_dirty)
wenzelm@17356
   186
    (SkipProof.cheat_tac (ProofContext.theory_of ctxt))));
wenzelm@17356
   187
wenzelm@17356
   188
wenzelm@17110
   189
(* unfold intro/elim rules *)
wenzelm@17110
   190
wenzelm@21592
   191
fun intro ths = SIMPLE_METHOD' (CHANGED_PROP o REPEAT_ALL_NEW (Tactic.match_tac ths));
wenzelm@21592
   192
fun elim ths = SIMPLE_METHOD' (CHANGED_PROP o REPEAT_ALL_NEW (Tactic.ematch_tac ths));
wenzelm@17110
   193
wenzelm@17110
   194
wenzelm@12384
   195
(* unfold/fold definitions *)
wenzelm@12384
   196
wenzelm@18877
   197
fun unfold_meth ths ctxt = SIMPLE_METHOD (CHANGED_PROP (LocalDefs.unfold_tac ctxt ths));
wenzelm@18877
   198
fun fold_meth ths ctxt = SIMPLE_METHOD (CHANGED_PROP (LocalDefs.fold_tac ctxt ths));
wenzelm@6532
   199
wenzelm@12384
   200
wenzelm@12829
   201
(* atomize rule statements *)
wenzelm@12829
   202
wenzelm@23590
   203
fun atomize false = SIMPLE_METHOD' (CHANGED_PROP o ObjectLogic.atomize_prems_tac)
wenzelm@12829
   204
  | atomize true = RAW_METHOD (K (HEADGOAL (CHANGED_PROP o ObjectLogic.full_atomize_tac)));
wenzelm@12829
   205
wenzelm@12829
   206
wenzelm@18039
   207
(* this -- resolve facts directly *)
wenzelm@12384
   208
wenzelm@17110
   209
val this = METHOD (EVERY o map (HEADGOAL o Tactic.rtac));
wenzelm@9484
   210
wenzelm@9484
   211
wenzelm@18039
   212
(* fact -- composition by facts from context *)
wenzelm@18039
   213
wenzelm@21592
   214
fun fact [] ctxt = SIMPLE_METHOD' (ProofContext.some_fact_tac ctxt)
wenzelm@21592
   215
  | fact rules _ = SIMPLE_METHOD' (ProofContext.fact_tac rules);
wenzelm@18039
   216
wenzelm@18039
   217
wenzelm@17110
   218
(* assumption *)
wenzelm@7419
   219
wenzelm@7419
   220
local
wenzelm@7419
   221
wenzelm@19778
   222
fun cond_rtac cond rule = SUBGOAL (fn (prop, i) =>
wenzelm@19778
   223
  if cond (Logic.strip_assums_concl prop)
wenzelm@19778
   224
  then Tactic.rtac rule i else no_tac);
wenzelm@7419
   225
kleing@29857
   226
in
kleing@29857
   227
kleing@29857
   228
fun assumption_tac ctxt =
wenzelm@17110
   229
  assume_tac APPEND'
wenzelm@23349
   230
  Goal.assume_rule_tac ctxt APPEND'
wenzelm@19778
   231
  cond_rtac (can Logic.dest_equals) Drule.reflexive_thm APPEND'
wenzelm@19778
   232
  cond_rtac (can Logic.dest_term) Drule.termI;
wenzelm@17110
   233
wenzelm@23349
   234
fun assumption ctxt = METHOD (HEADGOAL o
kleing@29857
   235
  (fn [] => assumption_tac ctxt
wenzelm@23349
   236
    | [fact] => solve_tac [fact]
wenzelm@23349
   237
    | _ => K no_tac));
wenzelm@23349
   238
wenzelm@17356
   239
fun close immed ctxt = METHOD (K
wenzelm@23349
   240
  (FILTER Thm.no_prems
kleing@29857
   241
    ((if immed then ALLGOALS (assumption_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@21962
   251
  if ! trace_rules andalso not (null rules) then
wenzelm@17110
   252
    Pretty.big_list "rules:" (map (ProofContext.pretty_thm ctxt) rules)
wenzelm@21962
   253
    |> Pretty.string_of |> tracing
wenzelm@21962
   254
  else ();
wenzelm@12347
   255
wenzelm@12347
   256
local
wenzelm@12347
   257
wenzelm@18841
   258
fun gen_rule_tac tac rules facts =
wenzelm@18841
   259
  (fn i => fn st =>
wenzelm@18841
   260
    if null facts then tac rules i st
wenzelm@18841
   261
    else Seq.maps (fn rule => (tac o single) rule i st) (Drule.multi_resolves facts rules))
wenzelm@21687
   262
  THEN_ALL_NEW Goal.norm_hhf_tac;
wenzelm@7130
   263
wenzelm@10744
   264
fun gen_arule_tac tac j rules facts =
wenzelm@10744
   265
  EVERY' (gen_rule_tac tac rules facts :: replicate j Tactic.assume_tac);
wenzelm@10744
   266
wenzelm@11785
   267
fun gen_some_rule_tac tac arg_rules ctxt facts = SUBGOAL (fn (goal, i) =>
wenzelm@11785
   268
  let
wenzelm@11785
   269
    val rules =
wenzelm@11785
   270
      if not (null arg_rules) then arg_rules
wenzelm@19482
   271
      else flat (ContextRules.find_rules false facts goal ctxt)
wenzelm@12055
   272
  in trace ctxt rules; tac rules facts i end);
wenzelm@10309
   273
wenzelm@10744
   274
fun meth tac x = METHOD (HEADGOAL o tac x);
wenzelm@10744
   275
fun meth' tac x y = METHOD (HEADGOAL o tac x y);
wenzelm@8220
   276
wenzelm@7419
   277
in
wenzelm@7419
   278
wenzelm@10744
   279
val rule_tac = gen_rule_tac Tactic.resolve_tac;
wenzelm@10744
   280
val rule = meth rule_tac;
wenzelm@10744
   281
val some_rule_tac = gen_some_rule_tac rule_tac;
wenzelm@10744
   282
val some_rule = meth' some_rule_tac;
wenzelm@10744
   283
wenzelm@10744
   284
val erule = meth' (gen_arule_tac Tactic.eresolve_tac);
wenzelm@10744
   285
val drule = meth' (gen_arule_tac Tactic.dresolve_tac);
wenzelm@10744
   286
val frule = meth' (gen_arule_tac Tactic.forward_tac);
wenzelm@5824
   287
wenzelm@7419
   288
end;
wenzelm@7419
   289
wenzelm@7419
   290
haftmann@25270
   291
(* intros_tac -- pervasive search spanned by intro rules *)
haftmann@25270
   292
haftmann@25270
   293
fun intros_tac intros facts =
haftmann@25270
   294
  ALLGOALS (insert_tac facts THEN'
haftmann@25270
   295
      REPEAT_ALL_NEW (resolve_tac intros))
haftmann@25270
   296
    THEN Tactic.distinct_subgoals_tac;
haftmann@25270
   297
haftmann@25270
   298
nipkow@17587
   299
(* iprover -- intuitionistic proof search *)
wenzelm@17110
   300
wenzelm@17110
   301
local
wenzelm@17110
   302
wenzelm@17110
   303
val remdups_tac = SUBGOAL (fn (g, i) =>
wenzelm@17110
   304
  let val prems = Logic.strip_assums_hyp g in
wenzelm@19046
   305
    REPEAT_DETERM_N (length prems - length (distinct op aconv prems))
wenzelm@17110
   306
    (Tactic.ematch_tac [Drule.remdups_rl] i THEN Tactic.eq_assume_tac i)
wenzelm@17110
   307
  end);
wenzelm@17110
   308
wenzelm@17110
   309
fun REMDUPS tac = tac THEN_ALL_NEW remdups_tac;
wenzelm@17110
   310
wenzelm@17110
   311
val bires_tac = Tactic.biresolution_from_nets_tac ContextRules.orderlist;
wenzelm@17110
   312
wenzelm@17110
   313
fun safe_step_tac ctxt =
wenzelm@17110
   314
  ContextRules.Swrap ctxt
wenzelm@17110
   315
   (eq_assume_tac ORELSE'
wenzelm@17110
   316
    bires_tac true (ContextRules.netpair_bang ctxt));
wenzelm@8195
   317
wenzelm@17110
   318
fun unsafe_step_tac ctxt =
wenzelm@17110
   319
  ContextRules.wrap ctxt
wenzelm@17110
   320
   (assume_tac APPEND'
wenzelm@17110
   321
    bires_tac false (ContextRules.netpair_bang ctxt) APPEND'
wenzelm@17110
   322
    bires_tac false (ContextRules.netpair ctxt));
wenzelm@17110
   323
wenzelm@17110
   324
fun step_tac ctxt i =
wenzelm@17110
   325
  REPEAT_DETERM1 (REMDUPS (safe_step_tac ctxt) i) ORELSE
wenzelm@17110
   326
  REMDUPS (unsafe_step_tac ctxt) i;
wenzelm@17110
   327
wenzelm@17110
   328
fun intprover_tac ctxt gs d lim = SUBGOAL (fn (g, i) => if d > lim then no_tac else
wenzelm@17110
   329
  let
wenzelm@17110
   330
    val ps = Logic.strip_assums_hyp g;
wenzelm@17110
   331
    val c = Logic.strip_assums_concl g;
wenzelm@17110
   332
  in
wenzelm@18921
   333
    if member (fn ((ps1, c1), (ps2, c2)) =>
wenzelm@19307
   334
        c1 aconv c2 andalso
wenzelm@19307
   335
        length ps1 = length ps2 andalso
wenzelm@19307
   336
        gen_eq_set (op aconv) (ps1, ps2)) gs (ps, c) then no_tac
wenzelm@17110
   337
    else (step_tac ctxt THEN_ALL_NEW intprover_tac ctxt ((ps, c) :: gs) (d + 1) lim) i
wenzelm@17110
   338
  end);
wenzelm@17110
   339
wenzelm@17110
   340
in
wenzelm@17110
   341
nipkow@17587
   342
fun iprover_tac ctxt opt_lim =
wenzelm@18939
   343
  SELECT_GOAL (DEEPEN (2, the_default 20 opt_lim) (intprover_tac ctxt [] 0) 4 1);
wenzelm@17110
   344
wenzelm@17110
   345
end;
wenzelm@8195
   346
wenzelm@8195
   347
wenzelm@8351
   348
(* ML tactics *)
wenzelm@8351
   349
wenzelm@26472
   350
structure TacticData = ProofDataFun
wenzelm@26472
   351
(
wenzelm@27235
   352
  type T = thm list -> tactic;
wenzelm@26472
   353
  fun init _ = undefined;
wenzelm@26472
   354
);
wenzelm@26472
   355
wenzelm@26472
   356
val set_tactic = TacticData.put;
wenzelm@8351
   357
wenzelm@26472
   358
fun ml_tactic (txt, pos) ctxt =
wenzelm@26472
   359
  let
wenzelm@26472
   360
    val ctxt' = ctxt |> Context.proof_map
wenzelm@27235
   361
      (ML_Context.expression pos
wenzelm@27235
   362
        "fun tactic (facts: thm list) : tactic"
wenzelm@26472
   363
        "Context.map_proof (Method.set_tactic tactic)" txt);
wenzelm@27235
   364
  in Context.setmp_thread_data (SOME (Context.Proof ctxt)) (TacticData.get ctxt') end;
wenzelm@23425
   365
wenzelm@23425
   366
fun tactic txt ctxt = METHOD (ml_tactic txt ctxt);
wenzelm@23425
   367
fun raw_tactic txt ctxt = RAW_METHOD (ml_tactic txt ctxt);
wenzelm@8351
   368
wenzelm@8351
   369
wenzelm@5824
   370
wenzelm@17110
   371
(** method syntax **)
wenzelm@17110
   372
wenzelm@17110
   373
(* method text *)
wenzelm@17110
   374
wenzelm@17110
   375
type src = Args.src;
wenzelm@5824
   376
wenzelm@17110
   377
datatype text =
wenzelm@23349
   378
  Basic of (Proof.context -> method) * Position.T |
wenzelm@17110
   379
  Source of src |
wenzelm@20030
   380
  Source_i of src |
wenzelm@17110
   381
  Then of text list |
wenzelm@17110
   382
  Orelse of text list |
wenzelm@17110
   383
  Try of text |
wenzelm@19186
   384
  Repeat1 of text |
wenzelm@19186
   385
  SelectGoals of int * text;
wenzelm@17110
   386
wenzelm@23349
   387
fun primitive_text r = Basic (K (SIMPLE_METHOD (PRIMITIVE r)), Position.none);
wenzelm@23349
   388
val succeed_text = Basic (K succeed, Position.none);
wenzelm@17110
   389
val default_text = Source (Args.src (("default", []), Position.none));
wenzelm@23349
   390
val this_text = Basic (K this, Position.none);
wenzelm@23349
   391
val done_text = Basic (K (SIMPLE_METHOD all_tac), Position.none);
wenzelm@23349
   392
fun sorry_text int = Basic (cheating int, Position.none);
wenzelm@17110
   393
wenzelm@23349
   394
fun finish_text (NONE, immed) pos = Basic (close immed, pos)
wenzelm@23349
   395
  | finish_text (SOME txt, immed) pos = Then [txt, Basic (close immed, pos)];
wenzelm@17110
   396
wenzelm@17110
   397
wenzelm@17110
   398
(* method definitions *)
wenzelm@5824
   399
wenzelm@24116
   400
structure Methods = TheoryDataFun
wenzelm@22846
   401
(
wenzelm@20289
   402
  type T = (((src -> Proof.context -> method) * string) * stamp) NameSpace.table;
wenzelm@16347
   403
  val empty = NameSpace.empty_table;
wenzelm@6546
   404
  val copy = I;
wenzelm@16448
   405
  val extend = I;
wenzelm@23655
   406
  fun merge _ tables : T = NameSpace.merge_tables (eq_snd (op =)) tables handle Symtab.DUP dup =>
wenzelm@23655
   407
    error ("Attempt to merge different versions of method " ^ quote dup);
wenzelm@22846
   408
);
wenzelm@5824
   409
wenzelm@22846
   410
fun print_methods thy =
wenzelm@22846
   411
  let
wenzelm@24116
   412
    val meths = Methods.get thy;
wenzelm@22846
   413
    fun prt_meth (name, ((_, comment), _)) = Pretty.block
wenzelm@22846
   414
      [Pretty.str (name ^ ":"), Pretty.brk 2, Pretty.str comment];
wenzelm@22846
   415
  in
wenzelm@22846
   416
    [Pretty.big_list "methods:" (map prt_meth (NameSpace.extern_table meths))]
wenzelm@22846
   417
    |> Pretty.chunks |> Pretty.writeln
wenzelm@22846
   418
  end;
wenzelm@7611
   419
wenzelm@5824
   420
wenzelm@5824
   421
(* get methods *)
wenzelm@5824
   422
wenzelm@26892
   423
val intern = NameSpace.intern o #1 o Methods.get;
wenzelm@26892
   424
val defined = Symtab.defined o #2 o Methods.get;
wenzelm@26892
   425
wenzelm@20030
   426
fun method_i thy =
wenzelm@5824
   427
  let
wenzelm@24116
   428
    val meths = #2 (Methods.get thy);
wenzelm@5884
   429
    fun meth src =
wenzelm@20030
   430
      let val ((name, _), pos) = Args.dest_src src in
wenzelm@17412
   431
        (case Symtab.lookup meths name of
skalberg@15531
   432
          NONE => error ("Unknown proof method: " ^ quote name ^ Position.str_of pos)
wenzelm@27751
   433
        | SOME ((mth, _), _) => (Position.report (Markup.method name) pos; mth src))
wenzelm@5824
   434
      end;
wenzelm@5824
   435
  in meth end;
wenzelm@5824
   436
wenzelm@24116
   437
fun method thy = method_i thy o Args.map_name (NameSpace.intern (#1 (Methods.get thy)));
wenzelm@20030
   438
wenzelm@5824
   439
wenzelm@17110
   440
(* add method *)
wenzelm@5824
   441
wenzelm@5824
   442
fun add_methods raw_meths thy =
wenzelm@5824
   443
  let
wenzelm@16145
   444
    val new_meths = raw_meths |> map (fn (name, f, comment) =>
haftmann@29004
   445
      (Binding.name name, ((f, comment), stamp ())));
wenzelm@5824
   446
haftmann@29004
   447
    fun add meths = fold (snd oo NameSpace.bind (Sign.naming_of thy)) new_meths meths
wenzelm@23655
   448
      handle Symtab.DUP dup => error ("Duplicate declaration of method " ^ quote dup);
wenzelm@24116
   449
  in Methods.map add thy end;
wenzelm@5824
   450
wenzelm@9194
   451
val add_method = add_methods o Library.single;
wenzelm@9194
   452
wenzelm@5824
   453
wenzelm@17356
   454
(* method_setup *)
wenzelm@17356
   455
wenzelm@26385
   456
fun method_setup name (txt, pos) cmt =
wenzelm@26472
   457
  Context.theory_map (ML_Context.expression pos
wenzelm@22118
   458
    "val method: bstring * (Method.src -> Proof.context -> Proof.method) * string"
wenzelm@22086
   459
    "Context.map_theory (Method.add_method method)"
wenzelm@26472
   460
    ("(" ^ quote name ^ ", " ^ txt ^ ", " ^ quote cmt ^ ")"));
wenzelm@17356
   461
wenzelm@17356
   462
wenzelm@5884
   463
wenzelm@17110
   464
(** concrete syntax **)
wenzelm@5824
   465
wenzelm@27813
   466
structure P = OuterParse;
wenzelm@27813
   467
wenzelm@27813
   468
wenzelm@5884
   469
(* basic *)
wenzelm@5884
   470
wenzelm@18999
   471
fun syntax scan = Args.context_syntax "method" scan;
wenzelm@5824
   472
wenzelm@17110
   473
fun simple_args scan f src ctxt : method =
haftmann@21879
   474
  fst (syntax (Scan.lift (scan >> (fn x => f x ctxt))) src ctxt);
wenzelm@8351
   475
wenzelm@20289
   476
fun ctxt_args (f: Proof.context -> method) src ctxt =
haftmann@21879
   477
  fst (syntax (Scan.succeed (f ctxt)) src ctxt);
wenzelm@7555
   478
wenzelm@7555
   479
fun no_args m = ctxt_args (K m);
wenzelm@5884
   480
wenzelm@5884
   481
wenzelm@5884
   482
(* sections *)
wenzelm@5824
   483
wenzelm@20289
   484
type modifier = (Proof.context -> Proof.context) * attribute;
wenzelm@7268
   485
wenzelm@7268
   486
local
wenzelm@7268
   487
wenzelm@24010
   488
fun thms ss = Scan.repeat (Scan.unless (Scan.lift (Scan.first ss)) Attrib.multi_thm) >> flat;
wenzelm@19186
   489
fun app (f, att) (context, ths) = foldl_map att (Context.map_proof f context, ths);
wenzelm@5824
   490
wenzelm@24022
   491
fun section ss = Scan.depend (fn context => (Scan.first ss -- Scan.pass context (thms ss)) :|--
wenzelm@24022
   492
  (fn (m, ths) => Scan.succeed (app m (context, ths))));
wenzelm@5884
   493
wenzelm@7601
   494
fun sectioned args ss = args -- Scan.repeat (section ss);
wenzelm@5884
   495
wenzelm@7268
   496
in
wenzelm@5824
   497
wenzelm@5884
   498
fun sectioned_args args ss f src ctxt =
haftmann@21879
   499
  let val ((x, _), ctxt') = syntax (sectioned args ss) src ctxt
wenzelm@5921
   500
  in f x ctxt' end;
wenzelm@5884
   501
wenzelm@7601
   502
fun bang_sectioned_args ss f = sectioned_args Args.bang_facts ss f;
wenzelm@9777
   503
fun bang_sectioned_args' ss scan f =
wenzelm@9777
   504
  sectioned_args (Args.bang_facts -- scan >> swap) ss (uncurry f);
wenzelm@7601
   505
fun only_sectioned_args ss f = sectioned_args (Scan.succeed ()) ss (fn () => f);
wenzelm@7268
   506
wenzelm@18999
   507
fun thms_ctxt_args f = sectioned_args (thms []) [] f;
wenzelm@8093
   508
fun thms_args f = thms_ctxt_args (K o f);
wenzelm@9706
   509
fun thm_args f = thms_args (fn [thm] => f thm | _ => error "Single theorem expected");
wenzelm@5824
   510
wenzelm@7268
   511
end;
wenzelm@7268
   512
wenzelm@5824
   513
nipkow@17587
   514
(* iprover syntax *)
wenzelm@12347
   515
wenzelm@12347
   516
local
wenzelm@12347
   517
wenzelm@12347
   518
val introN = "intro";
wenzelm@12347
   519
val elimN = "elim";
wenzelm@12347
   520
val destN = "dest";
wenzelm@12347
   521
val ruleN = "rule";
wenzelm@12347
   522
wenzelm@12347
   523
fun modifier name kind kind' att =
wenzelm@27813
   524
  Args.$$$ name |-- (kind >> K NONE || kind' |-- P.nat --| Args.colon >> SOME)
wenzelm@20289
   525
    >> (pair (I: Proof.context -> Proof.context) o att);
wenzelm@12347
   526
nipkow@17587
   527
val iprover_modifiers =
wenzelm@18728
   528
 [modifier destN Args.bang_colon Args.bang ContextRules.dest_bang,
wenzelm@18728
   529
  modifier destN Args.colon (Scan.succeed ()) ContextRules.dest,
wenzelm@18728
   530
  modifier elimN Args.bang_colon Args.bang ContextRules.elim_bang,
wenzelm@18728
   531
  modifier elimN Args.colon (Scan.succeed ()) ContextRules.elim,
wenzelm@18728
   532
  modifier introN Args.bang_colon Args.bang ContextRules.intro_bang,
wenzelm@18728
   533
  modifier introN Args.colon (Scan.succeed ()) ContextRules.intro,
wenzelm@18728
   534
  Args.del -- Args.colon >> K (I, ContextRules.rule_del)];
wenzelm@12347
   535
wenzelm@12347
   536
in
wenzelm@12347
   537
wenzelm@18640
   538
val iprover_meth =
wenzelm@27813
   539
  bang_sectioned_args' iprover_modifiers (Scan.lift (Scan.option P.nat))
wenzelm@18640
   540
    (fn n => fn prems => fn ctxt => METHOD (fn facts =>
wenzelm@18640
   541
      HEADGOAL (insert_tac (prems @ facts) THEN'
wenzelm@23590
   542
      ObjectLogic.atomize_prems_tac THEN' iprover_tac ctxt n)));
wenzelm@12347
   543
wenzelm@12347
   544
end;
wenzelm@12347
   545
wenzelm@12347
   546
wenzelm@9539
   547
(* tactic syntax *)
wenzelm@8238
   548
wenzelm@10744
   549
fun nat_thms_args f = uncurry f oo
wenzelm@27813
   550
  (fst oo syntax (Scan.lift (Scan.optional (Args.parens P.nat) 0) -- Attrib.thms));
wenzelm@10744
   551
haftmann@21879
   552
fun goal_args' args tac src ctxt = fst (syntax (Args.goal_spec HEADGOAL -- args >>
wenzelm@21592
   553
  (fn (quant, s) => SIMPLE_METHOD'' quant (tac s))) src ctxt);
wenzelm@8537
   554
wenzelm@9539
   555
fun goal_args args tac = goal_args' (Scan.lift args) tac;
wenzelm@8238
   556
ballarin@14174
   557
fun goal_args_ctxt' args tac src ctxt =
haftmann@21879
   558
  fst (syntax (Args.goal_spec HEADGOAL -- args >>
wenzelm@21592
   559
  (fn (quant, s) => SIMPLE_METHOD'' quant (tac ctxt s))) src ctxt);
wenzelm@8238
   560
ballarin@14174
   561
fun goal_args_ctxt args tac = goal_args_ctxt' (Scan.lift args) tac;
wenzelm@5824
   562
wenzelm@14718
   563
wenzelm@27813
   564
(* outer parser *)
wenzelm@27813
   565
wenzelm@27813
   566
fun is_symid_meth s =
wenzelm@27813
   567
  s <> "|" andalso s <> "?" andalso s <> "+" andalso OuterLex.ident_or_symbolic s;
wenzelm@27813
   568
wenzelm@27813
   569
local
wenzelm@27813
   570
wenzelm@27813
   571
fun meth4 x =
wenzelm@27813
   572
 (P.position (P.xname >> rpair []) >> (Source o Args.src) ||
wenzelm@27813
   573
  P.$$$ "(" |-- P.!!! (meth0 --| P.$$$ ")")) x
wenzelm@27813
   574
and meth3 x =
wenzelm@27813
   575
 (meth4 --| P.$$$ "?" >> Try ||
wenzelm@27813
   576
  meth4 --| P.$$$ "+" >> Repeat1 ||
wenzelm@27813
   577
  meth4 -- (P.$$$ "[" |-- Scan.optional P.nat 1 --| P.$$$ "]") >> (SelectGoals o swap) ||
wenzelm@27813
   578
  meth4) x
wenzelm@27813
   579
and meth2 x =
wenzelm@27813
   580
 (P.position (P.xname -- Args.parse1 is_symid_meth) >> (Source o Args.src) ||
wenzelm@27813
   581
  meth3) x
wenzelm@27813
   582
and meth1 x = (P.enum1 "," meth2 >> (fn [m] => m | ms => Then ms)) x
wenzelm@27813
   583
and meth0 x = (P.enum1 "|" meth1 >> (fn [m] => m | ms => Orelse ms)) x;
wenzelm@27813
   584
wenzelm@27813
   585
in val parse = meth3 end;
wenzelm@27813
   586
wenzelm@27813
   587
wenzelm@18708
   588
(* theory setup *)
wenzelm@5824
   589
wenzelm@26463
   590
val _ = Context.>> (Context.map_theory
wenzelm@26463
   591
  (add_methods
wenzelm@26463
   592
   [("fail", no_args fail, "force failure"),
wenzelm@26463
   593
    ("succeed", no_args succeed, "succeed"),
wenzelm@26463
   594
    ("-", no_args insert_facts, "do nothing (insert current facts only)"),
wenzelm@26463
   595
    ("insert", thms_args insert, "insert theorems, ignoring facts (improper)"),
wenzelm@26463
   596
    ("intro", thms_args intro, "repeatedly apply introduction rules"),
wenzelm@26463
   597
    ("elim", thms_args elim, "repeatedly apply elimination rules"),
wenzelm@26463
   598
    ("unfold", thms_ctxt_args unfold_meth, "unfold definitions"),
wenzelm@26463
   599
    ("fold", thms_ctxt_args fold_meth, "fold definitions"),
wenzelm@26463
   600
    ("atomize", (atomize o fst) oo syntax (Args.mode "full"),
wenzelm@26463
   601
      "present local premises as object-level statements"),
wenzelm@26463
   602
    ("iprover", iprover_meth, "intuitionistic proof search"),
wenzelm@26463
   603
    ("rule", thms_ctxt_args some_rule, "apply some intro/elim rule"),
wenzelm@26463
   604
    ("erule", nat_thms_args erule, "apply rule in elimination manner (improper)"),
wenzelm@26463
   605
    ("drule", nat_thms_args drule, "apply rule in destruct manner (improper)"),
wenzelm@26463
   606
    ("frule", nat_thms_args frule, "apply rule in forward manner (improper)"),
wenzelm@26463
   607
    ("this", no_args this, "apply current facts as rules"),
wenzelm@26463
   608
    ("fact", thms_ctxt_args fact, "composition by facts from context"),
wenzelm@26463
   609
    ("assumption", ctxt_args assumption, "proof by assumption, preferring facts"),
wenzelm@27244
   610
    ("rename_tac", goal_args (Scan.repeat1 Args.name) Tactic.rename_tac,
wenzelm@26463
   611
      "rename parameters of goal"),
wenzelm@27813
   612
    ("rotate_tac", goal_args (Scan.optional P.int 1) Tactic.rotate_tac,
wenzelm@26463
   613
      "rotate assumptions of goal"),
wenzelm@27813
   614
    ("tactic", simple_args (P.position Args.name) tactic, "ML tactic as proof method"),
wenzelm@27813
   615
    ("raw_tactic", simple_args (P.position Args.name) raw_tactic,
wenzelm@26463
   616
      "ML tactic as raw proof method")]));
wenzelm@5824
   617
wenzelm@5824
   618
wenzelm@16145
   619
(*final declarations of this structure!*)
wenzelm@16145
   620
val unfold = unfold_meth;
wenzelm@16145
   621
val fold = fold_meth;
wenzelm@16145
   622
wenzelm@5824
   623
end;
wenzelm@5824
   624
wenzelm@5824
   625
structure BasicMethod: BASIC_METHOD = Method;
wenzelm@5824
   626
open BasicMethod;