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