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