src/Pure/Isar/isar_thy.ML
author wenzelm
Sat Jul 03 00:22:53 1999 +0200 (1999-07-03 ago)
changeset 6890 05732285677e
parent 6888 d0c68ebdabc5
child 6904 4125d6b6d8f9
permissions -rw-r--r--
fixed 'txt';
     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_txt: Comment.text -> ProofHistory.T -> ProofHistory.T
    11   val add_text: Comment.text -> theory -> theory
    12   val add_title: Comment.text -> Comment.text -> Comment.text -> theory -> theory
    13   val add_chapter: Comment.text -> theory -> theory
    14   val add_section: Comment.text -> theory -> theory
    15   val add_subsection: Comment.text -> theory -> theory
    16   val add_subsubsection: Comment.text -> theory -> theory
    17   val add_classes: (bclass * xclass list) list * Comment.text -> theory -> theory
    18   val add_classes_i: (bclass * class list) list * Comment.text  -> theory -> theory
    19   val add_classrel: (xclass * xclass) * Comment.text -> theory -> theory
    20   val add_classrel_i: (class * class) * Comment.text -> theory -> theory
    21   val add_defsort: xsort * Comment.text -> theory -> theory
    22   val add_defsort_i: sort * Comment.text -> theory -> theory
    23   val add_nonterminals: (bstring * Comment.text) list -> theory -> theory
    24   val add_tyabbrs: ((bstring * string list * string * mixfix) * Comment.text) list
    25     -> theory -> theory
    26   val add_tyabbrs_i: ((bstring * string list * typ * mixfix) * Comment.text) list
    27     -> theory -> theory
    28   val add_arities: ((xstring * xsort list * xsort) * Comment.text) list -> theory -> theory
    29   val add_arities_i: ((string * sort list * sort) * Comment.text) list -> theory -> theory
    30   val add_typedecl: (bstring * string list * mixfix) * Comment.text -> theory -> theory
    31   val add_consts: ((bstring * string * mixfix) * Comment.text) list -> theory -> theory
    32   val add_consts_i: ((bstring * typ * mixfix) * Comment.text) list -> theory -> theory
    33   val add_modesyntax: string * bool -> ((bstring * string * mixfix) * Comment.text) list
    34     -> theory -> theory
    35   val add_modesyntax_i: string * bool -> ((bstring * typ * mixfix) * Comment.text) list
    36     -> theory -> theory
    37   val add_trrules: ((xstring * string) Syntax.trrule * Comment.text) list -> theory -> theory
    38   val add_trrules_i: (Syntax.ast Syntax.trrule * Comment.text) list -> theory -> theory
    39   val add_axioms: (((bstring * string) * Args.src list) * Comment.text) list -> theory -> theory
    40   val add_axioms_i: (((bstring * term) * theory attribute list) * Comment.text) list
    41     -> theory -> theory
    42   val add_defs: (((bstring * string) * Args.src list) * Comment.text) list -> theory -> theory
    43   val add_defs_i: (((bstring * term) * theory attribute list) * Comment.text) list
    44     -> theory -> theory
    45   val add_constdefs: (((bstring * string * mixfix) * Comment.text) * (string * Comment.text)) list
    46     -> theory -> theory
    47   val add_constdefs_i: (((bstring * typ * mixfix) * Comment.text) * (term * Comment.text)) list
    48     -> theory -> theory
    49   val apply_theorems: (xstring * Args.src list) list -> theory -> theory * thm list
    50   val apply_theorems_i: (thm * theory attribute list) list -> theory -> theory * thm list
    51   val have_theorems: ((bstring * Args.src list) * (xstring * Args.src list) list) * Comment.text
    52     -> theory -> theory
    53   val have_theorems_i: ((bstring * theory attribute list) * (thm * theory attribute list) list)
    54     * Comment.text -> theory -> theory
    55   val have_lemmas: ((bstring * Args.src list) * (xstring * Args.src list) list) * Comment.text
    56     -> theory -> theory
    57   val have_lemmas_i: ((bstring * theory attribute list) * (thm * theory attribute list) list)
    58     * Comment.text -> theory -> theory
    59   val have_facts: ((string * Args.src list) * (string * Args.src list) list) * Comment.text
    60     -> ProofHistory.T -> ProofHistory.T
    61   val have_facts_i: ((string * Proof.context attribute list) *
    62     (thm * Proof.context attribute list) list) * Comment.text -> ProofHistory.T -> ProofHistory.T
    63   val from_facts: (string * Args.src list) list * Comment.text -> ProofHistory.T -> ProofHistory.T
    64   val from_facts_i: (thm * Proof.context attribute list) list * Comment.text
    65     -> ProofHistory.T -> ProofHistory.T
    66   val with_facts: (string * Args.src list) list * Comment.text -> ProofHistory.T -> ProofHistory.T
    67   val with_facts_i: (thm * Proof.context attribute list) list * Comment.text
    68     -> ProofHistory.T -> ProofHistory.T
    69   val chain: Comment.text -> ProofHistory.T -> ProofHistory.T
    70   val fix: (string * string option) list * Comment.text -> ProofHistory.T -> ProofHistory.T
    71   val fix_i: (string * typ) list * Comment.text -> ProofHistory.T -> ProofHistory.T
    72   val match_bind: ((string list * string) * Comment.text) list -> ProofHistory.T -> ProofHistory.T
    73   val match_bind_i: ((term list * term) * Comment.text) list -> ProofHistory.T -> ProofHistory.T
    74   val theorem: (bstring * Args.src list * (string * string list)) * Comment.text
    75     -> bool -> theory -> ProofHistory.T
    76   val theorem_i: (bstring * theory attribute list * (term * term list)) * Comment.text
    77     -> bool -> theory -> ProofHistory.T
    78   val lemma: (bstring * Args.src list * (string * string list)) * Comment.text
    79     -> bool -> theory -> ProofHistory.T
    80   val lemma_i: (bstring * theory attribute list * (term * term list)) * Comment.text
    81     -> bool -> theory -> ProofHistory.T
    82   val assume: (string * Args.src list * (string * string list) list) * Comment.text
    83     -> ProofHistory.T -> ProofHistory.T
    84   val assume_i: (string * Proof.context attribute list * (term * term list) list) * Comment.text
    85     -> ProofHistory.T -> ProofHistory.T
    86   val presume: (string * Args.src list * (string * string list) list) * Comment.text
    87     -> ProofHistory.T -> ProofHistory.T
    88   val presume_i: (string * Proof.context attribute list * (term * term list) list) * Comment.text
    89     -> ProofHistory.T -> ProofHistory.T
    90   val show: (string * Args.src list * (string * string list)) * Comment.text
    91     -> ProofHistory.T -> ProofHistory.T
    92   val show_i: (string * Proof.context attribute list * (term * term list)) * Comment.text
    93     -> ProofHistory.T -> ProofHistory.T
    94   val have: (string * Args.src list * (string * string list)) * Comment.text
    95     -> ProofHistory.T -> ProofHistory.T
    96   val have_i: (string * Proof.context attribute list * (term * term list)) * Comment.text
    97     -> ProofHistory.T -> ProofHistory.T
    98   val thus: (string * Args.src list * (string * string list)) * Comment.text
    99     -> ProofHistory.T -> ProofHistory.T
   100   val thus_i: (string * Proof.context attribute list * (term * term list)) * Comment.text
   101     -> ProofHistory.T -> ProofHistory.T
   102   val hence: (string * Args.src list * (string * string list)) * Comment.text
   103     -> ProofHistory.T -> ProofHistory.T
   104   val hence_i: (string * Proof.context attribute list * (term * term list)) * Comment.text
   105     -> ProofHistory.T -> ProofHistory.T
   106   val begin_block: ProofHistory.T -> ProofHistory.T
   107   val next_block: ProofHistory.T -> ProofHistory.T
   108   val end_block: ProofHistory.T -> ProofHistory.T
   109   val tac: Method.text -> ProofHistory.T -> ProofHistory.T
   110   val then_tac: Method.text -> ProofHistory.T -> ProofHistory.T
   111   val proof: Comment.interest * (Method.text * Comment.interest) option
   112     -> ProofHistory.T -> ProofHistory.T
   113   val kill_proof: ProofHistory.T -> theory
   114   val global_qed_with: bstring option * Args.src list option
   115     -> (Method.text * Comment.interest) option
   116     -> Toplevel.transition -> Toplevel.transition
   117   val global_qed_with_i: bstring option * theory attribute list option
   118     -> (Method.text * Comment.interest) option
   119     -> Toplevel.transition -> Toplevel.transition
   120   val qed: (Method.text * Comment.interest) option -> Toplevel.transition -> Toplevel.transition
   121   val terminal_proof: Method.text * Comment.interest -> Toplevel.transition -> Toplevel.transition
   122   val immediate_proof: Toplevel.transition -> Toplevel.transition
   123   val default_proof: Toplevel.transition -> Toplevel.transition
   124   val skip_proof: Toplevel.transition -> Toplevel.transition
   125   val also: ((string * Args.src list) list * Comment.interest) option * Comment.text
   126     -> Toplevel.transition -> Toplevel.transition
   127   val also_i: (thm list * Comment.interest) option * Comment.text
   128     -> Toplevel.transition -> Toplevel.transition
   129   val finally: ((string * Args.src list) list * Comment.interest) option * Comment.text
   130     -> Toplevel.transition -> Toplevel.transition
   131   val finally_i: (thm list * Comment.interest) option * Comment.text
   132     -> Toplevel.transition -> Toplevel.transition
   133   val use_mltext: string -> theory option -> theory option
   134   val use_mltext_theory: string -> theory -> theory
   135   val use_setup: string -> theory -> theory
   136   val parse_ast_translation: string -> theory -> theory
   137   val parse_translation: string -> theory -> theory
   138   val print_translation: string -> theory -> theory
   139   val typed_print_translation: string -> theory -> theory
   140   val print_ast_translation: string -> theory -> theory
   141   val token_translation: string -> theory -> theory
   142   val add_oracle: (bstring * string) * Comment.text -> theory -> theory
   143   val begin_theory: string -> string list -> (string * bool) list -> theory
   144   val end_theory: theory -> theory
   145   val theory: string * string list * (string * bool) list
   146     -> Toplevel.transition -> Toplevel.transition
   147   val context: string -> Toplevel.transition -> Toplevel.transition
   148   val update_context: string -> Toplevel.transition -> Toplevel.transition
   149 end;
   150 
   151 structure IsarThy: ISAR_THY =
   152 struct
   153 
   154 
   155 (** derived theory and proof operations **)
   156 
   157 (* formal comments *)
   158 
   159 fun add_txt comment = ProofHistory.apply Proof.assert_forward;
   160 fun add_text comment thy = thy;
   161 fun add_title title author date thy = thy;
   162 val add_chapter = add_text;
   163 val add_section = add_text;
   164 val add_subsection = add_text;
   165 val add_subsubsection = add_text;
   166 
   167 
   168 (* signature and syntax *)
   169 
   170 val add_classes = Theory.add_classes o Comment.ignore;
   171 val add_classes_i = Theory.add_classes_i o Comment.ignore;
   172 val add_classrel = Theory.add_classrel o single o Comment.ignore;
   173 val add_classrel_i = Theory.add_classrel_i o single o Comment.ignore;
   174 val add_defsort = Theory.add_defsort o Comment.ignore;
   175 val add_defsort_i = Theory.add_defsort_i o Comment.ignore;
   176 val add_nonterminals = Theory.add_nonterminals o map Comment.ignore;
   177 val add_tyabbrs = Theory.add_tyabbrs o map Comment.ignore;
   178 val add_tyabbrs_i = Theory.add_tyabbrs_i o map Comment.ignore;
   179 val add_arities = Theory.add_arities o map Comment.ignore;
   180 val add_arities_i = Theory.add_arities_i o map Comment.ignore;
   181 val add_typedecl = PureThy.add_typedecls o single o Comment.ignore;
   182 val add_consts = Theory.add_consts o map Comment.ignore;
   183 val add_consts_i = Theory.add_consts_i o map Comment.ignore;
   184 fun add_modesyntax mode = Theory.add_modesyntax mode o map Comment.ignore;
   185 fun add_modesyntax_i mode = Theory.add_modesyntax_i mode o map Comment.ignore;
   186 val add_trrules = Theory.add_trrules o map Comment.ignore;
   187 val add_trrules_i = Theory.add_trrules_i o map Comment.ignore;
   188 
   189 
   190 
   191 (* axioms and defs *)
   192 
   193 fun add_axms f args thy =
   194   f (map (fn (x, srcs) => (x, map (Attrib.global_attribute thy) srcs)) args) thy;
   195 
   196 val add_axioms = add_axms PureThy.add_axioms o map Comment.ignore;
   197 val add_axioms_i = PureThy.add_axioms_i o map Comment.ignore;
   198 val add_defs = add_axms PureThy.add_defs o map Comment.ignore;
   199 val add_defs_i = PureThy.add_defs_i o map Comment.ignore;
   200 
   201 
   202 (* constdefs *)
   203 
   204 fun gen_add_constdefs consts defs args thy =
   205   thy
   206   |> consts (map (Comment.ignore o fst) args)
   207   |> defs (map (fn (((c, _, mx), _), (s, _)) =>
   208     (((Thm.def_name (Syntax.const_name c mx), s), []), Comment.none)) args);
   209 
   210 fun add_constdefs args = gen_add_constdefs Theory.add_consts add_defs args;
   211 fun add_constdefs_i args = gen_add_constdefs Theory.add_consts_i add_defs_i args;
   212 
   213 
   214 (* theorems *)
   215 
   216 fun gen_have_thmss get attrib f ((name, more_srcs), th_srcs) x =
   217   f name (map (attrib x) more_srcs)
   218     (map (fn (s, srcs) => (get x s, map (attrib x) srcs)) th_srcs) x;
   219 
   220 fun global_have_thmss x = gen_have_thmss PureThy.get_thms Attrib.global_attribute x;
   221 
   222 fun local_have_thmss x =
   223   gen_have_thmss (ProofContext.get_thms o Proof.context_of)
   224     (Attrib.local_attribute o Proof.theory_of) x;
   225 
   226 fun have_thmss_i f ((name, more_atts), th_atts) =
   227   f name more_atts (map (apfst single) th_atts);
   228 
   229 fun have_lemss name atts = PureThy.have_thmss name (atts @ [Drule.tag_lemma]);
   230 
   231 
   232 fun apply_theorems th_srcs = global_have_thmss PureThy.have_thmss ((None, []), th_srcs);
   233 fun apply_theorems_i th_srcs = have_thmss_i PureThy.have_thmss ((None, []), th_srcs);
   234 val have_theorems = #1 oo (global_have_thmss (PureThy.have_thmss o Some) o Comment.ignore);
   235 val have_theorems_i = #1 oo (have_thmss_i (PureThy.have_thmss o Some) o Comment.ignore);
   236 val have_lemmas = #1 oo (global_have_thmss (have_lemss o Some) o Comment.ignore);
   237 val have_lemmas_i = #1 oo (have_thmss_i (have_lemss o Some) o Comment.ignore);
   238 val have_facts = ProofHistory.apply o local_have_thmss (Proof.have_thmss []) o Comment.ignore;
   239 val have_facts_i = ProofHistory.apply o have_thmss_i (Proof.have_thmss []) o Comment.ignore;
   240 
   241 
   242 (* forward chaining *)
   243 
   244 fun gen_from_facts f = ProofHistory.apply o (Proof.chain oo curry f ("", []));
   245 
   246 fun add_thmss name atts ths_atts state =
   247   Proof.have_thmss (Proof.the_facts state) name atts ths_atts state;
   248 
   249 val from_facts = gen_from_facts (local_have_thmss (Proof.have_thmss [])) o Comment.ignore;
   250 val from_facts_i = gen_from_facts (have_thmss_i (Proof.have_thmss [])) o Comment.ignore;
   251 val with_facts = gen_from_facts (local_have_thmss add_thmss) o Comment.ignore;
   252 val with_facts_i = gen_from_facts (have_thmss_i add_thmss) o Comment.ignore;
   253 
   254 fun chain comment_ignore = ProofHistory.apply Proof.chain;
   255 
   256 
   257 (* context *)
   258 
   259 val fix = ProofHistory.apply o Proof.fix o Comment.ignore;
   260 val fix_i = ProofHistory.apply o Proof.fix_i o Comment.ignore;
   261 val match_bind = ProofHistory.apply o Proof.match_bind o map Comment.ignore;
   262 val match_bind_i = ProofHistory.apply o Proof.match_bind_i o map Comment.ignore;
   263 
   264 
   265 (* statements *)
   266 
   267 fun global_statement f (name, src, s) int thy =
   268   ProofHistory.init (Toplevel.undo_limit int)
   269     (f name (map (Attrib.global_attribute thy) src) s thy);
   270 
   271 fun global_statement_i f (name, atts, t) int thy =
   272   ProofHistory.init (Toplevel.undo_limit int) (f name atts t thy);
   273 
   274 fun local_statement do_open f g (name, src, s) = ProofHistory.apply_cond_open do_open (fn state =>
   275   f name (map (Attrib.local_attribute (Proof.theory_of state)) src) s (g state));
   276 
   277 fun local_statement_i do_open f g (name, atts, t) =
   278   ProofHistory.apply_cond_open do_open (f name atts t o g);
   279 
   280 val theorem   = global_statement Proof.theorem o Comment.ignore;
   281 val theorem_i = global_statement_i Proof.theorem_i o Comment.ignore;
   282 val lemma     = global_statement Proof.lemma o Comment.ignore;
   283 val lemma_i   = global_statement_i Proof.lemma_i o Comment.ignore;
   284 val assume    = local_statement false (Proof.assume assume_tac) I o Comment.ignore;
   285 val assume_i  = local_statement_i false (Proof.assume_i assume_tac) I o Comment.ignore;
   286 val presume   = local_statement false (Proof.assume (K all_tac)) I o Comment.ignore;
   287 val presume_i = local_statement_i false (Proof.assume_i (K all_tac)) I o Comment.ignore;
   288 val show      = local_statement true Proof.show I o Comment.ignore;
   289 val show_i    = local_statement_i true Proof.show_i I o Comment.ignore;
   290 val have      = local_statement true Proof.have I o Comment.ignore;
   291 val have_i    = local_statement_i true Proof.have_i I o Comment.ignore;
   292 val thus      = local_statement true Proof.show Proof.chain o Comment.ignore;
   293 val thus_i    = local_statement_i true Proof.show_i Proof.chain o Comment.ignore;
   294 val hence     = local_statement true Proof.have Proof.chain o Comment.ignore;
   295 val hence_i   = local_statement_i true Proof.have_i Proof.chain o Comment.ignore;
   296 
   297 
   298 (* blocks *)
   299 
   300 val begin_block = ProofHistory.apply_open Proof.begin_block;
   301 val next_block = ProofHistory.apply Proof.next_block;
   302 val end_block = ProofHistory.apply_close Proof.end_block;
   303 
   304 
   305 (* backward steps *)
   306 
   307 val tac = ProofHistory.applys o Method.tac;
   308 val then_tac = ProofHistory.applys o Method.then_tac;
   309 
   310 val proof =
   311   ProofHistory.applys o Method.proof o apsome Comment.ignore_interest o Comment.ignore_interest';
   312 
   313 
   314 (* print result *)
   315 
   316 fun pretty_result {kind, name, thm} =
   317   Pretty.block [Pretty.str (kind ^ " " ^ name ^ ":"), Pretty.fbrk, Display.pretty_thm thm];
   318 
   319 val print_result = Pretty.writeln o pretty_result;
   320 fun cond_print_result int res = if int then print_result res else ();
   321 
   322 fun proof'' f = Toplevel.proof' (f o cond_print_result);
   323 
   324 
   325 (* local endings *)
   326 
   327 val local_qed =
   328   proof'' o (ProofHistory.applys_close oo Method.local_qed) o apsome Comment.ignore_interest;
   329 
   330 val local_terminal_proof =
   331   proof'' o (ProofHistory.applys_close oo Method.local_terminal_proof) o Comment.ignore_interest;
   332 
   333 val local_immediate_proof = proof'' (ProofHistory.applys_close o Method.local_immediate_proof);
   334 val local_default_proof = proof'' (ProofHistory.applys_close o Method.local_default_proof);
   335 val local_skip_proof = proof'' (ProofHistory.applys_close o SkipProof.local_skip_proof);
   336 
   337 
   338 (* global endings *)
   339 
   340 val kill_proof = Proof.theory_of o ProofHistory.current;
   341 
   342 fun global_result finish = Toplevel.proof_to_theory (fn prf =>
   343   let
   344     val state = ProofHistory.current prf;
   345     val _ = if Proof.at_bottom state then () else raise Toplevel.UNDEF;
   346     val (thy, res) = finish state;
   347   in print_result res; thy end);
   348 
   349 fun gen_global_qed_with prep_att (alt_name, raw_atts) meth state =
   350   let
   351     val thy = Proof.theory_of state;
   352     val alt_atts = apsome (map (prep_att thy)) raw_atts;
   353   in Method.global_qed alt_name alt_atts (apsome Comment.ignore_interest meth) state end;
   354 
   355 val global_qed_with = global_result oo gen_global_qed_with Attrib.global_attribute;
   356 val global_qed_with_i = global_result oo gen_global_qed_with (K I);
   357 val global_qed = global_qed_with (None, None);
   358 
   359 val global_terminal_proof = global_result o Method.global_terminal_proof o Comment.ignore_interest;
   360 val global_immediate_proof = global_result Method.global_immediate_proof;
   361 val global_default_proof = global_result Method.global_default_proof;
   362 val global_skip_proof = global_result SkipProof.global_skip_proof;
   363 
   364 
   365 (* common endings *)
   366 
   367 fun qed meth = local_qed meth o global_qed meth;
   368 fun terminal_proof meth = local_terminal_proof meth o global_terminal_proof meth;
   369 val immediate_proof = local_immediate_proof o global_immediate_proof;
   370 val default_proof = local_default_proof o global_default_proof;
   371 val skip_proof = local_skip_proof o global_skip_proof;
   372 
   373 
   374 (* calculational proof commands *)
   375 
   376 local
   377 
   378 fun cond_print_calc int thm =
   379   if int then Pretty.writeln (Pretty.big_list "calculation:" [Display.pretty_thm thm])
   380   else ();
   381 
   382 fun proof''' f = Toplevel.proof' (f o cond_print_calc);
   383 
   384 fun get_thmss srcs = Proof.the_facts o local_have_thmss (Proof.have_thmss []) (("", []), srcs); 
   385 fun get_thmss_i thms _ = thms;
   386 
   387 fun gen_calc get f (args, _) prt state =
   388   f (apsome (fn (srcs, _) => get srcs state) args) prt state;
   389 
   390 in
   391 
   392 fun also x = proof''' (ProofHistory.applys o gen_calc get_thmss Calculation.also x);
   393 fun also_i x = proof''' (ProofHistory.applys o gen_calc get_thmss_i Calculation.also x);
   394 fun finally x = proof''' (ProofHistory.applys o gen_calc get_thmss Calculation.finally x);
   395 fun finally_i x = proof''' (ProofHistory.applys o gen_calc get_thmss_i Calculation.finally x);
   396 
   397 end;
   398 
   399 
   400 (* use ML text *)
   401 
   402 fun use_mltext txt opt_thy = #2 (Context.pass opt_thy (use_text false) txt);
   403 fun use_mltext_theory txt thy = #2 (Context.pass_theory thy (use_text false) txt);
   404 
   405 fun use_context txt = use_mltext_theory ("Context.>> (" ^ txt ^ ");");
   406 
   407 fun use_let name body txt =
   408   use_context ("let val " ^ name ^ " = " ^ txt ^ " in\n" ^ body ^ " end");
   409 
   410 val use_setup =
   411   use_let "setup: (theory -> theory) list" "Library.apply setup";
   412 
   413 
   414 (* translation functions *)
   415 
   416 val parse_ast_translation =
   417   use_let "parse_ast_translation: (string * (Syntax.ast list -> Syntax.ast)) list"
   418     "Theory.add_trfuns (parse_ast_translation, [], [], [])";
   419 
   420 val parse_translation =
   421   use_let "parse_translation: (string * (term list -> term)) list"
   422     "Theory.add_trfuns ([], parse_translation, [], [])";
   423 
   424 val print_translation =
   425   use_let "print_translation: (string * (term list -> term)) list"
   426     "Theory.add_trfuns ([], [], print_translation, [])";
   427 
   428 val print_ast_translation =
   429   use_let "print_ast_translation: (string * (Syntax.ast list -> Syntax.ast)) list"
   430     "Theory.add_trfuns ([], [], [], print_ast_translation)";
   431 
   432 val typed_print_translation =
   433   use_let "typed_print_translation: (string * (bool -> typ -> term list -> term)) list"
   434     "Theory.add_trfunsT typed_print_translation";
   435 
   436 val token_translation =
   437   use_let "token_translation: (string * string * (string -> string * int)) list"
   438     "Theory.add_tokentrfuns token_translation";
   439 
   440 
   441 (* add_oracle *)
   442 
   443 fun add_oracle ((name, txt), comment_ignore) =
   444   use_let
   445     "oracle: bstring * (Sign.sg * Object.T -> term)"
   446     "Theory.add_oracle oracle"
   447     ("(" ^ quote name ^ ", " ^ txt ^ ")");
   448 
   449 
   450 (* theory init and exit *)
   451 
   452 fun begin_theory name parents files =
   453   let
   454     val paths = map (apfst Path.unpack) files;
   455     val thy = ThyInfo.begin_theory name parents paths;
   456   in Present.begin_theory name parents paths thy end;
   457 
   458 fun end_theory thy =
   459   (Present.end_theory (PureThy.get_name thy); ThyInfo.end_theory thy);
   460 
   461 fun kill_theory thy = ThyInfo.remove_thy (PureThy.get_name thy);
   462 
   463 fun bg_theory (name, parents, files) () = begin_theory name parents files;
   464 fun en_theory thy = (end_theory thy; ());
   465 
   466 fun theory spec = Toplevel.init_theory (bg_theory spec) en_theory kill_theory;
   467 
   468 
   469 (* context switch *)
   470 
   471 fun switch_theory load s =
   472   Toplevel.init_theory (fn () => (the (#2 (Context.pass None load s)))) (K ()) (K ());
   473 
   474 val context = switch_theory ThyInfo.use_thy;
   475 val update_context = switch_theory ThyInfo.update_thy;
   476 
   477 
   478 end;