1 (* Title: Pure/Isar/proof_context.ML
2 Author: Markus Wenzel, TU Muenchen
4 The key concept of Isar proof contexts: elevates primitive local
5 reasoning Gamma |- phi to a structured concept, with generic context
6 elements. See also structure Variable and Assumption.
9 signature PROOF_CONTEXT =
11 val theory_of: Proof.context -> theory
12 val init_global: theory -> Proof.context
14 val mode_default: mode
16 val mode_pattern: mode
17 val mode_schematic: mode
19 val set_mode: mode -> Proof.context -> Proof.context
20 val get_mode: Proof.context -> mode
21 val restore_mode: Proof.context -> Proof.context -> Proof.context
22 val abbrev_mode: Proof.context -> bool
23 val set_stmt: bool -> Proof.context -> Proof.context
24 val local_naming: Name_Space.naming
25 val map_naming: (Name_Space.naming -> Name_Space.naming) -> Proof.context -> Proof.context
26 val naming_of: Proof.context -> Name_Space.naming
27 val restore_naming: Proof.context -> Proof.context -> Proof.context
28 val full_name: Proof.context -> binding -> string
29 val syntax_of: Proof.context -> Local_Syntax.T
30 val syn_of: Proof.context -> Syntax.syntax
31 val tsig_of: Proof.context -> Type.tsig
32 val set_defsort: sort -> Proof.context -> Proof.context
33 val default_sort: Proof.context -> indexname -> sort
34 val consts_of: Proof.context -> Consts.T
35 val the_const_constraint: Proof.context -> string -> typ
36 val set_syntax_mode: Syntax.mode -> Proof.context -> Proof.context
37 val restore_syntax_mode: Proof.context -> Proof.context -> Proof.context
38 val facts_of: Proof.context -> Facts.T
39 val cases_of: Proof.context -> (string * (Rule_Cases.T * bool)) list
40 val class_space: Proof.context -> Name_Space.T
41 val type_space: Proof.context -> Name_Space.T
42 val const_space: Proof.context -> Name_Space.T
43 val intern_class: Proof.context -> xstring -> string
44 val intern_type: Proof.context -> xstring -> string
45 val intern_const: Proof.context -> xstring -> string
46 val extern_class: Proof.context -> string -> xstring
47 val extern_type: Proof.context -> string -> xstring
48 val extern_const: Proof.context -> string -> xstring
49 val transfer_syntax: theory -> Proof.context -> Proof.context
50 val transfer: theory -> Proof.context -> Proof.context
51 val background_theory: (theory -> theory) -> Proof.context -> Proof.context
52 val background_theory_result: (theory -> 'a * theory) -> Proof.context -> 'a * Proof.context
53 val extern_fact: Proof.context -> string -> xstring
54 val pretty_term_abbrev: Proof.context -> term -> Pretty.T
55 val pretty_fact_aux: Proof.context -> bool -> string * thm list -> Pretty.T
56 val pretty_fact: Proof.context -> string * thm list -> Pretty.T
57 val read_class: Proof.context -> xstring -> class
58 val read_arity: Proof.context -> xstring * string list * string -> arity
59 val cert_arity: Proof.context -> arity -> arity
60 val read_typ: Proof.context -> string -> typ
61 val read_typ_syntax: Proof.context -> string -> typ
62 val read_typ_abbrev: Proof.context -> string -> typ
63 val cert_typ: Proof.context -> typ -> typ
64 val cert_typ_syntax: Proof.context -> typ -> typ
65 val cert_typ_abbrev: Proof.context -> typ -> typ
66 val infer_type: Proof.context -> string * typ -> typ
67 val inferred_param: string -> Proof.context -> typ * Proof.context
68 val inferred_fixes: Proof.context -> (string * typ) list * Proof.context
69 val read_type_name: Proof.context -> bool -> string -> typ
70 val read_type_name_proper: Proof.context -> bool -> string -> typ
71 val read_const_proper: Proof.context -> bool -> string -> term
72 val read_const: Proof.context -> bool -> typ -> string -> term
73 val allow_dummies: Proof.context -> Proof.context
74 val get_sort: Proof.context -> (indexname * sort) list -> indexname -> sort
75 val check_tvar: Proof.context -> indexname * sort -> indexname * sort
76 val check_tfree: Proof.context -> string * sort -> string * sort
77 val intern_skolem: Proof.context -> string -> string option
78 val read_term_pattern: Proof.context -> string -> term
79 val read_term_schematic: Proof.context -> string -> term
80 val read_term_abbrev: Proof.context -> string -> term
81 val show_abbrevs_raw: Config.raw
82 val show_abbrevs: bool Config.T
83 val expand_abbrevs: Proof.context -> term -> term
84 val cert_term: Proof.context -> term -> term
85 val cert_prop: Proof.context -> term -> term
86 val def_type: Proof.context -> indexname -> typ option
87 val goal_export: Proof.context -> Proof.context -> thm list -> thm list
88 val export: Proof.context -> Proof.context -> thm list -> thm list
89 val export_morphism: Proof.context -> Proof.context -> morphism
90 val norm_export_morphism: Proof.context -> Proof.context -> morphism
91 val bind_terms: (indexname * term option) list -> Proof.context -> Proof.context
92 val auto_bind_goal: term list -> Proof.context -> Proof.context
93 val auto_bind_facts: term list -> Proof.context -> Proof.context
94 val match_bind: bool -> (string list * string) list -> Proof.context -> term list * Proof.context
95 val match_bind_i: bool -> (term list * term) list -> Proof.context -> term list * Proof.context
96 val read_propp: Proof.context * (string * string list) list list
97 -> Proof.context * (term * term list) list list
98 val cert_propp: Proof.context * (term * term list) list list
99 -> Proof.context * (term * term list) list list
100 val read_propp_schematic: Proof.context * (string * string list) list list
101 -> Proof.context * (term * term list) list list
102 val cert_propp_schematic: Proof.context * (term * term list) list list
103 -> Proof.context * (term * term list) list list
104 val bind_propp: Proof.context * (string * string list) list list
105 -> Proof.context * (term list list * (Proof.context -> Proof.context))
106 val bind_propp_i: Proof.context * (term * term list) list list
107 -> Proof.context * (term list list * (Proof.context -> Proof.context))
108 val bind_propp_schematic: Proof.context * (string * string list) list list
109 -> Proof.context * (term list list * (Proof.context -> Proof.context))
110 val bind_propp_schematic_i: Proof.context * (term * term list) list list
111 -> Proof.context * (term list list * (Proof.context -> Proof.context))
112 val fact_tac: thm list -> int -> tactic
113 val some_fact_tac: Proof.context -> int -> tactic
114 val get_fact: Proof.context -> Facts.ref -> thm list
115 val get_fact_single: Proof.context -> Facts.ref -> thm
116 val get_thms: Proof.context -> xstring -> thm list
117 val get_thm: Proof.context -> xstring -> thm
118 val note_thmss: string -> (Thm.binding * (thm list * attribute list) list) list ->
119 Proof.context -> (string * thm list) list * Proof.context
120 val put_thms: bool -> string * thm list option -> Proof.context -> Proof.context
121 val read_vars: (binding * string option * mixfix) list -> Proof.context ->
122 (binding * typ option * mixfix) list * Proof.context
123 val cert_vars: (binding * typ option * mixfix) list -> Proof.context ->
124 (binding * typ option * mixfix) list * Proof.context
125 val add_fixes: (binding * typ option * mixfix) list -> Proof.context ->
126 string list * Proof.context
127 val auto_fixes: Proof.context * (term list list * 'a) -> Proof.context * (term list list * 'a)
128 val add_assms: Assumption.export ->
129 (Thm.binding * (string * string list) list) list ->
130 Proof.context -> (string * thm list) list * Proof.context
131 val add_assms_i: Assumption.export ->
132 (Thm.binding * (term * term list) list) list ->
133 Proof.context -> (string * thm list) list * Proof.context
134 val add_cases: bool -> (string * Rule_Cases.T option) list -> Proof.context -> Proof.context
135 val apply_case: Rule_Cases.T -> Proof.context -> (string * term list) list * Proof.context
136 val get_case: Proof.context -> string -> binding option list -> Rule_Cases.T
137 val type_notation: bool -> Syntax.mode -> (typ * mixfix) list -> Proof.context -> Proof.context
138 val notation: bool -> Syntax.mode -> (term * mixfix) list -> Proof.context -> Proof.context
139 val target_type_notation: bool -> Syntax.mode -> (typ * mixfix) list -> morphism ->
140 Context.generic -> Context.generic
141 val target_notation: bool -> Syntax.mode -> (term * mixfix) list -> morphism ->
142 Context.generic -> Context.generic
143 val class_alias: binding -> class -> Proof.context -> Proof.context
144 val type_alias: binding -> string -> Proof.context -> Proof.context
145 val const_alias: binding -> string -> Proof.context -> Proof.context
146 val add_const_constraint: string * typ option -> Proof.context -> Proof.context
147 val add_abbrev: string -> binding * term -> Proof.context -> (term * term) * Proof.context
148 val revert_abbrev: string -> string -> Proof.context -> Proof.context
149 val print_syntax: Proof.context -> unit
150 val print_abbrevs: Proof.context -> unit
151 val print_binds: Proof.context -> unit
152 val print_lthms: Proof.context -> unit
153 val print_cases: Proof.context -> unit
154 val debug: bool Config.T
155 val verbose: bool Config.T
156 val pretty_ctxt: Proof.context -> Pretty.T list
157 val pretty_context: Proof.context -> Pretty.T list
160 structure Proof_Context: PROOF_CONTEXT =
163 val theory_of = Proof_Context.theory_of;
164 val init_global = Proof_Context.init_global;
168 (** inner syntax mode **)
172 {stmt: bool, (*inner statement mode*)
173 pattern: bool, (*pattern binding schematic variables*)
174 schematic: bool, (*term referencing loose schematic variables*)
175 abbrev: bool}; (*abbrev mode -- no normalization*)
177 fun make_mode (stmt, pattern, schematic, abbrev) =
178 Mode {stmt = stmt, pattern = pattern, schematic = schematic, abbrev = abbrev};
180 val mode_default = make_mode (false, false, false, false);
181 val mode_stmt = make_mode (true, false, false, false);
182 val mode_pattern = make_mode (false, true, false, false);
183 val mode_schematic = make_mode (false, false, true, false);
184 val mode_abbrev = make_mode (false, false, false, true);
188 (** Isar proof context information **)
192 {mode: mode, (*inner syntax mode*)
193 naming: Name_Space.naming, (*local naming conventions*)
194 syntax: Local_Syntax.T, (*local syntax*)
195 tsig: Type.tsig * Type.tsig, (*local/global type signature -- local name space / defsort only*)
196 consts: Consts.T * Consts.T, (*local/global consts -- local name space / abbrevs only*)
197 facts: Facts.T, (*local facts*)
198 cases: (string * (Rule_Cases.T * bool)) list}; (*named case contexts*)
200 fun make_ctxt (mode, naming, syntax, tsig, consts, facts, cases) =
201 Ctxt {mode = mode, naming = naming, syntax = syntax,
202 tsig = tsig, consts = consts, facts = facts, cases = cases};
204 val local_naming = Name_Space.default_naming |> Name_Space.add_path "local";
206 structure Data = Proof_Data
210 make_ctxt (mode_default, local_naming, Local_Syntax.init thy,
211 (Sign.tsig_of thy, Sign.tsig_of thy),
212 (Sign.consts_of thy, Sign.consts_of thy), Facts.empty, []);
215 fun rep_context ctxt = Data.get ctxt |> (fn Ctxt args => args);
218 Data.map (fn Ctxt {mode, naming, syntax, tsig, consts, facts, cases} =>
219 make_ctxt (f (mode, naming, syntax, tsig, consts, facts, cases)));
221 fun set_mode mode = map_context (fn (_, naming, syntax, tsig, consts, facts, cases) =>
222 (mode, naming, syntax, tsig, consts, facts, cases));
225 map_context (fn (Mode {stmt, pattern, schematic, abbrev}, naming, syntax, tsig, consts, facts, cases) =>
226 (make_mode (f (stmt, pattern, schematic, abbrev)), naming, syntax, tsig, consts, facts, cases));
229 map_context (fn (mode, naming, syntax, tsig, consts, facts, cases) =>
230 (mode, f naming, syntax, tsig, consts, facts, cases));
233 map_context (fn (mode, naming, syntax, tsig, consts, facts, cases) =>
234 (mode, naming, f syntax, tsig, consts, facts, cases));
237 map_context (fn (mode, naming, syntax, tsig, consts, facts, cases) =>
238 (mode, naming, syntax, f tsig, consts, facts, cases));
241 map_context (fn (mode, naming, syntax, tsig, consts, facts, cases) =>
242 (mode, naming, syntax, tsig, f consts, facts, cases));
245 map_context (fn (mode, naming, syntax, tsig, consts, facts, cases) =>
246 (mode, naming, syntax, tsig, consts, f facts, cases));
249 map_context (fn (mode, naming, syntax, tsig, consts, facts, cases) =>
250 (mode, naming, syntax, tsig, consts, facts, f cases));
252 val get_mode = #mode o rep_context;
253 val restore_mode = set_mode o get_mode;
254 val abbrev_mode = get_mode #> (fn Mode {abbrev, ...} => abbrev);
257 map_mode (fn (_, pattern, schematic, abbrev) => (stmt, pattern, schematic, abbrev));
259 val naming_of = #naming o rep_context;
260 val restore_naming = map_naming o K o naming_of
261 val full_name = Name_Space.full_name o naming_of;
263 val syntax_of = #syntax o rep_context;
264 val syn_of = Local_Syntax.syn_of o syntax_of;
265 val set_syntax_mode = map_syntax o Local_Syntax.set_mode;
266 val restore_syntax_mode = map_syntax o Local_Syntax.restore_mode o syntax_of;
268 val tsig_of = #1 o #tsig o rep_context;
269 val set_defsort = map_tsig o apfst o Type.set_defsort;
270 fun default_sort ctxt = the_default (Type.defaultS (tsig_of ctxt)) o Variable.def_sort ctxt;
272 val consts_of = #1 o #consts o rep_context;
273 val the_const_constraint = Consts.the_constraint o consts_of;
275 val facts_of = #facts o rep_context;
276 val cases_of = #cases o rep_context;
281 val class_space = Type.class_space o tsig_of;
282 val type_space = Type.type_space o tsig_of;
283 val const_space = Consts.space_of o consts_of;
285 val intern_class = Name_Space.intern o class_space;
286 val intern_type = Name_Space.intern o type_space;
287 val intern_const = Name_Space.intern o const_space;
289 fun extern_class ctxt = Name_Space.extern ctxt (class_space ctxt);
290 fun extern_type ctxt = Name_Space.extern ctxt (type_space ctxt);
291 fun extern_const ctxt = Name_Space.extern ctxt (const_space ctxt);
294 (* theory transfer *)
296 fun transfer_syntax thy ctxt = ctxt |>
297 map_syntax (Local_Syntax.rebuild thy) |>
298 map_tsig (fn tsig as (local_tsig, global_tsig) =>
299 let val thy_tsig = Sign.tsig_of thy in
300 if Type.eq_tsig (thy_tsig, global_tsig) then tsig
301 else (Type.merge_tsig ctxt (local_tsig, thy_tsig), thy_tsig)
303 map_consts (fn consts as (local_consts, global_consts) =>
304 let val thy_consts = Sign.consts_of thy in
305 if Consts.eq_consts (thy_consts, global_consts) then consts
306 else (Consts.merge (local_consts, thy_consts), thy_consts)
309 fun transfer thy = Context.raw_transfer thy #> transfer_syntax thy;
311 fun background_theory f ctxt = transfer (f (theory_of ctxt)) ctxt;
313 fun background_theory_result f ctxt =
314 let val (res, thy') = f (theory_of ctxt)
315 in (res, ctxt |> transfer thy') end;
319 (** pretty printing **)
323 fun which_facts ctxt name =
325 val local_facts = facts_of ctxt;
326 val global_facts = Global_Theory.facts_of (theory_of ctxt);
328 if is_some (Facts.lookup (Context.Proof ctxt) local_facts name)
329 then local_facts else global_facts
332 fun markup_fact ctxt name = Name_Space.markup (Facts.space_of (which_facts ctxt name)) name;
334 fun extern_fact ctxt name = Facts.extern ctxt (which_facts ctxt name) name;
339 fun pretty_term_abbrev ctxt = Syntax.pretty_term (set_mode mode_abbrev ctxt);
341 fun pretty_fact_name ctxt a =
342 Pretty.block [Pretty.mark_str (markup_fact ctxt a, extern_fact ctxt a), Pretty.str ":"];
344 fun pretty_fact_aux ctxt flag ("", ths) =
345 Display.pretty_thms_aux ctxt flag ths
346 | pretty_fact_aux ctxt flag (a, [th]) = Pretty.block
347 [pretty_fact_name ctxt a, Pretty.brk 1, Display.pretty_thm_aux ctxt flag th]
348 | pretty_fact_aux ctxt flag (a, ths) = Pretty.block
349 (Pretty.fbreaks (pretty_fact_name ctxt a :: map (Display.pretty_thm_aux ctxt flag) ths));
351 fun pretty_fact ctxt = pretty_fact_aux ctxt true;
355 (** prepare types **)
359 fun read_class ctxt text =
361 val tsig = tsig_of ctxt;
362 val (syms, pos) = Syntax.read_token text;
363 val c = Type.cert_class tsig (Type.intern_class tsig (Symbol_Pos.content syms))
364 handle TYPE (msg, _, _) => error (msg ^ Position.str_of pos);
365 val _ = Context_Position.report ctxt pos (Name_Space.markup (Type.class_space tsig) c);
373 fun prep_arity prep_tycon prep_sort ctxt (t, Ss, S) =
374 let val arity = (prep_tycon ctxt t, map (prep_sort ctxt) Ss, prep_sort ctxt S)
375 in Type.add_arity ctxt arity (tsig_of ctxt); arity end;
379 val read_arity = prep_arity intern_type Syntax.read_sort;
380 val cert_arity = prep_arity (K I) (Type.cert_sort o tsig_of);
387 fun read_typ_mode mode ctxt s =
388 Syntax.read_typ (Type.set_mode mode ctxt) s;
390 val read_typ = read_typ_mode Type.mode_default;
391 val read_typ_syntax = read_typ_mode Type.mode_syntax;
392 val read_typ_abbrev = read_typ_mode Type.mode_abbrev;
395 fun cert_typ_mode mode ctxt T =
396 Type.cert_typ_mode mode (tsig_of ctxt) T
397 handle TYPE (msg, _, _) => error msg;
399 val cert_typ = cert_typ_mode Type.mode_default;
400 val cert_typ_syntax = cert_typ_mode Type.mode_syntax;
401 val cert_typ_abbrev = cert_typ_mode Type.mode_abbrev;
405 (** prepare variables **)
407 (* check Skolem constants *)
409 fun no_skolem internal x =
410 if can Name.dest_skolem x then
411 error ("Illegal reference to internal Skolem constant: " ^ quote x)
412 else if not internal andalso can Name.dest_internal x then
413 error ("Illegal reference to internal variable: " ^ quote x)
418 (** prepare terms and propositions **)
420 (* inferred types of parameters *)
422 fun infer_type ctxt x =
423 Term.fastype_of (singleton (Syntax.check_terms (set_mode mode_schematic ctxt)) (Free x));
425 fun inferred_param x ctxt =
426 let val T = infer_type ctxt (x, dummyT)
427 in (T, ctxt |> Variable.declare_term (Free (x, T))) end;
429 fun inferred_fixes ctxt =
431 val xs = map #2 (Variable.dest_fixes ctxt);
432 val (Ts, ctxt') = fold_map inferred_param xs ctxt;
433 in (xs ~~ Ts, ctxt') end;
436 (* type and constant names *)
440 val token_content = Syntax.read_token #>> Symbol_Pos.content;
442 fun prep_const_proper ctxt strict (c, pos) =
444 fun err msg = error (msg ^ Position.str_of pos);
445 val consts = consts_of ctxt;
446 val t as Const (d, _) =
447 (case Variable.lookup_const ctxt c of
449 Const (d, Consts.type_scheme (consts_of ctxt) d handle TYPE (msg, _, _) => err msg)
450 | NONE => Consts.read_const consts (c, pos));
452 if strict then ignore (Consts.the_type consts d) handle TYPE (msg, _, _) => err msg
454 val _ = Context_Position.report ctxt pos (Markup.const d);
455 val _ = Context_Position.report ctxt pos (Name_Space.markup (Consts.space_of consts) d);
460 fun read_type_name ctxt strict text =
462 val tsig = tsig_of ctxt;
463 val (c, pos) = token_content text;
465 if Lexicon.is_tid c then
466 (Context_Position.report ctxt pos Markup.tfree;
467 TFree (c, default_sort ctxt (c, ~1)))
470 val d = intern_type ctxt c;
471 val decl = Type.the_decl tsig (d, pos);
472 fun err () = error ("Bad type name: " ^ quote d ^ Position.str_of pos);
475 Type.LogicalType n => n
476 | Type.Abbreviation (vs, _, _) => if strict then err () else length vs
477 | Type.Nonterminal => if strict then err () else 0);
478 val _ = Context_Position.report ctxt pos (Markup.tycon d);
479 val _ = Context_Position.report ctxt pos (Name_Space.markup (Type.type_space tsig) d);
480 in Type (d, replicate args dummyT) end
483 fun read_type_name_proper ctxt strict text =
484 (case read_type_name ctxt strict text of
486 | T => error ("Not a type constructor: " ^ Syntax.string_of_typ ctxt T));
489 fun read_const_proper ctxt strict = prep_const_proper ctxt strict o token_content;
491 fun read_const ctxt strict ty text =
493 val (c, pos) = token_content text;
494 val _ = no_skolem false c;
496 (case (Variable.lookup_fixed ctxt c, Variable.is_const ctxt c) of
498 (Context_Position.report ctxt pos
499 (Markup.name x (if can Name.dest_skolem x then Markup.skolem else Markup.free));
500 Free (x, infer_type ctxt (x, ty)))
501 | _ => prep_const_proper ctxt strict (c, pos))
507 (* skolem variables *)
509 fun intern_skolem ctxt x =
511 val _ = no_skolem false x;
512 val sko = Variable.lookup_fixed ctxt x;
513 val is_const = can (read_const_proper ctxt false) x orelse Long_Name.is_qualified x;
514 val is_declared = is_some (Variable.def_type ctxt false (x, ~1));
516 if Variable.is_const ctxt x then NONE
517 else if is_some sko then sko
518 else if not is_const orelse is_declared then SOME x
525 fun read_term_mode mode ctxt = Syntax.read_term (set_mode mode ctxt);
527 val read_term_pattern = read_term_mode mode_pattern;
528 val read_term_schematic = read_term_mode mode_schematic;
529 val read_term_abbrev = read_term_mode mode_abbrev;
532 (* local abbreviations *)
536 fun certify_consts ctxt = Consts.certify (Context.pretty ctxt) (tsig_of ctxt)
537 (not (abbrev_mode ctxt)) (consts_of ctxt);
539 fun expand_binds ctxt =
541 val Mode {pattern, schematic, ...} = get_mode ctxt;
543 fun reject_schematic (t as Var _) =
544 error ("Unbound schematic variable: " ^ Syntax.string_of_term ctxt t)
545 | reject_schematic (Abs (_, _, t)) = reject_schematic t
546 | reject_schematic (t $ u) = (reject_schematic t; reject_schematic u)
547 | reject_schematic _ = ();
550 else Variable.expand_binds ctxt #> (if schematic then I else tap reject_schematic)
555 fun expand_abbrevs ctxt = certify_consts ctxt #> expand_binds ctxt;
559 val show_abbrevs_raw = Config.declare "show_abbrevs" (fn _ => Config.Bool true);
560 val show_abbrevs = Config.bool show_abbrevs_raw;
562 fun contract_abbrevs ctxt t =
564 val thy = theory_of ctxt;
565 val consts = consts_of ctxt;
566 val Mode {abbrev, ...} = get_mode ctxt;
567 val retrieve = Consts.retrieve_abbrevs consts (print_mode_value () @ [""]);
568 fun match_abbrev u = Option.map #1 (get_first (Pattern.match_rew thy u) (retrieve u));
570 if abbrev orelse not (Config.get ctxt show_abbrevs) orelse not (can Term.type_of t) then t
571 else Pattern.rewrite_term_top thy [] [match_abbrev] t
577 fun prepare_patternT ctxt T =
579 val Mode {pattern, schematic, ...} = get_mode ctxt;
581 pattern orelse schematic orelse
582 T |> Term.exists_subtype
583 (fn T as TVar (xi, _) =>
584 not (Type_Infer.is_param xi) andalso
585 error ("Illegal schematic type variable: " ^ Syntax.string_of_typ ctxt T)
592 val dummies = Config.bool (Config.declare "Proof_Context.dummies" (K (Config.Bool false)));
594 fun check_dummies ctxt t =
595 if Config.get ctxt dummies then t
596 else Term.no_dummy_patterns t handle TERM _ => error "Illegal dummy pattern(s) in term";
598 fun prepare_dummies ts = #1 (fold_map Term.replace_dummy_patterns ts 1);
602 val allow_dummies = Config.put dummies true;
604 fun prepare_patterns ctxt =
605 let val Mode {pattern, ...} = get_mode ctxt in
606 Type_Infer.fixate ctxt #>
607 pattern ? Variable.polymorphic ctxt #>
608 (map o Term.map_types) (prepare_patternT ctxt) #>
609 (if pattern then prepare_dummies else map (check_dummies ctxt))
615 (* sort constraints *)
617 fun get_sort ctxt raw_text =
619 val tsig = tsig_of ctxt;
621 val text = distinct (op =) (map (apsnd (Type.minimize_sort tsig)) raw_text);
623 (case duplicates (eq_fst (op =)) text of
625 | dups => error ("Inconsistent sort constraints for type variable(s) "
626 ^ commas_quote (map (Term.string_of_vname' o fst) dups)));
629 (case AList.lookup (op =) text xi of
631 | SOME S => if S = dummyS then NONE else SOME S);
634 (case (lookup xi, Variable.def_sort ctxt xi) of
635 (NONE, NONE) => Type.defaultS tsig
636 | (NONE, SOME S) => S
637 | (SOME S, NONE) => S
638 | (SOME S, SOME S') =>
639 if Type.eq_sort tsig (S, S') then S'
640 else error ("Sort constraint " ^ Syntax.string_of_sort ctxt S ^
641 " inconsistent with default " ^ Syntax.string_of_sort ctxt S' ^
642 " for type variable " ^ quote (Term.string_of_vname' xi)));
645 fun check_tvar ctxt (xi, S) = (xi, get_sort ctxt [(xi, S)] xi);
646 fun check_tfree ctxt (x, S) = apfst fst (check_tvar ctxt ((x, ~1), S));
653 fun gen_cert prop ctxt t =
655 |> expand_abbrevs ctxt
657 #1 (Sign.certify' prop (Context.pretty ctxt) false (consts_of ctxt) (theory_of ctxt) t')
658 handle TYPE (msg, _, _) => error msg | TERM (msg, _) => error msg);
662 val cert_term = gen_cert false;
663 val cert_prop = gen_cert true;
671 let val Mode {pattern, ...} = get_mode ctxt
672 in Variable.def_type ctxt pattern end;
676 fun standard_typ_check ctxt =
677 map (cert_typ_mode (Type.get_mode ctxt) ctxt) #>
678 map (prepare_patternT ctxt);
680 fun standard_term_uncheck ctxt =
681 map (contract_abbrevs ctxt);
686 (Syntax.add_typ_check 0 "standard" standard_typ_check #>
687 Syntax.add_term_check 100 "fixate" prepare_patterns #>
688 Syntax.add_term_uncheck 0 "standard" standard_term_uncheck);
694 (** export results **)
696 fun common_export is_goal inner outer =
697 map (Assumption.export is_goal inner outer) #>
698 Variable.export inner outer;
700 val goal_export = common_export true;
701 val export = common_export false;
703 fun export_morphism inner outer =
704 Assumption.export_morphism inner outer $>
705 Variable.export_morphism inner outer;
707 fun norm_export_morphism inner outer =
708 export_morphism inner outer $>
709 Morphism.thm_morphism Goal.norm_result;
713 (** term bindings **)
717 fun simult_matches ctxt (t, pats) =
718 (case Seq.pull (Unify.matchers (theory_of ctxt) (map (rpair t) pats)) of
719 NONE => error "Pattern match failed!"
720 | SOME (env, _) => Vartab.fold (fn (v, (_, t)) => cons (v, t)) (Envir.term_env env) []);
725 val bind_terms = fold (fn (xi, t) => fn ctxt =>
727 |> Variable.bind_term (xi, Option.map (cert_term (set_mode mode_default ctxt)) t));
732 fun drop_schematic (b as (xi, SOME t)) = if Term.exists_subterm is_Var t then (xi, NONE) else b
733 | drop_schematic b = b;
735 fun auto_bind f ts ctxt = ctxt |> bind_terms (map drop_schematic (f (theory_of ctxt) ts));
737 val auto_bind_goal = auto_bind Auto_Bind.goal;
738 val auto_bind_facts = auto_bind Auto_Bind.facts;
745 fun gen_bind prep_terms gen raw_binds ctxt =
747 fun prep_bind (raw_pats, t) ctxt1 =
749 val T = Term.fastype_of t;
750 val ctxt2 = Variable.declare_term t ctxt1;
751 val pats = prep_terms (set_mode mode_pattern ctxt2) T raw_pats;
752 val binds = simult_matches ctxt2 (t, pats);
753 in (binds, ctxt2) end;
755 val ts = prep_terms ctxt dummyT (map snd raw_binds);
756 val (binds, ctxt') = apfst flat (fold_map prep_bind (map fst raw_binds ~~ ts) ctxt);
758 if gen then map #1 binds ~~ Variable.exportT_terms ctxt' ctxt (map #2 binds)
760 val binds'' = map (apsnd SOME) binds';
762 tap (Variable.warn_extra_tfrees ctxt)
764 ctxt (*sic!*) |> fold Variable.declare_term (map #2 binds') |> bind_terms binds''
765 else ctxt' |> bind_terms binds'');
770 fun read_terms ctxt T =
771 map (Syntax.parse_term ctxt #> Type.constraint T) #> Syntax.check_terms ctxt;
773 val match_bind = gen_bind read_terms;
774 val match_bind_i = gen_bind (fn ctxt => fn _ => map (cert_term ctxt));
779 (* propositions with patterns *)
783 fun prep_propp mode prep_props (context, args) =
785 fun prep (_, raw_pats) (ctxt, prop :: props) =
786 let val ctxt' = Variable.declare_term prop ctxt
787 in ((prop, prep_props (set_mode mode_pattern ctxt') raw_pats), (ctxt', props)) end;
789 val (propp, (context', _)) = (fold_map o fold_map) prep args
790 (context, prep_props (set_mode mode context) (maps (map fst) args));
791 in (context', propp) end;
793 fun gen_bind_propp mode parse_prop (ctxt, raw_args) =
795 val (ctxt', args) = prep_propp mode parse_prop (ctxt, raw_args);
796 val binds = flat (flat (map (map (simult_matches ctxt')) args));
797 val propss = map (map #1) args;
799 (*generalize result: context evaluated now, binds added later*)
800 val gen = Variable.exportT_terms ctxt' ctxt;
801 fun gen_binds c = c |> bind_terms (map #1 binds ~~ map SOME (gen (map #2 binds)));
802 in (ctxt' |> bind_terms (map (apsnd SOME) binds), (propss, gen_binds)) end;
806 val read_propp = prep_propp mode_default Syntax.read_props;
807 val cert_propp = prep_propp mode_default (map o cert_prop);
808 val read_propp_schematic = prep_propp mode_schematic Syntax.read_props;
809 val cert_propp_schematic = prep_propp mode_schematic (map o cert_prop);
811 val bind_propp = gen_bind_propp mode_default Syntax.read_props;
812 val bind_propp_i = gen_bind_propp mode_default (map o cert_prop);
813 val bind_propp_schematic = gen_bind_propp mode_schematic Syntax.read_props;
814 val bind_propp_schematic_i = gen_bind_propp mode_schematic (map o cert_prop);
824 fun comp_incr_tac [] _ = no_tac
825 | comp_incr_tac (th :: ths) i =
826 (fn st => Goal.compose_hhf_tac (Drule.incr_indexes st th) i st) APPEND comp_incr_tac ths i;
828 fun fact_tac facts = Goal.norm_hhf_tac THEN' comp_incr_tac facts;
830 fun potential_facts ctxt prop =
831 Facts.could_unify (facts_of ctxt) (Term.strip_all_body prop);
833 fun some_fact_tac ctxt = SUBGOAL (fn (goal, i) => fact_tac (potential_facts ctxt goal) i);
840 fun retrieve_thms pick ctxt (Facts.Fact s) =
842 val (_, pos) = Syntax.read_token s;
844 Syntax.read_prop (ctxt |> set_mode mode_default |> allow_dummies) s
845 |> singleton (Variable.polymorphic ctxt);
846 fun err msg = error (msg ^ Position.str_of pos ^ ":\n" ^ Syntax.string_of_term ctxt prop);
848 val (prop', _) = Term.replace_dummy_patterns prop (Variable.maxidx_of ctxt + 1);
850 Goal.prove ctxt [] [] prop' (K (ALLGOALS (fact_tac [th])));
851 val results = map_filter (try prove_fact) (potential_facts ctxt prop');
853 (case distinct Thm.eq_thm_prop results of
855 | [] => err "Failed to retrieve literal fact"
856 | _ => err "Ambiguous specification of literal fact");
858 | retrieve_thms pick ctxt xthmref =
860 val thy = theory_of ctxt;
861 val local_facts = facts_of ctxt;
862 val thmref = Facts.map_name_of_ref (Facts.intern local_facts) xthmref;
863 val name = Facts.name_of_ref thmref;
864 val pos = Facts.pos_of_ref xthmref;
866 if name = "" then [Thm.transfer thy Drule.dummy_thm]
868 (case Facts.lookup (Context.Proof ctxt) local_facts name of
870 (Context_Position.report ctxt pos
871 (Name_Space.markup (Facts.space_of local_facts) name);
872 map (Thm.transfer thy) (Facts.select thmref ths))
873 | NONE => Global_Theory.get_fact (Context.Proof ctxt) thy xthmref);
874 in pick name thms end;
878 val get_fact = retrieve_thms (K I);
879 val get_fact_single = retrieve_thms Facts.the_single;
881 fun get_thms ctxt = get_fact ctxt o Facts.named;
882 fun get_thm ctxt = get_fact_single ctxt o Facts.named;
891 fun update_thms _ (b, NONE) ctxt = ctxt |> map_facts (Facts.del (full_name ctxt b))
892 | update_thms do_props (b, SOME ths) ctxt = ctxt |> map_facts
893 (Facts.add_local ctxt do_props (naming_of ctxt) (b, ths) #> snd);
897 fun note_thmss kind = fold_map (fn ((b, more_attrs), raw_facts) => fn ctxt =>
899 val name = full_name ctxt b;
900 val facts = Global_Theory.name_thmss false name raw_facts;
901 fun app (th, attrs) x =
902 swap (Library.foldl_map
903 (Thm.proof_attributes (surround (Thm.kind kind) (attrs @ more_attrs))) (x, th));
904 val (res, ctxt') = fold_map app facts ctxt;
905 val thms = Global_Theory.name_thms false false name (flat res);
906 val Mode {stmt, ...} = get_mode ctxt;
907 in ((name, thms), ctxt' |> update_thms stmt (b, SOME thms)) end);
909 fun put_thms do_props thms ctxt = ctxt
910 |> map_naming (K local_naming)
911 |> Context_Position.set_visible false
912 |> update_thms do_props (apfst Binding.name thms)
913 |> Context_Position.restore_visible ctxt
914 |> restore_naming ctxt;
920 (** basic logical entities **)
924 fun declare_var (x, opt_T, mx) ctxt =
925 let val T = (case opt_T of SOME T => T | NONE => Mixfix.mixfixT mx)
926 in ((x, T, mx), ctxt |> Variable.declare_constraints (Free (x, T))) end;
930 fun prep_vars prep_typ internal =
931 fold_map (fn (b, raw_T, mx) => fn ctxt =>
933 val x = Variable.check_name b;
934 val _ = Lexicon.is_identifier (no_skolem internal x) orelse
935 error ("Illegal variable name: " ^ Binding.print b);
939 else Type.no_tvars T handle TYPE (msg, _, _) => error msg;
940 val opt_T = Option.map (cond_tvars o cert_typ ctxt o prep_typ ctxt) raw_T;
941 val (_, ctxt') = ctxt |> declare_var (x, opt_T, mx);
942 in ((b, opt_T, mx), ctxt') end);
946 val read_vars = prep_vars Syntax.parse_typ false;
947 val cert_vars = prep_vars (K I) true;
956 fun type_syntax (Type (c, args), mx) =
957 SOME (Local_Syntax.Type, (Lexicon.mark_type c, Mixfix.make_type (length args), mx))
958 | type_syntax _ = NONE;
960 fun const_syntax _ (Free (x, T), mx) = SOME (Local_Syntax.Fixed, (x, T, mx))
961 | const_syntax ctxt (Const (c, _), mx) =
962 (case try (Consts.type_scheme (consts_of ctxt)) c of
963 SOME T => SOME (Local_Syntax.Const, (Lexicon.mark_const c, T, mx))
965 | const_syntax _ _ = NONE;
967 fun gen_notation syntax add mode args ctxt =
969 (Local_Syntax.update_modesyntax (theory_of ctxt) add mode (map_filter (syntax ctxt) args));
973 val type_notation = gen_notation (K type_syntax);
974 val notation = gen_notation const_syntax;
976 fun target_type_notation add mode args phi =
978 val args' = args |> map_filter (fn (T, mx) =>
980 val T' = Morphism.typ phi T;
981 val similar = (case (T, T') of (Type (c, _), Type (c', _)) => c = c' | _ => false);
982 in if similar then SOME (T', mx) else NONE end);
983 in Context.mapping (Sign.type_notation add mode args') (type_notation add mode args') end;
985 fun target_notation add mode args phi =
987 val args' = args |> map_filter (fn (t, mx) =>
988 let val t' = Morphism.term phi t
989 in if Term.aconv_untyped (t, t') then SOME (t', mx) else NONE end);
990 in Context.mapping (Sign.notation add mode args') (notation add mode args') end;
997 fun class_alias b c ctxt = (map_tsig o apfst) (Type.class_alias (naming_of ctxt) b c) ctxt;
998 fun type_alias b c ctxt = (map_tsig o apfst) (Type.type_alias (naming_of ctxt) b c) ctxt;
999 fun const_alias b c ctxt = (map_consts o apfst) (Consts.alias (naming_of ctxt) b c) ctxt;
1002 (* local constants *)
1004 fun add_const_constraint (c, opt_T) ctxt =
1007 let val T = cert_typ ctxt raw_T
1008 in cert_term ctxt (Const (c, T)); T end;
1009 in ctxt |> (map_consts o apfst) (Consts.constrain (c, Option.map prepT opt_T)) end;
1011 fun add_abbrev mode (b, raw_t) ctxt =
1013 val t0 = cert_term (ctxt |> set_mode mode_abbrev) raw_t
1014 handle ERROR msg => cat_error msg ("in constant abbreviation " ^ Binding.print b);
1015 val [t] = Variable.exportT_terms (Variable.declare_term t0 ctxt) ctxt [t0];
1016 val ((lhs, rhs), consts') = consts_of ctxt
1017 |> Consts.abbreviate ctxt (tsig_of ctxt) (naming_of ctxt) mode (b, t);
1020 |> (map_consts o apfst) (K consts')
1021 |> Variable.declare_term rhs
1025 fun revert_abbrev mode c = (map_consts o apfst) (Consts.revert_abbrev mode c);
1030 fun add_fixes raw_vars ctxt =
1032 val thy = theory_of ctxt;
1033 val vars = #1 (cert_vars raw_vars ctxt);
1036 |> Variable.add_fixes_binding (map #1 vars)
1038 fold_map declare_var (map2 (fn x => fn (_, T, mx) => (x, T, mx)) xs vars)
1039 #-> (map_syntax o Local_Syntax.add_syntax thy o map (pair Local_Syntax.Fixed))
1043 fun auto_fixes (ctxt, (propss, x)) =
1044 ((fold o fold) Variable.auto_fixes propss ctxt, (propss, x));
1052 fun gen_assms prepp exp args ctxt =
1054 val cert = Thm.cterm_of (theory_of ctxt);
1055 val (propss, ctxt1) = swap (prepp (ctxt, map snd args));
1056 val _ = Variable.warn_extra_tfrees ctxt ctxt1;
1057 val (premss, ctxt2) = fold_burrow (Assumption.add_assms exp o map cert) propss ctxt1;
1060 |> auto_bind_facts (flat propss)
1061 |> note_thmss "" (map fst args ~~ map (map (fn th => ([th], []))) premss)
1066 val add_assms = gen_assms (apsnd #1 o bind_propp);
1067 val add_assms_i = gen_assms (apsnd #1 o bind_propp_i);
1077 fun rem_case name = remove (fn (x: string, (y, _)) => x = y) name;
1079 fun add_case _ ("", _) cases = cases
1080 | add_case _ (name, NONE) cases = rem_case name cases
1081 | add_case is_proper (name, SOME c) cases = (name, (c, is_proper)) :: rem_case name cases;
1083 fun prep_case name fxs c =
1085 fun replace (opt_x :: xs) ((y, T) :: ys) = (the_default y opt_x, T) :: replace xs ys
1086 | replace [] ys = ys
1087 | replace (_ :: _) [] = error ("Too many parameters for case " ^ quote name);
1088 val Rule_Cases.Case {fixes, assumes, binds, cases} = c;
1089 val fixes' = replace fxs fixes;
1090 val binds' = map drop_schematic binds;
1092 if null (fold (Term.add_tvarsT o snd) fixes []) andalso
1093 null (fold (fold Term.add_vars o snd) assumes []) then
1094 Rule_Cases.Case {fixes = fixes', assumes = assumes, binds = binds', cases = cases}
1095 else error ("Illegal schematic variable(s) in case " ^ quote name)
1098 fun fix (b, T) ctxt =
1099 let val ([x], ctxt') = add_fixes [(b, SOME T, NoSyn)] ctxt
1100 in (Free (x, T), ctxt') end;
1104 fun add_cases is_proper = map_cases o fold (add_case is_proper);
1106 fun case_result c ctxt =
1108 val Rule_Cases.Case {fixes, ...} = c;
1109 val (ts, ctxt') = ctxt |> fold_map fix fixes;
1110 val Rule_Cases.Case {assumes, binds, cases, ...} = Rule_Cases.apply ts c;
1113 |> bind_terms (map drop_schematic binds)
1114 |> add_cases true (map (apsnd SOME) cases)
1115 |> pair (assumes, (binds, cases))
1118 val apply_case = apfst fst oo case_result;
1120 fun get_case ctxt name xs =
1121 (case AList.lookup (op =) (cases_of ctxt) name of
1122 NONE => error ("Unknown case: " ^ quote name)
1123 | SOME (c, _) => prep_case name xs c);
1129 (** print context information **)
1133 val print_syntax = Syntax.print_syntax o syn_of;
1138 fun pretty_abbrevs show_globals ctxt =
1140 val ((space, consts), (_, globals)) =
1141 pairself (#constants o Consts.dest) (#consts (rep_context ctxt));
1142 fun add_abbr (_, (_, NONE)) = I
1143 | add_abbr (c, (T, SOME t)) =
1144 if not show_globals andalso Symtab.defined globals c then I
1145 else cons (c, Logic.mk_equals (Const (c, T), t));
1147 Name_Space.extern_table ctxt (space, Symtab.make (Symtab.fold add_abbr consts []));
1149 if null abbrevs then []
1150 else [Pretty.big_list "abbreviations:" (map (pretty_term_abbrev ctxt o #2) abbrevs)]
1153 val print_abbrevs = Pretty.writeln o Pretty.chunks o pretty_abbrevs true;
1158 fun pretty_binds ctxt =
1160 val binds = Variable.binds_of ctxt;
1161 fun prt_bind (xi, (T, t)) = pretty_term_abbrev ctxt (Logic.mk_equals (Var (xi, T), t));
1163 if Vartab.is_empty binds then []
1164 else [Pretty.big_list "term bindings:" (map prt_bind (Vartab.dest binds))]
1167 val print_binds = Pretty.writeln o Pretty.chunks o pretty_binds;
1170 (* local theorems *)
1172 fun pretty_lthms ctxt =
1174 val local_facts = facts_of ctxt;
1175 val props = Facts.props local_facts;
1177 (if null props then [] else [("<unnamed>", props)]) @
1178 Facts.dest_static [] local_facts;
1180 if null facts then []
1181 else [Pretty.big_list "facts:" (map #1 (sort_wrt (#1 o #2) (map (`(pretty_fact ctxt)) facts)))]
1184 val print_lthms = Pretty.writeln o Pretty.chunks o pretty_lthms;
1187 (* local contexts *)
1191 fun pretty_case (name, (fixes, ((asms, (lets, cs)), ctxt))) =
1193 val prt_term = Syntax.pretty_term ctxt;
1195 fun prt_let (xi, t) = Pretty.block
1196 [Pretty.quote (prt_term (Var (xi, Term.fastype_of t))), Pretty.str " =", Pretty.brk 1,
1197 Pretty.quote (prt_term t)];
1199 fun prt_asm (a, ts) = Pretty.block (Pretty.breaks
1200 ((if a = "" then [] else [Pretty.str (a ^ ":")]) @ map (Pretty.quote o prt_term) ts));
1202 fun prt_sect _ _ _ [] = []
1203 | prt_sect s sep prt xs =
1204 [Pretty.block (Pretty.breaks (Pretty.str s ::
1205 flat (separate sep (map (single o prt) xs))))];
1207 Pretty.block (Pretty.fbreaks
1208 (Pretty.str (name ^ ":") ::
1209 prt_sect "fix" [] (Pretty.str o Binding.name_of o fst) fixes @
1210 prt_sect "let" [Pretty.str "and"] prt_let
1211 (map_filter (fn (xi, SOME t) => SOME (xi, t) | _ => NONE) lets) @
1212 (if forall (null o #2) asms then []
1213 else prt_sect "assume" [Pretty.str "and"] prt_asm asms) @
1214 prt_sect "subcases:" [] (Pretty.str o fst) cs))
1219 fun pretty_cases ctxt =
1221 fun add_case (_, (_, false)) = I
1222 | add_case (name, (c as Rule_Cases.Case {fixes, ...}, true)) =
1223 cons (name, (fixes, case_result c ctxt));
1224 val cases = fold add_case (cases_of ctxt) [];
1226 if null cases then []
1227 else [Pretty.big_list "cases:" (map pretty_case cases)]
1230 val print_cases = Pretty.writeln o Pretty.chunks o pretty_cases;
1237 val debug = Config.bool (Config.declare "Proof_Context.debug" (K (Config.Bool false)));
1238 val verbose = Config.bool (Config.declare "Proof_Context.verbose" (K (Config.Bool false)));
1240 fun pretty_ctxt ctxt =
1241 if not (Config.get ctxt debug) then []
1244 val prt_term = Syntax.pretty_term ctxt;
1247 val {structs, ...} = Local_Syntax.idents_of (syntax_of ctxt);
1249 if null structs then []
1250 else [Pretty.block (Pretty.str "structures:" :: Pretty.brk 1 ::
1251 Pretty.commas (map Pretty.str structs))];
1254 fun prt_fix (x, x') =
1255 if x = x' then Pretty.str x
1256 else Pretty.block [Pretty.str x, Pretty.str " =", Pretty.brk 1, prt_term (Syntax.free x')];
1258 filter_out ((can Name.dest_internal orf member (op =) structs) o #1)
1259 (Variable.dest_fixes ctxt);
1261 if null fixes then []
1262 else [Pretty.block (Pretty.str "fixed variables:" :: Pretty.brk 1 ::
1263 Pretty.commas (map prt_fix fixes))];
1266 val prems = Assumption.all_prems_of ctxt;
1268 if null prems then []
1269 else [Pretty.big_list "prems:" (map (Display.pretty_thm ctxt) prems)];
1270 in prt_structs @ prt_fixes @ prt_prems end;
1275 fun pretty_context ctxt =
1277 val verbose = Config.get ctxt verbose;
1278 fun verb f x = if verbose then f (x ()) else [];
1280 val prt_term = Syntax.pretty_term ctxt;
1281 val prt_typ = Syntax.pretty_typ ctxt;
1282 val prt_sort = Syntax.pretty_sort ctxt;
1285 val pretty_thy = Pretty.block
1286 [Pretty.str "theory:", Pretty.brk 1, Context.pretty_thy (theory_of ctxt)];
1289 fun prt_atom prt prtT (x, X) = Pretty.block
1290 [prt x, Pretty.str " ::", Pretty.brk 1, prtT X];
1292 fun prt_var (x, ~1) = prt_term (Syntax.free x)
1293 | prt_var xi = prt_term (Syntax.var xi);
1295 fun prt_varT (x, ~1) = prt_typ (TFree (x, []))
1296 | prt_varT xi = prt_typ (TVar (xi, []));
1298 val prt_defT = prt_atom prt_var prt_typ;
1299 val prt_defS = prt_atom prt_varT prt_sort;
1301 val (types, sorts) = Variable.constraints_of ctxt;
1303 verb single (K pretty_thy) @
1305 verb (pretty_abbrevs false) (K ctxt) @
1306 verb pretty_binds (K ctxt) @
1307 verb pretty_lthms (K ctxt) @
1308 verb pretty_cases (K ctxt) @
1309 verb single (fn () => Pretty.big_list "type constraints:" (map prt_defT (Vartab.dest types))) @
1310 verb single (fn () => Pretty.big_list "default sorts:" (map prt_defS (Vartab.dest sorts)))
1315 val show_abbrevs = Proof_Context.show_abbrevs;