src/Pure/display.ML
author wenzelm
Fri Nov 21 15:27:43 1997 +0100 (1997-11-21)
changeset 4270 957c887b89b5
parent 4256 e768c42069bb
child 4440 9ed4098074bc
permissions -rw-r--r--
changed Sequence interface (now Seq, in seq.ML);
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
paulson@1591
     9
signature DISPLAY =
paulson@1591
    10
  sig
paulson@1591
    11
  val pprint_cterm	: cterm -> pprint_args -> unit
paulson@1591
    12
  val pprint_ctyp	: ctyp -> pprint_args -> unit
paulson@1591
    13
  val pprint_theory	: theory -> pprint_args -> unit
paulson@1591
    14
  val pprint_thm	: thm -> pprint_args -> unit
wenzelm@4126
    15
  val pretty_ctyp	: ctyp -> Pretty.T
wenzelm@3547
    16
  val pretty_cterm	: cterm -> Pretty.T
paulson@1591
    17
  val pretty_thm	: thm -> Pretty.T
paulson@1591
    18
  val print_cterm	: cterm -> unit
paulson@1591
    19
  val print_ctyp	: ctyp -> unit
wenzelm@3851
    20
  val show_consts	: bool ref
paulson@1591
    21
  val print_goals	: int -> thm -> unit
paulson@1591
    22
  val print_syntax	: theory -> unit
paulson@1591
    23
  val print_theory	: theory -> unit
wenzelm@3873
    24
  val print_data	: theory -> string -> unit
paulson@1591
    25
  val print_thm		: thm -> unit
paulson@1591
    26
  val prth		: thm -> thm
wenzelm@4270
    27
  val prthq		: thm Seq.seq -> thm Seq.seq
paulson@1591
    28
  val prths		: thm list -> thm list
paulson@1591
    29
  val show_hyps		: bool ref
paulson@1591
    30
  val string_of_cterm	: cterm -> string
paulson@1591
    31
  val string_of_ctyp	: ctyp -> string
paulson@1591
    32
  val string_of_thm	: thm -> string
paulson@1591
    33
  end;
paulson@1591
    34
paulson@1591
    35
paulson@1591
    36
structure Display : DISPLAY =
paulson@1591
    37
struct
paulson@1591
    38
paulson@1591
    39
(*If false, hypotheses are printed as dots*)
paulson@1591
    40
val show_hyps = ref true;
paulson@1591
    41
paulson@1591
    42
fun pretty_thm th =
paulson@1591
    43
  let
paulson@1591
    44
    val {sign, hyps, prop, ...} = rep_thm th;
paulson@1591
    45
    val xshyps = extra_shyps th;
paulson@1591
    46
    val hlen = length xshyps + length hyps;
paulson@1591
    47
    val hsymbs =
paulson@1591
    48
      if hlen = 0 then []
paulson@1591
    49
      else if ! show_hyps then
paulson@1591
    50
        [Pretty.brk 2, Pretty.list "[" "]"
wenzelm@3785
    51
          (map (Sign.pretty_term sign) hyps @
wenzelm@3785
    52
           map (Sign.pretty_sort sign) xshyps)]
paulson@1591
    53
      else
paulson@1591
    54
        [Pretty.brk 2, Pretty.str ("[" ^ implode (replicate hlen ".") ^ "]")];
paulson@1591
    55
  in
paulson@1591
    56
    Pretty.block (Sign.pretty_term sign prop :: hsymbs)
paulson@1591
    57
  end;
paulson@1591
    58
paulson@1591
    59
val string_of_thm = Pretty.string_of o pretty_thm;
paulson@1591
    60
val pprint_thm = Pretty.pprint o Pretty.quote o pretty_thm;
paulson@1591
    61
paulson@1591
    62
paulson@1591
    63
(** Top-level commands for printing theorems **)
paulson@1591
    64
val print_thm = writeln o string_of_thm;
paulson@1591
    65
paulson@1591
    66
fun prth th = (print_thm th; th);
paulson@1591
    67
paulson@1591
    68
(*Print and return a sequence of theorems, separated by blank lines. *)
paulson@1591
    69
fun prthq thseq =
wenzelm@4270
    70
  (Seq.print (fn _ => print_thm) 100000 thseq; thseq);
paulson@1591
    71
paulson@1591
    72
(*Print and return a list of theorems, separated by blank lines. *)
wenzelm@4210
    73
fun prths ths = (seq (fn th => (print_thm th; writeln "")) ths; ths);
paulson@1591
    74
paulson@1591
    75
paulson@1591
    76
(* other printing commands *)
paulson@1591
    77
wenzelm@4126
    78
fun pretty_ctyp cT =
wenzelm@4126
    79
  let val {sign, T} = rep_ctyp cT in Sign.pretty_typ sign T end;
wenzelm@4126
    80
paulson@1591
    81
fun pprint_ctyp cT =
paulson@1591
    82
  let val {sign, T} = rep_ctyp cT in Sign.pprint_typ sign T end;
paulson@1591
    83
paulson@1591
    84
fun string_of_ctyp cT =
paulson@1591
    85
  let val {sign, T} = rep_ctyp cT in Sign.string_of_typ sign T end;
paulson@1591
    86
paulson@1591
    87
val print_ctyp = writeln o string_of_ctyp;
paulson@1591
    88
wenzelm@3547
    89
fun pretty_cterm ct =
wenzelm@3547
    90
  let val {sign, t, ...} = rep_cterm ct in Sign.pretty_term sign t end;
wenzelm@3547
    91
paulson@1591
    92
fun pprint_cterm ct =
paulson@1591
    93
  let val {sign, t, ...} = rep_cterm ct in Sign.pprint_term sign t end;
paulson@1591
    94
paulson@1591
    95
fun string_of_cterm ct =
paulson@1591
    96
  let val {sign, t, ...} = rep_cterm ct in Sign.string_of_term sign t end;
paulson@1591
    97
paulson@1591
    98
val print_cterm = writeln o string_of_cterm;
paulson@1591
    99
paulson@1591
   100
wenzelm@4250
   101
wenzelm@4250
   102
(** print theory **)
paulson@1591
   103
paulson@1591
   104
val pprint_theory = Sign.pprint_sg o sign_of;
paulson@1591
   105
paulson@1591
   106
val print_syntax = Syntax.print_syntax o syn_of;
wenzelm@3873
   107
val print_data = Sign.print_data o sign_of;
paulson@1591
   108
wenzelm@4250
   109
wenzelm@4250
   110
(* print signature *)
wenzelm@4250
   111
wenzelm@4250
   112
fun print_sign sg =
wenzelm@4250
   113
  let
wenzelm@4250
   114
    fun prt_cls c = Sign.pretty_sort sg [c];
wenzelm@4250
   115
    fun prt_sort S = Sign.pretty_sort sg S;
wenzelm@4250
   116
    fun prt_arity t (c, Ss) = Sign.pretty_arity sg (t, Ss, [c]);
wenzelm@4250
   117
    fun prt_typ ty = Pretty.quote (Sign.pretty_typ sg ty);
wenzelm@4250
   118
wenzelm@4250
   119
    val ext_class = Sign.cond_extern sg Sign.classK;
wenzelm@4250
   120
    val ext_tycon = Sign.cond_extern sg Sign.typeK;
wenzelm@4250
   121
    val ext_const = Sign.cond_extern sg Sign.constK;
wenzelm@4250
   122
wenzelm@4250
   123
wenzelm@4250
   124
    fun pretty_space (kind, space) = Pretty.block (Pretty.breaks
wenzelm@4250
   125
      (map Pretty.str (kind ^ ":" :: map quote (NameSpace.dest space))));
wenzelm@4250
   126
wenzelm@4250
   127
    fun pretty_classes cs = Pretty.block
wenzelm@4250
   128
      (Pretty.breaks (Pretty.str "classes:" :: map prt_cls cs));
wenzelm@4250
   129
wenzelm@4250
   130
    fun pretty_classrel (c, cs) = Pretty.block
wenzelm@4250
   131
      (prt_cls c :: Pretty.str " <" :: Pretty.brk 1 ::
wenzelm@4250
   132
        Pretty.commas (map prt_cls cs));
wenzelm@4250
   133
wenzelm@4250
   134
    fun pretty_default S = Pretty.block
wenzelm@4250
   135
      [Pretty.str "default:", Pretty.brk 1, prt_sort S];
wenzelm@4250
   136
wenzelm@4250
   137
    fun pretty_ty (t, n) = Pretty.block
wenzelm@4250
   138
      [Pretty.str (ext_tycon t), Pretty.str (" " ^ string_of_int n)];
wenzelm@4250
   139
wenzelm@4250
   140
    fun pretty_abbr (t, (vs, rhs)) = Pretty.block
wenzelm@4250
   141
      [prt_typ (Type (t, map (fn v => TVar ((v, 0), [])) vs)),
wenzelm@4250
   142
        Pretty.str " =", Pretty.brk 1, prt_typ rhs];
wenzelm@4250
   143
wenzelm@4250
   144
    fun pretty_arities (t, ars) = map (prt_arity t) ars;
wenzelm@4250
   145
wenzelm@4250
   146
    fun pretty_const (c, ty) = Pretty.block
wenzelm@4250
   147
      [Pretty.str c, Pretty.str " ::", Pretty.brk 1, prt_typ ty];
wenzelm@4250
   148
wenzelm@4250
   149
    val {self = _, tsig, const_tab, syn = _, path, spaces, data} = Sign.rep_sg sg;
wenzelm@4250
   150
    val spaces' = sort (fn ((k1, _), (k2, _)) => k1 < k2) spaces;
wenzelm@4250
   151
    val {classes, classrel, default, tycons, abbrs, arities} =
wenzelm@4250
   152
      Type.rep_tsig tsig;
wenzelm@4250
   153
    val consts = sort_wrt fst (map (apfst ext_const) (Symtab.dest const_tab));
wenzelm@4250
   154
  in
wenzelm@4250
   155
    Pretty.writeln (Pretty.strs ("stamps:" :: Sign.stamp_names_of sg));
wenzelm@4256
   156
    Pretty.writeln (Pretty.strs ("data:" :: Sign.data_kinds data));
wenzelm@4250
   157
    Pretty.writeln (Pretty.strs ["name entry path:", NameSpace.pack path]);
wenzelm@4250
   158
    Pretty.writeln (Pretty.big_list "name spaces:" (map pretty_space spaces'));
wenzelm@4250
   159
    Pretty.writeln (pretty_classes classes);
wenzelm@4250
   160
    Pretty.writeln (Pretty.big_list "class relation:" (map pretty_classrel classrel));
wenzelm@4250
   161
    Pretty.writeln (pretty_default default);
wenzelm@4250
   162
    Pretty.writeln (Pretty.big_list "type constructors:" (map pretty_ty tycons));
wenzelm@4250
   163
    Pretty.writeln (Pretty.big_list "type abbreviations:" (map pretty_abbr abbrs));
wenzelm@4250
   164
    Pretty.writeln (Pretty.big_list "type arities:" (flat (map pretty_arities arities)));
wenzelm@4250
   165
    Pretty.writeln (Pretty.big_list "consts:" (map pretty_const consts))
wenzelm@4250
   166
  end;
wenzelm@4250
   167
wenzelm@4250
   168
wenzelm@4250
   169
(* print axioms, oracles, theorems *)
wenzelm@4250
   170
wenzelm@3811
   171
fun print_thy thy =
paulson@1591
   172
  let
wenzelm@3990
   173
    val {sign, axioms, oracles, ...} = rep_theory thy;
wenzelm@3990
   174
    val axioms = Symtab.dest axioms;
wenzelm@3811
   175
    val oras = map fst (Symtab.dest oracles);
paulson@1591
   176
wenzelm@3936
   177
    fun prt_axm (a, t) = Pretty.block
wenzelm@3990
   178
      [Pretty.str (Sign.cond_extern sign Theory.axiomK a ^ ":"), Pretty.brk 1,
wenzelm@3936
   179
        Pretty.quote (Sign.pretty_term sign t)];
paulson@1591
   180
  in
wenzelm@3990
   181
    Pretty.writeln (Pretty.big_list "axioms:" (map prt_axm axioms));
wenzelm@3990
   182
    Pretty.writeln (Pretty.strs ("oracles:" :: oras));
wenzelm@3990
   183
    print_data thy "theorems"
paulson@1591
   184
  end;
paulson@1591
   185
wenzelm@4250
   186
fun print_theory thy = (print_sign (sign_of thy); print_thy thy);
paulson@1591
   187
paulson@1591
   188
paulson@1591
   189
wenzelm@4250
   190
(** print_goals **)
paulson@1591
   191
wenzelm@4250
   192
(*print thm A1,...,An/B in "goal style" -- premises as numbered subgoals*)
wenzelm@4250
   193
wenzelm@4250
   194
(*also show consts in case of showing types?*)
wenzelm@3851
   195
val show_consts = ref false;
wenzelm@3851
   196
paulson@1591
   197
paulson@1591
   198
local
wenzelm@3851
   199
wenzelm@3851
   200
  (* utils *)
paulson@1591
   201
paulson@1591
   202
  fun ins_entry (x, y) [] = [(x, [y])]
paulson@1591
   203
    | ins_entry (x, y) ((pair as (x', ys')) :: pairs) =
wenzelm@3851
   204
        if x = x' then (x', y ins ys') :: pairs
paulson@1591
   205
        else pair :: ins_entry (x, y) pairs;
paulson@1591
   206
wenzelm@3990
   207
  fun add_consts (Const (c, T), env) = ins_entry (T, (c, T)) env
wenzelm@3851
   208
    | add_consts (t $ u, env) = add_consts (u, add_consts (t, env))
wenzelm@3851
   209
    | add_consts (Abs (_, _, t), env) = add_consts (t, env)
wenzelm@3851
   210
    | add_consts (_, env) = env;
paulson@1591
   211
wenzelm@3851
   212
  fun add_vars (Free (x, T), env) = ins_entry (T, (x, ~1)) env
wenzelm@3851
   213
    | add_vars (Var (xi, T), env) = ins_entry (T, xi) env
wenzelm@3851
   214
    | add_vars (Abs (_, _, t), env) = add_vars (t, env)
wenzelm@3851
   215
    | add_vars (t $ u, env) = add_vars (u, add_vars (t, env))
wenzelm@3851
   216
    | add_vars (_, env) = env;
paulson@1591
   217
wenzelm@3851
   218
  fun add_varsT (Type (_, Ts), env) = foldr add_varsT (Ts, env)
wenzelm@3851
   219
    | add_varsT (TFree (x, S), env) = ins_entry (S, (x, ~1)) env
wenzelm@3851
   220
    | add_varsT (TVar (xi, S), env) = ins_entry (S, xi) env;
paulson@1591
   221
wenzelm@3851
   222
  fun less_idx ((x, i):indexname, (y, j):indexname) =
wenzelm@3851
   223
    x < y orelse x = y andalso i < j;
paulson@3879
   224
  fun sort_idxs l = map (apsnd (sort less_idx)) l;
wenzelm@3990
   225
  fun sort_cnsts l = map (apsnd (sort_wrt fst)) l;
paulson@1591
   226
paulson@1591
   227
wenzelm@3851
   228
  (* prepare atoms *)
wenzelm@3851
   229
wenzelm@3990
   230
  fun consts_of t = sort_cnsts (add_consts (t, []));
wenzelm@3851
   231
  fun vars_of t = sort_idxs (add_vars (t, []));
wenzelm@3851
   232
  fun varsT_of t = rev (sort_idxs (it_term_types add_varsT (t, [])));
wenzelm@3851
   233
wenzelm@3851
   234
in
wenzelm@3851
   235
wenzelm@3851
   236
  fun print_goals maxgoals state =
wenzelm@3851
   237
    let
wenzelm@3851
   238
      val {sign, ...} = rep_thm state;
paulson@1591
   239
wenzelm@3851
   240
      val prt_term = Sign.pretty_term sign;
wenzelm@3851
   241
      val prt_typ = Sign.pretty_typ sign;
wenzelm@3851
   242
      val prt_sort = Sign.pretty_sort sign;
wenzelm@3851
   243
wenzelm@3851
   244
      fun prt_atoms prt prtT (X, xs) = Pretty.block
wenzelm@3851
   245
        [Pretty.block (Pretty.commas (map prt xs)), Pretty.str " ::",
wenzelm@3851
   246
          Pretty.brk 1, prtT X];
paulson@1591
   247
wenzelm@3851
   248
      fun prt_var (x, ~1) = prt_term (Syntax.free x)
wenzelm@3851
   249
        | prt_var xi = prt_term (Syntax.var xi);
wenzelm@3851
   250
wenzelm@3851
   251
      fun prt_varT (x, ~1) = prt_typ (TFree (x, []))
wenzelm@3851
   252
        | prt_varT xi = prt_typ (TVar (xi, []));
wenzelm@3851
   253
wenzelm@3990
   254
      val prt_consts = prt_atoms (prt_term o Const) prt_typ;
wenzelm@3851
   255
      val prt_vars = prt_atoms prt_var prt_typ;
wenzelm@3851
   256
      val prt_varsT = prt_atoms prt_varT prt_sort;
paulson@1591
   257
paulson@1591
   258
wenzelm@3851
   259
      fun print_list _ _ [] = ()
wenzelm@3851
   260
        | print_list name prt lst = (writeln "";
wenzelm@3851
   261
            Pretty.writeln (Pretty.big_list name (map prt lst)));
wenzelm@3851
   262
wenzelm@3851
   263
      fun print_subgoals (_, []) = ()
wenzelm@3851
   264
        | print_subgoals (n, A :: As) = (Pretty.writeln (Pretty.blk (0,
wenzelm@3851
   265
            [Pretty.str (" " ^ string_of_int n ^ ". "), prt_term A]));
wenzelm@3851
   266
              print_subgoals (n + 1, As));
paulson@1591
   267
wenzelm@3851
   268
      val print_ffpairs =
wenzelm@3851
   269
        print_list "Flex-flex pairs:" (prt_term o Logic.mk_flexpair);
wenzelm@3851
   270
wenzelm@3851
   271
      val print_consts = print_list "Constants:" prt_consts o consts_of;
wenzelm@3851
   272
      val print_vars = print_list "Variables:" prt_vars o vars_of;
wenzelm@3851
   273
      val print_varsT = print_list "Type variables:" prt_varsT o varsT_of;
wenzelm@3851
   274
wenzelm@3851
   275
wenzelm@3851
   276
      val {prop, ...} = rep_thm state;
wenzelm@3851
   277
      val (tpairs, As, B) = Logic.strip_horn prop;
wenzelm@3851
   278
      val ngoals = length As;
paulson@1591
   279
wenzelm@3851
   280
      fun print_gs (types, sorts) =
wenzelm@3851
   281
       (Pretty.writeln (prt_term B);
wenzelm@3851
   282
        if ngoals = 0 then writeln "No subgoals!"
wenzelm@3851
   283
        else if ngoals > maxgoals then
wenzelm@3851
   284
          (print_subgoals (1, take (maxgoals, As));
wenzelm@3851
   285
            writeln ("A total of " ^ string_of_int ngoals ^ " subgoals..."))
wenzelm@3851
   286
        else print_subgoals (1, As);
wenzelm@3851
   287
wenzelm@3851
   288
        print_ffpairs tpairs;
paulson@1591
   289
wenzelm@3851
   290
        if types andalso ! show_consts then print_consts prop else ();
wenzelm@3851
   291
        if types then print_vars prop else ();
wenzelm@3851
   292
        if sorts then print_varsT prop else ());
wenzelm@3851
   293
    in
wenzelm@3851
   294
      setmp show_no_free_types true
wenzelm@3851
   295
        (setmp show_types (! show_types orelse ! show_sorts)
wenzelm@3851
   296
          (setmp show_sorts false print_gs))
wenzelm@3851
   297
     (! show_types orelse ! show_sorts, ! show_sorts)
wenzelm@3851
   298
  end;
paulson@1591
   299
wenzelm@3851
   300
end;
paulson@1591
   301
paulson@1591
   302
paulson@1591
   303
end;
paulson@1591
   304
paulson@1591
   305
open Display;