src/Pure/goal.ML
author wenzelm
Sat May 29 19:46:29 2010 +0200 (2010-05-29)
changeset 37186 349e9223c685
parent 36613 f3157c288aca
child 37690 b16231572c61
permissions -rw-r--r--
explicit markup for forked goals, as indicated by Goal.fork;
accumulate pending forks within command state and hilight accordingly;
Isabelle_Process: enforce future_terminal_proof, which gives some impression of non-linear/parallel checking;
wenzelm@17980
     1
(*  Title:      Pure/goal.ML
wenzelm@29345
     2
    Author:     Makarius
wenzelm@17980
     3
wenzelm@18139
     4
Goals in tactical theorem proving.
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@17980
    10
  val SELECT_GOAL: tactic -> int -> tactic
wenzelm@23418
    11
  val CONJUNCTS: tactic -> int -> tactic
wenzelm@23414
    12
  val PRECISE_CONJUNCTS: int -> tactic -> int -> tactic
wenzelm@32365
    13
  val PARALLEL_CHOICE: tactic list -> tactic
wenzelm@32365
    14
  val PARALLEL_GOALS: tactic -> tactic
wenzelm@17980
    15
end;
wenzelm@17980
    16
wenzelm@17980
    17
signature GOAL =
wenzelm@17980
    18
sig
wenzelm@17980
    19
  include BASIC_GOAL
wenzelm@17980
    20
  val init: cterm -> thm
wenzelm@18027
    21
  val protect: thm -> thm
wenzelm@17980
    22
  val conclude: thm -> thm
wenzelm@32197
    23
  val check_finished: Proof.context -> thm -> unit
wenzelm@32197
    24
  val finish: Proof.context -> thm -> thm
wenzelm@21604
    25
  val norm_result: thm -> thm
wenzelm@37186
    26
  val fork: (unit -> 'a) -> 'a future
wenzelm@29448
    27
  val future_enabled: unit -> bool
wenzelm@32061
    28
  val local_future_enabled: unit -> bool
wenzelm@37186
    29
  val local_future_enforced: unit -> bool
wenzelm@28973
    30
  val future_result: Proof.context -> thm future -> term -> thm
wenzelm@23356
    31
  val prove_internal: cterm list -> cterm -> (thm list -> tactic) -> thm
wenzelm@20290
    32
  val prove_multi: Proof.context -> string list -> term list -> term list ->
wenzelm@20290
    33
    ({prems: thm list, context: Proof.context} -> tactic) -> thm list
wenzelm@28446
    34
  val prove_future: Proof.context -> string list -> term list -> term ->
wenzelm@28340
    35
    ({prems: thm list, context: Proof.context} -> tactic) -> thm
wenzelm@20290
    36
  val prove: Proof.context -> string list -> term list -> term ->
wenzelm@20290
    37
    ({prems: thm list, context: Proof.context} -> tactic) -> thm
wenzelm@26713
    38
  val prove_global: theory -> string list -> term list -> term ->
wenzelm@26713
    39
    ({prems: thm list, context: Proof.context} -> tactic) -> thm
wenzelm@19184
    40
  val extract: int -> int -> thm -> thm Seq.seq
wenzelm@19184
    41
  val retrofit: int -> int -> thm -> thm -> thm Seq.seq
wenzelm@23418
    42
  val conjunction_tac: int -> tactic
wenzelm@23414
    43
  val precise_conjunction_tac: int -> int -> tactic
wenzelm@23418
    44
  val recover_conjunction_tac: tactic
wenzelm@21687
    45
  val norm_hhf_tac: int -> tactic
wenzelm@21687
    46
  val compose_hhf_tac: thm -> int -> tactic
wenzelm@23237
    47
  val assume_rule_tac: Proof.context -> int -> tactic
wenzelm@17980
    48
end;
wenzelm@17980
    49
wenzelm@17980
    50
structure Goal: GOAL =
wenzelm@17980
    51
struct
wenzelm@17980
    52
wenzelm@18027
    53
(** goals **)
wenzelm@18027
    54
wenzelm@18027
    55
(*
wenzelm@18027
    56
  -------- (init)
wenzelm@18027
    57
  C ==> #C
wenzelm@18027
    58
*)
wenzelm@20290
    59
val init =
wenzelm@22902
    60
  let val A = #1 (Thm.dest_implies (Thm.cprop_of Drule.protectI))
wenzelm@20290
    61
  in fn C => Thm.instantiate ([], [(A, C)]) Drule.protectI end;
wenzelm@17980
    62
wenzelm@17980
    63
(*
wenzelm@18119
    64
   C
wenzelm@18119
    65
  --- (protect)
wenzelm@18119
    66
  #C
wenzelm@17980
    67
*)
wenzelm@29345
    68
fun protect th = Drule.comp_no_flatten (th, 0) 1 Drule.protectI;
wenzelm@17980
    69
wenzelm@17980
    70
(*
wenzelm@18027
    71
  A ==> ... ==> #C
wenzelm@18027
    72
  ---------------- (conclude)
wenzelm@17980
    73
  A ==> ... ==> C
wenzelm@17980
    74
*)
wenzelm@29345
    75
fun conclude th = Drule.comp_no_flatten (th, Thm.nprems_of th) 1 Drule.protectD;
wenzelm@17980
    76
wenzelm@17980
    77
(*
wenzelm@18027
    78
  #C
wenzelm@18027
    79
  --- (finish)
wenzelm@18027
    80
   C
wenzelm@17983
    81
*)
wenzelm@32197
    82
fun check_finished ctxt th =
wenzelm@17980
    83
  (case Thm.nprems_of th of
wenzelm@32197
    84
    0 => ()
wenzelm@17980
    85
  | n => raise THM ("Proof failed.\n" ^
wenzelm@32197
    86
      Pretty.string_of (Pretty.chunks
wenzelm@32197
    87
        (Goal_Display.pretty_goals ctxt {total = true, main = true, maxgoals = n} th)) ^
wenzelm@32197
    88
      "\n" ^ string_of_int n ^ " unsolved goal(s)!", 0, [th]));
wenzelm@32197
    89
wenzelm@32197
    90
fun finish ctxt th = (check_finished ctxt th; conclude th);
wenzelm@17980
    91
wenzelm@17980
    92
wenzelm@18027
    93
wenzelm@18027
    94
(** results **)
wenzelm@18027
    95
wenzelm@28340
    96
(* normal form *)
wenzelm@28340
    97
wenzelm@21604
    98
val norm_result =
wenzelm@21604
    99
  Drule.flexflex_unique
wenzelm@21604
   100
  #> MetaSimplifier.norm_hhf_protect
wenzelm@21604
   101
  #> Thm.strip_shyps
wenzelm@21604
   102
  #> Drule.zero_var_indexes;
wenzelm@21604
   103
wenzelm@21604
   104
wenzelm@37186
   105
(* parallel proofs *)
wenzelm@37186
   106
wenzelm@37186
   107
fun fork e = Future.fork_pri ~1 (fn () =>
wenzelm@37186
   108
  let
wenzelm@37186
   109
    val _ = Output.status (Markup.markup Markup.forked "");
wenzelm@37186
   110
    val x = e ();  (*sic*)
wenzelm@37186
   111
    val _ = Output.status (Markup.markup Markup.joined "");
wenzelm@37186
   112
  in x end);
wenzelm@29448
   113
wenzelm@32738
   114
val parallel_proofs = Unsynchronized.ref 1;
wenzelm@29448
   115
wenzelm@29448
   116
fun future_enabled () =
wenzelm@32255
   117
  Multithreading.enabled () andalso Future.is_worker () andalso ! parallel_proofs >= 1;
wenzelm@32061
   118
wenzelm@32061
   119
fun local_future_enabled () = future_enabled () andalso ! parallel_proofs >= 2;
wenzelm@37186
   120
fun local_future_enforced () = future_enabled () andalso ! parallel_proofs >= 3;
wenzelm@29448
   121
wenzelm@29448
   122
wenzelm@28446
   123
(* future_result *)
wenzelm@28340
   124
wenzelm@28446
   125
fun future_result ctxt result prop =
wenzelm@28340
   126
  let
wenzelm@28340
   127
    val thy = ProofContext.theory_of ctxt;
wenzelm@28340
   128
    val _ = Context.reject_draft thy;
wenzelm@28340
   129
    val cert = Thm.cterm_of thy;
wenzelm@28340
   130
    val certT = Thm.ctyp_of thy;
wenzelm@28340
   131
wenzelm@30473
   132
    val assms = Assumption.all_assms_of ctxt;
wenzelm@28340
   133
    val As = map Thm.term_of assms;
wenzelm@28340
   134
wenzelm@28340
   135
    val xs = map Free (fold Term.add_frees (prop :: As) []);
wenzelm@28340
   136
    val fixes = map cert xs;
wenzelm@28340
   137
wenzelm@28340
   138
    val tfrees = fold Term.add_tfrees (prop :: As) [];
wenzelm@28340
   139
    val instT = map (fn (a, S) => (certT (TVar ((a, 0), S)), certT (TFree (a, S)))) tfrees;
wenzelm@28340
   140
wenzelm@28340
   141
    val global_prop =
wenzelm@35845
   142
      cert (Term.map_types Logic.varifyT_global
wenzelm@35845
   143
        (fold_rev Logic.all xs (Logic.list_implies (As, prop))))
wenzelm@32056
   144
      |> Thm.weaken_sorts (Variable.sorts_of ctxt);
wenzelm@28973
   145
    val global_result = result |> Future.map
wenzelm@33768
   146
      (Drule.flexflex_unique #>
wenzelm@33768
   147
        Thm.adjust_maxidx_thm ~1 #>
wenzelm@28973
   148
        Drule.implies_intr_list assms #>
wenzelm@28973
   149
        Drule.forall_intr_list fixes #>
wenzelm@36613
   150
        Thm.generalize (map #1 tfrees, []) 0 #>
wenzelm@36613
   151
        Thm.strip_shyps);
wenzelm@28340
   152
    val local_result =
wenzelm@32056
   153
      Thm.future global_result global_prop
wenzelm@28340
   154
      |> Thm.instantiate (instT, [])
wenzelm@28340
   155
      |> Drule.forall_elim_list fixes
wenzelm@28340
   156
      |> fold (Thm.elim_implies o Thm.assume) assms;
wenzelm@28340
   157
  in local_result end;
wenzelm@28340
   158
wenzelm@28340
   159
wenzelm@18027
   160
wenzelm@18027
   161
(** tactical theorem proving **)
wenzelm@18027
   162
wenzelm@23356
   163
(* prove_internal -- minimal checks, no normalization of result! *)
wenzelm@20250
   164
wenzelm@23356
   165
fun prove_internal casms cprop tac =
wenzelm@20250
   166
  (case SINGLE (tac (map Assumption.assume casms)) (init cprop) of
wenzelm@32197
   167
    SOME th => Drule.implies_intr_list casms
wenzelm@32197
   168
      (finish (Syntax.init_pretty_global (Thm.theory_of_thm th)) th)
wenzelm@20250
   169
  | NONE => error "Tactic failed.");
wenzelm@20250
   170
wenzelm@20250
   171
wenzelm@28340
   172
(* prove_common etc. *)
wenzelm@17986
   173
wenzelm@28340
   174
fun prove_common immediate ctxt xs asms props tac =
wenzelm@17980
   175
  let
wenzelm@21516
   176
    val thy = ProofContext.theory_of ctxt;
wenzelm@26939
   177
    val string_of_term = Syntax.string_of_term ctxt;
wenzelm@20056
   178
wenzelm@28355
   179
    val pos = Position.thread_data ();
wenzelm@20250
   180
    fun err msg = cat_error msg
wenzelm@20250
   181
      ("The error(s) above occurred for the goal statement:\n" ^
wenzelm@28355
   182
        string_of_term (Logic.list_implies (asms, Logic.mk_conjunction_list props)) ^
wenzelm@28355
   183
        (case Position.str_of pos of "" => "" | s => "\n" ^ s));
wenzelm@17980
   184
wenzelm@20250
   185
    fun cert_safe t = Thm.cterm_of thy (Envir.beta_norm (Term.no_dummy_patterns t))
wenzelm@17980
   186
      handle TERM (msg, _) => err msg | TYPE (msg, _, _) => err msg;
wenzelm@20250
   187
    val casms = map cert_safe asms;
wenzelm@20250
   188
    val cprops = map cert_safe props;
wenzelm@17980
   189
wenzelm@20250
   190
    val (prems, ctxt') = ctxt
wenzelm@20250
   191
      |> Variable.add_fixes_direct xs
wenzelm@27218
   192
      |> fold Variable.declare_term (asms @ props)
wenzelm@26713
   193
      |> Assumption.add_assumes casms
wenzelm@26713
   194
      ||> Variable.set_body true;
wenzelm@28619
   195
    val sorts = Variable.sorts_of ctxt';
wenzelm@17980
   196
wenzelm@28619
   197
    val stmt = Thm.weaken_sorts sorts (Conjunction.mk_conjunction_balanced cprops);
wenzelm@28340
   198
wenzelm@28340
   199
    fun result () =
wenzelm@28340
   200
      (case SINGLE (tac {prems = prems, context = ctxt'}) (init stmt) of
wenzelm@19774
   201
        NONE => err "Tactic failed."
wenzelm@28340
   202
      | SOME st =>
wenzelm@32197
   203
          let val res = finish ctxt' st handle THM (msg, _, _) => err msg in
wenzelm@28619
   204
            if Unify.matches_list thy [Thm.term_of stmt] [Thm.prop_of res]
wenzelm@28619
   205
            then Thm.check_shyps sorts res
wenzelm@28340
   206
            else err ("Proved a different theorem: " ^ string_of_term (Thm.prop_of res))
wenzelm@28340
   207
          end);
wenzelm@28340
   208
    val res =
wenzelm@29448
   209
      if immediate orelse #maxidx (Thm.rep_cterm stmt) >= 0 orelse not (future_enabled ())
wenzelm@29088
   210
      then result ()
wenzelm@37186
   211
      else future_result ctxt' (fork result) (Thm.term_of stmt);
wenzelm@17980
   212
  in
wenzelm@28340
   213
    Conjunction.elim_balanced (length props) res
wenzelm@20290
   214
    |> map (Assumption.export false ctxt' ctxt)
wenzelm@20056
   215
    |> Variable.export ctxt' ctxt
wenzelm@20250
   216
    |> map Drule.zero_var_indexes
wenzelm@17980
   217
  end;
wenzelm@17980
   218
wenzelm@28341
   219
val prove_multi = prove_common true;
wenzelm@17980
   220
wenzelm@28446
   221
fun prove_future ctxt xs asms prop tac = hd (prove_common false ctxt xs asms [prop] tac);
wenzelm@28340
   222
fun prove ctxt xs asms prop tac = hd (prove_common true ctxt xs asms [prop] tac);
wenzelm@20056
   223
wenzelm@20056
   224
fun prove_global thy xs asms prop tac =
wenzelm@36610
   225
  Drule.export_without_context (prove (ProofContext.init_global thy) xs asms prop tac);
wenzelm@18027
   226
wenzelm@18027
   227
wenzelm@17980
   228
wenzelm@21687
   229
(** goal structure **)
wenzelm@21687
   230
wenzelm@21687
   231
(* nested goals *)
wenzelm@18207
   232
wenzelm@19184
   233
fun extract i n st =
wenzelm@19184
   234
  (if i < 1 orelse n < 1 orelse i + n - 1 > Thm.nprems_of st then Seq.empty
wenzelm@19184
   235
   else if n = 1 then Seq.single (Thm.cprem_of st i)
wenzelm@23418
   236
   else
wenzelm@23418
   237
     Seq.single (Conjunction.mk_conjunction_balanced (map (Thm.cprem_of st) (i upto i + n - 1))))
wenzelm@20260
   238
  |> Seq.map (Thm.adjust_maxidx_cterm ~1 #> init);
wenzelm@17980
   239
wenzelm@19221
   240
fun retrofit i n st' st =
wenzelm@19221
   241
  (if n = 1 then st
wenzelm@23418
   242
   else st |> Drule.with_subgoal i (Conjunction.uncurry_balanced n))
wenzelm@19221
   243
  |> Thm.compose_no_flatten false (conclude st', Thm.nprems_of st') i;
wenzelm@18207
   244
wenzelm@17980
   245
fun SELECT_GOAL tac i st =
wenzelm@19191
   246
  if Thm.nprems_of st = 1 andalso i = 1 then tac st
wenzelm@19184
   247
  else Seq.lifts (retrofit i 1) (Seq.maps tac (extract i 1 st)) st;
wenzelm@17980
   248
wenzelm@21687
   249
wenzelm@21687
   250
(* multiple goals *)
wenzelm@21687
   251
wenzelm@23418
   252
fun precise_conjunction_tac 0 i = eq_assume_tac i
wenzelm@23418
   253
  | precise_conjunction_tac 1 i = SUBGOAL (K all_tac) i
wenzelm@23418
   254
  | precise_conjunction_tac n i = PRIMITIVE (Drule.with_subgoal i (Conjunction.curry_balanced n));
wenzelm@23414
   255
wenzelm@23418
   256
val adhoc_conjunction_tac = REPEAT_ALL_NEW
wenzelm@23418
   257
  (SUBGOAL (fn (goal, i) =>
wenzelm@23418
   258
    if can Logic.dest_conjunction goal then rtac Conjunction.conjunctionI i
wenzelm@23418
   259
    else no_tac));
wenzelm@21687
   260
wenzelm@23418
   261
val conjunction_tac = SUBGOAL (fn (goal, i) =>
wenzelm@23418
   262
  precise_conjunction_tac (length (Logic.dest_conjunctions goal)) i ORELSE
wenzelm@23418
   263
  TRY (adhoc_conjunction_tac i));
wenzelm@21687
   264
wenzelm@23418
   265
val recover_conjunction_tac = PRIMITIVE (fn th =>
wenzelm@23418
   266
  Conjunction.uncurry_balanced (Thm.nprems_of th) th);
wenzelm@23414
   267
wenzelm@23414
   268
fun PRECISE_CONJUNCTS n tac =
wenzelm@23414
   269
  SELECT_GOAL (precise_conjunction_tac n 1
wenzelm@23414
   270
    THEN tac
wenzelm@23418
   271
    THEN recover_conjunction_tac);
wenzelm@23414
   272
wenzelm@21687
   273
fun CONJUNCTS tac =
wenzelm@21687
   274
  SELECT_GOAL (conjunction_tac 1
wenzelm@21687
   275
    THEN tac
wenzelm@23418
   276
    THEN recover_conjunction_tac);
wenzelm@21687
   277
wenzelm@21687
   278
wenzelm@21687
   279
(* hhf normal form *)
wenzelm@21687
   280
wenzelm@21687
   281
val norm_hhf_tac =
wenzelm@21687
   282
  rtac Drule.asm_rl  (*cheap approximation -- thanks to builtin Logic.flatten_params*)
wenzelm@21687
   283
  THEN' SUBGOAL (fn (t, i) =>
wenzelm@21687
   284
    if Drule.is_norm_hhf t then all_tac
wenzelm@28619
   285
    else MetaSimplifier.rewrite_goal_tac Drule.norm_hhf_eqs i);
wenzelm@21687
   286
wenzelm@25301
   287
fun compose_hhf_tac th i st =
wenzelm@25301
   288
  PRIMSEQ (Thm.bicompose false (false, Drule.lift_all (Thm.cprem_of st i) th, 0) i) st;
wenzelm@21687
   289
wenzelm@23237
   290
wenzelm@23237
   291
(* non-atomic goal assumptions *)
wenzelm@23237
   292
wenzelm@23356
   293
fun non_atomic (Const ("==>", _) $ _ $ _) = true
wenzelm@23356
   294
  | non_atomic (Const ("all", _) $ _) = true
wenzelm@23356
   295
  | non_atomic _ = false;
wenzelm@23356
   296
wenzelm@23237
   297
fun assume_rule_tac ctxt = norm_hhf_tac THEN' CSUBGOAL (fn (goal, i) =>
wenzelm@23237
   298
  let
wenzelm@23237
   299
    val ((_, goal'), ctxt') = Variable.focus goal ctxt;
wenzelm@23237
   300
    val goal'' = Drule.cterm_rule (singleton (Variable.export ctxt' ctxt)) goal';
wenzelm@23356
   301
    val Rs = filter (non_atomic o Thm.term_of) (Drule.strip_imp_prems goal'');
wenzelm@23237
   302
    val tacs = Rs |> map (fn R =>
wenzelm@23237
   303
      Tactic.etac (MetaSimplifier.norm_hhf (Thm.trivial R)) THEN_ALL_NEW assume_tac);
wenzelm@23237
   304
  in fold_rev (curry op APPEND') tacs (K no_tac) i end);
wenzelm@23237
   305
wenzelm@32365
   306
wenzelm@32365
   307
(* parallel tacticals *)
wenzelm@32365
   308
wenzelm@32365
   309
(*parallel choice of single results*)
wenzelm@32365
   310
fun PARALLEL_CHOICE tacs st =
wenzelm@32365
   311
  (case Par_List.get_some (fn tac => SINGLE tac st) tacs of
wenzelm@32365
   312
    NONE => Seq.empty
wenzelm@32365
   313
  | SOME st' => Seq.single st');
wenzelm@32365
   314
wenzelm@32365
   315
(*parallel refinement of non-schematic goal by single results*)
wenzelm@32788
   316
exception FAILED of unit;
wenzelm@32365
   317
fun PARALLEL_GOALS tac st =
wenzelm@32365
   318
  let
wenzelm@32365
   319
    val st0 = Thm.adjust_maxidx_thm ~1 st;
wenzelm@32365
   320
    val _ = Thm.maxidx_of st0 >= 0 andalso
wenzelm@32365
   321
      raise THM ("PARALLEL_GOALS: schematic goal state", 0, [st]);
wenzelm@32365
   322
wenzelm@32365
   323
    fun try_tac g =
wenzelm@32365
   324
      (case SINGLE tac g of
wenzelm@32788
   325
        NONE => raise FAILED ()
wenzelm@32365
   326
      | SOME g' => g');
wenzelm@32365
   327
wenzelm@32365
   328
    val goals = Drule.strip_imp_prems (Thm.cprop_of st0);
wenzelm@32365
   329
    val results = Par_List.map (try_tac o init) goals;
wenzelm@32365
   330
  in ALLGOALS (fn i => retrofit i 1 (nth results (i - 1))) st0 end
wenzelm@32788
   331
  handle FAILED () => Seq.empty;
wenzelm@32365
   332
wenzelm@18207
   333
end;
wenzelm@18207
   334
wenzelm@32365
   335
structure Basic_Goal: BASIC_GOAL = Goal;
wenzelm@32365
   336
open Basic_Goal;