src/Pure/goal.ML
author wenzelm
Sat Sep 01 19:27:28 2012 +0200 (2012-09-01)
changeset 49061 7449b804073b
parent 49041 9edfd36a0355
child 49829 2bc5924b117f
permissions -rw-r--r--
central management of forked goals wrt. transaction id;
clarified stable_exec_id: consider ragular failure as stable;
more robust counting of forked proofs, with global reset after cancellation due to document editing;
wenzelm@17980
     1
(*  Title:      Pure/goal.ML
wenzelm@29345
     2
    Author:     Makarius
wenzelm@17980
     3
wenzelm@49061
     4
Goals in tactical theorem proving, with support for forked proofs.
wenzelm@17980
     5
*)
wenzelm@17980
     6
wenzelm@17980
     7
signature BASIC_GOAL =
wenzelm@17980
     8
sig
wenzelm@32738
     9
  val parallel_proofs: int Unsynchronized.ref
wenzelm@41703
    10
  val parallel_proofs_threshold: int Unsynchronized.ref
wenzelm@17980
    11
  val SELECT_GOAL: tactic -> int -> tactic
wenzelm@23418
    12
  val CONJUNCTS: tactic -> int -> tactic
wenzelm@23414
    13
  val PRECISE_CONJUNCTS: int -> tactic -> int -> tactic
wenzelm@32365
    14
  val PARALLEL_CHOICE: tactic list -> tactic
wenzelm@32365
    15
  val PARALLEL_GOALS: tactic -> tactic
wenzelm@17980
    16
end;
wenzelm@17980
    17
wenzelm@17980
    18
signature GOAL =
wenzelm@17980
    19
sig
wenzelm@17980
    20
  include BASIC_GOAL
wenzelm@17980
    21
  val init: cterm -> thm
wenzelm@18027
    22
  val protect: thm -> thm
wenzelm@17980
    23
  val conclude: thm -> thm
wenzelm@32197
    24
  val check_finished: Proof.context -> thm -> unit
wenzelm@32197
    25
  val finish: Proof.context -> thm -> thm
wenzelm@21604
    26
  val norm_result: thm -> thm
wenzelm@41677
    27
  val fork_name: string -> (unit -> 'a) -> 'a future
wenzelm@37186
    28
  val fork: (unit -> 'a) -> 'a future
wenzelm@49061
    29
  val peek_futures: serial -> unit future list
wenzelm@49061
    30
  val cancel_futures: unit -> unit
wenzelm@49012
    31
  val future_enabled_level: int -> bool
wenzelm@29448
    32
  val future_enabled: unit -> bool
wenzelm@49012
    33
  val future_enabled_nested: int -> bool
wenzelm@28973
    34
  val future_result: Proof.context -> thm future -> term -> thm
wenzelm@23356
    35
  val prove_internal: cterm list -> cterm -> (thm list -> tactic) -> thm
wenzelm@20290
    36
  val prove_multi: Proof.context -> string list -> term list -> term list ->
wenzelm@20290
    37
    ({prems: thm list, context: Proof.context} -> tactic) -> thm list
wenzelm@28446
    38
  val prove_future: Proof.context -> string list -> term list -> term ->
wenzelm@28340
    39
    ({prems: thm list, context: Proof.context} -> tactic) -> thm
wenzelm@20290
    40
  val prove: Proof.context -> string list -> term list -> term ->
wenzelm@20290
    41
    ({prems: thm list, context: Proof.context} -> tactic) -> thm
wenzelm@26713
    42
  val prove_global: theory -> string list -> term list -> term ->
wenzelm@26713
    43
    ({prems: thm list, context: Proof.context} -> tactic) -> thm
wenzelm@19184
    44
  val extract: int -> int -> thm -> thm Seq.seq
wenzelm@19184
    45
  val retrofit: int -> int -> thm -> thm -> thm Seq.seq
wenzelm@23418
    46
  val conjunction_tac: int -> tactic
wenzelm@23414
    47
  val precise_conjunction_tac: int -> int -> tactic
wenzelm@23418
    48
  val recover_conjunction_tac: tactic
wenzelm@21687
    49
  val norm_hhf_tac: int -> tactic
wenzelm@21687
    50
  val compose_hhf_tac: thm -> int -> tactic
wenzelm@23237
    51
  val assume_rule_tac: Proof.context -> int -> tactic
wenzelm@17980
    52
end;
wenzelm@17980
    53
wenzelm@17980
    54
structure Goal: GOAL =
wenzelm@17980
    55
struct
wenzelm@17980
    56
wenzelm@18027
    57
(** goals **)
wenzelm@18027
    58
wenzelm@18027
    59
(*
wenzelm@18027
    60
  -------- (init)
wenzelm@18027
    61
  C ==> #C
wenzelm@18027
    62
*)
wenzelm@20290
    63
val init =
wenzelm@22902
    64
  let val A = #1 (Thm.dest_implies (Thm.cprop_of Drule.protectI))
wenzelm@20290
    65
  in fn C => Thm.instantiate ([], [(A, C)]) Drule.protectI end;
wenzelm@17980
    66
wenzelm@17980
    67
(*
wenzelm@18119
    68
   C
wenzelm@18119
    69
  --- (protect)
wenzelm@18119
    70
  #C
wenzelm@17980
    71
*)
wenzelm@29345
    72
fun protect th = Drule.comp_no_flatten (th, 0) 1 Drule.protectI;
wenzelm@17980
    73
wenzelm@17980
    74
(*
wenzelm@18027
    75
  A ==> ... ==> #C
wenzelm@18027
    76
  ---------------- (conclude)
wenzelm@17980
    77
  A ==> ... ==> C
wenzelm@17980
    78
*)
wenzelm@29345
    79
fun conclude th = Drule.comp_no_flatten (th, Thm.nprems_of th) 1 Drule.protectD;
wenzelm@17980
    80
wenzelm@17980
    81
(*
wenzelm@18027
    82
  #C
wenzelm@18027
    83
  --- (finish)
wenzelm@18027
    84
   C
wenzelm@17983
    85
*)
wenzelm@32197
    86
fun check_finished ctxt th =
wenzelm@17980
    87
  (case Thm.nprems_of th of
wenzelm@32197
    88
    0 => ()
wenzelm@17980
    89
  | n => raise THM ("Proof failed.\n" ^
wenzelm@32197
    90
      Pretty.string_of (Pretty.chunks
wenzelm@39125
    91
        (Goal_Display.pretty_goals
wenzelm@39125
    92
          (ctxt
wenzelm@39125
    93
            |> Config.put Goal_Display.goals_limit n
wenzelm@39125
    94
            |> Config.put Goal_Display.show_main_goal true) th)) ^
wenzelm@32197
    95
      "\n" ^ string_of_int n ^ " unsolved goal(s)!", 0, [th]));
wenzelm@32197
    96
wenzelm@32197
    97
fun finish ctxt th = (check_finished ctxt th; conclude th);
wenzelm@17980
    98
wenzelm@17980
    99
wenzelm@18027
   100
wenzelm@18027
   101
(** results **)
wenzelm@18027
   102
wenzelm@28340
   103
(* normal form *)
wenzelm@28340
   104
wenzelm@21604
   105
val norm_result =
wenzelm@21604
   106
  Drule.flexflex_unique
wenzelm@41228
   107
  #> Raw_Simplifier.norm_hhf_protect
wenzelm@21604
   108
  #> Thm.strip_shyps
wenzelm@21604
   109
  #> Drule.zero_var_indexes;
wenzelm@21604
   110
wenzelm@21604
   111
wenzelm@41703
   112
(* forked proofs *)
wenzelm@41703
   113
wenzelm@49061
   114
local
wenzelm@41703
   115
wenzelm@49061
   116
val forked_proofs =
wenzelm@49061
   117
  Synchronized.var "forked_proofs"
wenzelm@49061
   118
    (0, []: Future.group list, Inttab.empty: unit future list Inttab.table);
wenzelm@49061
   119
wenzelm@49061
   120
fun count_forked i =
wenzelm@49061
   121
  Synchronized.change forked_proofs (fn (m, groups, tab) =>
wenzelm@41703
   122
    let
wenzelm@41703
   123
      val n = m + i;
wenzelm@41703
   124
      val _ =
wenzelm@41776
   125
        Multithreading.tracing 2 (fn () =>
wenzelm@41703
   126
          ("PROOFS " ^ Time.toString (Time.now ()) ^ ": " ^ string_of_int n));
wenzelm@49061
   127
    in (n, groups, tab) end);
wenzelm@49061
   128
wenzelm@49061
   129
fun register_forked id future =
wenzelm@49061
   130
  Synchronized.change forked_proofs (fn (m, groups, tab) =>
wenzelm@49061
   131
    let
wenzelm@49061
   132
      val groups' = Task_Queue.group_of_task (Future.task_of future) :: groups;
wenzelm@49061
   133
      val tab' = Inttab.cons_list (id, Future.map (K ()) future) tab;
wenzelm@49061
   134
    in (m, groups', tab') end);
wenzelm@37186
   135
wenzelm@49036
   136
fun status task markups =
wenzelm@49036
   137
  let val props = Markup.properties [(Isabelle_Markup.taskN, Task_Queue.str_of_task task)]
wenzelm@49036
   138
  in Output.status (implode (map (Markup.markup_only o props) markups)) end;
wenzelm@49009
   139
wenzelm@49061
   140
in
wenzelm@49061
   141
wenzelm@41677
   142
fun fork_name name e =
wenzelm@41703
   143
  uninterruptible (fn _ => fn () =>
wenzelm@41703
   144
    let
wenzelm@49061
   145
      val id =
wenzelm@49061
   146
        (case Position.get_id (Position.thread_data ()) of
wenzelm@49061
   147
          NONE => 0
wenzelm@49061
   148
        | SOME id => Markup.parse_int id);
wenzelm@49061
   149
      val _ = count_forked 1;
wenzelm@41703
   150
      val future =
wenzelm@44302
   151
        (singleton o Future.forks)
wenzelm@47415
   152
          {name = name, group = NONE, deps = [], pri = ~1, interrupts = false}
wenzelm@49036
   153
          (fn () =>
wenzelm@49036
   154
            let
wenzelm@49036
   155
              val task = the (Future.worker_task ());
wenzelm@49036
   156
              val _ = status task [Isabelle_Markup.running];
wenzelm@49036
   157
              val result = Exn.capture (Future.interruptible_task e) ();
wenzelm@49037
   158
              val _ = status task [Isabelle_Markup.finished, Isabelle_Markup.joined];
wenzelm@49036
   159
              val _ =
wenzelm@49041
   160
                (case result of
wenzelm@49041
   161
                  Exn.Res _ => ()
wenzelm@49041
   162
                | Exn.Exn exn =>
wenzelm@49041
   163
                    (status task [Isabelle_Markup.failed];
wenzelm@49041
   164
                     Output.report (Markup.markup_only Isabelle_Markup.bad);
wenzelm@49041
   165
                     Output.error_msg (ML_Compiler.exn_message exn)));
wenzelm@49061
   166
              val _ = count_forked ~1;
wenzelm@49036
   167
            in Exn.release result end);
wenzelm@49036
   168
      val _ = status (Future.task_of future) [Isabelle_Markup.forked];
wenzelm@49061
   169
      val _ = register_forked id future;
wenzelm@41703
   170
    in future end) ();
wenzelm@29448
   171
wenzelm@41677
   172
fun fork e = fork_name "Goal.fork" e;
wenzelm@41677
   173
wenzelm@49061
   174
fun forked_count () = #1 (Synchronized.value forked_proofs);
wenzelm@49061
   175
wenzelm@49061
   176
fun peek_futures id =
wenzelm@49061
   177
  Inttab.lookup_list (#3 (Synchronized.value forked_proofs)) id;
wenzelm@49061
   178
wenzelm@49061
   179
fun cancel_futures () =
wenzelm@49061
   180
  Synchronized.change forked_proofs (fn (m, groups, tab) =>
wenzelm@49061
   181
    (List.app Future.cancel_group groups; (0, [], Inttab.empty)));
wenzelm@49061
   182
wenzelm@49061
   183
end;
wenzelm@49061
   184
wenzelm@41677
   185
wenzelm@41703
   186
(* scheduling parameters *)
wenzelm@41703
   187
wenzelm@32738
   188
val parallel_proofs = Unsynchronized.ref 1;
wenzelm@41819
   189
val parallel_proofs_threshold = Unsynchronized.ref 50;
wenzelm@29448
   190
wenzelm@49012
   191
fun future_enabled_level n =
wenzelm@49012
   192
  Multithreading.enabled () andalso ! parallel_proofs >= n andalso
wenzelm@41703
   193
  is_some (Future.worker_task ());
wenzelm@32061
   194
wenzelm@49012
   195
fun future_enabled () = future_enabled_level 1;
wenzelm@49012
   196
wenzelm@49012
   197
fun future_enabled_nested n =
wenzelm@49012
   198
  future_enabled_level n andalso
wenzelm@49061
   199
  forked_count () < ! parallel_proofs_threshold * Multithreading.max_threads_value ();
wenzelm@29448
   200
wenzelm@29448
   201
wenzelm@28446
   202
(* future_result *)
wenzelm@28340
   203
wenzelm@28446
   204
fun future_result ctxt result prop =
wenzelm@28340
   205
  let
wenzelm@42360
   206
    val thy = Proof_Context.theory_of ctxt;
wenzelm@28340
   207
    val _ = Context.reject_draft thy;
wenzelm@28340
   208
    val cert = Thm.cterm_of thy;
wenzelm@28340
   209
    val certT = Thm.ctyp_of thy;
wenzelm@28340
   210
wenzelm@30473
   211
    val assms = Assumption.all_assms_of ctxt;
wenzelm@28340
   212
    val As = map Thm.term_of assms;
wenzelm@28340
   213
wenzelm@28340
   214
    val xs = map Free (fold Term.add_frees (prop :: As) []);
wenzelm@28340
   215
    val fixes = map cert xs;
wenzelm@28340
   216
wenzelm@28340
   217
    val tfrees = fold Term.add_tfrees (prop :: As) [];
wenzelm@28340
   218
    val instT = map (fn (a, S) => (certT (TVar ((a, 0), S)), certT (TFree (a, S)))) tfrees;
wenzelm@28340
   219
wenzelm@28340
   220
    val global_prop =
wenzelm@45344
   221
      cert (Logic.varify_types_global (fold_rev Logic.all xs (Logic.list_implies (As, prop))))
wenzelm@32056
   222
      |> Thm.weaken_sorts (Variable.sorts_of ctxt);
wenzelm@28973
   223
    val global_result = result |> Future.map
wenzelm@33768
   224
      (Drule.flexflex_unique #>
wenzelm@33768
   225
        Thm.adjust_maxidx_thm ~1 #>
wenzelm@28973
   226
        Drule.implies_intr_list assms #>
wenzelm@28973
   227
        Drule.forall_intr_list fixes #>
wenzelm@36613
   228
        Thm.generalize (map #1 tfrees, []) 0 #>
wenzelm@36613
   229
        Thm.strip_shyps);
wenzelm@28340
   230
    val local_result =
wenzelm@32056
   231
      Thm.future global_result global_prop
wenzelm@28340
   232
      |> Thm.instantiate (instT, [])
wenzelm@28340
   233
      |> Drule.forall_elim_list fixes
wenzelm@28340
   234
      |> fold (Thm.elim_implies o Thm.assume) assms;
wenzelm@28340
   235
  in local_result end;
wenzelm@28340
   236
wenzelm@28340
   237
wenzelm@18027
   238
wenzelm@18027
   239
(** tactical theorem proving **)
wenzelm@18027
   240
wenzelm@23356
   241
(* prove_internal -- minimal checks, no normalization of result! *)
wenzelm@20250
   242
wenzelm@23356
   243
fun prove_internal casms cprop tac =
wenzelm@20250
   244
  (case SINGLE (tac (map Assumption.assume casms)) (init cprop) of
wenzelm@32197
   245
    SOME th => Drule.implies_intr_list casms
wenzelm@32197
   246
      (finish (Syntax.init_pretty_global (Thm.theory_of_thm th)) th)
wenzelm@38875
   247
  | NONE => error "Tactic failed");
wenzelm@20250
   248
wenzelm@20250
   249
wenzelm@28340
   250
(* prove_common etc. *)
wenzelm@17986
   251
wenzelm@28340
   252
fun prove_common immediate ctxt xs asms props tac =
wenzelm@17980
   253
  let
wenzelm@42360
   254
    val thy = Proof_Context.theory_of ctxt;
wenzelm@26939
   255
    val string_of_term = Syntax.string_of_term ctxt;
wenzelm@20056
   256
wenzelm@28355
   257
    val pos = Position.thread_data ();
wenzelm@20250
   258
    fun err msg = cat_error msg
wenzelm@20250
   259
      ("The error(s) above occurred for the goal statement:\n" ^
wenzelm@28355
   260
        string_of_term (Logic.list_implies (asms, Logic.mk_conjunction_list props)) ^
wenzelm@48992
   261
        (case Position.here pos of "" => "" | s => "\n" ^ s));
wenzelm@17980
   262
wenzelm@20250
   263
    fun cert_safe t = Thm.cterm_of thy (Envir.beta_norm (Term.no_dummy_patterns t))
wenzelm@17980
   264
      handle TERM (msg, _) => err msg | TYPE (msg, _, _) => err msg;
wenzelm@20250
   265
    val casms = map cert_safe asms;
wenzelm@20250
   266
    val cprops = map cert_safe props;
wenzelm@17980
   267
wenzelm@20250
   268
    val (prems, ctxt') = ctxt
wenzelm@20250
   269
      |> Variable.add_fixes_direct xs
wenzelm@27218
   270
      |> fold Variable.declare_term (asms @ props)
wenzelm@26713
   271
      |> Assumption.add_assumes casms
wenzelm@26713
   272
      ||> Variable.set_body true;
wenzelm@28619
   273
    val sorts = Variable.sorts_of ctxt';
wenzelm@17980
   274
wenzelm@28619
   275
    val stmt = Thm.weaken_sorts sorts (Conjunction.mk_conjunction_balanced cprops);
wenzelm@28340
   276
wenzelm@28340
   277
    fun result () =
wenzelm@28340
   278
      (case SINGLE (tac {prems = prems, context = ctxt'}) (init stmt) of
wenzelm@38875
   279
        NONE => err "Tactic failed"
wenzelm@28340
   280
      | SOME st =>
wenzelm@32197
   281
          let val res = finish ctxt' st handle THM (msg, _, _) => err msg in
wenzelm@28619
   282
            if Unify.matches_list thy [Thm.term_of stmt] [Thm.prop_of res]
wenzelm@28619
   283
            then Thm.check_shyps sorts res
wenzelm@28340
   284
            else err ("Proved a different theorem: " ^ string_of_term (Thm.prop_of res))
wenzelm@28340
   285
          end);
wenzelm@28340
   286
    val res =
wenzelm@29448
   287
      if immediate orelse #maxidx (Thm.rep_cterm stmt) >= 0 orelse not (future_enabled ())
wenzelm@29088
   288
      then result ()
wenzelm@37186
   289
      else future_result ctxt' (fork result) (Thm.term_of stmt);
wenzelm@17980
   290
  in
wenzelm@28340
   291
    Conjunction.elim_balanced (length props) res
wenzelm@20290
   292
    |> map (Assumption.export false ctxt' ctxt)
wenzelm@20056
   293
    |> Variable.export ctxt' ctxt
wenzelm@20250
   294
    |> map Drule.zero_var_indexes
wenzelm@17980
   295
  end;
wenzelm@17980
   296
wenzelm@28341
   297
val prove_multi = prove_common true;
wenzelm@17980
   298
wenzelm@28446
   299
fun prove_future ctxt xs asms prop tac = hd (prove_common false ctxt xs asms [prop] tac);
wenzelm@28340
   300
fun prove ctxt xs asms prop tac = hd (prove_common true ctxt xs asms [prop] tac);
wenzelm@20056
   301
wenzelm@20056
   302
fun prove_global thy xs asms prop tac =
wenzelm@42360
   303
  Drule.export_without_context (prove (Proof_Context.init_global thy) xs asms prop tac);
wenzelm@18027
   304
wenzelm@18027
   305
wenzelm@17980
   306
wenzelm@21687
   307
(** goal structure **)
wenzelm@21687
   308
wenzelm@21687
   309
(* nested goals *)
wenzelm@18207
   310
wenzelm@19184
   311
fun extract i n st =
wenzelm@19184
   312
  (if i < 1 orelse n < 1 orelse i + n - 1 > Thm.nprems_of st then Seq.empty
wenzelm@19184
   313
   else if n = 1 then Seq.single (Thm.cprem_of st i)
wenzelm@23418
   314
   else
wenzelm@23418
   315
     Seq.single (Conjunction.mk_conjunction_balanced (map (Thm.cprem_of st) (i upto i + n - 1))))
wenzelm@20260
   316
  |> Seq.map (Thm.adjust_maxidx_cterm ~1 #> init);
wenzelm@17980
   317
wenzelm@19221
   318
fun retrofit i n st' st =
wenzelm@19221
   319
  (if n = 1 then st
wenzelm@23418
   320
   else st |> Drule.with_subgoal i (Conjunction.uncurry_balanced n))
wenzelm@19221
   321
  |> Thm.compose_no_flatten false (conclude st', Thm.nprems_of st') i;
wenzelm@18207
   322
wenzelm@17980
   323
fun SELECT_GOAL tac i st =
wenzelm@19191
   324
  if Thm.nprems_of st = 1 andalso i = 1 then tac st
wenzelm@19184
   325
  else Seq.lifts (retrofit i 1) (Seq.maps tac (extract i 1 st)) st;
wenzelm@17980
   326
wenzelm@21687
   327
wenzelm@21687
   328
(* multiple goals *)
wenzelm@21687
   329
wenzelm@23418
   330
fun precise_conjunction_tac 0 i = eq_assume_tac i
wenzelm@23418
   331
  | precise_conjunction_tac 1 i = SUBGOAL (K all_tac) i
wenzelm@23418
   332
  | precise_conjunction_tac n i = PRIMITIVE (Drule.with_subgoal i (Conjunction.curry_balanced n));
wenzelm@23414
   333
wenzelm@23418
   334
val adhoc_conjunction_tac = REPEAT_ALL_NEW
wenzelm@23418
   335
  (SUBGOAL (fn (goal, i) =>
wenzelm@23418
   336
    if can Logic.dest_conjunction goal then rtac Conjunction.conjunctionI i
wenzelm@23418
   337
    else no_tac));
wenzelm@21687
   338
wenzelm@23418
   339
val conjunction_tac = SUBGOAL (fn (goal, i) =>
wenzelm@23418
   340
  precise_conjunction_tac (length (Logic.dest_conjunctions goal)) i ORELSE
wenzelm@23418
   341
  TRY (adhoc_conjunction_tac i));
wenzelm@21687
   342
wenzelm@23418
   343
val recover_conjunction_tac = PRIMITIVE (fn th =>
wenzelm@23418
   344
  Conjunction.uncurry_balanced (Thm.nprems_of th) th);
wenzelm@23414
   345
wenzelm@23414
   346
fun PRECISE_CONJUNCTS n tac =
wenzelm@23414
   347
  SELECT_GOAL (precise_conjunction_tac n 1
wenzelm@23414
   348
    THEN tac
wenzelm@23418
   349
    THEN recover_conjunction_tac);
wenzelm@23414
   350
wenzelm@21687
   351
fun CONJUNCTS tac =
wenzelm@21687
   352
  SELECT_GOAL (conjunction_tac 1
wenzelm@21687
   353
    THEN tac
wenzelm@23418
   354
    THEN recover_conjunction_tac);
wenzelm@21687
   355
wenzelm@21687
   356
wenzelm@21687
   357
(* hhf normal form *)
wenzelm@21687
   358
wenzelm@21687
   359
val norm_hhf_tac =
wenzelm@21687
   360
  rtac Drule.asm_rl  (*cheap approximation -- thanks to builtin Logic.flatten_params*)
wenzelm@21687
   361
  THEN' SUBGOAL (fn (t, i) =>
wenzelm@21687
   362
    if Drule.is_norm_hhf t then all_tac
wenzelm@41228
   363
    else rewrite_goal_tac Drule.norm_hhf_eqs i);
wenzelm@21687
   364
wenzelm@25301
   365
fun compose_hhf_tac th i st =
wenzelm@25301
   366
  PRIMSEQ (Thm.bicompose false (false, Drule.lift_all (Thm.cprem_of st i) th, 0) i) st;
wenzelm@21687
   367
wenzelm@23237
   368
wenzelm@23237
   369
(* non-atomic goal assumptions *)
wenzelm@23237
   370
wenzelm@23356
   371
fun non_atomic (Const ("==>", _) $ _ $ _) = true
wenzelm@23356
   372
  | non_atomic (Const ("all", _) $ _) = true
wenzelm@23356
   373
  | non_atomic _ = false;
wenzelm@23356
   374
wenzelm@23237
   375
fun assume_rule_tac ctxt = norm_hhf_tac THEN' CSUBGOAL (fn (goal, i) =>
wenzelm@23237
   376
  let
wenzelm@42495
   377
    val ((_, goal'), ctxt') = Variable.focus_cterm goal ctxt;
wenzelm@23237
   378
    val goal'' = Drule.cterm_rule (singleton (Variable.export ctxt' ctxt)) goal';
wenzelm@23356
   379
    val Rs = filter (non_atomic o Thm.term_of) (Drule.strip_imp_prems goal'');
wenzelm@23237
   380
    val tacs = Rs |> map (fn R =>
wenzelm@41228
   381
      Tactic.etac (Raw_Simplifier.norm_hhf (Thm.trivial R)) THEN_ALL_NEW assume_tac);
wenzelm@23237
   382
  in fold_rev (curry op APPEND') tacs (K no_tac) i end);
wenzelm@23237
   383
wenzelm@32365
   384
wenzelm@32365
   385
(* parallel tacticals *)
wenzelm@32365
   386
wenzelm@32365
   387
(*parallel choice of single results*)
wenzelm@32365
   388
fun PARALLEL_CHOICE tacs st =
wenzelm@32365
   389
  (case Par_List.get_some (fn tac => SINGLE tac st) tacs of
wenzelm@32365
   390
    NONE => Seq.empty
wenzelm@32365
   391
  | SOME st' => Seq.single st');
wenzelm@32365
   392
wenzelm@32365
   393
(*parallel refinement of non-schematic goal by single results*)
wenzelm@32788
   394
exception FAILED of unit;
wenzelm@42370
   395
fun PARALLEL_GOALS tac =
wenzelm@42370
   396
  Thm.adjust_maxidx_thm ~1 #>
wenzelm@42370
   397
  (fn st =>
wenzelm@42371
   398
    if not (Multithreading.enabled ()) orelse Thm.maxidx_of st >= 0 orelse Thm.nprems_of st <= 1
wenzelm@42370
   399
    then DETERM tac st
wenzelm@42370
   400
    else
wenzelm@42370
   401
      let
wenzelm@42370
   402
        fun try_tac g =
wenzelm@42370
   403
          (case SINGLE tac g of
wenzelm@42370
   404
            NONE => raise FAILED ()
wenzelm@42370
   405
          | SOME g' => g');
wenzelm@32365
   406
wenzelm@42370
   407
        val goals = Drule.strip_imp_prems (Thm.cprop_of st);
wenzelm@42370
   408
        val results = Par_List.map (try_tac o init) goals;
wenzelm@42370
   409
      in ALLGOALS (fn i => retrofit i 1 (nth results (i - 1))) st end
wenzelm@42370
   410
      handle FAILED () => Seq.empty);
wenzelm@32365
   411
wenzelm@18207
   412
end;
wenzelm@18207
   413
wenzelm@32365
   414
structure Basic_Goal: BASIC_GOAL = Goal;
wenzelm@32365
   415
open Basic_Goal;