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 -> NameSpace.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_thm_legacy: thm -> Pretty.T
40 val pretty_thm: Proof.context -> thm -> Pretty.T
41 val pretty_thms: Proof.context -> thm list -> Pretty.T
42 val pretty_fact: Proof.context -> string * thm list -> Pretty.T
43 val string_of_thm: Proof.context -> thm -> string
44 val read_typ: Proof.context -> string -> typ
45 val read_typ_syntax: Proof.context -> string -> typ
46 val read_typ_abbrev: Proof.context -> string -> typ
47 val cert_typ: Proof.context -> typ -> typ
48 val cert_typ_syntax: Proof.context -> typ -> typ
49 val cert_typ_abbrev: Proof.context -> typ -> typ
50 val get_skolem: Proof.context -> string -> string
51 val revert_skolem: Proof.context -> string -> string
52 val infer_type: Proof.context -> string -> typ
53 val inferred_param: string -> Proof.context -> typ * Proof.context
54 val inferred_fixes: Proof.context -> (string * typ) list * Proof.context
55 val read_tyname: Proof.context -> string -> typ
56 val read_const_proper: Proof.context -> string -> term
57 val read_const: Proof.context -> string -> term
58 val allow_dummies: Proof.context -> Proof.context
59 val decode_term: Proof.context -> term -> term
60 val standard_infer_types: Proof.context -> term list -> term list
61 val read_term_pattern: Proof.context -> string -> term
62 val read_term_schematic: Proof.context -> string -> term
63 val read_term_abbrev: Proof.context -> string -> term
64 val expand_abbrevs: Proof.context -> term -> term
65 val cert_term: Proof.context -> term -> term
66 val cert_prop: Proof.context -> term -> term
67 val goal_export: Proof.context -> Proof.context -> thm list -> thm list
68 val export: Proof.context -> Proof.context -> thm list -> thm list
69 val export_morphism: Proof.context -> Proof.context -> morphism
70 val norm_export_morphism: Proof.context -> Proof.context -> morphism
71 val add_binds: (indexname * string option) list -> Proof.context -> Proof.context
72 val add_binds_i: (indexname * term option) list -> Proof.context -> Proof.context
73 val auto_bind_goal: term list -> Proof.context -> Proof.context
74 val auto_bind_facts: term list -> Proof.context -> Proof.context
75 val match_bind: bool -> (string list * string) list -> Proof.context -> term list * Proof.context
76 val match_bind_i: bool -> (term list * term) list -> Proof.context -> term list * Proof.context
77 val read_propp: Proof.context * (string * string list) list list
78 -> Proof.context * (term * term list) list list
79 val cert_propp: Proof.context * (term * term list) list list
80 -> Proof.context * (term * term list) list list
81 val read_propp_schematic: Proof.context * (string * string list) list list
82 -> Proof.context * (term * term list) list list
83 val cert_propp_schematic: Proof.context * (term * term list) list list
84 -> Proof.context * (term * term list) list list
85 val bind_propp: Proof.context * (string * string list) list list
86 -> Proof.context * (term list list * (Proof.context -> Proof.context))
87 val bind_propp_i: Proof.context * (term * term list) list list
88 -> Proof.context * (term list list * (Proof.context -> Proof.context))
89 val bind_propp_schematic: Proof.context * (string * string list) list list
90 -> Proof.context * (term list list * (Proof.context -> Proof.context))
91 val bind_propp_schematic_i: Proof.context * (term * term list) list list
92 -> Proof.context * (term list list * (Proof.context -> Proof.context))
93 val fact_tac: thm list -> int -> tactic
94 val some_fact_tac: Proof.context -> int -> tactic
95 val get_fact: Proof.context -> Facts.ref -> thm list
96 val get_fact_single: Proof.context -> Facts.ref -> thm
97 val get_thms: Proof.context -> xstring -> thm list
98 val get_thm: Proof.context -> xstring -> thm
99 val add_path: string -> Proof.context -> Proof.context
100 val mandatory_path: string -> Proof.context -> Proof.context
101 val restore_naming: Proof.context -> Proof.context -> Proof.context
102 val reset_naming: Proof.context -> Proof.context
103 val note_thmss: string -> (Thm.binding * (Facts.ref * attribute list) list) list ->
104 Proof.context -> (string * thm list) list * Proof.context
105 val note_thmss_i: string -> (Thm.binding * (thm list * attribute list) list) list ->
106 Proof.context -> (string * thm list) list * Proof.context
107 val put_thms: bool -> string * thm list option -> Proof.context -> Proof.context
108 val read_vars: (binding * string option * mixfix) list -> Proof.context ->
109 (binding * typ option * mixfix) list * Proof.context
110 val cert_vars: (binding * typ option * mixfix) list -> Proof.context ->
111 (binding * typ option * mixfix) list * Proof.context
112 val add_fixes: (binding * string option * mixfix) list ->
113 Proof.context -> string list * Proof.context
114 val add_fixes_i: (binding * typ option * mixfix) list ->
115 Proof.context -> string list * Proof.context
116 val auto_fixes: Proof.context * (term list list * 'a) -> Proof.context * (term list list * 'a)
117 val bind_fixes: string list -> Proof.context -> (term -> term) * Proof.context
118 val add_assms: Assumption.export ->
119 (Thm.binding * (string * string list) list) list ->
120 Proof.context -> (string * thm list) list * Proof.context
121 val add_assms_i: Assumption.export ->
122 (Thm.binding * (term * term list) list) list ->
123 Proof.context -> (string * thm list) list * Proof.context
124 val add_cases: bool -> (string * RuleCases.T option) list -> Proof.context -> Proof.context
125 val apply_case: RuleCases.T -> Proof.context -> (string * term list) list * Proof.context
126 val get_case: Proof.context -> string -> string option list -> RuleCases.T
127 val notation: bool -> Syntax.mode -> (term * mixfix) list -> Proof.context -> Proof.context
128 val target_notation: bool -> Syntax.mode -> (term * mixfix) list -> morphism ->
129 Context.generic -> Context.generic
130 val add_const_constraint: string * typ option -> Proof.context -> Proof.context
131 val add_abbrev: string -> Properties.T ->
132 binding * term -> Proof.context -> (term * term) * Proof.context
133 val revert_abbrev: string -> string -> Proof.context -> Proof.context
134 val verbose: bool ref
135 val setmp_verbose: ('a -> 'b) -> 'a -> 'b
136 val print_syntax: Proof.context -> unit
137 val print_abbrevs: Proof.context -> unit
138 val print_binds: Proof.context -> unit
139 val print_lthms: Proof.context -> unit
140 val print_cases: Proof.context -> unit
142 val prems_limit: int ref
143 val pretty_ctxt: Proof.context -> Pretty.T list
144 val pretty_context: Proof.context -> Pretty.T list
145 val query_type: Proof.context -> string -> Properties.T
146 val query_const: Proof.context -> string -> Properties.T
147 val query_class: Proof.context -> string -> Properties.T
150 structure ProofContext: PROOF_CONTEXT =
153 val theory_of = Context.theory_of_proof;
154 val init = Context.init_proof;
157 (** inner syntax mode **)
161 {stmt: bool, (*inner statement mode*)
162 pattern: bool, (*pattern binding schematic variables*)
163 schematic: bool, (*term referencing loose schematic variables*)
164 abbrev: bool}; (*abbrev mode -- no normalization*)
166 fun make_mode (stmt, pattern, schematic, abbrev) =
167 Mode {stmt = stmt, pattern = pattern, schematic = schematic, abbrev = abbrev};
169 val mode_default = make_mode (false, false, false, false);
170 val mode_stmt = make_mode (true, false, false, false);
171 val mode_pattern = make_mode (false, true, false, false);
172 val mode_schematic = make_mode (false, false, true, false);
173 val mode_abbrev = make_mode (false, false, false, true);
177 (** Isar proof context information **)
181 {mode: mode, (*inner syntax mode*)
182 naming: NameSpace.naming, (*local naming conventions*)
183 syntax: LocalSyntax.T, (*local syntax*)
184 consts: Consts.T * Consts.T, (*local/global consts*)
185 facts: Facts.T, (*local facts*)
186 cases: (string * (RuleCases.T * bool)) list}; (*named case contexts*)
188 fun make_ctxt (mode, naming, syntax, consts, facts, cases) =
189 Ctxt {mode = mode, naming = naming, syntax = syntax,
190 consts = consts, facts = facts, cases = cases};
192 val local_naming = NameSpace.default_naming |> NameSpace.add_path "local";
194 structure ContextData = ProofDataFun
198 make_ctxt (mode_default, local_naming, LocalSyntax.init thy,
199 (Sign.consts_of thy, Sign.consts_of thy), Facts.empty, []);
202 fun rep_context ctxt = ContextData.get ctxt |> (fn Ctxt args => args);
205 ContextData.map (fn Ctxt {mode, naming, syntax, consts, facts, cases} =>
206 make_ctxt (f (mode, naming, syntax, consts, facts, cases)));
208 fun set_mode mode = map_context (fn (_, naming, syntax, consts, facts, cases) =>
209 (mode, naming, syntax, consts, facts, cases));
212 map_context (fn (Mode {stmt, pattern, schematic, abbrev}, naming, syntax, consts, facts, cases) =>
213 (make_mode (f (stmt, pattern, schematic, abbrev)), naming, syntax, consts, facts, cases));
216 map_context (fn (mode, naming, syntax, consts, facts, cases) =>
217 (mode, f naming, syntax, consts, facts, cases));
220 map_context (fn (mode, naming, syntax, consts, facts, cases) =>
221 (mode, naming, f syntax, consts, facts, cases));
224 map_context (fn (mode, naming, syntax, consts, facts, cases) =>
225 (mode, naming, syntax, f consts, facts, cases));
228 map_context (fn (mode, naming, syntax, consts, facts, cases) =>
229 (mode, naming, syntax, consts, f facts, cases));
232 map_context (fn (mode, naming, syntax, consts, facts, cases) =>
233 (mode, naming, syntax, consts, facts, f cases));
235 val get_mode = #mode o rep_context;
236 val restore_mode = set_mode o get_mode;
237 val abbrev_mode = get_mode #> (fn Mode {abbrev, ...} => abbrev);
240 map_mode (fn (_, pattern, schematic, abbrev) => (stmt, pattern, schematic, abbrev));
242 val naming_of = #naming o rep_context;
243 val full_name = NameSpace.full_name o naming_of;
245 val syntax_of = #syntax o rep_context;
246 val syn_of = LocalSyntax.syn_of o syntax_of;
247 val set_syntax_mode = map_syntax o LocalSyntax.set_mode;
248 val restore_syntax_mode = map_syntax o LocalSyntax.restore_mode o syntax_of;
250 val consts_of = #1 o #consts o rep_context;
251 val const_syntax_name = Consts.syntax_name o consts_of;
252 val the_const_constraint = Consts.the_constraint o consts_of;
254 fun mk_const ctxt (c, Ts) = Const (c, Consts.instance (consts_of ctxt) (c, Ts));
256 val facts_of = #facts o rep_context;
257 val cases_of = #cases o rep_context;
260 (* theory transfer *)
262 fun transfer_syntax thy =
263 map_syntax (LocalSyntax.rebuild thy) #>
264 map_consts (fn consts as (local_consts, global_consts) =>
265 let val thy_consts = Sign.consts_of thy in
266 if Consts.eq_consts (thy_consts, global_consts) then consts
267 else (Consts.merge (local_consts, thy_consts), thy_consts)
270 fun transfer thy = Context.transfer_proof thy #> transfer_syntax thy;
272 fun theory f ctxt = transfer (f (theory_of ctxt)) ctxt;
274 fun theory_result f ctxt =
275 let val (res, thy') = f (theory_of ctxt)
276 in (res, ctxt |> transfer thy') end;
280 (** pretty printing **)
284 fun extern_fact ctxt name =
286 val local_facts = facts_of ctxt;
287 val global_facts = PureThy.facts_of (theory_of ctxt);
289 if is_some (Facts.lookup (Context.Proof ctxt) local_facts name)
290 then Facts.extern local_facts name
291 else Facts.extern global_facts name
297 fun pretty_term_abbrev ctxt = Syntax.pretty_term (set_mode mode_abbrev ctxt);
299 fun pretty_thm_legacy th =
300 let val thy = Thm.theory_of_thm th
301 in Display.pretty_thm_aux (Syntax.pp_global thy) true false [] th end;
303 fun pretty_thm ctxt th =
304 let val asms = map Thm.term_of (Assumption.assms_of ctxt)
305 in Display.pretty_thm_aux (Syntax.pp ctxt) false true asms th end;
307 fun pretty_thms ctxt [th] = pretty_thm ctxt th
308 | pretty_thms ctxt ths = Pretty.blk (0, Pretty.fbreaks (map (pretty_thm ctxt) ths));
310 fun pretty_fact_name ctxt a = Pretty.block
311 [Pretty.markup (Markup.fact a) [Pretty.str (extern_fact ctxt a)], Pretty.str ":"];
313 fun pretty_fact ctxt ("", ths) = pretty_thms ctxt ths
314 | pretty_fact ctxt (a, [th]) = Pretty.block
315 [pretty_fact_name ctxt a, Pretty.brk 1, pretty_thm ctxt th]
316 | pretty_fact ctxt (a, ths) = Pretty.block
317 (Pretty.fbreaks (pretty_fact_name ctxt a :: map (pretty_thm ctxt) ths));
319 val string_of_thm = Pretty.string_of oo pretty_thm;
323 (** prepare types **)
327 fun read_typ_mode mode ctxt s =
328 Syntax.read_typ (Type.set_mode mode ctxt) s;
330 val read_typ = read_typ_mode Type.mode_default;
331 val read_typ_syntax = read_typ_mode Type.mode_syntax;
332 val read_typ_abbrev = read_typ_mode Type.mode_abbrev;
337 fun cert_typ_mode mode ctxt T =
338 Sign.certify_typ_mode mode (theory_of ctxt) T
339 handle TYPE (msg, _, _) => error msg;
341 val cert_typ = cert_typ_mode Type.mode_default;
342 val cert_typ_syntax = cert_typ_mode Type.mode_syntax;
343 val cert_typ_abbrev = cert_typ_mode Type.mode_abbrev;
347 (** prepare variables **)
349 (* internalize Skolem constants *)
351 val lookup_skolem = AList.lookup (op =) o Variable.fixes_of;
352 fun get_skolem ctxt x = the_default x (lookup_skolem ctxt x);
354 fun no_skolem internal x =
355 if can Name.dest_skolem x then
356 error ("Illegal reference to internal Skolem constant: " ^ quote x)
357 else if not internal andalso can Name.dest_internal x then
358 error ("Illegal reference to internal variable: " ^ quote x)
362 (* revert Skolem constants -- if possible *)
364 fun revert_skolem ctxt x =
365 (case find_first (fn (_, y) => y = x) (Variable.fixes_of ctxt) of
366 SOME (x', _) => if lookup_skolem ctxt x' = SOME x then x' else x
370 (* default token translations *)
374 fun free_or_skolem ctxt x =
375 (if can Name.dest_skolem x then Pretty.mark Markup.skolem (Pretty.str (revert_skolem ctxt x))
376 else Pretty.mark Markup.free (Pretty.str x))
378 (if Variable.is_fixed ctxt x orelse Syntax.is_pretty_global ctxt then Markup.fixed x
381 fun var_or_skolem _ s =
382 (case Lexicon.read_variable s of
384 (case try Name.dest_skolem x of
385 NONE => Pretty.mark Markup.var (Pretty.str s)
386 | SOME x' => Pretty.mark Markup.skolem
387 (Pretty.str (setmp show_question_marks true Term.string_of_vname (x', i))))
388 | NONE => Pretty.mark Markup.var (Pretty.str s));
390 fun class_markup _ c = (* FIXME authentic name *)
391 Pretty.mark (Markup.tclassN, []) (Pretty.str c);
393 fun plain_markup m _ s = Pretty.mark m (Pretty.str s);
396 Syntax.tokentrans_mode ""
397 [("class", class_markup),
398 ("tfree", plain_markup Markup.tfree),
399 ("tvar", plain_markup Markup.tvar),
400 ("free", free_or_skolem),
401 ("bound", plain_markup Markup.bound),
402 ("var", var_or_skolem),
403 ("numeral", plain_markup Markup.numeral),
404 ("inner_string", plain_markup Markup.inner_string)];
406 in val _ = Context.>> (Context.map_theory (Sign.add_tokentrfuns token_trans)) end;
410 (** prepare terms and propositions **)
412 (* inferred types of parameters *)
414 fun infer_type ctxt x =
415 Term.fastype_of (singleton (Syntax.check_terms (set_mode mode_schematic ctxt))
418 fun inferred_param x ctxt =
419 let val T = infer_type ctxt x
420 in (T, ctxt |> Variable.declare_term (Free (x, T))) end;
422 fun inferred_fixes ctxt =
424 val xs = rev (map #2 (Variable.fixes_of ctxt));
425 val (Ts, ctxt') = fold_map inferred_param xs ctxt;
426 in (xs ~~ Ts, ctxt') end;
429 (* type and constant names *)
433 val token_content = Syntax.read_token #>> SymbolPos.content;
435 fun prep_const_proper ctxt (c, pos) =
436 let val t as (Const (d, _)) =
437 (case Variable.lookup_const ctxt c of
438 SOME d => Const (d, Consts.type_scheme (consts_of ctxt) d handle TYPE (msg, _, _) => error msg)
439 | NONE => Consts.read_const (consts_of ctxt) c)
440 in Position.report (Markup.const d) pos; t end;
444 fun read_tyname ctxt str =
446 val thy = theory_of ctxt;
447 val (c, pos) = token_content str;
449 if Syntax.is_tid c then
450 (Position.report Markup.tfree pos;
451 TFree (c, the_default (Sign.defaultS thy) (Variable.def_sort ctxt (c, ~1))))
454 val d = Sign.intern_type thy c;
455 val _ = Position.report (Markup.tycon d) pos;
456 in Type (d, replicate (Sign.arity_number thy d) dummyT) end
459 fun read_const_proper ctxt = prep_const_proper ctxt o token_content;
461 fun read_const ctxt str =
462 let val (c, pos) = token_content str in
463 (case (lookup_skolem ctxt c, Variable.is_const ctxt c) of
465 (Position.report (Markup.name x
466 (if can Name.dest_skolem x then Markup.skolem else Markup.free)) pos;
467 Free (x, infer_type ctxt x))
468 | _ => prep_const_proper ctxt (c, pos))
476 fun read_term_mode mode ctxt = Syntax.read_term (set_mode mode ctxt);
478 val read_term_pattern = read_term_mode mode_pattern;
479 val read_term_schematic = read_term_mode mode_schematic;
480 val read_term_abbrev = read_term_mode mode_abbrev;
483 (* local abbreviations *)
485 val tsig_of = Sign.tsig_of o ProofContext.theory_of;
489 fun certify_consts ctxt = Consts.certify (Syntax.pp ctxt) (tsig_of ctxt)
490 (not (abbrev_mode ctxt)) (consts_of ctxt);
492 fun reject_schematic (Var (xi, _)) =
493 error ("Unbound schematic variable: " ^ Term.string_of_vname xi)
494 | reject_schematic (Abs (_, _, t)) = reject_schematic t
495 | reject_schematic (t $ u) = (reject_schematic t; reject_schematic u)
496 | reject_schematic _ = ();
498 fun expand_binds ctxt =
499 let val Mode {pattern, schematic, ...} = get_mode ctxt in
501 else Variable.expand_binds ctxt #> (if schematic then I else tap reject_schematic)
506 fun expand_abbrevs ctxt = certify_consts ctxt #> expand_binds ctxt;
511 fun contract_abbrevs ctxt t =
513 val thy = theory_of ctxt;
514 val consts = consts_of ctxt;
515 val Mode {abbrev, ...} = get_mode ctxt;
517 if abbrev orelse print_mode_active "no_abbrevs" orelse not (can Term.type_of t) then t
518 else t |> Pattern.rewrite_term thy (Consts.abbrevs_of consts (print_mode_value () @ [""])) []
524 fun prepare_patternT ctxt =
525 let val Mode {pattern, schematic, ...} = get_mode ctxt in
526 if pattern orelse schematic then I
528 (fn T as TVar (xi, _) =>
529 if not (TypeInfer.is_param xi)
530 then error ("Illegal schematic type variable: " ^ Term.string_of_vname xi)
538 structure AllowDummies = ProofDataFun(type T = bool fun init _ = false);
540 fun check_dummies ctxt t =
541 if AllowDummies.get ctxt then t
542 else Term.no_dummy_patterns t handle TERM _ => error "Illegal dummy pattern(s) in term";
544 fun prepare_dummies ts = #1 (fold_map Term.replace_dummy_patterns ts 1);
548 val allow_dummies = AllowDummies.put true;
550 fun prepare_patterns ctxt =
551 let val Mode {pattern, ...} = get_mode ctxt in
552 TypeInfer.fixate_params (Variable.names_of ctxt) #>
553 pattern ? Variable.polymorphic ctxt #>
554 (map o Term.map_types) (prepare_patternT ctxt) #>
555 (if pattern then prepare_dummies else map (check_dummies ctxt))
561 (* decoding raw terms (syntax trees) *)
565 fun get_sort thy def_sort raw_env =
567 val tsig = Sign.tsig_of thy;
569 fun eq ((xi, S), (xi', S')) =
570 Term.eq_ix (xi, xi') andalso Type.eq_sort tsig (S, S');
571 val env = distinct eq raw_env;
572 val _ = (case duplicates (eq_fst (op =)) env of [] => ()
573 | dups => error ("Inconsistent sort constraints for type variable(s) "
574 ^ commas_quote (map (Term.string_of_vname' o fst) dups)));
577 (case (AList.lookup (op =) env xi, def_sort xi) of
578 (NONE, NONE) => Type.defaultS tsig
579 | (NONE, SOME S) => S
580 | (SOME S, NONE) => S
581 | (SOME S, SOME S') =>
582 if Type.eq_sort tsig (S, S') then S'
583 else error ("Sort constraint inconsistent with default for type variable " ^
584 quote (Term.string_of_vname' xi)));
589 fun intern_skolem ctxt def_type x =
591 val _ = no_skolem false x;
592 val sko = lookup_skolem ctxt x;
593 val is_const = can (read_const_proper ctxt) x orelse Long_Name.is_qualified x;
594 val is_declared = is_some (def_type (x, ~1));
596 if Variable.is_const ctxt x then NONE
597 else if is_some sko then sko
598 else if not is_const orelse is_declared then SOME x
604 fun term_context ctxt =
605 let val thy = theory_of ctxt in
606 {get_sort = get_sort thy (Variable.def_sort ctxt),
607 map_const = fn a => ((true, #1 (Term.dest_Const (read_const_proper ctxt a)))
608 handle ERROR _ => (false, Consts.intern (consts_of ctxt) a)),
609 map_free = intern_skolem ctxt (Variable.def_type ctxt false),
610 map_type = Sign.intern_tycons thy,
611 map_sort = Sign.intern_sort thy}
614 fun decode_term ctxt =
615 let val {get_sort, map_const, map_free, map_type, map_sort} = term_context ctxt
616 in Syntax.decode_term get_sort map_const map_free map_type map_sort end;
625 fun gen_cert prop ctxt t =
627 |> expand_abbrevs ctxt
628 |> (fn t' => #1 (Sign.certify' prop (Syntax.pp ctxt) false (consts_of ctxt) (theory_of ctxt) t')
629 handle TYPE (msg, _, _) => error msg
630 | TERM (msg, _) => error msg);
634 val cert_term = gen_cert false;
635 val cert_prop = gen_cert true;
640 (* type checking/inference *)
642 fun standard_infer_types ctxt ts =
643 let val Mode {pattern, ...} = get_mode ctxt in
644 TypeInfer.infer_types (Syntax.pp ctxt) (tsig_of ctxt) (Syntax.check_typs ctxt)
645 (try (Consts.the_constraint (consts_of ctxt))) (Variable.def_type ctxt pattern)
646 (Variable.names_of ctxt) (Variable.maxidx_of ctxt) ts
647 handle TYPE (msg, _, _) => error msg
652 fun standard_typ_check ctxt =
653 map (cert_typ_mode (Type.get_mode ctxt) ctxt) #>
654 map (prepare_patternT ctxt);
656 fun standard_term_check ctxt =
657 standard_infer_types ctxt #>
658 map (expand_abbrevs ctxt);
660 fun standard_term_uncheck ctxt =
661 map (contract_abbrevs ctxt);
663 fun add eq what f = Context.>> (what (fn xs => fn ctxt =>
664 let val xs' = f ctxt xs in if eq_list eq (xs, xs') then NONE else SOME (xs', ctxt) end));
668 val _ = add (op =) (Syntax.add_typ_check 0 "standard") standard_typ_check;
669 val _ = add (op aconv) (Syntax.add_term_check 0 "standard") standard_term_check;
670 val _ = add (op aconv) (Syntax.add_term_check 100 "fixate") prepare_patterns;
672 val _ = add (op aconv) (Syntax.add_term_uncheck 0 "standard") standard_term_uncheck;
678 (** inner syntax operations **)
682 fun parse_sort ctxt text =
684 val (syms, pos) = Syntax.parse_token Markup.sort text;
685 val S = Syntax.standard_parse_sort ctxt (syn_of ctxt)
686 (Sign.intern_sort (theory_of ctxt)) (syms, pos)
687 handle ERROR msg => cat_error msg ("Failed to parse sort" ^ Position.str_of pos)
690 fun parse_typ ctxt text =
692 val thy = ProofContext.theory_of ctxt;
693 val get_sort = get_sort thy (Variable.def_sort ctxt);
695 val (syms, pos) = Syntax.parse_token Markup.typ text;
696 val T = Sign.intern_tycons thy
697 (Syntax.standard_parse_typ ctxt (syn_of ctxt) get_sort (Sign.intern_sort thy) (syms, pos))
698 handle ERROR msg => cat_error msg ("Failed to parse type" ^ Position.str_of pos);
701 fun parse_term T ctxt text =
703 val thy = theory_of ctxt;
704 val {get_sort, map_const, map_free, map_type, map_sort} = term_context ctxt;
706 val (T', _) = TypeInfer.paramify_dummies T 0;
707 val (markup, kind) = if T' = propT then (Markup.prop, "proposition") else (Markup.term, "term");
708 val (syms, pos) = Syntax.parse_token markup text;
710 fun check t = (Syntax.check_term ctxt (TypeInfer.constrain T' t); NONE)
711 handle ERROR msg => SOME msg;
712 val t = Syntax.standard_parse_term (Syntax.pp ctxt) check get_sort map_const map_free
713 map_type map_sort ctxt (Sign.is_logtype thy) (syn_of ctxt) T' (syms, pos)
714 handle ERROR msg => cat_error msg ("Failed to parse " ^ kind ^ Position.str_of pos);
718 fun unparse_sort ctxt S =
719 Syntax.standard_unparse_sort ctxt (syn_of ctxt) (Sign.extern_sort (theory_of ctxt) S);
721 fun unparse_typ ctxt T =
722 Syntax.standard_unparse_typ ctxt (syn_of ctxt) (Sign.extern_typ (theory_of ctxt) T);
724 fun unparse_term ctxt t =
726 val thy = theory_of ctxt;
727 val syntax = syntax_of ctxt;
728 val consts = consts_of ctxt;
731 |> Sign.extern_term (Consts.extern_early consts) thy
732 |> LocalSyntax.extern_term syntax
733 |> Syntax.standard_unparse_term (Consts.extern consts) ctxt (LocalSyntax.syn_of syntax)
734 (not (PureThy.old_appl_syntax thy))
739 val _ = Syntax.install_operations
740 {parse_sort = parse_sort,
741 parse_typ = parse_typ,
742 parse_term = parse_term dummyT,
743 parse_prop = parse_term propT,
744 unparse_sort = unparse_sort,
745 unparse_typ = unparse_typ,
746 unparse_term = unparse_term};
752 (** export results **)
754 fun common_export is_goal inner outer =
755 map (Assumption.export is_goal inner outer) #>
756 Variable.export inner outer;
758 val goal_export = common_export true;
759 val export = common_export false;
761 fun export_morphism inner outer =
762 Assumption.export_morphism inner outer $>
763 Variable.export_morphism inner outer;
765 fun norm_export_morphism inner outer =
766 export_morphism inner outer $>
767 Morphism.thm_morphism Goal.norm_result;
775 fun simult_matches ctxt (t, pats) =
776 (case Seq.pull (Unify.matchers (theory_of ctxt) (map (rpair t) pats)) of
777 NONE => error "Pattern match failed!"
778 | SOME (env, _) => map (apsnd snd) (Envir.alist_of env));
785 fun gen_bind prep (xi as (x, _), raw_t) ctxt =
787 |> Variable.add_binds [(xi, Option.map (prep (set_mode mode_default ctxt)) raw_t)];
791 fun drop_schematic (b as (xi, SOME t)) = if Term.exists_subterm is_Var t then (xi, NONE) else b
792 | drop_schematic b = b;
794 val add_binds = fold (gen_bind Syntax.read_term);
795 val add_binds_i = fold (gen_bind cert_term);
797 fun auto_bind f ts ctxt = ctxt |> add_binds_i (map drop_schematic (f (theory_of ctxt) ts));
798 val auto_bind_goal = auto_bind AutoBind.goal;
799 val auto_bind_facts = auto_bind AutoBind.facts;
808 fun gen_bind prep_terms gen raw_binds ctxt =
810 fun prep_bind (raw_pats, t) ctxt1 =
812 val T = Term.fastype_of t;
813 val ctxt2 = Variable.declare_term t ctxt1;
814 val pats = prep_terms (set_mode mode_pattern ctxt2) T raw_pats;
815 val binds = simult_matches ctxt2 (t, pats);
816 in (binds, ctxt2) end;
818 val ts = prep_terms ctxt dummyT (map snd raw_binds);
819 val (binds, ctxt') = apfst flat (fold_map prep_bind (map fst raw_binds ~~ ts) ctxt);
821 if gen then map #1 binds ~~ Variable.exportT_terms ctxt' ctxt (map #2 binds)
823 val binds'' = map (apsnd SOME) binds';
825 tap (Variable.warn_extra_tfrees ctxt)
827 ctxt (*sic!*) |> fold Variable.declare_term (map #2 binds') |> add_binds_i binds''
828 else ctxt' |> add_binds_i binds'');
833 fun read_terms ctxt T =
834 map (Syntax.parse_term ctxt #> TypeInfer.constrain T) #> Syntax.check_terms ctxt;
836 val match_bind = gen_bind read_terms;
837 val match_bind_i = gen_bind (fn ctxt => fn _ => map (cert_term ctxt));
842 (* propositions with patterns *)
846 fun prep_propp mode prep_props (context, args) =
848 fun prep (_, raw_pats) (ctxt, prop :: props) =
849 let val ctxt' = Variable.declare_term prop ctxt
850 in ((prop, prep_props (set_mode mode_pattern ctxt') raw_pats), (ctxt', props)) end;
852 val (propp, (context', _)) = (fold_map o fold_map) prep args
853 (context, prep_props (set_mode mode context) (maps (map fst) args));
854 in (context', propp) end;
856 fun gen_bind_propp mode parse_prop (ctxt, raw_args) =
858 val (ctxt', args) = prep_propp mode parse_prop (ctxt, raw_args);
859 val binds = flat (flat (map (map (simult_matches ctxt')) args));
860 val propss = map (map #1) args;
862 (*generalize result: context evaluated now, binds added later*)
863 val gen = Variable.exportT_terms ctxt' ctxt;
864 fun gen_binds c = c |> add_binds_i (map #1 binds ~~ map SOME (gen (map #2 binds)));
865 in (ctxt' |> add_binds_i (map (apsnd SOME) binds), (propss, gen_binds)) end;
869 val read_propp = prep_propp mode_default Syntax.read_props;
870 val cert_propp = prep_propp mode_default (map o cert_prop);
871 val read_propp_schematic = prep_propp mode_schematic Syntax.read_props;
872 val cert_propp_schematic = prep_propp mode_schematic (map o cert_prop);
874 val bind_propp = gen_bind_propp mode_default Syntax.read_props;
875 val bind_propp_i = gen_bind_propp mode_default (map o cert_prop);
876 val bind_propp_schematic = gen_bind_propp mode_schematic Syntax.read_props;
877 val bind_propp_schematic_i = gen_bind_propp mode_schematic (map o cert_prop);
887 fun comp_incr_tac [] _ = no_tac
888 | comp_incr_tac (th :: ths) i =
889 (fn st => Goal.compose_hhf_tac (Drule.incr_indexes st th) i st) APPEND comp_incr_tac ths i;
891 fun fact_tac facts = Goal.norm_hhf_tac THEN' comp_incr_tac facts;
893 fun potential_facts ctxt prop =
894 Facts.could_unify (facts_of ctxt) (Term.strip_all_body prop);
896 fun some_fact_tac ctxt = SUBGOAL (fn (goal, i) => fact_tac (potential_facts ctxt goal) i);
903 fun retrieve_thms pick ctxt (Facts.Fact s) =
905 val (_, pos) = Syntax.read_token s;
906 val prop = Syntax.read_prop (set_mode mode_default ctxt) s
907 |> singleton (Variable.polymorphic ctxt);
910 Goal.prove ctxt [] [] prop (K (ALLGOALS (fact_tac [th])))
911 |> Thm.default_position_of th;
913 (case get_first (try prove_fact) (potential_facts ctxt prop) of
915 | NONE => error ("Failed to retrieve literal fact" ^ Position.str_of pos ^ ":\n" ^
916 Syntax.string_of_term ctxt prop))
918 | retrieve_thms pick ctxt xthmref =
920 val thy = theory_of ctxt;
921 val local_facts = facts_of ctxt;
922 val thmref = Facts.map_name_of_ref (Facts.intern local_facts) xthmref;
923 val name = Facts.name_of_ref thmref;
924 val pos = Facts.pos_of_ref xthmref;
926 if name = "" then [Thm.transfer thy Drule.dummy_thm]
928 (case Facts.lookup (Context.Proof ctxt) local_facts name of
929 SOME (_, ths) => (Position.report (Markup.local_fact name) pos;
930 map (Thm.transfer thy) (Facts.select thmref ths))
931 | NONE => PureThy.get_fact (Context.Proof ctxt) thy xthmref);
932 in pick name thms end;
936 val get_fact = retrieve_thms (K I);
937 val get_fact_single = retrieve_thms Facts.the_single;
939 fun get_thms ctxt = get_fact ctxt o Facts.named;
940 fun get_thm ctxt = get_fact_single ctxt o Facts.named;
945 (* name space operations *)
947 val add_path = map_naming o NameSpace.add_path;
948 val mandatory_path = map_naming o NameSpace.mandatory_path;
949 val restore_naming = map_naming o K o naming_of;
950 val reset_naming = map_naming (K local_naming);
957 fun update_thms _ (b, NONE) ctxt = ctxt |> map_facts (Facts.del (full_name ctxt b))
958 | update_thms do_props (b, SOME ths) ctxt = ctxt |> map_facts
959 (Facts.add_local do_props (naming_of ctxt) (b, ths) #> snd);
961 fun gen_note_thmss get k = fold_map (fn ((b, more_attrs), raw_facts) => fn ctxt =>
963 val pos = Binding.pos_of b;
964 val name = full_name ctxt b;
965 val _ = ContextPosition.report_visible ctxt (Markup.local_fact_decl name) pos;
967 val facts = PureThy.name_thmss false pos name (map (apfst (get ctxt)) raw_facts);
968 fun app (th, attrs) x =
969 swap (Library.foldl_map (Thm.proof_attributes (surround (Thm.kind k) (attrs @ more_attrs))) (x, th));
970 val (res, ctxt') = fold_map app facts ctxt;
971 val thms = PureThy.name_thms false false pos name (flat res);
972 val Mode {stmt, ...} = get_mode ctxt;
973 in ((name, thms), ctxt' |> update_thms stmt (b, SOME thms)) end);
977 fun note_thmss k = gen_note_thmss get_fact k;
978 fun note_thmss_i k = gen_note_thmss (K I) k;
980 fun put_thms do_props thms ctxt = ctxt
981 |> map_naming (K local_naming)
982 |> ContextPosition.set_visible false
983 |> update_thms do_props (apfst Binding.name thms)
984 |> ContextPosition.restore_visible ctxt
985 |> restore_naming ctxt;
995 fun declare_var (x, opt_T, mx) ctxt =
996 let val T = (case opt_T of SOME T => T | NONE => Syntax.mixfixT mx)
997 in ((x, T, mx), ctxt |> Variable.declare_constraints (Free (x, T))) end;
1001 fun prep_vars prep_typ internal =
1002 fold_map (fn (raw_b, raw_T, raw_mx) => fn ctxt =>
1004 val raw_x = Binding.name_of raw_b;
1005 val (x, mx) = Syntax.const_mixfix raw_x raw_mx;
1006 val _ = Syntax.is_identifier (no_skolem internal x) orelse
1007 error ("Illegal variable name: " ^ quote x);
1011 else Type.no_tvars T handle TYPE (msg, _, _) => error msg;
1012 val opt_T = Option.map (cond_tvars o cert_typ ctxt o prep_typ ctxt) raw_T;
1013 val var = (Binding.map_name (K x) raw_b, opt_T, mx);
1014 in (var, ctxt |> declare_var (x, opt_T, mx) |> #2) end);
1018 val read_vars = prep_vars Syntax.parse_typ false;
1019 val cert_vars = prep_vars (K I) true;
1024 (* authentic constants *)
1028 fun const_ast_tr intern ctxt [Syntax.Variable c] =
1030 val Const (c', _) = read_const_proper ctxt c;
1031 val d = if intern then const_syntax_name ctxt c' else c;
1032 in Syntax.Constant d end
1033 | const_ast_tr _ _ asts = raise Syntax.AST ("const_ast_tr", asts);
1037 val _ = Context.>> (Context.map_theory
1039 [("_context_const", "id => logic", Delimfix "CONST _"),
1040 ("_context_const", "id => aprop", Delimfix "CONST _"),
1041 ("_context_const", "longid => logic", Delimfix "CONST _"),
1042 ("_context_const", "longid => aprop", Delimfix "CONST _"),
1043 ("_context_xconst", "id => logic", Delimfix "XCONST _"),
1044 ("_context_xconst", "id => aprop", Delimfix "XCONST _"),
1045 ("_context_xconst", "longid => logic", Delimfix "XCONST _"),
1046 ("_context_xconst", "longid => aprop", Delimfix "XCONST _")] #>
1047 Sign.add_advanced_trfuns
1048 ([("_context_const", const_ast_tr true), ("_context_xconst", const_ast_tr false)], [], [], [])));
1057 fun const_syntax ctxt (Free (x, T), mx) = SOME (true, (x, T, mx))
1058 | const_syntax ctxt (Const (c, _), mx) =
1059 Option.map (pair false) (try (Consts.syntax (consts_of ctxt)) (c, mx))
1060 | const_syntax _ _ = NONE;
1064 fun notation add mode args ctxt =
1066 (LocalSyntax.update_modesyntax (theory_of ctxt) add mode (map_filter (const_syntax ctxt) args));
1068 fun target_notation add mode args phi =
1069 let val args' = filter (fn (t, _) => Type.similar_types (t, Morphism.term phi t)) args;
1070 in Context.mapping (Sign.notation add mode args') (notation add mode args') end;
1075 (* local constants *)
1077 fun add_const_constraint (c, opt_T) ctxt =
1080 let val T = cert_typ ctxt raw_T
1081 in cert_term ctxt (Const (c, T)); T end;
1082 in ctxt |> (map_consts o apfst) (Consts.constrain (c, Option.map prepT opt_T)) end;
1084 fun add_abbrev mode tags (b, raw_t) ctxt =
1086 val t0 = cert_term (ctxt |> set_mode mode_abbrev) raw_t
1087 handle ERROR msg => cat_error msg ("in constant abbreviation " ^ quote (Binding.str_of b));
1088 val [t] = Variable.exportT_terms (Variable.declare_term t0 ctxt) ctxt [t0];
1089 val ((lhs, rhs), consts') = consts_of ctxt
1090 |> Consts.abbreviate (Syntax.pp ctxt) (tsig_of ctxt) (naming_of ctxt) mode tags (b, t);
1093 |> (map_consts o apfst) (K consts')
1094 |> Variable.declare_term rhs
1098 fun revert_abbrev mode c = (map_consts o apfst) (Consts.revert_abbrev mode c);
1105 fun prep_mixfix (x, T, mx) =
1106 if mx <> NoSyn andalso mx <> Structure andalso
1107 (can Name.dest_internal x orelse can Name.dest_skolem x) then
1108 error ("Illegal mixfix syntax for internal/skolem constant " ^ quote x)
1109 else (true, (x, T, mx));
1111 fun gen_fixes prep raw_vars ctxt =
1113 val (vars, _) = prep raw_vars ctxt;
1114 val (xs', ctxt') = Variable.add_fixes (map (Binding.name_of o #1) vars) ctxt;
1117 |> fold_map declare_var (map2 (fn x' => fn (_, T, mx) => (x', T, mx)) xs' vars)
1118 |-> (map_syntax o LocalSyntax.add_syntax (theory_of ctxt) o map prep_mixfix);
1119 val _ = (vars ~~ xs') |> List.app (fn ((b, _, _), x') =>
1120 ContextPosition.report_visible ctxt (Markup.fixed_decl x') (Binding.pos_of b));
1121 in (xs', ctxt'') end;
1125 val add_fixes = gen_fixes read_vars;
1126 val add_fixes_i = gen_fixes cert_vars;
1131 (* fixes vs. frees *)
1133 fun auto_fixes (arg as (ctxt, (propss, x))) =
1134 ((fold o fold) Variable.auto_fixes propss ctxt, (propss, x));
1136 fun bind_fixes xs ctxt =
1138 val (_, ctxt') = ctxt |> add_fixes_i (map (fn x => (Binding.name x, NONE, NoSyn)) xs);
1139 fun bind (t as Free (x, T)) =
1140 if member (op =) xs x then
1141 (case lookup_skolem ctxt' x of SOME x' => Free (x', T) | NONE => t)
1143 | bind (t $ u) = bind t $ bind u
1144 | bind (Abs (x, T, t)) = Abs (x, T, bind t)
1146 in (bind, ctxt') end;
1154 fun gen_assms prepp exp args ctxt =
1156 val cert = Thm.cterm_of (theory_of ctxt);
1157 val (propss, ctxt1) = swap (prepp (ctxt, map snd args));
1158 val _ = Variable.warn_extra_tfrees ctxt ctxt1;
1159 val (premss, ctxt2) = fold_burrow (Assumption.add_assms exp o map cert) propss ctxt1;
1162 |> auto_bind_facts (flat propss)
1163 |> note_thmss_i Thm.assumptionK (map fst args ~~ map (map (fn th => ([th], []))) premss)
1168 val add_assms = gen_assms (apsnd #1 o bind_propp);
1169 val add_assms_i = gen_assms (apsnd #1 o bind_propp_i);
1179 fun rem_case name = remove (fn (x: string, (y, _)) => x = y) name;
1181 fun add_case _ ("", _) cases = cases
1182 | add_case _ (name, NONE) cases = rem_case name cases
1183 | add_case is_proper (name, SOME c) cases = (name, (c, is_proper)) :: rem_case name cases;
1185 fun prep_case name fxs c =
1187 fun replace (opt_x :: xs) ((y, T) :: ys) = (the_default y opt_x, T) :: replace xs ys
1188 | replace [] ys = ys
1189 | replace (_ :: _) [] = error ("Too many parameters for case " ^ quote name);
1190 val RuleCases.Case {fixes, assumes, binds, cases} = c;
1191 val fixes' = replace fxs fixes;
1192 val binds' = map drop_schematic binds;
1194 if null (fold (Term.add_tvarsT o snd) fixes []) andalso
1195 null (fold (fold Term.add_vars o snd) assumes []) then
1196 RuleCases.Case {fixes = fixes', assumes = assumes, binds = binds', cases = cases}
1197 else error ("Illegal schematic variable(s) in case " ^ quote name)
1200 fun fix (x, T) ctxt =
1202 val (bind, ctxt') = bind_fixes [x] ctxt;
1203 val t = bind (Free (x, T));
1204 in (t, ctxt' |> Variable.declare_constraints t) end;
1208 fun add_cases is_proper = map_cases o fold (add_case is_proper);
1210 fun case_result c ctxt =
1212 val RuleCases.Case {fixes, ...} = c;
1213 val (ts, ctxt') = ctxt |> fold_map fix fixes;
1214 val RuleCases.Case {assumes, binds, cases, ...} = RuleCases.apply ts c;
1217 |> add_binds_i (map drop_schematic binds)
1218 |> add_cases true (map (apsnd SOME) cases)
1219 |> pair (assumes, (binds, cases))
1222 val apply_case = apfst fst oo case_result;
1224 fun get_case ctxt name xs =
1225 (case AList.lookup (op =) (cases_of ctxt) name of
1226 NONE => error ("Unknown case: " ^ quote name)
1227 | SOME (c, _) => prep_case name xs c);
1233 (** print context information **)
1235 val debug = ref false;
1237 val verbose = ref false;
1238 fun verb f x = if ! verbose then f (x ()) else [];
1240 fun setmp_verbose f x = Library.setmp verbose true f x;
1245 val print_syntax = Syntax.print_syntax o syn_of;
1250 fun pretty_abbrevs show_globals ctxt =
1252 val ((space, consts), (_, globals)) =
1253 pairself (#constants o Consts.dest) (#consts (rep_context ctxt));
1254 fun add_abbr (_, (_, NONE)) = I
1255 | add_abbr (c, (T, SOME t)) =
1256 if not show_globals andalso Symtab.defined globals c then I
1257 else cons (c, Logic.mk_equals (Const (c, T), t));
1258 val abbrevs = NameSpace.extern_table (space, Symtab.make (Symtab.fold add_abbr consts []));
1260 if null abbrevs andalso not (! verbose) then []
1261 else [Pretty.big_list "abbreviations:" (map (pretty_term_abbrev ctxt o #2) abbrevs)]
1264 val print_abbrevs = Pretty.writeln o Pretty.chunks o pretty_abbrevs true;
1269 fun pretty_binds ctxt =
1271 val binds = Variable.binds_of ctxt;
1272 fun prt_bind (xi, (T, t)) = pretty_term_abbrev ctxt (Logic.mk_equals (Var (xi, T), t));
1274 if Vartab.is_empty binds andalso not (! verbose) then []
1275 else [Pretty.big_list "term bindings:" (map prt_bind (Vartab.dest binds))]
1278 val print_binds = Pretty.writeln o Pretty.chunks o pretty_binds;
1281 (* local theorems *)
1283 fun pretty_lthms ctxt =
1285 val local_facts = facts_of ctxt;
1286 val props = Facts.props local_facts;
1288 (if null props then [] else [("unnamed", props)]) @
1289 Facts.dest_static [] local_facts;
1291 if null facts andalso not (! verbose) then []
1292 else [Pretty.big_list "facts:" (map #1 (sort_wrt (#1 o #2) (map (`(pretty_fact ctxt)) facts)))]
1295 val print_lthms = Pretty.writeln o Pretty.chunks o pretty_lthms;
1298 (* local contexts *)
1302 fun pretty_case (name, (fixes, ((asms, (lets, cs)), ctxt))) =
1304 val prt_term = Syntax.pretty_term ctxt;
1306 fun prt_let (xi, t) = Pretty.block
1307 [Pretty.quote (prt_term (Var (xi, Term.fastype_of t))), Pretty.str " =", Pretty.brk 1,
1308 Pretty.quote (prt_term t)];
1310 fun prt_asm (a, ts) = Pretty.block (Pretty.breaks
1311 ((if a = "" then [] else [Pretty.str (a ^ ":")]) @ map (Pretty.quote o prt_term) ts));
1313 fun prt_sect _ _ _ [] = []
1314 | prt_sect s sep prt xs = [Pretty.block (Pretty.breaks (Pretty.str s ::
1315 flat (Library.separate sep (map (Library.single o prt) xs))))];
1317 Pretty.block (Pretty.fbreaks
1318 (Pretty.str (name ^ ":") ::
1319 prt_sect "fix" [] (Pretty.str o fst) fixes @
1320 prt_sect "let" [Pretty.str "and"] prt_let
1321 (map_filter (fn (xi, SOME t) => SOME (xi, t) | _ => NONE) lets) @
1322 (if forall (null o #2) asms then []
1323 else prt_sect "assume" [Pretty.str "and"] prt_asm asms) @
1324 prt_sect "subcases:" [] (Pretty.str o fst) cs))
1329 fun pretty_cases ctxt =
1331 fun add_case (_, (_, false)) = I
1332 | add_case (name, (c as RuleCases.Case {fixes, ...}, true)) =
1333 cons (name, (fixes, case_result c ctxt));
1334 val cases = fold add_case (cases_of ctxt) [];
1336 if null cases andalso not (! verbose) then []
1337 else [Pretty.big_list "cases:" (map pretty_case cases)]
1340 val print_cases = Pretty.writeln o Pretty.chunks o pretty_cases;
1347 val prems_limit = ref ~1;
1349 fun pretty_ctxt ctxt =
1350 if ! prems_limit < 0 andalso not (! debug) then []
1353 val prt_term = Syntax.pretty_term ctxt;
1356 val structs = LocalSyntax.structs_of (syntax_of ctxt);
1357 val prt_structs = if null structs then []
1358 else [Pretty.block (Pretty.str "structures:" :: Pretty.brk 1 ::
1359 Pretty.commas (map Pretty.str structs))];
1362 fun prt_fix (x, x') =
1363 if x = x' then Pretty.str x
1364 else Pretty.block [Pretty.str x, Pretty.str " =", Pretty.brk 1, prt_term (Syntax.free x')];
1366 rev (filter_out ((can Name.dest_internal orf member (op =) structs) o #1)
1367 (Variable.fixes_of ctxt));
1368 val prt_fixes = if null fixes then []
1369 else [Pretty.block (Pretty.str "fixed variables:" :: Pretty.brk 1 ::
1370 Pretty.commas (map prt_fix fixes))];
1373 val prems = Assumption.prems_of ctxt;
1374 val len = length prems;
1375 val suppressed = len - ! prems_limit;
1376 val prt_prems = if null prems then []
1377 else [Pretty.big_list "prems:" ((if suppressed <= 0 then [] else [Pretty.str "..."]) @
1378 map (pretty_thm ctxt) (Library.drop (suppressed, prems)))];
1379 in prt_structs @ prt_fixes @ prt_prems end;
1384 fun pretty_context ctxt =
1386 val prt_term = Syntax.pretty_term ctxt;
1387 val prt_typ = Syntax.pretty_typ ctxt;
1388 val prt_sort = Syntax.pretty_sort ctxt;
1391 val pretty_thy = Pretty.block
1392 [Pretty.str "theory:", Pretty.brk 1, Context.pretty_thy (theory_of ctxt)];
1395 fun prt_atom prt prtT (x, X) = Pretty.block
1396 [prt x, Pretty.str " ::", Pretty.brk 1, prtT X];
1398 fun prt_var (x, ~1) = prt_term (Syntax.free x)
1399 | prt_var xi = prt_term (Syntax.var xi);
1401 fun prt_varT (x, ~1) = prt_typ (TFree (x, []))
1402 | prt_varT xi = prt_typ (TVar (xi, []));
1404 val prt_defT = prt_atom prt_var prt_typ;
1405 val prt_defS = prt_atom prt_varT prt_sort;
1407 val (types, sorts) = Variable.constraints_of ctxt;
1409 verb single (K pretty_thy) @
1411 verb (pretty_abbrevs false) (K ctxt) @
1412 verb pretty_binds (K ctxt) @
1413 verb pretty_lthms (K ctxt) @
1414 verb pretty_cases (K ctxt) @
1415 verb single (fn () => Pretty.big_list "type constraints:" (map prt_defT (Vartab.dest types))) @
1416 verb single (fn () => Pretty.big_list "default sorts:" (map prt_defS (Vartab.dest sorts)))
1420 (* query meta data *)
1422 val query_type = Type.the_tags o tsig_of;
1424 fun query_const ctxt name =
1425 Consts.the_tags (consts_of ctxt) name handle TYPE (msg, _, _) => error msg;
1427 fun query_class ctxt name = query_const ctxt (Logic.const_of_class name);