src/Pure/display.ML
author kleing
Wed Feb 11 16:03:10 2009 +1100 (2009-02-11)
changeset 29858 c8cee17d7e50
parent 29606 fedb8be05f24
child 30186 1f836e949ac2
permissions -rw-r--r--
Autosolve feature for detecting duplicate theorems; patch by Timothy Bourke
paulson@1591
     1
(*  Title:      Pure/display.ML
paulson@1591
     2
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
paulson@1591
     3
    Copyright   1993  University of Cambridge
paulson@1591
     4
wenzelm@19420
     5
Printing of theorems, goals, results etc.
paulson@1591
     6
*)
paulson@1591
     7
wenzelm@11883
     8
signature BASIC_DISPLAY =
wenzelm@11883
     9
sig
wenzelm@12081
    10
  val goals_limit: int ref
wenzelm@11883
    11
  val show_hyps: bool ref
wenzelm@11883
    12
  val show_tags: bool ref
wenzelm@11883
    13
  val show_consts: bool ref
wenzelm@11883
    14
end;
wenzelm@11883
    15
paulson@1591
    16
signature DISPLAY =
wenzelm@4950
    17
sig
wenzelm@11883
    18
  include BASIC_DISPLAY
wenzelm@14876
    19
  val pretty_flexpair: Pretty.pp -> term * term -> Pretty.T
wenzelm@17447
    20
  val pretty_thm_aux: Pretty.pp -> bool -> bool -> term list -> thm -> Pretty.T
wenzelm@11883
    21
  val pretty_thm: thm -> Pretty.T
wenzelm@26928
    22
  val string_of_thm: thm -> string
kleing@29858
    23
  val pretty_fact: Facts.ref * thm -> Pretty.T
wenzelm@11883
    24
  val pretty_thms: thm list -> Pretty.T
wenzelm@16437
    25
  val pretty_thm_sg: theory -> thm -> Pretty.T
wenzelm@16437
    26
  val pretty_thms_sg: theory -> thm list -> Pretty.T
wenzelm@26928
    27
  val print_thm: thm -> unit
wenzelm@26928
    28
  val print_thms: thm list -> unit
wenzelm@26928
    29
  val prth: thm -> thm
wenzelm@26928
    30
  val prthq: thm Seq.seq -> thm Seq.seq
wenzelm@26928
    31
  val prths: thm list -> thm list
wenzelm@11883
    32
  val pretty_ctyp: ctyp -> Pretty.T
wenzelm@26928
    33
  val string_of_ctyp: ctyp -> string
wenzelm@26928
    34
  val print_ctyp: ctyp -> unit
wenzelm@11883
    35
  val pretty_cterm: cterm -> Pretty.T
wenzelm@26928
    36
  val string_of_cterm: cterm -> string
wenzelm@26928
    37
  val print_cterm: cterm -> unit
wenzelm@26928
    38
  val print_syntax: theory -> unit
wenzelm@20629
    39
  val pretty_full_theory: bool -> theory -> Pretty.T list
wenzelm@23634
    40
  val pretty_goals_aux: Pretty.pp -> Markup.T -> bool * bool -> int -> thm -> Pretty.T list
wenzelm@11883
    41
  val pretty_goals: int -> thm -> Pretty.T list
wenzelm@11883
    42
  val print_goals: int -> thm -> unit
wenzelm@4950
    43
end;
paulson@1591
    44
wenzelm@4950
    45
structure Display: DISPLAY =
paulson@1591
    46
struct
paulson@1591
    47
wenzelm@11883
    48
wenzelm@6087
    49
(** print thm **)
wenzelm@6087
    50
wenzelm@16534
    51
val goals_limit = ref 10;       (*max number of goals to print*)
wenzelm@12831
    52
val show_hyps = ref false;      (*false: print meta-hypotheses as dots*)
wenzelm@11883
    53
val show_tags = ref false;      (*false: suppress tags*)
wenzelm@6087
    54
wenzelm@28840
    55
fun pretty_tag (name, arg) = Pretty.strs [name, quote arg];
wenzelm@6087
    56
val pretty_tags = Pretty.list "[" "]" o map pretty_tag;
paulson@1591
    57
wenzelm@14876
    58
fun pretty_flexpair pp (t, u) = Pretty.block
wenzelm@14876
    59
  [Pretty.term pp t, Pretty.str " =?=", Pretty.brk 1, Pretty.term pp u];
berghofe@13658
    60
wenzelm@17447
    61
fun pretty_thm_aux pp quote show_hyps' asms raw_th =
paulson@1591
    62
  let
wenzelm@17447
    63
    val th = Thm.strip_shyps raw_th;
wenzelm@28316
    64
    val {hyps, tpairs, prop, ...} = Thm.rep_thm th;
wenzelm@6087
    65
    val xshyps = Thm.extra_shyps th;
wenzelm@21646
    66
    val tags = Thm.get_tags th;
wenzelm@6087
    67
berghofe@13658
    68
    val q = if quote then Pretty.quote else I;
wenzelm@22878
    69
    val prt_term = q o Pretty.term pp;
wenzelm@6279
    70
wenzelm@19300
    71
    val hyps' = if ! show_hyps then hyps else subtract (op aconv) asms hyps;
wenzelm@28802
    72
(* FIXME
wenzelm@28802
    73
    val ora' = Thm.oracle_of th andalso (! show_hyps orelse not (! quick_and_dirty)); *)
wenzelm@28802
    74
    val ora' = false;
wenzelm@28802
    75
wenzelm@17447
    76
    val hlen = length xshyps + length hyps' + length tpairs;
paulson@1591
    77
    val hsymbs =
wenzelm@17475
    78
      if hlen = 0 andalso not ora' then []
wenzelm@17447
    79
      else if ! show_hyps orelse show_hyps' then
paulson@1591
    80
        [Pretty.brk 2, Pretty.list "[" "]"
wenzelm@17447
    81
          (map (q o pretty_flexpair pp) tpairs @ map prt_term hyps' @
wenzelm@14876
    82
           map (Pretty.sort pp) xshyps @
wenzelm@17475
    83
            (if ora' then [Pretty.str "!"] else []))]
wenzelm@6889
    84
      else [Pretty.brk 2, Pretty.str ("[" ^ implode (replicate hlen ".") ^
wenzelm@17475
    85
        (if ora' then "!" else "") ^ "]")];
wenzelm@6087
    86
    val tsymbs =
wenzelm@6087
    87
      if null tags orelse not (! show_tags) then []
wenzelm@6087
    88
      else [Pretty.brk 1, pretty_tags tags];
wenzelm@6279
    89
  in Pretty.block (prt_term prop :: (hsymbs @ tsymbs)) end;
paulson@1591
    90
wenzelm@20226
    91
fun pretty_thm th =
wenzelm@26939
    92
  pretty_thm_aux (Syntax.pp_global (Thm.theory_of_thm th)) true false [] th;
wenzelm@6889
    93
paulson@1591
    94
val string_of_thm = Pretty.string_of o pretty_thm;
paulson@1591
    95
kleing@29858
    96
fun pretty_fact (thmref, thm) = Pretty.block
kleing@29858
    97
  [Pretty.str (Facts.string_of_ref thmref), Pretty.str ":", Pretty.brk 1,
kleing@29858
    98
   pretty_thm thm];
kleing@29858
    99
wenzelm@6087
   100
fun pretty_thms [th] = pretty_thm th
wenzelm@6087
   101
  | pretty_thms ths = Pretty.block (Pretty.fbreaks (map pretty_thm ths));
paulson@1591
   102
wenzelm@16437
   103
val pretty_thm_sg = pretty_thm oo Thm.transfer;
wenzelm@16437
   104
val pretty_thms_sg = pretty_thms oo (map o Thm.transfer);
wenzelm@10010
   105
wenzelm@6087
   106
wenzelm@6087
   107
(* top-level commands for printing theorems *)
wenzelm@6087
   108
wenzelm@6087
   109
val print_thm = Pretty.writeln o pretty_thm;
wenzelm@6087
   110
val print_thms = Pretty.writeln o pretty_thms;
paulson@1591
   111
paulson@1591
   112
fun prth th = (print_thm th; th);
wenzelm@16534
   113
fun prthq thq = (Seq.print (K print_thm) 100000 thq; thq);
wenzelm@16534
   114
fun prths ths = (prthq (Seq.of_list ths); ths);
paulson@1591
   115
paulson@1591
   116
paulson@1591
   117
(* other printing commands *)
paulson@1591
   118
wenzelm@26939
   119
fun pretty_ctyp cT = Syntax.pretty_typ_global (Thm.theory_of_ctyp cT) (Thm.typ_of cT);
wenzelm@26939
   120
fun string_of_ctyp cT = Syntax.string_of_typ_global (Thm.theory_of_ctyp cT) (Thm.typ_of cT);
paulson@1591
   121
val print_ctyp = writeln o string_of_ctyp;
paulson@1591
   122
wenzelm@26939
   123
fun pretty_cterm ct = Syntax.pretty_term_global (Thm.theory_of_cterm ct) (Thm.term_of ct);
wenzelm@26939
   124
fun string_of_cterm ct = Syntax.string_of_term_global (Thm.theory_of_cterm ct) (Thm.term_of ct);
paulson@1591
   125
val print_cterm = writeln o string_of_cterm;
paulson@1591
   126
paulson@1591
   127
wenzelm@4250
   128
wenzelm@4250
   129
(** print theory **)
paulson@1591
   130
wenzelm@16437
   131
val print_syntax = Syntax.print_syntax o Sign.syn_of;
wenzelm@4498
   132
wenzelm@4498
   133
wenzelm@11883
   134
(* pretty_full_theory *)
wenzelm@4250
   135
wenzelm@20629
   136
fun pretty_full_theory verbose thy =
wenzelm@4250
   137
  let
wenzelm@24920
   138
    val ctxt = ProofContext.init thy;
wenzelm@24920
   139
wenzelm@24920
   140
    fun prt_cls c = Syntax.pretty_sort ctxt [c];
wenzelm@24920
   141
    fun prt_sort S = Syntax.pretty_sort ctxt S;
wenzelm@24920
   142
    fun prt_arity t (c, (_, Ss)) = Syntax.pretty_arity ctxt (t, Ss, [c]);
wenzelm@24920
   143
    fun prt_typ ty = Pretty.quote (Syntax.pretty_typ ctxt ty);
wenzelm@19806
   144
    val prt_typ_no_tvars = prt_typ o Logic.unvarifyT;
wenzelm@24920
   145
    fun prt_term t = Pretty.quote (Syntax.pretty_term ctxt t);
wenzelm@18936
   146
    val prt_term_no_vars = prt_term o Logic.unvarify;
wenzelm@19698
   147
    fun prt_const (c, ty) = [Pretty.str c, Pretty.str " ::", Pretty.brk 1, prt_typ_no_tvars ty];
wenzelm@26939
   148
    val prt_const' = Defs.pretty_const (Syntax.pp ctxt);
wenzelm@4250
   149
wenzelm@14794
   150
    fun pretty_classrel (c, []) = prt_cls c
wenzelm@14794
   151
      | pretty_classrel (c, cs) = Pretty.block
wenzelm@14794
   152
          (prt_cls c :: Pretty.str " <" :: Pretty.brk 1 ::
wenzelm@14794
   153
            Pretty.commas (map prt_cls cs));
wenzelm@4250
   154
wenzelm@4250
   155
    fun pretty_default S = Pretty.block
wenzelm@14794
   156
      [Pretty.str "default sort:", Pretty.brk 1, prt_sort S];
wenzelm@4250
   157
wenzelm@14996
   158
    val tfrees = map (fn v => TFree (v, []));
haftmann@27302
   159
    fun pretty_type syn (t, ((Type.LogicalType n, _), _)) =
skalberg@15531
   160
          if syn then NONE
wenzelm@24848
   161
          else SOME (prt_typ (Type (t, tfrees (Name.invents Name.context Name.aT n))))
haftmann@27302
   162
      | pretty_type syn (t, ((Type.Abbreviation (vs, U, syn'), _), _)) =
skalberg@15531
   163
          if syn <> syn' then NONE
skalberg@15531
   164
          else SOME (Pretty.block
wenzelm@14996
   165
            [prt_typ (Type (t, tfrees vs)), Pretty.str " =", Pretty.brk 1, prt_typ U])
haftmann@27302
   166
      | pretty_type syn (t, ((Type.Nonterminal, _), _)) =
skalberg@15531
   167
          if not syn then NONE
skalberg@15531
   168
          else SOME (prt_typ (Type (t, [])));
wenzelm@4250
   169
wenzelm@19482
   170
    val pretty_arities = maps (fn (t, ars) => map (prt_arity t) ars);
skalberg@14223
   171
wenzelm@19698
   172
    fun pretty_abbrev (c, (ty, t)) = Pretty.block
wenzelm@19698
   173
      (prt_const (c, ty) @ [Pretty.str " ==", Pretty.brk 1, prt_term_no_vars t]);
wenzelm@19698
   174
wenzelm@19698
   175
    fun pretty_axm (a, t) = Pretty.block [Pretty.str (a ^ ":"), Pretty.brk 1, prt_term_no_vars t];
wenzelm@19365
   176
wenzelm@19702
   177
    fun pretty_finals reds = Pretty.block
wenzelm@19703
   178
      (Pretty.str "final:" :: Pretty.brk 1 :: Pretty.commas (map (prt_const' o fst) reds));
wenzelm@19702
   179
wenzelm@19698
   180
    fun pretty_reduct (lhs, rhs) = Pretty.block
wenzelm@19702
   181
      ([prt_const' lhs, Pretty.str "  ->", Pretty.brk 2] @
wenzelm@19702
   182
        Pretty.commas (map prt_const' (sort_wrt #1 rhs)));
wenzelm@4250
   183
wenzelm@19698
   184
    fun pretty_restrict (const, name) =
wenzelm@19698
   185
      Pretty.block ([prt_const' const, Pretty.brk 2, Pretty.str ("(from " ^ quote name ^ ")")]);
wenzelm@8720
   186
wenzelm@24665
   187
    val axioms = (Theory.axiom_space thy, Theory.axiom_table thy);
wenzelm@24665
   188
    val defs = Theory.defs_of thy;
wenzelm@19698
   189
    val {restricts, reducts} = Defs.dest defs;
wenzelm@18061
   190
    val {naming, syn = _, tsig, consts} = Sign.rep_sg thy;
wenzelm@18936
   191
    val {constants, constraints} = Consts.dest consts;
wenzelm@19698
   192
    val extern_const = NameSpace.extern (#1 constants);
wenzelm@26637
   193
    val {classes, default, types, ...} = Type.rep_tsig tsig;
wenzelm@19698
   194
    val (class_space, class_algebra) = classes;
wenzelm@19642
   195
    val {classes, arities} = Sorts.rep_algebra class_algebra;
wenzelm@14996
   196
wenzelm@24774
   197
    val clsses = NameSpace.dest_table (class_space, Symtab.make (Graph.dest classes));
wenzelm@24774
   198
    val tdecls = NameSpace.dest_table types;
wenzelm@24774
   199
    val arties = NameSpace.dest_table (Sign.type_space thy, arities);
wenzelm@20629
   200
wenzelm@24774
   201
    fun prune_const c = not verbose andalso
wenzelm@24774
   202
      member (op =) (Consts.the_tags consts c) Markup.property_internal;
wenzelm@24774
   203
    val cnsts = NameSpace.extern_table (#1 constants,
wenzelm@24774
   204
      Symtab.make (filter_out (prune_const o fst) (Symtab.dest (#2 constants))));
wenzelm@24774
   205
wenzelm@19482
   206
    val log_cnsts = map_filter (fn (c, (ty, NONE)) => SOME (c, ty) | _ => NONE) cnsts;
wenzelm@25405
   207
    val abbrevs = map_filter (fn (c, (ty, SOME t)) => SOME (c, (ty, t)) | _ => NONE) cnsts;
wenzelm@24774
   208
    val cnstrs = NameSpace.extern_table constraints;
wenzelm@19698
   209
wenzelm@24774
   210
    val axms = NameSpace.extern_table axioms;
wenzelm@24774
   211
wenzelm@24774
   212
    val (reds0, (reds1, reds2)) = filter_out (prune_const o fst o fst) reducts
wenzelm@24774
   213
      |> map (fn (lhs, rhs) =>
wenzelm@24774
   214
        (apfst extern_const lhs, map (apfst extern_const) (filter_out (prune_const o fst) rhs)))
wenzelm@19702
   215
      |> sort_wrt (#1 o #1)
wenzelm@19702
   216
      |> List.partition (null o #2)
wenzelm@19702
   217
      ||> List.partition (Defs.plain_args o #2 o #1);
wenzelm@19698
   218
    val rests = restricts |> map (apfst (apfst extern_const)) |> sort_wrt (#1 o #1);
wenzelm@4250
   219
  in
wenzelm@29091
   220
    [Pretty.strs ("names:" :: Context.display_names thy)] @
wenzelm@20629
   221
    [Pretty.strs ["name prefix:", NameSpace.path_of naming],
wenzelm@16364
   222
      Pretty.big_list "classes:" (map pretty_classrel clsses),
wenzelm@8720
   223
      pretty_default default,
wenzelm@19482
   224
      Pretty.big_list "syntactic types:" (map_filter (pretty_type true) tdecls),
wenzelm@19482
   225
      Pretty.big_list "logical types:" (map_filter (pretty_type false) tdecls),
wenzelm@16534
   226
      Pretty.big_list "type arities:" (pretty_arities arties),
wenzelm@19698
   227
      Pretty.big_list "logical consts:" (map (Pretty.block o prt_const) log_cnsts),
wenzelm@19365
   228
      Pretty.big_list "abbreviations:" (map pretty_abbrev abbrevs),
wenzelm@19698
   229
      Pretty.big_list "constraints:" (map (Pretty.block o prt_const) cnstrs),
wenzelm@19698
   230
      Pretty.big_list "axioms:" (map pretty_axm axms),
wenzelm@28290
   231
      Pretty.strs ("oracles:" :: Thm.extern_oracles thy),
wenzelm@19698
   232
      Pretty.big_list "definitions:"
wenzelm@19702
   233
        [pretty_finals reds0,
wenzelm@19702
   234
         Pretty.big_list "non-overloaded:" (map pretty_reduct reds1),
wenzelm@19702
   235
         Pretty.big_list "overloaded:" (map pretty_reduct reds2),
wenzelm@19702
   236
         Pretty.big_list "pattern restrictions:" (map pretty_restrict rests)]]
wenzelm@4250
   237
  end;
wenzelm@4250
   238
wenzelm@4250
   239
wenzelm@11883
   240
wenzelm@11883
   241
(** print_goals **)
wenzelm@11883
   242
wenzelm@11883
   243
(* print_goals etc. *)
wenzelm@11883
   244
wenzelm@16534
   245
val show_consts = ref false;  (*true: show consts with types in proof state output*)
wenzelm@3851
   246
paulson@1591
   247
wenzelm@11883
   248
(*print thm A1,...,An/B in "goal style" -- premises as numbered subgoals*)
wenzelm@11883
   249
wenzelm@11883
   250
local
wenzelm@11883
   251
wenzelm@18980
   252
fun ins_entry (x, y) =
wenzelm@18980
   253
  AList.default (op =) (x, []) #>
wenzelm@18980
   254
  AList.map_entry (op =) x (insert (op =) y);
wenzelm@12081
   255
wenzelm@18980
   256
val add_consts = Term.fold_aterms
wenzelm@18980
   257
  (fn Const (c, T) => ins_entry (T, (c, T))
wenzelm@18980
   258
    | _ => I);
wenzelm@11883
   259
wenzelm@18980
   260
val add_vars = Term.fold_aterms
wenzelm@18980
   261
  (fn Free (x, T) => ins_entry (T, (x, ~1))
wenzelm@18980
   262
    | Var (xi, T) => ins_entry (T, xi)
wenzelm@18980
   263
    | _ => I);
wenzelm@11883
   264
wenzelm@18980
   265
val add_varsT = Term.fold_atyps
wenzelm@18980
   266
  (fn TFree (x, S) => ins_entry (S, (x, ~1))
wenzelm@18980
   267
    | TVar (xi, S) => ins_entry (S, xi)
wenzelm@18980
   268
    | _ => I);
wenzelm@11883
   269
wenzelm@16490
   270
fun sort_idxs vs = map (apsnd (sort (prod_ord string_ord int_ord))) vs;
wenzelm@12081
   271
fun sort_cnsts cs = map (apsnd (sort_wrt fst)) cs;
wenzelm@12081
   272
wenzelm@18980
   273
fun consts_of t = sort_cnsts (add_consts t []);
wenzelm@18980
   274
fun vars_of t = sort_idxs (add_vars t []);
wenzelm@18980
   275
fun varsT_of t = rev (sort_idxs (Term.fold_types add_varsT t []));
wenzelm@12081
   276
wenzelm@12081
   277
in
wenzelm@11883
   278
wenzelm@23634
   279
fun pretty_goals_aux pp markup (msg, main) maxgoals state =
wenzelm@12081
   280
  let
wenzelm@12081
   281
    fun prt_atoms prt prtT (X, xs) = Pretty.block
wenzelm@12081
   282
      [Pretty.block (Pretty.commas (map prt xs)), Pretty.str " ::",
wenzelm@12081
   283
        Pretty.brk 1, prtT X];
wenzelm@11883
   284
wenzelm@14876
   285
    fun prt_var (x, ~1) = Pretty.term pp (Syntax.free x)
wenzelm@14876
   286
      | prt_var xi = Pretty.term pp (Syntax.var xi);
wenzelm@12081
   287
wenzelm@14876
   288
    fun prt_varT (x, ~1) = Pretty.typ pp (TFree (x, []))
wenzelm@14876
   289
      | prt_varT xi = Pretty.typ pp (TVar (xi, []));
wenzelm@12081
   290
wenzelm@14876
   291
    val prt_consts = prt_atoms (Pretty.term pp o Const) (Pretty.typ pp);
wenzelm@14876
   292
    val prt_vars = prt_atoms prt_var (Pretty.typ pp);
wenzelm@14876
   293
    val prt_varsT = prt_atoms prt_varT (Pretty.sort pp);
wenzelm@11883
   294
wenzelm@11883
   295
wenzelm@12081
   296
    fun pretty_list _ _ [] = []
wenzelm@12081
   297
      | pretty_list name prt lst = [Pretty.big_list name (map prt lst)];
wenzelm@11883
   298
wenzelm@23634
   299
    fun pretty_subgoal (n, A) = Pretty.markup markup
wenzelm@23634
   300
      [Pretty.str (" " ^ string_of_int n ^ ". "), Pretty.term pp A];
wenzelm@12081
   301
    fun pretty_subgoals As = map pretty_subgoal (1 upto length As ~~ As);
wenzelm@11883
   302
wenzelm@14876
   303
    val pretty_ffpairs = pretty_list "flex-flex pairs:" (pretty_flexpair pp);
wenzelm@11883
   304
wenzelm@12081
   305
    val pretty_consts = pretty_list "constants:" prt_consts o consts_of;
wenzelm@12081
   306
    val pretty_vars = pretty_list "variables:" prt_vars o vars_of;
wenzelm@12081
   307
    val pretty_varsT = pretty_list "type variables:" prt_varsT o varsT_of;
wenzelm@11883
   308
wenzelm@11883
   309
wenzelm@16290
   310
    val {prop, tpairs, ...} = Thm.rep_thm state;
berghofe@13658
   311
    val (As, B) = Logic.strip_horn prop;
wenzelm@12081
   312
    val ngoals = length As;
wenzelm@11883
   313
wenzelm@12081
   314
    fun pretty_gs (types, sorts) =
wenzelm@14876
   315
      (if main then [Pretty.term pp B] else []) @
wenzelm@12081
   316
       (if ngoals = 0 then [Pretty.str "No subgoals!"]
wenzelm@12081
   317
        else if ngoals > maxgoals then
skalberg@15570
   318
          pretty_subgoals (Library.take (maxgoals, As)) @
wenzelm@12081
   319
          (if msg then [Pretty.str ("A total of " ^ string_of_int ngoals ^ " subgoals...")]
wenzelm@12081
   320
           else [])
wenzelm@12081
   321
        else pretty_subgoals As) @
wenzelm@12081
   322
      pretty_ffpairs tpairs @
wenzelm@12081
   323
      (if ! show_consts then pretty_consts prop else []) @
wenzelm@12081
   324
      (if types then pretty_vars prop else []) @
wenzelm@12081
   325
      (if sorts then pretty_varsT prop else []);
wenzelm@12081
   326
  in
wenzelm@12081
   327
    setmp show_no_free_types true
skalberg@14178
   328
      (setmp show_types (! show_types orelse ! show_sorts orelse ! show_all_types)
wenzelm@12081
   329
        (setmp show_sorts false pretty_gs))
skalberg@14178
   330
   (! show_types orelse ! show_sorts orelse ! show_all_types, ! show_sorts)
wenzelm@11883
   331
  end;
wenzelm@11883
   332
wenzelm@23634
   333
fun pretty_goals n th =
wenzelm@26939
   334
  pretty_goals_aux (Syntax.pp_global (Thm.theory_of_thm th)) Markup.none (true, true) n th;
wenzelm@12081
   335
wenzelm@23634
   336
val print_goals = (Pretty.writeln o Pretty.chunks) oo pretty_goals;
wenzelm@12081
   337
paulson@1591
   338
end;
paulson@1591
   339
wenzelm@11883
   340
wenzelm@11883
   341
end;
wenzelm@11883
   342
wenzelm@11883
   343
structure BasicDisplay: BASIC_DISPLAY = Display;
wenzelm@11883
   344
open BasicDisplay;