paulson@1591: (* Title: Pure/display.ML paulson@1591: ID: $Id$ paulson@1591: Author: Lawrence C Paulson, Cambridge University Computer Laboratory paulson@1591: Copyright 1993 University of Cambridge paulson@1591: paulson@1591: Printing of theories, theorems, etc. paulson@1591: *) paulson@1591: paulson@1591: signature DISPLAY = paulson@1591: sig paulson@1591: val pprint_cterm : cterm -> pprint_args -> unit paulson@1591: val pprint_ctyp : ctyp -> pprint_args -> unit paulson@1591: val pprint_theory : theory -> pprint_args -> unit paulson@1591: val pprint_thm : thm -> pprint_args -> unit wenzelm@4126: val pretty_ctyp : ctyp -> Pretty.T wenzelm@3547: val pretty_cterm : cterm -> Pretty.T paulson@1591: val pretty_thm : thm -> Pretty.T paulson@1591: val print_cterm : cterm -> unit paulson@1591: val print_ctyp : ctyp -> unit wenzelm@3851: val show_consts : bool ref paulson@1591: val print_goals : int -> thm -> unit wenzelm@4498: val pretty_name_space : string * NameSpace.T -> Pretty.T paulson@1591: val print_syntax : theory -> unit paulson@1591: val print_theory : theory -> unit wenzelm@3873: val print_data : theory -> string -> unit paulson@1591: val print_thm : thm -> unit paulson@1591: val prth : thm -> thm wenzelm@4270: val prthq : thm Seq.seq -> thm Seq.seq paulson@1591: val prths : thm list -> thm list paulson@1591: val show_hyps : bool ref paulson@1591: val string_of_cterm : cterm -> string paulson@1591: val string_of_ctyp : ctyp -> string paulson@1591: val string_of_thm : thm -> string paulson@1591: end; paulson@1591: paulson@1591: paulson@1591: structure Display : DISPLAY = paulson@1591: struct paulson@1591: paulson@1591: (*If false, hypotheses are printed as dots*) paulson@1591: val show_hyps = ref true; paulson@1591: paulson@1591: fun pretty_thm th = paulson@1591: let paulson@1591: val {sign, hyps, prop, ...} = rep_thm th; paulson@1591: val xshyps = extra_shyps th; paulson@1591: val hlen = length xshyps + length hyps; paulson@1591: val hsymbs = paulson@1591: if hlen = 0 then [] paulson@1591: else if ! show_hyps then paulson@1591: [Pretty.brk 2, Pretty.list "[" "]" wenzelm@3785: (map (Sign.pretty_term sign) hyps @ wenzelm@3785: map (Sign.pretty_sort sign) xshyps)] paulson@1591: else paulson@1591: [Pretty.brk 2, Pretty.str ("[" ^ implode (replicate hlen ".") ^ "]")]; paulson@1591: in paulson@1591: Pretty.block (Sign.pretty_term sign prop :: hsymbs) paulson@1591: end; paulson@1591: paulson@1591: val string_of_thm = Pretty.string_of o pretty_thm; paulson@1591: val pprint_thm = Pretty.pprint o Pretty.quote o pretty_thm; paulson@1591: paulson@1591: paulson@1591: (** Top-level commands for printing theorems **) paulson@1591: val print_thm = writeln o string_of_thm; paulson@1591: paulson@1591: fun prth th = (print_thm th; th); paulson@1591: paulson@1591: (*Print and return a sequence of theorems, separated by blank lines. *) paulson@1591: fun prthq thseq = wenzelm@4270: (Seq.print (fn _ => print_thm) 100000 thseq; thseq); paulson@1591: paulson@1591: (*Print and return a list of theorems, separated by blank lines. *) wenzelm@4210: fun prths ths = (seq (fn th => (print_thm th; writeln "")) ths; ths); paulson@1591: paulson@1591: paulson@1591: (* other printing commands *) paulson@1591: wenzelm@4126: fun pretty_ctyp cT = wenzelm@4126: let val {sign, T} = rep_ctyp cT in Sign.pretty_typ sign T end; wenzelm@4126: paulson@1591: fun pprint_ctyp cT = paulson@1591: let val {sign, T} = rep_ctyp cT in Sign.pprint_typ sign T end; paulson@1591: paulson@1591: fun string_of_ctyp cT = paulson@1591: let val {sign, T} = rep_ctyp cT in Sign.string_of_typ sign T end; paulson@1591: paulson@1591: val print_ctyp = writeln o string_of_ctyp; paulson@1591: wenzelm@3547: fun pretty_cterm ct = wenzelm@3547: let val {sign, t, ...} = rep_cterm ct in Sign.pretty_term sign t end; wenzelm@3547: paulson@1591: fun pprint_cterm ct = paulson@1591: let val {sign, t, ...} = rep_cterm ct in Sign.pprint_term sign t end; paulson@1591: paulson@1591: fun string_of_cterm ct = paulson@1591: let val {sign, t, ...} = rep_cterm ct in Sign.string_of_term sign t end; paulson@1591: paulson@1591: val print_cterm = writeln o string_of_cterm; paulson@1591: paulson@1591: wenzelm@4250: wenzelm@4250: (** print theory **) paulson@1591: paulson@1591: val pprint_theory = Sign.pprint_sg o sign_of; paulson@1591: paulson@1591: val print_syntax = Syntax.print_syntax o syn_of; wenzelm@3873: val print_data = Sign.print_data o sign_of; paulson@1591: wenzelm@4250: wenzelm@4498: (* pretty_name_space *) wenzelm@4498: wenzelm@4498: fun pretty_name_space (kind, space) = wenzelm@4498: let wenzelm@4498: fun prt_entry (name, accs) = Pretty.block wenzelm@4498: (Pretty.str (quote name ^ " =") :: Pretty.brk 1 :: wenzelm@4498: Pretty.commas (map (Pretty.str o quote) accs)); wenzelm@4498: in wenzelm@4498: Pretty.fbreaks (Pretty.str (kind ^ ":") :: map prt_entry (NameSpace.dest space)) wenzelm@4498: |> Pretty.block wenzelm@4498: end; wenzelm@4498: wenzelm@4498: wenzelm@4498: wenzelm@4250: (* print signature *) wenzelm@4250: wenzelm@4250: fun print_sign sg = wenzelm@4250: let wenzelm@4250: fun prt_cls c = Sign.pretty_sort sg [c]; wenzelm@4250: fun prt_sort S = Sign.pretty_sort sg S; wenzelm@4250: fun prt_arity t (c, Ss) = Sign.pretty_arity sg (t, Ss, [c]); wenzelm@4250: fun prt_typ ty = Pretty.quote (Sign.pretty_typ sg ty); wenzelm@4250: wenzelm@4250: val ext_class = Sign.cond_extern sg Sign.classK; wenzelm@4250: val ext_tycon = Sign.cond_extern sg Sign.typeK; wenzelm@4250: val ext_const = Sign.cond_extern sg Sign.constK; wenzelm@4250: wenzelm@4250: wenzelm@4250: fun pretty_classes cs = Pretty.block wenzelm@4250: (Pretty.breaks (Pretty.str "classes:" :: map prt_cls cs)); wenzelm@4250: wenzelm@4250: fun pretty_classrel (c, cs) = Pretty.block wenzelm@4250: (prt_cls c :: Pretty.str " <" :: Pretty.brk 1 :: wenzelm@4250: Pretty.commas (map prt_cls cs)); wenzelm@4250: wenzelm@4250: fun pretty_default S = Pretty.block wenzelm@4250: [Pretty.str "default:", Pretty.brk 1, prt_sort S]; wenzelm@4250: wenzelm@4250: fun pretty_ty (t, n) = Pretty.block wenzelm@4250: [Pretty.str (ext_tycon t), Pretty.str (" " ^ string_of_int n)]; wenzelm@4250: wenzelm@4250: fun pretty_abbr (t, (vs, rhs)) = Pretty.block wenzelm@4250: [prt_typ (Type (t, map (fn v => TVar ((v, 0), [])) vs)), wenzelm@4250: Pretty.str " =", Pretty.brk 1, prt_typ rhs]; wenzelm@4250: wenzelm@4250: fun pretty_arities (t, ars) = map (prt_arity t) ars; wenzelm@4250: wenzelm@4250: fun pretty_const (c, ty) = Pretty.block wenzelm@4250: [Pretty.str c, Pretty.str " ::", Pretty.brk 1, prt_typ ty]; wenzelm@4250: wenzelm@4250: val {self = _, tsig, const_tab, syn = _, path, spaces, data} = Sign.rep_sg sg; wenzelm@4440: val spaces' = sort_wrt fst spaces; wenzelm@4250: val {classes, classrel, default, tycons, abbrs, arities} = wenzelm@4250: Type.rep_tsig tsig; wenzelm@4250: val consts = sort_wrt fst (map (apfst ext_const) (Symtab.dest const_tab)); wenzelm@4250: in wenzelm@4250: Pretty.writeln (Pretty.strs ("stamps:" :: Sign.stamp_names_of sg)); wenzelm@4256: Pretty.writeln (Pretty.strs ("data:" :: Sign.data_kinds data)); wenzelm@4782: Pretty.writeln (Pretty.strs ["name prefix:", NameSpace.pack path]); wenzelm@4498: Pretty.writeln (Pretty.big_list "name spaces:" (map pretty_name_space spaces')); wenzelm@4250: Pretty.writeln (pretty_classes classes); wenzelm@4250: Pretty.writeln (Pretty.big_list "class relation:" (map pretty_classrel classrel)); wenzelm@4250: Pretty.writeln (pretty_default default); wenzelm@4250: Pretty.writeln (Pretty.big_list "type constructors:" (map pretty_ty tycons)); wenzelm@4250: Pretty.writeln (Pretty.big_list "type abbreviations:" (map pretty_abbr abbrs)); wenzelm@4250: Pretty.writeln (Pretty.big_list "type arities:" (flat (map pretty_arities arities))); wenzelm@4250: Pretty.writeln (Pretty.big_list "consts:" (map pretty_const consts)) wenzelm@4250: end; wenzelm@4250: wenzelm@4250: wenzelm@4250: (* print axioms, oracles, theorems *) wenzelm@4250: wenzelm@3811: fun print_thy thy = paulson@1591: let wenzelm@3990: val {sign, axioms, oracles, ...} = rep_theory thy; wenzelm@3990: val axioms = Symtab.dest axioms; wenzelm@3811: val oras = map fst (Symtab.dest oracles); paulson@1591: wenzelm@3936: fun prt_axm (a, t) = Pretty.block wenzelm@3990: [Pretty.str (Sign.cond_extern sign Theory.axiomK a ^ ":"), Pretty.brk 1, wenzelm@3936: Pretty.quote (Sign.pretty_term sign t)]; paulson@1591: in wenzelm@3990: Pretty.writeln (Pretty.big_list "axioms:" (map prt_axm axioms)); wenzelm@3990: Pretty.writeln (Pretty.strs ("oracles:" :: oras)); wenzelm@4782: print_data thy "Pure/theorems" (*forward reference!*) paulson@1591: end; paulson@1591: wenzelm@4250: fun print_theory thy = (print_sign (sign_of thy); print_thy thy); paulson@1591: paulson@1591: paulson@1591: wenzelm@4250: (** print_goals **) paulson@1591: wenzelm@4250: (*print thm A1,...,An/B in "goal style" -- premises as numbered subgoals*) wenzelm@4250: wenzelm@4250: (*also show consts in case of showing types?*) wenzelm@3851: val show_consts = ref false; wenzelm@3851: paulson@1591: paulson@1591: local wenzelm@3851: wenzelm@3851: (* utils *) paulson@1591: paulson@1591: fun ins_entry (x, y) [] = [(x, [y])] paulson@1591: | ins_entry (x, y) ((pair as (x', ys')) :: pairs) = wenzelm@3851: if x = x' then (x', y ins ys') :: pairs paulson@1591: else pair :: ins_entry (x, y) pairs; paulson@1591: wenzelm@3990: fun add_consts (Const (c, T), env) = ins_entry (T, (c, T)) env wenzelm@3851: | add_consts (t $ u, env) = add_consts (u, add_consts (t, env)) wenzelm@3851: | add_consts (Abs (_, _, t), env) = add_consts (t, env) wenzelm@3851: | add_consts (_, env) = env; paulson@1591: wenzelm@3851: fun add_vars (Free (x, T), env) = ins_entry (T, (x, ~1)) env wenzelm@3851: | add_vars (Var (xi, T), env) = ins_entry (T, xi) env wenzelm@3851: | add_vars (Abs (_, _, t), env) = add_vars (t, env) wenzelm@3851: | add_vars (t $ u, env) = add_vars (u, add_vars (t, env)) wenzelm@3851: | add_vars (_, env) = env; paulson@1591: wenzelm@3851: fun add_varsT (Type (_, Ts), env) = foldr add_varsT (Ts, env) wenzelm@3851: | add_varsT (TFree (x, S), env) = ins_entry (S, (x, ~1)) env wenzelm@3851: | add_varsT (TVar (xi, S), env) = ins_entry (S, xi) env; paulson@1591: wenzelm@4440: fun sort_idxs vs = map (apsnd (sort (prod_ord string_ord int_ord))) vs; wenzelm@4440: fun sort_cnsts cs = map (apsnd (sort_wrt fst)) cs; paulson@1591: paulson@1591: wenzelm@3851: (* prepare atoms *) wenzelm@3851: wenzelm@3990: fun consts_of t = sort_cnsts (add_consts (t, [])); wenzelm@3851: fun vars_of t = sort_idxs (add_vars (t, [])); wenzelm@3851: fun varsT_of t = rev (sort_idxs (it_term_types add_varsT (t, []))); wenzelm@3851: wenzelm@3851: in wenzelm@3851: wenzelm@3851: fun print_goals maxgoals state = wenzelm@3851: let wenzelm@3851: val {sign, ...} = rep_thm state; paulson@1591: wenzelm@3851: val prt_term = Sign.pretty_term sign; wenzelm@3851: val prt_typ = Sign.pretty_typ sign; wenzelm@3851: val prt_sort = Sign.pretty_sort sign; wenzelm@3851: wenzelm@3851: fun prt_atoms prt prtT (X, xs) = Pretty.block wenzelm@3851: [Pretty.block (Pretty.commas (map prt xs)), Pretty.str " ::", wenzelm@3851: Pretty.brk 1, prtT X]; paulson@1591: wenzelm@3851: fun prt_var (x, ~1) = prt_term (Syntax.free x) wenzelm@3851: | prt_var xi = prt_term (Syntax.var xi); wenzelm@3851: wenzelm@3851: fun prt_varT (x, ~1) = prt_typ (TFree (x, [])) wenzelm@3851: | prt_varT xi = prt_typ (TVar (xi, [])); wenzelm@3851: wenzelm@3990: val prt_consts = prt_atoms (prt_term o Const) prt_typ; wenzelm@3851: val prt_vars = prt_atoms prt_var prt_typ; wenzelm@3851: val prt_varsT = prt_atoms prt_varT prt_sort; paulson@1591: paulson@1591: wenzelm@3851: fun print_list _ _ [] = () wenzelm@3851: | print_list name prt lst = (writeln ""; wenzelm@3851: Pretty.writeln (Pretty.big_list name (map prt lst))); wenzelm@3851: wenzelm@3851: fun print_subgoals (_, []) = () wenzelm@3851: | print_subgoals (n, A :: As) = (Pretty.writeln (Pretty.blk (0, wenzelm@3851: [Pretty.str (" " ^ string_of_int n ^ ". "), prt_term A])); wenzelm@3851: print_subgoals (n + 1, As)); paulson@1591: wenzelm@3851: val print_ffpairs = wenzelm@3851: print_list "Flex-flex pairs:" (prt_term o Logic.mk_flexpair); wenzelm@3851: wenzelm@3851: val print_consts = print_list "Constants:" prt_consts o consts_of; wenzelm@3851: val print_vars = print_list "Variables:" prt_vars o vars_of; wenzelm@3851: val print_varsT = print_list "Type variables:" prt_varsT o varsT_of; wenzelm@3851: wenzelm@3851: wenzelm@3851: val {prop, ...} = rep_thm state; wenzelm@3851: val (tpairs, As, B) = Logic.strip_horn prop; wenzelm@3851: val ngoals = length As; paulson@1591: wenzelm@3851: fun print_gs (types, sorts) = wenzelm@3851: (Pretty.writeln (prt_term B); wenzelm@3851: if ngoals = 0 then writeln "No subgoals!" wenzelm@3851: else if ngoals > maxgoals then wenzelm@3851: (print_subgoals (1, take (maxgoals, As)); wenzelm@3851: writeln ("A total of " ^ string_of_int ngoals ^ " subgoals...")) wenzelm@3851: else print_subgoals (1, As); wenzelm@3851: wenzelm@3851: print_ffpairs tpairs; paulson@1591: wenzelm@3851: if types andalso ! show_consts then print_consts prop else (); wenzelm@3851: if types then print_vars prop else (); wenzelm@3851: if sorts then print_varsT prop else ()); wenzelm@3851: in wenzelm@3851: setmp show_no_free_types true wenzelm@3851: (setmp show_types (! show_types orelse ! show_sorts) wenzelm@3851: (setmp show_sorts false print_gs)) wenzelm@3851: (! show_types orelse ! show_sorts, ! show_sorts) wenzelm@3851: end; paulson@1591: wenzelm@3851: end; paulson@1591: paulson@1591: paulson@1591: end; paulson@1591: paulson@1591: open Display;