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 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 syn_of: Proof.context -> Syntax.syntax
30 val tsig_of: Proof.context -> Type.tsig
31 val set_defsort: sort -> Proof.context -> Proof.context
32 val default_sort: Proof.context -> indexname -> sort
33 val consts_of: Proof.context -> Consts.T
34 val the_const_constraint: Proof.context -> string -> typ
35 val set_syntax_mode: Syntax.mode -> Proof.context -> Proof.context
36 val restore_syntax_mode: Proof.context -> Proof.context -> Proof.context
37 val facts_of: Proof.context -> Facts.T
38 val cases_of: Proof.context -> (string * (Rule_Cases.T * bool)) list
39 val transfer_syntax: theory -> Proof.context -> Proof.context
40 val transfer: theory -> Proof.context -> Proof.context
41 val theory: (theory -> theory) -> Proof.context -> Proof.context
42 val theory_result: (theory -> 'a * theory) -> Proof.context -> 'a * Proof.context
43 val extern_fact: Proof.context -> string -> xstring
44 val pretty_term_abbrev: Proof.context -> term -> Pretty.T
45 val pretty_fact_aux: Proof.context -> bool -> string * thm list -> Pretty.T
46 val pretty_fact: Proof.context -> string * thm list -> Pretty.T
47 val read_class: Proof.context -> xstring -> class
48 val read_arity: Proof.context -> xstring * string list * string -> arity
49 val cert_arity: Proof.context -> arity -> arity
50 val read_typ: Proof.context -> string -> typ
51 val read_typ_syntax: Proof.context -> string -> typ
52 val read_typ_abbrev: Proof.context -> string -> typ
53 val cert_typ: Proof.context -> typ -> typ
54 val cert_typ_syntax: Proof.context -> typ -> typ
55 val cert_typ_abbrev: Proof.context -> typ -> typ
56 val get_skolem: Proof.context -> string -> string
57 val revert_skolem: Proof.context -> string -> string
58 val infer_type: Proof.context -> string * typ -> typ
59 val inferred_param: string -> Proof.context -> typ * Proof.context
60 val inferred_fixes: Proof.context -> (string * typ) list * Proof.context
61 val read_type_name: Proof.context -> bool -> string -> typ
62 val read_type_name_proper: Proof.context -> bool -> string -> typ
63 val read_const_proper: Proof.context -> bool -> string -> term
64 val read_const: Proof.context -> bool -> typ -> string -> term
65 val allow_dummies: Proof.context -> Proof.context
66 val check_tvar: Proof.context -> indexname * sort -> indexname * sort
67 val check_tfree: Proof.context -> string * sort -> string * sort
68 val decode_term: Proof.context -> term -> term
69 val standard_infer_types: Proof.context -> term list -> term list
70 val read_term_pattern: Proof.context -> string -> term
71 val read_term_schematic: Proof.context -> string -> term
72 val read_term_abbrev: Proof.context -> string -> term
73 val expand_abbrevs: Proof.context -> term -> term
74 val cert_term: Proof.context -> term -> term
75 val cert_prop: Proof.context -> term -> term
76 val def_type: Proof.context -> indexname -> typ option
77 val goal_export: Proof.context -> Proof.context -> thm list -> thm list
78 val export: Proof.context -> Proof.context -> thm list -> thm list
79 val export_morphism: Proof.context -> Proof.context -> morphism
80 val norm_export_morphism: Proof.context -> Proof.context -> morphism
81 val bind_terms: (indexname * term option) list -> Proof.context -> Proof.context
82 val auto_bind_goal: term list -> Proof.context -> Proof.context
83 val auto_bind_facts: term list -> Proof.context -> Proof.context
84 val match_bind: bool -> (string list * string) list -> Proof.context -> term list * Proof.context
85 val match_bind_i: bool -> (term list * term) list -> Proof.context -> term list * Proof.context
86 val read_propp: Proof.context * (string * string list) list list
87 -> Proof.context * (term * term list) list list
88 val cert_propp: Proof.context * (term * term list) list list
89 -> Proof.context * (term * term list) list list
90 val read_propp_schematic: Proof.context * (string * string list) list list
91 -> Proof.context * (term * term list) list list
92 val cert_propp_schematic: Proof.context * (term * term list) list list
93 -> Proof.context * (term * term list) list list
94 val bind_propp: Proof.context * (string * string list) list list
95 -> Proof.context * (term list list * (Proof.context -> Proof.context))
96 val bind_propp_i: Proof.context * (term * term list) list list
97 -> Proof.context * (term list list * (Proof.context -> Proof.context))
98 val bind_propp_schematic: Proof.context * (string * string list) list list
99 -> Proof.context * (term list list * (Proof.context -> Proof.context))
100 val bind_propp_schematic_i: Proof.context * (term * term list) list list
101 -> Proof.context * (term list list * (Proof.context -> Proof.context))
102 val fact_tac: thm list -> int -> tactic
103 val some_fact_tac: Proof.context -> int -> tactic
104 val get_fact: Proof.context -> Facts.ref -> thm list
105 val get_fact_single: Proof.context -> Facts.ref -> thm
106 val get_thms: Proof.context -> xstring -> thm list
107 val get_thm: Proof.context -> xstring -> thm
108 val note_thmss: string -> (Thm.binding * (thm list * attribute list) list) list ->
109 Proof.context -> (string * thm list) list * Proof.context
110 val put_thms: bool -> string * thm list option -> Proof.context -> Proof.context
111 val read_vars: (binding * string option * mixfix) list -> Proof.context ->
112 (binding * typ option * mixfix) list * Proof.context
113 val cert_vars: (binding * typ option * mixfix) list -> Proof.context ->
114 (binding * typ option * mixfix) list * Proof.context
115 val add_fixes: (binding * typ option * mixfix) list -> Proof.context ->
116 string list * Proof.context
117 val auto_fixes: Proof.context * (term list list * 'a) -> Proof.context * (term list list * 'a)
118 val bind_fixes: string list -> Proof.context -> (term -> term) * Proof.context
119 val add_assms: Assumption.export ->
120 (Thm.binding * (string * string list) list) list ->
121 Proof.context -> (string * thm list) list * Proof.context
122 val add_assms_i: Assumption.export ->
123 (Thm.binding * (term * term list) list) list ->
124 Proof.context -> (string * thm list) list * Proof.context
125 val add_cases: bool -> (string * Rule_Cases.T option) list -> Proof.context -> Proof.context
126 val apply_case: Rule_Cases.T -> Proof.context -> (string * term list) list * Proof.context
127 val get_case: Proof.context -> string -> string option list -> Rule_Cases.T
128 val type_notation: bool -> Syntax.mode -> (typ * mixfix) list -> Proof.context -> Proof.context
129 val notation: bool -> Syntax.mode -> (term * mixfix) list -> Proof.context -> Proof.context
130 val target_type_notation: bool -> Syntax.mode -> (typ * mixfix) list -> morphism ->
131 Context.generic -> Context.generic
132 val target_notation: bool -> Syntax.mode -> (term * mixfix) list -> morphism ->
133 Context.generic -> Context.generic
134 val class_alias: binding -> class -> Proof.context -> Proof.context
135 val type_alias: binding -> string -> Proof.context -> Proof.context
136 val const_alias: binding -> string -> Proof.context -> Proof.context
137 val add_const_constraint: string * typ option -> Proof.context -> Proof.context
138 val add_abbrev: string -> binding * term -> Proof.context -> (term * term) * Proof.context
139 val revert_abbrev: string -> string -> Proof.context -> Proof.context
140 val print_syntax: Proof.context -> unit
141 val print_abbrevs: Proof.context -> unit
142 val print_binds: Proof.context -> unit
143 val print_lthms: Proof.context -> unit
144 val print_cases: Proof.context -> unit
145 val debug: bool Unsynchronized.ref
146 val verbose: bool Unsynchronized.ref
147 val prems_limit: int Unsynchronized.ref
148 val pretty_ctxt: Proof.context -> Pretty.T list
149 val pretty_context: Proof.context -> Pretty.T list
152 structure ProofContext: PROOF_CONTEXT =
158 (** inner syntax mode **)
162 {stmt: bool, (*inner statement mode*)
163 pattern: bool, (*pattern binding schematic variables*)
164 schematic: bool, (*term referencing loose schematic variables*)
165 abbrev: bool}; (*abbrev mode -- no normalization*)
167 fun make_mode (stmt, pattern, schematic, abbrev) =
168 Mode {stmt = stmt, pattern = pattern, schematic = schematic, abbrev = abbrev};
170 val mode_default = make_mode (false, false, false, false);
171 val mode_stmt = make_mode (true, false, false, false);
172 val mode_pattern = make_mode (false, true, false, false);
173 val mode_schematic = make_mode (false, false, true, false);
174 val mode_abbrev = make_mode (false, false, false, true);
178 (** Isar proof context information **)
182 {mode: mode, (*inner syntax mode*)
183 naming: Name_Space.naming, (*local naming conventions*)
184 syntax: Local_Syntax.T, (*local syntax*)
185 tsig: Type.tsig * Type.tsig, (*local/global type signature -- local name space / defsort only*)
186 consts: Consts.T * Consts.T, (*local/global consts -- local name space / abbrevs only*)
187 facts: Facts.T, (*local facts*)
188 cases: (string * (Rule_Cases.T * bool)) list}; (*named case contexts*)
190 fun make_ctxt (mode, naming, syntax, tsig, consts, facts, cases) =
191 Ctxt {mode = mode, naming = naming, syntax = syntax,
192 tsig = tsig, consts = consts, facts = facts, cases = cases};
194 val local_naming = Name_Space.default_naming |> Name_Space.add_path "local";
196 structure ContextData = Proof_Data
200 make_ctxt (mode_default, local_naming, Local_Syntax.init thy,
201 (Sign.tsig_of thy, Sign.tsig_of thy),
202 (Sign.consts_of thy, Sign.consts_of thy), Facts.empty, []);
205 fun rep_context ctxt = ContextData.get ctxt |> (fn Ctxt args => args);
208 ContextData.map (fn Ctxt {mode, naming, syntax, tsig, consts, facts, cases} =>
209 make_ctxt (f (mode, naming, syntax, tsig, consts, facts, cases)));
211 fun set_mode mode = map_context (fn (_, naming, syntax, tsig, consts, facts, cases) =>
212 (mode, naming, syntax, tsig, consts, facts, cases));
215 map_context (fn (Mode {stmt, pattern, schematic, abbrev}, naming, syntax, tsig, consts, facts, cases) =>
216 (make_mode (f (stmt, pattern, schematic, abbrev)), naming, syntax, tsig, consts, facts, cases));
219 map_context (fn (mode, naming, syntax, tsig, consts, facts, cases) =>
220 (mode, f naming, syntax, tsig, consts, facts, cases));
223 map_context (fn (mode, naming, syntax, tsig, consts, facts, cases) =>
224 (mode, naming, f syntax, tsig, consts, facts, cases));
227 map_context (fn (mode, naming, syntax, tsig, consts, facts, cases) =>
228 (mode, naming, syntax, f tsig, consts, facts, cases));
231 map_context (fn (mode, naming, syntax, tsig, consts, facts, cases) =>
232 (mode, naming, syntax, tsig, f consts, facts, cases));
235 map_context (fn (mode, naming, syntax, tsig, consts, facts, cases) =>
236 (mode, naming, syntax, tsig, consts, f facts, cases));
239 map_context (fn (mode, naming, syntax, tsig, consts, facts, cases) =>
240 (mode, naming, syntax, tsig, consts, facts, f cases));
242 val get_mode = #mode o rep_context;
243 val restore_mode = set_mode o get_mode;
244 val abbrev_mode = get_mode #> (fn Mode {abbrev, ...} => abbrev);
247 map_mode (fn (_, pattern, schematic, abbrev) => (stmt, pattern, schematic, abbrev));
249 val naming_of = #naming o rep_context;
250 val restore_naming = map_naming o K o naming_of
251 val full_name = Name_Space.full_name o naming_of;
253 val syntax_of = #syntax o rep_context;
254 val syn_of = Local_Syntax.syn_of o syntax_of;
255 val set_syntax_mode = map_syntax o Local_Syntax.set_mode;
256 val restore_syntax_mode = map_syntax o Local_Syntax.restore_mode o syntax_of;
258 val tsig_of = #1 o #tsig o rep_context;
259 val set_defsort = map_tsig o apfst o Type.set_defsort;
260 fun default_sort ctxt = the_default (Type.defaultS (tsig_of ctxt)) o Variable.def_sort ctxt;
262 val consts_of = #1 o #consts o rep_context;
263 val the_const_constraint = Consts.the_constraint o consts_of;
265 val facts_of = #facts o rep_context;
266 val cases_of = #cases o rep_context;
269 (* theory transfer *)
271 fun transfer_syntax thy ctxt = ctxt |>
272 map_syntax (Local_Syntax.rebuild thy) |>
273 map_tsig (fn tsig as (local_tsig, global_tsig) =>
274 let val thy_tsig = Sign.tsig_of thy in
275 if Type.eq_tsig (thy_tsig, global_tsig) then tsig
276 else (Type.merge_tsig (Syntax.pp ctxt) (local_tsig, thy_tsig), thy_tsig)
278 map_consts (fn consts as (local_consts, global_consts) =>
279 let val thy_consts = Sign.consts_of thy in
280 if Consts.eq_consts (thy_consts, global_consts) then consts
281 else (Consts.merge (local_consts, thy_consts), thy_consts)
284 fun transfer thy = Context.raw_transfer thy #> transfer_syntax thy;
286 fun theory f ctxt = transfer (f (theory_of ctxt)) ctxt;
288 fun theory_result f ctxt =
289 let val (res, thy') = f (theory_of ctxt)
290 in (res, ctxt |> transfer thy') end;
294 (** pretty printing **)
298 fun extern_fact ctxt name =
300 val local_facts = facts_of ctxt;
301 val global_facts = PureThy.facts_of (theory_of ctxt);
303 if is_some (Facts.lookup (Context.Proof ctxt) local_facts name)
304 then Facts.extern local_facts name
305 else Facts.extern global_facts name
311 fun pretty_term_abbrev ctxt = Syntax.pretty_term (set_mode mode_abbrev ctxt);
313 fun pretty_fact_name ctxt a = Pretty.block
314 [Pretty.markup (Markup.fact a) [Pretty.str (extern_fact ctxt a)], Pretty.str ":"];
316 fun pretty_fact_aux ctxt flag ("", ths) =
317 Display.pretty_thms_aux ctxt flag ths
318 | pretty_fact_aux ctxt flag (a, [th]) = Pretty.block
319 [pretty_fact_name ctxt a, Pretty.brk 1, Display.pretty_thm_aux ctxt flag th]
320 | pretty_fact_aux ctxt flag (a, ths) = Pretty.block
321 (Pretty.fbreaks (pretty_fact_name ctxt a :: map (Display.pretty_thm_aux ctxt flag) ths));
323 fun pretty_fact ctxt = pretty_fact_aux ctxt true;
327 (** prepare types **)
331 fun read_class ctxt text =
333 val tsig = tsig_of ctxt;
334 val (syms, pos) = Syntax.read_token text;
335 val c = Type.cert_class tsig (Type.intern_class tsig (Symbol_Pos.content syms))
336 handle TYPE (msg, _, _) => error (msg ^ Position.str_of pos);
337 val _ = Position.report (Markup.tclass c) pos;
345 fun prep_arity prep_tycon prep_sort ctxt (t, Ss, S) =
346 let val arity = (prep_tycon ctxt t, map (prep_sort ctxt) Ss, prep_sort ctxt S)
347 in Type.add_arity (Syntax.pp ctxt) arity (tsig_of ctxt); arity end;
351 val read_arity = prep_arity (Type.intern_type o tsig_of) Syntax.read_sort;
352 val cert_arity = prep_arity (K I) (Type.cert_sort o tsig_of);
359 fun read_typ_mode mode ctxt s =
360 Syntax.read_typ (Type.set_mode mode ctxt) s;
362 val read_typ = read_typ_mode Type.mode_default;
363 val read_typ_syntax = read_typ_mode Type.mode_syntax;
364 val read_typ_abbrev = read_typ_mode Type.mode_abbrev;
367 fun cert_typ_mode mode ctxt T =
368 Type.cert_typ_mode mode (tsig_of ctxt) T
369 handle TYPE (msg, _, _) => error msg;
371 val cert_typ = cert_typ_mode Type.mode_default;
372 val cert_typ_syntax = cert_typ_mode Type.mode_syntax;
373 val cert_typ_abbrev = cert_typ_mode Type.mode_abbrev;
377 (** prepare variables **)
379 (* internalize Skolem constants *)
381 val lookup_skolem = AList.lookup (op =) o Variable.fixes_of;
382 fun get_skolem ctxt x = the_default x (lookup_skolem ctxt x);
384 fun no_skolem internal x =
385 if can Name.dest_skolem x then
386 error ("Illegal reference to internal Skolem constant: " ^ quote x)
387 else if not internal andalso can Name.dest_internal x then
388 error ("Illegal reference to internal variable: " ^ quote x)
392 (* revert Skolem constants -- if possible *)
394 fun revert_skolem ctxt x =
395 (case find_first (fn (_, y) => y = x) (Variable.fixes_of ctxt) of
396 SOME (x', _) => if lookup_skolem ctxt x' = SOME x then x' else x
400 (* default token translations *)
404 fun free_or_skolem ctxt x =
405 (if can Name.dest_skolem x then Pretty.mark Markup.skolem (Pretty.str (revert_skolem ctxt x))
406 else Pretty.mark Markup.free (Pretty.str x))
408 (if Variable.is_fixed ctxt x orelse Syntax.is_pretty_global ctxt then Markup.fixed x
411 fun var_or_skolem _ s =
412 (case Lexicon.read_variable s of
414 (case try Name.dest_skolem x of
415 NONE => Pretty.mark Markup.var (Pretty.str s)
416 | SOME x' => Pretty.mark Markup.skolem
417 (Pretty.str (setmp_CRITICAL show_question_marks true Term.string_of_vname (x', i))))
418 | NONE => Pretty.mark Markup.var (Pretty.str s));
420 fun plain_markup m _ s = Pretty.mark m (Pretty.str s);
423 Syntax.tokentrans_mode ""
424 [("tfree", plain_markup Markup.tfree),
425 ("tvar", plain_markup Markup.tvar),
426 ("free", free_or_skolem),
427 ("bound", plain_markup Markup.bound),
428 ("var", var_or_skolem),
429 ("numeral", plain_markup Markup.numeral),
430 ("inner_string", plain_markup Markup.inner_string)];
432 in val _ = Context.>> (Context.map_theory (Sign.add_tokentrfuns token_trans)) end;
436 (** prepare terms and propositions **)
438 (* inferred types of parameters *)
440 fun infer_type ctxt x =
441 Term.fastype_of (singleton (Syntax.check_terms (set_mode mode_schematic ctxt)) (Free x));
443 fun inferred_param x ctxt =
444 let val T = infer_type ctxt (x, dummyT)
445 in (T, ctxt |> Variable.declare_term (Free (x, T))) end;
447 fun inferred_fixes ctxt =
449 val xs = rev (map #2 (Variable.fixes_of ctxt));
450 val (Ts, ctxt') = fold_map inferred_param xs ctxt;
451 in (xs ~~ Ts, ctxt') end;
454 (* type and constant names *)
458 val token_content = Syntax.read_token #>> Symbol_Pos.content;
460 fun prep_const_proper ctxt strict (c, pos) =
462 fun err msg = error (msg ^ Position.str_of pos);
463 val consts = consts_of ctxt;
464 val t as Const (d, _) =
465 (case Variable.lookup_const ctxt c of
467 Const (d, Consts.type_scheme (consts_of ctxt) d handle TYPE (msg, _, _) => err msg)
468 | NONE => Consts.read_const consts c);
470 if strict then ignore (Consts.the_type consts d) handle TYPE (msg, _, _) => err msg
472 val _ = Position.report (Markup.const d) pos;
477 fun read_type_name ctxt strict text =
479 val tsig = tsig_of ctxt;
480 val (c, pos) = token_content text;
482 if Syntax.is_tid c then
483 (Position.report Markup.tfree pos;
484 TFree (c, default_sort ctxt (c, ~1)))
487 val d = Type.intern_type tsig c;
488 val decl = Type.the_decl tsig d;
489 val _ = Position.report (Markup.tycon d) pos;
490 fun err () = error ("Bad type name: " ^ quote d);
493 Type.LogicalType n => n
494 | Type.Abbreviation (vs, _, _) => if strict then err () else length vs
495 | Type.Nonterminal => if strict then err () else 0);
496 in Type (d, replicate args dummyT) end
499 fun read_type_name_proper ctxt strict text =
500 (case read_type_name ctxt strict text of
502 | T => error ("Not a type constructor: " ^ Syntax.string_of_typ ctxt T));
505 fun read_const_proper ctxt strict = prep_const_proper ctxt strict o token_content;
507 fun read_const ctxt strict ty text =
508 let val (c, pos) = token_content text in
509 (case (lookup_skolem ctxt c, Variable.is_const ctxt c) of
511 (Position.report (Markup.name x
512 (if can Name.dest_skolem x then Markup.skolem else Markup.free)) pos;
513 Free (x, infer_type ctxt (x, ty)))
514 | _ => prep_const_proper ctxt strict (c, pos))
522 fun read_term_mode mode ctxt = Syntax.read_term (set_mode mode ctxt);
524 val read_term_pattern = read_term_mode mode_pattern;
525 val read_term_schematic = read_term_mode mode_schematic;
526 val read_term_abbrev = read_term_mode mode_abbrev;
529 (* local abbreviations *)
533 fun certify_consts ctxt = Consts.certify (Syntax.pp ctxt) (tsig_of ctxt)
534 (not (abbrev_mode ctxt)) (consts_of ctxt);
536 fun reject_schematic (Var (xi, _)) =
537 error ("Unbound schematic variable: " ^ Term.string_of_vname xi)
538 | reject_schematic (Abs (_, _, t)) = reject_schematic t
539 | reject_schematic (t $ u) = (reject_schematic t; reject_schematic u)
540 | reject_schematic _ = ();
542 fun expand_binds ctxt =
543 let val Mode {pattern, schematic, ...} = get_mode ctxt in
545 else Variable.expand_binds ctxt #> (if schematic then I else tap reject_schematic)
550 fun expand_abbrevs ctxt = certify_consts ctxt #> expand_binds ctxt;
555 fun contract_abbrevs ctxt t =
557 val thy = theory_of ctxt;
558 val consts = consts_of ctxt;
559 val Mode {abbrev, ...} = get_mode ctxt;
560 val retrieve = Consts.retrieve_abbrevs consts (print_mode_value () @ [""]);
561 fun match_abbrev u = Option.map #1 (get_first (Pattern.match_rew thy u) (retrieve u));
563 if abbrev orelse print_mode_active "no_abbrevs" orelse not (can Term.type_of t) then t
564 else Pattern.rewrite_term_top thy [] [match_abbrev] t
570 fun prepare_patternT ctxt T =
572 val Mode {pattern, schematic, ...} = get_mode ctxt;
574 pattern orelse schematic orelse
575 T |> Term.exists_subtype
577 not (TypeInfer.is_param xi) andalso
578 error ("Illegal schematic type variable: " ^ Term.string_of_vname xi)
585 structure Allow_Dummies = Proof_Data(type T = bool fun init _ = false);
587 fun check_dummies ctxt t =
588 if Allow_Dummies.get ctxt then t
589 else Term.no_dummy_patterns t handle TERM _ => error "Illegal dummy pattern(s) in term";
591 fun prepare_dummies ts = #1 (fold_map Term.replace_dummy_patterns ts 1);
595 val allow_dummies = Allow_Dummies.put true;
597 fun prepare_patterns ctxt =
598 let val Mode {pattern, ...} = get_mode ctxt in
599 TypeInfer.fixate_params (Variable.names_of ctxt) #>
600 pattern ? Variable.polymorphic ctxt #>
601 (map o Term.map_types) (prepare_patternT ctxt) #>
602 (if pattern then prepare_dummies else map (check_dummies ctxt))
608 (* decoding raw terms (syntax trees) *)
612 fun get_sort ctxt raw_text =
614 val tsig = tsig_of ctxt;
616 val text = distinct (op =) (map (apsnd (Type.minimize_sort tsig)) raw_text);
618 (case duplicates (eq_fst (op =)) text of
620 | dups => error ("Inconsistent sort constraints for type variable(s) "
621 ^ commas_quote (map (Term.string_of_vname' o fst) dups)));
624 (case AList.lookup (op =) text xi of
626 | SOME S => if S = dummyS then NONE else SOME S);
629 (case (lookup xi, Variable.def_sort ctxt xi) of
630 (NONE, NONE) => Type.defaultS tsig
631 | (NONE, SOME S) => S
632 | (SOME S, NONE) => S
633 | (SOME S, SOME S') =>
634 if Type.eq_sort tsig (S, S') then S'
635 else error ("Sort constraint " ^ Syntax.string_of_sort ctxt S ^
636 " inconsistent with default " ^ Syntax.string_of_sort ctxt S' ^
637 " for type variable " ^ quote (Term.string_of_vname' xi)));
640 fun check_tvar ctxt (xi, S) = (xi, get_sort ctxt [(xi, S)] xi);
641 fun check_tfree ctxt (x, S) = apfst fst (check_tvar ctxt ((x, ~1), S));
645 fun intern_skolem ctxt def_type x =
647 val _ = no_skolem false x;
648 val sko = lookup_skolem ctxt x;
649 val is_const = can (read_const_proper ctxt false) x orelse Long_Name.is_qualified x;
650 val is_declared = is_some (def_type (x, ~1));
652 if Variable.is_const ctxt x then NONE
653 else if is_some sko then sko
654 else if not is_const orelse is_declared then SOME x
660 fun term_context ctxt =
661 {get_sort = get_sort ctxt,
662 map_const = fn a => ((true, #1 (Term.dest_Const (read_const_proper ctxt false a)))
663 handle ERROR _ => (false, Consts.intern (consts_of ctxt) a)),
664 map_free = intern_skolem ctxt (Variable.def_type ctxt false)};
666 fun decode_term ctxt =
667 let val {get_sort, map_const, map_free} = term_context ctxt
668 in Syntax.decode_term get_sort map_const map_free end;
677 fun gen_cert prop ctxt t =
679 |> expand_abbrevs ctxt
680 |> (fn t' => #1 (Sign.certify' prop (Syntax.pp ctxt) false (consts_of ctxt) (theory_of ctxt) t')
681 handle TYPE (msg, _, _) => error msg
682 | TERM (msg, _) => error msg);
686 val cert_term = gen_cert false;
687 val cert_prop = gen_cert true;
692 (* type checking/inference *)
695 let val Mode {pattern, ...} = get_mode ctxt
696 in Variable.def_type ctxt pattern end;
698 fun standard_infer_types ctxt ts =
699 TypeInfer.infer_types (Syntax.pp ctxt) (tsig_of ctxt) (Syntax.check_typs ctxt)
700 (try (Consts.the_constraint (consts_of ctxt))) (def_type ctxt)
701 (Variable.names_of ctxt) (Variable.maxidx_of ctxt) ts
702 handle TYPE (msg, _, _) => error msg;
706 fun standard_typ_check ctxt =
707 map (cert_typ_mode (Type.get_mode ctxt) ctxt) #>
708 map (prepare_patternT ctxt);
710 fun standard_term_check ctxt =
711 standard_infer_types ctxt #>
712 map (expand_abbrevs ctxt);
714 fun standard_term_uncheck ctxt =
715 map (contract_abbrevs ctxt);
717 fun add eq what f = Context.>> (what (fn xs => fn ctxt =>
718 let val xs' = f ctxt xs in if eq_list eq (xs, xs') then NONE else SOME (xs', ctxt) end));
722 val _ = add (op =) (Syntax.add_typ_check 0 "standard") standard_typ_check;
723 val _ = add (op aconv) (Syntax.add_term_check 0 "standard") standard_term_check;
724 val _ = add (op aconv) (Syntax.add_term_check 100 "fixate") prepare_patterns;
726 val _ = add (op aconv) (Syntax.add_term_uncheck 0 "standard") standard_term_uncheck;
732 (** inner syntax operations **)
736 fun parse_sort ctxt text =
738 val (syms, pos) = Syntax.parse_token Markup.sort text;
739 val S = Syntax.standard_parse_sort ctxt (syn_of ctxt) (syms, pos)
740 handle ERROR msg => cat_error msg ("Failed to parse sort" ^ Position.str_of pos)
741 in Type.minimize_sort (tsig_of ctxt) S end;
743 fun parse_typ ctxt text =
745 val (syms, pos) = Syntax.parse_token Markup.typ text;
746 val T = Syntax.standard_parse_typ ctxt (syn_of ctxt) (get_sort ctxt) (syms, pos)
747 handle ERROR msg => cat_error msg ("Failed to parse type" ^ Position.str_of pos);
750 fun parse_term T ctxt text =
752 val {get_sort, map_const, map_free} = term_context ctxt;
754 val (T', _) = TypeInfer.paramify_dummies T 0;
755 val (markup, kind) = if T' = propT then (Markup.prop, "proposition") else (Markup.term, "term");
756 val (syms, pos) = Syntax.parse_token markup text;
758 fun check t = (Syntax.check_term ctxt (TypeInfer.constrain T' t); NONE)
759 handle ERROR msg => SOME msg;
761 Syntax.standard_parse_term (Syntax.pp ctxt) check get_sort map_const map_free
762 ctxt (Type.is_logtype (tsig_of ctxt)) (syn_of ctxt) T' (syms, pos)
763 handle ERROR msg => cat_error msg ("Failed to parse " ^ kind ^ Position.str_of pos);
767 fun unparse_sort ctxt =
768 Syntax.standard_unparse_sort {extern_class = Type.extern_class (tsig_of ctxt)}
771 fun unparse_typ ctxt =
773 val tsig = tsig_of ctxt;
774 val extern = {extern_class = Type.extern_class tsig, extern_type = Type.extern_type tsig};
775 in Syntax.standard_unparse_typ extern ctxt (syn_of ctxt) end;
777 fun unparse_term ctxt =
779 val tsig = tsig_of ctxt;
780 val syntax = syntax_of ctxt;
781 val consts = consts_of ctxt;
783 {extern_class = Type.extern_class tsig,
784 extern_type = Type.extern_type tsig,
785 extern_const = Consts.extern consts};
787 Syntax.standard_unparse_term (Local_Syntax.idents_of syntax) extern ctxt
788 (Local_Syntax.syn_of syntax) (not (PureThy.old_appl_syntax (theory_of ctxt)))
793 val _ = Syntax.install_operations
794 {parse_sort = parse_sort,
795 parse_typ = parse_typ,
796 parse_term = parse_term dummyT,
797 parse_prop = parse_term propT,
798 unparse_sort = unparse_sort,
799 unparse_typ = unparse_typ,
800 unparse_term = unparse_term};
806 (** export results **)
808 fun common_export is_goal inner outer =
809 map (Assumption.export is_goal inner outer) #>
810 Variable.export inner outer;
812 val goal_export = common_export true;
813 val export = common_export false;
815 fun export_morphism inner outer =
816 Assumption.export_morphism inner outer $>
817 Variable.export_morphism inner outer;
819 fun norm_export_morphism inner outer =
820 export_morphism inner outer $>
821 Morphism.thm_morphism Goal.norm_result;
825 (** term bindings **)
829 fun simult_matches ctxt (t, pats) =
830 (case Seq.pull (Unify.matchers (theory_of ctxt) (map (rpair t) pats)) of
831 NONE => error "Pattern match failed!"
832 | SOME (env, _) => Vartab.fold (fn (v, (_, t)) => cons (v, t)) (Envir.term_env env) []);
837 val bind_terms = fold (fn (xi, t) => fn ctxt =>
839 |> Variable.bind_term (xi, Option.map (cert_term (set_mode mode_default ctxt)) t));
844 fun drop_schematic (b as (xi, SOME t)) = if Term.exists_subterm is_Var t then (xi, NONE) else b
845 | drop_schematic b = b;
847 fun auto_bind f ts ctxt = ctxt |> bind_terms (map drop_schematic (f (theory_of ctxt) ts));
849 val auto_bind_goal = auto_bind Auto_Bind.goal;
850 val auto_bind_facts = auto_bind Auto_Bind.facts;
857 fun gen_bind prep_terms gen raw_binds ctxt =
859 fun prep_bind (raw_pats, t) ctxt1 =
861 val T = Term.fastype_of t;
862 val ctxt2 = Variable.declare_term t ctxt1;
863 val pats = prep_terms (set_mode mode_pattern ctxt2) T raw_pats;
864 val binds = simult_matches ctxt2 (t, pats);
865 in (binds, ctxt2) end;
867 val ts = prep_terms ctxt dummyT (map snd raw_binds);
868 val (binds, ctxt') = apfst flat (fold_map prep_bind (map fst raw_binds ~~ ts) ctxt);
870 if gen then map #1 binds ~~ Variable.exportT_terms ctxt' ctxt (map #2 binds)
872 val binds'' = map (apsnd SOME) binds';
874 tap (Variable.warn_extra_tfrees ctxt)
876 ctxt (*sic!*) |> fold Variable.declare_term (map #2 binds') |> bind_terms binds''
877 else ctxt' |> bind_terms binds'');
882 fun read_terms ctxt T =
883 map (Syntax.parse_term ctxt #> TypeInfer.constrain T) #> Syntax.check_terms ctxt;
885 val match_bind = gen_bind read_terms;
886 val match_bind_i = gen_bind (fn ctxt => fn _ => map (cert_term ctxt));
891 (* propositions with patterns *)
895 fun prep_propp mode prep_props (context, args) =
897 fun prep (_, raw_pats) (ctxt, prop :: props) =
898 let val ctxt' = Variable.declare_term prop ctxt
899 in ((prop, prep_props (set_mode mode_pattern ctxt') raw_pats), (ctxt', props)) end;
901 val (propp, (context', _)) = (fold_map o fold_map) prep args
902 (context, prep_props (set_mode mode context) (maps (map fst) args));
903 in (context', propp) end;
905 fun gen_bind_propp mode parse_prop (ctxt, raw_args) =
907 val (ctxt', args) = prep_propp mode parse_prop (ctxt, raw_args);
908 val binds = flat (flat (map (map (simult_matches ctxt')) args));
909 val propss = map (map #1) args;
911 (*generalize result: context evaluated now, binds added later*)
912 val gen = Variable.exportT_terms ctxt' ctxt;
913 fun gen_binds c = c |> bind_terms (map #1 binds ~~ map SOME (gen (map #2 binds)));
914 in (ctxt' |> bind_terms (map (apsnd SOME) binds), (propss, gen_binds)) end;
918 val read_propp = prep_propp mode_default Syntax.read_props;
919 val cert_propp = prep_propp mode_default (map o cert_prop);
920 val read_propp_schematic = prep_propp mode_schematic Syntax.read_props;
921 val cert_propp_schematic = prep_propp mode_schematic (map o cert_prop);
923 val bind_propp = gen_bind_propp mode_default Syntax.read_props;
924 val bind_propp_i = gen_bind_propp mode_default (map o cert_prop);
925 val bind_propp_schematic = gen_bind_propp mode_schematic Syntax.read_props;
926 val bind_propp_schematic_i = gen_bind_propp mode_schematic (map o cert_prop);
936 fun comp_incr_tac [] _ = no_tac
937 | comp_incr_tac (th :: ths) i =
938 (fn st => Goal.compose_hhf_tac (Drule.incr_indexes st th) i st) APPEND comp_incr_tac ths i;
940 fun fact_tac facts = Goal.norm_hhf_tac THEN' comp_incr_tac facts;
942 fun potential_facts ctxt prop =
943 Facts.could_unify (facts_of ctxt) (Term.strip_all_body prop);
945 fun some_fact_tac ctxt = SUBGOAL (fn (goal, i) => fact_tac (potential_facts ctxt goal) i);
952 fun retrieve_thms pick ctxt (Facts.Fact s) =
954 val (_, pos) = Syntax.read_token s;
955 val prop = Syntax.read_prop (set_mode mode_default ctxt) s
956 |> singleton (Variable.polymorphic ctxt);
959 Goal.prove ctxt [] [] prop (K (ALLGOALS (fact_tac [th])));
961 (case get_first (try prove_fact) (potential_facts ctxt prop) of
963 | NONE => error ("Failed to retrieve literal fact" ^ Position.str_of pos ^ ":\n" ^
964 Syntax.string_of_term ctxt prop))
966 | retrieve_thms pick ctxt xthmref =
968 val thy = theory_of ctxt;
969 val local_facts = facts_of ctxt;
970 val thmref = Facts.map_name_of_ref (Facts.intern local_facts) xthmref;
971 val name = Facts.name_of_ref thmref;
972 val pos = Facts.pos_of_ref xthmref;
974 if name = "" then [Thm.transfer thy Drule.dummy_thm]
976 (case Facts.lookup (Context.Proof ctxt) local_facts name of
977 SOME (_, ths) => (Position.report (Markup.local_fact name) pos;
978 map (Thm.transfer thy) (Facts.select thmref ths))
979 | NONE => PureThy.get_fact (Context.Proof ctxt) thy xthmref);
980 in pick name thms end;
984 val get_fact = retrieve_thms (K I);
985 val get_fact_single = retrieve_thms Facts.the_single;
987 fun get_thms ctxt = get_fact ctxt o Facts.named;
988 fun get_thm ctxt = get_fact_single ctxt o Facts.named;
997 fun update_thms _ (b, NONE) ctxt = ctxt |> map_facts (Facts.del (full_name ctxt b))
998 | update_thms do_props (b, SOME ths) ctxt = ctxt |> map_facts
999 (Facts.add_local do_props (naming_of ctxt) (b, ths) #> snd);
1003 fun note_thmss kind = fold_map (fn ((b, more_attrs), raw_facts) => fn ctxt =>
1005 val pos = Binding.pos_of b;
1006 val name = full_name ctxt b;
1007 val _ = Context_Position.report_visible ctxt (Markup.local_fact_decl name) pos;
1009 val facts = PureThy.name_thmss false name raw_facts;
1010 fun app (th, attrs) x =
1011 swap (Library.foldl_map
1012 (Thm.proof_attributes (surround (Thm.kind kind) (attrs @ more_attrs))) (x, th));
1013 val (res, ctxt') = fold_map app facts ctxt;
1014 val thms = PureThy.name_thms false false name (flat res);
1015 val Mode {stmt, ...} = get_mode ctxt;
1016 in ((name, thms), ctxt' |> update_thms stmt (b, SOME thms)) end);
1018 fun put_thms do_props thms ctxt = ctxt
1019 |> map_naming (K local_naming)
1020 |> Context_Position.set_visible false
1021 |> update_thms do_props (apfst Binding.name thms)
1022 |> Context_Position.restore_visible ctxt
1023 |> restore_naming ctxt;
1029 (** basic logical entities **)
1033 fun declare_var (x, opt_T, mx) ctxt =
1034 let val T = (case opt_T of SOME T => T | NONE => Syntax.mixfixT mx)
1035 in ((x, T, mx), ctxt |> Variable.declare_constraints (Free (x, T))) end;
1039 fun prep_vars prep_typ internal =
1040 fold_map (fn (b, raw_T, mx) => fn ctxt =>
1042 val x = Name.of_binding b;
1043 val _ = Syntax.is_identifier (no_skolem internal x) orelse
1044 error ("Illegal variable name: " ^ quote (Binding.str_of b));
1048 else Type.no_tvars T handle TYPE (msg, _, _) => error msg;
1049 val opt_T = Option.map (cond_tvars o cert_typ ctxt o prep_typ ctxt) raw_T;
1050 val (_, ctxt') = ctxt |> declare_var (x, opt_T, mx);
1051 in ((b, opt_T, mx), ctxt') end);
1055 val read_vars = prep_vars Syntax.parse_typ false;
1056 val cert_vars = prep_vars (K I) true;
1061 (* authentic syntax *)
1065 (Sign.add_advanced_trfuns
1066 (Syntax.type_ast_trs
1067 {read_class = read_class,
1068 read_type = fn ctxt => #1 o dest_Type o read_type_name_proper ctxt false}, [], [], [])));
1072 fun const_ast_tr intern ctxt [Syntax.Variable c] =
1074 val Const (c', _) = read_const_proper ctxt false c;
1075 val d = if intern then Syntax.mark_const c' else c;
1076 in Syntax.Constant d end
1077 | const_ast_tr _ _ asts = raise Syntax.AST ("const_ast_tr", asts);
1079 val typ = Simple_Syntax.read_typ;
1083 val _ = Context.>> (Context.map_theory
1085 [("_context_const", typ "id => logic", Delimfix "CONST _"),
1086 ("_context_const", typ "id => aprop", Delimfix "CONST _"),
1087 ("_context_const", typ "longid => logic", Delimfix "CONST _"),
1088 ("_context_const", typ "longid => aprop", Delimfix "CONST _"),
1089 ("_context_xconst", typ "id => logic", Delimfix "XCONST _"),
1090 ("_context_xconst", typ "id => aprop", Delimfix "XCONST _"),
1091 ("_context_xconst", typ "longid => logic", Delimfix "XCONST _"),
1092 ("_context_xconst", typ "longid => aprop", Delimfix "XCONST _")] #>
1093 Sign.add_advanced_trfuns
1094 ([("_context_const", const_ast_tr true), ("_context_xconst", const_ast_tr false)], [], [], [])));
1103 fun type_syntax (Type (c, args), mx) =
1104 SOME (Local_Syntax.Type, (Syntax.mark_type c, Syntax.make_type (length args), mx))
1105 | type_syntax _ = NONE;
1107 fun const_syntax _ (Free (x, T), mx) = SOME (Local_Syntax.Fixed, (x, T, mx))
1108 | const_syntax ctxt (Const (c, _), mx) =
1109 (case try (Consts.type_scheme (consts_of ctxt)) c of
1110 SOME T => SOME (Local_Syntax.Const, (Syntax.mark_const c, T, mx))
1112 | const_syntax _ _ = NONE;
1114 fun gen_notation syntax add mode args ctxt =
1116 (Local_Syntax.update_modesyntax (theory_of ctxt) add mode (map_filter (syntax ctxt) args));
1120 val type_notation = gen_notation (K type_syntax);
1121 val notation = gen_notation const_syntax;
1123 fun target_type_notation add mode args phi =
1125 val args' = args |> map_filter (fn (T, mx) =>
1127 val T' = Morphism.typ phi T;
1128 val similar = (case (T, T') of (Type (c, _), Type (c', _)) => c = c' | _ => false);
1129 in if similar then SOME (T', mx) else NONE end);
1130 in Context.mapping (Sign.type_notation add mode args') (type_notation add mode args') end;
1132 fun target_notation add mode args phi =
1134 val args' = args |> map_filter (fn (t, mx) =>
1135 let val t' = Morphism.term phi t
1136 in if Term.aconv_untyped (t, t') then SOME (t', mx) else NONE end);
1137 in Context.mapping (Sign.notation add mode args') (notation add mode args') end;
1144 fun class_alias b c ctxt = (map_tsig o apfst) (Type.class_alias (naming_of ctxt) b c) ctxt;
1145 fun type_alias b c ctxt = (map_tsig o apfst) (Type.type_alias (naming_of ctxt) b c) ctxt;
1146 fun const_alias b c ctxt = (map_consts o apfst) (Consts.alias (naming_of ctxt) b c) ctxt;
1149 (* local constants *)
1151 fun add_const_constraint (c, opt_T) ctxt =
1154 let val T = cert_typ ctxt raw_T
1155 in cert_term ctxt (Const (c, T)); T end;
1156 in ctxt |> (map_consts o apfst) (Consts.constrain (c, Option.map prepT opt_T)) end;
1158 fun add_abbrev mode (b, raw_t) ctxt =
1160 val t0 = cert_term (ctxt |> set_mode mode_abbrev) raw_t
1161 handle ERROR msg => cat_error msg ("in constant abbreviation " ^ quote (Binding.str_of b));
1162 val [t] = Variable.exportT_terms (Variable.declare_term t0 ctxt) ctxt [t0];
1163 val ((lhs, rhs), consts') = consts_of ctxt
1164 |> Consts.abbreviate (Syntax.pp ctxt) (tsig_of ctxt) (naming_of ctxt) mode (b, t);
1167 |> (map_consts o apfst) (K consts')
1168 |> Variable.declare_term rhs
1172 fun revert_abbrev mode c = (map_consts o apfst) (Consts.revert_abbrev mode c);
1177 fun add_fixes raw_vars ctxt =
1179 val (vars, _) = cert_vars raw_vars ctxt;
1180 val (xs', ctxt') = Variable.add_fixes (map (Name.of_binding o #1) vars) ctxt;
1183 |> fold_map declare_var (map2 (fn x' => fn (_, T, mx) => (x', T, mx)) xs' vars)
1184 |-> (map_syntax o Local_Syntax.add_syntax (theory_of ctxt) o map (pair Local_Syntax.Fixed));
1185 val _ = (vars ~~ xs') |> List.app (fn ((b, _, _), x') =>
1186 Context_Position.report_visible ctxt (Markup.fixed_decl x') (Binding.pos_of b));
1187 in (xs', ctxt'') end;
1190 (* fixes vs. frees *)
1192 fun auto_fixes (ctxt, (propss, x)) =
1193 ((fold o fold) Variable.auto_fixes propss ctxt, (propss, x));
1195 fun bind_fixes xs ctxt =
1197 val (_, ctxt') = ctxt |> add_fixes (map (fn x => (Binding.name x, NONE, NoSyn)) xs);
1198 fun bind (t as Free (x, T)) =
1199 if member (op =) xs x then
1200 (case lookup_skolem ctxt' x of SOME x' => Free (x', T) | NONE => t)
1202 | bind (t $ u) = bind t $ bind u
1203 | bind (Abs (x, T, t)) = Abs (x, T, bind t)
1205 in (bind, ctxt') end;
1213 fun gen_assms prepp exp args ctxt =
1215 val cert = Thm.cterm_of (theory_of ctxt);
1216 val (propss, ctxt1) = swap (prepp (ctxt, map snd args));
1217 val _ = Variable.warn_extra_tfrees ctxt ctxt1;
1218 val (premss, ctxt2) = fold_burrow (Assumption.add_assms exp o map cert) propss ctxt1;
1221 |> auto_bind_facts (flat propss)
1222 |> note_thmss "" (map fst args ~~ map (map (fn th => ([th], []))) premss)
1227 val add_assms = gen_assms (apsnd #1 o bind_propp);
1228 val add_assms_i = gen_assms (apsnd #1 o bind_propp_i);
1238 fun rem_case name = remove (fn (x: string, (y, _)) => x = y) name;
1240 fun add_case _ ("", _) cases = cases
1241 | add_case _ (name, NONE) cases = rem_case name cases
1242 | add_case is_proper (name, SOME c) cases = (name, (c, is_proper)) :: rem_case name cases;
1244 fun prep_case name fxs c =
1246 fun replace (opt_x :: xs) ((y, T) :: ys) = (the_default y opt_x, T) :: replace xs ys
1247 | replace [] ys = ys
1248 | replace (_ :: _) [] = error ("Too many parameters for case " ^ quote name);
1249 val Rule_Cases.Case {fixes, assumes, binds, cases} = c;
1250 val fixes' = replace fxs fixes;
1251 val binds' = map drop_schematic binds;
1253 if null (fold (Term.add_tvarsT o snd) fixes []) andalso
1254 null (fold (fold Term.add_vars o snd) assumes []) then
1255 Rule_Cases.Case {fixes = fixes', assumes = assumes, binds = binds', cases = cases}
1256 else error ("Illegal schematic variable(s) in case " ^ quote name)
1259 fun fix (x, T) ctxt =
1261 val (bind, ctxt') = bind_fixes [x] ctxt;
1262 val t = bind (Free (x, T));
1263 in (t, ctxt' |> Variable.declare_constraints t) end;
1267 fun add_cases is_proper = map_cases o fold (add_case is_proper);
1269 fun case_result c ctxt =
1271 val Rule_Cases.Case {fixes, ...} = c;
1272 val (ts, ctxt') = ctxt |> fold_map fix fixes;
1273 val Rule_Cases.Case {assumes, binds, cases, ...} = Rule_Cases.apply ts c;
1276 |> bind_terms (map drop_schematic binds)
1277 |> add_cases true (map (apsnd SOME) cases)
1278 |> pair (assumes, (binds, cases))
1281 val apply_case = apfst fst oo case_result;
1283 fun get_case ctxt name xs =
1284 (case AList.lookup (op =) (cases_of ctxt) name of
1285 NONE => error ("Unknown case: " ^ quote name)
1286 | SOME (c, _) => prep_case name xs c);
1292 (** print context information **)
1296 val print_syntax = Syntax.print_syntax o syn_of;
1301 fun pretty_abbrevs show_globals ctxt =
1303 val ((space, consts), (_, globals)) =
1304 pairself (#constants o Consts.dest) (#consts (rep_context ctxt));
1305 fun add_abbr (_, (_, NONE)) = I
1306 | add_abbr (c, (T, SOME t)) =
1307 if not show_globals andalso Symtab.defined globals c then I
1308 else cons (c, Logic.mk_equals (Const (c, T), t));
1309 val abbrevs = Name_Space.extern_table (space, Symtab.make (Symtab.fold add_abbr consts []));
1311 if null abbrevs then []
1312 else [Pretty.big_list "abbreviations:" (map (pretty_term_abbrev ctxt o #2) abbrevs)]
1315 val print_abbrevs = Pretty.writeln o Pretty.chunks o pretty_abbrevs true;
1320 fun pretty_binds ctxt =
1322 val binds = Variable.binds_of ctxt;
1323 fun prt_bind (xi, (T, t)) = pretty_term_abbrev ctxt (Logic.mk_equals (Var (xi, T), t));
1325 if Vartab.is_empty binds then []
1326 else [Pretty.big_list "term bindings:" (map prt_bind (Vartab.dest binds))]
1329 val print_binds = Pretty.writeln o Pretty.chunks o pretty_binds;
1332 (* local theorems *)
1334 fun pretty_lthms ctxt =
1336 val local_facts = facts_of ctxt;
1337 val props = Facts.props local_facts;
1339 (if null props then [] else [("<unnamed>", props)]) @
1340 Facts.dest_static [] local_facts;
1342 if null facts then []
1343 else [Pretty.big_list "facts:" (map #1 (sort_wrt (#1 o #2) (map (`(pretty_fact ctxt)) facts)))]
1346 val print_lthms = Pretty.writeln o Pretty.chunks o pretty_lthms;
1349 (* local contexts *)
1353 fun pretty_case (name, (fixes, ((asms, (lets, cs)), ctxt))) =
1355 val prt_term = Syntax.pretty_term ctxt;
1357 fun prt_let (xi, t) = Pretty.block
1358 [Pretty.quote (prt_term (Var (xi, Term.fastype_of t))), Pretty.str " =", Pretty.brk 1,
1359 Pretty.quote (prt_term t)];
1361 fun prt_asm (a, ts) = Pretty.block (Pretty.breaks
1362 ((if a = "" then [] else [Pretty.str (a ^ ":")]) @ map (Pretty.quote o prt_term) ts));
1364 fun prt_sect _ _ _ [] = []
1365 | prt_sect s sep prt xs =
1366 [Pretty.block (Pretty.breaks (Pretty.str s ::
1367 flat (separate sep (map (single o prt) xs))))];
1369 Pretty.block (Pretty.fbreaks
1370 (Pretty.str (name ^ ":") ::
1371 prt_sect "fix" [] (Pretty.str o fst) fixes @
1372 prt_sect "let" [Pretty.str "and"] prt_let
1373 (map_filter (fn (xi, SOME t) => SOME (xi, t) | _ => NONE) lets) @
1374 (if forall (null o #2) asms then []
1375 else prt_sect "assume" [Pretty.str "and"] prt_asm asms) @
1376 prt_sect "subcases:" [] (Pretty.str o fst) cs))
1381 fun pretty_cases ctxt =
1383 fun add_case (_, (_, false)) = I
1384 | add_case (name, (c as Rule_Cases.Case {fixes, ...}, true)) =
1385 cons (name, (fixes, case_result c ctxt));
1386 val cases = fold add_case (cases_of ctxt) [];
1388 if null cases then []
1389 else [Pretty.big_list "cases:" (map pretty_case cases)]
1392 val print_cases = Pretty.writeln o Pretty.chunks o pretty_cases;
1399 val debug = Unsynchronized.ref false;
1400 val verbose = Unsynchronized.ref false;
1401 val prems_limit = Unsynchronized.ref ~1;
1403 fun pretty_ctxt ctxt =
1404 if ! prems_limit < 0 andalso not (! debug) then []
1407 val prt_term = Syntax.pretty_term ctxt;
1410 val {structs, ...} = Local_Syntax.idents_of (syntax_of ctxt);
1412 if null structs then []
1413 else [Pretty.block (Pretty.str "structures:" :: Pretty.brk 1 ::
1414 Pretty.commas (map Pretty.str structs))];
1417 fun prt_fix (x, x') =
1418 if x = x' then Pretty.str x
1419 else Pretty.block [Pretty.str x, Pretty.str " =", Pretty.brk 1, prt_term (Syntax.free x')];
1421 rev (filter_out ((can Name.dest_internal orf member (op =) structs) o #1)
1422 (Variable.fixes_of ctxt));
1424 if null fixes then []
1425 else [Pretty.block (Pretty.str "fixed variables:" :: Pretty.brk 1 ::
1426 Pretty.commas (map prt_fix fixes))];
1429 val prems = Assumption.all_prems_of ctxt;
1430 val len = length prems;
1431 val suppressed = len - ! prems_limit;
1433 if null prems then []
1434 else [Pretty.big_list "prems:" ((if suppressed <= 0 then [] else [Pretty.str "..."]) @
1435 map (Display.pretty_thm ctxt) (drop suppressed prems))];
1436 in prt_structs @ prt_fixes @ prt_prems end;
1441 fun pretty_context ctxt =
1443 val is_verbose = ! verbose;
1444 fun verb f x = if is_verbose then f (x ()) else [];
1446 val prt_term = Syntax.pretty_term ctxt;
1447 val prt_typ = Syntax.pretty_typ ctxt;
1448 val prt_sort = Syntax.pretty_sort ctxt;
1451 val pretty_thy = Pretty.block
1452 [Pretty.str "theory:", Pretty.brk 1, Context.pretty_thy (theory_of ctxt)];
1455 fun prt_atom prt prtT (x, X) = Pretty.block
1456 [prt x, Pretty.str " ::", Pretty.brk 1, prtT X];
1458 fun prt_var (x, ~1) = prt_term (Syntax.free x)
1459 | prt_var xi = prt_term (Syntax.var xi);
1461 fun prt_varT (x, ~1) = prt_typ (TFree (x, []))
1462 | prt_varT xi = prt_typ (TVar (xi, []));
1464 val prt_defT = prt_atom prt_var prt_typ;
1465 val prt_defS = prt_atom prt_varT prt_sort;
1467 val (types, sorts) = Variable.constraints_of ctxt;
1469 verb single (K pretty_thy) @
1471 verb (pretty_abbrevs false) (K ctxt) @
1472 verb pretty_binds (K ctxt) @
1473 verb pretty_lthms (K ctxt) @
1474 verb pretty_cases (K ctxt) @
1475 verb single (fn () => Pretty.big_list "type constraints:" (map prt_defT (Vartab.dest types))) @
1476 verb single (fn () => Pretty.big_list "default sorts:" (map prt_defS (Vartab.dest sorts)))