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