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