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