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