src/Pure/display.ML
author haftmann
Tue Sep 06 08:30:43 2005 +0200 (2005-09-06)
changeset 17271 2756a73f63a5
parent 16937 0822bbdd6769
child 17447 3a23acfdf5ba
permissions -rw-r--r--
introduced some new-style AList operations
paulson@1591
     1
(*  Title:      Pure/display.ML
paulson@1591
     2
    ID:         $Id$
paulson@1591
     3
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
paulson@1591
     4
    Copyright   1993  University of Cambridge
paulson@1591
     5
paulson@1591
     6
Printing of theories, theorems, etc.
paulson@1591
     7
*)
paulson@1591
     8
wenzelm@11883
     9
signature BASIC_DISPLAY =
wenzelm@11883
    10
sig
wenzelm@12081
    11
  val goals_limit: int ref
wenzelm@11883
    12
  val show_hyps: bool ref
wenzelm@11883
    13
  val show_tags: bool ref
wenzelm@11883
    14
  val string_of_thm: thm -> string
wenzelm@11883
    15
  val print_thm: thm -> unit
wenzelm@11883
    16
  val print_thms: thm list -> unit
wenzelm@11883
    17
  val prth: thm -> thm
wenzelm@11883
    18
  val prthq: thm Seq.seq -> thm Seq.seq
wenzelm@11883
    19
  val prths: thm list -> thm list
wenzelm@11883
    20
  val string_of_ctyp: ctyp -> string
wenzelm@11883
    21
  val print_ctyp: ctyp -> unit
wenzelm@11883
    22
  val string_of_cterm: cterm -> string
wenzelm@11883
    23
  val print_cterm: cterm -> unit
wenzelm@11883
    24
  val print_syntax: theory -> unit
wenzelm@11883
    25
  val show_consts: bool ref
wenzelm@11883
    26
end;
wenzelm@11883
    27
paulson@1591
    28
signature DISPLAY =
wenzelm@4950
    29
sig
wenzelm@11883
    30
  include BASIC_DISPLAY
wenzelm@14876
    31
  val pretty_flexpair: Pretty.pp -> term * term -> Pretty.T
wenzelm@14876
    32
  val pretty_thm_aux: Pretty.pp -> bool -> thm -> Pretty.T
wenzelm@6976
    33
  val pretty_thm_no_quote: thm -> Pretty.T
wenzelm@11883
    34
  val pretty_thm: thm -> Pretty.T
wenzelm@11883
    35
  val pretty_thms: thm list -> Pretty.T
wenzelm@16437
    36
  val pretty_thm_sg: theory -> thm -> Pretty.T
wenzelm@16437
    37
  val pretty_thms_sg: theory -> thm list -> Pretty.T
wenzelm@11883
    38
  val pprint_thm: thm -> pprint_args -> unit
wenzelm@11883
    39
  val pretty_ctyp: ctyp -> Pretty.T
wenzelm@11883
    40
  val pprint_ctyp: ctyp -> pprint_args -> unit
wenzelm@11883
    41
  val pretty_cterm: cterm -> Pretty.T
wenzelm@11883
    42
  val pprint_cterm: cterm -> pprint_args -> unit
wenzelm@8720
    43
  val pretty_full_theory: theory -> Pretty.T list
wenzelm@14876
    44
  val pretty_goals_aux: Pretty.pp -> string -> bool * bool -> int -> thm -> Pretty.T list
wenzelm@11883
    45
  val pretty_goals: int -> thm -> Pretty.T list
wenzelm@11883
    46
  val print_goals: int -> thm -> unit
wenzelm@11883
    47
  val current_goals_markers: (string * string * string) ref
wenzelm@12418
    48
  val pretty_current_goals: int -> int -> thm -> Pretty.T list
wenzelm@12418
    49
  val print_current_goals_default: int -> int -> thm -> unit
wenzelm@12418
    50
  val print_current_goals_fn: (int -> int -> thm -> unit) ref
wenzelm@4950
    51
end;
paulson@1591
    52
wenzelm@4950
    53
structure Display: DISPLAY =
paulson@1591
    54
struct
paulson@1591
    55
wenzelm@11883
    56
wenzelm@6087
    57
(** print thm **)
wenzelm@6087
    58
wenzelm@16534
    59
val goals_limit = ref 10;       (*max number of goals to print*)
wenzelm@12831
    60
val show_hyps = ref false;      (*false: print meta-hypotheses as dots*)
wenzelm@11883
    61
val show_tags = ref false;      (*false: suppress tags*)
wenzelm@6087
    62
berghofe@14598
    63
fun pretty_tag (name, args) = Pretty.strs (name :: map Library.quote args);
wenzelm@6087
    64
val pretty_tags = Pretty.list "[" "]" o map pretty_tag;
paulson@1591
    65
wenzelm@14876
    66
fun pretty_flexpair pp (t, u) = Pretty.block
wenzelm@14876
    67
  [Pretty.term pp t, Pretty.str " =?=", Pretty.brk 1, Pretty.term pp u];
berghofe@13658
    68
wenzelm@14876
    69
fun pretty_thm_aux pp quote th =
paulson@1591
    70
  let
wenzelm@16290
    71
    val {hyps, tpairs, prop, der = (ora, _), ...} = Thm.rep_thm th;
wenzelm@6087
    72
    val xshyps = Thm.extra_shyps th;
wenzelm@6087
    73
    val (_, tags) = Thm.get_name_tags th;
wenzelm@6087
    74
berghofe@13658
    75
    val q = if quote then Pretty.quote else I;
wenzelm@14876
    76
    val prt_term = q o (Pretty.term pp);
wenzelm@6279
    77
berghofe@13658
    78
    val hlen = length xshyps + length hyps + length tpairs;
paulson@1591
    79
    val hsymbs =
wenzelm@9500
    80
      if hlen = 0 andalso not ora then []
paulson@1591
    81
      else if ! show_hyps then
paulson@1591
    82
        [Pretty.brk 2, Pretty.list "[" "]"
wenzelm@14876
    83
          (map (q o pretty_flexpair pp) tpairs @ map prt_term hyps @
wenzelm@14876
    84
           map (Pretty.sort pp) xshyps @
wenzelm@9500
    85
            (if ora then [Pretty.str "!"] else []))]
wenzelm@6889
    86
      else [Pretty.brk 2, Pretty.str ("[" ^ implode (replicate hlen ".") ^
wenzelm@9500
    87
        (if ora then "!" else "") ^ "]")];
wenzelm@6087
    88
    val tsymbs =
wenzelm@6087
    89
      if null tags orelse not (! show_tags) then []
wenzelm@6087
    90
      else [Pretty.brk 1, pretty_tags tags];
wenzelm@6279
    91
  in Pretty.block (prt_term prop :: (hsymbs @ tsymbs)) end;
paulson@1591
    92
wenzelm@12067
    93
fun gen_pretty_thm quote th =
wenzelm@16437
    94
  pretty_thm_aux (Sign.pp (Thm.theory_of_thm th)) quote th;
wenzelm@6889
    95
wenzelm@12067
    96
val pretty_thm = gen_pretty_thm true;
wenzelm@12067
    97
val pretty_thm_no_quote = gen_pretty_thm false;
wenzelm@6889
    98
wenzelm@6889
    99
paulson@1591
   100
val string_of_thm = Pretty.string_of o pretty_thm;
wenzelm@6279
   101
val pprint_thm = Pretty.pprint o pretty_thm;
paulson@1591
   102
wenzelm@6087
   103
fun pretty_thms [th] = pretty_thm th
wenzelm@6087
   104
  | pretty_thms ths = Pretty.block (Pretty.fbreaks (map pretty_thm ths));
paulson@1591
   105
wenzelm@16437
   106
val pretty_thm_sg = pretty_thm oo Thm.transfer;
wenzelm@16437
   107
val pretty_thms_sg = pretty_thms oo (map o Thm.transfer);
wenzelm@10010
   108
wenzelm@6087
   109
wenzelm@6087
   110
(* top-level commands for printing theorems *)
wenzelm@6087
   111
wenzelm@6087
   112
val print_thm = Pretty.writeln o pretty_thm;
wenzelm@6087
   113
val print_thms = Pretty.writeln o pretty_thms;
paulson@1591
   114
paulson@1591
   115
fun prth th = (print_thm th; th);
wenzelm@16534
   116
fun prthq thq = (Seq.print (K print_thm) 100000 thq; thq);
wenzelm@16534
   117
fun prths ths = (prthq (Seq.of_list ths); ths);
paulson@1591
   118
paulson@1591
   119
paulson@1591
   120
(* other printing commands *)
paulson@1591
   121
wenzelm@4126
   122
fun pretty_ctyp cT =
wenzelm@16437
   123
  let val {thy, T, ...} = rep_ctyp cT in Sign.pretty_typ thy T end;
wenzelm@4126
   124
paulson@1591
   125
fun pprint_ctyp cT =
wenzelm@16437
   126
  let val {thy, T, ...} = rep_ctyp cT in Sign.pprint_typ thy T end;
paulson@1591
   127
paulson@1591
   128
fun string_of_ctyp cT =
wenzelm@16437
   129
  let val {thy, T, ...} = rep_ctyp cT in Sign.string_of_typ thy T end;
paulson@1591
   130
paulson@1591
   131
val print_ctyp = writeln o string_of_ctyp;
paulson@1591
   132
wenzelm@3547
   133
fun pretty_cterm ct =
wenzelm@16437
   134
  let val {thy, t, ...} = rep_cterm ct in Sign.pretty_term thy t end;
wenzelm@3547
   135
paulson@1591
   136
fun pprint_cterm ct =
wenzelm@16437
   137
  let val {thy, t, ...} = rep_cterm ct in Sign.pprint_term thy t end;
paulson@1591
   138
paulson@1591
   139
fun string_of_cterm ct =
wenzelm@16437
   140
  let val {thy, t, ...} = rep_cterm ct in Sign.string_of_term thy t end;
paulson@1591
   141
paulson@1591
   142
val print_cterm = writeln o string_of_cterm;
paulson@1591
   143
paulson@1591
   144
wenzelm@4250
   145
wenzelm@4250
   146
(** print theory **)
paulson@1591
   147
wenzelm@16437
   148
val print_syntax = Syntax.print_syntax o Sign.syn_of;
wenzelm@4498
   149
wenzelm@4498
   150
wenzelm@11883
   151
(* pretty_full_theory *)
wenzelm@4250
   152
wenzelm@8720
   153
fun pretty_full_theory thy =
wenzelm@4250
   154
  let
wenzelm@16437
   155
    fun prt_cls c = Sign.pretty_sort thy [c];
wenzelm@16437
   156
    fun prt_sort S = Sign.pretty_sort thy S;
wenzelm@16437
   157
    fun prt_arity t (c, Ss) = Sign.pretty_arity thy (t, Ss, [c]);
wenzelm@16437
   158
    fun prt_typ ty = Pretty.quote (Sign.pretty_typ thy ty);
wenzelm@16290
   159
    val prt_typ_no_tvars = prt_typ o Type.freeze_type;
wenzelm@16437
   160
    fun prt_term t = Pretty.quote (Sign.pretty_term thy t);
wenzelm@4250
   161
wenzelm@14794
   162
    fun pretty_classrel (c, []) = prt_cls c
wenzelm@14794
   163
      | pretty_classrel (c, cs) = Pretty.block
wenzelm@14794
   164
          (prt_cls c :: Pretty.str " <" :: Pretty.brk 1 ::
wenzelm@14794
   165
            Pretty.commas (map prt_cls cs));
wenzelm@4250
   166
wenzelm@4250
   167
    fun pretty_default S = Pretty.block
wenzelm@14794
   168
      [Pretty.str "default sort:", Pretty.brk 1, prt_sort S];
wenzelm@4250
   169
skalberg@15531
   170
    fun pretty_witness NONE = Pretty.str "universal non-emptiness witness: -"
skalberg@15531
   171
      | pretty_witness (SOME (T, S)) = Pretty.block
wenzelm@14794
   172
          [Pretty.str "universal non-emptiness witness:", Pretty.brk 1,
wenzelm@14794
   173
            prt_typ_no_tvars T, Pretty.str " ::", Pretty.brk 1, prt_sort S];
wenzelm@14794
   174
wenzelm@14996
   175
    val tfrees = map (fn v => TFree (v, []));
wenzelm@16364
   176
    fun pretty_type syn (t, (Type.LogicalType n, _)) =
skalberg@15531
   177
          if syn then NONE
skalberg@15531
   178
          else SOME (prt_typ (Type (t, tfrees (Term.invent_names [] "'a" n))))
wenzelm@16364
   179
      | pretty_type syn (t, (Type.Abbreviation (vs, U, syn'), _)) =
skalberg@15531
   180
          if syn <> syn' then NONE
skalberg@15531
   181
          else SOME (Pretty.block
wenzelm@14996
   182
            [prt_typ (Type (t, tfrees vs)), Pretty.str " =", Pretty.brk 1, prt_typ U])
wenzelm@16364
   183
      | pretty_type syn (t, (Type.Nonterminal, _)) =
skalberg@15531
   184
          if not syn then NONE
skalberg@15531
   185
          else SOME (prt_typ (Type (t, [])));
wenzelm@4250
   186
skalberg@15570
   187
    val pretty_arities = List.concat o map (fn (t, ars) => map (prt_arity t) ars);
skalberg@14223
   188
wenzelm@16937
   189
    fun pretty_const (c, ty) = Pretty.block
wenzelm@10737
   190
      [Pretty.str c, Pretty.str " ::", Pretty.brk 1, prt_typ_no_tvars ty];
wenzelm@4250
   191
wenzelm@14996
   192
    fun pretty_final (c, []) = Pretty.str c
wenzelm@14996
   193
      | pretty_final (c, tys) = Pretty.block
wenzelm@14996
   194
          (Pretty.str c :: Pretty.str " ::" :: Pretty.brk 1 ::
wenzelm@14996
   195
             Pretty.commas (map prt_typ_no_tvars tys));
wenzelm@14996
   196
wenzelm@8720
   197
    fun prt_axm (a, t) = Pretty.block [Pretty.str (a ^ ":"), Pretty.brk 1, prt_term t];
wenzelm@8720
   198
wenzelm@16437
   199
    val {axioms, defs, oracles} = Theory.rep_theory thy;
wenzelm@16937
   200
    val {naming, syn = _, tsig, consts = (consts, constraints)} = Sign.rep_sg thy;
wenzelm@14794
   201
    val {classes, default, types, arities, log_types = _, witness} = Type.rep_tsig tsig;
wenzelm@14996
   202
wenzelm@16845
   203
    val clsses = NameSpace.dest_table (apsnd (Symtab.make o Graph.dest) classes);
wenzelm@16845
   204
    val tdecls = NameSpace.dest_table types;
wenzelm@16845
   205
    val arties = NameSpace.dest_table (Sign.type_space thy, arities);
wenzelm@16937
   206
    val cnsts = NameSpace.extern_table consts |> map (apsnd fst);
wenzelm@16937
   207
    val cnsts' = NameSpace.extern_table (#1 consts, constraints);
wenzelm@16364
   208
    val finals = NameSpace.extern_table (#1 consts, Defs.finals defs);
wenzelm@16334
   209
    val axms = NameSpace.extern_table axioms;
wenzelm@16334
   210
    val oras = NameSpace.extern_table oracles;
wenzelm@4250
   211
  in
wenzelm@16437
   212
    [Pretty.strs ("names:" :: Context.names_of thy),
wenzelm@16534
   213
      Pretty.strs ("theory data:" :: Context.theory_data_of thy),
wenzelm@16534
   214
      Pretty.strs ("proof data:" :: Context.proof_data_of thy),
wenzelm@16127
   215
      Pretty.strs ["name prefix:", NameSpace.path_of naming],
wenzelm@16364
   216
      Pretty.big_list "classes:" (map pretty_classrel clsses),
wenzelm@8720
   217
      pretty_default default,
wenzelm@14794
   218
      pretty_witness witness,
skalberg@15570
   219
      Pretty.big_list "syntactic types:" (List.mapPartial (pretty_type true) tdecls),
skalberg@15570
   220
      Pretty.big_list "logical types:" (List.mapPartial (pretty_type false) tdecls),
wenzelm@16534
   221
      Pretty.big_list "type arities:" (pretty_arities arties),
wenzelm@14794
   222
      Pretty.big_list "consts:" (map pretty_const cnsts),
wenzelm@16937
   223
      Pretty.big_list "const constraints:" (map pretty_const cnsts'),
wenzelm@14996
   224
      Pretty.big_list "finals consts:" (map pretty_final finals),
wenzelm@8720
   225
      Pretty.big_list "axioms:" (map prt_axm axms),
wenzelm@8720
   226
      Pretty.strs ("oracles:" :: (map #1 oras))]
wenzelm@4250
   227
  end;
wenzelm@4250
   228
wenzelm@4250
   229
wenzelm@11883
   230
wenzelm@11883
   231
(** print_goals **)
wenzelm@11883
   232
wenzelm@11883
   233
(* print_goals etc. *)
wenzelm@11883
   234
wenzelm@16534
   235
val show_consts = ref false;  (*true: show consts with types in proof state output*)
wenzelm@3851
   236
paulson@1591
   237
wenzelm@11883
   238
(*print thm A1,...,An/B in "goal style" -- premises as numbered subgoals*)
wenzelm@11883
   239
wenzelm@11883
   240
local
wenzelm@11883
   241
wenzelm@12081
   242
fun ins_entry (x, y) [] = [(x, [y])]
wenzelm@12081
   243
  | ins_entry (x, y) ((pair as (x', ys')) :: pairs) =
wenzelm@12081
   244
      if x = x' then (x', y ins ys') :: pairs
wenzelm@12081
   245
      else pair :: ins_entry (x, y) pairs;
wenzelm@12081
   246
wenzelm@12081
   247
fun add_consts (Const (c, T), env) = ins_entry (T, (c, T)) env
wenzelm@12081
   248
  | add_consts (t $ u, env) = add_consts (u, add_consts (t, env))
wenzelm@12081
   249
  | add_consts (Abs (_, _, t), env) = add_consts (t, env)
wenzelm@12081
   250
  | add_consts (_, env) = env;
wenzelm@11883
   251
wenzelm@12081
   252
fun add_vars (Free (x, T), env) = ins_entry (T, (x, ~1)) env
wenzelm@12081
   253
  | add_vars (Var (xi, T), env) = ins_entry (T, xi) env
wenzelm@12081
   254
  | add_vars (Abs (_, _, t), env) = add_vars (t, env)
wenzelm@12081
   255
  | add_vars (t $ u, env) = add_vars (u, add_vars (t, env))
wenzelm@12081
   256
  | add_vars (_, env) = env;
wenzelm@11883
   257
skalberg@15574
   258
fun add_varsT (Type (_, Ts), env) = foldr add_varsT env Ts
wenzelm@12081
   259
  | add_varsT (TFree (x, S), env) = ins_entry (S, (x, ~1)) env
wenzelm@12081
   260
  | add_varsT (TVar (xi, S), env) = ins_entry (S, xi) env;
wenzelm@11883
   261
wenzelm@16490
   262
fun sort_idxs vs = map (apsnd (sort (prod_ord string_ord int_ord))) vs;
wenzelm@12081
   263
fun sort_cnsts cs = map (apsnd (sort_wrt fst)) cs;
wenzelm@12081
   264
wenzelm@12081
   265
fun consts_of t = sort_cnsts (add_consts (t, []));
wenzelm@12081
   266
fun vars_of t = sort_idxs (add_vars (t, []));
wenzelm@12081
   267
fun varsT_of t = rev (sort_idxs (it_term_types add_varsT (t, [])));
wenzelm@12081
   268
wenzelm@12081
   269
in
wenzelm@11883
   270
wenzelm@14876
   271
fun pretty_goals_aux pp begin_goal (msg, main) maxgoals state =
wenzelm@12081
   272
  let
wenzelm@12081
   273
    fun prt_atoms prt prtT (X, xs) = Pretty.block
wenzelm@12081
   274
      [Pretty.block (Pretty.commas (map prt xs)), Pretty.str " ::",
wenzelm@12081
   275
        Pretty.brk 1, prtT X];
wenzelm@11883
   276
wenzelm@14876
   277
    fun prt_var (x, ~1) = Pretty.term pp (Syntax.free x)
wenzelm@14876
   278
      | prt_var xi = Pretty.term pp (Syntax.var xi);
wenzelm@12081
   279
wenzelm@14876
   280
    fun prt_varT (x, ~1) = Pretty.typ pp (TFree (x, []))
wenzelm@14876
   281
      | prt_varT xi = Pretty.typ pp (TVar (xi, []));
wenzelm@12081
   282
wenzelm@14876
   283
    val prt_consts = prt_atoms (Pretty.term pp o Const) (Pretty.typ pp);
wenzelm@14876
   284
    val prt_vars = prt_atoms prt_var (Pretty.typ pp);
wenzelm@14876
   285
    val prt_varsT = prt_atoms prt_varT (Pretty.sort pp);
wenzelm@11883
   286
wenzelm@11883
   287
wenzelm@12081
   288
    fun pretty_list _ _ [] = []
wenzelm@12081
   289
      | pretty_list name prt lst = [Pretty.big_list name (map prt lst)];
wenzelm@11883
   290
wenzelm@14876
   291
    fun pretty_subgoal (n, A) = Pretty.blk (0,
wenzelm@14876
   292
     [Pretty.str (begin_goal ^ " " ^ string_of_int n ^ ". "), Pretty.term pp A]);
wenzelm@12081
   293
    fun pretty_subgoals As = map pretty_subgoal (1 upto length As ~~ As);
wenzelm@11883
   294
wenzelm@14876
   295
    val pretty_ffpairs = pretty_list "flex-flex pairs:" (pretty_flexpair pp);
wenzelm@11883
   296
wenzelm@12081
   297
    val pretty_consts = pretty_list "constants:" prt_consts o consts_of;
wenzelm@12081
   298
    val pretty_vars = pretty_list "variables:" prt_vars o vars_of;
wenzelm@12081
   299
    val pretty_varsT = pretty_list "type variables:" prt_varsT o varsT_of;
wenzelm@11883
   300
wenzelm@11883
   301
wenzelm@16290
   302
    val {prop, tpairs, ...} = Thm.rep_thm state;
berghofe@13658
   303
    val (As, B) = Logic.strip_horn prop;
wenzelm@12081
   304
    val ngoals = length As;
wenzelm@11883
   305
wenzelm@12081
   306
    fun pretty_gs (types, sorts) =
wenzelm@14876
   307
      (if main then [Pretty.term pp B] else []) @
wenzelm@12081
   308
       (if ngoals = 0 then [Pretty.str "No subgoals!"]
wenzelm@12081
   309
        else if ngoals > maxgoals then
skalberg@15570
   310
          pretty_subgoals (Library.take (maxgoals, As)) @
wenzelm@12081
   311
          (if msg then [Pretty.str ("A total of " ^ string_of_int ngoals ^ " subgoals...")]
wenzelm@12081
   312
           else [])
wenzelm@12081
   313
        else pretty_subgoals As) @
wenzelm@12081
   314
      pretty_ffpairs tpairs @
wenzelm@12081
   315
      (if ! show_consts then pretty_consts prop else []) @
wenzelm@12081
   316
      (if types then pretty_vars prop else []) @
wenzelm@12081
   317
      (if sorts then pretty_varsT prop else []);
wenzelm@12081
   318
  in
wenzelm@12081
   319
    setmp show_no_free_types true
skalberg@14178
   320
      (setmp show_types (! show_types orelse ! show_sorts orelse ! show_all_types)
wenzelm@12081
   321
        (setmp show_sorts false pretty_gs))
skalberg@14178
   322
   (! show_types orelse ! show_sorts orelse ! show_all_types, ! show_sorts)
wenzelm@11883
   323
  end;
wenzelm@11883
   324
wenzelm@12081
   325
fun pretty_goals_marker bg n th =
wenzelm@16437
   326
  pretty_goals_aux (Sign.pp (Thm.theory_of_thm th)) bg (true, true) n th;
wenzelm@12081
   327
wenzelm@12081
   328
val pretty_goals = pretty_goals_marker "";
wenzelm@12418
   329
val print_goals = (Pretty.writeln o Pretty.chunks) oo pretty_goals_marker "";
wenzelm@12081
   330
paulson@1591
   331
end;
paulson@1591
   332
wenzelm@11883
   333
wenzelm@11883
   334
(* print_current_goals *)
wenzelm@11883
   335
wenzelm@11883
   336
val current_goals_markers = ref ("", "", "");
wenzelm@11883
   337
wenzelm@12418
   338
fun pretty_current_goals n m th =
wenzelm@11883
   339
  let
wenzelm@11883
   340
    val ref (begin_state, end_state, begin_goal) = current_goals_markers;
wenzelm@11883
   341
    val ngoals = nprems_of th;
wenzelm@11883
   342
  in
wenzelm@12418
   343
    (if begin_state = "" then [] else [Pretty.str begin_state]) @
wenzelm@12418
   344
    [Pretty.str ("Level " ^ string_of_int n ^
wenzelm@11883
   345
      (if ngoals > 0 then " (" ^ string_of_int ngoals ^ " subgoal" ^
wenzelm@11883
   346
        (if ngoals <> 1 then "s" else "") ^ ")"
wenzelm@12418
   347
      else ""))] @
wenzelm@12418
   348
    pretty_goals_marker begin_goal m th @
wenzelm@12418
   349
    (if end_state = "" then [] else [Pretty.str end_state])
wenzelm@11883
   350
  end;
wenzelm@11883
   351
wenzelm@12418
   352
fun print_current_goals_default n m th =
wenzelm@12418
   353
  Pretty.writeln (Pretty.chunks (pretty_current_goals n m th));
wenzelm@12418
   354
wenzelm@11883
   355
val print_current_goals_fn = ref print_current_goals_default;
wenzelm@11883
   356
wenzelm@11883
   357
end;
wenzelm@11883
   358
wenzelm@11883
   359
structure BasicDisplay: BASIC_DISPLAY = Display;
wenzelm@11883
   360
open BasicDisplay;