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