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