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