src/Pure/old_goals.ML
author bulwahn
Tue Aug 31 08:00:53 2010 +0200 (2010-08-31)
changeset 38950 62578950e748
parent 37781 2fbbf0a48cef
permissions -rw-r--r--
storing options for prolog code generation in the theory
wenzelm@18120
     1
(*  Title:      Pure/old_goals.ML
wenzelm@18120
     2
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
wenzelm@18120
     3
    Copyright   1993  University of Cambridge
wenzelm@18120
     4
wenzelm@18120
     5
Old-style goal stack package.  The goal stack initially holds a dummy
wenzelm@18120
     6
proof, and can never become empty.  Each goal stack consists of a list
wenzelm@18120
     7
of levels.  The undo list is a list of goal stacks.  Finally, there
wenzelm@18120
     8
may be a stack of pending proofs.
wenzelm@18120
     9
*)
wenzelm@18120
    10
wenzelm@32173
    11
signature OLD_GOALS =
wenzelm@18120
    12
sig
wenzelm@32173
    13
  type proof
wenzelm@18120
    14
  val premises: unit -> thm list
wenzelm@32173
    15
  val reset_goals: unit -> unit
wenzelm@32738
    16
  val result_error_fn: (thm -> string -> thm) Unsynchronized.ref
wenzelm@32173
    17
  val print_sign_exn: theory -> exn -> 'a
wenzelm@32173
    18
  val prove_goalw_cterm: thm list->cterm->(thm list->tactic list)->thm
wenzelm@32173
    19
  val prove_goalw_cterm_nocheck: thm list->cterm->(thm list->tactic list)->thm
wenzelm@32173
    20
  val prove_goalw: theory -> thm list -> string -> (thm list -> tactic list) -> thm
wenzelm@18120
    21
  val prove_goal: theory -> string -> (thm list -> tactic list) -> thm
wenzelm@18120
    22
  val topthm: unit -> thm
wenzelm@18120
    23
  val result: unit -> thm
wenzelm@18120
    24
  val uresult: unit -> thm
wenzelm@18120
    25
  val getgoal: int -> term
wenzelm@32173
    26
  val print_exn: exn -> 'a
wenzelm@32173
    27
  val filter_goal: (term*term->bool) -> thm list -> int -> thm list
wenzelm@18120
    28
  val prlev: int -> unit
wenzelm@18120
    29
  val pr: unit -> unit
wenzelm@18120
    30
  val prlim: int -> unit
wenzelm@32173
    31
  val goalw_cterm: thm list -> cterm -> thm list
wenzelm@32173
    32
  val goalw: theory -> thm list -> string -> thm list
wenzelm@18120
    33
  val goal: theory -> string -> thm list
wenzelm@32173
    34
  val Goalw: thm list -> string -> thm list
wenzelm@18120
    35
  val Goal: string -> thm list
wenzelm@32173
    36
  val simple_prove_goal_cterm: cterm->(thm list->tactic list)->thm
wenzelm@18120
    37
  val by: tactic -> unit
wenzelm@32173
    38
  val byev: tactic list -> unit
wenzelm@18120
    39
  val back: unit -> unit
wenzelm@18120
    40
  val choplev: int -> unit
wenzelm@32173
    41
  val chop: unit -> unit
wenzelm@18120
    42
  val undo: unit -> unit
wenzelm@32173
    43
  val save_proof: unit -> proof
wenzelm@32173
    44
  val restore_proof: proof -> thm list
wenzelm@32173
    45
  val push_proof: unit -> unit
wenzelm@32173
    46
  val pop_proof: unit -> thm list
wenzelm@32173
    47
  val rotate_proof: unit -> thm list
wenzelm@18120
    48
  val qed: string -> unit
wenzelm@18120
    49
  val qed_goal: string -> theory -> string -> (thm list -> tactic list) -> unit
wenzelm@18120
    50
  val qed_goalw: string -> theory -> thm list -> string
wenzelm@18120
    51
    -> (thm list -> tactic list) -> unit
wenzelm@18120
    52
  val qed_spec_mp: string -> unit
wenzelm@18120
    53
  val qed_goal_spec_mp: string -> theory -> string -> (thm list -> tactic list) -> unit
wenzelm@18120
    54
  val qed_goalw_spec_mp: string -> theory -> thm list -> string
wenzelm@18120
    55
    -> (thm list -> tactic list) -> unit
wenzelm@18120
    56
end;
wenzelm@18120
    57
wenzelm@18120
    58
structure OldGoals: OLD_GOALS =
wenzelm@18120
    59
struct
wenzelm@18120
    60
wenzelm@27256
    61
wenzelm@18120
    62
(*** Goal package ***)
wenzelm@18120
    63
wenzelm@18120
    64
(*Each level of goal stack includes a proof state and alternative states,
wenzelm@18120
    65
  the output of the tactic applied to the preceeding level.  *)
wenzelm@18120
    66
type gstack = (thm * thm Seq.seq) list;
wenzelm@18120
    67
wenzelm@18120
    68
datatype proof = Proof of gstack list * thm list * (bool*thm->thm);
wenzelm@18120
    69
wenzelm@18120
    70
wenzelm@18120
    71
(*** References ***)
wenzelm@18120
    72
wenzelm@18120
    73
(*Current assumption list -- set by "goal".*)
wenzelm@32738
    74
val curr_prems = Unsynchronized.ref([] : thm list);
wenzelm@18120
    75
wenzelm@18120
    76
(*Return assumption list -- useful if you didn't save "goal"'s result. *)
wenzelm@18120
    77
fun premises() = !curr_prems;
wenzelm@18120
    78
wenzelm@18120
    79
(*Current result maker -- set by "goal", used by "result".  *)
wenzelm@18120
    80
fun init_mkresult _ = error "No goal has been supplied in subgoal module";
wenzelm@32738
    81
val curr_mkresult = Unsynchronized.ref (init_mkresult: bool*thm->thm);
wenzelm@18120
    82
wenzelm@18120
    83
(*List of previous goal stacks, for the undo operation.  Set by setstate.
wenzelm@18120
    84
  A list of lists!*)
wenzelm@32738
    85
val undo_list = Unsynchronized.ref([[(asm_rl, Seq.empty)]] : gstack list);
wenzelm@18120
    86
wenzelm@18120
    87
(* Stack of proof attempts *)
wenzelm@32738
    88
val proofstack = Unsynchronized.ref([]: proof list);
wenzelm@18120
    89
wenzelm@18120
    90
(*reset all refs*)
wenzelm@18120
    91
fun reset_goals () =
wenzelm@18120
    92
  (curr_prems := []; curr_mkresult := init_mkresult;
wenzelm@26429
    93
    undo_list := [[(asm_rl, Seq.empty)]]);
wenzelm@18120
    94
wenzelm@18120
    95
wenzelm@18120
    96
(*** Setting up goal-directed proof ***)
wenzelm@18120
    97
wenzelm@18120
    98
(*Generates the list of new theories when the proof state's theory changes*)
wenzelm@18120
    99
fun thy_error (thy,thy') =
haftmann@33040
   100
  let val names = subtract (op =) (Context.display_names thy) (Context.display_names thy')
wenzelm@18120
   101
  in  case names of
wenzelm@18120
   102
        [name] => "\nNew theory: " ^ name
wenzelm@18120
   103
      | _       => "\nNew theories: " ^ space_implode ", " names
wenzelm@18120
   104
  end;
wenzelm@18120
   105
wenzelm@18120
   106
(*Default action is to print an error message; could be suppressed for
wenzelm@18120
   107
  special applications.*)
wenzelm@18120
   108
fun result_error_default state msg : thm =
wenzelm@32145
   109
  Pretty.str "Bad final proof state:" ::
wenzelm@32187
   110
      Goal_Display.pretty_goals_without_context (!goals_limit) state @
wenzelm@18120
   111
    [Pretty.str msg, Pretty.str "Proof failed!"] |> Pretty.chunks |> Pretty.string_of |> error;
wenzelm@18120
   112
wenzelm@32738
   113
val result_error_fn = Unsynchronized.ref result_error_default;
wenzelm@18120
   114
wenzelm@18120
   115
wenzelm@18120
   116
(*Common treatment of "goal" and "prove_goal":
wenzelm@18120
   117
  Return assumptions, initial proof state, and function to make result.
wenzelm@18120
   118
  "atomic" indicates if the goal should be wrapped up in the function
wenzelm@18120
   119
  "Goal::prop=>prop" to avoid assumptions being returned separately.
wenzelm@18120
   120
*)
wenzelm@18120
   121
fun prepare_proof atomic rths chorn =
wenzelm@18120
   122
  let
wenzelm@26626
   123
      val thy = Thm.theory_of_cterm chorn;
wenzelm@26626
   124
      val horn = Thm.term_of chorn;
wenzelm@18120
   125
      val _ = Term.no_dummy_patterns horn handle TERM (msg, _) => error msg;
wenzelm@18120
   126
      val (As, B) = Logic.strip_horn horn;
wenzelm@18120
   127
      val atoms = atomic andalso
wenzelm@27332
   128
            forall (fn t => not (can Logic.dest_implies t orelse Logic.is_all t)) As;
wenzelm@18120
   129
      val (As,B) = if atoms then ([],horn) else (As,B);
wenzelm@18120
   130
      val cAs = map (cterm_of thy) As;
wenzelm@26653
   131
      val prems = map (rewrite_rule rths o Thm.forall_elim_vars 0 o Thm.assume) cAs;
wenzelm@18120
   132
      val cB = cterm_of thy B;
wenzelm@18120
   133
      val st0 = let val st = Goal.init cB |> fold Thm.weaken cAs
wenzelm@18120
   134
                in  rewrite_goals_rule rths st end
wenzelm@18120
   135
      (*discharges assumptions from state in the order they appear in goal;
wenzelm@18120
   136
        checks (if requested) that resulting theorem is equivalent to goal. *)
wenzelm@18120
   137
      fun mkresult (check,state) =
wenzelm@36944
   138
        let val state = Seq.hd (Thm.flexflex_rule state)
wenzelm@18120
   139
                        handle THM _ => state   (*smash flexflex pairs*)
wenzelm@18120
   140
            val ngoals = nprems_of state
wenzelm@18120
   141
            val ath = implies_intr_list cAs state
wenzelm@18120
   142
            val th = Goal.conclude ath
wenzelm@26626
   143
            val thy' = Thm.theory_of_thm th
wenzelm@26626
   144
            val {hyps, prop, ...} = Thm.rep_thm th
wenzelm@35021
   145
            val final_th = Drule.export_without_context th
wenzelm@18120
   146
        in  if not check then final_th
wenzelm@26665
   147
            else if not (Theory.eq_thy(thy,thy')) then !result_error_fn state
wenzelm@18120
   148
                ("Theory of proof state has changed!" ^
wenzelm@18120
   149
                 thy_error (thy,thy'))
wenzelm@18120
   150
            else if ngoals>0 then !result_error_fn state
wenzelm@18120
   151
                (string_of_int ngoals ^ " unsolved goals!")
wenzelm@18120
   152
            else if not (null hyps) then !result_error_fn state
wenzelm@18120
   153
                ("Additional hypotheses:\n" ^
wenzelm@26939
   154
                 cat_lines (map (Syntax.string_of_term_global thy) hyps))
wenzelm@18120
   155
            else if Pattern.matches thy
wenzelm@18120
   156
                                    (Envir.beta_norm (term_of chorn), Envir.beta_norm prop)
wenzelm@18120
   157
                 then final_th
wenzelm@18120
   158
            else  !result_error_fn state "proved a different theorem"
wenzelm@18120
   159
        end
wenzelm@18120
   160
  in
wenzelm@26665
   161
     if Theory.eq_thy(thy, Thm.theory_of_thm st0)
wenzelm@18120
   162
     then (prems, st0, mkresult)
wenzelm@18120
   163
     else error ("Definitions would change the proof state's theory" ^
wenzelm@18120
   164
                 thy_error (thy, Thm.theory_of_thm st0))
wenzelm@18120
   165
  end
wenzelm@18120
   166
  handle THM(s,_,_) => error("prepare_proof: exception THM was raised!\n" ^ s);
wenzelm@18120
   167
wenzelm@18120
   168
(*Prints exceptions readably to users*)
wenzelm@18120
   169
fun print_sign_exn_unit thy e =
wenzelm@18120
   170
  case e of
wenzelm@18120
   171
     THM (msg,i,thms) =>
wenzelm@18120
   172
         (writeln ("Exception THM " ^ string_of_int i ^ " raised:\n" ^ msg);
wenzelm@32091
   173
          List.app (writeln o Display.string_of_thm_global thy) thms)
wenzelm@18120
   174
   | THEORY (msg,thys) =>
wenzelm@18120
   175
         (writeln ("Exception THEORY raised:\n" ^ msg);
wenzelm@18120
   176
          List.app (writeln o Context.str_of_thy) thys)
wenzelm@18120
   177
   | TERM (msg,ts) =>
wenzelm@18120
   178
         (writeln ("Exception TERM raised:\n" ^ msg);
wenzelm@26939
   179
          List.app (writeln o Syntax.string_of_term_global thy) ts)
wenzelm@18120
   180
   | TYPE (msg,Ts,ts) =>
wenzelm@18120
   181
         (writeln ("Exception TYPE raised:\n" ^ msg);
wenzelm@26939
   182
          List.app (writeln o Syntax.string_of_typ_global thy) Ts;
wenzelm@26939
   183
          List.app (writeln o Syntax.string_of_term_global thy) ts)
wenzelm@18120
   184
   | e => raise e;
wenzelm@18120
   185
wenzelm@18120
   186
(*Prints an exception, then fails*)
wenzelm@18678
   187
fun print_sign_exn thy e = (print_sign_exn_unit thy e; raise ERROR "");
wenzelm@18120
   188
wenzelm@18120
   189
(** the prove_goal.... commands
wenzelm@18120
   190
    Prove theorem using the listed tactics; check it has the specified form.
wenzelm@18120
   191
    Augment theory with all type assignments of goal.
wenzelm@18120
   192
    Syntax is similar to "goal" command for easy keyboard use. **)
wenzelm@18120
   193
wenzelm@18120
   194
(*Version taking the goal as a cterm*)
wenzelm@18120
   195
fun prove_goalw_cterm_general check rths chorn tacsf =
wenzelm@18120
   196
  let val (prems, st0, mkresult) = prepare_proof false rths chorn
wenzelm@18120
   197
      val tac = EVERY (tacsf prems)
wenzelm@18120
   198
      fun statef() =
wenzelm@18120
   199
          (case Seq.pull (tac st0) of
wenzelm@18120
   200
               SOME(st,_) => st
wenzelm@18120
   201
             | _ => error ("prove_goal: tactic failed"))
wenzelm@32432
   202
  in  mkresult (check, cond_timeit (!Output.timing) "" statef)  end;
wenzelm@18120
   203
wenzelm@18120
   204
(*Two variants: one checking the result, one not.
wenzelm@18120
   205
  Neither prints runtime messages: they are for internal packages.*)
wenzelm@18120
   206
fun prove_goalw_cterm rths chorn =
wenzelm@32966
   207
        setmp_CRITICAL Output.timing false (prove_goalw_cterm_general true rths chorn)
wenzelm@18120
   208
and prove_goalw_cterm_nocheck rths chorn =
wenzelm@32966
   209
        setmp_CRITICAL Output.timing false (prove_goalw_cterm_general false rths chorn);
wenzelm@18120
   210
wenzelm@18120
   211
wenzelm@18120
   212
(*Version taking the goal as a string*)
wenzelm@18120
   213
fun prove_goalw thy rths agoal tacsf =
wenzelm@37781
   214
  let val chorn = cterm_of thy (Syntax.read_prop_global thy agoal)
wenzelm@18120
   215
  in prove_goalw_cterm_general true rths chorn tacsf end
wenzelm@27256
   216
  handle ERROR msg => cat_error msg (*from read_prop?*)
wenzelm@18120
   217
                ("The error(s) above occurred for " ^ quote agoal);
wenzelm@18120
   218
wenzelm@18120
   219
(*String version with no meta-rewrite-rules*)
wenzelm@18120
   220
fun prove_goal thy = prove_goalw thy [];
wenzelm@18120
   221
wenzelm@18120
   222
wenzelm@18120
   223
wenzelm@18120
   224
(*** Commands etc ***)
wenzelm@18120
   225
wenzelm@18120
   226
(*Return the current goal stack, if any, from undo_list*)
wenzelm@18120
   227
fun getstate() : gstack = case !undo_list of
wenzelm@18120
   228
      []   => error"No current state in subgoal module"
wenzelm@18120
   229
    | x::_ => x;
wenzelm@18120
   230
wenzelm@18120
   231
(*Pops the given goal stack*)
wenzelm@18120
   232
fun pop [] = error"Cannot go back past the beginning of the proof!"
wenzelm@18120
   233
  | pop (pair::pairs) = (pair,pairs);
wenzelm@18120
   234
wenzelm@18120
   235
wenzelm@23635
   236
(* Print a level of the goal stack *)
wenzelm@18120
   237
wenzelm@18120
   238
fun print_top ((th, _), pairs) =
wenzelm@23635
   239
  let
wenzelm@23635
   240
    val n = length pairs;
wenzelm@23635
   241
    val m = (! goals_limit);
wenzelm@23635
   242
    val ngoals = nprems_of th;
wenzelm@23635
   243
  in
wenzelm@23635
   244
    [Pretty.str ("Level " ^ string_of_int n ^
wenzelm@23635
   245
      (if ngoals > 0 then " (" ^ string_of_int ngoals ^ " subgoal" ^
wenzelm@23635
   246
        (if ngoals <> 1 then "s" else "") ^ ")"
wenzelm@23635
   247
      else ""))] @
wenzelm@32187
   248
    Goal_Display.pretty_goals_without_context m th
wenzelm@23635
   249
  end |> Pretty.chunks |> Pretty.writeln;
wenzelm@18120
   250
wenzelm@18120
   251
(*Printing can raise exceptions, so the assignment occurs last.
wenzelm@18120
   252
  Can do   setstate[(st,Seq.empty)]  to set st as the state.  *)
wenzelm@18120
   253
fun setstate newgoals =
wenzelm@18120
   254
  (print_top (pop newgoals);  undo_list := newgoals :: !undo_list);
wenzelm@18120
   255
wenzelm@18120
   256
(*Given a proof state transformation, return a command that updates
wenzelm@18120
   257
    the goal stack*)
wenzelm@18120
   258
fun make_command com = setstate (com (pop (getstate())));
wenzelm@18120
   259
wenzelm@18120
   260
(*Apply a function on proof states to the current goal stack*)
wenzelm@18120
   261
fun apply_fun f = f (pop(getstate()));
wenzelm@18120
   262
wenzelm@18120
   263
(*Return the top theorem, representing the proof state*)
wenzelm@18120
   264
fun topthm () = apply_fun  (fn ((th,_), _) => th);
wenzelm@18120
   265
wenzelm@18120
   266
(*Return the final result.  *)
wenzelm@18120
   267
fun result () = !curr_mkresult (true, topthm());
wenzelm@18120
   268
wenzelm@18120
   269
(*Return the result UNCHECKED that it equals the goal -- for synthesis,
wenzelm@18120
   270
  answer extraction, or other instantiation of Vars *)
wenzelm@18120
   271
fun uresult () = !curr_mkresult (false, topthm());
wenzelm@18120
   272
wenzelm@18120
   273
(*Get subgoal i from goal stack*)
wenzelm@18120
   274
fun getgoal i = Logic.get_goal (prop_of (topthm())) i;
wenzelm@18120
   275
wenzelm@18120
   276
(*Prints exceptions nicely at top level;
wenzelm@18120
   277
  raises the exception in order to have a polymorphic type!*)
wenzelm@18120
   278
fun print_exn e = (print_sign_exn_unit (Thm.theory_of_thm (topthm())) e;  raise e);
wenzelm@18120
   279
wenzelm@18120
   280
(*Which thms could apply to goal i? (debugs tactics involving filter_thms) *)
wenzelm@18120
   281
fun filter_goal could ths i = filter_thms could (999, getgoal i, ths);
wenzelm@18120
   282
wenzelm@18120
   283
(*For inspecting earlier levels of the backward proof*)
wenzelm@18120
   284
fun chop_level n (pair,pairs) =
wenzelm@18120
   285
  let val level = length pairs
wenzelm@18120
   286
  in  if n<0 andalso ~n <= level
wenzelm@18120
   287
      then  List.drop (pair::pairs, ~n)
wenzelm@18120
   288
      else if 0<=n andalso n<= level
wenzelm@18120
   289
      then  List.drop (pair::pairs, level - n)
wenzelm@18120
   290
      else  error ("Level number must lie between 0 and " ^
wenzelm@18120
   291
                   string_of_int level)
wenzelm@18120
   292
  end;
wenzelm@18120
   293
wenzelm@18120
   294
(*Print the given level of the proof; prlev ~1 prints previous level*)
wenzelm@23635
   295
fun prlev n = apply_fun (print_top o pop o (chop_level n));
wenzelm@23635
   296
fun pr () = apply_fun print_top;
wenzelm@18120
   297
wenzelm@18120
   298
(*Set goals_limit and print again*)
wenzelm@18120
   299
fun prlim n = (goals_limit:=n; pr());
wenzelm@18120
   300
wenzelm@18120
   301
(** the goal.... commands
wenzelm@18120
   302
    Read main goal.  Set global variables curr_prems, curr_mkresult.
wenzelm@18120
   303
    Initial subgoal and premises are rewritten using rths. **)
wenzelm@18120
   304
wenzelm@18120
   305
(*Version taking the goal as a cterm; if you have a term t and theory thy, use
wenzelm@18120
   306
    goalw_cterm rths (cterm_of thy t);      *)
wenzelm@18120
   307
fun agoalw_cterm atomic rths chorn =
wenzelm@18120
   308
  let val (prems, st0, mkresult) = prepare_proof atomic rths chorn
wenzelm@18120
   309
  in  undo_list := [];
wenzelm@18120
   310
      setstate [ (st0, Seq.empty) ];
wenzelm@18120
   311
      curr_prems := prems;
wenzelm@18120
   312
      curr_mkresult := mkresult;
wenzelm@18120
   313
      prems
wenzelm@18120
   314
  end;
wenzelm@18120
   315
wenzelm@18120
   316
val goalw_cterm = agoalw_cterm false;
wenzelm@18120
   317
wenzelm@18120
   318
(*Version taking the goal as a string*)
wenzelm@18120
   319
fun agoalw atomic thy rths agoal =
wenzelm@37781
   320
    agoalw_cterm atomic rths (cterm_of thy (Syntax.read_prop_global thy agoal))
wenzelm@18678
   321
    handle ERROR msg => cat_error msg (*from type_assign, etc via prepare_proof*)
wenzelm@18120
   322
        ("The error(s) above occurred for " ^ quote agoal);
wenzelm@18120
   323
wenzelm@18120
   324
val goalw = agoalw false;
wenzelm@18120
   325
fun goal thy = goalw thy [];
wenzelm@18120
   326
wenzelm@18120
   327
(*now the versions that wrap the goal up in `Goal' to make it atomic*)
wenzelm@26429
   328
fun Goalw thms s = agoalw true (ML_Context.the_global_context ()) thms s;
wenzelm@18120
   329
val Goal = Goalw [];
wenzelm@18120
   330
wenzelm@18120
   331
(*simple version with minimal amount of checking and postprocessing*)
wenzelm@18120
   332
fun simple_prove_goal_cterm G f =
wenzelm@18120
   333
  let
wenzelm@18120
   334
    val As = Drule.strip_imp_prems G;
wenzelm@18120
   335
    val B = Drule.strip_imp_concl G;
wenzelm@20229
   336
    val asms = map Assumption.assume As;
wenzelm@18120
   337
    fun check NONE = error "prove_goal: tactic failed"
wenzelm@18120
   338
      | check (SOME (thm, _)) = (case nprems_of thm of
wenzelm@18120
   339
            0 => thm
wenzelm@18120
   340
          | i => !result_error_fn thm (string_of_int i ^ " unsolved goals!"))
wenzelm@18120
   341
  in
wenzelm@35021
   342
    Drule.export_without_context (implies_intr_list As
wenzelm@36944
   343
      (check (Seq.pull (EVERY (f asms) (Thm.trivial B)))))
wenzelm@18120
   344
  end;
wenzelm@18120
   345
wenzelm@18120
   346
wenzelm@18120
   347
(*Proof step "by" the given tactic -- apply tactic to the proof state*)
wenzelm@18120
   348
fun by_com tac ((th,ths), pairs) : gstack =
wenzelm@18120
   349
  (case  Seq.pull(tac th)  of
wenzelm@18120
   350
     NONE      => error"by: tactic failed"
wenzelm@18120
   351
   | SOME(th2,ths2) =>
wenzelm@22360
   352
       (if Thm.eq_thm(th,th2)
wenzelm@18120
   353
          then warning "Warning: same as previous level"
wenzelm@22360
   354
          else if Thm.eq_thm_thy(th,th2) then ()
wenzelm@18120
   355
          else warning ("Warning: theory of proof state has changed" ^
wenzelm@18120
   356
                       thy_error (Thm.theory_of_thm th, Thm.theory_of_thm th2));
wenzelm@18120
   357
       ((th2,ths2)::(th,ths)::pairs)));
wenzelm@18120
   358
wenzelm@25685
   359
fun by tac = cond_timeit (!Output.timing) ""
wenzelm@18120
   360
    (fn() => make_command (by_com tac));
wenzelm@18120
   361
wenzelm@18120
   362
(* byev[tac1,...,tacn] applies tac1 THEN ... THEN tacn.
wenzelm@18120
   363
   Good for debugging proofs involving prove_goal.*)
wenzelm@18120
   364
val byev = by o EVERY;
wenzelm@18120
   365
wenzelm@18120
   366
wenzelm@18120
   367
(*Backtracking means find an alternative result from a tactic.
wenzelm@18120
   368
  If none at this level, try earlier levels*)
wenzelm@18120
   369
fun backtrack [] = error"back: no alternatives"
wenzelm@18120
   370
  | backtrack ((th,thstr) :: pairs) =
wenzelm@18120
   371
     (case Seq.pull thstr of
wenzelm@18120
   372
          NONE      => (writeln"Going back a level..."; backtrack pairs)
wenzelm@18120
   373
        | SOME(th2,thstr2) =>
wenzelm@22360
   374
           (if Thm.eq_thm(th,th2)
wenzelm@18120
   375
              then warning "Warning: same as previous choice at this level"
wenzelm@22360
   376
              else if Thm.eq_thm_thy(th,th2) then ()
wenzelm@18120
   377
              else warning "Warning: theory of proof state has changed";
wenzelm@18120
   378
            (th2,thstr2)::pairs));
wenzelm@18120
   379
wenzelm@18120
   380
fun back() = setstate (backtrack (getstate()));
wenzelm@18120
   381
wenzelm@18120
   382
(*Chop back to previous level of the proof*)
wenzelm@18120
   383
fun choplev n = make_command (chop_level n);
wenzelm@18120
   384
wenzelm@18120
   385
(*Chopping back the goal stack*)
wenzelm@18120
   386
fun chop () = make_command (fn (_,pairs) => pairs);
wenzelm@18120
   387
wenzelm@18120
   388
(*Restore the previous proof state;  discard current state. *)
wenzelm@18120
   389
fun undo() = case !undo_list of
wenzelm@18120
   390
      [] => error"No proof state"
wenzelm@18120
   391
    | [_] => error"Already at initial state"
wenzelm@18120
   392
    | _::newundo =>  (undo_list := newundo;  pr()) ;
wenzelm@18120
   393
wenzelm@18120
   394
wenzelm@18120
   395
(*** Managing the proof stack ***)
wenzelm@18120
   396
wenzelm@18120
   397
fun save_proof() = Proof(!undo_list, !curr_prems, !curr_mkresult);
wenzelm@18120
   398
wenzelm@18120
   399
fun restore_proof(Proof(ul,prems,mk)) =
wenzelm@18120
   400
 (undo_list:= ul;  curr_prems:= prems;  curr_mkresult := mk;  prems);
wenzelm@18120
   401
wenzelm@18120
   402
wenzelm@18120
   403
fun top_proof() = case !proofstack of
wenzelm@18120
   404
        [] => error("Stack of proof attempts is empty!")
wenzelm@18120
   405
    | p::ps => (p,ps);
wenzelm@18120
   406
wenzelm@18120
   407
(*  push a copy of the current proof state on to the stack *)
wenzelm@18120
   408
fun push_proof() = (proofstack := (save_proof() :: !proofstack));
wenzelm@18120
   409
wenzelm@18120
   410
(* discard the top proof state of the stack *)
wenzelm@18120
   411
fun pop_proof() =
wenzelm@18120
   412
  let val (p,ps) = top_proof()
wenzelm@18120
   413
      val prems = restore_proof p
wenzelm@18120
   414
  in proofstack := ps;  pr();  prems end;
wenzelm@18120
   415
wenzelm@18120
   416
(* rotate the stack so that the top element goes to the bottom *)
wenzelm@32173
   417
fun rotate_proof() =
wenzelm@32173
   418
  let val (p,ps) = top_proof()
wenzelm@32173
   419
  in proofstack := ps@[save_proof()];
wenzelm@32173
   420
     restore_proof p;
wenzelm@32173
   421
     pr();
wenzelm@32173
   422
     !curr_prems
wenzelm@32173
   423
  end;
wenzelm@18120
   424
wenzelm@18120
   425
wenzelm@26414
   426
(** theorem bindings **)
wenzelm@18120
   427
wenzelm@26414
   428
fun qed name = ML_Context.ml_store_thm (name, result ());
wenzelm@26414
   429
fun qed_goal name thy goal tacsf = ML_Context.ml_store_thm (name, prove_goal thy goal tacsf);
wenzelm@18120
   430
fun qed_goalw name thy rews goal tacsf =
wenzelm@26414
   431
  ML_Context.ml_store_thm (name, prove_goalw thy rews goal tacsf);
wenzelm@18120
   432
fun qed_spec_mp name =
wenzelm@35625
   433
  ML_Context.ml_store_thm (name, Object_Logic.rulify_no_asm (result ()));
wenzelm@18120
   434
fun qed_goal_spec_mp name thy s p =
wenzelm@35625
   435
  bind_thm (name, Object_Logic.rulify_no_asm (prove_goal thy s p));
wenzelm@18120
   436
fun qed_goalw_spec_mp name thy defs s p =
wenzelm@35625
   437
  bind_thm (name, Object_Logic.rulify_no_asm (prove_goalw thy defs s p));
wenzelm@18120
   438
wenzelm@18120
   439
end;
wenzelm@18120
   440