wenzelm@5819: (* Title: Pure/Isar/proof_context.ML wenzelm@5819: Author: Markus Wenzel, TU Muenchen wenzelm@5819: wenzelm@19001: The key concept of Isar proof contexts: elevates primitive local wenzelm@19001: reasoning Gamma |- phi to a structured concept, with generic context wenzelm@20234: elements. See also structure Variable and Assumption. wenzelm@5819: *) wenzelm@5819: wenzelm@5819: signature PROOF_CONTEXT = wenzelm@5819: sig wenzelm@20310: val theory_of: Proof.context -> theory wenzelm@20310: val init: theory -> Proof.context wenzelm@24388: type mode wenzelm@24501: val mode_default: mode wenzelm@24501: val mode_stmt: mode wenzelm@24501: val mode_pattern: mode wenzelm@24501: val mode_schematic: mode wenzelm@24501: val mode_abbrev: mode wenzelm@24388: val set_mode: mode -> Proof.context -> Proof.context wenzelm@24388: val get_mode: Proof.context -> mode wenzelm@24388: val restore_mode: Proof.context -> Proof.context -> Proof.context wenzelm@27286: val abbrev_mode: Proof.context -> bool wenzelm@21667: val set_stmt: bool -> Proof.context -> Proof.context wenzelm@33165: val local_naming: Name_Space.naming wenzelm@33165: val map_naming: (Name_Space.naming -> Name_Space.naming) -> Proof.context -> Proof.context wenzelm@33100: val naming_of: Proof.context -> Name_Space.naming wenzelm@33165: val restore_naming: Proof.context -> Proof.context -> Proof.context haftmann@29581: val full_name: Proof.context -> binding -> string wenzelm@35114: val syn_of: Proof.context -> Syntax.syntax wenzelm@35676: val tsig_of: Proof.context -> Type.tsig wenzelm@36451: val set_defsort: sort -> Proof.context -> Proof.context wenzelm@35680: val default_sort: Proof.context -> indexname -> sort wenzelm@20310: val consts_of: Proof.context -> Consts.T haftmann@24752: val the_const_constraint: Proof.context -> string -> typ wenzelm@20784: val set_syntax_mode: Syntax.mode -> Proof.context -> Proof.context wenzelm@20310: val restore_syntax_mode: Proof.context -> Proof.context -> Proof.context wenzelm@26284: val facts_of: Proof.context -> Facts.T blanchet@34969: val cases_of: Proof.context -> (string * (Rule_Cases.T * bool)) list wenzelm@27259: val transfer_syntax: theory -> Proof.context -> Proof.context wenzelm@20310: val transfer: theory -> Proof.context -> Proof.context wenzelm@20367: val theory: (theory -> theory) -> Proof.context -> Proof.context wenzelm@20367: val theory_result: (theory -> 'a * theory) -> Proof.context -> 'a * Proof.context wenzelm@28212: val extern_fact: Proof.context -> string -> xstring wenzelm@21728: val pretty_term_abbrev: Proof.context -> term -> Pretty.T wenzelm@30726: val pretty_fact_aux: Proof.context -> bool -> string * thm list -> Pretty.T wenzelm@20310: val pretty_fact: Proof.context -> string * thm list -> Pretty.T wenzelm@35676: val read_class: Proof.context -> xstring -> class wenzelm@35676: val read_arity: Proof.context -> xstring * string list * string -> arity wenzelm@35676: val cert_arity: Proof.context -> arity -> arity wenzelm@20310: val read_typ: Proof.context -> string -> typ wenzelm@20310: val read_typ_syntax: Proof.context -> string -> typ wenzelm@20310: val read_typ_abbrev: Proof.context -> string -> typ wenzelm@20310: val cert_typ: Proof.context -> typ -> typ wenzelm@20310: val cert_typ_syntax: Proof.context -> typ -> typ wenzelm@20310: val cert_typ_abbrev: Proof.context -> typ -> typ wenzelm@20310: val get_skolem: Proof.context -> string -> string wenzelm@20310: val revert_skolem: Proof.context -> string -> string wenzelm@36521: val infer_type: Proof.context -> string * typ -> typ wenzelm@28082: val inferred_param: string -> Proof.context -> typ * Proof.context wenzelm@25328: val inferred_fixes: Proof.context -> (string * typ) list * Proof.context wenzelm@35360: val read_type_name: Proof.context -> bool -> string -> typ wenzelm@35676: val read_type_name_proper: Proof.context -> bool -> string -> typ wenzelm@35399: val read_const_proper: Proof.context -> bool -> string -> term wenzelm@36521: val read_const: Proof.context -> bool -> typ -> string -> term wenzelm@27259: val allow_dummies: Proof.context -> Proof.context wenzelm@36153: val check_tvar: Proof.context -> indexname * sort -> indexname * sort wenzelm@36153: val check_tfree: Proof.context -> string * sort -> string * sort wenzelm@22763: val decode_term: Proof.context -> term -> term wenzelm@25406: val standard_infer_types: Proof.context -> term list -> term list wenzelm@24684: val read_term_pattern: Proof.context -> string -> term wenzelm@24684: val read_term_schematic: Proof.context -> string -> term wenzelm@24684: val read_term_abbrev: Proof.context -> string -> term wenzelm@25345: val expand_abbrevs: Proof.context -> term -> term wenzelm@20310: val cert_term: Proof.context -> term -> term wenzelm@20310: val cert_prop: Proof.context -> term -> term wenzelm@35616: val def_type: Proof.context -> indexname -> typ option wenzelm@20310: val goal_export: Proof.context -> Proof.context -> thm list -> thm list wenzelm@20310: val export: Proof.context -> Proof.context -> thm list -> thm list wenzelm@21531: val export_morphism: Proof.context -> Proof.context -> morphism wenzelm@28396: val norm_export_morphism: Proof.context -> Proof.context -> morphism wenzelm@30764: val bind_terms: (indexname * term option) list -> Proof.context -> Proof.context wenzelm@20310: val auto_bind_goal: term list -> Proof.context -> Proof.context wenzelm@20310: val auto_bind_facts: term list -> Proof.context -> Proof.context wenzelm@20310: val match_bind: bool -> (string list * string) list -> Proof.context -> term list * Proof.context wenzelm@20310: val match_bind_i: bool -> (term list * term) list -> Proof.context -> term list * Proof.context wenzelm@20310: val read_propp: Proof.context * (string * string list) list list wenzelm@20310: -> Proof.context * (term * term list) list list wenzelm@20310: val cert_propp: Proof.context * (term * term list) list list wenzelm@20310: -> Proof.context * (term * term list) list list wenzelm@20310: val read_propp_schematic: Proof.context * (string * string list) list list wenzelm@20310: -> Proof.context * (term * term list) list list wenzelm@20310: val cert_propp_schematic: Proof.context * (term * term list) list list wenzelm@20310: -> Proof.context * (term * term list) list list wenzelm@20310: val bind_propp: Proof.context * (string * string list) list list wenzelm@20310: -> Proof.context * (term list list * (Proof.context -> Proof.context)) wenzelm@20310: val bind_propp_i: Proof.context * (term * term list) list list wenzelm@20310: -> Proof.context * (term list list * (Proof.context -> Proof.context)) wenzelm@20310: val bind_propp_schematic: Proof.context * (string * string list) list list wenzelm@20310: -> Proof.context * (term list list * (Proof.context -> Proof.context)) wenzelm@20310: val bind_propp_schematic_i: Proof.context * (term * term list) list list wenzelm@20310: -> Proof.context * (term list list * (Proof.context -> Proof.context)) wenzelm@18042: val fact_tac: thm list -> int -> tactic wenzelm@20310: val some_fact_tac: Proof.context -> int -> tactic wenzelm@26346: val get_fact: Proof.context -> Facts.ref -> thm list wenzelm@26346: val get_fact_single: Proof.context -> Facts.ref -> thm wenzelm@26346: val get_thms: Proof.context -> xstring -> thm list wenzelm@26346: val get_thm: Proof.context -> xstring -> thm wenzelm@30768: val note_thmss: string -> (Thm.binding * (thm list * attribute list) list) list -> wenzelm@30215: Proof.context -> (string * thm list) list * Proof.context wenzelm@26250: val put_thms: bool -> string * thm list option -> Proof.context -> Proof.context haftmann@29581: val read_vars: (binding * string option * mixfix) list -> Proof.context -> haftmann@29581: (binding * typ option * mixfix) list * Proof.context haftmann@29581: val cert_vars: (binding * typ option * mixfix) list -> Proof.context -> haftmann@29581: (binding * typ option * mixfix) list * Proof.context wenzelm@30770: val add_fixes: (binding * typ option * mixfix) list -> Proof.context -> wenzelm@30770: string list * Proof.context wenzelm@20310: val auto_fixes: Proof.context * (term list list * 'a) -> Proof.context * (term list list * 'a) wenzelm@20310: val bind_fixes: string list -> Proof.context -> (term -> term) * Proof.context wenzelm@20234: val add_assms: Assumption.export -> wenzelm@30215: (Thm.binding * (string * string list) list) list -> wenzelm@28082: Proof.context -> (string * thm list) list * Proof.context wenzelm@20234: val add_assms_i: Assumption.export -> wenzelm@30215: (Thm.binding * (term * term list) list) list -> wenzelm@28082: Proof.context -> (string * thm list) list * Proof.context wenzelm@33368: val add_cases: bool -> (string * Rule_Cases.T option) list -> Proof.context -> Proof.context wenzelm@33368: val apply_case: Rule_Cases.T -> Proof.context -> (string * term list) list * Proof.context wenzelm@33368: val get_case: Proof.context -> string -> string option list -> Rule_Cases.T wenzelm@35417: val type_notation: bool -> Syntax.mode -> (typ * mixfix) list -> Proof.context -> Proof.context wenzelm@24949: val notation: bool -> Syntax.mode -> (term * mixfix) list -> Proof.context -> Proof.context wenzelm@35417: val target_type_notation: bool -> Syntax.mode -> (typ * mixfix) list -> morphism -> wenzelm@35417: Context.generic -> Context.generic wenzelm@24949: val target_notation: bool -> Syntax.mode -> (term * mixfix) list -> morphism -> wenzelm@21744: Context.generic -> Context.generic wenzelm@35680: val class_alias: binding -> class -> Proof.context -> Proof.context wenzelm@35680: val type_alias: binding -> string -> Proof.context -> Proof.context wenzelm@35680: val const_alias: binding -> string -> Proof.context -> Proof.context wenzelm@24767: val add_const_constraint: string * typ option -> Proof.context -> Proof.context wenzelm@33173: val add_abbrev: string -> binding * term -> Proof.context -> (term * term) * Proof.context wenzelm@25052: val revert_abbrev: string -> string -> Proof.context -> Proof.context wenzelm@20310: val print_syntax: Proof.context -> unit wenzelm@21728: val print_abbrevs: Proof.context -> unit wenzelm@20310: val print_binds: Proof.context -> unit wenzelm@20310: val print_lthms: Proof.context -> unit wenzelm@20310: val print_cases: Proof.context -> unit wenzelm@32738: val debug: bool Unsynchronized.ref wenzelm@35146: val verbose: bool Unsynchronized.ref wenzelm@32738: val prems_limit: int Unsynchronized.ref wenzelm@20310: val pretty_ctxt: Proof.context -> Pretty.T list wenzelm@20310: val pretty_context: Proof.context -> Pretty.T list wenzelm@5819: end; wenzelm@5819: wenzelm@16540: structure ProofContext: PROOF_CONTEXT = wenzelm@5819: struct wenzelm@5819: wenzelm@33031: open ProofContext; wenzelm@16540: wenzelm@16540: wenzelm@24388: (** inner syntax mode **) wenzelm@24388: wenzelm@24388: datatype mode = wenzelm@24388: Mode of wenzelm@24486: {stmt: bool, (*inner statement mode*) wenzelm@24388: pattern: bool, (*pattern binding schematic variables*) wenzelm@24388: schematic: bool, (*term referencing loose schematic variables*) wenzelm@24388: abbrev: bool}; (*abbrev mode -- no normalization*) wenzelm@24388: wenzelm@24486: fun make_mode (stmt, pattern, schematic, abbrev) = wenzelm@24486: Mode {stmt = stmt, pattern = pattern, schematic = schematic, abbrev = abbrev}; wenzelm@24388: wenzelm@24486: val mode_default = make_mode (false, false, false, false); wenzelm@24486: val mode_stmt = make_mode (true, false, false, false); wenzelm@24486: val mode_pattern = make_mode (false, true, false, false); wenzelm@24486: val mode_schematic = make_mode (false, false, true, false); wenzelm@24486: val mode_abbrev = make_mode (false, false, false, true); wenzelm@24388: wenzelm@24388: wenzelm@16540: wenzelm@16540: (** Isar proof context information **) wenzelm@5819: wenzelm@16540: datatype ctxt = wenzelm@16540: Ctxt of wenzelm@36451: {mode: mode, (*inner syntax mode*) wenzelm@36451: naming: Name_Space.naming, (*local naming conventions*) wenzelm@36451: syntax: Local_Syntax.T, (*local syntax*) wenzelm@36451: tsig: Type.tsig * Type.tsig, (*local/global type signature -- local name space / defsort only*) wenzelm@36451: consts: Consts.T * Consts.T, (*local/global consts -- local name space / abbrevs only*) wenzelm@36451: facts: Facts.T, (*local facts*) wenzelm@33368: cases: (string * (Rule_Cases.T * bool)) list}; (*named case contexts*) wenzelm@5819: wenzelm@36450: fun make_ctxt (mode, naming, syntax, tsig, consts, facts, cases) = haftmann@26240: Ctxt {mode = mode, naming = naming, syntax = syntax, wenzelm@36450: tsig = tsig, consts = consts, facts = facts, cases = cases}; wenzelm@5819: wenzelm@33100: val local_naming = Name_Space.default_naming |> Name_Space.add_path "local"; wenzelm@19079: wenzelm@33519: structure ContextData = Proof_Data wenzelm@18672: ( wenzelm@16540: type T = ctxt; wenzelm@16540: fun init thy = wenzelm@33387: make_ctxt (mode_default, local_naming, Local_Syntax.init thy, wenzelm@35676: (Sign.tsig_of thy, Sign.tsig_of thy), wenzelm@26284: (Sign.consts_of thy, Sign.consts_of thy), Facts.empty, []); wenzelm@18672: ); wenzelm@10810: wenzelm@16540: fun rep_context ctxt = ContextData.get ctxt |> (fn Ctxt args => args); wenzelm@10810: wenzelm@18672: fun map_context f = wenzelm@36450: ContextData.map (fn Ctxt {mode, naming, syntax, tsig, consts, facts, cases} => wenzelm@36450: make_ctxt (f (mode, naming, syntax, tsig, consts, facts, cases))); wenzelm@21443: wenzelm@36450: fun set_mode mode = map_context (fn (_, naming, syntax, tsig, consts, facts, cases) => wenzelm@36450: (mode, naming, syntax, tsig, consts, facts, cases)); wenzelm@24388: wenzelm@24388: fun map_mode f = wenzelm@36450: map_context (fn (Mode {stmt, pattern, schematic, abbrev}, naming, syntax, tsig, consts, facts, cases) => wenzelm@36450: (make_mode (f (stmt, pattern, schematic, abbrev)), naming, syntax, tsig, consts, facts, cases)); wenzelm@18672: wenzelm@19001: fun map_naming f = wenzelm@36450: map_context (fn (mode, naming, syntax, tsig, consts, facts, cases) => wenzelm@36450: (mode, f naming, syntax, tsig, consts, facts, cases)); wenzelm@18672: wenzelm@19001: fun map_syntax f = wenzelm@36450: map_context (fn (mode, naming, syntax, tsig, consts, facts, cases) => wenzelm@36450: (mode, naming, f syntax, tsig, consts, facts, cases)); wenzelm@35676: wenzelm@36450: fun map_tsig f = wenzelm@36450: map_context (fn (mode, naming, syntax, tsig, consts, facts, cases) => wenzelm@36450: (mode, naming, syntax, f tsig, consts, facts, cases)); wenzelm@18672: wenzelm@19001: fun map_consts f = wenzelm@36450: map_context (fn (mode, naming, syntax, tsig, consts, facts, cases) => wenzelm@36450: (mode, naming, syntax, tsig, f consts, facts, cases)); wenzelm@18672: wenzelm@26284: fun map_facts f = wenzelm@36450: map_context (fn (mode, naming, syntax, tsig, consts, facts, cases) => wenzelm@36450: (mode, naming, syntax, tsig, consts, f facts, cases)); wenzelm@18672: wenzelm@19001: fun map_cases f = wenzelm@36450: map_context (fn (mode, naming, syntax, tsig, consts, facts, cases) => wenzelm@36450: (mode, naming, syntax, tsig, consts, facts, f cases)); wenzelm@21443: wenzelm@24388: val get_mode = #mode o rep_context; wenzelm@28407: val restore_mode = set_mode o get_mode; wenzelm@27286: val abbrev_mode = get_mode #> (fn Mode {abbrev, ...} => abbrev); wenzelm@24388: wenzelm@24486: fun set_stmt stmt = wenzelm@24486: map_mode (fn (_, pattern, schematic, abbrev) => (stmt, pattern, schematic, abbrev)); wenzelm@19001: wenzelm@19001: val naming_of = #naming o rep_context; wenzelm@33165: val restore_naming = map_naming o K o naming_of wenzelm@33100: val full_name = Name_Space.full_name o naming_of; wenzelm@10810: wenzelm@16540: val syntax_of = #syntax o rep_context; wenzelm@33387: val syn_of = Local_Syntax.syn_of o syntax_of; wenzelm@33387: val set_syntax_mode = map_syntax o Local_Syntax.set_mode; wenzelm@33387: val restore_syntax_mode = map_syntax o Local_Syntax.restore_mode o syntax_of; wenzelm@19001: wenzelm@36450: val tsig_of = #1 o #tsig o rep_context; wenzelm@36451: val set_defsort = map_tsig o apfst o Type.set_defsort; wenzelm@35680: fun default_sort ctxt = the_default (Type.defaultS (tsig_of ctxt)) o Variable.def_sort ctxt; wenzelm@35676: wenzelm@25052: val consts_of = #1 o #consts o rep_context; haftmann@24752: val the_const_constraint = Consts.the_constraint o consts_of; wenzelm@10810: wenzelm@26284: val facts_of = #facts o rep_context; wenzelm@16540: val cases_of = #cases o rep_context; wenzelm@10810: wenzelm@10810: wenzelm@20367: (* theory transfer *) wenzelm@10810: wenzelm@35676: fun transfer_syntax thy ctxt = ctxt |> wenzelm@35676: map_syntax (Local_Syntax.rebuild thy) |> wenzelm@36450: map_tsig (fn tsig as (local_tsig, global_tsig) => wenzelm@35676: let val thy_tsig = Sign.tsig_of thy in wenzelm@36450: if Type.eq_tsig (thy_tsig, global_tsig) then tsig wenzelm@36450: else (Type.merge_tsig (Syntax.pp ctxt) (local_tsig, thy_tsig), thy_tsig) wenzelm@35676: end) |> wenzelm@30425: map_consts (fn consts as (local_consts, global_consts) => wenzelm@30425: let val thy_consts = Sign.consts_of thy in wenzelm@30425: if Consts.eq_consts (thy_consts, global_consts) then consts wenzelm@30425: else (Consts.merge (local_consts, thy_consts), thy_consts) wenzelm@30425: end); wenzelm@12093: wenzelm@33031: fun transfer thy = Context.raw_transfer thy #> transfer_syntax thy; wenzelm@17072: wenzelm@20367: fun theory f ctxt = transfer (f (theory_of ctxt)) ctxt; wenzelm@20367: wenzelm@20367: fun theory_result f ctxt = wenzelm@20367: let val (res, thy') = f (theory_of ctxt) wenzelm@20367: in (res, ctxt |> transfer thy') end; wenzelm@19019: wenzelm@12093: wenzelm@12093: wenzelm@14828: (** pretty printing **) wenzelm@14828: wenzelm@28212: (* extern *) wenzelm@28212: wenzelm@28212: fun extern_fact ctxt name = wenzelm@28212: let wenzelm@28212: val local_facts = facts_of ctxt; wenzelm@28212: val global_facts = PureThy.facts_of (theory_of ctxt); wenzelm@28212: in wenzelm@28212: if is_some (Facts.lookup (Context.Proof ctxt) local_facts name) wenzelm@28212: then Facts.extern local_facts name wenzelm@28212: else Facts.extern global_facts name wenzelm@28212: end; wenzelm@28212: wenzelm@28212: wenzelm@28212: (* pretty *) wenzelm@28212: wenzelm@24922: fun pretty_term_abbrev ctxt = Syntax.pretty_term (set_mode mode_abbrev ctxt); wenzelm@14828: wenzelm@28212: fun pretty_fact_name ctxt a = Pretty.block wenzelm@28212: [Pretty.markup (Markup.fact a) [Pretty.str (extern_fact ctxt a)], Pretty.str ":"]; wenzelm@28209: wenzelm@32110: fun pretty_fact_aux ctxt flag ("", ths) = wenzelm@32110: Display.pretty_thms_aux ctxt flag ths wenzelm@30726: | pretty_fact_aux ctxt flag (a, [th]) = Pretty.block wenzelm@32110: [pretty_fact_name ctxt a, Pretty.brk 1, Display.pretty_thm_aux ctxt flag th] wenzelm@30726: | pretty_fact_aux ctxt flag (a, ths) = Pretty.block wenzelm@32110: (Pretty.fbreaks (pretty_fact_name ctxt a :: map (Display.pretty_thm_aux ctxt flag) ths)); wenzelm@30726: wenzelm@30726: fun pretty_fact ctxt = pretty_fact_aux ctxt true; wenzelm@14828: wenzelm@14828: wenzelm@14828: wenzelm@10810: (** prepare types **) wenzelm@10810: wenzelm@35676: (* classes *) wenzelm@35676: wenzelm@35676: fun read_class ctxt text = wenzelm@35676: let wenzelm@35676: val tsig = tsig_of ctxt; wenzelm@35676: val (syms, pos) = Syntax.read_token text; wenzelm@35676: val c = Type.cert_class tsig (Type.intern_class tsig (Symbol_Pos.content syms)) wenzelm@35676: handle TYPE (msg, _, _) => error (msg ^ Position.str_of pos); wenzelm@35676: val _ = Position.report (Markup.tclass c) pos; wenzelm@35676: in c end; wenzelm@35676: wenzelm@35676: wenzelm@35676: (* type arities *) wenzelm@35676: wenzelm@35676: local wenzelm@35676: wenzelm@35676: fun prep_arity prep_tycon prep_sort ctxt (t, Ss, S) = wenzelm@35676: let val arity = (prep_tycon ctxt t, map (prep_sort ctxt) Ss, prep_sort ctxt S) wenzelm@35676: in Type.add_arity (Syntax.pp ctxt) arity (tsig_of ctxt); arity end; wenzelm@35676: wenzelm@35676: in wenzelm@35676: wenzelm@35676: val read_arity = prep_arity (Type.intern_type o tsig_of) Syntax.read_sort; wenzelm@35676: val cert_arity = prep_arity (K I) (Type.cert_sort o tsig_of); wenzelm@35676: wenzelm@35676: end; wenzelm@35676: wenzelm@35676: wenzelm@35676: (* types *) wenzelm@24277: wenzelm@24277: fun read_typ_mode mode ctxt s = wenzelm@24486: Syntax.read_typ (Type.set_mode mode ctxt) s; wenzelm@24277: wenzelm@35676: val read_typ = read_typ_mode Type.mode_default; wenzelm@24277: val read_typ_syntax = read_typ_mode Type.mode_syntax; wenzelm@24277: val read_typ_abbrev = read_typ_mode Type.mode_abbrev; wenzelm@24277: wenzelm@24277: wenzelm@24277: fun cert_typ_mode mode ctxt T = wenzelm@35676: Type.cert_typ_mode mode (tsig_of ctxt) T wenzelm@24277: handle TYPE (msg, _, _) => error msg; wenzelm@24277: wenzelm@35676: val cert_typ = cert_typ_mode Type.mode_default; wenzelm@24277: val cert_typ_syntax = cert_typ_mode Type.mode_syntax; wenzelm@24277: val cert_typ_abbrev = cert_typ_mode Type.mode_abbrev; wenzelm@24277: wenzelm@24277: wenzelm@24388: wenzelm@24388: (** prepare variables **) wenzelm@24388: wenzelm@10810: (* internalize Skolem constants *) wenzelm@10810: wenzelm@19897: val lookup_skolem = AList.lookup (op =) o Variable.fixes_of; wenzelm@18187: fun get_skolem ctxt x = the_default x (lookup_skolem ctxt x); wenzelm@10810: wenzelm@18678: fun no_skolem internal x = wenzelm@20086: if can Name.dest_skolem x then wenzelm@18678: error ("Illegal reference to internal Skolem constant: " ^ quote x) wenzelm@20086: else if not internal andalso can Name.dest_internal x then wenzelm@18678: error ("Illegal reference to internal variable: " ^ quote x) wenzelm@10810: else x; wenzelm@10810: wenzelm@10810: wenzelm@26717: (* revert Skolem constants -- if possible *) wenzelm@18187: wenzelm@26717: fun revert_skolem ctxt x = wenzelm@26717: (case find_first (fn (_, y) => y = x) (Variable.fixes_of ctxt) of wenzelm@26717: SOME (x', _) => if lookup_skolem ctxt x' = SOME x then x' else x wenzelm@26717: | NONE => x); wenzelm@10810: wenzelm@10810: wenzelm@26705: (* default token translations *) wenzelm@26705: wenzelm@26705: local wenzelm@26705: wenzelm@26717: fun free_or_skolem ctxt x = wenzelm@26717: (if can Name.dest_skolem x then Pretty.mark Markup.skolem (Pretty.str (revert_skolem ctxt x)) wenzelm@26717: else Pretty.mark Markup.free (Pretty.str x)) wenzelm@26930: |> Pretty.mark wenzelm@26939: (if Variable.is_fixed ctxt x orelse Syntax.is_pretty_global ctxt then Markup.fixed x wenzelm@26930: else Markup.hilite); wenzelm@26705: wenzelm@26705: fun var_or_skolem _ s = wenzelm@26705: (case Lexicon.read_variable s of wenzelm@26705: SOME (x, i) => wenzelm@26705: (case try Name.dest_skolem x of wenzelm@26705: NONE => Pretty.mark Markup.var (Pretty.str s) wenzelm@26705: | SOME x' => Pretty.mark Markup.skolem wenzelm@32966: (Pretty.str (setmp_CRITICAL show_question_marks true Term.string_of_vname (x', i)))) wenzelm@26705: | NONE => Pretty.mark Markup.var (Pretty.str s)); wenzelm@26705: wenzelm@26705: fun plain_markup m _ s = Pretty.mark m (Pretty.str s); wenzelm@26705: wenzelm@26705: val token_trans = wenzelm@26705: Syntax.tokentrans_mode "" wenzelm@35539: [("tfree", plain_markup Markup.tfree), wenzelm@26705: ("tvar", plain_markup Markup.tvar), wenzelm@26705: ("free", free_or_skolem), wenzelm@26705: ("bound", plain_markup Markup.bound), wenzelm@26705: ("var", var_or_skolem), wenzelm@29319: ("numeral", plain_markup Markup.numeral), wenzelm@29319: ("inner_string", plain_markup Markup.inner_string)]; wenzelm@26705: wenzelm@26705: in val _ = Context.>> (Context.map_theory (Sign.add_tokentrfuns token_trans)) end; wenzelm@26705: wenzelm@26705: wenzelm@18187: wenzelm@10810: (** prepare terms and propositions **) wenzelm@10810: wenzelm@25328: (* inferred types of parameters *) wenzelm@25328: wenzelm@25328: fun infer_type ctxt x = wenzelm@36521: Term.fastype_of (singleton (Syntax.check_terms (set_mode mode_schematic ctxt)) (Free x)); wenzelm@25328: wenzelm@25328: fun inferred_param x ctxt = wenzelm@36521: let val T = infer_type ctxt (x, dummyT) wenzelm@28082: in (T, ctxt |> Variable.declare_term (Free (x, T))) end; wenzelm@25328: wenzelm@25328: fun inferred_fixes ctxt = wenzelm@28082: let wenzelm@28082: val xs = rev (map #2 (Variable.fixes_of ctxt)); wenzelm@28082: val (Ts, ctxt') = fold_map inferred_param xs ctxt; wenzelm@28082: in (xs ~~ Ts, ctxt') end; wenzelm@25328: wenzelm@25328: wenzelm@25328: (* type and constant names *) wenzelm@25328: wenzelm@27821: local wenzelm@25328: wenzelm@30576: val token_content = Syntax.read_token #>> Symbol_Pos.content; wenzelm@25328: wenzelm@35399: fun prep_const_proper ctxt strict (c, pos) = wenzelm@35399: let wenzelm@35399: fun err msg = error (msg ^ Position.str_of pos); wenzelm@35399: val consts = consts_of ctxt; wenzelm@35399: val t as Const (d, _) = wenzelm@35399: (case Variable.lookup_const ctxt c of wenzelm@35399: SOME d => wenzelm@35399: Const (d, Consts.type_scheme (consts_of ctxt) d handle TYPE (msg, _, _) => err msg) wenzelm@35399: | NONE => Consts.read_const consts c); wenzelm@35399: val _ = wenzelm@35399: if strict then ignore (Consts.the_type consts d) handle TYPE (msg, _, _) => err msg wenzelm@35399: else (); wenzelm@35399: val _ = Position.report (Markup.const d) pos; wenzelm@35399: in t end; wenzelm@27821: wenzelm@27821: in wenzelm@27821: wenzelm@35399: fun read_type_name ctxt strict text = wenzelm@27821: let wenzelm@35676: val tsig = tsig_of ctxt; wenzelm@35399: val (c, pos) = token_content text; wenzelm@27821: in wenzelm@27821: if Syntax.is_tid c then wenzelm@28411: (Position.report Markup.tfree pos; wenzelm@35680: TFree (c, default_sort ctxt (c, ~1))) wenzelm@27821: else wenzelm@27821: let wenzelm@35676: val d = Type.intern_type tsig c; wenzelm@35676: val decl = Type.the_decl tsig d; wenzelm@28411: val _ = Position.report (Markup.tycon d) pos; wenzelm@35360: fun err () = error ("Bad type name: " ^ quote d); wenzelm@35360: val args = wenzelm@35360: (case decl of wenzelm@35360: Type.LogicalType n => n wenzelm@35360: | Type.Abbreviation (vs, _, _) => if strict then err () else length vs wenzelm@35360: | Type.Nonterminal => if strict then err () else 0); wenzelm@35360: in Type (d, replicate args dummyT) end wenzelm@27821: end; wenzelm@27821: wenzelm@35676: fun read_type_name_proper ctxt strict text = wenzelm@35676: (case read_type_name ctxt strict text of wenzelm@35676: T as Type _ => T wenzelm@35676: | T => error ("Not a type constructor: " ^ Syntax.string_of_typ ctxt T)); wenzelm@35676: wenzelm@35676: wenzelm@35399: fun read_const_proper ctxt strict = prep_const_proper ctxt strict o token_content; wenzelm@27821: wenzelm@36521: fun read_const ctxt strict ty text = wenzelm@35399: let val (c, pos) = token_content text in wenzelm@27821: (case (lookup_skolem ctxt c, Variable.is_const ctxt c) of wenzelm@27821: (SOME x, false) => wenzelm@28411: (Position.report (Markup.name x wenzelm@27821: (if can Name.dest_skolem x then Markup.skolem else Markup.free)) pos; wenzelm@36521: Free (x, infer_type ctxt (x, ty))) wenzelm@35399: | _ => prep_const_proper ctxt strict (c, pos)) wenzelm@27821: end; wenzelm@27821: wenzelm@27821: end; wenzelm@25328: wenzelm@25328: wenzelm@24684: (* read_term *) wenzelm@24684: wenzelm@24684: fun read_term_mode mode ctxt = Syntax.read_term (set_mode mode ctxt); wenzelm@24684: wenzelm@24684: val read_term_pattern = read_term_mode mode_pattern; wenzelm@24684: val read_term_schematic = read_term_mode mode_schematic; wenzelm@24684: val read_term_abbrev = read_term_mode mode_abbrev; wenzelm@24684: wenzelm@24684: wenzelm@19001: (* local abbreviations *) wenzelm@10810: wenzelm@24501: local wenzelm@24501: haftmann@26731: fun certify_consts ctxt = Consts.certify (Syntax.pp ctxt) (tsig_of ctxt) wenzelm@27286: (not (abbrev_mode ctxt)) (consts_of ctxt); wenzelm@19001: wenzelm@19897: fun reject_schematic (Var (xi, _)) = wenzelm@22678: error ("Unbound schematic variable: " ^ Term.string_of_vname xi) wenzelm@19897: | reject_schematic (Abs (_, _, t)) = reject_schematic t wenzelm@19897: | reject_schematic (t $ u) = (reject_schematic t; reject_schematic u) wenzelm@19897: | reject_schematic _ = (); wenzelm@19897: wenzelm@24495: fun expand_binds ctxt = wenzelm@24495: let val Mode {pattern, schematic, ...} = get_mode ctxt in wenzelm@24495: if pattern then I wenzelm@24495: else Variable.expand_binds ctxt #> (if schematic then I else tap reject_schematic) wenzelm@24495: end; wenzelm@10810: wenzelm@24501: in wenzelm@24501: wenzelm@24501: fun expand_abbrevs ctxt = certify_consts ctxt #> expand_binds ctxt; wenzelm@24501: wenzelm@24501: end; wenzelm@24501: wenzelm@10810: wenzelm@24922: fun contract_abbrevs ctxt t = wenzelm@24922: let wenzelm@24922: val thy = theory_of ctxt; wenzelm@24922: val consts = consts_of ctxt; wenzelm@24922: val Mode {abbrev, ...} = get_mode ctxt; wenzelm@30566: val retrieve = Consts.retrieve_abbrevs consts (print_mode_value () @ [""]); wenzelm@30566: fun match_abbrev u = Option.map #1 (get_first (Pattern.match_rew thy u) (retrieve u)); wenzelm@24922: in wenzelm@25052: if abbrev orelse print_mode_active "no_abbrevs" orelse not (can Term.type_of t) then t berghofe@35203: else Pattern.rewrite_term_top thy [] [match_abbrev] t wenzelm@24922: end; wenzelm@24922: wenzelm@24922: wenzelm@24518: (* patterns *) wenzelm@24518: wenzelm@32003: fun prepare_patternT ctxt T = wenzelm@32003: let wenzelm@32003: val Mode {pattern, schematic, ...} = get_mode ctxt; wenzelm@32003: val _ = wenzelm@32003: pattern orelse schematic orelse wenzelm@32003: T |> Term.exists_subtype wenzelm@32003: (fn TVar (xi, _) => wenzelm@32003: not (TypeInfer.is_param xi) andalso wenzelm@32003: error ("Illegal schematic type variable: " ^ Term.string_of_vname xi) wenzelm@32003: | _ => false) wenzelm@32003: in T end; wenzelm@24518: wenzelm@22712: wenzelm@24505: local wenzelm@10810: wenzelm@33519: structure Allow_Dummies = Proof_Data(type T = bool fun init _ = false); wenzelm@27259: wenzelm@27259: fun check_dummies ctxt t = wenzelm@30765: if Allow_Dummies.get ctxt then t wenzelm@27259: else Term.no_dummy_patterns t handle TERM _ => error "Illegal dummy pattern(s) in term"; wenzelm@27259: wenzelm@24767: fun prepare_dummies ts = #1 (fold_map Term.replace_dummy_patterns ts 1); wenzelm@10810: wenzelm@27259: in wenzelm@10810: wenzelm@30765: val allow_dummies = Allow_Dummies.put true; wenzelm@24505: wenzelm@24684: fun prepare_patterns ctxt = wenzelm@24518: let val Mode {pattern, ...} = get_mode ctxt in wenzelm@24767: TypeInfer.fixate_params (Variable.names_of ctxt) #> wenzelm@24767: pattern ? Variable.polymorphic ctxt #> wenzelm@24684: (map o Term.map_types) (prepare_patternT ctxt) #> wenzelm@27259: (if pattern then prepare_dummies else map (check_dummies ctxt)) wenzelm@24505: end; wenzelm@24505: wenzelm@24505: end; wenzelm@24505: wenzelm@10810: wenzelm@22763: (* decoding raw terms (syntax trees) *) wenzelm@22763: wenzelm@27286: (* types *) wenzelm@27286: wenzelm@36448: fun get_sort ctxt raw_text = wenzelm@27286: let wenzelm@35676: val tsig = tsig_of ctxt; wenzelm@27286: wenzelm@36448: val text = distinct (op =) (map (apsnd (Type.minimize_sort tsig)) raw_text); wenzelm@36153: val _ = wenzelm@36448: (case duplicates (eq_fst (op =)) text of wenzelm@36153: [] => () wenzelm@27286: | dups => error ("Inconsistent sort constraints for type variable(s) " wenzelm@27286: ^ commas_quote (map (Term.string_of_vname' o fst) dups))); wenzelm@27286: wenzelm@36153: fun lookup xi = wenzelm@36448: (case AList.lookup (op =) text xi of wenzelm@36153: NONE => NONE wenzelm@36153: | SOME S => if S = dummyS then NONE else SOME S); wenzelm@36153: wenzelm@27286: fun get xi = wenzelm@36153: (case (lookup xi, Variable.def_sort ctxt xi) of wenzelm@27286: (NONE, NONE) => Type.defaultS tsig wenzelm@27286: | (NONE, SOME S) => S wenzelm@27286: | (SOME S, NONE) => S wenzelm@27286: | (SOME S, SOME S') => wenzelm@27286: if Type.eq_sort tsig (S, S') then S' wenzelm@35676: else error ("Sort constraint " ^ Syntax.string_of_sort ctxt S ^ wenzelm@35676: " inconsistent with default " ^ Syntax.string_of_sort ctxt S' ^ wenzelm@30817: " for type variable " ^ quote (Term.string_of_vname' xi))); wenzelm@36448: in get end; wenzelm@27286: wenzelm@36153: fun check_tvar ctxt (xi, S) = (xi, get_sort ctxt [(xi, S)] xi); wenzelm@36153: fun check_tfree ctxt (x, S) = apfst fst (check_tvar ctxt ((x, ~1), S)); wenzelm@36153: wenzelm@25353: local wenzelm@25353: wenzelm@25353: fun intern_skolem ctxt def_type x = wenzelm@22763: let wenzelm@25353: val _ = no_skolem false x; wenzelm@22763: val sko = lookup_skolem ctxt x; wenzelm@35399: val is_const = can (read_const_proper ctxt false) x orelse Long_Name.is_qualified x; wenzelm@22763: val is_declared = is_some (def_type (x, ~1)); wenzelm@25319: in wenzelm@25353: if Variable.is_const ctxt x then NONE wenzelm@25353: else if is_some sko then sko wenzelm@25353: else if not is_const orelse is_declared then SOME x wenzelm@25353: else NONE wenzelm@25319: end; wenzelm@22763: wenzelm@25353: in wenzelm@25353: wenzelm@24371: fun term_context ctxt = wenzelm@36153: {get_sort = get_sort ctxt, wenzelm@35676: map_const = fn a => ((true, #1 (Term.dest_Const (read_const_proper ctxt false a))) wenzelm@35676: handle ERROR _ => (false, Consts.intern (consts_of ctxt) a)), wenzelm@35676: map_free = intern_skolem ctxt (Variable.def_type ctxt false)}; wenzelm@24371: wenzelm@22763: fun decode_term ctxt = wenzelm@35539: let val {get_sort, map_const, map_free} = term_context ctxt wenzelm@35539: in Syntax.decode_term get_sort map_const map_free end; wenzelm@22763: wenzelm@10810: end; wenzelm@10810: wenzelm@10810: wenzelm@10810: (* certify terms *) wenzelm@10810: wenzelm@10810: local wenzelm@10810: wenzelm@24684: fun gen_cert prop ctxt t = wenzelm@24684: t wenzelm@24684: |> expand_abbrevs ctxt wenzelm@24961: |> (fn t' => #1 (Sign.certify' prop (Syntax.pp ctxt) false (consts_of ctxt) (theory_of ctxt) t') wenzelm@24684: handle TYPE (msg, _, _) => error msg wenzelm@24684: | TERM (msg, _) => error msg); wenzelm@16501: wenzelm@10810: in wenzelm@10810: wenzelm@24684: val cert_term = gen_cert false; wenzelm@24684: val cert_prop = gen_cert true; wenzelm@10810: wenzelm@10810: end; wenzelm@10810: wenzelm@10810: wenzelm@24495: (* type checking/inference *) wenzelm@22701: wenzelm@35616: fun def_type ctxt = wenzelm@35616: let val Mode {pattern, ...} = get_mode ctxt wenzelm@35616: in Variable.def_type ctxt pattern end; wenzelm@35616: wenzelm@24495: fun standard_infer_types ctxt ts = wenzelm@35616: TypeInfer.infer_types (Syntax.pp ctxt) (tsig_of ctxt) (Syntax.check_typs ctxt) wenzelm@35616: (try (Consts.the_constraint (consts_of ctxt))) (def_type ctxt) wenzelm@35616: (Variable.names_of ctxt) (Variable.maxidx_of ctxt) ts wenzelm@35616: handle TYPE (msg, _, _) => error msg; wenzelm@22701: wenzelm@25406: local wenzelm@25406: wenzelm@24518: fun standard_typ_check ctxt = wenzelm@24518: map (cert_typ_mode (Type.get_mode ctxt) ctxt) #> wenzelm@24518: map (prepare_patternT ctxt); wenzelm@24518: wenzelm@24769: fun standard_term_check ctxt = wenzelm@24769: standard_infer_types ctxt #> wenzelm@24769: map (expand_abbrevs ctxt); wenzelm@24922: wenzelm@24922: fun standard_term_uncheck ctxt = wenzelm@24922: map (contract_abbrevs ctxt); wenzelm@24922: wenzelm@26463: fun add eq what f = Context.>> (what (fn xs => fn ctxt => wenzelm@26463: let val xs' = f ctxt xs in if eq_list eq (xs, xs') then NONE else SOME (xs', ctxt) end)); wenzelm@24767: wenzelm@24518: in wenzelm@24518: wenzelm@25060: val _ = add (op =) (Syntax.add_typ_check 0 "standard") standard_typ_check; wenzelm@25060: val _ = add (op aconv) (Syntax.add_term_check 0 "standard") standard_term_check; wenzelm@25060: val _ = add (op aconv) (Syntax.add_term_check 100 "fixate") prepare_patterns; wenzelm@24922: wenzelm@25060: val _ = add (op aconv) (Syntax.add_term_uncheck 0 "standard") standard_term_uncheck; wenzelm@22701: wenzelm@24518: end; wenzelm@22701: wenzelm@22701: wenzelm@10810: wenzelm@24767: (** inner syntax operations **) wenzelm@24371: wenzelm@24371: local wenzelm@24371: wenzelm@27754: fun parse_sort ctxt text = wenzelm@27754: let wenzelm@28411: val (syms, pos) = Syntax.parse_token Markup.sort text; wenzelm@35539: val S = Syntax.standard_parse_sort ctxt (syn_of ctxt) (syms, pos) wenzelm@36519: handle ERROR msg => cat_error msg ("Failed to parse sort" ^ Position.str_of pos) wenzelm@36448: in Type.minimize_sort (tsig_of ctxt) S end; wenzelm@27754: wenzelm@27754: fun parse_typ ctxt text = wenzelm@24371: let wenzelm@28411: val (syms, pos) = Syntax.parse_token Markup.typ text; wenzelm@36153: val T = Syntax.standard_parse_typ ctxt (syn_of ctxt) (get_sort ctxt) (syms, pos) wenzelm@35539: handle ERROR msg => cat_error msg ("Failed to parse type" ^ Position.str_of pos); wenzelm@27754: in T end; wenzelm@24371: wenzelm@27754: fun parse_term T ctxt text = wenzelm@24371: let wenzelm@35539: val {get_sort, map_const, map_free} = term_context ctxt; wenzelm@27754: wenzelm@25168: val (T', _) = TypeInfer.paramify_dummies T 0; wenzelm@27821: val (markup, kind) = if T' = propT then (Markup.prop, "proposition") else (Markup.term, "term"); wenzelm@28411: val (syms, pos) = Syntax.parse_token markup text; wenzelm@27754: wenzelm@25476: fun check t = (Syntax.check_term ctxt (TypeInfer.constrain T' t); NONE) wenzelm@25476: handle ERROR msg => SOME msg; wenzelm@35539: val t = wenzelm@35539: Syntax.standard_parse_term (Syntax.pp ctxt) check get_sort map_const map_free wenzelm@35676: ctxt (Type.is_logtype (tsig_of ctxt)) (syn_of ctxt) T' (syms, pos) wenzelm@35680: handle ERROR msg => cat_error msg ("Failed to parse " ^ kind ^ Position.str_of pos); wenzelm@27754: in t end; wenzelm@24371: wenzelm@24922: wenzelm@35539: fun unparse_sort ctxt = wenzelm@35676: Syntax.standard_unparse_sort {extern_class = Type.extern_class (tsig_of ctxt)} wenzelm@35539: ctxt (syn_of ctxt); wenzelm@24922: wenzelm@35539: fun unparse_typ ctxt = wenzelm@35539: let wenzelm@35676: val tsig = tsig_of ctxt; wenzelm@35676: val extern = {extern_class = Type.extern_class tsig, extern_type = Type.extern_type tsig}; wenzelm@35539: in Syntax.standard_unparse_typ extern ctxt (syn_of ctxt) end; wenzelm@24922: wenzelm@35539: fun unparse_term ctxt = wenzelm@24922: let wenzelm@35676: val tsig = tsig_of ctxt; wenzelm@24922: val syntax = syntax_of ctxt; wenzelm@24922: val consts = consts_of ctxt; wenzelm@35539: val extern = wenzelm@35676: {extern_class = Type.extern_class tsig, wenzelm@35676: extern_type = Type.extern_type tsig, wenzelm@35539: extern_const = Consts.extern consts}; wenzelm@24922: in wenzelm@35539: Syntax.standard_unparse_term (Local_Syntax.idents_of syntax) extern ctxt wenzelm@35676: (Local_Syntax.syn_of syntax) (not (PureThy.old_appl_syntax (theory_of ctxt))) wenzelm@24922: end; wenzelm@24922: wenzelm@24371: in wenzelm@24371: wenzelm@24767: val _ = Syntax.install_operations wenzelm@24767: {parse_sort = parse_sort, wenzelm@24767: parse_typ = parse_typ, wenzelm@24767: parse_term = parse_term dummyT, wenzelm@24767: parse_prop = parse_term propT, wenzelm@24922: unparse_sort = unparse_sort, wenzelm@24922: unparse_typ = unparse_typ, wenzelm@24922: unparse_term = unparse_term}; wenzelm@24371: wenzelm@24371: end; wenzelm@24371: wenzelm@24371: wenzelm@24371: wenzelm@21610: (** export results **) wenzelm@21531: wenzelm@20310: fun common_export is_goal inner outer = wenzelm@20310: map (Assumption.export is_goal inner outer) #> wenzelm@20310: Variable.export inner outer; wenzelm@10810: wenzelm@20310: val goal_export = common_export true; wenzelm@20310: val export = common_export false; wenzelm@12704: wenzelm@21531: fun export_morphism inner outer = wenzelm@21531: Assumption.export_morphism inner outer $> wenzelm@21531: Variable.export_morphism inner outer; wenzelm@21531: wenzelm@28396: fun norm_export_morphism inner outer = wenzelm@28396: export_morphism inner outer $> wenzelm@28396: Morphism.thm_morphism Goal.norm_result; wenzelm@28396: wenzelm@21531: wenzelm@15758: wenzelm@30764: (** term bindings **) wenzelm@10810: wenzelm@10810: (* simult_matches *) wenzelm@10810: wenzelm@19867: fun simult_matches ctxt (t, pats) = wenzelm@19867: (case Seq.pull (Unify.matchers (theory_of ctxt) (map (rpair t) pats)) of wenzelm@19867: NONE => error "Pattern match failed!" wenzelm@32043: | SOME (env, _) => Vartab.fold (fn (v, (_, t)) => cons (v, t)) (Envir.term_env env) []); wenzelm@10810: wenzelm@10810: wenzelm@30764: (* bind_terms *) wenzelm@10810: wenzelm@30764: val bind_terms = fold (fn (xi, t) => fn ctxt => wenzelm@30764: ctxt wenzelm@30764: |> Variable.bind_term (xi, Option.map (cert_term (set_mode mode_default ctxt)) t)); wenzelm@10810: wenzelm@10810: wenzelm@30764: (* auto_bind *) wenzelm@10810: wenzelm@20330: fun drop_schematic (b as (xi, SOME t)) = if Term.exists_subterm is_Var t then (xi, NONE) else b wenzelm@10810: | drop_schematic b = b; wenzelm@10810: wenzelm@30764: fun auto_bind f ts ctxt = ctxt |> bind_terms (map drop_schematic (f (theory_of ctxt) ts)); wenzelm@10810: wenzelm@33386: val auto_bind_goal = auto_bind Auto_Bind.goal; wenzelm@33386: val auto_bind_facts = auto_bind Auto_Bind.facts; wenzelm@10810: wenzelm@10810: wenzelm@10810: (* match_bind(_i) *) wenzelm@10810: wenzelm@10810: local wenzelm@10810: wenzelm@24684: fun gen_bind prep_terms gen raw_binds ctxt = wenzelm@10810: let wenzelm@24684: fun prep_bind (raw_pats, t) ctxt1 = wenzelm@24684: let wenzelm@24684: val T = Term.fastype_of t; wenzelm@24684: val ctxt2 = Variable.declare_term t ctxt1; wenzelm@24684: val pats = prep_terms (set_mode mode_pattern ctxt2) T raw_pats; wenzelm@24684: val binds = simult_matches ctxt2 (t, pats); wenzelm@24684: in (binds, ctxt2) end; wenzelm@10810: wenzelm@24686: val ts = prep_terms ctxt dummyT (map snd raw_binds); wenzelm@24686: val (binds, ctxt') = apfst flat (fold_map prep_bind (map fst raw_binds ~~ ts) ctxt); wenzelm@10810: val binds' = wenzelm@19916: if gen then map #1 binds ~~ Variable.exportT_terms ctxt' ctxt (map #2 binds) wenzelm@10810: else binds; skalberg@15531: val binds'' = map (apsnd SOME) binds'; wenzelm@18310: val ctxt'' = wenzelm@19897: tap (Variable.warn_extra_tfrees ctxt) wenzelm@18310: (if gen then wenzelm@30764: ctxt (*sic!*) |> fold Variable.declare_term (map #2 binds') |> bind_terms binds'' wenzelm@30764: else ctxt' |> bind_terms binds''); wenzelm@18310: in (ts, ctxt'') end; wenzelm@10810: wenzelm@10810: in wenzelm@10810: wenzelm@24684: fun read_terms ctxt T = wenzelm@24684: map (Syntax.parse_term ctxt #> TypeInfer.constrain T) #> Syntax.check_terms ctxt; wenzelm@24684: wenzelm@24684: val match_bind = gen_bind read_terms; wenzelm@24684: val match_bind_i = gen_bind (fn ctxt => fn _ => map (cert_term ctxt)); wenzelm@10810: wenzelm@10810: end; wenzelm@10810: wenzelm@10810: wenzelm@10810: (* propositions with patterns *) wenzelm@10810: wenzelm@10810: local wenzelm@10810: wenzelm@24684: fun prep_propp mode prep_props (context, args) = wenzelm@10810: let wenzelm@19585: fun prep (_, raw_pats) (ctxt, prop :: props) = wenzelm@24684: let val ctxt' = Variable.declare_term prop ctxt wenzelm@24684: in ((prop, prep_props (set_mode mode_pattern ctxt') raw_pats), (ctxt', props)) end; wenzelm@24684: wenzelm@17860: val (propp, (context', _)) = (fold_map o fold_map) prep args wenzelm@24684: (context, prep_props (set_mode mode context) (maps (map fst) args)); wenzelm@10810: in (context', propp) end; wenzelm@10810: wenzelm@24684: fun gen_bind_propp mode parse_prop (ctxt, raw_args) = wenzelm@10810: let wenzelm@24684: val (ctxt', args) = prep_propp mode parse_prop (ctxt, raw_args); wenzelm@19585: val binds = flat (flat (map (map (simult_matches ctxt')) args)); wenzelm@10810: val propss = map (map #1) args; wenzelm@10810: wenzelm@10810: (*generalize result: context evaluated now, binds added later*) wenzelm@19916: val gen = Variable.exportT_terms ctxt' ctxt; wenzelm@30764: fun gen_binds c = c |> bind_terms (map #1 binds ~~ map SOME (gen (map #2 binds))); wenzelm@30764: in (ctxt' |> bind_terms (map (apsnd SOME) binds), (propss, gen_binds)) end; wenzelm@10810: wenzelm@10810: in wenzelm@10810: wenzelm@24684: val read_propp = prep_propp mode_default Syntax.read_props; wenzelm@24684: val cert_propp = prep_propp mode_default (map o cert_prop); wenzelm@24684: val read_propp_schematic = prep_propp mode_schematic Syntax.read_props; wenzelm@24684: val cert_propp_schematic = prep_propp mode_schematic (map o cert_prop); wenzelm@10810: wenzelm@24684: val bind_propp = gen_bind_propp mode_default Syntax.read_props; wenzelm@24684: val bind_propp_i = gen_bind_propp mode_default (map o cert_prop); wenzelm@24684: val bind_propp_schematic = gen_bind_propp mode_schematic Syntax.read_props; wenzelm@24684: val bind_propp_schematic_i = gen_bind_propp mode_schematic (map o cert_prop); wenzelm@10810: wenzelm@10810: end; wenzelm@10810: wenzelm@10810: wenzelm@10810: wenzelm@10810: (** theorems **) wenzelm@10810: wenzelm@18042: (* fact_tac *) wenzelm@18042: wenzelm@27867: fun comp_incr_tac [] _ = no_tac wenzelm@27867: | comp_incr_tac (th :: ths) i = wenzelm@27867: (fn st => Goal.compose_hhf_tac (Drule.incr_indexes st th) i st) APPEND comp_incr_tac ths i; wenzelm@18042: wenzelm@21687: fun fact_tac facts = Goal.norm_hhf_tac THEN' comp_incr_tac facts; wenzelm@18122: wenzelm@27867: fun potential_facts ctxt prop = wenzelm@27867: Facts.could_unify (facts_of ctxt) (Term.strip_all_body prop); wenzelm@27867: wenzelm@27867: fun some_fact_tac ctxt = SUBGOAL (fn (goal, i) => fact_tac (potential_facts ctxt goal) i); wenzelm@18042: wenzelm@18042: wenzelm@10810: (* get_thm(s) *) wenzelm@10810: wenzelm@26361: local wenzelm@26361: wenzelm@26687: fun retrieve_thms pick ctxt (Facts.Fact s) = wenzelm@16501: let wenzelm@27867: val (_, pos) = Syntax.read_token s; wenzelm@24511: val prop = Syntax.read_prop (set_mode mode_default ctxt) s wenzelm@24511: |> singleton (Variable.polymorphic ctxt); wenzelm@27867: wenzelm@27867: fun prove_fact th = wenzelm@33700: Goal.prove ctxt [] [] prop (K (ALLGOALS (fact_tac [th]))); wenzelm@27867: val res = wenzelm@27867: (case get_first (try prove_fact) (potential_facts ctxt prop) of wenzelm@27867: SOME res => res wenzelm@27867: | NONE => error ("Failed to retrieve literal fact" ^ Position.str_of pos ^ ":\n" ^ wenzelm@27867: Syntax.string_of_term ctxt prop)) wenzelm@27867: in pick "" [res] end wenzelm@26687: | retrieve_thms pick ctxt xthmref = wenzelm@18042: let wenzelm@18042: val thy = theory_of ctxt; wenzelm@26284: val local_facts = facts_of ctxt; wenzelm@26673: val thmref = Facts.map_name_of_ref (Facts.intern local_facts) xthmref; wenzelm@26336: val name = Facts.name_of_ref thmref; wenzelm@27821: val pos = Facts.pos_of_ref xthmref; wenzelm@24012: val thms = wenzelm@24012: if name = "" then [Thm.transfer thy Drule.dummy_thm] wenzelm@24012: else wenzelm@26393: (case Facts.lookup (Context.Proof ctxt) local_facts name of wenzelm@28411: SOME (_, ths) => (Position.report (Markup.local_fact name) pos; wenzelm@27821: map (Thm.transfer thy) (Facts.select thmref ths)) wenzelm@26687: | NONE => PureThy.get_fact (Context.Proof ctxt) thy xthmref); wenzelm@24012: in pick name thms end; wenzelm@10810: wenzelm@26361: in wenzelm@26346: wenzelm@26687: val get_fact = retrieve_thms (K I); wenzelm@26687: val get_fact_single = retrieve_thms Facts.the_single; wenzelm@26346: wenzelm@26361: fun get_thms ctxt = get_fact ctxt o Facts.named; wenzelm@26361: fun get_thm ctxt = get_fact_single ctxt o Facts.named; wenzelm@26361: wenzelm@26361: end; wenzelm@10810: wenzelm@10810: wenzelm@26284: (* facts *) wenzelm@12309: wenzelm@28082: local wenzelm@28082: haftmann@28965: fun update_thms _ (b, NONE) ctxt = ctxt |> map_facts (Facts.del (full_name ctxt b)) haftmann@28861: | update_thms do_props (b, SOME ths) ctxt = ctxt |> map_facts haftmann@28864: (Facts.add_local do_props (naming_of ctxt) (b, ths) #> snd); wenzelm@10810: wenzelm@30768: in wenzelm@30768: wenzelm@30768: fun note_thmss kind = fold_map (fn ((b, more_attrs), raw_facts) => fn ctxt => wenzelm@28082: let haftmann@28939: val pos = Binding.pos_of b; haftmann@28965: val name = full_name ctxt b; wenzelm@33383: val _ = Context_Position.report_visible ctxt (Markup.local_fact_decl name) pos; wenzelm@10810: wenzelm@33700: val facts = PureThy.name_thmss false name raw_facts; wenzelm@21443: fun app (th, attrs) x = wenzelm@30768: swap (Library.foldl_map wenzelm@30768: (Thm.proof_attributes (surround (Thm.kind kind) (attrs @ more_attrs))) (x, th)); wenzelm@21443: val (res, ctxt') = fold_map app facts ctxt; wenzelm@33700: val thms = PureThy.name_thms false false name (flat res); wenzelm@24388: val Mode {stmt, ...} = get_mode ctxt; haftmann@28861: in ((name, thms), ctxt' |> update_thms stmt (b, SOME thms)) end); wenzelm@12711: wenzelm@28417: fun put_thms do_props thms ctxt = ctxt wenzelm@28417: |> map_naming (K local_naming) wenzelm@33383: |> Context_Position.set_visible false haftmann@28965: |> update_thms do_props (apfst Binding.name thms) wenzelm@33383: |> Context_Position.restore_visible ctxt wenzelm@28417: |> restore_naming ctxt; wenzelm@28082: wenzelm@12711: end; wenzelm@10810: wenzelm@10810: wenzelm@10810: wenzelm@35680: (** basic logical entities **) wenzelm@18187: wenzelm@18187: (* variables *) wenzelm@18187: wenzelm@19897: fun declare_var (x, opt_T, mx) ctxt = wenzelm@22701: let val T = (case opt_T of SOME T => T | NONE => Syntax.mixfixT mx) wenzelm@20163: in ((x, T, mx), ctxt |> Variable.declare_constraints (Free (x, T))) end; wenzelm@19897: wenzelm@18187: local wenzelm@18187: wenzelm@25353: fun prep_vars prep_typ internal = wenzelm@35129: fold_map (fn (b, raw_T, mx) => fn ctxt => wenzelm@18672: let wenzelm@35129: val x = Name.of_binding b; wenzelm@25353: val _ = Syntax.is_identifier (no_skolem internal x) orelse wenzelm@35129: error ("Illegal variable name: " ^ quote (Binding.str_of b)); wenzelm@18187: wenzelm@18672: fun cond_tvars T = wenzelm@18672: if internal then T wenzelm@18678: else Type.no_tvars T handle TYPE (msg, _, _) => error msg; wenzelm@24277: val opt_T = Option.map (cond_tvars o cert_typ ctxt o prep_typ ctxt) raw_T; wenzelm@35129: val (_, ctxt') = ctxt |> declare_var (x, opt_T, mx); wenzelm@35129: in ((b, opt_T, mx), ctxt') end); wenzelm@18187: wenzelm@18187: in wenzelm@18187: wenzelm@25353: val read_vars = prep_vars Syntax.parse_typ false; wenzelm@25353: val cert_vars = prep_vars (K I) true; wenzelm@18187: wenzelm@18187: end; wenzelm@18187: wenzelm@18187: wenzelm@35680: (* authentic syntax *) wenzelm@35676: wenzelm@35676: val _ = Context.>> wenzelm@35676: (Context.map_theory wenzelm@35676: (Sign.add_advanced_trfuns wenzelm@35676: (Syntax.type_ast_trs wenzelm@35676: {read_class = read_class, wenzelm@35676: read_type = fn ctxt => #1 o dest_Type o read_type_name_proper ctxt false}, [], [], []))); wenzelm@19663: wenzelm@25159: local wenzelm@25159: wenzelm@25159: fun const_ast_tr intern ctxt [Syntax.Variable c] = wenzelm@19681: let wenzelm@35399: val Const (c', _) = read_const_proper ctxt false c; wenzelm@35262: val d = if intern then Syntax.mark_const c' else c; wenzelm@25159: in Syntax.Constant d end wenzelm@25159: | const_ast_tr _ _ asts = raise Syntax.AST ("const_ast_tr", asts); wenzelm@25159: wenzelm@35539: val typ = Simple_Syntax.read_typ; wenzelm@35539: wenzelm@25159: in wenzelm@19681: wenzelm@26463: val _ = Context.>> (Context.map_theory wenzelm@35539: (Sign.add_syntax_i wenzelm@35539: [("_context_const", typ "id => logic", Delimfix "CONST _"), wenzelm@35539: ("_context_const", typ "id => aprop", Delimfix "CONST _"), wenzelm@35539: ("_context_const", typ "longid => logic", Delimfix "CONST _"), wenzelm@35539: ("_context_const", typ "longid => aprop", Delimfix "CONST _"), wenzelm@35539: ("_context_xconst", typ "id => logic", Delimfix "XCONST _"), wenzelm@35539: ("_context_xconst", typ "id => aprop", Delimfix "XCONST _"), wenzelm@35539: ("_context_xconst", typ "longid => logic", Delimfix "XCONST _"), wenzelm@35539: ("_context_xconst", typ "longid => aprop", Delimfix "XCONST _")] #> wenzelm@25159: Sign.add_advanced_trfuns wenzelm@26463: ([("_context_const", const_ast_tr true), ("_context_xconst", const_ast_tr false)], [], [], []))); wenzelm@25159: wenzelm@25159: end; wenzelm@19681: wenzelm@19663: wenzelm@21744: (* notation *) wenzelm@21744: wenzelm@24949: local wenzelm@24949: wenzelm@35539: fun type_syntax (Type (c, args), mx) = wenzelm@35539: SOME (Local_Syntax.Type, (Syntax.mark_type c, Syntax.make_type (length args), mx)) wenzelm@35417: | type_syntax _ = NONE; wenzelm@35417: wenzelm@35417: fun const_syntax _ (Free (x, T), mx) = SOME (Local_Syntax.Fixed, (x, T, mx)) wenzelm@24949: | const_syntax ctxt (Const (c, _), mx) = wenzelm@35255: (case try (Consts.type_scheme (consts_of ctxt)) c of wenzelm@35417: SOME T => SOME (Local_Syntax.Const, (Syntax.mark_const c, T, mx)) wenzelm@35255: | NONE => NONE) wenzelm@24949: | const_syntax _ _ = NONE; wenzelm@24949: wenzelm@35417: fun gen_notation syntax add mode args ctxt = wenzelm@35417: ctxt |> map_syntax wenzelm@35417: (Local_Syntax.update_modesyntax (theory_of ctxt) add mode (map_filter (syntax ctxt) args)); wenzelm@35417: wenzelm@24949: in wenzelm@24949: wenzelm@35417: val type_notation = gen_notation (K type_syntax); wenzelm@35417: val notation = gen_notation const_syntax; wenzelm@35417: wenzelm@35417: fun target_type_notation add mode args phi = wenzelm@35417: let wenzelm@35417: val args' = args |> map_filter (fn (T, mx) => wenzelm@35417: let wenzelm@35417: val T' = Morphism.typ phi T; wenzelm@35417: val similar = (case (T, T') of (Type (c, _), Type (c', _)) => c = c' | _ => false); wenzelm@35417: in if similar then SOME (T', mx) else NONE end); wenzelm@35417: in Context.mapping (Sign.type_notation add mode args') (type_notation add mode args') end; wenzelm@21744: wenzelm@24949: fun target_notation add mode args phi = wenzelm@33537: let wenzelm@33537: val args' = args |> map_filter (fn (t, mx) => wenzelm@33537: let val t' = Morphism.term phi t wenzelm@33537: in if Term.aconv_untyped (t, t') then SOME (t', mx) else NONE end); wenzelm@24949: in Context.mapping (Sign.notation add mode args') (notation add mode args') end; wenzelm@24949: wenzelm@35680: end; wenzelm@35417: wenzelm@35680: wenzelm@35680: (* aliases *) wenzelm@35680: wenzelm@36450: fun class_alias b c ctxt = (map_tsig o apfst) (Type.class_alias (naming_of ctxt) b c) ctxt; wenzelm@36450: fun type_alias b c ctxt = (map_tsig o apfst) (Type.type_alias (naming_of ctxt) b c) ctxt; wenzelm@35680: fun const_alias b c ctxt = (map_consts o apfst) (Consts.alias (naming_of ctxt) b c) ctxt; wenzelm@21744: wenzelm@21744: wenzelm@24767: (* local constants *) wenzelm@24767: wenzelm@24767: fun add_const_constraint (c, opt_T) ctxt = wenzelm@24767: let wenzelm@24767: fun prepT raw_T = wenzelm@24767: let val T = cert_typ ctxt raw_T wenzelm@24767: in cert_term ctxt (Const (c, T)); T end; haftmann@25039: in ctxt |> (map_consts o apfst) (Consts.constrain (c, Option.map prepT opt_T)) end; wenzelm@19001: wenzelm@33173: fun add_abbrev mode (b, raw_t) ctxt = wenzelm@19001: let wenzelm@24675: val t0 = cert_term (ctxt |> set_mode mode_abbrev) raw_t wenzelm@30222: handle ERROR msg => cat_error msg ("in constant abbreviation " ^ quote (Binding.str_of b)); wenzelm@20008: val [t] = Variable.exportT_terms (Variable.declare_term t0 ctxt) ctxt [t0]; wenzelm@21807: val ((lhs, rhs), consts') = consts_of ctxt wenzelm@33173: |> Consts.abbreviate (Syntax.pp ctxt) (tsig_of ctxt) (naming_of ctxt) mode (b, t); wenzelm@19001: in wenzelm@19001: ctxt haftmann@25039: |> (map_consts o apfst) (K consts') wenzelm@21803: |> Variable.declare_term rhs wenzelm@21803: |> pair (lhs, rhs) wenzelm@21704: end; wenzelm@19001: wenzelm@25052: fun revert_abbrev mode c = (map_consts o apfst) (Consts.revert_abbrev mode c); wenzelm@25052: wenzelm@19001: wenzelm@18672: (* fixes *) wenzelm@18187: wenzelm@30770: fun add_fixes raw_vars ctxt = wenzelm@18672: let wenzelm@30770: val (vars, _) = cert_vars raw_vars ctxt; wenzelm@30588: val (xs', ctxt') = Variable.add_fixes (map (Name.of_binding o #1) vars) ctxt; wenzelm@28082: val ctxt'' = wenzelm@28082: ctxt' wenzelm@28082: |> fold_map declare_var (map2 (fn x' => fn (_, T, mx) => (x', T, mx)) xs' vars) wenzelm@36519: |-> (map_syntax o Local_Syntax.add_syntax (theory_of ctxt) o map (pair Local_Syntax.Fixed)); haftmann@28861: val _ = (vars ~~ xs') |> List.app (fn ((b, _, _), x') => wenzelm@33383: Context_Position.report_visible ctxt (Markup.fixed_decl x') (Binding.pos_of b)); wenzelm@28082: in (xs', ctxt'') end; wenzelm@18187: wenzelm@18672: wenzelm@18672: (* fixes vs. frees *) wenzelm@18672: wenzelm@32791: fun auto_fixes (ctxt, (propss, x)) = wenzelm@21370: ((fold o fold) Variable.auto_fixes propss ctxt, (propss, x)); wenzelm@18187: wenzelm@18672: fun bind_fixes xs ctxt = wenzelm@18187: let wenzelm@30770: val (_, ctxt') = ctxt |> add_fixes (map (fn x => (Binding.name x, NONE, NoSyn)) xs); wenzelm@18187: fun bind (t as Free (x, T)) = wenzelm@18340: if member (op =) xs x then wenzelm@18187: (case lookup_skolem ctxt' x of SOME x' => Free (x', T) | NONE => t) wenzelm@18187: else t wenzelm@18187: | bind (t $ u) = bind t $ bind u wenzelm@18187: | bind (Abs (x, T, t)) = Abs (x, T, bind t) wenzelm@18187: | bind a = a; wenzelm@18672: in (bind, ctxt') end; wenzelm@18187: wenzelm@18187: wenzelm@11918: wenzelm@18672: (** assumptions **) wenzelm@11918: wenzelm@20209: local wenzelm@20209: wenzelm@20209: fun gen_assms prepp exp args ctxt = wenzelm@20209: let wenzelm@20234: val cert = Thm.cterm_of (theory_of ctxt); wenzelm@20209: val (propss, ctxt1) = swap (prepp (ctxt, map snd args)); wenzelm@20234: val _ = Variable.warn_extra_tfrees ctxt ctxt1; wenzelm@20234: val (premss, ctxt2) = fold_burrow (Assumption.add_assms exp o map cert) propss ctxt1; wenzelm@20234: in wenzelm@20234: ctxt2 wenzelm@20234: |> auto_bind_facts (flat propss) wenzelm@33644: |> note_thmss "" (map fst args ~~ map (map (fn th => ([th], []))) premss) wenzelm@20234: end; wenzelm@20209: wenzelm@20209: in wenzelm@20209: wenzelm@20209: val add_assms = gen_assms (apsnd #1 o bind_propp); wenzelm@20209: val add_assms_i = gen_assms (apsnd #1 o bind_propp_i); wenzelm@20209: wenzelm@20209: end; wenzelm@20209: wenzelm@20209: wenzelm@10810: wenzelm@10810: (** cases **) wenzelm@10810: wenzelm@16147: local wenzelm@16147: wenzelm@16668: fun rem_case name = remove (fn (x: string, (y, _)) => x = y) name; wenzelm@16147: wenzelm@18476: fun add_case _ ("", _) cases = cases wenzelm@18476: | add_case _ (name, NONE) cases = rem_case name cases wenzelm@18476: | add_case is_proper (name, SOME c) cases = (name, (c, is_proper)) :: rem_case name cases; wenzelm@16147: wenzelm@18678: fun prep_case name fxs c = wenzelm@18609: let wenzelm@18609: fun replace (opt_x :: xs) ((y, T) :: ys) = (the_default y opt_x, T) :: replace xs ys wenzelm@18609: | replace [] ys = ys wenzelm@18678: | replace (_ :: _) [] = error ("Too many parameters for case " ^ quote name); wenzelm@33368: val Rule_Cases.Case {fixes, assumes, binds, cases} = c; wenzelm@18609: val fixes' = replace fxs fixes; wenzelm@18609: val binds' = map drop_schematic binds; wenzelm@18609: in wenzelm@18609: if null (fold (Term.add_tvarsT o snd) fixes []) andalso wenzelm@18609: null (fold (fold Term.add_vars o snd) assumes []) then wenzelm@33368: Rule_Cases.Case {fixes = fixes', assumes = assumes, binds = binds', cases = cases} wenzelm@18678: else error ("Illegal schematic variable(s) in case " ^ quote name) wenzelm@18609: end; wenzelm@18609: wenzelm@18672: fun fix (x, T) ctxt = wenzelm@18672: let wenzelm@18672: val (bind, ctxt') = bind_fixes [x] ctxt; wenzelm@18672: val t = bind (Free (x, T)); wenzelm@20163: in (t, ctxt' |> Variable.declare_constraints t) end; wenzelm@18672: wenzelm@16147: in wenzelm@16147: wenzelm@18672: fun add_cases is_proper = map_cases o fold (add_case is_proper); wenzelm@18609: wenzelm@18609: fun case_result c ctxt = wenzelm@18609: let wenzelm@33368: val Rule_Cases.Case {fixes, ...} = c; wenzelm@18672: val (ts, ctxt') = ctxt |> fold_map fix fixes; wenzelm@33368: val Rule_Cases.Case {assumes, binds, cases, ...} = Rule_Cases.apply ts c; wenzelm@18609: in wenzelm@18609: ctxt' wenzelm@30764: |> bind_terms (map drop_schematic binds) wenzelm@18609: |> add_cases true (map (apsnd SOME) cases) wenzelm@18609: |> pair (assumes, (binds, cases)) wenzelm@18609: end; wenzelm@18609: wenzelm@18609: val apply_case = apfst fst oo case_result; wenzelm@18609: wenzelm@16540: fun get_case ctxt name xs = wenzelm@17184: (case AList.lookup (op =) (cases_of ctxt) name of wenzelm@18678: NONE => error ("Unknown case: " ^ quote name) wenzelm@18678: | SOME (c, _) => prep_case name xs c); wenzelm@10810: wenzelm@16147: end; wenzelm@10810: wenzelm@10810: wenzelm@10810: wenzelm@5819: (** print context information **) wenzelm@5819: wenzelm@12072: (* local syntax *) wenzelm@12072: wenzelm@12093: val print_syntax = Syntax.print_syntax o syn_of; wenzelm@12072: wenzelm@12072: wenzelm@21728: (* abbreviations *) wenzelm@18971: wenzelm@21728: fun pretty_abbrevs show_globals ctxt = wenzelm@18971: let wenzelm@25052: val ((space, consts), (_, globals)) = wenzelm@19033: pairself (#constants o Consts.dest) (#consts (rep_context ctxt)); wenzelm@21803: fun add_abbr (_, (_, NONE)) = I wenzelm@25406: | add_abbr (c, (T, SOME t)) = wenzelm@21728: if not show_globals andalso Symtab.defined globals c then I wenzelm@21728: else cons (c, Logic.mk_equals (Const (c, T), t)); wenzelm@33100: val abbrevs = Name_Space.extern_table (space, Symtab.make (Symtab.fold add_abbr consts [])); wenzelm@18971: in wenzelm@35146: if null abbrevs then [] wenzelm@21728: else [Pretty.big_list "abbreviations:" (map (pretty_term_abbrev ctxt o #2) abbrevs)] wenzelm@18971: end; wenzelm@18971: wenzelm@21728: val print_abbrevs = Pretty.writeln o Pretty.chunks o pretty_abbrevs true; wenzelm@21728: wenzelm@18971: wenzelm@5819: (* term bindings *) wenzelm@5819: wenzelm@16540: fun pretty_binds ctxt = wenzelm@5819: let wenzelm@19897: val binds = Variable.binds_of ctxt; wenzelm@21728: fun prt_bind (xi, (T, t)) = pretty_term_abbrev ctxt (Logic.mk_equals (Var (xi, T), t)); wenzelm@6721: in wenzelm@35146: if Vartab.is_empty binds then [] wenzelm@15758: else [Pretty.big_list "term bindings:" (map prt_bind (Vartab.dest binds))] wenzelm@6721: end; wenzelm@5819: wenzelm@8462: val print_binds = Pretty.writeln o Pretty.chunks o pretty_binds; wenzelm@6847: wenzelm@5819: wenzelm@5819: (* local theorems *) wenzelm@5819: wenzelm@16540: fun pretty_lthms ctxt = wenzelm@20012: let wenzelm@26284: val local_facts = facts_of ctxt; wenzelm@26284: val props = Facts.props local_facts; wenzelm@26673: val facts = wenzelm@35146: (if null props then [] else [("", props)]) @ wenzelm@28212: Facts.dest_static [] local_facts; wenzelm@20012: in wenzelm@35146: if null facts then [] wenzelm@28212: else [Pretty.big_list "facts:" (map #1 (sort_wrt (#1 o #2) (map (`(pretty_fact ctxt)) facts)))] wenzelm@20012: end; wenzelm@6847: wenzelm@12057: val print_lthms = Pretty.writeln o Pretty.chunks o pretty_lthms; wenzelm@5819: wenzelm@5819: wenzelm@8373: (* local contexts *) wenzelm@8373: wenzelm@26722: local wenzelm@26722: wenzelm@26722: fun pretty_case (name, (fixes, ((asms, (lets, cs)), ctxt))) = wenzelm@8373: let wenzelm@24922: val prt_term = Syntax.pretty_term ctxt; wenzelm@12057: wenzelm@10810: fun prt_let (xi, t) = Pretty.block wenzelm@10818: [Pretty.quote (prt_term (Var (xi, Term.fastype_of t))), Pretty.str " =", Pretty.brk 1, wenzelm@10810: Pretty.quote (prt_term t)]; wenzelm@8373: wenzelm@13425: fun prt_asm (a, ts) = Pretty.block (Pretty.breaks wenzelm@13425: ((if a = "" then [] else [Pretty.str (a ^ ":")]) @ map (Pretty.quote o prt_term) ts)); wenzelm@13425: wenzelm@10810: fun prt_sect _ _ _ [] = [] wenzelm@35146: | prt_sect s sep prt xs = wenzelm@35146: [Pretty.block (Pretty.breaks (Pretty.str s :: wenzelm@35146: flat (separate sep (map (single o prt) xs))))]; wenzelm@26722: in wenzelm@26722: Pretty.block (Pretty.fbreaks wenzelm@8373: (Pretty.str (name ^ ":") :: wenzelm@11915: prt_sect "fix" [] (Pretty.str o fst) fixes @ wenzelm@10810: prt_sect "let" [Pretty.str "and"] prt_let wenzelm@19482: (map_filter (fn (xi, SOME t) => SOME (xi, t) | _ => NONE) lets) @ wenzelm@13425: (if forall (null o #2) asms then [] wenzelm@18609: else prt_sect "assume" [Pretty.str "and"] prt_asm asms) @ wenzelm@26722: prt_sect "subcases:" [] (Pretty.str o fst) cs)) wenzelm@26722: end; wenzelm@16540: wenzelm@26722: in wenzelm@26722: wenzelm@26722: fun pretty_cases ctxt = wenzelm@26722: let wenzelm@18476: fun add_case (_, (_, false)) = I wenzelm@33368: | add_case (name, (c as Rule_Cases.Case {fixes, ...}, true)) = wenzelm@26722: cons (name, (fixes, case_result c ctxt)); wenzelm@18476: val cases = fold add_case (cases_of ctxt) []; wenzelm@8373: in wenzelm@35146: if null cases then [] wenzelm@26722: else [Pretty.big_list "cases:" (map pretty_case cases)] wenzelm@8373: end; wenzelm@8373: wenzelm@8462: val print_cases = Pretty.writeln o Pretty.chunks o pretty_cases; wenzelm@8373: wenzelm@26722: end; wenzelm@26722: wenzelm@8373: wenzelm@12057: (* core context *) wenzelm@9733: wenzelm@35146: val debug = Unsynchronized.ref false; wenzelm@35146: val verbose = Unsynchronized.ref false; wenzelm@32738: val prems_limit = Unsynchronized.ref ~1; wenzelm@5819: wenzelm@18672: fun pretty_ctxt ctxt = wenzelm@20310: if ! prems_limit < 0 andalso not (! debug) then [] wenzelm@20310: else wenzelm@20310: let wenzelm@24922: val prt_term = Syntax.pretty_term ctxt; wenzelm@12057: wenzelm@20310: (*structures*) wenzelm@35539: val {structs, ...} = Local_Syntax.idents_of (syntax_of ctxt); wenzelm@35144: val prt_structs = wenzelm@35144: if null structs then [] wenzelm@20310: else [Pretty.block (Pretty.str "structures:" :: Pretty.brk 1 :: wenzelm@20310: Pretty.commas (map Pretty.str structs))]; wenzelm@12093: wenzelm@20310: (*fixes*) wenzelm@20310: fun prt_fix (x, x') = wenzelm@20310: if x = x' then Pretty.str x wenzelm@20310: else Pretty.block [Pretty.str x, Pretty.str " =", Pretty.brk 1, prt_term (Syntax.free x')]; wenzelm@20310: val fixes = wenzelm@20310: rev (filter_out ((can Name.dest_internal orf member (op =) structs) o #1) wenzelm@20310: (Variable.fixes_of ctxt)); wenzelm@35144: val prt_fixes = wenzelm@35144: if null fixes then [] wenzelm@20310: else [Pretty.block (Pretty.str "fixed variables:" :: Pretty.brk 1 :: wenzelm@20310: Pretty.commas (map prt_fix fixes))]; wenzelm@12057: wenzelm@20310: (*prems*) wenzelm@30479: val prems = Assumption.all_prems_of ctxt; wenzelm@20310: val len = length prems; wenzelm@20367: val suppressed = len - ! prems_limit; wenzelm@35144: val prt_prems = wenzelm@35144: if null prems then [] wenzelm@20367: else [Pretty.big_list "prems:" ((if suppressed <= 0 then [] else [Pretty.str "..."]) @ haftmann@33956: map (Display.pretty_thm ctxt) (drop suppressed prems))]; wenzelm@20310: in prt_structs @ prt_fixes @ prt_prems end; wenzelm@9733: wenzelm@9733: wenzelm@9733: (* main context *) wenzelm@7575: wenzelm@16540: fun pretty_context ctxt = wenzelm@5819: let wenzelm@35146: val is_verbose = ! verbose; wenzelm@35146: fun verb f x = if is_verbose then f (x ()) else []; wenzelm@35146: wenzelm@24922: val prt_term = Syntax.pretty_term ctxt; wenzelm@24922: val prt_typ = Syntax.pretty_typ ctxt; wenzelm@24922: val prt_sort = Syntax.pretty_sort ctxt; wenzelm@5819: wenzelm@5819: (*theory*) wenzelm@12057: val pretty_thy = Pretty.block wenzelm@17384: [Pretty.str "theory:", Pretty.brk 1, Context.pretty_thy (theory_of ctxt)]; wenzelm@7200: wenzelm@8373: (*defaults*) wenzelm@5819: fun prt_atom prt prtT (x, X) = Pretty.block wenzelm@5819: [prt x, Pretty.str " ::", Pretty.brk 1, prtT X]; wenzelm@5819: wenzelm@5819: fun prt_var (x, ~1) = prt_term (Syntax.free x) wenzelm@5819: | prt_var xi = prt_term (Syntax.var xi); wenzelm@5819: wenzelm@5819: fun prt_varT (x, ~1) = prt_typ (TFree (x, [])) wenzelm@5819: | prt_varT xi = prt_typ (TVar (xi, [])); wenzelm@5819: wenzelm@5819: val prt_defT = prt_atom prt_var prt_typ; wenzelm@5819: val prt_defS = prt_atom prt_varT prt_sort; wenzelm@16540: wenzelm@20163: val (types, sorts) = Variable.constraints_of ctxt; wenzelm@5819: in wenzelm@18609: verb single (K pretty_thy) @ wenzelm@18672: pretty_ctxt ctxt @ wenzelm@21728: verb (pretty_abbrevs false) (K ctxt) @ wenzelm@8462: verb pretty_binds (K ctxt) @ wenzelm@12057: verb pretty_lthms (K ctxt) @ wenzelm@8462: verb pretty_cases (K ctxt) @ wenzelm@18609: verb single (fn () => Pretty.big_list "type constraints:" (map prt_defT (Vartab.dest types))) @ wenzelm@20163: verb single (fn () => Pretty.big_list "default sorts:" (map prt_defS (Vartab.dest sorts))) wenzelm@5819: end; wenzelm@5819: wenzelm@5819: end; wenzelm@35539: