src/Pure/goals.ML
author nipkow
Fri Mar 14 10:35:30 1997 +0100 (1997-03-14)
changeset 2792 6c17c5ec3d8b
parent 2580 e3f680709487
child 2878 bf7b6833e4d7
permissions -rw-r--r--
Avoid eta-contraction in the simplifier.
Instead the net needs to eta-contract the object.
Also added a special function loose_bvar1(i,t) in term.ML.
clasohm@1460
     1
(*  Title: 	Pure/goals.ML
clasohm@0
     2
    ID:         $Id$
clasohm@1460
     3
    Author: 	Lawrence C Paulson, Cambridge University Computer Laboratory
clasohm@0
     4
    Copyright   1993  University of Cambridge
clasohm@0
     5
clasohm@0
     6
Goal stack package.  The goal stack initially holds a dummy proof, and can
clasohm@0
     7
never become empty.  Each goal stack consists of a list of levels.  The
clasohm@0
     8
undo list is a list of goal stacks.  Finally, there may be a stack of
clasohm@0
     9
pending proofs.
clasohm@0
    10
*)
clasohm@0
    11
clasohm@0
    12
clasohm@0
    13
signature GOALS =
clasohm@0
    14
  sig
clasohm@0
    15
  type proof
clasohm@1460
    16
  val ba		: int -> unit
clasohm@1460
    17
  val back		: unit -> unit
clasohm@1460
    18
  val bd		: thm -> int -> unit
clasohm@1460
    19
  val bds		: thm list -> int -> unit
clasohm@1460
    20
  val be		: thm -> int -> unit
clasohm@1460
    21
  val bes		: thm list -> int -> unit
clasohm@1460
    22
  val br		: thm -> int -> unit
clasohm@1460
    23
  val brs		: thm list -> int -> unit
clasohm@1460
    24
  val bw		: thm -> unit
clasohm@1460
    25
  val bws		: thm list -> unit
clasohm@1460
    26
  val by		: tactic -> unit
clasohm@1460
    27
  val byev		: tactic list -> unit
clasohm@1460
    28
  val chop		: unit -> unit
clasohm@1460
    29
  val choplev		: int -> unit
clasohm@1460
    30
  val fa		: unit -> unit
clasohm@1460
    31
  val fd		: thm -> unit
clasohm@1460
    32
  val fds		: thm list -> unit
clasohm@1460
    33
  val fe		: thm -> unit
clasohm@1460
    34
  val fes		: thm list -> unit
clasohm@1460
    35
  val filter_goal	: (term*term->bool) -> thm list -> int -> thm list
clasohm@1460
    36
  val fr		: thm -> unit
clasohm@1460
    37
  val frs		: thm list -> unit
clasohm@1460
    38
  val getgoal		: int -> term
clasohm@1460
    39
  val gethyps		: int -> thm list
clasohm@1460
    40
  val goal		: theory -> string -> thm list
clasohm@1460
    41
  val goalw		: theory -> thm list -> string -> thm list
clasohm@1460
    42
  val goalw_cterm	: thm list -> cterm -> thm list
clasohm@1460
    43
  val pop_proof		: unit -> thm list
clasohm@1460
    44
  val pr		: unit -> unit
paulson@2580
    45
  val prlev		: int -> unit
paulson@2514
    46
  val prlim		: int -> unit
berghofe@1628
    47
  val pr_latex		: unit -> unit
berghofe@1628
    48
  val printgoal_latex	: int -> unit
clasohm@1460
    49
  val premises		: unit -> thm list
clasohm@1460
    50
  val prin		: term -> unit
clasohm@1460
    51
  val printyp		: typ -> unit
clasohm@1460
    52
  val pprint_term	: term -> pprint_args -> unit
clasohm@1460
    53
  val pprint_typ	: typ -> pprint_args -> unit
clasohm@1460
    54
  val print_exn		: exn -> 'a
clasohm@1460
    55
  val print_sign_exn	: Sign.sg -> exn -> 'a
clasohm@1460
    56
  val proof_timing	: bool ref
clasohm@1460
    57
  val prove_goal	: theory -> string -> (thm list -> tactic list) -> thm
lcp@577
    58
  val prove_goalw      : theory->thm list->string->(thm list->tactic list)->thm
clasohm@1460
    59
  val prove_goalw_cterm	: thm list->cterm->(thm list->tactic list)->thm
clasohm@1460
    60
  val push_proof	: unit -> unit
clasohm@1460
    61
  val read		: string -> term
clasohm@1460
    62
  val ren		: string -> int -> unit
clasohm@1460
    63
  val restore_proof	: proof -> thm list
clasohm@1460
    64
  val result		: unit -> thm  
paulson@1928
    65
  val result_error_ref  : (thm -> string -> thm) ref
clasohm@1460
    66
  val rotate_proof	: unit -> thm list
clasohm@1460
    67
  val uresult		: unit -> thm  
clasohm@1460
    68
  val save_proof	: unit -> proof
clasohm@1460
    69
  val topthm		: unit -> thm
clasohm@1460
    70
  val undo		: unit -> unit
clasohm@0
    71
  end;
clasohm@0
    72
paulson@1500
    73
structure Goals : GOALS =
clasohm@0
    74
struct
clasohm@0
    75
clasohm@0
    76
(*Each level of goal stack includes a proof state and alternative states,
clasohm@0
    77
  the output of the tactic applied to the preceeding level.  *)
clasohm@0
    78
type gstack = (thm * thm Sequence.seq) list;
clasohm@0
    79
clasohm@0
    80
datatype proof = Proof of gstack list * thm list * (bool*thm->thm);
clasohm@0
    81
clasohm@0
    82
(*** References ***)
clasohm@0
    83
clasohm@0
    84
(*Should process time be printed after proof steps?*)
clasohm@0
    85
val proof_timing = ref false;
clasohm@0
    86
clasohm@0
    87
(*Current assumption list -- set by "goal".*)
clasohm@0
    88
val curr_prems = ref([] : thm list);
clasohm@0
    89
clasohm@0
    90
(*Return assumption list -- useful if you didn't save "goal"'s result. *)
clasohm@0
    91
fun premises() = !curr_prems;
clasohm@0
    92
clasohm@0
    93
(*Current result maker -- set by "goal", used by "result".  *)
clasohm@0
    94
val curr_mkresult = 
clasohm@0
    95
    ref((fn _=> error"No goal has been supplied in subgoal module") 
clasohm@0
    96
       : bool*thm->thm);
clasohm@0
    97
clasohm@922
    98
val dummy = trivial(read_cterm Sign.proto_pure 
clasohm@0
    99
    ("PROP No_goal_has_been_supplied",propT));
clasohm@0
   100
clasohm@0
   101
(*List of previous goal stacks, for the undo operation.  Set by setstate. 
clasohm@0
   102
  A list of lists!*)
clasohm@0
   103
val undo_list = ref([[(dummy, Sequence.null)]] : gstack list);
clasohm@0
   104
clasohm@0
   105
(* Stack of proof attempts *)
clasohm@0
   106
val proofstack = ref([]: proof list);
clasohm@0
   107
clasohm@0
   108
clasohm@0
   109
(*** Setting up goal-directed proof ***)
clasohm@0
   110
clasohm@0
   111
(*Generates the list of new theories when the proof state's signature changes*)
clasohm@0
   112
fun sign_error (sign,sign') =
clasohm@0
   113
  let val stamps = #stamps(Sign.rep_sg sign') \\ 
clasohm@0
   114
                   #stamps(Sign.rep_sg sign)
clasohm@0
   115
  in  case stamps of
clasohm@0
   116
        [stamp] => "\nNew theory: " ^ !stamp
clasohm@0
   117
      | _       => "\nNew theories: " ^ space_implode ", " (map ! stamps)
clasohm@0
   118
  end;
clasohm@0
   119
paulson@1928
   120
(*Default action is to print an error message; could be suppressed for
paulson@1928
   121
  special applications.*)
paulson@1928
   122
fun result_error_default state msg : thm = 
paulson@1928
   123
  (writeln ("Bad final proof state:");
paulson@1928
   124
   !print_goals_ref (!goals_limit) state;
paulson@1928
   125
   error msg);
paulson@1928
   126
paulson@1928
   127
val result_error_ref = ref result_error_default;
paulson@1928
   128
clasohm@0
   129
(*Common treatment of "goal" and "prove_goal":
clasohm@0
   130
  Return assumptions, initial proof state, and function to make result. *)
clasohm@0
   131
fun prepare_proof rths chorn =
lcp@230
   132
  let val {sign, t=horn,...} = rep_cterm chorn;
clasohm@0
   133
      val (_,As,B) = Logic.strip_horn(horn);
lcp@230
   134
      val cAs = map (cterm_of sign) As;
paulson@1413
   135
      val prems = map (rewrite_rule rths o forall_elim_vars(0) o assume) cAs
paulson@1413
   136
      and st0 = (rewrite_goals_rule rths o trivial) (cterm_of sign B)
clasohm@0
   137
      (*discharges assumptions from state in the order they appear in goal;
clasohm@1460
   138
	checks (if requested) that resulting theorem is equivalent to goal. *)
clasohm@0
   139
      fun mkresult (check,state) =
lcp@696
   140
        let val state = Sequence.hd (flexflex_rule state)
paulson@1565
   141
	    		handle THM _ => state   (*smash flexflex pairs*)
clasohm@1460
   142
	    val ngoals = nprems_of state
wenzelm@1219
   143
            val th = strip_shyps (implies_intr_list cAs state)
wenzelm@1240
   144
            val {hyps,prop,sign=sign',...} = rep_thm th
wenzelm@1240
   145
            val xshyps = extra_shyps th;
paulson@2169
   146
        in  if not check then th
paulson@1928
   147
	    else if not (Sign.eq_sg(sign,sign')) then !result_error_ref state
clasohm@1460
   148
		("Signature of proof state has changed!" ^
clasohm@1460
   149
		 sign_error (sign,sign'))
paulson@1928
   150
            else if ngoals>0 then !result_error_ref state
clasohm@1460
   151
		(string_of_int ngoals ^ " unsolved goals!")
paulson@1928
   152
            else if not (null hyps) then !result_error_ref state
clasohm@0
   153
                ("Additional hypotheses:\n" ^ 
clasohm@0
   154
                 cat_lines (map (Sign.string_of_term sign) hyps))
paulson@1928
   155
	    else if not (null xshyps) then !result_error_ref state
wenzelm@1240
   156
                ("Extra sort hypotheses: " ^
paulson@1500
   157
                 commas (map Type.str_of_sort xshyps))
clasohm@1460
   158
	    else if Pattern.matches (#tsig(Sign.rep_sg sign)) 
clasohm@1460
   159
			            (term_of chorn, prop)
clasohm@1460
   160
		 then  standard th 
paulson@1928
   161
	    else  !result_error_ref state "proved a different theorem"
clasohm@0
   162
        end
nipkow@678
   163
  in
nipkow@678
   164
     if Sign.eq_sg(sign, #sign(rep_thm st0))
clasohm@0
   165
     then (prems, st0, mkresult)
clasohm@0
   166
     else error ("Definitions would change the proof state's signature" ^
clasohm@1460
   167
		 sign_error (sign, #sign(rep_thm st0)))
clasohm@0
   168
  end
clasohm@0
   169
  handle THM(s,_,_) => error("prepare_proof: exception THM was raised!\n" ^ s);
clasohm@0
   170
clasohm@0
   171
(*Prints exceptions readably to users*)
lcp@577
   172
fun print_sign_exn_unit sign e = 
clasohm@0
   173
  case e of
clasohm@0
   174
     THM (msg,i,thms) =>
clasohm@1460
   175
	 (writeln ("Exception THM " ^ string_of_int i ^ " raised:\n" ^ msg);
clasohm@1460
   176
	  seq print_thm thms)
clasohm@0
   177
   | THEORY (msg,thys) =>
clasohm@1460
   178
	 (writeln ("Exception THEORY raised:\n" ^ msg);
clasohm@1460
   179
	  seq print_theory thys)
clasohm@0
   180
   | TERM (msg,ts) =>
clasohm@1460
   181
	 (writeln ("Exception TERM raised:\n" ^ msg);
clasohm@1460
   182
	  seq (writeln o Sign.string_of_term sign) ts)
clasohm@0
   183
   | TYPE (msg,Ts,ts) =>
clasohm@1460
   184
	 (writeln ("Exception TYPE raised:\n" ^ msg);
clasohm@1460
   185
	  seq (writeln o Sign.string_of_typ sign) Ts;
clasohm@1460
   186
	  seq (writeln o Sign.string_of_term sign) ts)
clasohm@0
   187
   | e => raise e;
clasohm@0
   188
lcp@577
   189
(*Prints an exception, then fails*)
lcp@577
   190
fun print_sign_exn sign e = (print_sign_exn_unit sign e; raise ERROR);
lcp@577
   191
clasohm@0
   192
(** the prove_goal.... commands
clasohm@0
   193
    Prove theorem using the listed tactics; check it has the specified form.
clasohm@0
   194
    Augment signature with all type assignments of goal.
clasohm@0
   195
    Syntax is similar to "goal" command for easy keyboard use. **)
clasohm@0
   196
clasohm@0
   197
(*Version taking the goal as a cterm*)
clasohm@0
   198
fun prove_goalw_cterm rths chorn tacsf =
clasohm@0
   199
  let val (prems, st0, mkresult) = prepare_proof rths chorn
clasohm@0
   200
      val tac = EVERY (tacsf prems)
clasohm@0
   201
      fun statef() = 
paulson@1500
   202
	  (case Sequence.pull (tac st0) of 
clasohm@1460
   203
	       Some(st,_) => st
clasohm@1460
   204
	     | _ => error ("prove_goal: tactic failed"))
lcp@545
   205
  in  mkresult (true, cond_timeit (!proof_timing) statef)  end
lcp@914
   206
  handle e => (print_sign_exn_unit (#sign (rep_cterm chorn)) e;
clasohm@1460
   207
	       error ("The exception above was raised for\n" ^ 
clasohm@1460
   208
		      string_of_cterm chorn));
lcp@545
   209
clasohm@0
   210
clasohm@0
   211
(*Version taking the goal as a string*)
clasohm@0
   212
fun prove_goalw thy rths agoal tacsf =
clasohm@0
   213
  let val sign = sign_of thy
lcp@230
   214
      val chorn = read_cterm sign (agoal,propT)
lcp@545
   215
  in  prove_goalw_cterm rths chorn tacsf end
lcp@545
   216
  handle ERROR => error (*from read_cterm?*)
clasohm@1460
   217
		("The error above occurred for " ^ quote agoal);
clasohm@0
   218
clasohm@0
   219
(*String version with no meta-rewrite-rules*)
clasohm@0
   220
fun prove_goal thy = prove_goalw thy [];
clasohm@0
   221
clasohm@0
   222
clasohm@0
   223
(*** Commands etc ***)
clasohm@0
   224
clasohm@0
   225
(*Return the current goal stack, if any, from undo_list*)
clasohm@0
   226
fun getstate() : gstack = case !undo_list of 
clasohm@0
   227
      []   => error"No current state in subgoal module"
clasohm@0
   228
    | x::_ => x;
clasohm@0
   229
clasohm@0
   230
(*Pops the given goal stack*)
clasohm@0
   231
fun pop [] = error"Cannot go back past the beginning of the proof!"
clasohm@0
   232
  | pop (pair::pairs) = (pair,pairs);
clasohm@0
   233
clasohm@0
   234
clasohm@0
   235
(*Print a level of the goal stack.*)
clasohm@0
   236
fun print_top ((th,_), pairs) = 
clasohm@0
   237
   (prs("Level " ^ string_of_int(length pairs) ^ "\n"); 
lcp@68
   238
    !print_goals_ref (!goals_limit) th);
clasohm@0
   239
clasohm@0
   240
(*Printing can raise exceptions, so the assignment occurs last.
clasohm@0
   241
  Can do   setstate[(st,Sequence.null)]  to set st as the state.  *)
clasohm@0
   242
fun setstate newgoals = 
clasohm@0
   243
  (print_top (pop newgoals);  undo_list := newgoals :: !undo_list);
clasohm@0
   244
clasohm@0
   245
(*Given a proof state transformation, return a command that updates
clasohm@0
   246
    the goal stack*)
clasohm@0
   247
fun make_command com = setstate (com (pop (getstate())));
clasohm@0
   248
clasohm@0
   249
(*Apply a function on proof states to the current goal stack*)
clasohm@0
   250
fun apply_fun f = f (pop(getstate()));
clasohm@0
   251
clasohm@0
   252
(*Return the top theorem, representing the proof state*)
clasohm@0
   253
fun topthm () = apply_fun  (fn ((th,_), _) => th);
clasohm@0
   254
clasohm@0
   255
(*Return the final result.  *)
clasohm@0
   256
fun result () = !curr_mkresult (true, topthm());
clasohm@0
   257
clasohm@0
   258
(*Return the result UNCHECKED that it equals the goal -- for synthesis,
clasohm@0
   259
  answer extraction, or other instantiation of Vars *)
clasohm@0
   260
fun uresult () = !curr_mkresult (false, topthm());
clasohm@0
   261
clasohm@0
   262
(*Get subgoal i from goal stack*)
paulson@2580
   263
fun getgoal i = List.nth (prems_of (topthm()), i-1)
paulson@2580
   264
                handle Subscript => error"getgoal: Goal number out of range";
clasohm@0
   265
clasohm@0
   266
(*Return subgoal i's hypotheses as meta-level assumptions.
clasohm@0
   267
  For debugging uses of METAHYPS*)
clasohm@0
   268
local exception GETHYPS of thm list
clasohm@0
   269
in
clasohm@0
   270
fun gethyps i = 
paulson@1500
   271
    (METAHYPS (fn hyps => raise (GETHYPS hyps)) i (topthm());  [])
clasohm@0
   272
    handle GETHYPS hyps => hyps
clasohm@0
   273
end;
clasohm@0
   274
clasohm@0
   275
(*Which thms could apply to goal i? (debugs tactics involving filter_thms) *)
clasohm@0
   276
fun filter_goal could ths i = filter_thms could (999, getgoal i, ths);
clasohm@0
   277
clasohm@0
   278
(*For inspecting earlier levels of the backward proof*)
clasohm@0
   279
fun chop_level n (pair,pairs) = 
clasohm@0
   280
  let val level = length pairs
paulson@2126
   281
  in  if n<0 andalso ~n <= level
paulson@2580
   282
      then  List.drop (pair::pairs, ~n) 
paulson@2126
   283
      else if 0<=n andalso n<= level
paulson@2580
   284
      then  List.drop (pair::pairs, level - n) 
clasohm@0
   285
      else  error ("Level number must lie between 0 and " ^ 
clasohm@1460
   286
		   string_of_int level)
clasohm@0
   287
  end;
clasohm@0
   288
paulson@2514
   289
(*Print the given level of the proof; prlev ~1 prints previous level*)
clasohm@0
   290
fun prlev n = apply_fun (print_top o pop o (chop_level n));
clasohm@0
   291
fun pr () = apply_fun print_top;
clasohm@0
   292
paulson@2514
   293
(*Set goals_limit and print again*)
paulson@2514
   294
fun prlim n = (goals_limit:=n; pr());
paulson@2514
   295
clasohm@0
   296
(** the goal.... commands
clasohm@0
   297
    Read main goal.  Set global variables curr_prems, curr_mkresult. 
clasohm@0
   298
    Initial subgoal and premises are rewritten using rths. **)
clasohm@0
   299
clasohm@0
   300
(*Version taking the goal as a cterm; if you have a term t and theory thy, use
lcp@230
   301
    goalw_cterm rths (cterm_of (sign_of thy) t);      *)
clasohm@0
   302
fun goalw_cterm rths chorn = 
clasohm@0
   303
  let val (prems, st0, mkresult) = prepare_proof rths chorn
clasohm@0
   304
  in  undo_list := [];
clasohm@0
   305
      setstate [ (st0, Sequence.null) ];  
clasohm@0
   306
      curr_prems := prems;
clasohm@0
   307
      curr_mkresult := mkresult;
clasohm@0
   308
      prems
clasohm@0
   309
  end;
clasohm@0
   310
clasohm@0
   311
(*Version taking the goal as a string*)
clasohm@0
   312
fun goalw thy rths agoal = 
lcp@230
   313
  goalw_cterm rths (read_cterm(sign_of thy)(agoal,propT))
clasohm@0
   314
  handle ERROR => error (*from type_assign, etc via prepare_proof*)
clasohm@1460
   315
	    ("The error above occurred for " ^ quote agoal);
clasohm@0
   316
clasohm@0
   317
(*String version with no meta-rewrite-rules*)
clasohm@0
   318
fun goal thy = goalw thy [];
clasohm@0
   319
clasohm@0
   320
(*Proof step "by" the given tactic -- apply tactic to the proof state*)
clasohm@0
   321
fun by_com tac ((th,ths), pairs) : gstack =
paulson@1500
   322
  (case  Sequence.pull(tac th)  of
clasohm@0
   323
     None      => error"by: tactic failed"
clasohm@0
   324
   | Some(th2,ths2) => 
clasohm@0
   325
       (if eq_thm(th,th2) 
berghofe@1580
   326
	  then warning "same as previous level"
clasohm@1460
   327
	  else if eq_thm_sg(th,th2) then ()
berghofe@1580
   328
	  else warning("signature of proof state has changed" ^
clasohm@1460
   329
		       sign_error (#sign(rep_thm th), #sign(rep_thm th2)));
clasohm@0
   330
       ((th2,ths2)::(th,ths)::pairs)));
clasohm@0
   331
clasohm@0
   332
fun by tac = cond_timeit (!proof_timing) 
clasohm@0
   333
    (fn() => make_command (by_com tac));
clasohm@0
   334
clasohm@0
   335
(* byev[tac1,...,tacn] applies tac1 THEN ... THEN tacn.
clasohm@0
   336
   Good for debugging proofs involving prove_goal.*)
clasohm@0
   337
val byev = by o EVERY;
clasohm@0
   338
clasohm@0
   339
clasohm@0
   340
(*Backtracking means find an alternative result from a tactic.
clasohm@0
   341
  If none at this level, try earlier levels*)
clasohm@0
   342
fun backtrack [] = error"back: no alternatives"
clasohm@0
   343
  | backtrack ((th,thstr) :: pairs) =
clasohm@0
   344
     (case Sequence.pull thstr of
clasohm@1460
   345
	  None      => (writeln"Going back a level..."; backtrack pairs)
clasohm@1460
   346
	| Some(th2,thstr2) =>  
clasohm@1460
   347
	   (if eq_thm(th,th2) 
berghofe@1580
   348
	      then warning "same as previous choice at this level"
clasohm@1460
   349
	      else if eq_thm_sg(th,th2) then ()
berghofe@1580
   350
	      else warning "signature of proof state has changed";
clasohm@1460
   351
	    (th2,thstr2)::pairs));
clasohm@0
   352
clasohm@0
   353
fun back() = setstate (backtrack (getstate()));
clasohm@0
   354
clasohm@0
   355
(*Chop back to previous level of the proof*)
clasohm@0
   356
fun choplev n = make_command (chop_level n);
clasohm@0
   357
clasohm@0
   358
(*Chopping back the goal stack*)
clasohm@0
   359
fun chop () = make_command (fn (_,pairs) => pairs);
clasohm@0
   360
clasohm@0
   361
(*Restore the previous proof state;  discard current state. *)
clasohm@0
   362
fun undo() = case !undo_list of
clasohm@0
   363
      [] => error"No proof state"
clasohm@0
   364
    | [_] => error"Already at initial state"
clasohm@0
   365
    | _::newundo =>  (undo_list := newundo;  pr()) ;
clasohm@0
   366
clasohm@0
   367
clasohm@0
   368
(*** Managing the proof stack ***)
clasohm@0
   369
clasohm@0
   370
fun save_proof() = Proof(!undo_list, !curr_prems, !curr_mkresult);
clasohm@0
   371
clasohm@0
   372
fun restore_proof(Proof(ul,prems,mk)) =
clasohm@0
   373
 (undo_list:= ul;  curr_prems:= prems;  curr_mkresult := mk;  prems);
clasohm@0
   374
clasohm@0
   375
clasohm@0
   376
fun top_proof() = case !proofstack of
clasohm@1460
   377
	[] => error("Stack of proof attempts is empty!")
clasohm@0
   378
    | p::ps => (p,ps);
clasohm@0
   379
clasohm@0
   380
(*  push a copy of the current proof state on to the stack *)
clasohm@0
   381
fun push_proof() = (proofstack := (save_proof() :: !proofstack));
clasohm@0
   382
clasohm@0
   383
(* discard the top proof state of the stack *)
clasohm@0
   384
fun pop_proof() = 
clasohm@0
   385
  let val (p,ps) = top_proof()
clasohm@0
   386
      val prems = restore_proof p
clasohm@0
   387
  in proofstack := ps;  pr();  prems end;
clasohm@0
   388
clasohm@0
   389
(* rotate the stack so that the top element goes to the bottom *)
clasohm@0
   390
fun rotate_proof() = let val (p,ps) = top_proof()
clasohm@1460
   391
		    in proofstack := ps@[save_proof()];
clasohm@1460
   392
		       restore_proof p;
clasohm@1460
   393
		       pr();
clasohm@1460
   394
		       !curr_prems
clasohm@1460
   395
		    end;
clasohm@0
   396
clasohm@0
   397
clasohm@0
   398
(** Shortcuts for commonly-used tactics **)
clasohm@0
   399
clasohm@0
   400
fun bws rls = by (rewrite_goals_tac rls);
clasohm@0
   401
fun bw rl = bws [rl];
clasohm@0
   402
clasohm@0
   403
fun brs rls i = by (resolve_tac rls i);
clasohm@0
   404
fun br rl = brs [rl];
clasohm@0
   405
clasohm@0
   406
fun bes rls i = by (eresolve_tac rls i);
clasohm@0
   407
fun be rl = bes [rl];
clasohm@0
   408
clasohm@0
   409
fun bds rls i = by (dresolve_tac rls i);
clasohm@0
   410
fun bd rl = bds [rl];
clasohm@0
   411
clasohm@0
   412
fun ba i = by (assume_tac i);
clasohm@0
   413
clasohm@0
   414
fun ren str i = by (rename_tac str i);
clasohm@0
   415
clasohm@0
   416
(** Shortcuts to work on the first applicable subgoal **)
clasohm@0
   417
clasohm@0
   418
fun frs rls = by (FIRSTGOAL (trace_goalno_tac (resolve_tac rls)));
clasohm@0
   419
fun fr rl = frs [rl];
clasohm@0
   420
clasohm@0
   421
fun fes rls = by (FIRSTGOAL (trace_goalno_tac (eresolve_tac rls)));
clasohm@0
   422
fun fe rl = fes [rl];
clasohm@0
   423
clasohm@0
   424
fun fds rls = by (FIRSTGOAL (trace_goalno_tac (dresolve_tac rls)));
clasohm@0
   425
fun fd rl = fds [rl];
clasohm@0
   426
clasohm@0
   427
fun fa() = by (FIRSTGOAL (trace_goalno_tac assume_tac));
clasohm@0
   428
clasohm@0
   429
(** Reading and printing terms wrt the current theory **)
clasohm@0
   430
clasohm@0
   431
fun top_sg() = #sign(rep_thm(topthm()));
clasohm@0
   432
lcp@230
   433
fun read s = term_of (read_cterm (top_sg())
clasohm@1460
   434
			                   (s, (TVar(("DUMMY",0),[]))));
clasohm@0
   435
clasohm@0
   436
(*Print a term under the current signature of the proof state*)
clasohm@0
   437
fun prin t = writeln (Sign.string_of_term (top_sg()) t);
clasohm@0
   438
clasohm@0
   439
fun printyp T = writeln (Sign.string_of_typ (top_sg()) T);
clasohm@0
   440
clasohm@0
   441
fun pprint_term t = Sign.pprint_term (top_sg()) t;
clasohm@0
   442
clasohm@0
   443
fun pprint_typ T = Sign.pprint_typ (top_sg()) T;
clasohm@0
   444
berghofe@1628
   445
(* Redirect output of function f:unit->unit to LaTeX *)
berghofe@1628
   446
fun redirect_to_latex f =
berghofe@1628
   447
	let
berghofe@1628
   448
		val s = ref ""
berghofe@1628
   449
		val old_prs_fn = !prs_fn
berghofe@1628
   450
	in
berghofe@1628
   451
		(prs_fn := (fn a => s := !s ^ a);
berghofe@1628
   452
		f ();
berghofe@1628
   453
		latex (!s);
berghofe@1628
   454
		prs_fn := old_prs_fn)
berghofe@1628
   455
	end;
berghofe@1628
   456
berghofe@1628
   457
(* Display current proof state in xdvi window *)
berghofe@1628
   458
fun pr_latex () = redirect_to_latex pr;
berghofe@1628
   459
berghofe@1628
   460
(* Display goal n of current proof state in xdvi window *)
berghofe@1628
   461
fun printgoal_latex n = redirect_to_latex (fn () => prin(getgoal n));
berghofe@1628
   462
clasohm@0
   463
(*Prints exceptions nicely at top level; 
clasohm@0
   464
  raises the exception in order to have a polymorphic type!*)
lcp@914
   465
fun print_exn e = (print_sign_exn_unit (top_sg()) e;  raise e);
clasohm@0
   466
clasohm@0
   467
end;
paulson@1500
   468
paulson@1500
   469
open Goals;