src/Pure/Isar/method.ML
author wenzelm
Mon Jun 28 21:47:04 1999 +0200 (1999-06-28)
changeset 6849 0b660860c0ad
parent 6775 9d96ce9c27d6
child 6872 b250da153b1e
permissions -rw-r--r--
cond_extern_table;
datatype method = Method of thm list -> tactic;
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@5824
     5
Proof methods.
wenzelm@5824
     6
*)
wenzelm@5824
     7
wenzelm@5824
     8
signature BASIC_METHOD =
wenzelm@5824
     9
sig
wenzelm@5824
    10
  val print_methods: theory -> unit
wenzelm@5824
    11
  val Method: bstring -> (Args.src -> Proof.context -> Proof.method) -> string -> unit
wenzelm@5824
    12
end;
wenzelm@5824
    13
wenzelm@5824
    14
signature METHOD =
wenzelm@5824
    15
sig
wenzelm@5824
    16
  include BASIC_METHOD
wenzelm@6775
    17
  val multi_resolve: thm list -> thm -> thm Seq.seq
wenzelm@6500
    18
  val FINISHED: tactic -> tactic
wenzelm@6091
    19
  val METHOD: (thm list -> tactic) -> Proof.method
wenzelm@5824
    20
  val METHOD0: tactic -> Proof.method
wenzelm@5824
    21
  val fail: Proof.method
wenzelm@5824
    22
  val succeed: Proof.method
wenzelm@6500
    23
  val same_tac: thm list -> int -> tactic
wenzelm@6108
    24
  val same: Proof.method
wenzelm@5824
    25
  val assumption: Proof.method
wenzelm@5824
    26
  val forward_chain: thm list -> thm list -> thm Seq.seq
wenzelm@6091
    27
  val rule_tac: thm list -> thm list -> int -> tactic
wenzelm@6091
    28
  val rule: thm list -> Proof.method
wenzelm@5916
    29
  exception METHOD_FAIL of (string * Position.T) * exn
wenzelm@5824
    30
  val method: theory -> Args.src -> Proof.context -> Proof.method
wenzelm@5824
    31
  val add_methods: (bstring * (Args.src -> Proof.context -> Proof.method) * string) list
wenzelm@5824
    32
    -> theory -> theory
wenzelm@5884
    33
  val syntax: (Proof.context * Args.T list -> 'a * (Proof.context * Args.T list)) ->
wenzelm@5884
    34
    Proof.context -> Args.src -> Proof.context * 'a
wenzelm@5884
    35
  val no_args: Proof.method -> Args.src -> Proof.context -> Proof.method
wenzelm@5884
    36
  val sectioned_args: ((Args.T list -> Proof.context attribute * Args.T list) list ->
wenzelm@5884
    37
      Proof.context * Args.T list -> 'a * (Proof.context * Args.T list)) ->
wenzelm@5884
    38
    (Args.T list -> Proof.context attribute * Args.T list) list ->
wenzelm@5884
    39
    ('a -> Proof.context -> Proof.method) -> Args.src -> Proof.context -> Proof.method
wenzelm@5884
    40
  val default_sectioned_args: Proof.context attribute ->
wenzelm@5884
    41
    (Args.T list -> Proof.context attribute * Args.T list) list ->
wenzelm@5884
    42
    (Proof.context -> Proof.method) -> Args.src -> Proof.context -> Proof.method
wenzelm@5884
    43
  val only_sectioned_args: (Args.T list -> Proof.context attribute * Args.T list) list ->
wenzelm@5884
    44
    (Proof.context -> Proof.method) -> Args.src -> Proof.context -> Proof.method
wenzelm@6091
    45
  val thms_args: (thm list -> Proof.method) -> Args.src -> Proof.context -> Proof.method
wenzelm@5824
    46
  datatype text =
wenzelm@5824
    47
    Basic of (Proof.context -> Proof.method) |
wenzelm@5824
    48
    Source of Args.src |
wenzelm@5824
    49
    Then of text list |
wenzelm@5824
    50
    Orelse of text list |
wenzelm@5824
    51
    Try of text |
wenzelm@5824
    52
    Repeat of text |
wenzelm@5824
    53
    Repeat1 of text
wenzelm@5824
    54
  val refine: text -> Proof.state -> Proof.state Seq.seq
wenzelm@5824
    55
  val tac: text -> Proof.state -> Proof.state Seq.seq
wenzelm@5884
    56
  val then_tac: text -> Proof.state -> Proof.state Seq.seq
wenzelm@5824
    57
  val proof: text option -> Proof.state -> Proof.state Seq.seq
wenzelm@6736
    58
  val local_qed: text option -> ({kind: string, name: string, thm: thm} -> unit)
wenzelm@6736
    59
    -> Proof.state -> Proof.state Seq.seq
wenzelm@6736
    60
  val local_terminal_proof: text -> ({kind: string, name: string, thm: thm} -> unit)
wenzelm@6736
    61
    -> Proof.state -> Proof.state Seq.seq
wenzelm@6736
    62
  val local_immediate_proof: ({kind: string, name: string, thm: thm} -> unit)
wenzelm@6736
    63
    -> Proof.state -> Proof.state Seq.seq
wenzelm@6736
    64
  val local_default_proof: ({kind: string, name: string, thm: thm} -> unit)
wenzelm@6736
    65
    -> Proof.state -> Proof.state Seq.seq
wenzelm@6404
    66
  val global_qed: bstring option -> theory attribute list option -> text option
wenzelm@6532
    67
    -> Proof.state -> theory * {kind: string, name: string, thm: thm}
wenzelm@6532
    68
  val global_terminal_proof: text -> Proof.state -> theory * {kind: string, name: string, thm: thm}
wenzelm@6532
    69
  val global_immediate_proof: Proof.state -> theory * {kind: string, name: string, thm: thm}
wenzelm@6532
    70
  val global_default_proof: Proof.state -> theory * {kind: string, name: string, thm: thm}
wenzelm@5824
    71
  val setup: (theory -> theory) list
wenzelm@5824
    72
end;
wenzelm@5824
    73
wenzelm@5824
    74
structure Method: METHOD =
wenzelm@5824
    75
struct
wenzelm@5824
    76
wenzelm@5824
    77
wenzelm@6500
    78
(** utils **)
wenzelm@6500
    79
wenzelm@6500
    80
val FINISHED = FILTER (equal 0 o Thm.nprems_of);
wenzelm@6500
    81
wenzelm@6500
    82
wenzelm@6500
    83
wenzelm@5824
    84
(** proof methods **)
wenzelm@5824
    85
wenzelm@5824
    86
(* method from tactic *)
wenzelm@5824
    87
wenzelm@6849
    88
val METHOD = Proof.method;
wenzelm@5824
    89
fun METHOD0 tac = METHOD (fn [] => tac | _ => error "Method may not be used with facts");
wenzelm@5824
    90
wenzelm@5824
    91
wenzelm@5824
    92
(* primitive *)
wenzelm@5824
    93
wenzelm@5824
    94
val fail = METHOD (K no_tac);
wenzelm@5824
    95
val succeed = METHOD (K all_tac);
wenzelm@5824
    96
wenzelm@5824
    97
wenzelm@6108
    98
(* same, assumption *)
wenzelm@5824
    99
wenzelm@6108
   100
fun same_tac [] = K all_tac
wenzelm@6108
   101
  | same_tac facts =
wenzelm@6091
   102
      let val r = ~ (length facts);
wenzelm@6091
   103
      in metacuts_tac facts THEN' rotate_tac r end;
wenzelm@5824
   104
wenzelm@6108
   105
val same = METHOD (ALLGOALS o same_tac);
wenzelm@6108
   106
val assumption = METHOD (fn facts => FIRSTGOAL (same_tac facts THEN' assume_tac));
wenzelm@5824
   107
wenzelm@6500
   108
val asm_finish = METHOD (K (FINISHED (ALLGOALS assume_tac)));
wenzelm@5824
   109
wenzelm@5824
   110
wenzelm@6532
   111
(* fold / unfold definitions *)
wenzelm@6532
   112
wenzelm@6532
   113
val fold = METHOD0 o fold_goals_tac;
wenzelm@6532
   114
val unfold = METHOD0 o rewrite_goals_tac;
wenzelm@6532
   115
wenzelm@6532
   116
wenzelm@5824
   117
(* rule *)
wenzelm@5824
   118
wenzelm@5824
   119
fun res th i rule = Thm.biresolution false [(false, th)] i rule handle THM _ => Seq.empty;
wenzelm@5824
   120
wenzelm@5824
   121
fun multi_resolve facts rule =
wenzelm@5824
   122
  let
wenzelm@5824
   123
    fun multi_res i [] = Seq.single rule
wenzelm@5824
   124
      | multi_res i (th :: ths) = Seq.flat (Seq.map (res th i) (multi_res (i + 1) ths))
wenzelm@5824
   125
  in multi_res 1 facts end;
wenzelm@5824
   126
wenzelm@5824
   127
fun forward_chain facts rules = Seq.flat (Seq.map (multi_resolve facts) (Seq.of_list rules));
wenzelm@5824
   128
wenzelm@6091
   129
fun rule_tac rules [] = resolve_tac rules
wenzelm@5824
   130
  | rule_tac erules facts =
wenzelm@5824
   131
      let
wenzelm@6091
   132
        val rules = forward_chain facts erules;
wenzelm@5824
   133
        fun tac i state = Seq.flat (Seq.map (fn rule => Tactic.rtac rule i state) rules);
wenzelm@5824
   134
      in tac end;
wenzelm@5824
   135
wenzelm@5824
   136
fun rule rules = METHOD (FIRSTGOAL o rule_tac rules);
wenzelm@5824
   137
wenzelm@5824
   138
wenzelm@5824
   139
wenzelm@5824
   140
(** methods theory data **)
wenzelm@5824
   141
wenzelm@5824
   142
(* data kind 'Isar/methods' *)
wenzelm@5824
   143
wenzelm@5824
   144
structure MethodsDataArgs =
wenzelm@5824
   145
struct
wenzelm@5824
   146
  val name = "Isar/methods";
wenzelm@5824
   147
  type T =
wenzelm@5824
   148
    {space: NameSpace.T,
wenzelm@5824
   149
     meths: (((Args.src -> Proof.context -> Proof.method) * string) * stamp) Symtab.table};
wenzelm@5824
   150
wenzelm@5824
   151
  val empty = {space = NameSpace.empty, meths = Symtab.empty};
wenzelm@6546
   152
  val copy = I;
wenzelm@5824
   153
  val prep_ext = I;
wenzelm@5824
   154
  fun merge ({space = space1, meths = meths1}, {space = space2, meths = meths2}) =
wenzelm@5824
   155
    {space = NameSpace.merge (space1, space2),
wenzelm@5824
   156
      meths = Symtab.merge eq_snd (meths1, meths2) handle Symtab.DUPS dups =>
wenzelm@5824
   157
        error ("Attempt to merge different versions of methods " ^ commas_quote dups)};
wenzelm@5824
   158
wenzelm@5824
   159
  fun print _ {space, meths} =
wenzelm@5824
   160
    let
wenzelm@5824
   161
      fun prt_meth (name, ((_, comment), _)) = Pretty.block
wenzelm@6849
   162
        [Pretty.str (name ^ ":"), Pretty.brk 2, Pretty.str comment];
wenzelm@5824
   163
    in
wenzelm@5824
   164
      Pretty.writeln (Display.pretty_name_space ("method name space", space));
wenzelm@6849
   165
      Pretty.writeln (Pretty.big_list "methods:"
wenzelm@6849
   166
        (map prt_meth (NameSpace.cond_extern_table space meths)))
wenzelm@5824
   167
    end;
wenzelm@5824
   168
end;
wenzelm@5824
   169
wenzelm@5824
   170
structure MethodsData = TheoryDataFun(MethodsDataArgs);
wenzelm@5824
   171
val print_methods = MethodsData.print;
wenzelm@5824
   172
wenzelm@5824
   173
wenzelm@5824
   174
(* get methods *)
wenzelm@5824
   175
wenzelm@5916
   176
exception METHOD_FAIL of (string * Position.T) * exn;
wenzelm@5916
   177
wenzelm@5824
   178
fun method thy =
wenzelm@5824
   179
  let
wenzelm@5824
   180
    val {space, meths} = MethodsData.get thy;
wenzelm@5824
   181
wenzelm@5884
   182
    fun meth src =
wenzelm@5884
   183
      let
wenzelm@5884
   184
        val ((raw_name, _), pos) = Args.dest_src src;
wenzelm@5884
   185
        val name = NameSpace.intern space raw_name;
wenzelm@5884
   186
      in
wenzelm@5824
   187
        (case Symtab.lookup (meths, name) of
wenzelm@5824
   188
          None => error ("Unknown proof method: " ^ quote name ^ Position.str_of pos)
wenzelm@5916
   189
        | Some ((mth, _), _) => transform_failure (curry METHOD_FAIL (name, pos)) (mth src))
wenzelm@5824
   190
      end;
wenzelm@5824
   191
  in meth end;
wenzelm@5824
   192
wenzelm@5824
   193
wenzelm@5824
   194
(* add_methods *)
wenzelm@5824
   195
wenzelm@5824
   196
fun add_methods raw_meths thy =
wenzelm@5824
   197
  let
wenzelm@5824
   198
    val full = Sign.full_name (Theory.sign_of thy);
wenzelm@5824
   199
    val new_meths =
wenzelm@5824
   200
      map (fn (name, f, comment) => (full name, ((f, comment), stamp ()))) raw_meths;
wenzelm@5824
   201
wenzelm@5824
   202
    val {space, meths} = MethodsData.get thy;
wenzelm@5824
   203
    val space' = NameSpace.extend (space, map fst new_meths);
wenzelm@5824
   204
    val meths' = Symtab.extend (meths, new_meths) handle Symtab.DUPS dups =>
wenzelm@5824
   205
      error ("Duplicate declaration of method(s) " ^ commas_quote dups);
wenzelm@5824
   206
  in
wenzelm@5824
   207
    thy |> MethodsData.put {space = space', meths = meths'}
wenzelm@5824
   208
  end;
wenzelm@5824
   209
wenzelm@5824
   210
(*implicit version*)
wenzelm@5824
   211
fun Method name meth cmt = Context.>> (add_methods [(name, meth, cmt)]);
wenzelm@5824
   212
wenzelm@5824
   213
wenzelm@5884
   214
wenzelm@5884
   215
(** method syntax **)
wenzelm@5824
   216
wenzelm@5884
   217
(* basic *)
wenzelm@5884
   218
wenzelm@5884
   219
fun syntax (scan: (Proof.context * Args.T list -> 'a * (Proof.context * Args.T list))) =
wenzelm@5884
   220
  Args.syntax "method" scan;
wenzelm@5824
   221
wenzelm@5884
   222
fun no_args (x: Proof.method) src ctxt = #2 (syntax (Scan.succeed x) ctxt src);
wenzelm@5884
   223
wenzelm@5884
   224
wenzelm@5884
   225
(* sections *)
wenzelm@5824
   226
wenzelm@5884
   227
fun sect ss = Scan.first (map (fn s => Scan.lift (s --| Args.$$$ ":")) ss);
wenzelm@5884
   228
fun thms ss = Scan.unless (sect ss) Attrib.local_thms;
wenzelm@5884
   229
fun thmss ss = Scan.repeat (thms ss) >> flat;
wenzelm@5884
   230
wenzelm@6091
   231
fun apply att (ctxt, ths) = Thm.applys_attributes ((ctxt, ths), [att]);
wenzelm@5824
   232
wenzelm@5884
   233
fun section ss = (sect ss -- thmss ss) :-- (fn (att, ths) => Scan.depend (fn ctxt =>
wenzelm@5884
   234
  Scan.succeed (apply att (ctxt, ths)))) >> #2;
wenzelm@5884
   235
wenzelm@5884
   236
fun sectioned args ss = args ss -- Scan.repeat (section ss);
wenzelm@5884
   237
wenzelm@5824
   238
wenzelm@5884
   239
fun sectioned_args args ss f src ctxt =
wenzelm@5921
   240
  let val (ctxt', (x, _)) = syntax (sectioned args ss) ctxt src
wenzelm@5921
   241
  in f x ctxt' end;
wenzelm@5884
   242
wenzelm@5884
   243
fun default_sectioned_args att ss f src ctxt =
wenzelm@5884
   244
  sectioned_args thmss ss (fn ths => fn ctxt' => f (#1 (apply att (ctxt', ths)))) src ctxt;
wenzelm@5884
   245
wenzelm@5884
   246
fun only_sectioned_args ss f = sectioned_args (K (Scan.succeed ())) ss (fn () => f);
wenzelm@5884
   247
fun thms_args f = sectioned_args thmss [] (fn ths => fn _ => f ths);
wenzelm@5824
   248
wenzelm@5824
   249
wenzelm@5824
   250
wenzelm@5824
   251
(** method text **)
wenzelm@5824
   252
wenzelm@5824
   253
(* datatype text *)
wenzelm@5824
   254
wenzelm@5824
   255
datatype text =
wenzelm@5824
   256
  Basic of (Proof.context -> Proof.method) |
wenzelm@5824
   257
  Source of Args.src |
wenzelm@5824
   258
  Then of text list |
wenzelm@5824
   259
  Orelse of text list |
wenzelm@5824
   260
  Try of text |
wenzelm@5824
   261
  Repeat of text |
wenzelm@5824
   262
  Repeat1 of text;
wenzelm@5824
   263
wenzelm@5824
   264
wenzelm@5824
   265
(* refine *)
wenzelm@5824
   266
wenzelm@5824
   267
fun refine text state =
wenzelm@5824
   268
  let
wenzelm@5824
   269
    val thy = Proof.theory_of state;
wenzelm@5824
   270
wenzelm@5824
   271
    fun eval (Basic mth) = Proof.refine mth
wenzelm@5824
   272
      | eval (Source src) = Proof.refine (method thy src)
wenzelm@5824
   273
      | eval (Then txts) = Seq.EVERY (map eval txts)
wenzelm@5824
   274
      | eval (Orelse txts) = Seq.FIRST (map eval txts)
wenzelm@5824
   275
      | eval (Try txt) = Seq.TRY (eval txt)
wenzelm@5824
   276
      | eval (Repeat txt) = Seq.REPEAT (eval txt)
wenzelm@5824
   277
      | eval (Repeat1 txt) = Seq.REPEAT1 (eval txt);
wenzelm@5824
   278
  in eval text state end;
wenzelm@5824
   279
wenzelm@6404
   280
fun named_method name = Source (Args.src ((name, []), Position.none));
wenzelm@6404
   281
wenzelm@5824
   282
wenzelm@5824
   283
(* unstructured steps *)
wenzelm@5824
   284
wenzelm@5824
   285
fun tac text state =
wenzelm@5824
   286
  state
wenzelm@5824
   287
  |> Proof.goal_facts (K [])
wenzelm@5824
   288
  |> refine text;
wenzelm@5824
   289
wenzelm@5884
   290
fun then_tac text state =
wenzelm@5824
   291
  state
wenzelm@5824
   292
  |> Proof.goal_facts Proof.the_facts
wenzelm@5824
   293
  |> refine text;
wenzelm@5824
   294
wenzelm@5824
   295
wenzelm@6404
   296
(* structured proof steps *)
wenzelm@5824
   297
wenzelm@6404
   298
val default_text = named_method "default";
wenzelm@6404
   299
val finish_text = named_method "finish";
wenzelm@5824
   300
wenzelm@5824
   301
fun proof opt_text state =
wenzelm@5824
   302
  state
wenzelm@5824
   303
  |> Proof.assert_backward
wenzelm@6404
   304
  |> refine (if_none opt_text default_text)
wenzelm@5824
   305
  |> Seq.map Proof.enter_forward;
wenzelm@5824
   306
wenzelm@6404
   307
fun local_qed opt_text = Proof.local_qed (refine (if_none opt_text finish_text));
wenzelm@6736
   308
fun local_terminal_proof text pr = Seq.THEN (proof (Some text), local_qed None pr);
wenzelm@6404
   309
val local_immediate_proof = local_terminal_proof (Basic (K same));
wenzelm@6404
   310
val local_default_proof = local_terminal_proof default_text;
wenzelm@5824
   311
wenzelm@6404
   312
fun global_qed alt_name alt_atts opt_text =
wenzelm@6404
   313
  Proof.global_qed (refine (if_none opt_text finish_text)) alt_name alt_atts;
wenzelm@5824
   314
wenzelm@6404
   315
fun global_terminal_proof text = Seq.hd o Seq.map (global_qed None None None) o proof (Some text);
wenzelm@6404
   316
val global_immediate_proof = global_terminal_proof (Basic (K same));
wenzelm@6404
   317
val global_default_proof = global_terminal_proof default_text;
wenzelm@5824
   318
wenzelm@5824
   319
wenzelm@5824
   320
wenzelm@5824
   321
(** theory setup **)
wenzelm@5824
   322
wenzelm@5824
   323
(* pure_methods *)
wenzelm@5824
   324
wenzelm@5824
   325
val pure_methods =
wenzelm@5824
   326
 [("fail", no_args fail, "force failure"),
wenzelm@5824
   327
  ("succeed", no_args succeed, "succeed"),
wenzelm@6108
   328
  ("same", no_args same, "insert facts, nothing else"),
wenzelm@5824
   329
  ("assumption", no_args assumption, "proof by assumption"),
wenzelm@5824
   330
  ("finish", no_args asm_finish, "finish proof by assumption"),
wenzelm@6532
   331
  ("fold", thms_args fold, "fold definitions"),
wenzelm@6532
   332
  ("unfold", thms_args unfold, "unfold definitions"),
wenzelm@6849
   333
  ("rule", thms_args rule, "apply some rule")];
wenzelm@5824
   334
wenzelm@5824
   335
wenzelm@5824
   336
(* setup *)
wenzelm@5824
   337
wenzelm@5824
   338
val setup = [MethodsData.init, add_methods pure_methods];
wenzelm@5824
   339
wenzelm@5824
   340
wenzelm@5824
   341
end;
wenzelm@5824
   342
wenzelm@5824
   343
wenzelm@5824
   344
structure BasicMethod: BASIC_METHOD = Method;
wenzelm@5824
   345
open BasicMethod;