wenzelm@5819: (* Title: Pure/Isar/proof_context.ML wenzelm@5819: ID: $Id$ 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@21667: val is_stmt: Proof.context -> bool wenzelm@21667: val set_stmt: bool -> Proof.context -> Proof.context wenzelm@21667: val restore_stmt: Proof.context -> Proof.context -> Proof.context wenzelm@21667: val naming_of: Proof.context -> NameSpace.naming wenzelm@20310: val full_name: Proof.context -> bstring -> string wenzelm@20310: val consts_of: Proof.context -> Consts.T wenzelm@21183: val const_syntax_name: Proof.context -> string -> string 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@22358: val theorems_of: Proof.context -> thm list NameSpace.table wenzelm@20310: val fact_index_of: Proof.context -> FactIndex.T 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@20310: val pretty_term: Proof.context -> term -> Pretty.T wenzelm@21728: val pretty_term_abbrev: Proof.context -> term -> Pretty.T wenzelm@20310: val pretty_typ: Proof.context -> typ -> Pretty.T wenzelm@20310: val pretty_sort: Proof.context -> sort -> Pretty.T wenzelm@20310: val pretty_classrel: Proof.context -> class list -> Pretty.T wenzelm@20310: val pretty_arity: Proof.context -> arity -> Pretty.T wenzelm@20310: val pp: Proof.context -> Pretty.pp wenzelm@22874: val pretty_thm_legacy: thm -> Pretty.T wenzelm@20310: val pretty_thm: Proof.context -> thm -> Pretty.T wenzelm@20310: val pretty_thms: Proof.context -> thm list -> Pretty.T wenzelm@20310: val pretty_fact: Proof.context -> string * thm list -> Pretty.T wenzelm@20310: val pretty_proof: Proof.context -> Proofterm.proof -> Pretty.T wenzelm@20310: val pretty_proof_of: Proof.context -> bool -> thm -> Pretty.T wenzelm@20310: val string_of_typ: Proof.context -> typ -> string wenzelm@20310: val string_of_term: Proof.context -> term -> string wenzelm@20310: val string_of_thm: Proof.context -> thm -> string 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@20310: val revert_skolems: Proof.context -> term -> term wenzelm@22763: val decode_term: Proof.context -> term -> term wenzelm@20310: val read_termTs_schematic: Proof.context -> (string -> bool) -> (indexname -> typ option) wenzelm@14720: -> (indexname -> sort option) -> string list -> (string * typ) list wenzelm@14720: -> term list * (indexname * typ) list wenzelm@22712: val read_prop_legacy: Proof.context -> string -> term wenzelm@20310: val read_term: Proof.context -> string -> term wenzelm@20310: val read_prop: Proof.context -> string -> term wenzelm@20310: val read_prop_schematic: Proof.context -> string -> term wenzelm@22773: val read_termTs: Proof.context -> (string * typ) list -> term list wenzelm@22773: val read_terms: Proof.context -> string list -> term list wenzelm@20310: val read_term_pats: typ -> Proof.context -> string list -> term list wenzelm@20310: val read_prop_pats: Proof.context -> string list -> term list wenzelm@21728: val read_term_abbrev: Proof.context -> string -> term wenzelm@20310: val cert_term: Proof.context -> term -> term wenzelm@22773: val cert_terms: Proof.context -> term list -> term list wenzelm@20310: val cert_prop: Proof.context -> term -> term wenzelm@20310: val cert_term_pats: typ -> Proof.context -> term list -> term list wenzelm@20310: val cert_prop_pats: Proof.context -> term list -> term list wenzelm@22728: val infer_types: Proof.context -> term list -> term list wenzelm@22728: val infer_types_pats: Proof.context -> term list -> term list wenzelm@20310: val infer_type: Proof.context -> string -> typ wenzelm@20310: val inferred_param: string -> Proof.context -> (string * typ) * Proof.context wenzelm@20310: val inferred_fixes: Proof.context -> (string * typ) list * Proof.context wenzelm@20310: val read_tyname: Proof.context -> string -> typ wenzelm@20310: val read_const: Proof.context -> string -> term 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@20310: val add_binds: (indexname * string option) list -> Proof.context -> Proof.context wenzelm@20310: val add_binds_i: (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@20310: val get_thm: Proof.context -> thmref -> thm wenzelm@20310: val get_thm_closure: Proof.context -> thmref -> thm wenzelm@20310: val get_thms: Proof.context -> thmref -> thm list wenzelm@20310: val get_thms_closure: Proof.context -> thmref -> thm list wenzelm@20310: val valid_thms: Proof.context -> string * thm list -> bool wenzelm@20310: val lthms_containing: Proof.context -> FactIndex.spec -> (string * thm list) list haftmann@22352: val add_path: string -> Proof.context -> Proof.context wenzelm@20310: val no_base_names: Proof.context -> Proof.context wenzelm@20310: val qualified_names: Proof.context -> Proof.context wenzelm@20310: val sticky_prefix: string -> Proof.context -> Proof.context wenzelm@20310: val restore_naming: Proof.context -> Proof.context -> Proof.context wenzelm@21728: val reset_naming: Proof.context -> Proof.context wenzelm@20310: val hide_thms: bool -> string list -> Proof.context -> Proof.context wenzelm@21443: val put_thms: string * thm list option -> Proof.context -> Proof.context wenzelm@21443: val note_thmss: string -> wenzelm@18728: ((bstring * attribute list) * (thmref * attribute list) list) list -> wenzelm@20310: Proof.context -> (bstring * thm list) list * Proof.context wenzelm@21443: val note_thmss_i: string -> wenzelm@18728: ((bstring * attribute list) * (thm list * attribute list) list) list -> wenzelm@20310: Proof.context -> (bstring * thm list) list * Proof.context wenzelm@20310: val read_vars: (string * string option * mixfix) list -> Proof.context -> wenzelm@20310: (string * typ option * mixfix) list * Proof.context wenzelm@20310: val cert_vars: (string * typ option * mixfix) list -> Proof.context -> wenzelm@20310: (string * typ option * mixfix) list * Proof.context wenzelm@20310: val read_vars_legacy: (string * string option * mixfix) list -> Proof.context -> wenzelm@20310: (string * typ option * mixfix) list * Proof.context wenzelm@20310: val cert_vars_legacy: (string * typ option * mixfix) list -> Proof.context -> wenzelm@20310: (string * typ option * mixfix) list * Proof.context wenzelm@20310: val add_fixes: (string * string option * mixfix) list -> wenzelm@20310: Proof.context -> string list * Proof.context wenzelm@20310: val add_fixes_i: (string * typ option * mixfix) list -> wenzelm@20310: Proof.context -> string list * Proof.context wenzelm@20310: val add_fixes_legacy: (string * typ option * mixfix) list -> wenzelm@20310: Proof.context -> 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@19585: ((string * attribute list) * (string * string list) list) list -> wenzelm@20310: Proof.context -> (bstring * thm list) list * Proof.context wenzelm@20234: val add_assms_i: Assumption.export -> wenzelm@19585: ((string * attribute list) * (term * term list) list) list -> wenzelm@20310: Proof.context -> (bstring * thm list) list * Proof.context wenzelm@20310: val add_cases: bool -> (string * RuleCases.T option) list -> Proof.context -> Proof.context wenzelm@20310: val apply_case: RuleCases.T -> Proof.context -> (string * term list) list * Proof.context wenzelm@20310: val get_case: Proof.context -> string -> string option list -> RuleCases.T wenzelm@21208: val add_notation: Syntax.mode -> (term * mixfix) list -> wenzelm@21208: Proof.context -> Proof.context wenzelm@21744: val target_notation: Syntax.mode -> (term * mixfix) list -> morphism -> wenzelm@21744: Context.generic -> Context.generic wenzelm@21728: val set_expand_abbrevs: bool -> Proof.context -> Proof.context wenzelm@21803: val add_abbrev: string -> bstring * term -> Proof.context -> (term * term) * Proof.context wenzelm@10810: val verbose: bool ref wenzelm@10810: val setmp_verbose: ('a -> 'b) -> 'a -> 'b 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@20310: val debug: bool ref wenzelm@10810: val prems_limit: int 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@16540: val theory_of = Context.theory_of_proof; wenzelm@19001: val tsig_of = Sign.tsig_of o theory_of; wenzelm@19001: wenzelm@16540: val init = Context.init_proof; wenzelm@12057: wenzelm@7270: wenzelm@5819: wenzelm@16540: (** Isar proof context information **) wenzelm@5819: wenzelm@16540: datatype ctxt = wenzelm@16540: Ctxt of wenzelm@21443: {is_stmt: bool, (*inner statement mode*) wenzelm@21443: naming: NameSpace.naming, (*local naming conventions*) wenzelm@19001: syntax: LocalSyntax.T, (*local syntax*) wenzelm@19033: consts: Consts.T * Consts.T, (*global/local consts*) wenzelm@19001: thms: thm list NameSpace.table * FactIndex.T, (*local thms*) wenzelm@19897: cases: (string * (RuleCases.T * bool)) list}; (*local contexts*) wenzelm@5819: wenzelm@21443: fun make_ctxt (is_stmt, naming, syntax, consts, thms, cases) = wenzelm@21443: Ctxt {is_stmt = is_stmt, naming = naming, syntax = syntax, wenzelm@21443: consts = consts, thms = thms, cases = cases}; wenzelm@5819: wenzelm@19079: val local_naming = NameSpace.default_naming |> NameSpace.add_path "local"; wenzelm@19079: wenzelm@16540: structure ContextData = ProofDataFun wenzelm@18672: ( wenzelm@16540: type T = ctxt; wenzelm@16540: fun init thy = wenzelm@21443: make_ctxt (false, local_naming, LocalSyntax.init thy, wenzelm@20234: (Sign.consts_of thy, Sign.consts_of thy), wenzelm@19897: (NameSpace.empty_table, FactIndex.empty), []); wenzelm@18672: ); wenzelm@5819: wenzelm@16540: fun rep_context ctxt = ContextData.get ctxt |> (fn Ctxt args => args); wenzelm@5819: wenzelm@18672: fun map_context f = wenzelm@21443: ContextData.map (fn Ctxt {is_stmt, naming, syntax, consts, thms, cases} => wenzelm@21443: make_ctxt (f (is_stmt, naming, syntax, consts, thms, cases))); wenzelm@21443: wenzelm@21443: fun set_stmt b = wenzelm@21443: map_context (fn (_, naming, syntax, consts, thms, cases) => wenzelm@21443: (b, naming, syntax, consts, thms, cases)); wenzelm@18672: wenzelm@19001: fun map_naming f = wenzelm@21443: map_context (fn (is_stmt, naming, syntax, consts, thms, cases) => wenzelm@21443: (is_stmt, f naming, syntax, consts, thms, cases)); wenzelm@18672: wenzelm@19001: fun map_syntax f = wenzelm@21443: map_context (fn (is_stmt, naming, syntax, consts, thms, cases) => wenzelm@21443: (is_stmt, naming, f syntax, consts, thms, cases)); wenzelm@18672: wenzelm@19001: fun map_consts f = wenzelm@21443: map_context (fn (is_stmt, naming, syntax, consts, thms, cases) => wenzelm@21443: (is_stmt, naming, syntax, f consts, thms, cases)); wenzelm@18672: wenzelm@19001: fun map_thms f = wenzelm@21443: map_context (fn (is_stmt, naming, syntax, consts, thms, cases) => wenzelm@21443: (is_stmt, naming, syntax, consts, f thms, cases)); wenzelm@18672: wenzelm@19001: fun map_cases f = wenzelm@21443: map_context (fn (is_stmt, naming, syntax, consts, thms, cases) => wenzelm@21443: (is_stmt, naming, syntax, consts, thms, f cases)); wenzelm@21443: wenzelm@21443: val is_stmt = #is_stmt o rep_context; wenzelm@21443: fun restore_stmt ctxt = set_stmt (is_stmt ctxt); wenzelm@19001: wenzelm@19001: val naming_of = #naming o rep_context; wenzelm@19387: val full_name = NameSpace.full o naming_of; wenzelm@5819: wenzelm@16540: val syntax_of = #syntax o rep_context; wenzelm@19001: val syn_of = LocalSyntax.syn_of o syntax_of; wenzelm@19543: val set_syntax_mode = map_syntax o LocalSyntax.set_mode; wenzelm@19543: val restore_syntax_mode = map_syntax o LocalSyntax.restore_mode o syntax_of; wenzelm@19001: wenzelm@19033: val consts_of = #2 o #consts o rep_context; wenzelm@21183: val const_syntax_name = Consts.syntax_name o consts_of; wenzelm@5819: wenzelm@16540: val thms_of = #thms o rep_context; wenzelm@22358: val theorems_of = #1 o thms_of; wenzelm@19001: val fact_index_of = #2 o thms_of; wenzelm@16540: wenzelm@16540: val cases_of = #cases o rep_context; wenzelm@5819: wenzelm@5819: wenzelm@20367: (* theory transfer *) wenzelm@12093: wenzelm@19001: fun transfer_syntax thy = wenzelm@19001: map_syntax (LocalSyntax.rebuild thy) #> wenzelm@19033: map_consts (fn consts as (global_consts, local_consts) => wenzelm@19033: let val thy_consts = Sign.consts_of thy in wenzelm@19033: if Consts.eq_consts (thy_consts, global_consts) then consts wenzelm@19033: else (thy_consts, Consts.merge (thy_consts, local_consts)) wenzelm@19033: end); wenzelm@17072: wenzelm@19001: fun transfer thy = Context.transfer_proof 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@19310: local wenzelm@19310: wenzelm@21744: fun rewrite_term warn thy rews t = wenzelm@19371: if can Term.type_of t then Pattern.rewrite_term thy rews [] t wenzelm@21744: else (if warn then warning "Printing malformed term -- cannot expand abbreviations" else (); t); wenzelm@19371: wenzelm@19001: fun pretty_term' abbrevs ctxt t = wenzelm@18971: let wenzelm@19001: val thy = theory_of ctxt; wenzelm@19001: val syntax = syntax_of ctxt; wenzelm@18971: val consts = consts_of ctxt; wenzelm@22587: val do_abbrevs = abbrevs andalso not (print_mode_active "no_abbrevs"); wenzelm@19001: val t' = t wenzelm@21744: |> do_abbrevs ? rewrite_term true thy (Consts.abbrevs_of consts (! print_mode @ [""])) wenzelm@21824: |> do_abbrevs ? rewrite_term false thy (Consts.abbrevs_of consts [Syntax.internalM]) wenzelm@19371: |> Sign.extern_term (Consts.extern_early consts) thy wenzelm@19371: |> LocalSyntax.extern_term syntax; wenzelm@21772: in Sign.pretty_term' ctxt (LocalSyntax.syn_of syntax) (Consts.extern consts) t' end; wenzelm@18971: wenzelm@19310: in wenzelm@19310: wenzelm@19001: val pretty_term = pretty_term' true; wenzelm@21728: val pretty_term_abbrev = pretty_term' false; wenzelm@19310: wenzelm@19310: end; wenzelm@19310: wenzelm@16458: fun pretty_typ ctxt T = Sign.pretty_typ (theory_of ctxt) T; wenzelm@16458: fun pretty_sort ctxt S = Sign.pretty_sort (theory_of ctxt) S; wenzelm@16458: fun pretty_classrel ctxt cs = Sign.pretty_classrel (theory_of ctxt) cs; wenzelm@16458: fun pretty_arity ctxt ar = Sign.pretty_arity (theory_of ctxt) ar; wenzelm@14828: wenzelm@14974: fun pp ctxt = Pretty.pp (pretty_term ctxt, pretty_typ ctxt, pretty_sort ctxt, wenzelm@14974: pretty_classrel ctxt, pretty_arity ctxt); wenzelm@14828: wenzelm@22874: fun pretty_thm_legacy th = wenzelm@22874: let val thy = Thm.theory_of_thm th wenzelm@22874: in Display.pretty_thm_aux (pp (init thy)) true false [] th end; wenzelm@20234: wenzelm@17451: fun pretty_thm ctxt th = wenzelm@22874: let val asms = map Thm.term_of (Assumption.assms_of ctxt) wenzelm@22874: in Display.pretty_thm_aux (pp ctxt) false true asms th end; wenzelm@14828: wenzelm@14828: fun pretty_thms ctxt [th] = pretty_thm ctxt th wenzelm@14828: | pretty_thms ctxt ths = Pretty.blk (0, Pretty.fbreaks (map (pretty_thm ctxt) ths)); wenzelm@14828: wenzelm@14828: fun pretty_fact ctxt ("", ths) = pretty_thms ctxt ths wenzelm@14828: | pretty_fact ctxt (a, [th]) = wenzelm@14828: Pretty.block [Pretty.str (a ^ ":"), Pretty.brk 1, pretty_thm ctxt th] wenzelm@14828: | pretty_fact ctxt (a, ths) = wenzelm@14828: Pretty.block (Pretty.fbreaks (Pretty.str (a ^ ":") :: map (pretty_thm ctxt) ths)); wenzelm@14828: wenzelm@17072: fun pretty_proof ctxt prf = wenzelm@21728: pretty_term_abbrev (ctxt |> transfer_syntax (ProofSyntax.proof_syntax prf (theory_of ctxt))) wenzelm@17072: (ProofSyntax.term_of_proof prf); wenzelm@17072: wenzelm@17072: fun pretty_proof_of ctxt full th = wenzelm@17072: pretty_proof ctxt (ProofSyntax.proof_of full th); wenzelm@17072: wenzelm@17860: val string_of_typ = Pretty.string_of oo pretty_typ; wenzelm@17860: val string_of_term = Pretty.string_of oo pretty_term; wenzelm@17860: val string_of_thm = Pretty.string_of oo pretty_thm; wenzelm@17860: wenzelm@14828: wenzelm@14828: wenzelm@5819: (** prepare types **) wenzelm@5819: wenzelm@9504: local wenzelm@9504: wenzelm@9504: fun read_typ_aux read ctxt s = wenzelm@21772: read (syn_of ctxt) ctxt (Variable.def_sort ctxt) s; wenzelm@5819: wenzelm@10554: fun cert_typ_aux cert ctxt raw_T = wenzelm@18678: cert (theory_of ctxt) raw_T handle TYPE (msg, _, _) => error msg; wenzelm@9504: wenzelm@9504: in wenzelm@9504: wenzelm@16348: val read_typ = read_typ_aux Sign.read_typ'; wenzelm@16348: val read_typ_syntax = read_typ_aux Sign.read_typ_syntax'; wenzelm@16348: val read_typ_abbrev = read_typ_aux Sign.read_typ_abbrev'; wenzelm@16348: val cert_typ = cert_typ_aux Sign.certify_typ; wenzelm@16348: val cert_typ_syntax = cert_typ_aux Sign.certify_typ_syntax; wenzelm@16348: val cert_typ_abbrev = cert_typ_aux Sign.certify_typ_abbrev; wenzelm@9504: wenzelm@9504: end; wenzelm@9504: wenzelm@5819: wenzelm@7679: (* internalize Skolem constants *) wenzelm@7679: 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@7679: 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@7679: else x; wenzelm@7679: wenzelm@7679: wenzelm@20244: (* revert Skolem constants -- approximation only! *) wenzelm@18255: wenzelm@20244: fun revert_skolem ctxt = wenzelm@9133: let wenzelm@20244: val rev_fixes = map Library.swap (Variable.fixes_of ctxt); wenzelm@20244: val revert = AList.lookup (op =) rev_fixes; wenzelm@20244: in wenzelm@20244: fn x => wenzelm@20244: (case revert x of wenzelm@20244: SOME x' => x' wenzelm@20244: | NONE => perhaps (try Name.dest_skolem) x) wenzelm@20244: end; wenzelm@20244: wenzelm@20244: fun revert_skolems ctxt = wenzelm@20244: let wenzelm@20244: val revert = revert_skolem ctxt; wenzelm@20244: fun reverts (Free (x, T)) = Free (revert x, T) wenzelm@20244: | reverts (t $ u) = reverts t $ reverts u wenzelm@20244: | reverts (Abs (x, T, t)) = Abs (x, T, reverts t) wenzelm@20244: | reverts a = a; wenzelm@20244: in reverts end wenzelm@9133: wenzelm@8096: wenzelm@18187: wenzelm@5819: (** prepare terms and propositions **) wenzelm@5819: wenzelm@5819: (* wenzelm@16501: (1) read / certify wrt. theory of context wenzelm@5819: (2) intern Skolem constants wenzelm@5819: (3) expand term bindings wenzelm@5819: *) wenzelm@5819: wenzelm@5819: wenzelm@16501: (* read wrt. theory *) (*exception ERROR*) wenzelm@5819: wenzelm@22712: fun read_def_termTs freeze pp syn ctxt (types, sorts, used) fixed sTs = wenzelm@22712: Sign.read_def_terms' pp (Sign.is_logtype (theory_of ctxt)) syn (consts_of ctxt) fixed wenzelm@21772: ctxt (types, sorts) used freeze sTs; wenzelm@5874: wenzelm@22712: fun read_def_termT freeze pp syn ctxt defaults fixed sT = wenzelm@22712: apfst hd (read_def_termTs freeze pp syn ctxt defaults fixed [sT]); wenzelm@14828: wenzelm@22712: fun read_term_thy freeze pp syn thy defaults fixed s = wenzelm@22712: #1 (read_def_termT freeze pp syn thy defaults fixed (s, dummyT)); wenzelm@5874: wenzelm@22712: fun read_prop_thy freeze pp syn thy defaults fixed s = wenzelm@22712: #1 (read_def_termT freeze pp syn thy defaults fixed (s, propT)); wenzelm@12072: wenzelm@22712: fun read_terms_thy freeze pp syn thy defaults fixed = wenzelm@22773: #1 o read_def_termTs freeze pp syn thy defaults fixed; wenzelm@12072: wenzelm@22712: fun read_props_thy freeze pp syn thy defaults fixed = wenzelm@22712: #1 o read_def_termTs freeze pp syn thy defaults fixed o map (rpair propT); wenzelm@5819: wenzelm@5819: wenzelm@19001: (* local abbreviations *) wenzelm@5819: wenzelm@19371: fun certify_consts ctxt = wenzelm@19001: Consts.certify (pp ctxt) (tsig_of 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@5819: wenzelm@19897: fun expand_binds ctxt schematic = wenzelm@19897: Variable.expand_binds ctxt #> (if schematic then I else tap reject_schematic); wenzelm@5819: wenzelm@5819: wenzelm@22712: (* schematic type variables *) wenzelm@22712: wenzelm@22712: val reject_tvars = (Term.map_types o Term.map_atyps) wenzelm@22712: (fn TVar (xi, _) => error ("Illegal schematic type variable: " ^ Term.string_of_vname xi) wenzelm@22712: | T => T); wenzelm@22712: wenzelm@22712: wenzelm@6550: (* dummy patterns *) wenzelm@6550: wenzelm@18310: val prepare_dummies = wenzelm@18310: let val next = ref 1 in wenzelm@18310: fn t => wenzelm@18310: let val (i, u) = Term.replace_dummy_patterns (! next, t) wenzelm@18310: in next := i; u end wenzelm@18310: end; wenzelm@6762: wenzelm@18678: fun reject_dummies t = Term.no_dummy_patterns t wenzelm@18678: handle TERM _ => error "Illegal dummy pattern(s) in term"; wenzelm@6550: wenzelm@6550: wenzelm@22763: (* decoding raw terms (syntax trees) *) wenzelm@22763: wenzelm@22763: fun legacy_intern_skolem ctxt internal def_type x = (* FIXME cleanup this mess *) wenzelm@22763: let wenzelm@22763: val sko = lookup_skolem ctxt x; wenzelm@22763: val is_const = can (Consts.read_const (consts_of ctxt)) x; wenzelm@22763: val is_free = is_some sko orelse not is_const; wenzelm@22763: val is_internal = internal x; wenzelm@22763: val is_declared = is_some (def_type (x, ~1)); wenzelm@22763: val res = wenzelm@22763: if is_free andalso not is_internal then (no_skolem false x; sko) wenzelm@23361: else ((no_skolem false x; ()) handle ERROR msg => wenzelm@23361: legacy_feature (msg ^ ContextPosition.str_of ctxt); wenzelm@22763: if is_internal andalso is_declared then SOME x else NONE); wenzelm@22763: in if is_some res then res else if is_declared then SOME x else NONE end; wenzelm@22763: wenzelm@22763: fun decode_term ctxt = wenzelm@22763: let wenzelm@22763: val thy = theory_of ctxt; wenzelm@22763: val get_sort = Sign.get_sort thy (Variable.def_sort ctxt); wenzelm@22763: val map_const = try (#1 o Term.dest_Const o Consts.read_const (consts_of ctxt)); wenzelm@22763: val map_free = legacy_intern_skolem ctxt (K false) (Variable.def_type ctxt false); wenzelm@22763: val map_type = Sign.intern_tycons thy; wenzelm@22763: val map_sort = Sign.intern_sort thy; wenzelm@22763: in Syntax.decode_term get_sort map_const map_free map_type map_sort end; wenzelm@22763: wenzelm@22763: wenzelm@5819: (* read terms *) wenzelm@5819: wenzelm@10554: local wenzelm@10554: skalberg@15531: fun append_env e1 e2 x = (case e2 x of NONE => e1 x | some => some); wenzelm@14720: wenzelm@16031: fun gen_read' read app pattern schematic wenzelm@14720: ctxt internal more_types more_sorts more_used s = ballarin@14174: let wenzelm@19897: val types = append_env (Variable.def_type ctxt pattern) more_types; wenzelm@19897: val sorts = append_env (Variable.def_sort ctxt) more_sorts; wenzelm@20163: val used = fold Name.declare more_used (Variable.names_of ctxt); ballarin@14174: in wenzelm@22763: (read (pp ctxt) (syn_of ctxt) ctxt (types, sorts, used) wenzelm@22763: (legacy_intern_skolem ctxt internal types) s wenzelm@18678: handle TERM (msg, _) => error msg) wenzelm@19371: |> app (certify_consts ctxt) wenzelm@19001: |> app (if pattern then I else expand_binds ctxt schematic) wenzelm@22712: |> app (if pattern orelse schematic then I else reject_tvars) wenzelm@18678: |> app (if pattern then prepare_dummies else reject_dummies) wenzelm@14720: end; wenzelm@14720: wenzelm@16031: fun gen_read read app pattern schematic ctxt = wenzelm@16031: gen_read' read app pattern schematic ctxt (K false) (K NONE) (K NONE) []; wenzelm@14720: wenzelm@10554: in wenzelm@10554: wenzelm@16031: val read_termTs_schematic = gen_read' (read_def_termTs false) (apfst o map) false true; wenzelm@8096: wenzelm@14720: fun read_term_pats T ctxt = wenzelm@16031: #1 o gen_read (read_def_termTs false) (apfst o map) true false ctxt o map (rpair T); wenzelm@8096: val read_prop_pats = read_term_pats propT; wenzelm@8096: wenzelm@22712: fun read_prop_legacy ctxt = wenzelm@22712: gen_read' (read_prop_thy true) I false false ctxt (K true) (K NONE) (K NONE) []; wenzelm@14720: wenzelm@19143: val read_term = gen_read (read_term_thy true) I false false; wenzelm@19143: val read_prop = gen_read (read_prop_thy true) I false false; wenzelm@19143: val read_prop_schematic = gen_read (read_prop_thy true) I false true; wenzelm@22773: val read_termTs = gen_read (read_terms_thy true) map false false; wenzelm@22773: fun read_terms ctxt = read_termTs ctxt o map (rpair dummyT); wenzelm@19143: fun read_props schematic = gen_read (read_props_thy true) map false schematic; wenzelm@5819: wenzelm@10554: end; wenzelm@10554: wenzelm@5819: wenzelm@5819: (* certify terms *) wenzelm@5819: wenzelm@10554: local wenzelm@10554: wenzelm@18971: fun gen_cert prop pattern schematic ctxt t = t wenzelm@19371: |> certify_consts ctxt wenzelm@19001: |> (if pattern then I else expand_binds ctxt schematic) wenzelm@19371: |> (fn t' => #1 (Sign.certify' false prop (pp ctxt) (consts_of ctxt) (theory_of ctxt) t') wenzelm@18678: handle TYPE (msg, _, _) => error msg wenzelm@18678: | TERM (msg, _) => error msg); wenzelm@16501: wenzelm@10554: in wenzelm@8096: wenzelm@18971: val cert_term = gen_cert false false false; wenzelm@22773: val cert_terms = map o cert_term; wenzelm@18971: val cert_prop = gen_cert true false false; wenzelm@18971: val cert_props = map oo gen_cert true false; wenzelm@10554: wenzelm@18971: fun cert_term_pats _ = map o gen_cert false true false; wenzelm@18971: val cert_prop_pats = map o gen_cert true true false; wenzelm@10554: wenzelm@10554: end; wenzelm@5819: wenzelm@5819: wenzelm@22701: (* type inference *) wenzelm@22701: wenzelm@22701: local wenzelm@22701: wenzelm@22728: fun gen_infer_types pattern ctxt ts = wenzelm@22701: TypeInfer.infer_types (pp ctxt) (tsig_of ctxt) (try (Consts.the_constraint (consts_of ctxt))) wenzelm@22728: (Variable.def_type ctxt pattern) (Variable.names_of ctxt) (not pattern) (map (rpair dummyT) ts) wenzelm@22728: |> #1 |> map #1; wenzelm@22701: wenzelm@22701: in wenzelm@22701: wenzelm@22701: val infer_types = gen_infer_types false; wenzelm@22728: val infer_types_pats = gen_infer_types true; wenzelm@22701: wenzelm@22701: end; wenzelm@22701: wenzelm@22701: wenzelm@18770: (* inferred types of parameters *) wenzelm@18770: wenzelm@18770: fun infer_type ctxt x = wenzelm@22728: Term.fastype_of (singleton (infer_types ctxt) (Free (x, dummyT))); wenzelm@18770: wenzelm@18770: fun inferred_param x ctxt = wenzelm@18619: let val T = infer_type ctxt x wenzelm@20163: in ((x, T), ctxt |> Variable.declare_term (Free (x, T))) end; wenzelm@18619: wenzelm@18770: fun inferred_fixes ctxt = wenzelm@20086: fold_map inferred_param (rev (map #2 (Variable.fixes_of ctxt))) ctxt; wenzelm@5819: wenzelm@5819: wenzelm@15703: (* type and constant names *) wenzelm@15703: wenzelm@15703: fun read_tyname ctxt c = wenzelm@20163: if Syntax.is_tid c then wenzelm@19897: TFree (c, the_default (Sign.defaultS (theory_of ctxt)) (Variable.def_sort ctxt (c, ~1))) wenzelm@16458: else Sign.read_tyname (theory_of ctxt) c; wenzelm@15703: wenzelm@15703: fun read_const ctxt c = wenzelm@15703: (case lookup_skolem ctxt c of wenzelm@21208: SOME x => Free (x, infer_type ctxt x) wenzelm@18971: | NONE => Consts.read_const (consts_of ctxt) c); wenzelm@15703: wenzelm@15703: wenzelm@9553: 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@8616: 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@21531: wenzelm@15758: wenzelm@5819: (** bindings **) wenzelm@5819: wenzelm@8096: (* simult_matches *) wenzelm@8096: 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@19867: | SOME (env, _) => map (apsnd snd) (Envir.alist_of env)); wenzelm@8096: wenzelm@8096: wenzelm@8096: (* add_binds(_i) *) wenzelm@5819: wenzelm@7925: local wenzelm@7925: wenzelm@16031: fun gen_bind prep (xi as (x, _), raw_t) ctxt = wenzelm@19897: ctxt |> Variable.add_binds [(xi, Option.map (prep ctxt) raw_t)]; wenzelm@5819: wenzelm@10810: in 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@10554: | drop_schematic b = b; wenzelm@10554: wenzelm@16031: val add_binds = fold (gen_bind read_term); wenzelm@16031: val add_binds_i = fold (gen_bind cert_term); wenzelm@8616: wenzelm@16458: fun auto_bind f ts ctxt = ctxt |> add_binds_i (map drop_schematic (f (theory_of ctxt) ts)); wenzelm@12147: val auto_bind_goal = auto_bind AutoBind.goal; wenzelm@12147: val auto_bind_facts = auto_bind AutoBind.facts; wenzelm@7925: wenzelm@7925: end; wenzelm@5819: wenzelm@5819: wenzelm@8096: (* match_bind(_i) *) wenzelm@5819: wenzelm@8096: local wenzelm@8096: wenzelm@17860: fun prep_bind prep_pats (raw_pats, t) ctxt = wenzelm@5819: let wenzelm@19897: val ctxt' = Variable.declare_term t ctxt; wenzelm@19585: val pats = prep_pats (Term.fastype_of t) ctxt' raw_pats; wenzelm@19585: val binds = simult_matches ctxt' (t, pats); wenzelm@17860: in (binds, ctxt') end; wenzelm@7670: wenzelm@10465: fun gen_binds prep_terms prep_pats gen raw_binds ctxt = wenzelm@8616: let wenzelm@10465: val ts = prep_terms ctxt (map snd raw_binds); wenzelm@17860: val (binds, ctxt') = wenzelm@19482: apfst flat (fold_map (prep_bind prep_pats) (map fst raw_binds ~~ ts) ctxt); wenzelm@8616: val binds' = wenzelm@19916: if gen then map #1 binds ~~ Variable.exportT_terms ctxt' ctxt (map #2 binds) wenzelm@8616: 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@19897: ctxt (*sic!*) |> fold Variable.declare_term (map #2 binds') |> add_binds_i binds'' wenzelm@18310: else ctxt' |> add_binds_i binds''); wenzelm@18310: in (ts, ctxt'') end; wenzelm@8096: wenzelm@8096: in wenzelm@5935: wenzelm@10465: val match_bind = gen_binds read_terms read_term_pats; wenzelm@22773: val match_bind_i = gen_binds cert_terms cert_term_pats; wenzelm@8096: wenzelm@8096: end; wenzelm@5935: wenzelm@5935: wenzelm@10465: (* propositions with patterns *) wenzelm@5935: wenzelm@10465: local wenzelm@8096: wenzelm@10554: fun prep_propp schematic prep_props prep_pats (context, args) = wenzelm@10465: let wenzelm@19585: fun prep (_, raw_pats) (ctxt, prop :: props) = wenzelm@19897: let val ctxt' = Variable.declare_term prop ctxt wenzelm@19585: in ((prop, prep_pats ctxt' raw_pats), (ctxt', props)) end wenzelm@17860: | prep _ _ = sys_error "prep_propp"; wenzelm@17860: val (propp, (context', _)) = (fold_map o fold_map) prep args wenzelm@19482: (context, prep_props schematic context (maps (map fst) args)); wenzelm@10465: in (context', propp) end; wenzelm@5935: wenzelm@10465: fun gen_bind_propp prepp (ctxt, raw_args) = wenzelm@8096: let wenzelm@10465: val (ctxt', args) = prepp (ctxt, raw_args); wenzelm@19585: val binds = flat (flat (map (map (simult_matches ctxt')) args)); wenzelm@10465: val propss = map (map #1) args; wenzelm@8616: wenzelm@10554: (*generalize result: context evaluated now, binds added later*) wenzelm@19916: val gen = Variable.exportT_terms ctxt' ctxt; skalberg@15531: fun gen_binds c = c |> add_binds_i (map #1 binds ~~ map SOME (gen (map #2 binds))); skalberg@15531: in (ctxt' |> add_binds_i (map (apsnd SOME) binds), (propss, gen_binds)) end; wenzelm@8096: wenzelm@10465: in wenzelm@10465: wenzelm@11925: val read_propp = prep_propp false read_props read_prop_pats; wenzelm@11925: val cert_propp = prep_propp false cert_props cert_prop_pats; wenzelm@10554: val read_propp_schematic = prep_propp true read_props read_prop_pats; wenzelm@10554: val cert_propp_schematic = prep_propp true cert_props cert_prop_pats; wenzelm@10554: wenzelm@11925: val bind_propp = gen_bind_propp read_propp; wenzelm@11925: val bind_propp_i = gen_bind_propp cert_propp; wenzelm@11925: val bind_propp_schematic = gen_bind_propp read_propp_schematic; wenzelm@10554: val bind_propp_schematic_i = gen_bind_propp cert_propp_schematic; wenzelm@6789: wenzelm@10465: end; wenzelm@10465: wenzelm@6789: wenzelm@5819: wenzelm@5819: (** theorems **) wenzelm@5819: wenzelm@18042: (* fact_tac *) wenzelm@18042: wenzelm@18122: fun comp_incr_tac [] _ st = no_tac st wenzelm@18122: | comp_incr_tac (th :: ths) i st = wenzelm@18122: (Goal.compose_hhf_tac (Drule.incr_indexes st th) i APPEND comp_incr_tac ths i) st; wenzelm@18042: wenzelm@21687: fun fact_tac facts = Goal.norm_hhf_tac THEN' comp_incr_tac facts; wenzelm@18122: wenzelm@18122: fun some_fact_tac ctxt = SUBGOAL (fn (goal, i) => wenzelm@18042: let wenzelm@19001: val index = fact_index_of ctxt; wenzelm@18042: val facts = FactIndex.could_unify index (Term.strip_all_body goal); wenzelm@18042: in fact_tac facts i end); wenzelm@18042: wenzelm@18042: wenzelm@6091: (* get_thm(s) *) wenzelm@5819: wenzelm@18042: fun retrieve_thms _ pick ctxt (Fact s) = wenzelm@16501: let wenzelm@20049: val th = Goal.prove ctxt [] [] (read_prop ctxt s) (K (ALLGOALS (some_fact_tac ctxt))) wenzelm@18678: handle ERROR msg => cat_error msg "Failed to retrieve literal fact."; wenzelm@18042: in pick "" [th] end wenzelm@18042: | retrieve_thms from_thy pick ctxt xthmref = wenzelm@18042: let wenzelm@18042: val thy = theory_of ctxt; wenzelm@19001: val (space, tab) = #1 (thms_of ctxt); wenzelm@16501: val thmref = PureThy.map_name_of_thmref (NameSpace.intern space) xthmref; wenzelm@16501: val name = PureThy.name_of_thmref thmref; wenzelm@16501: in wenzelm@17412: (case Symtab.lookup tab name of wenzelm@16540: SOME ths => map (Thm.transfer thy) (PureThy.select_thm thmref ths) wenzelm@16540: | NONE => from_thy thy xthmref) |> pick name wenzelm@18042: end; wenzelm@5819: wenzelm@9566: val get_thm = retrieve_thms PureThy.get_thms PureThy.single_thm; wenzelm@9566: val get_thm_closure = retrieve_thms PureThy.get_thms_closure PureThy.single_thm; wenzelm@9566: val get_thms = retrieve_thms PureThy.get_thms (K I); wenzelm@9566: val get_thms_closure = retrieve_thms PureThy.get_thms_closure (K I); wenzelm@5819: wenzelm@5819: wenzelm@16031: (* valid_thms *) wenzelm@16031: wenzelm@16031: fun valid_thms ctxt (name, ths) = wenzelm@18678: (case try (fn () => get_thms ctxt (Name name)) () of wenzelm@16031: NONE => false wenzelm@16147: | SOME ths' => Thm.eq_thms (ths, ths')); wenzelm@16031: wenzelm@16031: wenzelm@16031: (* lthms_containing *) wenzelm@16031: wenzelm@16031: fun lthms_containing ctxt spec = wenzelm@16031: FactIndex.find (fact_index_of ctxt) spec wenzelm@21569: |> map (fn (name, ths) => wenzelm@21569: if valid_thms ctxt (name, ths) then (name, ths) wenzelm@21569: else (NameSpace.hidden (if name = "" then "unnamed" else name), ths)); wenzelm@16031: wenzelm@16031: wenzelm@13425: (* name space operations *) wenzelm@12309: haftmann@22352: val add_path = map_naming o NameSpace.add_path; wenzelm@19062: val no_base_names = map_naming NameSpace.no_base_names; wenzelm@16147: val qualified_names = map_naming NameSpace.qualified_names; wenzelm@19062: val sticky_prefix = map_naming o NameSpace.sticky_prefix; wenzelm@19062: val restore_naming = map_naming o K o naming_of; wenzelm@21728: val reset_naming = map_naming (K local_naming); wenzelm@12309: wenzelm@19001: fun hide_thms fully names = map_thms (fn ((space, tab), index) => wenzelm@19001: ((fold (NameSpace.hide fully) names space, tab), index)); wenzelm@13425: wenzelm@12309: wenzelm@17360: (* put_thms *) wenzelm@5819: wenzelm@21443: fun update_thms _ ("", NONE) ctxt = ctxt wenzelm@21648: | update_thms opts ("", SOME ths) ctxt = ctxt |> map_thms (fn (facts, index) => wenzelm@18672: let wenzelm@21648: val index' = uncurry FactIndex.add_local opts ("", ths) index; wenzelm@19001: in (facts, index') end) wenzelm@21443: | update_thms _ (bname, NONE) ctxt = ctxt |> map_thms (fn ((space, tab), index) => wenzelm@18672: let wenzelm@19387: val name = full_name ctxt bname; wenzelm@18672: val tab' = Symtab.delete_safe name tab; wenzelm@19001: in ((space, tab'), index) end) wenzelm@21648: | update_thms opts (bname, SOME ths) ctxt = ctxt |> map_thms (fn ((space, tab), index) => wenzelm@18672: let wenzelm@19387: val name = full_name ctxt bname; wenzelm@19001: val space' = NameSpace.declare (naming_of ctxt) name space; wenzelm@18672: val tab' = Symtab.update (name, ths) tab; wenzelm@21648: val index' = uncurry FactIndex.add_local opts (name, ths) index; wenzelm@19001: in ((space', tab'), index') end); wenzelm@5819: wenzelm@21443: fun put_thms thms ctxt = wenzelm@21648: ctxt |> map_naming (K local_naming) |> update_thms (true, false) thms |> restore_naming ctxt; wenzelm@19079: wenzelm@7606: wenzelm@14564: (* note_thmss *) wenzelm@5819: wenzelm@12711: local wenzelm@16147: wenzelm@21443: fun gen_note_thmss get k = fold_map (fn ((bname, more_attrs), raw_facts) => fn ctxt => wenzelm@5819: let wenzelm@21643: val name = full_name ctxt bname; wenzelm@21643: val facts = PureThy.name_thmss false name (map (apfst (get ctxt)) raw_facts); wenzelm@21443: fun app (th, attrs) x = wenzelm@21643: swap (foldl_map (Thm.proof_attributes (attrs @ more_attrs @ [PureThy.kind k])) (x, th)); wenzelm@21443: val (res, ctxt') = fold_map app facts ctxt; wenzelm@21643: val thms = PureThy.name_thms false false name (flat res); wenzelm@21648: in ((bname, thms), ctxt' |> update_thms (is_stmt ctxt, true) (bname, SOME thms)) end); wenzelm@12711: wenzelm@12711: in wenzelm@12711: haftmann@21622: fun note_thmss k = gen_note_thmss get_thms k; haftmann@21622: fun note_thmss_i k = gen_note_thmss (K I) k; ballarin@15696: wenzelm@12711: end; wenzelm@9196: wenzelm@5819: wenzelm@5819: wenzelm@18672: (** parameters **) wenzelm@17360: wenzelm@8096: (* variables *) wenzelm@8096: 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@10381: local wenzelm@10381: wenzelm@18672: fun prep_vars prep_typ internal legacy = wenzelm@18672: fold_map (fn (raw_x, raw_T, raw_mx) => fn ctxt => wenzelm@18672: let wenzelm@19371: val (x, mx) = Syntax.const_mixfix raw_x raw_mx; wenzelm@18672: val _ = wenzelm@18678: if not legacy andalso not (Syntax.is_identifier (no_skolem internal x)) then wenzelm@18678: error ("Illegal variable name: " ^ quote x) wenzelm@18672: else (); wenzelm@12504: 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@18672: val opt_T = Option.map (cond_tvars o prep_typ ctxt) raw_T; wenzelm@18672: val var = (x, opt_T, mx); wenzelm@19001: in (var, ctxt |> declare_var var |> #2) end); wenzelm@8096: wenzelm@10381: in wenzelm@10381: wenzelm@18672: val read_vars = prep_vars read_typ false false; wenzelm@18672: val cert_vars = prep_vars cert_typ true false; wenzelm@18672: val read_vars_legacy = prep_vars read_typ true true; wenzelm@18672: val cert_vars_legacy = prep_vars cert_typ true true; wenzelm@8096: wenzelm@10381: end; wenzelm@10381: wenzelm@8096: wenzelm@19681: (* authentic constants *) wenzelm@19663: wenzelm@21208: fun const_syntax ctxt (Free (x, T), mx) = SOME (true, (x, T, mx)) wenzelm@21667: | const_syntax ctxt (Const (c, _), mx) = wenzelm@21667: Option.map (pair false) (try (Consts.syntax (consts_of ctxt)) (c, mx)) wenzelm@21208: | const_syntax _ _ = NONE; wenzelm@21208: wenzelm@21772: fun context_const_ast_tr ctxt [Syntax.Variable c] = wenzelm@19681: let wenzelm@21772: val consts = consts_of ctxt; wenzelm@19681: val c' = Consts.intern consts c; wenzelm@21728: val _ = Consts.the_constraint consts c' handle TYPE (msg, _, _) => error msg; wenzelm@19681: in Syntax.Constant (Syntax.constN ^ c') end wenzelm@19681: | context_const_ast_tr _ asts = raise Syntax.AST ("const_ast_tr", asts); wenzelm@19681: wenzelm@19681: val _ = Context.add_setup wenzelm@19681: (Sign.add_syntax wenzelm@19681: [("_context_const", "id => 'a", Delimfix "CONST _"), wenzelm@19681: ("_context_const", "longid => 'a", Delimfix "CONST _")] #> wenzelm@19681: Sign.add_advanced_trfuns ([("_context_const", context_const_ast_tr)], [], [], [])); wenzelm@19681: wenzelm@19663: wenzelm@21744: (* notation *) wenzelm@21744: wenzelm@21744: fun add_notation mode args ctxt = wenzelm@21744: ctxt |> map_syntax wenzelm@21744: (LocalSyntax.add_modesyntax (theory_of ctxt) mode (map_filter (const_syntax ctxt) args)); wenzelm@21744: wenzelm@21803: fun target_notation mode args phi = wenzelm@21803: let val args' = filter (fn (t, _) => Term.equiv_types (t, Morphism.term phi t)) args; wenzelm@21744: in Context.mapping (Sign.add_notation mode args') (add_notation mode args') end; wenzelm@21744: wenzelm@21744: wenzelm@19001: (* abbreviations *) wenzelm@19001: wenzelm@21728: val set_expand_abbrevs = map_consts o apsnd o Consts.set_expand; wenzelm@21728: fun read_term_abbrev ctxt = read_term (set_expand_abbrevs false ctxt); wenzelm@19371: wenzelm@21704: fun add_abbrev mode (c, raw_t) ctxt = wenzelm@19001: let wenzelm@21728: val t0 = cert_term (ctxt |> set_expand_abbrevs false) raw_t wenzelm@21681: handle ERROR msg => cat_error msg ("in constant abbreviation " ^ quote c); wenzelm@20008: val [t] = Variable.exportT_terms (Variable.declare_term t0 ctxt) ctxt [t0]; wenzelm@21807: val ((lhs, rhs), consts') = consts_of ctxt wenzelm@21728: |> Consts.abbreviate (pp ctxt) (tsig_of ctxt) (naming_of ctxt) mode (c, t); wenzelm@19001: in wenzelm@19001: ctxt wenzelm@21681: |> map_consts (apsnd (K consts')) wenzelm@21803: |> Variable.declare_term rhs wenzelm@21803: |> pair (lhs, rhs) wenzelm@21704: end; wenzelm@19001: wenzelm@19001: wenzelm@18672: (* fixes *) wenzelm@5819: wenzelm@8096: local wenzelm@8096: wenzelm@19001: fun prep_mixfix (x, T, mx) = wenzelm@19019: if mx <> NoSyn andalso mx <> Structure andalso wenzelm@20086: (can Name.dest_internal x orelse can Name.dest_skolem x) then wenzelm@19001: error ("Illegal mixfix syntax for internal/skolem constant " ^ quote x) wenzelm@19001: else (true, (x, T, mx)); wenzelm@19001: wenzelm@18844: fun gen_fixes prep raw_vars ctxt = wenzelm@8096: let wenzelm@22712: val (vars, _) = prep raw_vars ctxt; wenzelm@22712: val (xs', ctxt') = Variable.add_fixes (map #1 vars) ctxt; wenzelm@8096: in wenzelm@22712: ctxt' wenzelm@19001: |> fold_map declare_var (map2 (fn x' => fn (_, T, mx) => (x', T, mx)) xs' vars) wenzelm@19897: |-> (map_syntax o LocalSyntax.add_syntax (theory_of ctxt) o map prep_mixfix) wenzelm@18672: |> pair xs' wenzelm@8096: end; wenzelm@5819: wenzelm@8096: in wenzelm@7679: wenzelm@18844: val add_fixes = gen_fixes read_vars; wenzelm@18844: val add_fixes_i = gen_fixes cert_vars; wenzelm@18844: val add_fixes_legacy = gen_fixes cert_vars_legacy; wenzelm@8096: wenzelm@8096: end; wenzelm@5819: wenzelm@18672: wenzelm@18672: (* fixes vs. frees *) wenzelm@12016: wenzelm@18672: fun auto_fixes (arg as (ctxt, (propss, x))) = wenzelm@21370: ((fold o fold) Variable.auto_fixes propss ctxt, (propss, x)); wenzelm@18672: wenzelm@18672: fun bind_fixes xs ctxt = wenzelm@9291: let wenzelm@18672: val (_, ctxt') = ctxt |> add_fixes_i (map (fn x => (x, NONE, NoSyn)) xs); wenzelm@9291: fun bind (t as Free (x, T)) = wenzelm@18340: if member (op =) xs x then skalberg@15531: (case lookup_skolem ctxt' x of SOME x' => Free (x', T) | NONE => t) wenzelm@9291: else t wenzelm@9291: | bind (t $ u) = bind t $ bind u wenzelm@9291: | bind (Abs (x, T, t)) = Abs (x, T, bind t) wenzelm@9291: | bind a = a; wenzelm@18672: in (bind, ctxt') end; wenzelm@18672: wenzelm@9291: wenzelm@9291: wenzelm@18672: (** assumptions **) wenzelm@18187: 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@21443: |> put_thms (AutoBind.premsN, SOME (Assumption.prems_of ctxt2)) wenzelm@21443: |> note_thmss_i Thm.assumptionK (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@5819: wenzelm@8373: (** cases **) wenzelm@8373: 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@18609: val RuleCases.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@18609: RuleCases.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@18609: val RuleCases.Case {fixes, ...} = c; wenzelm@18672: val (ts, ctxt') = ctxt |> fold_map fix fixes; wenzelm@18672: val RuleCases.Case {assumes, binds, cases, ...} = RuleCases.apply ts c; wenzelm@18609: in wenzelm@18609: ctxt' wenzelm@18699: |> add_binds_i (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@8373: wenzelm@16147: end; wenzelm@8373: wenzelm@8373: wenzelm@8373: wenzelm@10810: (** print context information **) wenzelm@10810: wenzelm@20310: val debug = ref false; wenzelm@20310: wenzelm@10810: val verbose = ref false; wenzelm@10810: fun verb f x = if ! verbose then f (x ()) else []; wenzelm@10810: wenzelm@10810: fun setmp_verbose f x = Library.setmp verbose true f x; wenzelm@10810: wenzelm@10810: 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@19033: val ((_, globals), (space, consts)) = wenzelm@19033: pairself (#constants o Consts.dest) (#consts (rep_context ctxt)); wenzelm@21803: fun add_abbr (_, (_, NONE)) = I wenzelm@21803: | 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@21803: val abbrevs = NameSpace.extern_table (space, Symtab.make (Symtab.fold add_abbr consts [])); wenzelm@18971: in wenzelm@18971: if null abbrevs andalso not (! verbose) 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@10810: (* term bindings *) wenzelm@10810: wenzelm@16540: fun pretty_binds ctxt = wenzelm@10810: 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@10810: in wenzelm@15758: if Vartab.is_empty binds andalso not (! verbose) then [] wenzelm@15758: else [Pretty.big_list "term bindings:" (map prt_bind (Vartab.dest binds))] wenzelm@10810: end; wenzelm@10810: wenzelm@10810: val print_binds = Pretty.writeln o Pretty.chunks o pretty_binds; wenzelm@10810: wenzelm@10810: wenzelm@10810: (* local theorems *) wenzelm@10810: wenzelm@16540: fun pretty_lthms ctxt = wenzelm@20012: let wenzelm@20012: val props = FactIndex.props (fact_index_of ctxt); wenzelm@20012: val facts = wenzelm@20012: (if null props then I else cons ("unnamed", props)) wenzelm@20012: (NameSpace.extern_table (#1 (thms_of ctxt))); wenzelm@20012: in wenzelm@20012: if null facts andalso not (! verbose) then [] wenzelm@20012: else [Pretty.big_list "facts:" (map (pretty_fact ctxt) facts)] wenzelm@20012: end; wenzelm@10810: wenzelm@12057: val print_lthms = Pretty.writeln o Pretty.chunks o pretty_lthms; wenzelm@10810: wenzelm@10810: wenzelm@10810: (* local contexts *) wenzelm@10810: wenzelm@16540: fun pretty_cases ctxt = wenzelm@10810: let wenzelm@12057: val prt_term = 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@10810: 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@10810: | prt_sect s sep prt xs = [Pretty.block (Pretty.breaks (Pretty.str s :: wenzelm@19482: flat (Library.separate sep (map (Library.single o prt) xs))))]; wenzelm@10810: wenzelm@18609: fun prt_case (name, (fixes, (asms, (lets, cs)))) = Pretty.block (Pretty.fbreaks wenzelm@10810: (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@18609: prt_sect "subcases:" [] (Pretty.str o fst) cs)); wenzelm@16540: wenzelm@18476: fun add_case (_, (_, false)) = I wenzelm@18609: | add_case (name, (c as RuleCases.Case {fixes, ...}, true)) = wenzelm@18609: cons (name, (fixes, #1 (case_result c ctxt))); wenzelm@18476: val cases = fold add_case (cases_of ctxt) []; wenzelm@10810: in wenzelm@10810: if null cases andalso not (! verbose) then [] wenzelm@18476: else [Pretty.big_list "cases:" (map prt_case cases)] wenzelm@10810: end; wenzelm@10810: wenzelm@10810: val print_cases = Pretty.writeln o Pretty.chunks o pretty_cases; wenzelm@10810: wenzelm@10810: wenzelm@12057: (* core context *) wenzelm@10810: wenzelm@20367: val prems_limit = ref ~1; wenzelm@10810: wenzelm@18672: fun pretty_ctxt ctxt = wenzelm@20310: if ! prems_limit < 0 andalso not (! debug) then [] wenzelm@20310: else wenzelm@20310: let wenzelm@20310: val prt_term = pretty_term ctxt; wenzelm@12057: wenzelm@20310: (*structures*) wenzelm@20310: val structs = LocalSyntax.structs_of (syntax_of ctxt); wenzelm@20310: val prt_structs = 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@20310: val prt_fixes = 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@20310: val prems = Assumption.prems_of ctxt; wenzelm@20310: val len = length prems; wenzelm@20367: val suppressed = len - ! prems_limit; wenzelm@20310: val prt_prems = if null prems then [] wenzelm@20367: else [Pretty.big_list "prems:" ((if suppressed <= 0 then [] else [Pretty.str "..."]) @ wenzelm@20367: map (pretty_thm ctxt) (Library.drop (suppressed, prems)))]; wenzelm@20310: in prt_structs @ prt_fixes @ prt_prems end; wenzelm@10810: wenzelm@10810: wenzelm@10810: (* main context *) wenzelm@10810: wenzelm@16540: fun pretty_context ctxt = wenzelm@10810: let wenzelm@12057: val prt_term = pretty_term ctxt; wenzelm@12057: val prt_typ = pretty_typ ctxt; wenzelm@12057: val prt_sort = pretty_sort ctxt; wenzelm@10810: wenzelm@10810: (*theory*) wenzelm@12057: val pretty_thy = Pretty.block wenzelm@17384: [Pretty.str "theory:", Pretty.brk 1, Context.pretty_thy (theory_of ctxt)]; wenzelm@10810: wenzelm@10810: (*defaults*) wenzelm@10810: fun prt_atom prt prtT (x, X) = Pretty.block wenzelm@10810: [prt x, Pretty.str " ::", Pretty.brk 1, prtT X]; wenzelm@10810: wenzelm@10810: fun prt_var (x, ~1) = prt_term (Syntax.free x) wenzelm@10810: | prt_var xi = prt_term (Syntax.var xi); wenzelm@10810: wenzelm@10810: fun prt_varT (x, ~1) = prt_typ (TFree (x, [])) wenzelm@10810: | prt_varT xi = prt_typ (TVar (xi, [])); wenzelm@10810: wenzelm@10810: val prt_defT = prt_atom prt_var prt_typ; wenzelm@10810: val prt_defS = prt_atom prt_varT prt_sort; wenzelm@16540: wenzelm@20163: val (types, sorts) = Variable.constraints_of ctxt; wenzelm@10810: in wenzelm@18609: verb single (K pretty_thy) @ wenzelm@18672: pretty_ctxt ctxt @ wenzelm@21728: verb (pretty_abbrevs false) (K ctxt) @ wenzelm@10810: verb pretty_binds (K ctxt) @ wenzelm@12057: verb pretty_lthms (K ctxt) @ wenzelm@10810: 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@10810: end; wenzelm@10810: wenzelm@5819: end;