src/Pure/display.ML
author wenzelm
Thu Jul 28 15:19:54 2005 +0200 (2005-07-28)
changeset 16937 0822bbdd6769
parent 16845 bedf7b5fb781
child 17447 3a23acfdf5ba
permissions -rw-r--r--
print_theory: const constraints;
     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 BASIC_DISPLAY =
    10 sig
    11   val goals_limit: int ref
    12   val show_hyps: bool ref
    13   val show_tags: bool ref
    14   val string_of_thm: thm -> string
    15   val print_thm: thm -> unit
    16   val print_thms: thm list -> unit
    17   val prth: thm -> thm
    18   val prthq: thm Seq.seq -> thm Seq.seq
    19   val prths: thm list -> thm list
    20   val string_of_ctyp: ctyp -> string
    21   val print_ctyp: ctyp -> unit
    22   val string_of_cterm: cterm -> string
    23   val print_cterm: cterm -> unit
    24   val print_syntax: theory -> unit
    25   val show_consts: bool ref
    26 end;
    27 
    28 signature DISPLAY =
    29 sig
    30   include BASIC_DISPLAY
    31   val pretty_flexpair: Pretty.pp -> term * term -> Pretty.T
    32   val pretty_thm_aux: Pretty.pp -> bool -> thm -> Pretty.T
    33   val pretty_thm_no_quote: thm -> Pretty.T
    34   val pretty_thm: thm -> Pretty.T
    35   val pretty_thms: thm list -> Pretty.T
    36   val pretty_thm_sg: theory -> thm -> Pretty.T
    37   val pretty_thms_sg: theory -> thm list -> Pretty.T
    38   val pprint_thm: thm -> pprint_args -> unit
    39   val pretty_ctyp: ctyp -> Pretty.T
    40   val pprint_ctyp: ctyp -> pprint_args -> unit
    41   val pretty_cterm: cterm -> Pretty.T
    42   val pprint_cterm: cterm -> pprint_args -> unit
    43   val pretty_full_theory: theory -> Pretty.T list
    44   val pretty_goals_aux: Pretty.pp -> string -> bool * bool -> int -> thm -> Pretty.T list
    45   val pretty_goals: int -> thm -> Pretty.T list
    46   val print_goals: int -> thm -> unit
    47   val current_goals_markers: (string * string * string) ref
    48   val pretty_current_goals: int -> int -> thm -> Pretty.T list
    49   val print_current_goals_default: int -> int -> thm -> unit
    50   val print_current_goals_fn: (int -> int -> thm -> unit) ref
    51 end;
    52 
    53 structure Display: DISPLAY =
    54 struct
    55 
    56 
    57 (** print thm **)
    58 
    59 val goals_limit = ref 10;       (*max number of goals to print*)
    60 val show_hyps = ref false;      (*false: print meta-hypotheses as dots*)
    61 val show_tags = ref false;      (*false: suppress tags*)
    62 
    63 fun pretty_tag (name, args) = Pretty.strs (name :: map Library.quote args);
    64 val pretty_tags = Pretty.list "[" "]" o map pretty_tag;
    65 
    66 fun pretty_flexpair pp (t, u) = Pretty.block
    67   [Pretty.term pp t, Pretty.str " =?=", Pretty.brk 1, Pretty.term pp u];
    68 
    69 fun pretty_thm_aux pp quote th =
    70   let
    71     val {hyps, tpairs, prop, der = (ora, _), ...} = Thm.rep_thm th;
    72     val xshyps = Thm.extra_shyps th;
    73     val (_, tags) = Thm.get_name_tags th;
    74 
    75     val q = if quote then Pretty.quote else I;
    76     val prt_term = q o (Pretty.term pp);
    77 
    78     val hlen = length xshyps + length hyps + length tpairs;
    79     val hsymbs =
    80       if hlen = 0 andalso not ora then []
    81       else if ! show_hyps then
    82         [Pretty.brk 2, Pretty.list "[" "]"
    83           (map (q o pretty_flexpair pp) tpairs @ map prt_term hyps @
    84            map (Pretty.sort pp) xshyps @
    85             (if ora then [Pretty.str "!"] else []))]
    86       else [Pretty.brk 2, Pretty.str ("[" ^ implode (replicate hlen ".") ^
    87         (if ora then "!" else "") ^ "]")];
    88     val tsymbs =
    89       if null tags orelse not (! show_tags) then []
    90       else [Pretty.brk 1, pretty_tags tags];
    91   in Pretty.block (prt_term prop :: (hsymbs @ tsymbs)) end;
    92 
    93 fun gen_pretty_thm quote th =
    94   pretty_thm_aux (Sign.pp (Thm.theory_of_thm th)) quote th;
    95 
    96 val pretty_thm = gen_pretty_thm true;
    97 val pretty_thm_no_quote = gen_pretty_thm false;
    98 
    99 
   100 val string_of_thm = Pretty.string_of o pretty_thm;
   101 val pprint_thm = Pretty.pprint o pretty_thm;
   102 
   103 fun pretty_thms [th] = pretty_thm th
   104   | pretty_thms ths = Pretty.block (Pretty.fbreaks (map pretty_thm ths));
   105 
   106 val pretty_thm_sg = pretty_thm oo Thm.transfer;
   107 val pretty_thms_sg = pretty_thms oo (map o Thm.transfer);
   108 
   109 
   110 (* top-level commands for printing theorems *)
   111 
   112 val print_thm = Pretty.writeln o pretty_thm;
   113 val print_thms = Pretty.writeln o pretty_thms;
   114 
   115 fun prth th = (print_thm th; th);
   116 fun prthq thq = (Seq.print (K print_thm) 100000 thq; thq);
   117 fun prths ths = (prthq (Seq.of_list ths); ths);
   118 
   119 
   120 (* other printing commands *)
   121 
   122 fun pretty_ctyp cT =
   123   let val {thy, T, ...} = rep_ctyp cT in Sign.pretty_typ thy T end;
   124 
   125 fun pprint_ctyp cT =
   126   let val {thy, T, ...} = rep_ctyp cT in Sign.pprint_typ thy T end;
   127 
   128 fun string_of_ctyp cT =
   129   let val {thy, T, ...} = rep_ctyp cT in Sign.string_of_typ thy T end;
   130 
   131 val print_ctyp = writeln o string_of_ctyp;
   132 
   133 fun pretty_cterm ct =
   134   let val {thy, t, ...} = rep_cterm ct in Sign.pretty_term thy t end;
   135 
   136 fun pprint_cterm ct =
   137   let val {thy, t, ...} = rep_cterm ct in Sign.pprint_term thy t end;
   138 
   139 fun string_of_cterm ct =
   140   let val {thy, t, ...} = rep_cterm ct in Sign.string_of_term thy t end;
   141 
   142 val print_cterm = writeln o string_of_cterm;
   143 
   144 
   145 
   146 (** print theory **)
   147 
   148 val print_syntax = Syntax.print_syntax o Sign.syn_of;
   149 
   150 
   151 (* pretty_full_theory *)
   152 
   153 fun pretty_full_theory thy =
   154   let
   155     fun prt_cls c = Sign.pretty_sort thy [c];
   156     fun prt_sort S = Sign.pretty_sort thy S;
   157     fun prt_arity t (c, Ss) = Sign.pretty_arity thy (t, Ss, [c]);
   158     fun prt_typ ty = Pretty.quote (Sign.pretty_typ thy ty);
   159     val prt_typ_no_tvars = prt_typ o Type.freeze_type;
   160     fun prt_term t = Pretty.quote (Sign.pretty_term thy t);
   161 
   162     fun pretty_classrel (c, []) = prt_cls c
   163       | pretty_classrel (c, cs) = Pretty.block
   164           (prt_cls c :: Pretty.str " <" :: Pretty.brk 1 ::
   165             Pretty.commas (map prt_cls cs));
   166 
   167     fun pretty_default S = Pretty.block
   168       [Pretty.str "default sort:", Pretty.brk 1, prt_sort S];
   169 
   170     fun pretty_witness NONE = Pretty.str "universal non-emptiness witness: -"
   171       | pretty_witness (SOME (T, S)) = Pretty.block
   172           [Pretty.str "universal non-emptiness witness:", Pretty.brk 1,
   173             prt_typ_no_tvars T, Pretty.str " ::", Pretty.brk 1, prt_sort S];
   174 
   175     val tfrees = map (fn v => TFree (v, []));
   176     fun pretty_type syn (t, (Type.LogicalType n, _)) =
   177           if syn then NONE
   178           else SOME (prt_typ (Type (t, tfrees (Term.invent_names [] "'a" n))))
   179       | pretty_type syn (t, (Type.Abbreviation (vs, U, syn'), _)) =
   180           if syn <> syn' then NONE
   181           else SOME (Pretty.block
   182             [prt_typ (Type (t, tfrees vs)), Pretty.str " =", Pretty.brk 1, prt_typ U])
   183       | pretty_type syn (t, (Type.Nonterminal, _)) =
   184           if not syn then NONE
   185           else SOME (prt_typ (Type (t, [])));
   186 
   187     val pretty_arities = List.concat o map (fn (t, ars) => map (prt_arity t) ars);
   188 
   189     fun pretty_const (c, ty) = Pretty.block
   190       [Pretty.str c, Pretty.str " ::", Pretty.brk 1, prt_typ_no_tvars ty];
   191 
   192     fun pretty_final (c, []) = Pretty.str c
   193       | pretty_final (c, tys) = Pretty.block
   194           (Pretty.str c :: Pretty.str " ::" :: Pretty.brk 1 ::
   195              Pretty.commas (map prt_typ_no_tvars tys));
   196 
   197     fun prt_axm (a, t) = Pretty.block [Pretty.str (a ^ ":"), Pretty.brk 1, prt_term t];
   198 
   199     val {axioms, defs, oracles} = Theory.rep_theory thy;
   200     val {naming, syn = _, tsig, consts = (consts, constraints)} = Sign.rep_sg thy;
   201     val {classes, default, types, arities, log_types = _, witness} = Type.rep_tsig tsig;
   202 
   203     val clsses = NameSpace.dest_table (apsnd (Symtab.make o Graph.dest) classes);
   204     val tdecls = NameSpace.dest_table types;
   205     val arties = NameSpace.dest_table (Sign.type_space thy, arities);
   206     val cnsts = NameSpace.extern_table consts |> map (apsnd fst);
   207     val cnsts' = NameSpace.extern_table (#1 consts, constraints);
   208     val finals = NameSpace.extern_table (#1 consts, Defs.finals defs);
   209     val axms = NameSpace.extern_table axioms;
   210     val oras = NameSpace.extern_table oracles;
   211   in
   212     [Pretty.strs ("names:" :: Context.names_of thy),
   213       Pretty.strs ("theory data:" :: Context.theory_data_of thy),
   214       Pretty.strs ("proof data:" :: Context.proof_data_of thy),
   215       Pretty.strs ["name prefix:", NameSpace.path_of naming],
   216       Pretty.big_list "classes:" (map pretty_classrel clsses),
   217       pretty_default default,
   218       pretty_witness witness,
   219       Pretty.big_list "syntactic types:" (List.mapPartial (pretty_type true) tdecls),
   220       Pretty.big_list "logical types:" (List.mapPartial (pretty_type false) tdecls),
   221       Pretty.big_list "type arities:" (pretty_arities arties),
   222       Pretty.big_list "consts:" (map pretty_const cnsts),
   223       Pretty.big_list "const constraints:" (map pretty_const cnsts'),
   224       Pretty.big_list "finals consts:" (map pretty_final finals),
   225       Pretty.big_list "axioms:" (map prt_axm axms),
   226       Pretty.strs ("oracles:" :: (map #1 oras))]
   227   end;
   228 
   229 
   230 
   231 (** print_goals **)
   232 
   233 (* print_goals etc. *)
   234 
   235 val show_consts = ref false;  (*true: show consts with types in proof state output*)
   236 
   237 
   238 (*print thm A1,...,An/B in "goal style" -- premises as numbered subgoals*)
   239 
   240 local
   241 
   242 fun ins_entry (x, y) [] = [(x, [y])]
   243   | ins_entry (x, y) ((pair as (x', ys')) :: pairs) =
   244       if x = x' then (x', y ins ys') :: pairs
   245       else pair :: ins_entry (x, y) pairs;
   246 
   247 fun add_consts (Const (c, T), env) = ins_entry (T, (c, T)) env
   248   | add_consts (t $ u, env) = add_consts (u, add_consts (t, env))
   249   | add_consts (Abs (_, _, t), env) = add_consts (t, env)
   250   | add_consts (_, env) = env;
   251 
   252 fun add_vars (Free (x, T), env) = ins_entry (T, (x, ~1)) env
   253   | add_vars (Var (xi, T), env) = ins_entry (T, xi) env
   254   | add_vars (Abs (_, _, t), env) = add_vars (t, env)
   255   | add_vars (t $ u, env) = add_vars (u, add_vars (t, env))
   256   | add_vars (_, env) = env;
   257 
   258 fun add_varsT (Type (_, Ts), env) = foldr add_varsT env Ts
   259   | add_varsT (TFree (x, S), env) = ins_entry (S, (x, ~1)) env
   260   | add_varsT (TVar (xi, S), env) = ins_entry (S, xi) env;
   261 
   262 fun sort_idxs vs = map (apsnd (sort (prod_ord string_ord int_ord))) vs;
   263 fun sort_cnsts cs = map (apsnd (sort_wrt fst)) cs;
   264 
   265 fun consts_of t = sort_cnsts (add_consts (t, []));
   266 fun vars_of t = sort_idxs (add_vars (t, []));
   267 fun varsT_of t = rev (sort_idxs (it_term_types add_varsT (t, [])));
   268 
   269 in
   270 
   271 fun pretty_goals_aux pp begin_goal (msg, main) maxgoals state =
   272   let
   273     fun prt_atoms prt prtT (X, xs) = Pretty.block
   274       [Pretty.block (Pretty.commas (map prt xs)), Pretty.str " ::",
   275         Pretty.brk 1, prtT X];
   276 
   277     fun prt_var (x, ~1) = Pretty.term pp (Syntax.free x)
   278       | prt_var xi = Pretty.term pp (Syntax.var xi);
   279 
   280     fun prt_varT (x, ~1) = Pretty.typ pp (TFree (x, []))
   281       | prt_varT xi = Pretty.typ pp (TVar (xi, []));
   282 
   283     val prt_consts = prt_atoms (Pretty.term pp o Const) (Pretty.typ pp);
   284     val prt_vars = prt_atoms prt_var (Pretty.typ pp);
   285     val prt_varsT = prt_atoms prt_varT (Pretty.sort pp);
   286 
   287 
   288     fun pretty_list _ _ [] = []
   289       | pretty_list name prt lst = [Pretty.big_list name (map prt lst)];
   290 
   291     fun pretty_subgoal (n, A) = Pretty.blk (0,
   292      [Pretty.str (begin_goal ^ " " ^ string_of_int n ^ ". "), Pretty.term pp A]);
   293     fun pretty_subgoals As = map pretty_subgoal (1 upto length As ~~ As);
   294 
   295     val pretty_ffpairs = pretty_list "flex-flex pairs:" (pretty_flexpair pp);
   296 
   297     val pretty_consts = pretty_list "constants:" prt_consts o consts_of;
   298     val pretty_vars = pretty_list "variables:" prt_vars o vars_of;
   299     val pretty_varsT = pretty_list "type variables:" prt_varsT o varsT_of;
   300 
   301 
   302     val {prop, tpairs, ...} = Thm.rep_thm state;
   303     val (As, B) = Logic.strip_horn prop;
   304     val ngoals = length As;
   305 
   306     fun pretty_gs (types, sorts) =
   307       (if main then [Pretty.term pp B] else []) @
   308        (if ngoals = 0 then [Pretty.str "No subgoals!"]
   309         else if ngoals > maxgoals then
   310           pretty_subgoals (Library.take (maxgoals, As)) @
   311           (if msg then [Pretty.str ("A total of " ^ string_of_int ngoals ^ " subgoals...")]
   312            else [])
   313         else pretty_subgoals As) @
   314       pretty_ffpairs tpairs @
   315       (if ! show_consts then pretty_consts prop else []) @
   316       (if types then pretty_vars prop else []) @
   317       (if sorts then pretty_varsT prop else []);
   318   in
   319     setmp show_no_free_types true
   320       (setmp show_types (! show_types orelse ! show_sorts orelse ! show_all_types)
   321         (setmp show_sorts false pretty_gs))
   322    (! show_types orelse ! show_sorts orelse ! show_all_types, ! show_sorts)
   323   end;
   324 
   325 fun pretty_goals_marker bg n th =
   326   pretty_goals_aux (Sign.pp (Thm.theory_of_thm th)) bg (true, true) n th;
   327 
   328 val pretty_goals = pretty_goals_marker "";
   329 val print_goals = (Pretty.writeln o Pretty.chunks) oo pretty_goals_marker "";
   330 
   331 end;
   332 
   333 
   334 (* print_current_goals *)
   335 
   336 val current_goals_markers = ref ("", "", "");
   337 
   338 fun pretty_current_goals n m th =
   339   let
   340     val ref (begin_state, end_state, begin_goal) = current_goals_markers;
   341     val ngoals = nprems_of th;
   342   in
   343     (if begin_state = "" then [] else [Pretty.str begin_state]) @
   344     [Pretty.str ("Level " ^ string_of_int n ^
   345       (if ngoals > 0 then " (" ^ string_of_int ngoals ^ " subgoal" ^
   346         (if ngoals <> 1 then "s" else "") ^ ")"
   347       else ""))] @
   348     pretty_goals_marker begin_goal m th @
   349     (if end_state = "" then [] else [Pretty.str end_state])
   350   end;
   351 
   352 fun print_current_goals_default n m th =
   353   Pretty.writeln (Pretty.chunks (pretty_current_goals n m th));
   354 
   355 val print_current_goals_fn = ref print_current_goals_default;
   356 
   357 end;
   358 
   359 structure BasicDisplay: BASIC_DISPLAY = Display;
   360 open BasicDisplay;