src/Pure/Isar/isar_thy.ML
author wenzelm
Mon Mar 13 13:16:57 2000 +0100 (2000-03-13 ago)
changeset 8428 be4c8a57cf7e
parent 8371 7313627803f4
child 8450 dc44d6533f0f
permissions -rw-r--r--
adapted to new PureThy.add_thms etc.;
     1 (*  Title:      Pure/Isar/isar_thy.ML
     2     ID:         $Id$
     3     Author:     Markus Wenzel, TU Muenchen
     4 
     5 Pure/Isar derived theory operations.
     6 *)
     7 
     8 signature ISAR_THY =
     9 sig
    10   val add_header: Comment.text -> Toplevel.transition -> Toplevel.transition
    11   val add_chapter: Comment.text -> theory -> theory
    12   val add_section: Comment.text -> theory -> theory
    13   val add_subsection: Comment.text -> theory -> theory
    14   val add_subsubsection: Comment.text -> theory -> theory
    15   val add_text: Comment.text -> theory -> theory
    16   val add_text_raw: Comment.text -> theory -> theory
    17   val add_sect: Comment.text -> ProofHistory.T -> ProofHistory.T
    18   val add_subsect: Comment.text -> ProofHistory.T -> ProofHistory.T
    19   val add_subsubsect: Comment.text -> ProofHistory.T -> ProofHistory.T
    20   val add_txt: Comment.text -> ProofHistory.T -> ProofHistory.T
    21   val add_txt_raw: Comment.text -> ProofHistory.T -> ProofHistory.T
    22   val add_classes: (bclass * xclass list) list * Comment.text -> theory -> theory
    23   val add_classes_i: (bclass * class list) list * Comment.text  -> theory -> theory
    24   val add_classrel: (xclass * xclass) * Comment.text -> theory -> theory
    25   val add_classrel_i: (class * class) * Comment.text -> theory -> theory
    26   val add_defsort: xsort * Comment.text -> theory -> theory
    27   val add_defsort_i: sort * Comment.text -> theory -> theory
    28   val add_nonterminals: (bstring * Comment.text) list -> theory -> theory
    29   val add_tyabbrs: ((bstring * string list * string * mixfix) * Comment.text) list
    30     -> theory -> theory
    31   val add_tyabbrs_i: ((bstring * string list * typ * mixfix) * Comment.text) list
    32     -> theory -> theory
    33   val add_arities: ((xstring * xsort list * xsort) * Comment.text) list -> theory -> theory
    34   val add_arities_i: ((string * sort list * sort) * Comment.text) list -> theory -> theory
    35   val add_typedecl: (bstring * string list * mixfix) * Comment.text -> theory -> theory
    36   val add_consts: ((bstring * string * mixfix) * Comment.text) list -> theory -> theory
    37   val add_consts_i: ((bstring * typ * mixfix) * Comment.text) list -> theory -> theory
    38   val add_modesyntax: string * bool -> ((bstring * string * mixfix) * Comment.text) list
    39     -> theory -> theory
    40   val add_modesyntax_i: string * bool -> ((bstring * typ * mixfix) * Comment.text) list
    41     -> theory -> theory
    42   val add_trrules: ((xstring * string) Syntax.trrule * Comment.text) list -> theory -> theory
    43   val add_trrules_i: (Syntax.ast Syntax.trrule * Comment.text) list -> theory -> theory
    44   val add_judgment: (bstring * string * mixfix) * Comment.text -> theory -> theory
    45   val add_judgment_i: (bstring * typ * mixfix) * Comment.text -> theory -> theory
    46   val add_axioms: (((bstring * string) * Args.src list) * Comment.text) list -> theory -> theory
    47   val add_axioms_i: (((bstring * term) * theory attribute list) * Comment.text) list
    48     -> theory -> theory
    49   val add_defs: (((bstring * string) * Args.src list) * Comment.text) list -> theory -> theory
    50   val add_defs_i: (((bstring * term) * theory attribute list) * Comment.text) list
    51     -> theory -> theory
    52   val add_constdefs: (((bstring * string * mixfix) * Comment.text) * (string * Comment.text)) list
    53     -> theory -> theory
    54   val add_constdefs_i: (((bstring * typ * mixfix) * Comment.text) * (term * Comment.text)) list
    55     -> theory -> theory
    56   val apply_theorems: (xstring * Args.src list) list -> theory -> theory * thm list
    57   val apply_theorems_i: (thm * theory attribute list) list -> theory -> theory * thm list
    58   val have_theorems: ((bstring * Args.src list) * (xstring * Args.src list) list) * Comment.text
    59     -> theory -> theory
    60   val have_theorems_i: ((bstring * theory attribute list) * (thm * theory attribute list) list)
    61     * Comment.text -> theory -> theory
    62   val have_lemmas: ((bstring * Args.src list) * (xstring * Args.src list) list) * Comment.text
    63     -> theory -> theory
    64   val have_lemmas_i: ((bstring * theory attribute list) * (thm * theory attribute list) list)
    65     * Comment.text -> theory -> theory
    66   val have_facts: ((string * Args.src list) * (string * Args.src list) list) * Comment.text
    67     -> ProofHistory.T -> ProofHistory.T
    68   val have_facts_i: ((string * Proof.context attribute list) *
    69     (thm * Proof.context attribute list) list) * Comment.text -> ProofHistory.T -> ProofHistory.T
    70   val from_facts: (string * Args.src list) list * Comment.text -> ProofHistory.T -> ProofHistory.T
    71   val from_facts_i: (thm * Proof.context attribute list) list * Comment.text
    72     -> ProofHistory.T -> ProofHistory.T
    73   val with_facts: (string * Args.src list) list * Comment.text -> ProofHistory.T -> ProofHistory.T
    74   val with_facts_i: (thm * Proof.context attribute list) list * Comment.text
    75     -> ProofHistory.T -> ProofHistory.T
    76   val chain: Comment.text -> ProofHistory.T -> ProofHistory.T
    77   val export_chain: Comment.text -> ProofHistory.T -> ProofHistory.T
    78   val fix: ((string list * string option) * Comment.text) list -> ProofHistory.T -> ProofHistory.T
    79   val fix_i: ((string list * typ option) * Comment.text) list -> ProofHistory.T -> ProofHistory.T
    80   val match_bind: ((string list * string) * Comment.text) list -> ProofHistory.T -> ProofHistory.T
    81   val match_bind_i: ((term list * term) * Comment.text) list -> ProofHistory.T -> ProofHistory.T
    82   val invoke_case: string * Comment.text -> ProofHistory.T -> ProofHistory.T
    83   val theorem: (bstring * Args.src list * (string * (string list * string list)))
    84     * Comment.text -> bool -> theory -> ProofHistory.T
    85   val theorem_i: (bstring * theory attribute list * (term * (term list * term list)))
    86     * Comment.text -> bool -> theory -> ProofHistory.T
    87   val lemma: (bstring * Args.src list * (string * (string list * string list)))
    88     * Comment.text -> bool -> theory -> ProofHistory.T
    89   val lemma_i: (bstring * theory attribute list * (term * (term list * term list)))
    90     * Comment.text -> bool -> theory -> ProofHistory.T
    91   val assume: ((string * Args.src list * (string * (string list * string list)) list)
    92     * Comment.text) list -> ProofHistory.T -> ProofHistory.T
    93   val assume_i: ((string * Proof.context attribute list * (term * (term list * term list)) list)
    94     * Comment.text) list -> ProofHistory.T -> ProofHistory.T
    95   val presume: ((string * Args.src list * (string * (string list * string list)) list)
    96     * Comment.text) list -> ProofHistory.T -> ProofHistory.T
    97   val presume_i: ((string * Proof.context attribute list * (term * (term list * term list)) list)
    98     * Comment.text) list -> ProofHistory.T -> ProofHistory.T
    99   val local_def: (string * Args.src list * ((string * string option) * (string * string list)))
   100     * Comment.text -> ProofHistory.T -> ProofHistory.T
   101   val local_def_i: (string * Args.src list * ((string * typ option) * (term * term list)))
   102     * Comment.text -> ProofHistory.T -> ProofHistory.T
   103   val show: (string * Args.src list * (string * (string list * string list)))
   104     * Comment.text -> ProofHistory.T -> ProofHistory.T
   105   val show_i: (string * Proof.context attribute list * (term * (term list * term list)))
   106     * Comment.text -> ProofHistory.T -> ProofHistory.T
   107   val have: (string * Args.src list * (string * (string list * string list)))
   108     * Comment.text -> ProofHistory.T -> ProofHistory.T
   109   val have_i: (string * Proof.context attribute list * (term * (term list * term list)))
   110     * Comment.text -> ProofHistory.T -> ProofHistory.T
   111   val thus: (string * Args.src list * (string * (string list * string list)))
   112     * Comment.text -> ProofHistory.T -> ProofHistory.T
   113   val thus_i: (string * Proof.context attribute list * (term * (term list * term list)))
   114     * Comment.text -> ProofHistory.T -> ProofHistory.T
   115   val hence: (string * Args.src list * (string * (string list * string list)))
   116     * Comment.text -> ProofHistory.T -> ProofHistory.T
   117   val hence_i: (string * Proof.context attribute list * (term * (term list * term list)))
   118     * Comment.text -> ProofHistory.T -> ProofHistory.T
   119   val begin_block: ProofHistory.T -> ProofHistory.T
   120   val next_block: ProofHistory.T -> ProofHistory.T
   121   val end_block: ProofHistory.T -> ProofHistory.T
   122   val defer: int option -> ProofHistory.T -> ProofHistory.T
   123   val prefer: int -> ProofHistory.T -> ProofHistory.T
   124   val apply: Method.text -> ProofHistory.T -> ProofHistory.T
   125   val apply_end: Method.text -> ProofHistory.T -> ProofHistory.T
   126   val proof: (Comment.interest * (Method.text * Comment.interest) option) * Comment.text
   127     -> ProofHistory.T -> ProofHistory.T
   128   val qed: (Method.text * Comment.interest) option * Comment.text
   129     -> Toplevel.transition -> Toplevel.transition
   130   val terminal_proof: ((Method.text * Comment.interest) * (Method.text * Comment.interest) option)
   131     * Comment.text -> Toplevel.transition -> Toplevel.transition
   132   val immediate_proof: Comment.text -> Toplevel.transition -> Toplevel.transition
   133   val default_proof: Comment.text -> Toplevel.transition -> Toplevel.transition
   134   val skip_proof: Comment.text -> Toplevel.transition -> Toplevel.transition
   135   val forget_proof: Comment.text -> Toplevel.transition -> Toplevel.transition
   136   val get_thmss: (string * Args.src list) list -> Proof.state -> thm list
   137   val also: ((string * Args.src list) list * Comment.interest) option * Comment.text
   138     -> Toplevel.transition -> Toplevel.transition
   139   val also_i: (thm list * Comment.interest) option * Comment.text
   140     -> Toplevel.transition -> Toplevel.transition
   141   val finally: ((string * Args.src list) list * Comment.interest) option * Comment.text
   142     -> Toplevel.transition -> Toplevel.transition
   143   val finally_i: (thm list * Comment.interest) option * Comment.text
   144     -> Toplevel.transition -> Toplevel.transition
   145   val parse_ast_translation: string -> theory -> theory
   146   val parse_translation: string -> theory -> theory
   147   val print_translation: string -> theory -> theory
   148   val typed_print_translation: string -> theory -> theory
   149   val print_ast_translation: string -> theory -> theory
   150   val token_translation: string -> theory -> theory
   151   val add_oracle: (bstring * string) * Comment.text -> theory -> theory
   152   val begin_theory: string -> string list -> (string * bool) list -> theory
   153   val end_theory: theory -> theory
   154   val kill_theory: string -> unit
   155   val theory: string * string list * (string * bool) list
   156     -> Toplevel.transition -> Toplevel.transition
   157   val init_context: ('a -> unit) -> 'a -> Toplevel.transition -> Toplevel.transition
   158   val context: string -> Toplevel.transition -> Toplevel.transition
   159 end;
   160 
   161 structure IsarThy: ISAR_THY =
   162 struct
   163 
   164 
   165 (** derived theory and proof operations **)
   166 
   167 (* markup commands *)
   168 
   169 fun add_header comment =
   170   Toplevel.keep (fn state => if Toplevel.is_toplevel state then () else raise Toplevel.UNDEF);
   171 
   172 fun add_text _ x = x;
   173 fun add_text_raw _ x = x;
   174 
   175 fun add_heading add present txt thy =
   176   (Context.setmp (Some thy) present (Comment.string_of txt); add txt thy);
   177 
   178 val add_chapter = add_heading add_text Present.section;
   179 val add_section = add_heading add_text Present.section;
   180 val add_subsection = add_heading add_text Present.subsection;
   181 val add_subsubsection = add_heading add_text Present.subsubsection;
   182 
   183 fun add_txt (_: Comment.text) = ProofHistory.apply I;
   184 val add_txt_raw = add_txt;
   185 val add_sect = add_txt;
   186 val add_subsect = add_txt;
   187 val add_subsubsect = add_txt;
   188 
   189 
   190 (* signature and syntax *)
   191 
   192 val add_classes = Theory.add_classes o Comment.ignore;
   193 val add_classes_i = Theory.add_classes_i o Comment.ignore;
   194 val add_classrel = Theory.add_classrel o single o Comment.ignore;
   195 val add_classrel_i = Theory.add_classrel_i o single o Comment.ignore;
   196 val add_defsort = Theory.add_defsort o Comment.ignore;
   197 val add_defsort_i = Theory.add_defsort_i o Comment.ignore;
   198 val add_nonterminals = Theory.add_nonterminals o map Comment.ignore;
   199 val add_tyabbrs = Theory.add_tyabbrs o map Comment.ignore;
   200 val add_tyabbrs_i = Theory.add_tyabbrs_i o map Comment.ignore;
   201 val add_arities = Theory.add_arities o map Comment.ignore;
   202 val add_arities_i = Theory.add_arities_i o map Comment.ignore;
   203 val add_typedecl = PureThy.add_typedecls o single o Comment.ignore;
   204 val add_consts = Theory.add_consts o map Comment.ignore;
   205 val add_consts_i = Theory.add_consts_i o map Comment.ignore;
   206 fun add_modesyntax mode = Theory.add_modesyntax mode o map Comment.ignore;
   207 fun add_modesyntax_i mode = Theory.add_modesyntax_i mode o map Comment.ignore;
   208 val add_trrules = Theory.add_trrules o map Comment.ignore;
   209 val add_trrules_i = Theory.add_trrules_i o map Comment.ignore;
   210 val add_judgment = AutoBind.add_judgment o Comment.ignore;
   211 val add_judgment_i = AutoBind.add_judgment_i o Comment.ignore;
   212 
   213 
   214 (* axioms and defs *)
   215 
   216 fun add_axms f args thy =
   217   f (map (fn (x, srcs) => (x, map (Attrib.global_attribute thy) srcs)) args) thy;
   218 
   219 val add_axioms = add_axms (#1 oo PureThy.add_axioms) o map Comment.ignore;
   220 val add_axioms_i = (#1 oo PureThy.add_axioms_i) o map Comment.ignore;
   221 val add_defs = add_axms (#1 oo PureThy.add_defs) o map Comment.ignore;
   222 val add_defs_i = (#1 oo PureThy.add_defs_i) o map Comment.ignore;
   223 
   224 
   225 (* constdefs *)
   226 
   227 fun gen_add_constdefs consts defs args thy =
   228   thy
   229   |> consts (map (Comment.ignore o fst) args)
   230   |> defs (map (fn (((c, _, mx), _), (s, _)) =>
   231     (((Thm.def_name (Syntax.const_name c mx), s), []), Comment.none)) args);
   232 
   233 fun add_constdefs args = gen_add_constdefs Theory.add_consts add_defs args;
   234 fun add_constdefs_i args = gen_add_constdefs Theory.add_consts_i add_defs_i args;
   235 
   236 
   237 (* theorems *)
   238 
   239 fun gen_have_thmss get attrib f ((name, more_srcs), th_srcs) x =
   240   f name (map (attrib x) more_srcs)
   241     (map (fn (s, srcs) => (get x s, map (attrib x) srcs)) th_srcs) x;
   242 
   243 fun global_have_thmss kind f (x as ((name, _), _)) thy =
   244   let val (thy', thms) = gen_have_thmss PureThy.get_thms Attrib.global_attribute f x thy in
   245     if kind <> "" then Context.setmp (Some thy') (Present.results kind name) thms else ();
   246     (thy', thms)
   247   end;
   248 
   249 fun local_have_thmss x =
   250   gen_have_thmss (ProofContext.get_thms o Proof.context_of)
   251     (Attrib.local_attribute o Proof.theory_of) x;
   252 
   253 fun gen_have_thmss_i f ((name, more_atts), th_atts) =
   254   f name more_atts (map (apfst single) th_atts);
   255 
   256 fun have_lemss name atts = PureThy.have_thmss name (atts @ [Drule.tag_lemma]);
   257 
   258 
   259 fun apply_theorems th_srcs = global_have_thmss "" PureThy.have_thmss (("", []), th_srcs);
   260 fun apply_theorems_i th_srcs = gen_have_thmss_i PureThy.have_thmss (("", []), th_srcs);
   261 val have_theorems = #1 oo (global_have_thmss "theorems" PureThy.have_thmss o Comment.ignore);
   262 val have_theorems_i = #1 oo (gen_have_thmss_i PureThy.have_thmss o Comment.ignore);
   263 val have_lemmas = #1 oo (global_have_thmss "lemmas" have_lemss o Comment.ignore);
   264 val have_lemmas_i = #1 oo (gen_have_thmss_i have_lemss o Comment.ignore);
   265 val have_facts = ProofHistory.apply o local_have_thmss (Proof.have_thmss []) o Comment.ignore;
   266 val have_facts_i = ProofHistory.apply o gen_have_thmss_i (Proof.have_thmss []) o Comment.ignore;
   267 
   268 
   269 (* forward chaining *)
   270 
   271 fun gen_from_facts f = ProofHistory.apply o (Proof.chain oo curry f ("", []));
   272 
   273 fun add_thmss name atts ths_atts state =
   274   Proof.have_thmss (Proof.the_facts state) name atts ths_atts state;
   275 
   276 val from_facts = gen_from_facts (local_have_thmss (Proof.have_thmss [])) o Comment.ignore;
   277 val from_facts_i = gen_from_facts (gen_have_thmss_i (Proof.have_thmss [])) o Comment.ignore;
   278 val with_facts = gen_from_facts (local_have_thmss add_thmss) o Comment.ignore;
   279 val with_facts_i = gen_from_facts (gen_have_thmss_i add_thmss) o Comment.ignore;
   280 
   281 fun chain comment_ignore = ProofHistory.apply Proof.chain;
   282 fun export_chain comment_ignore = ProofHistory.applys Proof.export_chain;
   283 
   284 
   285 (* context *)
   286 
   287 val fix = ProofHistory.apply o Proof.fix o map Comment.ignore;
   288 val fix_i = ProofHistory.apply o Proof.fix_i o map Comment.ignore;
   289 val match_bind = ProofHistory.apply o Proof.match_bind o map Comment.ignore;
   290 val match_bind_i = ProofHistory.apply o Proof.match_bind_i o map Comment.ignore;
   291 val invoke_case = ProofHistory.apply o Proof.invoke_case o Comment.ignore;
   292 
   293 
   294 (* statements *)
   295 
   296 local
   297 
   298 fun global_statement f (name, src, s) int thy =
   299   ProofHistory.init (Toplevel.undo_limit int)
   300     (f name (map (Attrib.global_attribute thy) src) s thy);
   301 
   302 fun global_statement_i f (name, atts, t) int thy =
   303   ProofHistory.init (Toplevel.undo_limit int) (f name atts t thy);
   304 
   305 fun local_statement f g (name, src, s) = ProofHistory.apply (fn state =>
   306   f name (map (Attrib.local_attribute (Proof.theory_of state)) src) s (g state));
   307 
   308 fun local_statement_i f g (name, atts, t) = ProofHistory.apply (f name atts t o g);
   309 
   310 fun multi_local_attribute state (name, src, s) =
   311   (name, map (Attrib.local_attribute (Proof.theory_of state)) src, s);
   312 
   313 fun multi_statement f args = ProofHistory.apply (fn state =>
   314   f (map (multi_local_attribute state) args) state);
   315 
   316 fun multi_statement_i f args = ProofHistory.apply (f args);
   317 
   318 in
   319 
   320 val theorem     = global_statement Proof.theorem o Comment.ignore;
   321 val theorem_i   = global_statement_i Proof.theorem_i o Comment.ignore;
   322 val lemma       = global_statement Proof.lemma o Comment.ignore;
   323 val lemma_i     = global_statement_i Proof.lemma_i o Comment.ignore;
   324 val assume      = multi_statement Proof.assume o map Comment.ignore;
   325 val assume_i    = multi_statement_i Proof.assume_i o map Comment.ignore;
   326 val presume     = multi_statement Proof.presume o map Comment.ignore;
   327 val presume_i   = multi_statement_i Proof.presume_i o map Comment.ignore;
   328 val local_def   = local_statement LocalDefs.def I o Comment.ignore;
   329 val local_def_i = local_statement LocalDefs.def_i I o Comment.ignore;
   330 val show        = local_statement (Proof.show Seq.single) I o Comment.ignore;
   331 val show_i      = local_statement_i (Proof.show_i Seq.single) I o Comment.ignore;
   332 val have        = local_statement (Proof.have Seq.single) I o Comment.ignore;
   333 val have_i      = local_statement_i (Proof.have_i Seq.single) I o Comment.ignore;
   334 val thus        = local_statement (Proof.show Seq.single) Proof.chain o Comment.ignore;
   335 val thus_i      = local_statement_i (Proof.show_i Seq.single) Proof.chain o Comment.ignore;
   336 val hence       = local_statement (Proof.have Seq.single) Proof.chain o Comment.ignore;
   337 val hence_i     = local_statement_i (Proof.have_i Seq.single) Proof.chain o Comment.ignore;
   338 
   339 end;
   340 
   341 
   342 (* blocks *)
   343 
   344 val begin_block = ProofHistory.apply Proof.begin_block;
   345 val next_block = ProofHistory.apply Proof.next_block;
   346 val end_block = ProofHistory.applys Proof.end_block;
   347 
   348 
   349 (* shuffle state *)
   350 
   351 fun shuffle meth i = Method.refine (Method.Basic (K (meth i))) o Proof.assert_no_chain;
   352 
   353 fun defer i = ProofHistory.applys (shuffle Method.defer i);
   354 fun prefer i = ProofHistory.applys (shuffle Method.prefer i);
   355 
   356 
   357 (* backward steps *)
   358 
   359 fun apply m = ProofHistory.applys (Method.refine m o Proof.assert_backward);
   360 fun apply_end m = ProofHistory.applys (Method.refine_end m o Proof.assert_forward);
   361 
   362 val proof = ProofHistory.applys o Method.proof o
   363   apsome Comment.ignore_interest o Comment.ignore_interest' o Comment.ignore;
   364 
   365 
   366 (* print result *)
   367 
   368 local
   369 
   370 fun pretty_result {kind, name, thm} =
   371   Pretty.block [Pretty.str (kind ^ (if name = "" then "" else " " ^ name) ^ ":"),
   372     Pretty.fbrk, Proof.pretty_thm thm];
   373 
   374 fun pretty_rule thm =
   375   Pretty.block [Pretty.str "trying to solve goal by rule:", Pretty.fbrk, Proof.pretty_thm thm];
   376 
   377 in
   378 
   379 val print_result = Pretty.writeln o pretty_result;
   380 
   381 fun cond_print_result_rule int =
   382   if int then (print_result, Pretty.writeln o pretty_rule)
   383   else (K (), K ());
   384 
   385 fun proof'' f = Toplevel.proof' (f o cond_print_result_rule);
   386 
   387 end;
   388 
   389 
   390 (* local endings *)
   391 
   392 val local_qed =
   393   proof'' o (ProofHistory.applys oo Method.local_qed) o apsome Comment.ignore_interest;
   394 
   395 fun ignore_interests (x, y) = (Comment.ignore_interest x, apsome Comment.ignore_interest y);
   396 
   397 val local_terminal_proof =
   398   proof'' o (ProofHistory.applys oo Method.local_terminal_proof) o ignore_interests;
   399 
   400 val local_immediate_proof = proof'' (ProofHistory.applys o Method.local_immediate_proof);
   401 val local_default_proof = proof'' (ProofHistory.applys o Method.local_default_proof);
   402 val local_skip_proof = proof'' (ProofHistory.applys o SkipProof.local_skip_proof);
   403 
   404 
   405 (* global endings *)
   406 
   407 fun global_result finish = Toplevel.proof_to_theory (fn prf =>
   408   let
   409     val state = ProofHistory.current prf;
   410     val _ = if Proof.at_bottom state then () else raise Toplevel.UNDEF;
   411     val (thy, res as {kind, name, thm}) = finish state;
   412   in print_result res; Context.setmp (Some thy) (Present.result kind name) thm; thy end);
   413 
   414 val global_qed = global_result o Method.global_qed o apsome Comment.ignore_interest;
   415 val global_terminal_proof = global_result o Method.global_terminal_proof o ignore_interests;
   416 val global_immediate_proof = global_result Method.global_immediate_proof;
   417 val global_default_proof = global_result Method.global_default_proof;
   418 val global_skip_proof = global_result SkipProof.global_skip_proof;
   419 
   420 
   421 (* common endings *)
   422 
   423 fun qed (meth, comment) = local_qed meth o global_qed meth;
   424 fun terminal_proof (meths, comment) = local_terminal_proof meths o global_terminal_proof meths;
   425 fun immediate_proof comment = local_immediate_proof o global_immediate_proof;
   426 fun default_proof comment = local_default_proof o global_default_proof;
   427 fun skip_proof comment = local_skip_proof o global_skip_proof;
   428 
   429 fun forget_proof comment = Toplevel.proof_to_theory (Proof.theory_of o ProofHistory.current);
   430 
   431 
   432 (* calculational proof commands *)
   433 
   434 local
   435 
   436 fun cond_print_calc int thms =
   437   if int then Pretty.writeln (Pretty.big_list "calculation:" (map Proof.pretty_thm thms))
   438   else ();
   439 
   440 fun proof''' f = Toplevel.proof' (f o cond_print_calc);
   441 
   442 fun gen_calc get f (args, _) prt state =
   443   f (apsome (fn (srcs, _) => get srcs state) args) prt state;
   444 
   445 in
   446 
   447 fun get_thmss srcs = Proof.the_facts o local_have_thmss (Proof.have_thmss []) (("", []), srcs); 
   448 fun get_thmss_i thms _ = thms;
   449 
   450 fun also x = proof''' (ProofHistory.applys o gen_calc get_thmss Calculation.also x);
   451 fun also_i x = proof''' (ProofHistory.applys o gen_calc get_thmss_i Calculation.also x);
   452 fun finally x = proof''' (ProofHistory.applys o gen_calc get_thmss Calculation.finally x);
   453 fun finally_i x = proof''' (ProofHistory.applys o gen_calc get_thmss_i Calculation.finally x);
   454 
   455 end;
   456 
   457 
   458 (* translation functions *)
   459 
   460 val parse_ast_translation =
   461   Context.use_let "parse_ast_translation: (string * (Syntax.ast list -> Syntax.ast)) list"
   462     "Theory.add_trfuns (parse_ast_translation, [], [], [])";
   463 
   464 val parse_translation =
   465   Context.use_let "parse_translation: (string * (term list -> term)) list"
   466     "Theory.add_trfuns ([], parse_translation, [], [])";
   467 
   468 val print_translation =
   469   Context.use_let "print_translation: (string * (term list -> term)) list"
   470     "Theory.add_trfuns ([], [], print_translation, [])";
   471 
   472 val print_ast_translation =
   473   Context.use_let "print_ast_translation: (string * (Syntax.ast list -> Syntax.ast)) list"
   474     "Theory.add_trfuns ([], [], [], print_ast_translation)";
   475 
   476 val typed_print_translation =
   477   Context.use_let "typed_print_translation: (string * (bool -> typ -> term list -> term)) list"
   478     "Theory.add_trfunsT typed_print_translation";
   479 
   480 val token_translation =
   481   Context.use_let "token_translation: (string * string * (string -> string * int)) list"
   482     "Theory.add_tokentrfuns token_translation";
   483 
   484 
   485 (* add_oracle *)
   486 
   487 fun add_oracle ((name, txt), comment_ignore) =
   488   Context.use_let
   489     "oracle: bstring * (Sign.sg * Object.T -> term)"
   490     "Theory.add_oracle oracle"
   491     ("(" ^ quote name ^ ", " ^ txt ^ ")");
   492 
   493 
   494 (* theory init and exit *)
   495 
   496 fun gen_begin_theory bg name parents files =
   497   let
   498     val paths = map (apfst Path.unpack) files;
   499     val thy = bg name parents paths;
   500   in Present.begin_theory name parents paths thy end;
   501 
   502 val begin_theory = gen_begin_theory ThyInfo.begin_theory;
   503 val begin_update_theory = gen_begin_theory ThyInfo.begin_update_theory;
   504 
   505 fun end_theory thy =
   506   if ThyInfo.check_known_thy (PureThy.get_name thy) then ThyInfo.end_theory thy
   507   else thy;
   508 
   509 val kill_theory = ThyInfo.if_known_thy ThyInfo.remove_thy;
   510 
   511 
   512 fun bg_theory (name, parents, files) int =
   513   (if int then begin_update_theory else begin_theory) name parents files;
   514 
   515 fun en_theory thy = (end_theory thy; ());
   516 
   517 fun theory spec = Toplevel.init_theory (bg_theory spec) en_theory (kill_theory o PureThy.get_name);
   518 
   519 
   520 (* context switch *)
   521 
   522 fun fetch_context f x =
   523   (case Context.pass None f x of
   524     ((), None) => raise Toplevel.UNDEF
   525   | ((), Some thy) => thy);
   526 
   527 fun init_context f x = Toplevel.init_theory (fn _ => fetch_context f x) (K ()) (K ());
   528 
   529 val context = init_context (ThyInfo.quiet_update_thy true);
   530 
   531 
   532 end;