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