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 transfer_syntax: theory -> Proof.context -> Proof.context
41 val transfer: theory -> Proof.context -> Proof.context
42 val background_theory: (theory -> theory) -> Proof.context -> Proof.context
43 val background_theory_result: (theory -> 'a * theory) -> Proof.context -> 'a * Proof.context
44 val extern_fact: Proof.context -> string -> xstring
45 val pretty_term_abbrev: Proof.context -> term -> Pretty.T
46 val pretty_fact_aux: Proof.context -> bool -> string * thm list -> Pretty.T
47 val pretty_fact: Proof.context -> string * thm list -> Pretty.T
48 val read_class: Proof.context -> xstring -> class
49 val read_arity: Proof.context -> xstring * string list * string -> arity
50 val cert_arity: Proof.context -> arity -> arity
51 val read_typ: Proof.context -> string -> typ
52 val read_typ_syntax: Proof.context -> string -> typ
53 val read_typ_abbrev: Proof.context -> string -> typ
54 val cert_typ: Proof.context -> typ -> typ
55 val cert_typ_syntax: Proof.context -> typ -> typ
56 val cert_typ_abbrev: Proof.context -> typ -> typ
57 val get_skolem: Proof.context -> string -> string
58 val revert_skolem: Proof.context -> string -> string
59 val infer_type: Proof.context -> string * typ -> typ
60 val inferred_param: string -> Proof.context -> typ * Proof.context
61 val inferred_fixes: Proof.context -> (string * typ) list * Proof.context
62 val read_type_name: Proof.context -> bool -> string -> typ
63 val read_type_name_proper: Proof.context -> bool -> string -> typ
64 val read_const_proper: Proof.context -> bool -> string -> term
65 val read_const: Proof.context -> bool -> typ -> string -> term
66 val allow_dummies: Proof.context -> Proof.context
67 val check_tvar: Proof.context -> indexname * sort -> indexname * sort
68 val check_tfree: Proof.context -> string * sort -> string * sort
69 val get_sort: Proof.context -> (indexname * sort) list -> indexname -> sort
70 val type_context: Proof.context -> Syntax.type_context
71 val term_context: Proof.context -> Syntax.term_context
72 val decode_term: Proof.context ->
73 Position.reports * term Exn.result -> Position.reports * term Exn.result
74 val standard_infer_types: Proof.context -> term list -> term list
75 val read_term_pattern: Proof.context -> string -> term
76 val read_term_schematic: Proof.context -> string -> term
77 val read_term_abbrev: Proof.context -> string -> term
78 val show_abbrevs_raw: Config.raw
79 val show_abbrevs: bool Config.T
80 val expand_abbrevs: Proof.context -> term -> term
81 val cert_term: Proof.context -> term -> term
82 val cert_prop: Proof.context -> term -> term
83 val def_type: Proof.context -> indexname -> typ option
84 val goal_export: Proof.context -> Proof.context -> thm list -> thm list
85 val export: Proof.context -> Proof.context -> thm list -> thm list
86 val export_morphism: Proof.context -> Proof.context -> morphism
87 val norm_export_morphism: Proof.context -> Proof.context -> morphism
88 val bind_terms: (indexname * term option) list -> Proof.context -> Proof.context
89 val auto_bind_goal: term list -> Proof.context -> Proof.context
90 val auto_bind_facts: term list -> Proof.context -> Proof.context
91 val match_bind: bool -> (string list * string) list -> Proof.context -> term list * Proof.context
92 val match_bind_i: bool -> (term list * term) list -> Proof.context -> term list * Proof.context
93 val read_propp: Proof.context * (string * string list) list list
94 -> Proof.context * (term * term list) list list
95 val cert_propp: Proof.context * (term * term list) list list
96 -> Proof.context * (term * term list) list list
97 val read_propp_schematic: Proof.context * (string * string list) list list
98 -> Proof.context * (term * term list) list list
99 val cert_propp_schematic: Proof.context * (term * term list) list list
100 -> Proof.context * (term * term list) list list
101 val bind_propp: Proof.context * (string * string list) list list
102 -> Proof.context * (term list list * (Proof.context -> Proof.context))
103 val bind_propp_i: Proof.context * (term * term list) list list
104 -> Proof.context * (term list list * (Proof.context -> Proof.context))
105 val bind_propp_schematic: Proof.context * (string * string list) list list
106 -> Proof.context * (term list list * (Proof.context -> Proof.context))
107 val bind_propp_schematic_i: Proof.context * (term * term list) list list
108 -> Proof.context * (term list list * (Proof.context -> Proof.context))
109 val fact_tac: thm list -> int -> tactic
110 val some_fact_tac: Proof.context -> int -> tactic
111 val get_fact: Proof.context -> Facts.ref -> thm list
112 val get_fact_single: Proof.context -> Facts.ref -> thm
113 val get_thms: Proof.context -> xstring -> thm list
114 val get_thm: Proof.context -> xstring -> thm
115 val note_thmss: string -> (Thm.binding * (thm list * attribute list) list) list ->
116 Proof.context -> (string * thm list) list * Proof.context
117 val put_thms: bool -> string * thm list option -> Proof.context -> Proof.context
118 val read_vars: (binding * string option * mixfix) list -> Proof.context ->
119 (binding * typ option * mixfix) list * Proof.context
120 val cert_vars: (binding * typ option * mixfix) list -> Proof.context ->
121 (binding * typ option * mixfix) list * Proof.context
122 val add_fixes: (binding * typ option * mixfix) list -> Proof.context ->
123 string list * Proof.context
124 val auto_fixes: Proof.context * (term list list * 'a) -> Proof.context * (term list list * 'a)
125 val bind_fixes: string list -> Proof.context -> (term -> term) * Proof.context
126 val add_assms: Assumption.export ->
127 (Thm.binding * (string * string list) list) list ->
128 Proof.context -> (string * thm list) list * Proof.context
129 val add_assms_i: Assumption.export ->
130 (Thm.binding * (term * term list) list) list ->
131 Proof.context -> (string * thm list) list * Proof.context
132 val add_cases: bool -> (string * Rule_Cases.T option) list -> Proof.context -> Proof.context
133 val apply_case: Rule_Cases.T -> Proof.context -> (string * term list) list * Proof.context
134 val get_case: Proof.context -> string -> string option list -> Rule_Cases.T
135 val type_notation: bool -> Syntax.mode -> (typ * mixfix) list -> Proof.context -> Proof.context
136 val notation: bool -> Syntax.mode -> (term * mixfix) list -> Proof.context -> Proof.context
137 val target_type_notation: bool -> Syntax.mode -> (typ * mixfix) list -> morphism ->
138 Context.generic -> Context.generic
139 val target_notation: bool -> Syntax.mode -> (term * mixfix) list -> morphism ->
140 Context.generic -> Context.generic
141 val class_alias: binding -> class -> Proof.context -> Proof.context
142 val type_alias: binding -> string -> Proof.context -> Proof.context
143 val const_alias: binding -> string -> Proof.context -> Proof.context
144 val add_const_constraint: string * typ option -> Proof.context -> Proof.context
145 val add_abbrev: string -> binding * term -> Proof.context -> (term * term) * Proof.context
146 val revert_abbrev: string -> string -> Proof.context -> Proof.context
147 val print_syntax: Proof.context -> unit
148 val print_abbrevs: Proof.context -> unit
149 val print_binds: Proof.context -> unit
150 val print_lthms: Proof.context -> unit
151 val print_cases: Proof.context -> unit
152 val debug: bool Unsynchronized.ref
153 val verbose: bool Unsynchronized.ref
154 val pretty_ctxt: Proof.context -> Pretty.T list
155 val pretty_context: Proof.context -> Pretty.T list
158 structure ProofContext: PROOF_CONTEXT =
164 (** inner syntax mode **)
168 {stmt: bool, (*inner statement mode*)
169 pattern: bool, (*pattern binding schematic variables*)
170 schematic: bool, (*term referencing loose schematic variables*)
171 abbrev: bool}; (*abbrev mode -- no normalization*)
173 fun make_mode (stmt, pattern, schematic, abbrev) =
174 Mode {stmt = stmt, pattern = pattern, schematic = schematic, abbrev = abbrev};
176 val mode_default = make_mode (false, false, false, false);
177 val mode_stmt = make_mode (true, false, false, false);
178 val mode_pattern = make_mode (false, true, false, false);
179 val mode_schematic = make_mode (false, false, true, false);
180 val mode_abbrev = make_mode (false, false, false, true);
184 (** Isar proof context information **)
188 {mode: mode, (*inner syntax mode*)
189 naming: Name_Space.naming, (*local naming conventions*)
190 syntax: Local_Syntax.T, (*local syntax*)
191 tsig: Type.tsig * Type.tsig, (*local/global type signature -- local name space / defsort only*)
192 consts: Consts.T * Consts.T, (*local/global consts -- local name space / abbrevs only*)
193 facts: Facts.T, (*local facts*)
194 cases: (string * (Rule_Cases.T * bool)) list}; (*named case contexts*)
196 fun make_ctxt (mode, naming, syntax, tsig, consts, facts, cases) =
197 Ctxt {mode = mode, naming = naming, syntax = syntax,
198 tsig = tsig, consts = consts, facts = facts, cases = cases};
200 val local_naming = Name_Space.default_naming |> Name_Space.add_path "local";
202 structure Data = Proof_Data
206 make_ctxt (mode_default, local_naming, Local_Syntax.init thy,
207 (Sign.tsig_of thy, Sign.tsig_of thy),
208 (Sign.consts_of thy, Sign.consts_of thy), Facts.empty, []);
211 fun rep_context ctxt = Data.get ctxt |> (fn Ctxt args => args);
214 Data.map (fn Ctxt {mode, naming, syntax, tsig, consts, facts, cases} =>
215 make_ctxt (f (mode, naming, syntax, tsig, consts, facts, cases)));
217 fun set_mode mode = map_context (fn (_, naming, syntax, tsig, consts, facts, cases) =>
218 (mode, naming, syntax, tsig, consts, facts, cases));
221 map_context (fn (Mode {stmt, pattern, schematic, abbrev}, naming, syntax, tsig, consts, facts, cases) =>
222 (make_mode (f (stmt, pattern, schematic, abbrev)), naming, syntax, tsig, consts, facts, cases));
225 map_context (fn (mode, naming, syntax, tsig, consts, facts, cases) =>
226 (mode, f naming, syntax, tsig, consts, facts, cases));
229 map_context (fn (mode, naming, syntax, tsig, consts, facts, cases) =>
230 (mode, naming, f syntax, tsig, consts, facts, cases));
233 map_context (fn (mode, naming, syntax, tsig, consts, facts, cases) =>
234 (mode, naming, syntax, f tsig, consts, facts, cases));
237 map_context (fn (mode, naming, syntax, tsig, consts, facts, cases) =>
238 (mode, naming, syntax, tsig, f consts, facts, cases));
241 map_context (fn (mode, naming, syntax, tsig, consts, facts, cases) =>
242 (mode, naming, syntax, tsig, consts, f facts, cases));
245 map_context (fn (mode, naming, syntax, tsig, consts, facts, cases) =>
246 (mode, naming, syntax, tsig, consts, facts, f cases));
248 val get_mode = #mode o rep_context;
249 val restore_mode = set_mode o get_mode;
250 val abbrev_mode = get_mode #> (fn Mode {abbrev, ...} => abbrev);
253 map_mode (fn (_, pattern, schematic, abbrev) => (stmt, pattern, schematic, abbrev));
255 val naming_of = #naming o rep_context;
256 val restore_naming = map_naming o K o naming_of
257 val full_name = Name_Space.full_name o naming_of;
259 val syntax_of = #syntax o rep_context;
260 val syn_of = Local_Syntax.syn_of o syntax_of;
261 val set_syntax_mode = map_syntax o Local_Syntax.set_mode;
262 val restore_syntax_mode = map_syntax o Local_Syntax.restore_mode o syntax_of;
264 val tsig_of = #1 o #tsig o rep_context;
265 val set_defsort = map_tsig o apfst o Type.set_defsort;
266 fun default_sort ctxt = the_default (Type.defaultS (tsig_of ctxt)) o Variable.def_sort ctxt;
268 val consts_of = #1 o #consts o rep_context;
269 val const_space = Consts.space_of o consts_of;
270 val the_const_constraint = Consts.the_constraint o consts_of;
272 val facts_of = #facts o rep_context;
273 val cases_of = #cases o rep_context;
276 (* theory transfer *)
278 fun transfer_syntax thy ctxt = ctxt |>
279 map_syntax (Local_Syntax.rebuild thy) |>
280 map_tsig (fn tsig as (local_tsig, global_tsig) =>
281 let val thy_tsig = Sign.tsig_of thy in
282 if Type.eq_tsig (thy_tsig, global_tsig) then tsig
283 else (Type.merge_tsig (Syntax.pp ctxt) (local_tsig, thy_tsig), thy_tsig)
285 map_consts (fn consts as (local_consts, global_consts) =>
286 let val thy_consts = Sign.consts_of thy in
287 if Consts.eq_consts (thy_consts, global_consts) then consts
288 else (Consts.merge (local_consts, thy_consts), thy_consts)
291 fun transfer thy = Context.raw_transfer thy #> transfer_syntax thy;
293 fun background_theory f ctxt = transfer (f (theory_of ctxt)) ctxt;
295 fun background_theory_result f ctxt =
296 let val (res, thy') = f (theory_of ctxt)
297 in (res, ctxt |> transfer thy') end;
301 (** pretty printing **)
305 fun extern_fact ctxt name =
307 val local_facts = facts_of ctxt;
308 val global_facts = Global_Theory.facts_of (theory_of ctxt);
310 if is_some (Facts.lookup (Context.Proof ctxt) local_facts name)
311 then Facts.extern local_facts name
312 else Facts.extern global_facts name
318 fun pretty_term_abbrev ctxt = Syntax.pretty_term (set_mode mode_abbrev ctxt);
320 fun pretty_fact_name ctxt a = Pretty.block
321 [Pretty.markup (Markup.fact a) [Pretty.str (extern_fact ctxt a)], Pretty.str ":"];
323 fun pretty_fact_aux ctxt flag ("", ths) =
324 Display.pretty_thms_aux ctxt flag ths
325 | pretty_fact_aux ctxt flag (a, [th]) = Pretty.block
326 [pretty_fact_name ctxt a, Pretty.brk 1, Display.pretty_thm_aux ctxt flag th]
327 | pretty_fact_aux ctxt flag (a, ths) = Pretty.block
328 (Pretty.fbreaks (pretty_fact_name ctxt a :: map (Display.pretty_thm_aux ctxt flag) ths));
330 fun pretty_fact ctxt = pretty_fact_aux ctxt true;
334 (** prepare types **)
338 fun read_class ctxt text =
340 val tsig = tsig_of ctxt;
341 val (syms, pos) = Syntax.read_token text;
342 val c = Type.cert_class tsig (Type.intern_class tsig (Symbol_Pos.content syms))
343 handle TYPE (msg, _, _) => error (msg ^ Position.str_of pos);
344 val _ = Context_Position.report ctxt pos (Markup.tclass c);
352 fun prep_arity prep_tycon prep_sort ctxt (t, Ss, S) =
353 let val arity = (prep_tycon ctxt t, map (prep_sort ctxt) Ss, prep_sort ctxt S)
354 in Type.add_arity (Syntax.pp ctxt) arity (tsig_of ctxt); arity end;
358 val read_arity = prep_arity (Type.intern_type o tsig_of) Syntax.read_sort;
359 val cert_arity = prep_arity (K I) (Type.cert_sort o tsig_of);
366 fun read_typ_mode mode ctxt s =
367 Syntax.read_typ (Type.set_mode mode ctxt) s;
369 val read_typ = read_typ_mode Type.mode_default;
370 val read_typ_syntax = read_typ_mode Type.mode_syntax;
371 val read_typ_abbrev = read_typ_mode Type.mode_abbrev;
374 fun cert_typ_mode mode ctxt T =
375 Type.cert_typ_mode mode (tsig_of ctxt) T
376 handle TYPE (msg, _, _) => error msg;
378 val cert_typ = cert_typ_mode Type.mode_default;
379 val cert_typ_syntax = cert_typ_mode Type.mode_syntax;
380 val cert_typ_abbrev = cert_typ_mode Type.mode_abbrev;
384 (** prepare variables **)
386 (* internalize Skolem constants *)
388 val lookup_skolem = AList.lookup (op =) o Variable.fixes_of;
389 fun get_skolem ctxt x = the_default x (lookup_skolem ctxt x);
391 fun no_skolem internal x =
392 if can Name.dest_skolem x then
393 error ("Illegal reference to internal Skolem constant: " ^ quote x)
394 else if not internal andalso can Name.dest_internal x then
395 error ("Illegal reference to internal variable: " ^ quote x)
399 (* revert Skolem constants -- if possible *)
401 fun revert_skolem ctxt x =
402 (case find_first (fn (_, y) => y = x) (Variable.fixes_of ctxt) of
403 SOME (x', _) => if lookup_skolem ctxt x' = SOME x then x' else x
407 (* default token translations *)
411 fun free_or_skolem ctxt x =
412 (if can Name.dest_skolem x then Pretty.mark Markup.skolem (Pretty.str (revert_skolem ctxt x))
413 else Pretty.mark Markup.free (Pretty.str x))
415 (if Variable.is_fixed ctxt x orelse Syntax.is_pretty_global ctxt then Markup.fixed x
418 fun var_or_skolem _ s =
419 (case Lexicon.read_variable s of
421 (case try Name.dest_skolem x of
422 NONE => Pretty.mark Markup.var (Pretty.str s)
423 | SOME x' => Pretty.mark Markup.skolem (Pretty.str (Term.string_of_vname (x', i))))
424 | NONE => Pretty.mark Markup.var (Pretty.str s));
426 fun plain_markup m _ s = Pretty.mark m (Pretty.str s);
429 Syntax.tokentrans_mode ""
430 [("tfree", plain_markup Markup.tfree),
431 ("tvar", plain_markup Markup.tvar),
432 ("free", free_or_skolem),
433 ("bound", plain_markup Markup.bound),
434 ("var", var_or_skolem),
435 ("numeral", plain_markup Markup.numeral),
436 ("inner_string", plain_markup Markup.inner_string)];
438 in val _ = Context.>> (Context.map_theory (Sign.add_tokentrfuns token_trans)) end;
442 (** prepare terms and propositions **)
444 (* inferred types of parameters *)
446 fun infer_type ctxt x =
447 Term.fastype_of (singleton (Syntax.check_terms (set_mode mode_schematic ctxt)) (Free x));
449 fun inferred_param x ctxt =
450 let val T = infer_type ctxt (x, dummyT)
451 in (T, ctxt |> Variable.declare_term (Free (x, T))) end;
453 fun inferred_fixes ctxt =
455 val xs = rev (map #2 (Variable.fixes_of ctxt));
456 val (Ts, ctxt') = fold_map inferred_param xs ctxt;
457 in (xs ~~ Ts, ctxt') end;
460 (* type and constant names *)
464 val token_content = Syntax.read_token #>> Symbol_Pos.content;
466 fun prep_const_proper ctxt strict (c, pos) =
468 fun err msg = error (msg ^ Position.str_of pos);
469 val consts = consts_of ctxt;
470 val t as Const (d, _) =
471 (case Variable.lookup_const ctxt c of
473 Const (d, Consts.type_scheme (consts_of ctxt) d handle TYPE (msg, _, _) => err msg)
474 | NONE => Consts.read_const consts c);
476 if strict then ignore (Consts.the_type consts d) handle TYPE (msg, _, _) => err msg
478 val _ = Context_Position.report ctxt pos (Markup.const d);
483 fun read_type_name ctxt strict text =
485 val tsig = tsig_of ctxt;
486 val (c, pos) = token_content text;
488 if Syntax.is_tid c then
489 (Context_Position.report ctxt pos Markup.tfree;
490 TFree (c, default_sort ctxt (c, ~1)))
493 val d = Type.intern_type tsig c;
494 val decl = Type.the_decl tsig d;
495 val _ = Context_Position.report ctxt pos (Markup.tycon d);
496 fun err () = error ("Bad type name: " ^ quote d);
499 Type.LogicalType n => n
500 | Type.Abbreviation (vs, _, _) => if strict then err () else length vs
501 | Type.Nonterminal => if strict then err () else 0);
502 in Type (d, replicate args dummyT) end
505 fun read_type_name_proper ctxt strict text =
506 (case read_type_name ctxt strict text of
508 | T => error ("Not a type constructor: " ^ Syntax.string_of_typ ctxt T));
511 fun read_const_proper ctxt strict = prep_const_proper ctxt strict o token_content;
513 fun read_const ctxt strict ty text =
515 val (c, pos) = token_content text;
516 val _ = no_skolem false c;
518 (case (lookup_skolem ctxt c, Variable.is_const ctxt c) of
520 (Context_Position.report ctxt pos
521 (Markup.name x (if can Name.dest_skolem x then Markup.skolem else Markup.free));
522 Free (x, infer_type ctxt (x, ty)))
523 | _ => prep_const_proper ctxt strict (c, pos))
531 fun read_term_mode mode ctxt = Syntax.read_term (set_mode mode ctxt);
533 val read_term_pattern = read_term_mode mode_pattern;
534 val read_term_schematic = read_term_mode mode_schematic;
535 val read_term_abbrev = read_term_mode mode_abbrev;
538 (* local abbreviations *)
542 fun certify_consts ctxt = Consts.certify (Syntax.pp ctxt) (tsig_of ctxt)
543 (not (abbrev_mode ctxt)) (consts_of ctxt);
545 fun expand_binds ctxt =
547 val Mode {pattern, schematic, ...} = get_mode ctxt;
549 fun reject_schematic (t as Var _) =
550 error ("Unbound schematic variable: " ^ Syntax.string_of_term ctxt t)
551 | reject_schematic (Abs (_, _, t)) = reject_schematic t
552 | reject_schematic (t $ u) = (reject_schematic t; reject_schematic u)
553 | reject_schematic _ = ();
556 else Variable.expand_binds ctxt #> (if schematic then I else tap reject_schematic)
561 fun expand_abbrevs ctxt = certify_consts ctxt #> expand_binds ctxt;
565 val show_abbrevs_raw = Config.declare "show_abbrevs" (fn _ => Config.Bool true);
566 val show_abbrevs = Config.bool show_abbrevs_raw;
568 fun contract_abbrevs ctxt t =
570 val thy = theory_of ctxt;
571 val consts = consts_of ctxt;
572 val Mode {abbrev, ...} = get_mode ctxt;
573 val retrieve = Consts.retrieve_abbrevs consts (print_mode_value () @ [""]);
574 fun match_abbrev u = Option.map #1 (get_first (Pattern.match_rew thy u) (retrieve u));
576 if abbrev orelse not (Config.get ctxt show_abbrevs) orelse not (can Term.type_of t) then t
577 else Pattern.rewrite_term_top thy [] [match_abbrev] t
583 fun prepare_patternT ctxt T =
585 val Mode {pattern, schematic, ...} = get_mode ctxt;
587 pattern orelse schematic orelse
588 T |> Term.exists_subtype
589 (fn T as TVar (xi, _) =>
590 not (Type_Infer.is_param xi) andalso
591 error ("Illegal schematic type variable: " ^ Syntax.string_of_typ ctxt T)
598 val dummies = Config.bool (Config.declare "ProofContext.dummies" (K (Config.Bool false)));
600 fun check_dummies ctxt t =
601 if Config.get ctxt dummies then t
602 else Term.no_dummy_patterns t handle TERM _ => error "Illegal dummy pattern(s) in term";
604 fun prepare_dummies ts = #1 (fold_map Term.replace_dummy_patterns ts 1);
608 val allow_dummies = Config.put dummies true;
610 fun prepare_patterns ctxt =
611 let val Mode {pattern, ...} = get_mode ctxt in
612 Type_Infer.fixate ctxt #>
613 pattern ? Variable.polymorphic ctxt #>
614 (map o Term.map_types) (prepare_patternT ctxt) #>
615 (if pattern then prepare_dummies else map (check_dummies ctxt))
621 (* decoding raw terms (syntax trees) *)
625 fun get_sort ctxt raw_text =
627 val tsig = tsig_of ctxt;
629 val text = distinct (op =) (map (apsnd (Type.minimize_sort tsig)) raw_text);
631 (case duplicates (eq_fst (op =)) text of
633 | dups => error ("Inconsistent sort constraints for type variable(s) "
634 ^ commas_quote (map (Term.string_of_vname' o fst) dups)));
637 (case AList.lookup (op =) text xi of
639 | SOME S => if S = dummyS then NONE else SOME S);
642 (case (lookup xi, Variable.def_sort ctxt xi) of
643 (NONE, NONE) => Type.defaultS tsig
644 | (NONE, SOME S) => S
645 | (SOME S, NONE) => S
646 | (SOME S, SOME S') =>
647 if Type.eq_sort tsig (S, S') then S'
648 else error ("Sort constraint " ^ Syntax.string_of_sort ctxt S ^
649 " inconsistent with default " ^ Syntax.string_of_sort ctxt S' ^
650 " for type variable " ^ quote (Term.string_of_vname' xi)));
653 fun check_tvar ctxt (xi, S) = (xi, get_sort ctxt [(xi, S)] xi);
654 fun check_tfree ctxt (x, S) = apfst fst (check_tvar ctxt ((x, ~1), S));
658 fun intern_skolem ctxt def_type x =
660 val _ = no_skolem false x;
661 val sko = lookup_skolem ctxt x;
662 val is_const = can (read_const_proper ctxt false) x orelse Long_Name.is_qualified x;
663 val is_declared = is_some (def_type (x, ~1));
665 if Variable.is_const ctxt x then NONE
666 else if is_some sko then sko
667 else if not is_const orelse is_declared then SOME x
673 fun type_context ctxt : Syntax.type_context =
674 {get_class = read_class ctxt,
675 get_type = #1 o dest_Type o read_type_name_proper ctxt false,
676 markup_class = fn c => [Name_Space.markup_entry (Type.class_space (tsig_of ctxt)) c],
677 markup_type = fn c => [Name_Space.markup_entry (Type.type_space (tsig_of ctxt)) c]};
679 fun term_context ctxt : Syntax.term_context =
680 {get_sort = get_sort ctxt,
681 get_const = fn a => ((true, #1 (Term.dest_Const (read_const_proper ctxt false a)))
682 handle ERROR _ => (false, Consts.intern (consts_of ctxt) a)),
683 get_free = intern_skolem ctxt (Variable.def_type ctxt false),
684 markup_const = fn c => [Name_Space.markup_entry (const_space ctxt) c],
685 markup_free = fn x =>
686 [if can Name.dest_skolem x then Markup.skolem else Markup.free] @
687 (if not (Variable.is_body ctxt) orelse Variable.is_fixed ctxt x then [] else [Markup.hilite]),
688 markup_var = fn xi => [Markup.name (Term.string_of_vname xi) Markup.var]};
690 val decode_term = Syntax.decode_term o term_context;
699 fun gen_cert prop ctxt t =
701 |> expand_abbrevs ctxt
702 |> (fn t' => #1 (Sign.certify' prop (Syntax.pp ctxt) false (consts_of ctxt) (theory_of ctxt) t')
703 handle TYPE (msg, _, _) => error msg
704 | TERM (msg, _) => error msg);
708 val cert_term = gen_cert false;
709 val cert_prop = gen_cert true;
714 (* type checking/inference *)
717 let val Mode {pattern, ...} = get_mode ctxt
718 in Variable.def_type ctxt pattern end;
720 fun standard_infer_types ctxt =
721 Type_Infer.infer_types ctxt (try (Consts.the_constraint (consts_of ctxt))) (def_type ctxt);
725 fun standard_typ_check ctxt =
726 map (cert_typ_mode (Type.get_mode ctxt) ctxt) #>
727 map (prepare_patternT ctxt);
729 fun standard_term_check ctxt =
730 standard_infer_types ctxt #>
731 map (expand_abbrevs ctxt);
733 fun standard_term_uncheck ctxt =
734 map (contract_abbrevs ctxt);
736 fun add eq what f = Context.>> (what (fn xs => fn ctxt =>
737 let val xs' = f ctxt xs in if eq_list eq (xs, xs') then NONE else SOME (xs', ctxt) end));
741 val _ = add (op =) (Syntax.add_typ_check 0 "standard") standard_typ_check;
742 val _ = add (op aconv) (Syntax.add_term_check 0 "standard") standard_term_check;
743 val _ = add (op aconv) (Syntax.add_term_check 100 "fixate") prepare_patterns;
745 val _ = add (op aconv) (Syntax.add_term_uncheck 0 "standard") standard_term_uncheck;
751 (** export results **)
753 fun common_export is_goal inner outer =
754 map (Assumption.export is_goal inner outer) #>
755 Variable.export inner outer;
757 val goal_export = common_export true;
758 val export = common_export false;
760 fun export_morphism inner outer =
761 Assumption.export_morphism inner outer $>
762 Variable.export_morphism inner outer;
764 fun norm_export_morphism inner outer =
765 export_morphism inner outer $>
766 Morphism.thm_morphism Goal.norm_result;
770 (** term bindings **)
774 fun simult_matches ctxt (t, pats) =
775 (case Seq.pull (Unify.matchers (theory_of ctxt) (map (rpair t) pats)) of
776 NONE => error "Pattern match failed!"
777 | SOME (env, _) => Vartab.fold (fn (v, (_, t)) => cons (v, t)) (Envir.term_env env) []);
782 val bind_terms = fold (fn (xi, t) => fn ctxt =>
784 |> Variable.bind_term (xi, Option.map (cert_term (set_mode mode_default ctxt)) t));
789 fun drop_schematic (b as (xi, SOME t)) = if Term.exists_subterm is_Var t then (xi, NONE) else b
790 | drop_schematic b = b;
792 fun auto_bind f ts ctxt = ctxt |> bind_terms (map drop_schematic (f (theory_of ctxt) ts));
794 val auto_bind_goal = auto_bind Auto_Bind.goal;
795 val auto_bind_facts = auto_bind Auto_Bind.facts;
802 fun gen_bind prep_terms gen raw_binds ctxt =
804 fun prep_bind (raw_pats, t) ctxt1 =
806 val T = Term.fastype_of t;
807 val ctxt2 = Variable.declare_term t ctxt1;
808 val pats = prep_terms (set_mode mode_pattern ctxt2) T raw_pats;
809 val binds = simult_matches ctxt2 (t, pats);
810 in (binds, ctxt2) end;
812 val ts = prep_terms ctxt dummyT (map snd raw_binds);
813 val (binds, ctxt') = apfst flat (fold_map prep_bind (map fst raw_binds ~~ ts) ctxt);
815 if gen then map #1 binds ~~ Variable.exportT_terms ctxt' ctxt (map #2 binds)
817 val binds'' = map (apsnd SOME) binds';
819 tap (Variable.warn_extra_tfrees ctxt)
821 ctxt (*sic!*) |> fold Variable.declare_term (map #2 binds') |> bind_terms binds''
822 else ctxt' |> bind_terms binds'');
827 fun read_terms ctxt T =
828 map (Syntax.parse_term ctxt #> Type.constraint T) #> Syntax.check_terms ctxt;
830 val match_bind = gen_bind read_terms;
831 val match_bind_i = gen_bind (fn ctxt => fn _ => map (cert_term ctxt));
836 (* propositions with patterns *)
840 fun prep_propp mode prep_props (context, args) =
842 fun prep (_, raw_pats) (ctxt, prop :: props) =
843 let val ctxt' = Variable.declare_term prop ctxt
844 in ((prop, prep_props (set_mode mode_pattern ctxt') raw_pats), (ctxt', props)) end;
846 val (propp, (context', _)) = (fold_map o fold_map) prep args
847 (context, prep_props (set_mode mode context) (maps (map fst) args));
848 in (context', propp) end;
850 fun gen_bind_propp mode parse_prop (ctxt, raw_args) =
852 val (ctxt', args) = prep_propp mode parse_prop (ctxt, raw_args);
853 val binds = flat (flat (map (map (simult_matches ctxt')) args));
854 val propss = map (map #1) args;
856 (*generalize result: context evaluated now, binds added later*)
857 val gen = Variable.exportT_terms ctxt' ctxt;
858 fun gen_binds c = c |> bind_terms (map #1 binds ~~ map SOME (gen (map #2 binds)));
859 in (ctxt' |> bind_terms (map (apsnd SOME) binds), (propss, gen_binds)) end;
863 val read_propp = prep_propp mode_default Syntax.read_props;
864 val cert_propp = prep_propp mode_default (map o cert_prop);
865 val read_propp_schematic = prep_propp mode_schematic Syntax.read_props;
866 val cert_propp_schematic = prep_propp mode_schematic (map o cert_prop);
868 val bind_propp = gen_bind_propp mode_default Syntax.read_props;
869 val bind_propp_i = gen_bind_propp mode_default (map o cert_prop);
870 val bind_propp_schematic = gen_bind_propp mode_schematic Syntax.read_props;
871 val bind_propp_schematic_i = gen_bind_propp mode_schematic (map o cert_prop);
881 fun comp_incr_tac [] _ = no_tac
882 | comp_incr_tac (th :: ths) i =
883 (fn st => Goal.compose_hhf_tac (Drule.incr_indexes st th) i st) APPEND comp_incr_tac ths i;
885 fun fact_tac facts = Goal.norm_hhf_tac THEN' comp_incr_tac facts;
887 fun potential_facts ctxt prop =
888 Facts.could_unify (facts_of ctxt) (Term.strip_all_body prop);
890 fun some_fact_tac ctxt = SUBGOAL (fn (goal, i) => fact_tac (potential_facts ctxt goal) i);
897 fun retrieve_thms pick ctxt (Facts.Fact s) =
899 val (_, pos) = Syntax.read_token s;
900 val prop = Syntax.read_prop (set_mode mode_default ctxt) s
901 |> singleton (Variable.polymorphic ctxt);
904 Goal.prove ctxt [] [] prop (K (ALLGOALS (fact_tac [th])));
906 (case get_first (try prove_fact) (potential_facts ctxt prop) of
908 | NONE => error ("Failed to retrieve literal fact" ^ Position.str_of pos ^ ":\n" ^
909 Syntax.string_of_term ctxt prop))
911 | retrieve_thms pick ctxt xthmref =
913 val thy = theory_of ctxt;
914 val local_facts = facts_of ctxt;
915 val thmref = Facts.map_name_of_ref (Facts.intern local_facts) xthmref;
916 val name = Facts.name_of_ref thmref;
917 val pos = Facts.pos_of_ref xthmref;
919 if name = "" then [Thm.transfer thy Drule.dummy_thm]
921 (case Facts.lookup (Context.Proof ctxt) local_facts name of
923 (Context_Position.report ctxt pos (Markup.local_fact name);
924 map (Thm.transfer thy) (Facts.select thmref ths))
925 | NONE => Global_Theory.get_fact (Context.Proof ctxt) thy xthmref);
926 in pick name thms end;
930 val get_fact = retrieve_thms (K I);
931 val get_fact_single = retrieve_thms Facts.the_single;
933 fun get_thms ctxt = get_fact ctxt o Facts.named;
934 fun get_thm ctxt = get_fact_single ctxt o Facts.named;
943 fun update_thms _ (b, NONE) ctxt = ctxt |> map_facts (Facts.del (full_name ctxt b))
944 | update_thms do_props (b, SOME ths) ctxt = ctxt |> map_facts
945 (Facts.add_local do_props (naming_of ctxt) (b, ths) #> snd);
949 fun note_thmss kind = fold_map (fn ((b, more_attrs), raw_facts) => fn ctxt =>
951 val pos = Binding.pos_of b;
952 val name = full_name ctxt b;
953 val _ = Context_Position.report ctxt pos (Markup.local_fact_decl name);
955 val facts = Global_Theory.name_thmss false name raw_facts;
956 fun app (th, attrs) x =
957 swap (Library.foldl_map
958 (Thm.proof_attributes (surround (Thm.kind kind) (attrs @ more_attrs))) (x, th));
959 val (res, ctxt') = fold_map app facts ctxt;
960 val thms = Global_Theory.name_thms false false name (flat res);
961 val Mode {stmt, ...} = get_mode ctxt;
962 in ((name, thms), ctxt' |> update_thms stmt (b, SOME thms)) end);
964 fun put_thms do_props thms ctxt = ctxt
965 |> map_naming (K local_naming)
966 |> Context_Position.set_visible false
967 |> update_thms do_props (apfst Binding.name thms)
968 |> Context_Position.restore_visible ctxt
969 |> restore_naming ctxt;
975 (** basic logical entities **)
979 fun declare_var (x, opt_T, mx) ctxt =
980 let val T = (case opt_T of SOME T => T | NONE => Syntax.mixfixT mx)
981 in ((x, T, mx), ctxt |> Variable.declare_constraints (Free (x, T))) end;
985 fun prep_vars prep_typ internal =
986 fold_map (fn (b, raw_T, mx) => fn ctxt =>
988 val x = Name.of_binding b;
989 val _ = Syntax.is_identifier (no_skolem internal x) orelse
990 error ("Illegal variable name: " ^ quote (Binding.str_of b));
994 else Type.no_tvars T handle TYPE (msg, _, _) => error msg;
995 val opt_T = Option.map (cond_tvars o cert_typ ctxt o prep_typ ctxt) raw_T;
996 val (_, ctxt') = ctxt |> declare_var (x, opt_T, mx);
997 in ((b, opt_T, mx), ctxt') end);
1001 val read_vars = prep_vars Syntax.parse_typ false;
1002 val cert_vars = prep_vars (K I) true;
1007 (* authentic syntax *)
1011 fun const_ast_tr intern ctxt [Ast.Variable c] =
1013 val Const (c', _) = read_const_proper ctxt false c;
1014 val d = if intern then Syntax.mark_const c' else c;
1015 in Ast.Constant d end
1016 | const_ast_tr _ _ asts = raise Ast.AST ("const_ast_tr", asts);
1018 val typ = Simple_Syntax.read_typ;
1022 val _ = Context.>> (Context.map_theory
1024 [("_context_const", typ "id => logic", Delimfix "CONST _"),
1025 ("_context_const", typ "id => aprop", Delimfix "CONST _"),
1026 ("_context_const", typ "longid => logic", Delimfix "CONST _"),
1027 ("_context_const", typ "longid => aprop", Delimfix "CONST _"),
1028 ("_context_xconst", typ "id => logic", Delimfix "XCONST _"),
1029 ("_context_xconst", typ "id => aprop", Delimfix "XCONST _"),
1030 ("_context_xconst", typ "longid => logic", Delimfix "XCONST _"),
1031 ("_context_xconst", typ "longid => aprop", Delimfix "XCONST _")] #>
1032 Sign.add_advanced_trfuns
1033 ([("_context_const", const_ast_tr true), ("_context_xconst", const_ast_tr false)], [], [], [])));
1042 fun type_syntax (Type (c, args), mx) =
1043 SOME (Local_Syntax.Type, (Syntax.mark_type c, Syntax.make_type (length args), mx))
1044 | type_syntax _ = NONE;
1046 fun const_syntax _ (Free (x, T), mx) = SOME (Local_Syntax.Fixed, (x, T, mx))
1047 | const_syntax ctxt (Const (c, _), mx) =
1048 (case try (Consts.type_scheme (consts_of ctxt)) c of
1049 SOME T => SOME (Local_Syntax.Const, (Syntax.mark_const c, T, mx))
1051 | const_syntax _ _ = NONE;
1053 fun gen_notation syntax add mode args ctxt =
1055 (Local_Syntax.update_modesyntax (theory_of ctxt) add mode (map_filter (syntax ctxt) args));
1059 val type_notation = gen_notation (K type_syntax);
1060 val notation = gen_notation const_syntax;
1062 fun target_type_notation add mode args phi =
1064 val args' = args |> map_filter (fn (T, mx) =>
1066 val T' = Morphism.typ phi T;
1067 val similar = (case (T, T') of (Type (c, _), Type (c', _)) => c = c' | _ => false);
1068 in if similar then SOME (T', mx) else NONE end);
1069 in Context.mapping (Sign.type_notation add mode args') (type_notation add mode args') end;
1071 fun target_notation add mode args phi =
1073 val args' = args |> map_filter (fn (t, mx) =>
1074 let val t' = Morphism.term phi t
1075 in if Term.aconv_untyped (t, t') then SOME (t', mx) else NONE end);
1076 in Context.mapping (Sign.notation add mode args') (notation add mode args') end;
1083 fun class_alias b c ctxt = (map_tsig o apfst) (Type.class_alias (naming_of ctxt) b c) ctxt;
1084 fun type_alias b c ctxt = (map_tsig o apfst) (Type.type_alias (naming_of ctxt) b c) ctxt;
1085 fun const_alias b c ctxt = (map_consts o apfst) (Consts.alias (naming_of ctxt) b c) ctxt;
1088 (* local constants *)
1090 fun add_const_constraint (c, opt_T) ctxt =
1093 let val T = cert_typ ctxt raw_T
1094 in cert_term ctxt (Const (c, T)); T end;
1095 in ctxt |> (map_consts o apfst) (Consts.constrain (c, Option.map prepT opt_T)) end;
1097 fun add_abbrev mode (b, raw_t) ctxt =
1099 val t0 = cert_term (ctxt |> set_mode mode_abbrev) raw_t
1100 handle ERROR msg => cat_error msg ("in constant abbreviation " ^ quote (Binding.str_of b));
1101 val [t] = Variable.exportT_terms (Variable.declare_term t0 ctxt) ctxt [t0];
1102 val ((lhs, rhs), consts') = consts_of ctxt
1103 |> Consts.abbreviate (Syntax.pp ctxt) (tsig_of ctxt) (naming_of ctxt) mode (b, t);
1106 |> (map_consts o apfst) (K consts')
1107 |> Variable.declare_term rhs
1111 fun revert_abbrev mode c = (map_consts o apfst) (Consts.revert_abbrev mode c);
1116 fun add_fixes raw_vars ctxt =
1118 val (vars, _) = cert_vars raw_vars ctxt;
1119 val (xs', ctxt') = Variable.add_fixes (map (Name.of_binding o #1) vars) ctxt;
1122 |> fold_map declare_var (map2 (fn x' => fn (_, T, mx) => (x', T, mx)) xs' vars)
1123 |-> (map_syntax o Local_Syntax.add_syntax (theory_of ctxt) o map (pair Local_Syntax.Fixed));
1124 val _ = (vars ~~ xs') |> List.app (fn ((b, _, _), x') =>
1125 Context_Position.report ctxt (Binding.pos_of b) (Markup.fixed_decl x'));
1126 in (xs', ctxt'') end;
1129 (* fixes vs. frees *)
1131 fun auto_fixes (ctxt, (propss, x)) =
1132 ((fold o fold) Variable.auto_fixes propss ctxt, (propss, x));
1134 fun bind_fixes xs ctxt =
1136 val (_, ctxt') = ctxt |> add_fixes (map (fn x => (Binding.name x, NONE, NoSyn)) xs);
1137 fun bind (t as Free (x, T)) =
1138 if member (op =) xs x then
1139 (case lookup_skolem ctxt' x of SOME x' => Free (x', T) | NONE => t)
1141 | bind (t $ u) = bind t $ bind u
1142 | bind (Abs (x, T, t)) = Abs (x, T, bind t)
1144 in (bind, ctxt') end;
1152 fun gen_assms prepp exp args ctxt =
1154 val cert = Thm.cterm_of (theory_of ctxt);
1155 val (propss, ctxt1) = swap (prepp (ctxt, map snd args));
1156 val _ = Variable.warn_extra_tfrees ctxt ctxt1;
1157 val (premss, ctxt2) = fold_burrow (Assumption.add_assms exp o map cert) propss ctxt1;
1160 |> auto_bind_facts (flat propss)
1161 |> note_thmss "" (map fst args ~~ map (map (fn th => ([th], []))) premss)
1166 val add_assms = gen_assms (apsnd #1 o bind_propp);
1167 val add_assms_i = gen_assms (apsnd #1 o bind_propp_i);
1177 fun rem_case name = remove (fn (x: string, (y, _)) => x = y) name;
1179 fun add_case _ ("", _) cases = cases
1180 | add_case _ (name, NONE) cases = rem_case name cases
1181 | add_case is_proper (name, SOME c) cases = (name, (c, is_proper)) :: rem_case name cases;
1183 fun prep_case name fxs c =
1185 fun replace (opt_x :: xs) ((y, T) :: ys) = (the_default y opt_x, T) :: replace xs ys
1186 | replace [] ys = ys
1187 | replace (_ :: _) [] = error ("Too many parameters for case " ^ quote name);
1188 val Rule_Cases.Case {fixes, assumes, binds, cases} = c;
1189 val fixes' = replace fxs fixes;
1190 val binds' = map drop_schematic binds;
1192 if null (fold (Term.add_tvarsT o snd) fixes []) andalso
1193 null (fold (fold Term.add_vars o snd) assumes []) then
1194 Rule_Cases.Case {fixes = fixes', assumes = assumes, binds = binds', cases = cases}
1195 else error ("Illegal schematic variable(s) in case " ^ quote name)
1198 fun fix (x, T) ctxt =
1200 val (bind, ctxt') = bind_fixes [x] ctxt;
1201 val t = bind (Free (x, T));
1202 in (t, ctxt' |> Variable.declare_constraints t) end;
1206 fun add_cases is_proper = map_cases o fold (add_case is_proper);
1208 fun case_result c ctxt =
1210 val Rule_Cases.Case {fixes, ...} = c;
1211 val (ts, ctxt') = ctxt |> fold_map fix fixes;
1212 val Rule_Cases.Case {assumes, binds, cases, ...} = Rule_Cases.apply ts c;
1215 |> bind_terms (map drop_schematic binds)
1216 |> add_cases true (map (apsnd SOME) cases)
1217 |> pair (assumes, (binds, cases))
1220 val apply_case = apfst fst oo case_result;
1222 fun get_case ctxt name xs =
1223 (case AList.lookup (op =) (cases_of ctxt) name of
1224 NONE => error ("Unknown case: " ^ quote name)
1225 | SOME (c, _) => prep_case name xs c);
1231 (** print context information **)
1235 val print_syntax = Syntax.print_syntax o syn_of;
1240 fun pretty_abbrevs show_globals ctxt =
1242 val ((space, consts), (_, globals)) =
1243 pairself (#constants o Consts.dest) (#consts (rep_context ctxt));
1244 fun add_abbr (_, (_, NONE)) = I
1245 | add_abbr (c, (T, SOME t)) =
1246 if not show_globals andalso Symtab.defined globals c then I
1247 else cons (c, Logic.mk_equals (Const (c, T), t));
1248 val abbrevs = Name_Space.extern_table (space, Symtab.make (Symtab.fold add_abbr consts []));
1250 if null abbrevs then []
1251 else [Pretty.big_list "abbreviations:" (map (pretty_term_abbrev ctxt o #2) abbrevs)]
1254 val print_abbrevs = Pretty.writeln o Pretty.chunks o pretty_abbrevs true;
1259 fun pretty_binds ctxt =
1261 val binds = Variable.binds_of ctxt;
1262 fun prt_bind (xi, (T, t)) = pretty_term_abbrev ctxt (Logic.mk_equals (Var (xi, T), t));
1264 if Vartab.is_empty binds then []
1265 else [Pretty.big_list "term bindings:" (map prt_bind (Vartab.dest binds))]
1268 val print_binds = Pretty.writeln o Pretty.chunks o pretty_binds;
1271 (* local theorems *)
1273 fun pretty_lthms ctxt =
1275 val local_facts = facts_of ctxt;
1276 val props = Facts.props local_facts;
1278 (if null props then [] else [("<unnamed>", props)]) @
1279 Facts.dest_static [] local_facts;
1281 if null facts then []
1282 else [Pretty.big_list "facts:" (map #1 (sort_wrt (#1 o #2) (map (`(pretty_fact ctxt)) facts)))]
1285 val print_lthms = Pretty.writeln o Pretty.chunks o pretty_lthms;
1288 (* local contexts *)
1292 fun pretty_case (name, (fixes, ((asms, (lets, cs)), ctxt))) =
1294 val prt_term = Syntax.pretty_term ctxt;
1296 fun prt_let (xi, t) = Pretty.block
1297 [Pretty.quote (prt_term (Var (xi, Term.fastype_of t))), Pretty.str " =", Pretty.brk 1,
1298 Pretty.quote (prt_term t)];
1300 fun prt_asm (a, ts) = Pretty.block (Pretty.breaks
1301 ((if a = "" then [] else [Pretty.str (a ^ ":")]) @ map (Pretty.quote o prt_term) ts));
1303 fun prt_sect _ _ _ [] = []
1304 | prt_sect s sep prt xs =
1305 [Pretty.block (Pretty.breaks (Pretty.str s ::
1306 flat (separate sep (map (single o prt) xs))))];
1308 Pretty.block (Pretty.fbreaks
1309 (Pretty.str (name ^ ":") ::
1310 prt_sect "fix" [] (Pretty.str o fst) fixes @
1311 prt_sect "let" [Pretty.str "and"] prt_let
1312 (map_filter (fn (xi, SOME t) => SOME (xi, t) | _ => NONE) lets) @
1313 (if forall (null o #2) asms then []
1314 else prt_sect "assume" [Pretty.str "and"] prt_asm asms) @
1315 prt_sect "subcases:" [] (Pretty.str o fst) cs))
1320 fun pretty_cases ctxt =
1322 fun add_case (_, (_, false)) = I
1323 | add_case (name, (c as Rule_Cases.Case {fixes, ...}, true)) =
1324 cons (name, (fixes, case_result c ctxt));
1325 val cases = fold add_case (cases_of ctxt) [];
1327 if null cases then []
1328 else [Pretty.big_list "cases:" (map pretty_case cases)]
1331 val print_cases = Pretty.writeln o Pretty.chunks o pretty_cases;
1338 val debug = Unsynchronized.ref false;
1339 val verbose = Unsynchronized.ref false;
1341 fun pretty_ctxt ctxt =
1342 if not (! debug) then []
1345 val prt_term = Syntax.pretty_term ctxt;
1348 val {structs, ...} = Local_Syntax.idents_of (syntax_of ctxt);
1350 if null structs then []
1351 else [Pretty.block (Pretty.str "structures:" :: Pretty.brk 1 ::
1352 Pretty.commas (map Pretty.str structs))];
1355 fun prt_fix (x, x') =
1356 if x = x' then Pretty.str x
1357 else Pretty.block [Pretty.str x, Pretty.str " =", Pretty.brk 1, prt_term (Syntax.free x')];
1359 rev (filter_out ((can Name.dest_internal orf member (op =) structs) o #1)
1360 (Variable.fixes_of ctxt));
1362 if null fixes then []
1363 else [Pretty.block (Pretty.str "fixed variables:" :: Pretty.brk 1 ::
1364 Pretty.commas (map prt_fix fixes))];
1367 val prems = Assumption.all_prems_of ctxt;
1369 if null prems then []
1370 else [Pretty.big_list "prems:" (map (Display.pretty_thm ctxt) prems)];
1371 in prt_structs @ prt_fixes @ prt_prems end;
1376 fun pretty_context ctxt =
1378 val is_verbose = ! verbose;
1379 fun verb f x = if is_verbose then f (x ()) else [];
1381 val prt_term = Syntax.pretty_term ctxt;
1382 val prt_typ = Syntax.pretty_typ ctxt;
1383 val prt_sort = Syntax.pretty_sort ctxt;
1386 val pretty_thy = Pretty.block
1387 [Pretty.str "theory:", Pretty.brk 1, Context.pretty_thy (theory_of ctxt)];
1390 fun prt_atom prt prtT (x, X) = Pretty.block
1391 [prt x, Pretty.str " ::", Pretty.brk 1, prtT X];
1393 fun prt_var (x, ~1) = prt_term (Syntax.free x)
1394 | prt_var xi = prt_term (Syntax.var xi);
1396 fun prt_varT (x, ~1) = prt_typ (TFree (x, []))
1397 | prt_varT xi = prt_typ (TVar (xi, []));
1399 val prt_defT = prt_atom prt_var prt_typ;
1400 val prt_defS = prt_atom prt_varT prt_sort;
1402 val (types, sorts) = Variable.constraints_of ctxt;
1404 verb single (K pretty_thy) @
1406 verb (pretty_abbrevs false) (K ctxt) @
1407 verb pretty_binds (K ctxt) @
1408 verb pretty_lthms (K ctxt) @
1409 verb pretty_cases (K ctxt) @
1410 verb single (fn () => Pretty.big_list "type constraints:" (map prt_defT (Vartab.dest types))) @
1411 verb single (fn () => Pretty.big_list "default sorts:" (map prt_defS (Vartab.dest sorts)))
1416 val show_abbrevs = ProofContext.show_abbrevs;