src/Pure/display.ML
author wenzelm
Tue Jul 21 00:56:19 2009 +0200 (2009-07-21)
changeset 32090 39acf19e9f3a
parent 32089 568a23753e3a
child 32145 220c9e439d39
permissions -rw-r--r--
moved ProofContext.pretty_thm to Display.pretty_thm etc.;
explicit old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
removed some very old thm print operations;
paulson@1591
     1
(*  Title:      Pure/display.ML
paulson@1591
     2
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
wenzelm@32089
     3
    Author:     Makarius
paulson@1591
     4
wenzelm@32089
     5
Printing of theorems, 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@32089
    11
  val show_consts: bool ref
wenzelm@11883
    12
  val show_hyps: bool ref
wenzelm@11883
    13
  val show_tags: 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@32090
    19
  val pretty_thm_raw: Pretty.pp -> {quote: bool, show_hyps: bool, show_status: bool} ->
wenzelm@30723
    20
    term list -> thm -> Pretty.T
wenzelm@32090
    21
  val pretty_thm_aux: Proof.context -> bool -> thm -> Pretty.T
wenzelm@32090
    22
  val pretty_thm: Proof.context -> thm -> Pretty.T
wenzelm@32090
    23
  val pretty_thm_global: theory -> thm -> Pretty.T
wenzelm@32090
    24
  val pretty_thm_without_context: thm -> Pretty.T
wenzelm@32090
    25
  val string_of_thm: Proof.context -> thm -> string
wenzelm@32090
    26
  val string_of_thm_global: theory -> thm -> string
wenzelm@32090
    27
  val string_of_thm_without_context: thm -> string
wenzelm@32090
    28
  val pretty_thms_aux: Proof.context -> bool -> thm list -> Pretty.T
wenzelm@32090
    29
  val pretty_thms: Proof.context -> thm list -> Pretty.T
wenzelm@11883
    30
  val pretty_ctyp: ctyp -> Pretty.T
wenzelm@26928
    31
  val string_of_ctyp: ctyp -> string
wenzelm@26928
    32
  val print_ctyp: ctyp -> unit
wenzelm@11883
    33
  val pretty_cterm: cterm -> Pretty.T
wenzelm@26928
    34
  val string_of_cterm: cterm -> string
wenzelm@26928
    35
  val print_cterm: cterm -> unit
wenzelm@26928
    36
  val print_syntax: theory -> unit
wenzelm@20629
    37
  val pretty_full_theory: bool -> theory -> Pretty.T list
wenzelm@4950
    38
end;
paulson@1591
    39
wenzelm@4950
    40
structure Display: DISPLAY =
paulson@1591
    41
struct
paulson@1591
    42
wenzelm@32089
    43
(** options **)
wenzelm@32089
    44
wenzelm@32089
    45
val goals_limit = Display_Goal.goals_limit;
wenzelm@32089
    46
val show_consts = Display_Goal.show_consts;
wenzelm@32089
    47
wenzelm@32089
    48
val show_hyps = ref false;      (*false: print meta-hypotheses as dots*)
wenzelm@32089
    49
val show_tags = ref false;      (*false: suppress tags*)
wenzelm@32089
    50
wenzelm@32089
    51
wenzelm@11883
    52
wenzelm@6087
    53
(** print thm **)
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@30723
    58
fun display_status false _ = ""
wenzelm@30723
    59
  | display_status true th =
wenzelm@30723
    60
      let
wenzelm@30723
    61
        val {oracle = oracle0, unfinished, failed} = Thm.status_of th;
wenzelm@30723
    62
        val oracle = oracle0 andalso (not (! quick_and_dirty) orelse ! show_hyps);
wenzelm@30723
    63
      in
wenzelm@30723
    64
        if failed then "!!"
wenzelm@30723
    65
        else if oracle andalso unfinished then "!?"
wenzelm@30723
    66
        else if oracle then "!"
wenzelm@30723
    67
        else if unfinished then "?"
wenzelm@30723
    68
        else ""
wenzelm@30723
    69
      end;
wenzelm@30711
    70
wenzelm@32090
    71
fun pretty_thm_raw pp {quote, show_hyps = show_hyps', show_status} asms raw_th =
paulson@1591
    72
  let
wenzelm@17447
    73
    val th = Thm.strip_shyps raw_th;
wenzelm@28316
    74
    val {hyps, tpairs, prop, ...} = Thm.rep_thm th;
wenzelm@6087
    75
    val xshyps = Thm.extra_shyps th;
wenzelm@21646
    76
    val tags = Thm.get_tags th;
wenzelm@6087
    77
berghofe@13658
    78
    val q = if quote then Pretty.quote else I;
wenzelm@22878
    79
    val prt_term = q o Pretty.term pp;
wenzelm@6279
    80
wenzelm@19300
    81
    val hyps' = if ! show_hyps then hyps else subtract (op aconv) asms hyps;
wenzelm@30723
    82
    val status = display_status show_status th;
wenzelm@28802
    83
wenzelm@17447
    84
    val hlen = length xshyps + length hyps' + length tpairs;
paulson@1591
    85
    val hsymbs =
wenzelm@30711
    86
      if hlen = 0 andalso status = "" then []
wenzelm@17447
    87
      else if ! show_hyps orelse show_hyps' then
paulson@1591
    88
        [Pretty.brk 2, Pretty.list "[" "]"
wenzelm@32089
    89
          (map (q o Display_Goal.pretty_flexpair pp) tpairs @ map prt_term hyps' @
wenzelm@14876
    90
           map (Pretty.sort pp) xshyps @
wenzelm@30711
    91
            (if status = "" then [] else [Pretty.str status]))]
wenzelm@30711
    92
      else [Pretty.brk 2, Pretty.str ("[" ^ implode (replicate hlen ".") ^ status ^ "]")];
wenzelm@6087
    93
    val tsymbs =
wenzelm@6087
    94
      if null tags orelse not (! show_tags) then []
wenzelm@6087
    95
      else [Pretty.brk 1, pretty_tags tags];
wenzelm@6279
    96
  in Pretty.block (prt_term prop :: (hsymbs @ tsymbs)) end;
paulson@1591
    97
wenzelm@32090
    98
fun pretty_thm_aux ctxt show_status th =
wenzelm@32090
    99
  let
wenzelm@32090
   100
    val flags = {quote = false, show_hyps = true, show_status = show_status};
wenzelm@32090
   101
    val asms = map Thm.term_of (Assumption.all_assms_of ctxt);
wenzelm@32090
   102
  in pretty_thm_raw (Syntax.pp ctxt) flags asms th end;
wenzelm@10010
   103
wenzelm@6087
   104
wenzelm@32090
   105
fun pretty_thm ctxt = pretty_thm_aux ctxt true;
wenzelm@32090
   106
wenzelm@32090
   107
fun pretty_thm_global thy th =
wenzelm@32090
   108
  pretty_thm_raw (Syntax.pp_global thy)
wenzelm@32090
   109
    {quote = false, show_hyps = false, show_status = true} [] th;
wenzelm@32090
   110
wenzelm@32090
   111
fun pretty_thm_without_context th = pretty_thm_global (Thm.theory_of_thm th) th;
wenzelm@6087
   112
wenzelm@32090
   113
val string_of_thm = Pretty.string_of oo pretty_thm;
wenzelm@32090
   114
val string_of_thm_global = Pretty.string_of oo pretty_thm_global;
wenzelm@32090
   115
val string_of_thm_without_context = Pretty.string_of o pretty_thm_without_context;
wenzelm@32090
   116
paulson@1591
   117
wenzelm@32090
   118
(* multiple theorems *)
wenzelm@32090
   119
wenzelm@32090
   120
fun pretty_thms_aux ctxt flag [th] = pretty_thm_aux ctxt flag th
wenzelm@32090
   121
  | pretty_thms_aux ctxt flag ths =
wenzelm@32090
   122
      Pretty.blk (0, Pretty.fbreaks (map (pretty_thm_aux ctxt flag) ths));
wenzelm@32090
   123
wenzelm@32090
   124
fun pretty_thms ctxt = pretty_thms_aux ctxt true;
paulson@1591
   125
paulson@1591
   126
paulson@1591
   127
(* other printing commands *)
paulson@1591
   128
wenzelm@26939
   129
fun pretty_ctyp cT = Syntax.pretty_typ_global (Thm.theory_of_ctyp cT) (Thm.typ_of cT);
wenzelm@26939
   130
fun string_of_ctyp cT = Syntax.string_of_typ_global (Thm.theory_of_ctyp cT) (Thm.typ_of cT);
paulson@1591
   131
val print_ctyp = writeln o string_of_ctyp;
paulson@1591
   132
wenzelm@26939
   133
fun pretty_cterm ct = Syntax.pretty_term_global (Thm.theory_of_cterm ct) (Thm.term_of ct);
wenzelm@26939
   134
fun string_of_cterm ct = Syntax.string_of_term_global (Thm.theory_of_cterm ct) (Thm.term_of ct);
paulson@1591
   135
val print_cterm = writeln o string_of_cterm;
paulson@1591
   136
paulson@1591
   137
wenzelm@4250
   138
wenzelm@4250
   139
(** print theory **)
paulson@1591
   140
wenzelm@16437
   141
val print_syntax = Syntax.print_syntax o Sign.syn_of;
wenzelm@4498
   142
wenzelm@4498
   143
wenzelm@11883
   144
(* pretty_full_theory *)
wenzelm@4250
   145
wenzelm@20629
   146
fun pretty_full_theory verbose thy =
wenzelm@4250
   147
  let
wenzelm@24920
   148
    val ctxt = ProofContext.init thy;
wenzelm@24920
   149
wenzelm@24920
   150
    fun prt_cls c = Syntax.pretty_sort ctxt [c];
wenzelm@24920
   151
    fun prt_sort S = Syntax.pretty_sort ctxt S;
wenzelm@24920
   152
    fun prt_arity t (c, (_, Ss)) = Syntax.pretty_arity ctxt (t, Ss, [c]);
wenzelm@24920
   153
    fun prt_typ ty = Pretty.quote (Syntax.pretty_typ ctxt ty);
wenzelm@19806
   154
    val prt_typ_no_tvars = prt_typ o Logic.unvarifyT;
wenzelm@24920
   155
    fun prt_term t = Pretty.quote (Syntax.pretty_term ctxt t);
wenzelm@18936
   156
    val prt_term_no_vars = prt_term o Logic.unvarify;
wenzelm@19698
   157
    fun prt_const (c, ty) = [Pretty.str c, Pretty.str " ::", Pretty.brk 1, prt_typ_no_tvars ty];
wenzelm@26939
   158
    val prt_const' = Defs.pretty_const (Syntax.pp ctxt);
wenzelm@4250
   159
wenzelm@14794
   160
    fun pretty_classrel (c, []) = prt_cls c
wenzelm@14794
   161
      | pretty_classrel (c, cs) = Pretty.block
wenzelm@14794
   162
          (prt_cls c :: Pretty.str " <" :: Pretty.brk 1 ::
wenzelm@14794
   163
            Pretty.commas (map prt_cls cs));
wenzelm@4250
   164
wenzelm@4250
   165
    fun pretty_default S = Pretty.block
wenzelm@14794
   166
      [Pretty.str "default sort:", Pretty.brk 1, prt_sort S];
wenzelm@4250
   167
wenzelm@14996
   168
    val tfrees = map (fn v => TFree (v, []));
haftmann@27302
   169
    fun pretty_type syn (t, ((Type.LogicalType n, _), _)) =
skalberg@15531
   170
          if syn then NONE
wenzelm@24848
   171
          else SOME (prt_typ (Type (t, tfrees (Name.invents Name.context Name.aT n))))
haftmann@27302
   172
      | pretty_type syn (t, ((Type.Abbreviation (vs, U, syn'), _), _)) =
skalberg@15531
   173
          if syn <> syn' then NONE
skalberg@15531
   174
          else SOME (Pretty.block
wenzelm@14996
   175
            [prt_typ (Type (t, tfrees vs)), Pretty.str " =", Pretty.brk 1, prt_typ U])
haftmann@27302
   176
      | pretty_type syn (t, ((Type.Nonterminal, _), _)) =
skalberg@15531
   177
          if not syn then NONE
skalberg@15531
   178
          else SOME (prt_typ (Type (t, [])));
wenzelm@4250
   179
wenzelm@19482
   180
    val pretty_arities = maps (fn (t, ars) => map (prt_arity t) ars);
skalberg@14223
   181
wenzelm@19698
   182
    fun pretty_abbrev (c, (ty, t)) = Pretty.block
wenzelm@19698
   183
      (prt_const (c, ty) @ [Pretty.str " ==", Pretty.brk 1, prt_term_no_vars t]);
wenzelm@19698
   184
wenzelm@19698
   185
    fun pretty_axm (a, t) = Pretty.block [Pretty.str (a ^ ":"), Pretty.brk 1, prt_term_no_vars t];
wenzelm@19365
   186
wenzelm@19702
   187
    fun pretty_finals reds = Pretty.block
wenzelm@19703
   188
      (Pretty.str "final:" :: Pretty.brk 1 :: Pretty.commas (map (prt_const' o fst) reds));
wenzelm@19702
   189
wenzelm@19698
   190
    fun pretty_reduct (lhs, rhs) = Pretty.block
wenzelm@19702
   191
      ([prt_const' lhs, Pretty.str "  ->", Pretty.brk 2] @
wenzelm@19702
   192
        Pretty.commas (map prt_const' (sort_wrt #1 rhs)));
wenzelm@4250
   193
wenzelm@19698
   194
    fun pretty_restrict (const, name) =
wenzelm@19698
   195
      Pretty.block ([prt_const' const, Pretty.brk 2, Pretty.str ("(from " ^ quote name ^ ")")]);
wenzelm@8720
   196
wenzelm@24665
   197
    val axioms = (Theory.axiom_space thy, Theory.axiom_table thy);
wenzelm@24665
   198
    val defs = Theory.defs_of thy;
wenzelm@19698
   199
    val {restricts, reducts} = Defs.dest defs;
wenzelm@18061
   200
    val {naming, syn = _, tsig, consts} = Sign.rep_sg thy;
wenzelm@18936
   201
    val {constants, constraints} = Consts.dest consts;
wenzelm@19698
   202
    val extern_const = NameSpace.extern (#1 constants);
wenzelm@26637
   203
    val {classes, default, types, ...} = Type.rep_tsig tsig;
wenzelm@19698
   204
    val (class_space, class_algebra) = classes;
wenzelm@19642
   205
    val {classes, arities} = Sorts.rep_algebra class_algebra;
wenzelm@14996
   206
wenzelm@24774
   207
    val clsses = NameSpace.dest_table (class_space, Symtab.make (Graph.dest classes));
wenzelm@24774
   208
    val tdecls = NameSpace.dest_table types;
wenzelm@24774
   209
    val arties = NameSpace.dest_table (Sign.type_space thy, arities);
wenzelm@20629
   210
wenzelm@24774
   211
    fun prune_const c = not verbose andalso
wenzelm@24774
   212
      member (op =) (Consts.the_tags consts c) Markup.property_internal;
wenzelm@24774
   213
    val cnsts = NameSpace.extern_table (#1 constants,
wenzelm@24774
   214
      Symtab.make (filter_out (prune_const o fst) (Symtab.dest (#2 constants))));
wenzelm@24774
   215
wenzelm@19482
   216
    val log_cnsts = map_filter (fn (c, (ty, NONE)) => SOME (c, ty) | _ => NONE) cnsts;
wenzelm@25405
   217
    val abbrevs = map_filter (fn (c, (ty, SOME t)) => SOME (c, (ty, t)) | _ => NONE) cnsts;
wenzelm@24774
   218
    val cnstrs = NameSpace.extern_table constraints;
wenzelm@19698
   219
wenzelm@24774
   220
    val axms = NameSpace.extern_table axioms;
wenzelm@24774
   221
wenzelm@24774
   222
    val (reds0, (reds1, reds2)) = filter_out (prune_const o fst o fst) reducts
wenzelm@24774
   223
      |> map (fn (lhs, rhs) =>
wenzelm@24774
   224
        (apfst extern_const lhs, map (apfst extern_const) (filter_out (prune_const o fst) rhs)))
wenzelm@19702
   225
      |> sort_wrt (#1 o #1)
wenzelm@19702
   226
      |> List.partition (null o #2)
wenzelm@19702
   227
      ||> List.partition (Defs.plain_args o #2 o #1);
wenzelm@19698
   228
    val rests = restricts |> map (apfst (apfst extern_const)) |> sort_wrt (#1 o #1);
wenzelm@4250
   229
  in
wenzelm@29091
   230
    [Pretty.strs ("names:" :: Context.display_names thy)] @
wenzelm@30409
   231
    [Pretty.big_list "classes:" (map pretty_classrel clsses),
wenzelm@8720
   232
      pretty_default default,
wenzelm@19482
   233
      Pretty.big_list "syntactic types:" (map_filter (pretty_type true) tdecls),
wenzelm@19482
   234
      Pretty.big_list "logical types:" (map_filter (pretty_type false) tdecls),
wenzelm@16534
   235
      Pretty.big_list "type arities:" (pretty_arities arties),
wenzelm@19698
   236
      Pretty.big_list "logical consts:" (map (Pretty.block o prt_const) log_cnsts),
wenzelm@19365
   237
      Pretty.big_list "abbreviations:" (map pretty_abbrev abbrevs),
wenzelm@19698
   238
      Pretty.big_list "constraints:" (map (Pretty.block o prt_const) cnstrs),
wenzelm@19698
   239
      Pretty.big_list "axioms:" (map pretty_axm axms),
wenzelm@28290
   240
      Pretty.strs ("oracles:" :: Thm.extern_oracles thy),
wenzelm@19698
   241
      Pretty.big_list "definitions:"
wenzelm@19702
   242
        [pretty_finals reds0,
wenzelm@19702
   243
         Pretty.big_list "non-overloaded:" (map pretty_reduct reds1),
wenzelm@19702
   244
         Pretty.big_list "overloaded:" (map pretty_reduct reds2),
wenzelm@19702
   245
         Pretty.big_list "pattern restrictions:" (map pretty_restrict rests)]]
wenzelm@4250
   246
  end;
wenzelm@4250
   247
paulson@1591
   248
end;
paulson@1591
   249
wenzelm@32089
   250
structure Basic_Display: BASIC_DISPLAY = Display;
wenzelm@32089
   251
open Basic_Display;