renamed NameSpace to Name_Space -- also to emphasize its subtle change in semantics;
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: 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 naming_of: Proof.context -> Name_Space.naming
25 val full_name: Proof.context -> binding -> string
26 val consts_of: Proof.context -> Consts.T
27 val const_syntax_name: Proof.context -> string -> string
28 val the_const_constraint: Proof.context -> string -> typ
29 val mk_const: Proof.context -> string * typ list -> term
30 val set_syntax_mode: Syntax.mode -> Proof.context -> Proof.context
31 val restore_syntax_mode: Proof.context -> Proof.context -> Proof.context
32 val facts_of: Proof.context -> Facts.T
33 val transfer_syntax: theory -> Proof.context -> Proof.context
34 val transfer: theory -> Proof.context -> Proof.context
35 val theory: (theory -> theory) -> Proof.context -> Proof.context
36 val theory_result: (theory -> 'a * theory) -> Proof.context -> 'a * Proof.context
37 val extern_fact: Proof.context -> string -> xstring
38 val pretty_term_abbrev: Proof.context -> term -> Pretty.T
39 val pretty_fact_aux: Proof.context -> bool -> string * thm list -> Pretty.T
40 val pretty_fact: Proof.context -> string * thm list -> Pretty.T
41 val read_typ: Proof.context -> string -> typ
42 val read_typ_syntax: Proof.context -> string -> typ
43 val read_typ_abbrev: Proof.context -> string -> typ
44 val cert_typ: Proof.context -> typ -> typ
45 val cert_typ_syntax: Proof.context -> typ -> typ
46 val cert_typ_abbrev: Proof.context -> typ -> typ
47 val get_skolem: Proof.context -> string -> string
48 val revert_skolem: Proof.context -> string -> string
49 val infer_type: Proof.context -> string -> typ
50 val inferred_param: string -> Proof.context -> typ * Proof.context
51 val inferred_fixes: Proof.context -> (string * typ) list * Proof.context
52 val read_tyname: Proof.context -> string -> typ
53 val read_const_proper: Proof.context -> string -> term
54 val read_const: Proof.context -> string -> term
55 val allow_dummies: Proof.context -> Proof.context
56 val decode_term: Proof.context -> term -> term
57 val standard_infer_types: Proof.context -> term list -> term list
58 val read_term_pattern: Proof.context -> string -> term
59 val read_term_schematic: Proof.context -> string -> term
60 val read_term_abbrev: Proof.context -> string -> term
61 val expand_abbrevs: Proof.context -> term -> term
62 val cert_term: Proof.context -> term -> term
63 val cert_prop: Proof.context -> term -> term
64 val goal_export: Proof.context -> Proof.context -> thm list -> thm list
65 val export: Proof.context -> Proof.context -> thm list -> thm list
66 val export_morphism: Proof.context -> Proof.context -> morphism
67 val norm_export_morphism: Proof.context -> Proof.context -> morphism
68 val bind_terms: (indexname * term option) list -> Proof.context -> Proof.context
69 val auto_bind_goal: term list -> Proof.context -> Proof.context
70 val auto_bind_facts: term list -> Proof.context -> Proof.context
71 val match_bind: bool -> (string list * string) list -> Proof.context -> term list * Proof.context
72 val match_bind_i: bool -> (term list * term) list -> Proof.context -> term list * Proof.context
73 val read_propp: Proof.context * (string * string list) list list
74 -> Proof.context * (term * term list) list list
75 val cert_propp: Proof.context * (term * term list) list list
76 -> Proof.context * (term * term list) list list
77 val read_propp_schematic: Proof.context * (string * string list) list list
78 -> Proof.context * (term * term list) list list
79 val cert_propp_schematic: Proof.context * (term * term list) list list
80 -> Proof.context * (term * term list) list list
81 val bind_propp: Proof.context * (string * string list) list list
82 -> Proof.context * (term list list * (Proof.context -> Proof.context))
83 val bind_propp_i: Proof.context * (term * term list) list list
84 -> Proof.context * (term list list * (Proof.context -> Proof.context))
85 val bind_propp_schematic: Proof.context * (string * string list) list list
86 -> Proof.context * (term list list * (Proof.context -> Proof.context))
87 val bind_propp_schematic_i: Proof.context * (term * term list) list list
88 -> Proof.context * (term list list * (Proof.context -> Proof.context))
89 val fact_tac: thm list -> int -> tactic
90 val some_fact_tac: Proof.context -> int -> tactic
91 val get_fact: Proof.context -> Facts.ref -> thm list
92 val get_fact_single: Proof.context -> Facts.ref -> thm
93 val get_thms: Proof.context -> xstring -> thm list
94 val get_thm: Proof.context -> xstring -> thm
95 val add_path: string -> Proof.context -> Proof.context
96 val mandatory_path: string -> Proof.context -> Proof.context
97 val restore_naming: Proof.context -> Proof.context -> Proof.context
98 val reset_naming: Proof.context -> Proof.context
99 val note_thmss: string -> (Thm.binding * (thm list * attribute list) list) list ->
100 Proof.context -> (string * thm list) list * Proof.context
101 val put_thms: bool -> string * thm list option -> Proof.context -> Proof.context
102 val read_vars: (binding * string option * mixfix) list -> Proof.context ->
103 (binding * typ option * mixfix) list * Proof.context
104 val cert_vars: (binding * typ option * mixfix) list -> Proof.context ->
105 (binding * typ option * mixfix) list * Proof.context
106 val add_fixes: (binding * typ option * mixfix) list -> Proof.context ->
107 string list * Proof.context
108 val auto_fixes: Proof.context * (term list list * 'a) -> Proof.context * (term list list * 'a)
109 val bind_fixes: string list -> Proof.context -> (term -> term) * Proof.context
110 val add_assms: Assumption.export ->
111 (Thm.binding * (string * string list) list) list ->
112 Proof.context -> (string * thm list) list * Proof.context
113 val add_assms_i: Assumption.export ->
114 (Thm.binding * (term * term list) list) list ->
115 Proof.context -> (string * thm list) list * Proof.context
116 val add_cases: bool -> (string * RuleCases.T option) list -> Proof.context -> Proof.context
117 val apply_case: RuleCases.T -> Proof.context -> (string * term list) list * Proof.context
118 val get_case: Proof.context -> string -> string option list -> RuleCases.T
119 val notation: bool -> Syntax.mode -> (term * mixfix) list -> Proof.context -> Proof.context
120 val target_notation: bool -> Syntax.mode -> (term * mixfix) list -> morphism ->
121 Context.generic -> Context.generic
122 val add_const_constraint: string * typ option -> Proof.context -> Proof.context
123 val add_abbrev: string -> Properties.T ->
124 binding * term -> Proof.context -> (term * term) * Proof.context
125 val revert_abbrev: string -> string -> Proof.context -> Proof.context
126 val verbose: bool Unsynchronized.ref
127 val setmp_verbose: ('a -> 'b) -> 'a -> 'b
128 val print_syntax: Proof.context -> unit
129 val print_abbrevs: Proof.context -> unit
130 val print_binds: Proof.context -> unit
131 val print_lthms: Proof.context -> unit
132 val print_cases: Proof.context -> unit
133 val debug: bool Unsynchronized.ref
134 val prems_limit: int Unsynchronized.ref
135 val pretty_ctxt: Proof.context -> Pretty.T list
136 val pretty_context: Proof.context -> Pretty.T list
137 val query_type: Proof.context -> string -> Properties.T
138 val query_const: Proof.context -> string -> Properties.T
139 val query_class: Proof.context -> string -> Properties.T
142 structure ProofContext: PROOF_CONTEXT =
148 (** inner syntax mode **)
152 {stmt: bool, (*inner statement mode*)
153 pattern: bool, (*pattern binding schematic variables*)
154 schematic: bool, (*term referencing loose schematic variables*)
155 abbrev: bool}; (*abbrev mode -- no normalization*)
157 fun make_mode (stmt, pattern, schematic, abbrev) =
158 Mode {stmt = stmt, pattern = pattern, schematic = schematic, abbrev = abbrev};
160 val mode_default = make_mode (false, false, false, false);
161 val mode_stmt = make_mode (true, false, false, false);
162 val mode_pattern = make_mode (false, true, false, false);
163 val mode_schematic = make_mode (false, false, true, false);
164 val mode_abbrev = make_mode (false, false, false, true);
168 (** Isar proof context information **)
172 {mode: mode, (*inner syntax mode*)
173 naming: Name_Space.naming, (*local naming conventions*)
174 syntax: LocalSyntax.T, (*local syntax*)
175 consts: Consts.T * Consts.T, (*local/global consts*)
176 facts: Facts.T, (*local facts*)
177 cases: (string * (RuleCases.T * bool)) list}; (*named case contexts*)
179 fun make_ctxt (mode, naming, syntax, consts, facts, cases) =
180 Ctxt {mode = mode, naming = naming, syntax = syntax,
181 consts = consts, facts = facts, cases = cases};
183 val local_naming = Name_Space.default_naming |> Name_Space.add_path "local";
185 structure ContextData = ProofDataFun
189 make_ctxt (mode_default, local_naming, LocalSyntax.init thy,
190 (Sign.consts_of thy, Sign.consts_of thy), Facts.empty, []);
193 fun rep_context ctxt = ContextData.get ctxt |> (fn Ctxt args => args);
196 ContextData.map (fn Ctxt {mode, naming, syntax, consts, facts, cases} =>
197 make_ctxt (f (mode, naming, syntax, consts, facts, cases)));
199 fun set_mode mode = map_context (fn (_, naming, syntax, consts, facts, cases) =>
200 (mode, naming, syntax, consts, facts, cases));
203 map_context (fn (Mode {stmt, pattern, schematic, abbrev}, naming, syntax, consts, facts, cases) =>
204 (make_mode (f (stmt, pattern, schematic, abbrev)), naming, syntax, consts, facts, cases));
207 map_context (fn (mode, naming, syntax, consts, facts, cases) =>
208 (mode, f naming, syntax, consts, facts, cases));
211 map_context (fn (mode, naming, syntax, consts, facts, cases) =>
212 (mode, naming, f syntax, consts, facts, cases));
215 map_context (fn (mode, naming, syntax, consts, facts, cases) =>
216 (mode, naming, syntax, f consts, facts, cases));
219 map_context (fn (mode, naming, syntax, consts, facts, cases) =>
220 (mode, naming, syntax, consts, f facts, cases));
223 map_context (fn (mode, naming, syntax, consts, facts, cases) =>
224 (mode, naming, syntax, consts, facts, f cases));
226 val get_mode = #mode o rep_context;
227 val restore_mode = set_mode o get_mode;
228 val abbrev_mode = get_mode #> (fn Mode {abbrev, ...} => abbrev);
231 map_mode (fn (_, pattern, schematic, abbrev) => (stmt, pattern, schematic, abbrev));
233 val naming_of = #naming o rep_context;
234 val full_name = Name_Space.full_name o naming_of;
236 val syntax_of = #syntax o rep_context;
237 val syn_of = LocalSyntax.syn_of o syntax_of;
238 val set_syntax_mode = map_syntax o LocalSyntax.set_mode;
239 val restore_syntax_mode = map_syntax o LocalSyntax.restore_mode o syntax_of;
241 val consts_of = #1 o #consts o rep_context;
242 val const_syntax_name = Consts.syntax_name o consts_of;
243 val the_const_constraint = Consts.the_constraint o consts_of;
245 fun mk_const ctxt (c, Ts) = Const (c, Consts.instance (consts_of ctxt) (c, Ts));
247 val facts_of = #facts o rep_context;
248 val cases_of = #cases o rep_context;
251 (* theory transfer *)
253 fun transfer_syntax thy =
254 map_syntax (LocalSyntax.rebuild thy) #>
255 map_consts (fn consts as (local_consts, global_consts) =>
256 let val thy_consts = Sign.consts_of thy in
257 if Consts.eq_consts (thy_consts, global_consts) then consts
258 else (Consts.merge (local_consts, thy_consts), thy_consts)
261 fun transfer thy = Context.raw_transfer thy #> transfer_syntax thy;
263 fun theory f ctxt = transfer (f (theory_of ctxt)) ctxt;
265 fun theory_result f ctxt =
266 let val (res, thy') = f (theory_of ctxt)
267 in (res, ctxt |> transfer thy') end;
271 (** pretty printing **)
275 fun extern_fact ctxt name =
277 val local_facts = facts_of ctxt;
278 val global_facts = PureThy.facts_of (theory_of ctxt);
280 if is_some (Facts.lookup (Context.Proof ctxt) local_facts name)
281 then Facts.extern local_facts name
282 else Facts.extern global_facts name
288 fun pretty_term_abbrev ctxt = Syntax.pretty_term (set_mode mode_abbrev ctxt);
290 fun pretty_fact_name ctxt a = Pretty.block
291 [Pretty.markup (Markup.fact a) [Pretty.str (extern_fact ctxt a)], Pretty.str ":"];
293 fun pretty_fact_aux ctxt flag ("", ths) =
294 Display.pretty_thms_aux ctxt flag ths
295 | pretty_fact_aux ctxt flag (a, [th]) = Pretty.block
296 [pretty_fact_name ctxt a, Pretty.brk 1, Display.pretty_thm_aux ctxt flag th]
297 | pretty_fact_aux ctxt flag (a, ths) = Pretty.block
298 (Pretty.fbreaks (pretty_fact_name ctxt a :: map (Display.pretty_thm_aux ctxt flag) ths));
300 fun pretty_fact ctxt = pretty_fact_aux ctxt true;
304 (** prepare types **)
308 fun read_typ_mode mode ctxt s =
309 Syntax.read_typ (Type.set_mode mode ctxt) s;
311 val read_typ = read_typ_mode Type.mode_default;
312 val read_typ_syntax = read_typ_mode Type.mode_syntax;
313 val read_typ_abbrev = read_typ_mode Type.mode_abbrev;
318 fun cert_typ_mode mode ctxt T =
319 Sign.certify_typ_mode mode (theory_of ctxt) T
320 handle TYPE (msg, _, _) => error msg;
322 val cert_typ = cert_typ_mode Type.mode_default;
323 val cert_typ_syntax = cert_typ_mode Type.mode_syntax;
324 val cert_typ_abbrev = cert_typ_mode Type.mode_abbrev;
328 (** prepare variables **)
330 (* internalize Skolem constants *)
332 val lookup_skolem = AList.lookup (op =) o Variable.fixes_of;
333 fun get_skolem ctxt x = the_default x (lookup_skolem ctxt x);
335 fun no_skolem internal x =
336 if can Name.dest_skolem x then
337 error ("Illegal reference to internal Skolem constant: " ^ quote x)
338 else if not internal andalso can Name.dest_internal x then
339 error ("Illegal reference to internal variable: " ^ quote x)
343 (* revert Skolem constants -- if possible *)
345 fun revert_skolem ctxt x =
346 (case find_first (fn (_, y) => y = x) (Variable.fixes_of ctxt) of
347 SOME (x', _) => if lookup_skolem ctxt x' = SOME x then x' else x
351 (* default token translations *)
355 fun free_or_skolem ctxt x =
356 (if can Name.dest_skolem x then Pretty.mark Markup.skolem (Pretty.str (revert_skolem ctxt x))
357 else Pretty.mark Markup.free (Pretty.str x))
359 (if Variable.is_fixed ctxt x orelse Syntax.is_pretty_global ctxt then Markup.fixed x
362 fun var_or_skolem _ s =
363 (case Lexicon.read_variable s of
365 (case try Name.dest_skolem x of
366 NONE => Pretty.mark Markup.var (Pretty.str s)
367 | SOME x' => Pretty.mark Markup.skolem
368 (Pretty.str (setmp_CRITICAL show_question_marks true Term.string_of_vname (x', i))))
369 | NONE => Pretty.mark Markup.var (Pretty.str s));
371 fun class_markup _ c = (* FIXME authentic name *)
372 Pretty.mark (Markup.tclassN, []) (Pretty.str c);
374 fun plain_markup m _ s = Pretty.mark m (Pretty.str s);
377 Syntax.tokentrans_mode ""
378 [("class", class_markup),
379 ("tfree", plain_markup Markup.tfree),
380 ("tvar", plain_markup Markup.tvar),
381 ("free", free_or_skolem),
382 ("bound", plain_markup Markup.bound),
383 ("var", var_or_skolem),
384 ("numeral", plain_markup Markup.numeral),
385 ("inner_string", plain_markup Markup.inner_string)];
387 in val _ = Context.>> (Context.map_theory (Sign.add_tokentrfuns token_trans)) end;
391 (** prepare terms and propositions **)
393 (* inferred types of parameters *)
395 fun infer_type ctxt x =
396 Term.fastype_of (singleton (Syntax.check_terms (set_mode mode_schematic ctxt))
399 fun inferred_param x ctxt =
400 let val T = infer_type ctxt x
401 in (T, ctxt |> Variable.declare_term (Free (x, T))) end;
403 fun inferred_fixes ctxt =
405 val xs = rev (map #2 (Variable.fixes_of ctxt));
406 val (Ts, ctxt') = fold_map inferred_param xs ctxt;
407 in (xs ~~ Ts, ctxt') end;
410 (* type and constant names *)
414 val token_content = Syntax.read_token #>> Symbol_Pos.content;
416 fun prep_const_proper ctxt (c, pos) =
417 let val t as (Const (d, _)) =
418 (case Variable.lookup_const ctxt c of
419 SOME d => Const (d, Consts.type_scheme (consts_of ctxt) d handle TYPE (msg, _, _) => error msg)
420 | NONE => Consts.read_const (consts_of ctxt) c)
421 in Position.report (Markup.const d) pos; t end;
425 fun read_tyname ctxt str =
427 val thy = theory_of ctxt;
428 val (c, pos) = token_content str;
430 if Syntax.is_tid c then
431 (Position.report Markup.tfree pos;
432 TFree (c, the_default (Sign.defaultS thy) (Variable.def_sort ctxt (c, ~1))))
435 val d = Sign.intern_type thy c;
436 val _ = Position.report (Markup.tycon d) pos;
437 in Type (d, replicate (Sign.arity_number thy d) dummyT) end
440 fun read_const_proper ctxt = prep_const_proper ctxt o token_content;
442 fun read_const ctxt str =
443 let val (c, pos) = token_content str in
444 (case (lookup_skolem ctxt c, Variable.is_const ctxt c) of
446 (Position.report (Markup.name x
447 (if can Name.dest_skolem x then Markup.skolem else Markup.free)) pos;
448 Free (x, infer_type ctxt x))
449 | _ => prep_const_proper ctxt (c, pos))
457 fun read_term_mode mode ctxt = Syntax.read_term (set_mode mode ctxt);
459 val read_term_pattern = read_term_mode mode_pattern;
460 val read_term_schematic = read_term_mode mode_schematic;
461 val read_term_abbrev = read_term_mode mode_abbrev;
464 (* local abbreviations *)
466 val tsig_of = Sign.tsig_of o ProofContext.theory_of;
470 fun certify_consts ctxt = Consts.certify (Syntax.pp ctxt) (tsig_of ctxt)
471 (not (abbrev_mode ctxt)) (consts_of ctxt);
473 fun reject_schematic (Var (xi, _)) =
474 error ("Unbound schematic variable: " ^ Term.string_of_vname xi)
475 | reject_schematic (Abs (_, _, t)) = reject_schematic t
476 | reject_schematic (t $ u) = (reject_schematic t; reject_schematic u)
477 | reject_schematic _ = ();
479 fun expand_binds ctxt =
480 let val Mode {pattern, schematic, ...} = get_mode ctxt in
482 else Variable.expand_binds ctxt #> (if schematic then I else tap reject_schematic)
487 fun expand_abbrevs ctxt = certify_consts ctxt #> expand_binds ctxt;
492 fun contract_abbrevs ctxt t =
494 val thy = theory_of ctxt;
495 val consts = consts_of ctxt;
496 val Mode {abbrev, ...} = get_mode ctxt;
497 val retrieve = Consts.retrieve_abbrevs consts (print_mode_value () @ [""]);
498 fun match_abbrev u = Option.map #1 (get_first (Pattern.match_rew thy u) (retrieve u));
500 if abbrev orelse print_mode_active "no_abbrevs" orelse not (can Term.type_of t) then t
501 else Pattern.rewrite_term thy [] [match_abbrev] t
507 fun prepare_patternT ctxt T =
509 val Mode {pattern, schematic, ...} = get_mode ctxt;
511 pattern orelse schematic orelse
512 T |> Term.exists_subtype
514 not (TypeInfer.is_param xi) andalso
515 error ("Illegal schematic type variable: " ^ Term.string_of_vname xi)
522 structure Allow_Dummies = ProofDataFun(type T = bool fun init _ = false);
524 fun check_dummies ctxt t =
525 if Allow_Dummies.get ctxt then t
526 else Term.no_dummy_patterns t handle TERM _ => error "Illegal dummy pattern(s) in term";
528 fun prepare_dummies ts = #1 (fold_map Term.replace_dummy_patterns ts 1);
532 val allow_dummies = Allow_Dummies.put true;
534 fun prepare_patterns ctxt =
535 let val Mode {pattern, ...} = get_mode ctxt in
536 TypeInfer.fixate_params (Variable.names_of ctxt) #>
537 pattern ? Variable.polymorphic ctxt #>
538 (map o Term.map_types) (prepare_patternT ctxt) #>
539 (if pattern then prepare_dummies else map (check_dummies ctxt))
545 (* decoding raw terms (syntax trees) *)
549 fun get_sort thy def_sort raw_env =
551 val tsig = Sign.tsig_of thy;
553 fun eq ((xi, S), (xi', S')) =
554 Term.eq_ix (xi, xi') andalso Type.eq_sort tsig (S, S');
555 val env = distinct eq raw_env;
556 val _ = (case duplicates (eq_fst (op =)) env of [] => ()
557 | dups => error ("Inconsistent sort constraints for type variable(s) "
558 ^ commas_quote (map (Term.string_of_vname' o fst) dups)));
561 (case (AList.lookup (op =) env xi, def_sort xi) of
562 (NONE, NONE) => Type.defaultS tsig
563 | (NONE, SOME S) => S
564 | (SOME S, NONE) => S
565 | (SOME S, SOME S') =>
566 if Type.eq_sort tsig (S, S') then S'
567 else error ("Sort constraint " ^ Syntax.string_of_sort_global thy S ^
568 " inconsistent with default " ^ Syntax.string_of_sort_global thy S' ^
569 " for type variable " ^ quote (Term.string_of_vname' xi)));
574 fun intern_skolem ctxt def_type x =
576 val _ = no_skolem false x;
577 val sko = lookup_skolem ctxt x;
578 val is_const = can (read_const_proper ctxt) x orelse Long_Name.is_qualified x;
579 val is_declared = is_some (def_type (x, ~1));
581 if Variable.is_const ctxt x then NONE
582 else if is_some sko then sko
583 else if not is_const orelse is_declared then SOME x
589 fun term_context ctxt =
590 let val thy = theory_of ctxt in
591 {get_sort = get_sort thy (Variable.def_sort ctxt),
592 map_const = fn a => ((true, #1 (Term.dest_Const (read_const_proper ctxt a)))
593 handle ERROR _ => (false, Consts.intern (consts_of ctxt) a)),
594 map_free = intern_skolem ctxt (Variable.def_type ctxt false),
595 map_type = Sign.intern_tycons thy,
596 map_sort = Sign.intern_sort thy}
599 fun decode_term ctxt =
600 let val {get_sort, map_const, map_free, map_type, map_sort} = term_context ctxt
601 in Syntax.decode_term get_sort map_const map_free map_type map_sort end;
610 fun gen_cert prop ctxt t =
612 |> expand_abbrevs ctxt
613 |> (fn t' => #1 (Sign.certify' prop (Syntax.pp ctxt) false (consts_of ctxt) (theory_of ctxt) t')
614 handle TYPE (msg, _, _) => error msg
615 | TERM (msg, _) => error msg);
619 val cert_term = gen_cert false;
620 val cert_prop = gen_cert true;
625 (* type checking/inference *)
627 fun standard_infer_types ctxt ts =
628 let val Mode {pattern, ...} = get_mode ctxt in
629 TypeInfer.infer_types (Syntax.pp ctxt) (tsig_of ctxt) (Syntax.check_typs ctxt)
630 (try (Consts.the_constraint (consts_of ctxt))) (Variable.def_type ctxt pattern)
631 (Variable.names_of ctxt) (Variable.maxidx_of ctxt) ts
632 handle TYPE (msg, _, _) => error msg
637 fun standard_typ_check ctxt =
638 map (cert_typ_mode (Type.get_mode ctxt) ctxt) #>
639 map (prepare_patternT ctxt);
641 fun standard_term_check ctxt =
642 standard_infer_types ctxt #>
643 map (expand_abbrevs ctxt);
645 fun standard_term_uncheck ctxt =
646 map (contract_abbrevs ctxt);
648 fun add eq what f = Context.>> (what (fn xs => fn ctxt =>
649 let val xs' = f ctxt xs in if eq_list eq (xs, xs') then NONE else SOME (xs', ctxt) end));
653 val _ = add (op =) (Syntax.add_typ_check 0 "standard") standard_typ_check;
654 val _ = add (op aconv) (Syntax.add_term_check 0 "standard") standard_term_check;
655 val _ = add (op aconv) (Syntax.add_term_check 100 "fixate") prepare_patterns;
657 val _ = add (op aconv) (Syntax.add_term_uncheck 0 "standard") standard_term_uncheck;
663 (** inner syntax operations **)
667 fun parse_sort ctxt text =
669 val (syms, pos) = Syntax.parse_token Markup.sort text;
670 val S = Syntax.standard_parse_sort ctxt (syn_of ctxt)
671 (Sign.intern_sort (theory_of ctxt)) (syms, pos)
672 handle ERROR msg => cat_error msg ("Failed to parse sort" ^ Position.str_of pos)
675 fun parse_typ ctxt text =
677 val thy = ProofContext.theory_of ctxt;
678 val get_sort = get_sort thy (Variable.def_sort ctxt);
680 val (syms, pos) = Syntax.parse_token Markup.typ text;
681 val T = Sign.intern_tycons thy
682 (Syntax.standard_parse_typ ctxt (syn_of ctxt) get_sort (Sign.intern_sort thy) (syms, pos))
683 handle ERROR msg => cat_error msg ("Failed to parse type" ^ Position.str_of pos);
686 fun parse_term T ctxt text =
688 val thy = theory_of ctxt;
689 val {get_sort, map_const, map_free, map_type, map_sort} = term_context ctxt;
691 val (T', _) = TypeInfer.paramify_dummies T 0;
692 val (markup, kind) = if T' = propT then (Markup.prop, "proposition") else (Markup.term, "term");
693 val (syms, pos) = Syntax.parse_token markup text;
695 fun check t = (Syntax.check_term ctxt (TypeInfer.constrain T' t); NONE)
696 handle ERROR msg => SOME msg;
697 val t = Syntax.standard_parse_term (Syntax.pp ctxt) check get_sort map_const map_free
698 map_type map_sort ctxt (Sign.is_logtype thy) (syn_of ctxt) T' (syms, pos)
699 handle ERROR msg => cat_error msg ("Failed to parse " ^ kind ^ Position.str_of pos);
703 fun unparse_sort ctxt S =
704 Syntax.standard_unparse_sort ctxt (syn_of ctxt) (Sign.extern_sort (theory_of ctxt) S);
706 fun unparse_typ ctxt T =
707 Syntax.standard_unparse_typ ctxt (syn_of ctxt) (Sign.extern_typ (theory_of ctxt) T);
709 fun unparse_term ctxt t =
711 val thy = theory_of ctxt;
712 val syntax = syntax_of ctxt;
713 val consts = consts_of ctxt;
716 |> Sign.extern_term (Consts.extern_early consts) thy
717 |> LocalSyntax.extern_term syntax
718 |> Syntax.standard_unparse_term (Consts.extern consts) ctxt (LocalSyntax.syn_of syntax)
719 (not (PureThy.old_appl_syntax thy))
724 val _ = Syntax.install_operations
725 {parse_sort = parse_sort,
726 parse_typ = parse_typ,
727 parse_term = parse_term dummyT,
728 parse_prop = parse_term propT,
729 unparse_sort = unparse_sort,
730 unparse_typ = unparse_typ,
731 unparse_term = unparse_term};
737 (** export results **)
739 fun common_export is_goal inner outer =
740 map (Assumption.export is_goal inner outer) #>
741 Variable.export inner outer;
743 val goal_export = common_export true;
744 val export = common_export false;
746 fun export_morphism inner outer =
747 Assumption.export_morphism inner outer $>
748 Variable.export_morphism inner outer;
750 fun norm_export_morphism inner outer =
751 export_morphism inner outer $>
752 Morphism.thm_morphism Goal.norm_result;
756 (** term bindings **)
760 fun simult_matches ctxt (t, pats) =
761 (case Seq.pull (Unify.matchers (theory_of ctxt) (map (rpair t) pats)) of
762 NONE => error "Pattern match failed!"
763 | SOME (env, _) => Vartab.fold (fn (v, (_, t)) => cons (v, t)) (Envir.term_env env) []);
768 val bind_terms = fold (fn (xi, t) => fn ctxt =>
770 |> Variable.bind_term (xi, Option.map (cert_term (set_mode mode_default ctxt)) t));
775 fun drop_schematic (b as (xi, SOME t)) = if Term.exists_subterm is_Var t then (xi, NONE) else b
776 | drop_schematic b = b;
778 fun auto_bind f ts ctxt = ctxt |> bind_terms (map drop_schematic (f (theory_of ctxt) ts));
780 val auto_bind_goal = auto_bind AutoBind.goal;
781 val auto_bind_facts = auto_bind AutoBind.facts;
788 fun gen_bind prep_terms gen raw_binds ctxt =
790 fun prep_bind (raw_pats, t) ctxt1 =
792 val T = Term.fastype_of t;
793 val ctxt2 = Variable.declare_term t ctxt1;
794 val pats = prep_terms (set_mode mode_pattern ctxt2) T raw_pats;
795 val binds = simult_matches ctxt2 (t, pats);
796 in (binds, ctxt2) end;
798 val ts = prep_terms ctxt dummyT (map snd raw_binds);
799 val (binds, ctxt') = apfst flat (fold_map prep_bind (map fst raw_binds ~~ ts) ctxt);
801 if gen then map #1 binds ~~ Variable.exportT_terms ctxt' ctxt (map #2 binds)
803 val binds'' = map (apsnd SOME) binds';
805 tap (Variable.warn_extra_tfrees ctxt)
807 ctxt (*sic!*) |> fold Variable.declare_term (map #2 binds') |> bind_terms binds''
808 else ctxt' |> bind_terms binds'');
813 fun read_terms ctxt T =
814 map (Syntax.parse_term ctxt #> TypeInfer.constrain T) #> Syntax.check_terms ctxt;
816 val match_bind = gen_bind read_terms;
817 val match_bind_i = gen_bind (fn ctxt => fn _ => map (cert_term ctxt));
822 (* propositions with patterns *)
826 fun prep_propp mode prep_props (context, args) =
828 fun prep (_, raw_pats) (ctxt, prop :: props) =
829 let val ctxt' = Variable.declare_term prop ctxt
830 in ((prop, prep_props (set_mode mode_pattern ctxt') raw_pats), (ctxt', props)) end;
832 val (propp, (context', _)) = (fold_map o fold_map) prep args
833 (context, prep_props (set_mode mode context) (maps (map fst) args));
834 in (context', propp) end;
836 fun gen_bind_propp mode parse_prop (ctxt, raw_args) =
838 val (ctxt', args) = prep_propp mode parse_prop (ctxt, raw_args);
839 val binds = flat (flat (map (map (simult_matches ctxt')) args));
840 val propss = map (map #1) args;
842 (*generalize result: context evaluated now, binds added later*)
843 val gen = Variable.exportT_terms ctxt' ctxt;
844 fun gen_binds c = c |> bind_terms (map #1 binds ~~ map SOME (gen (map #2 binds)));
845 in (ctxt' |> bind_terms (map (apsnd SOME) binds), (propss, gen_binds)) end;
849 val read_propp = prep_propp mode_default Syntax.read_props;
850 val cert_propp = prep_propp mode_default (map o cert_prop);
851 val read_propp_schematic = prep_propp mode_schematic Syntax.read_props;
852 val cert_propp_schematic = prep_propp mode_schematic (map o cert_prop);
854 val bind_propp = gen_bind_propp mode_default Syntax.read_props;
855 val bind_propp_i = gen_bind_propp mode_default (map o cert_prop);
856 val bind_propp_schematic = gen_bind_propp mode_schematic Syntax.read_props;
857 val bind_propp_schematic_i = gen_bind_propp mode_schematic (map o cert_prop);
867 fun comp_incr_tac [] _ = no_tac
868 | comp_incr_tac (th :: ths) i =
869 (fn st => Goal.compose_hhf_tac (Drule.incr_indexes st th) i st) APPEND comp_incr_tac ths i;
871 fun fact_tac facts = Goal.norm_hhf_tac THEN' comp_incr_tac facts;
873 fun potential_facts ctxt prop =
874 Facts.could_unify (facts_of ctxt) (Term.strip_all_body prop);
876 fun some_fact_tac ctxt = SUBGOAL (fn (goal, i) => fact_tac (potential_facts ctxt goal) i);
883 fun retrieve_thms pick ctxt (Facts.Fact s) =
885 val (_, pos) = Syntax.read_token s;
886 val prop = Syntax.read_prop (set_mode mode_default ctxt) s
887 |> singleton (Variable.polymorphic ctxt);
890 Goal.prove ctxt [] [] prop (K (ALLGOALS (fact_tac [th])))
891 |> Thm.default_position_of th;
893 (case get_first (try prove_fact) (potential_facts ctxt prop) of
895 | NONE => error ("Failed to retrieve literal fact" ^ Position.str_of pos ^ ":\n" ^
896 Syntax.string_of_term ctxt prop))
898 | retrieve_thms pick ctxt xthmref =
900 val thy = theory_of ctxt;
901 val local_facts = facts_of ctxt;
902 val thmref = Facts.map_name_of_ref (Facts.intern local_facts) xthmref;
903 val name = Facts.name_of_ref thmref;
904 val pos = Facts.pos_of_ref xthmref;
906 if name = "" then [Thm.transfer thy Drule.dummy_thm]
908 (case Facts.lookup (Context.Proof ctxt) local_facts name of
909 SOME (_, ths) => (Position.report (Markup.local_fact name) pos;
910 map (Thm.transfer thy) (Facts.select thmref ths))
911 | NONE => PureThy.get_fact (Context.Proof ctxt) thy xthmref);
912 in pick name thms end;
916 val get_fact = retrieve_thms (K I);
917 val get_fact_single = retrieve_thms Facts.the_single;
919 fun get_thms ctxt = get_fact ctxt o Facts.named;
920 fun get_thm ctxt = get_fact_single ctxt o Facts.named;
925 (* name space operations *)
927 val add_path = map_naming o Name_Space.add_path;
928 val mandatory_path = map_naming o Name_Space.mandatory_path;
929 val restore_naming = map_naming o K o naming_of;
930 val reset_naming = map_naming (K local_naming);
937 fun update_thms _ (b, NONE) ctxt = ctxt |> map_facts (Facts.del (full_name ctxt b))
938 | update_thms do_props (b, SOME ths) ctxt = ctxt |> map_facts
939 (Facts.add_local do_props (naming_of ctxt) (b, ths) #> snd);
943 fun note_thmss kind = fold_map (fn ((b, more_attrs), raw_facts) => fn ctxt =>
945 val pos = Binding.pos_of b;
946 val name = full_name ctxt b;
947 val _ = ContextPosition.report_visible ctxt (Markup.local_fact_decl name) pos;
949 val facts = PureThy.name_thmss false pos name raw_facts;
950 fun app (th, attrs) x =
951 swap (Library.foldl_map
952 (Thm.proof_attributes (surround (Thm.kind kind) (attrs @ more_attrs))) (x, th));
953 val (res, ctxt') = fold_map app facts ctxt;
954 val thms = PureThy.name_thms false false pos name (flat res);
955 val Mode {stmt, ...} = get_mode ctxt;
956 in ((name, thms), ctxt' |> update_thms stmt (b, SOME thms)) end);
958 fun put_thms do_props thms ctxt = ctxt
959 |> map_naming (K local_naming)
960 |> ContextPosition.set_visible false
961 |> update_thms do_props (apfst Binding.name thms)
962 |> ContextPosition.restore_visible ctxt
963 |> restore_naming ctxt;
973 fun declare_var (x, opt_T, mx) ctxt =
974 let val T = (case opt_T of SOME T => T | NONE => Syntax.mixfixT mx)
975 in ((x, T, mx), ctxt |> Variable.declare_constraints (Free (x, T))) end;
979 fun prep_vars prep_typ internal =
980 fold_map (fn (raw_b, raw_T, raw_mx) => fn ctxt =>
982 val raw_x = Name.of_binding raw_b;
983 val (x, mx) = Syntax.const_mixfix raw_x raw_mx;
984 val _ = Syntax.is_identifier (no_skolem internal x) orelse
985 error ("Illegal variable name: " ^ quote x);
989 else Type.no_tvars T handle TYPE (msg, _, _) => error msg;
990 val opt_T = Option.map (cond_tvars o cert_typ ctxt o prep_typ ctxt) raw_T;
991 val var = (Binding.map_name (K x) raw_b, opt_T, mx);
992 in (var, ctxt |> declare_var (x, opt_T, mx) |> #2) end);
996 val read_vars = prep_vars Syntax.parse_typ false;
997 val cert_vars = prep_vars (K I) true;
1002 (* authentic constants *)
1006 fun const_ast_tr intern ctxt [Syntax.Variable c] =
1008 val Const (c', _) = read_const_proper ctxt c;
1009 val d = if intern then const_syntax_name ctxt c' else c;
1010 in Syntax.Constant d end
1011 | const_ast_tr _ _ asts = raise Syntax.AST ("const_ast_tr", asts);
1015 val _ = Context.>> (Context.map_theory
1017 [("_context_const", "id => logic", Delimfix "CONST _"),
1018 ("_context_const", "id => aprop", Delimfix "CONST _"),
1019 ("_context_const", "longid => logic", Delimfix "CONST _"),
1020 ("_context_const", "longid => aprop", Delimfix "CONST _"),
1021 ("_context_xconst", "id => logic", Delimfix "XCONST _"),
1022 ("_context_xconst", "id => aprop", Delimfix "XCONST _"),
1023 ("_context_xconst", "longid => logic", Delimfix "XCONST _"),
1024 ("_context_xconst", "longid => aprop", Delimfix "XCONST _")] #>
1025 Sign.add_advanced_trfuns
1026 ([("_context_const", const_ast_tr true), ("_context_xconst", const_ast_tr false)], [], [], [])));
1035 fun const_syntax _ (Free (x, T), mx) = SOME (true, (x, T, mx))
1036 | const_syntax ctxt (Const (c, _), mx) =
1037 Option.map (pair false) (try (Consts.syntax (consts_of ctxt)) (c, mx))
1038 | const_syntax _ _ = NONE;
1042 fun notation add mode args ctxt =
1044 (LocalSyntax.update_modesyntax (theory_of ctxt) add mode (map_filter (const_syntax ctxt) args));
1046 fun target_notation add mode args phi =
1047 let val args' = filter (fn (t, _) => Type.similar_types (t, Morphism.term phi t)) args;
1048 in Context.mapping (Sign.notation add mode args') (notation add mode args') end;
1053 (* local constants *)
1055 fun add_const_constraint (c, opt_T) ctxt =
1058 let val T = cert_typ ctxt raw_T
1059 in cert_term ctxt (Const (c, T)); T end;
1060 in ctxt |> (map_consts o apfst) (Consts.constrain (c, Option.map prepT opt_T)) end;
1062 fun add_abbrev mode tags (b, raw_t) ctxt =
1064 val t0 = cert_term (ctxt |> set_mode mode_abbrev) raw_t
1065 handle ERROR msg => cat_error msg ("in constant abbreviation " ^ quote (Binding.str_of b));
1066 val [t] = Variable.exportT_terms (Variable.declare_term t0 ctxt) ctxt [t0];
1067 val ((lhs, rhs), consts') = consts_of ctxt
1068 |> Consts.abbreviate (Syntax.pp ctxt) (tsig_of ctxt) (naming_of ctxt) mode tags (b, t);
1071 |> (map_consts o apfst) (K consts')
1072 |> Variable.declare_term rhs
1076 fun revert_abbrev mode c = (map_consts o apfst) (Consts.revert_abbrev mode c);
1083 fun prep_mixfix (x, T, mx) =
1084 if mx <> NoSyn andalso mx <> Structure andalso
1085 (can Name.dest_internal x orelse can Name.dest_skolem x) then
1086 error ("Illegal mixfix syntax for internal/skolem constant " ^ quote x)
1087 else (true, (x, T, mx));
1091 fun add_fixes raw_vars ctxt =
1093 val (vars, _) = cert_vars raw_vars ctxt;
1094 val (xs', ctxt') = Variable.add_fixes (map (Name.of_binding o #1) vars) ctxt;
1097 |> fold_map declare_var (map2 (fn x' => fn (_, T, mx) => (x', T, mx)) xs' vars)
1098 |-> (map_syntax o LocalSyntax.add_syntax (theory_of ctxt) o map prep_mixfix);
1099 val _ = (vars ~~ xs') |> List.app (fn ((b, _, _), x') =>
1100 ContextPosition.report_visible ctxt (Markup.fixed_decl x') (Binding.pos_of b));
1101 in (xs', ctxt'') end;
1106 (* fixes vs. frees *)
1108 fun auto_fixes (ctxt, (propss, x)) =
1109 ((fold o fold) Variable.auto_fixes propss ctxt, (propss, x));
1111 fun bind_fixes xs ctxt =
1113 val (_, ctxt') = ctxt |> add_fixes (map (fn x => (Binding.name x, NONE, NoSyn)) xs);
1114 fun bind (t as Free (x, T)) =
1115 if member (op =) xs x then
1116 (case lookup_skolem ctxt' x of SOME x' => Free (x', T) | NONE => t)
1118 | bind (t $ u) = bind t $ bind u
1119 | bind (Abs (x, T, t)) = Abs (x, T, bind t)
1121 in (bind, ctxt') end;
1129 fun gen_assms prepp exp args ctxt =
1131 val cert = Thm.cterm_of (theory_of ctxt);
1132 val (propss, ctxt1) = swap (prepp (ctxt, map snd args));
1133 val _ = Variable.warn_extra_tfrees ctxt ctxt1;
1134 val (premss, ctxt2) = fold_burrow (Assumption.add_assms exp o map cert) propss ctxt1;
1137 |> auto_bind_facts (flat propss)
1138 |> note_thmss Thm.assumptionK (map fst args ~~ map (map (fn th => ([th], []))) premss)
1143 val add_assms = gen_assms (apsnd #1 o bind_propp);
1144 val add_assms_i = gen_assms (apsnd #1 o bind_propp_i);
1154 fun rem_case name = remove (fn (x: string, (y, _)) => x = y) name;
1156 fun add_case _ ("", _) cases = cases
1157 | add_case _ (name, NONE) cases = rem_case name cases
1158 | add_case is_proper (name, SOME c) cases = (name, (c, is_proper)) :: rem_case name cases;
1160 fun prep_case name fxs c =
1162 fun replace (opt_x :: xs) ((y, T) :: ys) = (the_default y opt_x, T) :: replace xs ys
1163 | replace [] ys = ys
1164 | replace (_ :: _) [] = error ("Too many parameters for case " ^ quote name);
1165 val RuleCases.Case {fixes, assumes, binds, cases} = c;
1166 val fixes' = replace fxs fixes;
1167 val binds' = map drop_schematic binds;
1169 if null (fold (Term.add_tvarsT o snd) fixes []) andalso
1170 null (fold (fold Term.add_vars o snd) assumes []) then
1171 RuleCases.Case {fixes = fixes', assumes = assumes, binds = binds', cases = cases}
1172 else error ("Illegal schematic variable(s) in case " ^ quote name)
1175 fun fix (x, T) ctxt =
1177 val (bind, ctxt') = bind_fixes [x] ctxt;
1178 val t = bind (Free (x, T));
1179 in (t, ctxt' |> Variable.declare_constraints t) end;
1183 fun add_cases is_proper = map_cases o fold (add_case is_proper);
1185 fun case_result c ctxt =
1187 val RuleCases.Case {fixes, ...} = c;
1188 val (ts, ctxt') = ctxt |> fold_map fix fixes;
1189 val RuleCases.Case {assumes, binds, cases, ...} = RuleCases.apply ts c;
1192 |> bind_terms (map drop_schematic binds)
1193 |> add_cases true (map (apsnd SOME) cases)
1194 |> pair (assumes, (binds, cases))
1197 val apply_case = apfst fst oo case_result;
1199 fun get_case ctxt name xs =
1200 (case AList.lookup (op =) (cases_of ctxt) name of
1201 NONE => error ("Unknown case: " ^ quote name)
1202 | SOME (c, _) => prep_case name xs c);
1208 (** print context information **)
1210 val debug = Unsynchronized.ref false;
1212 val verbose = Unsynchronized.ref false;
1213 fun verb f x = if ! verbose then f (x ()) else [];
1215 fun setmp_verbose f x = setmp_CRITICAL verbose true f x;
1220 val print_syntax = Syntax.print_syntax o syn_of;
1225 fun pretty_abbrevs show_globals ctxt =
1227 val ((space, consts), (_, globals)) =
1228 pairself (#constants o Consts.dest) (#consts (rep_context ctxt));
1229 fun add_abbr (_, (_, NONE)) = I
1230 | add_abbr (c, (T, SOME t)) =
1231 if not show_globals andalso Symtab.defined globals c then I
1232 else cons (c, Logic.mk_equals (Const (c, T), t));
1233 val abbrevs = Name_Space.extern_table (space, Symtab.make (Symtab.fold add_abbr consts []));
1235 if null abbrevs andalso not (! verbose) then []
1236 else [Pretty.big_list "abbreviations:" (map (pretty_term_abbrev ctxt o #2) abbrevs)]
1239 val print_abbrevs = Pretty.writeln o Pretty.chunks o pretty_abbrevs true;
1244 fun pretty_binds ctxt =
1246 val binds = Variable.binds_of ctxt;
1247 fun prt_bind (xi, (T, t)) = pretty_term_abbrev ctxt (Logic.mk_equals (Var (xi, T), t));
1249 if Vartab.is_empty binds andalso not (! verbose) then []
1250 else [Pretty.big_list "term bindings:" (map prt_bind (Vartab.dest binds))]
1253 val print_binds = Pretty.writeln o Pretty.chunks o pretty_binds;
1256 (* local theorems *)
1258 fun pretty_lthms ctxt =
1260 val local_facts = facts_of ctxt;
1261 val props = Facts.props local_facts;
1263 (if null props then [] else [("unnamed", props)]) @
1264 Facts.dest_static [] local_facts;
1266 if null facts andalso not (! verbose) then []
1267 else [Pretty.big_list "facts:" (map #1 (sort_wrt (#1 o #2) (map (`(pretty_fact ctxt)) facts)))]
1270 val print_lthms = Pretty.writeln o Pretty.chunks o pretty_lthms;
1273 (* local contexts *)
1277 fun pretty_case (name, (fixes, ((asms, (lets, cs)), ctxt))) =
1279 val prt_term = Syntax.pretty_term ctxt;
1281 fun prt_let (xi, t) = Pretty.block
1282 [Pretty.quote (prt_term (Var (xi, Term.fastype_of t))), Pretty.str " =", Pretty.brk 1,
1283 Pretty.quote (prt_term t)];
1285 fun prt_asm (a, ts) = Pretty.block (Pretty.breaks
1286 ((if a = "" then [] else [Pretty.str (a ^ ":")]) @ map (Pretty.quote o prt_term) ts));
1288 fun prt_sect _ _ _ [] = []
1289 | prt_sect s sep prt xs = [Pretty.block (Pretty.breaks (Pretty.str s ::
1290 flat (Library.separate sep (map (Library.single o prt) xs))))];
1292 Pretty.block (Pretty.fbreaks
1293 (Pretty.str (name ^ ":") ::
1294 prt_sect "fix" [] (Pretty.str o fst) fixes @
1295 prt_sect "let" [Pretty.str "and"] prt_let
1296 (map_filter (fn (xi, SOME t) => SOME (xi, t) | _ => NONE) lets) @
1297 (if forall (null o #2) asms then []
1298 else prt_sect "assume" [Pretty.str "and"] prt_asm asms) @
1299 prt_sect "subcases:" [] (Pretty.str o fst) cs))
1304 fun pretty_cases ctxt =
1306 fun add_case (_, (_, false)) = I
1307 | add_case (name, (c as RuleCases.Case {fixes, ...}, true)) =
1308 cons (name, (fixes, case_result c ctxt));
1309 val cases = fold add_case (cases_of ctxt) [];
1311 if null cases andalso not (! verbose) then []
1312 else [Pretty.big_list "cases:" (map pretty_case cases)]
1315 val print_cases = Pretty.writeln o Pretty.chunks o pretty_cases;
1322 val prems_limit = Unsynchronized.ref ~1;
1324 fun pretty_ctxt ctxt =
1325 if ! prems_limit < 0 andalso not (! debug) then []
1328 val prt_term = Syntax.pretty_term ctxt;
1331 val structs = LocalSyntax.structs_of (syntax_of ctxt);
1332 val prt_structs = if null structs then []
1333 else [Pretty.block (Pretty.str "structures:" :: Pretty.brk 1 ::
1334 Pretty.commas (map Pretty.str structs))];
1337 fun prt_fix (x, x') =
1338 if x = x' then Pretty.str x
1339 else Pretty.block [Pretty.str x, Pretty.str " =", Pretty.brk 1, prt_term (Syntax.free x')];
1341 rev (filter_out ((can Name.dest_internal orf member (op =) structs) o #1)
1342 (Variable.fixes_of ctxt));
1343 val prt_fixes = if null fixes then []
1344 else [Pretty.block (Pretty.str "fixed variables:" :: Pretty.brk 1 ::
1345 Pretty.commas (map prt_fix fixes))];
1348 val prems = Assumption.all_prems_of ctxt;
1349 val len = length prems;
1350 val suppressed = len - ! prems_limit;
1351 val prt_prems = if null prems then []
1352 else [Pretty.big_list "prems:" ((if suppressed <= 0 then [] else [Pretty.str "..."]) @
1353 map (Display.pretty_thm ctxt) (Library.drop (suppressed, prems)))];
1354 in prt_structs @ prt_fixes @ prt_prems end;
1359 fun pretty_context ctxt =
1361 val prt_term = Syntax.pretty_term ctxt;
1362 val prt_typ = Syntax.pretty_typ ctxt;
1363 val prt_sort = Syntax.pretty_sort ctxt;
1366 val pretty_thy = Pretty.block
1367 [Pretty.str "theory:", Pretty.brk 1, Context.pretty_thy (theory_of ctxt)];
1370 fun prt_atom prt prtT (x, X) = Pretty.block
1371 [prt x, Pretty.str " ::", Pretty.brk 1, prtT X];
1373 fun prt_var (x, ~1) = prt_term (Syntax.free x)
1374 | prt_var xi = prt_term (Syntax.var xi);
1376 fun prt_varT (x, ~1) = prt_typ (TFree (x, []))
1377 | prt_varT xi = prt_typ (TVar (xi, []));
1379 val prt_defT = prt_atom prt_var prt_typ;
1380 val prt_defS = prt_atom prt_varT prt_sort;
1382 val (types, sorts) = Variable.constraints_of ctxt;
1384 verb single (K pretty_thy) @
1386 verb (pretty_abbrevs false) (K ctxt) @
1387 verb pretty_binds (K ctxt) @
1388 verb pretty_lthms (K ctxt) @
1389 verb pretty_cases (K ctxt) @
1390 verb single (fn () => Pretty.big_list "type constraints:" (map prt_defT (Vartab.dest types))) @
1391 verb single (fn () => Pretty.big_list "default sorts:" (map prt_defS (Vartab.dest sorts)))
1395 (* query meta data *)
1397 val query_type = Type.the_tags o tsig_of;
1399 fun query_const ctxt name =
1400 Consts.the_tags (consts_of ctxt) name handle TYPE (msg, _, _) => error msg;
1402 fun query_class ctxt name = query_const ctxt (Logic.const_of_class name);