src/Pure/Isar/isar_thy.ML
author wenzelm
Wed Dec 05 03:18:03 2001 +0100 (2001-12-05 ago)
changeset 12385 389d11fb62c8
parent 12318 72348ff7d4a0
child 12589 afc6ffffeb11
permissions -rw-r--r--
removed unused functionality (weight etc.);
     1 (*  Title:      Pure/Isar/isar_thy.ML
     2     ID:         $Id$
     3     Author:     Markus Wenzel, TU Muenchen
     4     License:    GPL (GNU GENERAL PUBLIC LICENSE)
     5 
     6 Pure/Isar derived theory operations.
     7 *)
     8 
     9 signature ISAR_THY =
    10 sig
    11   val add_header: Comment.text -> Toplevel.transition -> Toplevel.transition
    12   val add_chapter: Comment.text -> theory -> theory
    13   val add_section: Comment.text -> theory -> theory
    14   val add_subsection: Comment.text -> theory -> theory
    15   val add_subsubsection: Comment.text -> theory -> theory
    16   val add_text: Comment.text -> theory -> theory
    17   val add_text_raw: Comment.text -> theory -> theory
    18   val add_sect: Comment.text -> ProofHistory.T -> ProofHistory.T
    19   val add_subsect: Comment.text -> ProofHistory.T -> ProofHistory.T
    20   val add_subsubsect: Comment.text -> ProofHistory.T -> ProofHistory.T
    21   val add_txt: Comment.text -> ProofHistory.T -> ProofHistory.T
    22   val add_txt_raw: Comment.text -> ProofHistory.T -> ProofHistory.T
    23   val global_path: Comment.text -> theory -> theory
    24   val local_path: Comment.text -> theory -> theory
    25   val hide_space: (string * xstring list) * Comment.text -> theory -> theory
    26   val hide_space_i: (string * string list) * Comment.text -> theory -> theory
    27   val add_classes: (bclass * xclass list) list * Comment.text -> theory -> theory
    28   val add_classes_i: (bclass * class list) list * Comment.text  -> theory -> theory
    29   val add_classrel: (xclass * xclass) * Comment.text -> theory -> theory
    30   val add_classrel_i: (class * class) * Comment.text -> theory -> theory
    31   val add_defsort: string * Comment.text -> theory -> theory
    32   val add_defsort_i: sort * Comment.text -> theory -> theory
    33   val add_nonterminals: (bstring * Comment.text) list -> theory -> theory
    34   val add_tyabbrs: ((bstring * string list * string * mixfix) * Comment.text) list
    35     -> theory -> theory
    36   val add_tyabbrs_i: ((bstring * string list * typ * mixfix) * Comment.text) list
    37     -> theory -> theory
    38   val add_arities: ((xstring * string list * string) * Comment.text) list -> theory -> theory
    39   val add_arities_i: ((string * sort list * sort) * Comment.text) list -> theory -> theory
    40   val add_typedecl: (bstring * string list * mixfix) * Comment.text -> theory -> theory
    41   val add_consts: ((bstring * string * mixfix) * Comment.text) list -> theory -> theory
    42   val add_consts_i: ((bstring * typ * mixfix) * Comment.text) list -> theory -> theory
    43   val add_modesyntax: string * bool -> ((bstring * string * mixfix) * Comment.text) list
    44     -> theory -> theory
    45   val add_modesyntax_i: string * bool -> ((bstring * typ * mixfix) * Comment.text) list
    46     -> theory -> theory
    47   val add_trrules: ((xstring * string) Syntax.trrule * Comment.text) list -> theory -> theory
    48   val add_trrules_i: (Syntax.ast Syntax.trrule * Comment.text) list -> theory -> theory
    49   val add_judgment: (bstring * string * mixfix) * Comment.text -> theory -> theory
    50   val add_judgment_i: (bstring * typ * mixfix) * Comment.text -> theory -> theory
    51   val add_axioms: (((bstring * string) * Args.src list) * Comment.text) list -> theory -> theory
    52   val add_axioms_i: (((bstring * term) * theory attribute list) * Comment.text) list
    53     -> theory -> theory
    54   val add_defs: bool * (((bstring * string) * Args.src list) * Comment.text) list
    55     -> theory -> theory
    56   val add_defs_i: bool * (((bstring * term) * theory attribute list) * Comment.text) list
    57     -> theory -> theory
    58   val add_constdefs: (((bstring * string * mixfix) * Comment.text) * (string * Comment.text)) list
    59     -> theory -> theory
    60   val add_constdefs_i: (((bstring * typ * mixfix) * Comment.text) * (term * Comment.text)) list
    61     -> theory -> theory
    62   val apply_theorems: (xstring * Args.src list) list -> theory -> theory * thm list
    63   val apply_theorems_i: (thm * theory attribute list) list -> theory -> theory * thm list
    64   val declare_theorems: (xstring * Args.src list) list * Comment.text -> theory -> theory
    65   val declare_theorems_i: (thm * theory attribute list) list * Comment.text -> theory -> theory
    66   val have_theorems: string ->
    67     (((bstring * Args.src list) * (xstring * Args.src list) list) * Comment.text) list
    68     -> theory -> theory
    69   val have_theorems_i:  string ->
    70     (((bstring * theory attribute list) * (thm * theory attribute list) list)
    71     * Comment.text) list -> theory -> theory
    72   val have_facts: (((string * Args.src list) * (string * Args.src list) list) * Comment.text) list
    73     -> ProofHistory.T -> ProofHistory.T
    74   val have_facts_i: (((string * Proof.context attribute list) *
    75     (thm * Proof.context attribute list) list) * Comment.text) list
    76     -> ProofHistory.T -> ProofHistory.T
    77   val from_facts: ((string * Args.src list) list * Comment.text) list
    78     -> ProofHistory.T -> ProofHistory.T
    79   val from_facts_i: ((thm * Proof.context attribute list) list * Comment.text) list
    80     -> ProofHistory.T -> ProofHistory.T
    81   val with_facts: ((string * Args.src list) list * Comment.text) list
    82     -> ProofHistory.T -> ProofHistory.T
    83   val with_facts_i: ((thm * Proof.context attribute list) list * Comment.text) list
    84     -> ProofHistory.T -> ProofHistory.T
    85   val chain: Comment.text -> ProofHistory.T -> ProofHistory.T
    86   val fix: ((string list * string option) * Comment.text) list -> ProofHistory.T -> ProofHistory.T
    87   val fix_i: ((string list * typ option) * Comment.text) list -> ProofHistory.T -> ProofHistory.T
    88   val let_bind: ((string list * string) * Comment.text) list -> ProofHistory.T -> ProofHistory.T
    89   val let_bind_i: ((term list * term) * Comment.text) list -> ProofHistory.T -> ProofHistory.T
    90   val invoke_case: (string * string option list * Args.src list) * Comment.text
    91     -> ProofHistory.T -> ProofHistory.T
    92   val invoke_case_i: (string * string option list * Proof.context attribute list) * Comment.text
    93     -> ProofHistory.T -> ProofHistory.T
    94   val theorem: string -> (xstring * Args.src list) option * Args.src Locale.element list
    95     -> ((bstring * Args.src list) * (string * (string list * string list))) * Comment.text
    96     -> bool -> theory -> ProofHistory.T
    97   val theorem_i: string -> (string * Proof.context attribute list) option
    98     * Proof.context attribute Locale.element_i list
    99     -> ((bstring * Theory.theory Thm.attribute list) *
   100       (Term.term * (Term.term list * Term.term list))) * Comment.text
   101     -> bool -> theory -> ProofHistory.T
   102   val multi_theorem: string -> (bstring * Args.src list)
   103     -> (xstring * Args.src list) option * Args.src Locale.element list
   104     -> (((bstring * Args.src list) * (string * (string list * string list)) list)
   105     * Comment.text) list -> bool -> theory -> ProofHistory.T
   106   val multi_theorem_i: string -> (bstring * theory attribute list)
   107     -> (string * Proof.context attribute list) option
   108       * Proof.context attribute Locale.element_i list ->
   109     (((bstring * Theory.theory Thm.attribute list) *
   110       (Term.term * (Term.term list * Term.term list)) list) * Comment.text) list
   111     -> bool -> theory -> ProofHistory.T
   112   val assume: (((string * Args.src list) * (string * (string list * string list)) list)
   113     * Comment.text) list -> ProofHistory.T -> ProofHistory.T
   114   val assume_i: (((string * Proof.context attribute list) * (term * (term list * term list)) list)
   115     * Comment.text) list -> ProofHistory.T -> ProofHistory.T
   116   val presume: (((string * Args.src list) * (string * (string list * string list)) list)
   117     * Comment.text) list -> ProofHistory.T -> ProofHistory.T
   118   val presume_i: (((string * Proof.context attribute list) * (term * (term list * term list)) list)
   119     * Comment.text) list -> ProofHistory.T -> ProofHistory.T
   120   val have: (((string * Args.src list) *
   121     (string * (string list * string list)) list) * Comment.text) list
   122     -> ProofHistory.T -> ProofHistory.T
   123   val have_i: (((string * Proof.context Thm.attribute list) *
   124     (Term.term * (Term.term list * Term.term list)) list) * Comment.text) list
   125     -> ProofHistory.T -> ProofHistory.T
   126   val hence: (((string * Args.src list) *
   127     (string * (string list * string list)) list) * Comment.text) list
   128     -> ProofHistory.T -> ProofHistory.T
   129   val hence_i: (((string * Proof.context Thm.attribute list) *
   130     (Term.term * (Term.term list * Term.term list)) list) * Comment.text) list
   131     -> ProofHistory.T -> ProofHistory.T
   132   val show: (((string * Args.src list) *
   133     (string * (string list * string list)) list) * Comment.text) list
   134     -> bool -> ProofHistory.T -> ProofHistory.T
   135   val show_i: (((string * Proof.context Thm.attribute list) *
   136     (Term.term * (Term.term list * Term.term list)) list) * Comment.text) list
   137     -> bool -> ProofHistory.T -> ProofHistory.T
   138   val thus: (((string * Args.src list) *
   139     (string * (string list * string list)) list) * Comment.text) list
   140     -> bool -> ProofHistory.T -> ProofHistory.T
   141   val thus_i: (((string * Proof.context Thm.attribute list) *
   142     (Term.term * (Term.term list * Term.term list)) list) * Comment.text) list
   143     -> bool -> ProofHistory.T -> ProofHistory.T
   144   val local_def: ((string * Args.src list) * (string * (string * string list)))
   145     * Comment.text -> ProofHistory.T -> ProofHistory.T
   146   val local_def_i: ((string * Args.src list) * (string * (term * term list)))
   147     * Comment.text -> ProofHistory.T -> ProofHistory.T
   148   val obtain: ((string list * string option) * Comment.text) list
   149     * (((string * Args.src list) * (string * (string list * string list)) list)
   150       * Comment.text) list -> ProofHistory.T -> ProofHistory.T
   151   val obtain_i: ((string list * typ option) * Comment.text) list
   152     * (((string * Proof.context attribute list) * (term * (term list * term list)) list)
   153       * Comment.text) list -> ProofHistory.T -> ProofHistory.T
   154   val begin_block: Comment.text -> ProofHistory.T -> ProofHistory.T
   155   val next_block: Comment.text -> ProofHistory.T -> ProofHistory.T
   156   val end_block: Comment.text -> ProofHistory.T -> ProofHistory.T
   157   val defer: int option * Comment.text -> ProofHistory.T -> ProofHistory.T
   158   val prefer: int * Comment.text -> ProofHistory.T -> ProofHistory.T
   159   val apply: Method.text * Comment.text -> ProofHistory.T -> ProofHistory.T
   160   val apply_end: Method.text * Comment.text -> ProofHistory.T -> ProofHistory.T
   161   val proof: (Comment.interest * (Method.text * Comment.interest) option) * Comment.text
   162     -> ProofHistory.T -> ProofHistory.T
   163   val qed: (Method.text * Comment.interest) option * Comment.text
   164     -> Toplevel.transition -> Toplevel.transition
   165   val terminal_proof: ((Method.text * Comment.interest) * (Method.text * Comment.interest) option)
   166     * Comment.text -> Toplevel.transition -> Toplevel.transition
   167   val default_proof: Comment.text -> Toplevel.transition -> Toplevel.transition
   168   val immediate_proof: Comment.text -> Toplevel.transition -> Toplevel.transition
   169   val done_proof: Comment.text -> Toplevel.transition -> Toplevel.transition
   170   val skip_proof: Comment.text -> Toplevel.transition -> Toplevel.transition
   171   val forget_proof: Comment.text -> Toplevel.transition -> Toplevel.transition
   172   val get_thmss: (string * Args.src list) list -> Proof.state -> thm list
   173   val also: ((string * Args.src list) list * Comment.interest) option * Comment.text
   174     -> Toplevel.transition -> Toplevel.transition
   175   val also_i: (thm list * Comment.interest) option * Comment.text
   176     -> Toplevel.transition -> Toplevel.transition
   177   val finally: ((string * Args.src list) list * Comment.interest) option * Comment.text
   178     -> Toplevel.transition -> Toplevel.transition
   179   val finally_i: (thm list * Comment.interest) option * Comment.text
   180     -> Toplevel.transition -> Toplevel.transition
   181   val moreover: Comment.text -> Toplevel.transition -> Toplevel.transition
   182   val ultimately: Comment.text -> Toplevel.transition -> Toplevel.transition
   183   val parse_ast_translation: string * Comment.text -> theory -> theory
   184   val parse_translation: string * Comment.text -> theory -> theory
   185   val print_translation: string * Comment.text -> theory -> theory
   186   val typed_print_translation: string * Comment.text -> theory -> theory
   187   val print_ast_translation: string * Comment.text -> theory -> theory
   188   val token_translation: string * Comment.text -> theory -> theory
   189   val method_setup: (bstring * string * string) * Comment.text -> theory -> theory
   190   val add_oracle: (bstring * string) * Comment.text -> theory -> theory
   191   val add_locale: bstring * Locale.expr * (Args.src Locale.element * Comment.text) list
   192     -> theory -> theory
   193   val begin_theory: string -> string list -> (string * bool) list -> theory
   194   val end_theory: theory -> theory
   195   val kill_theory: string -> unit
   196   val theory: string * string list * (string * bool) list
   197     -> Toplevel.transition -> Toplevel.transition
   198   val init_context: ('a -> unit) -> 'a -> Toplevel.transition -> Toplevel.transition
   199   val context: string -> Toplevel.transition -> Toplevel.transition
   200 end;
   201 
   202 structure IsarThy: ISAR_THY =
   203 struct
   204 
   205 
   206 
   207 (** derived theory and proof operations **)
   208 
   209 (* markup commands *)
   210 
   211 fun add_header comment =
   212   Toplevel.keep (fn state => if Toplevel.is_toplevel state then () else raise Toplevel.UNDEF);
   213 
   214 fun add_text _ x = x;
   215 fun add_text_raw _ x = x;
   216 
   217 fun add_heading add present txt thy =
   218   (Context.setmp (Some thy) present (Comment.string_of txt); add txt thy);
   219 
   220 val add_chapter = add_heading add_text Present.section;
   221 val add_section = add_heading add_text Present.section;
   222 val add_subsection = add_heading add_text Present.subsection;
   223 val add_subsubsection = add_heading add_text Present.subsubsection;
   224 
   225 fun add_txt (_: Comment.text) = ProofHistory.apply I;
   226 val add_txt_raw = add_txt;
   227 val add_sect = add_txt;
   228 val add_subsect = add_txt;
   229 val add_subsubsect = add_txt;
   230 
   231 
   232 (* name spaces *)
   233 
   234 fun global_path comment_ignore = PureThy.global_path;
   235 fun local_path comment_ignore = PureThy.local_path;
   236 
   237 local
   238 
   239 val kinds =
   240  [(Sign.classK, can o Sign.certify_class),
   241   (Sign.typeK, fn sg => fn c =>
   242     can (Sign.certify_tycon sg) c orelse can (Sign.certify_tyabbr sg) c),
   243   (Sign.constK, can o Sign.certify_const)];
   244 
   245 fun gen_hide intern ((kind, xnames), comment_ignore) thy =
   246   (case assoc (kinds, kind) of
   247     Some check =>
   248       let
   249         val sg = Theory.sign_of thy;
   250         val names = map (intern sg kind) xnames;
   251         val bads = filter_out (check sg) names;
   252       in
   253         if null bads then Theory.hide_space_i (kind, names) thy
   254         else error ("Attempt to hide undeclared item(s): " ^ commas_quote bads)
   255       end
   256   | None => error ("Bad name space specification: " ^ quote kind));
   257 
   258 in
   259 
   260 fun hide_space x = gen_hide Sign.intern x;
   261 fun hide_space_i x = gen_hide (K (K I)) x;
   262 
   263 end;
   264 
   265 
   266 (* signature and syntax *)
   267 
   268 val add_classes = Theory.add_classes o Comment.ignore;
   269 val add_classes_i = Theory.add_classes_i o Comment.ignore;
   270 val add_classrel = Theory.add_classrel o single o Comment.ignore;
   271 val add_classrel_i = Theory.add_classrel_i o single o Comment.ignore;
   272 val add_defsort = Theory.add_defsort o Comment.ignore;
   273 val add_defsort_i = Theory.add_defsort_i o Comment.ignore;
   274 val add_nonterminals = Theory.add_nonterminals o map Comment.ignore;
   275 val add_tyabbrs = Theory.add_tyabbrs o map Comment.ignore;
   276 val add_tyabbrs_i = Theory.add_tyabbrs_i o map Comment.ignore;
   277 val add_arities = Theory.add_arities o map Comment.ignore;
   278 val add_arities_i = Theory.add_arities_i o map Comment.ignore;
   279 val add_typedecl = PureThy.add_typedecls o single o Comment.ignore;
   280 val add_consts = Theory.add_consts o map Comment.ignore;
   281 val add_consts_i = Theory.add_consts_i o map Comment.ignore;
   282 fun add_modesyntax mode = Theory.add_modesyntax mode o map Comment.ignore;
   283 fun add_modesyntax_i mode = Theory.add_modesyntax_i mode o map Comment.ignore;
   284 val add_trrules = Theory.add_trrules o map Comment.ignore;
   285 val add_trrules_i = Theory.add_trrules_i o map Comment.ignore;
   286 val add_judgment = ObjectLogic.add_judgment o Comment.ignore;
   287 val add_judgment_i = ObjectLogic.add_judgment_i o Comment.ignore;
   288 
   289 
   290 (* axioms and defs *)
   291 
   292 fun add_axms f args thy =
   293   f (map (fn (x, srcs) => (x, map (Attrib.global_attribute thy) srcs)) args) thy;
   294 
   295 val add_axioms = add_axms (#1 oo PureThy.add_axioms) o map Comment.ignore;
   296 val add_axioms_i = (#1 oo PureThy.add_axioms_i) o map Comment.ignore;
   297 fun add_defs (x, args) = add_axms (#1 oo PureThy.add_defs x) (map Comment.ignore args);
   298 fun add_defs_i (x, args) = (#1 oo PureThy.add_defs_i x) (map Comment.ignore args);
   299 
   300 
   301 (* constdefs *)
   302 
   303 fun gen_add_constdefs consts defs args thy =
   304   thy
   305   |> consts (map (Comment.ignore o fst) args)
   306   |> defs (false, map (fn (((c, _, mx), _), (s, _)) =>
   307     (((Thm.def_name (Syntax.const_name c mx), s), []), Comment.none)) args);
   308 
   309 fun add_constdefs args = gen_add_constdefs Theory.add_consts add_defs args;
   310 fun add_constdefs_i args = gen_add_constdefs Theory.add_consts_i add_defs_i args;
   311 
   312 
   313 (* theorems *)
   314 
   315 fun prep_thmss get attrib = map (fn ((name, more_srcs), th_srcs) =>
   316   ((name, map attrib more_srcs), map (fn (s, srcs) => (get s, map attrib srcs)) th_srcs));
   317 
   318 fun flat_unnamed (x, ys) = (x, flat (map snd ys));
   319 fun cond_kind k = if k = "" then [] else [Drule.kind k];
   320 
   321 fun global_have_thmss kind f args thy =
   322   let
   323     val args' = prep_thmss (PureThy.get_thms thy) (Attrib.global_attribute thy) args
   324     val (thy', named_thmss) = f (cond_kind kind) args' thy;
   325     fun present (name, thms) = Present.results (kind ^ "s") name thms;
   326   in
   327     if kind = "" orelse kind = Drule.internalK then ()
   328     else Context.setmp (Some thy') (fn () => seq present named_thmss) ();
   329     (thy', named_thmss)
   330   end;
   331 
   332 fun local_have_thmss f args state =
   333   let
   334     val args' = prep_thmss (ProofContext.get_thms (Proof.context_of state))
   335       (Attrib.local_attribute (Proof.theory_of state)) args;
   336   in f args' state end;
   337 
   338 fun gen_have_thmss_i f args = f (map (fn ((name, more_atts), th_atts) =>
   339   ((name, more_atts), map (apfst single) th_atts)) args);
   340 
   341 fun apply_theorems th_srcs =
   342   flat_unnamed o global_have_thmss "" PureThy.have_thmss [(("", []), th_srcs)];
   343 fun apply_theorems_i th_srcs =
   344   flat_unnamed o gen_have_thmss_i (PureThy.have_thmss []) [(("", []), th_srcs)];
   345 
   346 val declare_theorems = #1 oo (apply_theorems o Comment.ignore);
   347 val declare_theorems_i = #1 oo (apply_theorems_i o Comment.ignore);
   348 
   349 fun have_theorems kind =
   350   #1 oo (global_have_thmss kind PureThy.have_thmss o map Comment.ignore);
   351 fun have_theorems_i kind =
   352   #1 oo (gen_have_thmss_i (PureThy.have_thmss (cond_kind kind)) o map Comment.ignore);
   353 
   354 val have_facts = ProofHistory.apply o local_have_thmss Proof.have_thmss o map Comment.ignore;
   355 val have_facts_i = ProofHistory.apply o gen_have_thmss_i Proof.have_thmss o map Comment.ignore;
   356 
   357 
   358 (* forward chaining *)
   359 
   360 fun gen_from_facts f args = ProofHistory.apply (Proof.chain o f (map (pair ("", [])) args));
   361 
   362 val from_facts = gen_from_facts (local_have_thmss Proof.have_thmss) o map Comment.ignore;
   363 val from_facts_i = gen_from_facts (gen_have_thmss_i Proof.have_thmss) o map Comment.ignore;
   364 val with_facts = gen_from_facts (local_have_thmss Proof.with_thmss) o map Comment.ignore;
   365 val with_facts_i = gen_from_facts (gen_have_thmss_i Proof.with_thmss) o map Comment.ignore;
   366 
   367 fun chain comment_ignore = ProofHistory.apply Proof.chain;
   368 
   369 
   370 (* context *)
   371 
   372 val fix = ProofHistory.apply o Proof.fix o map Comment.ignore;
   373 val fix_i = ProofHistory.apply o Proof.fix_i o map Comment.ignore;
   374 val let_bind = ProofHistory.apply o Proof.let_bind o map Comment.ignore;
   375 val let_bind_i = ProofHistory.apply o Proof.let_bind_i o map Comment.ignore;
   376 
   377 fun invoke_case ((name, xs, src), comment_ignore) = ProofHistory.apply (fn state =>
   378   Proof.invoke_case (name, xs, map (Attrib.local_attribute (Proof.theory_of state)) src) state);
   379 val invoke_case_i = ProofHistory.apply o Proof.invoke_case o Comment.ignore;
   380 
   381 
   382 (* local results *)
   383 
   384 local
   385 
   386 fun prt_fact ctxt ("", ths) = ProofContext.pretty_thms ctxt ths
   387   | prt_fact ctxt (name, ths) =
   388       Pretty.block [Pretty.str (name ^ ":"), Pretty.brk 1, ProofContext.pretty_thms ctxt ths];
   389 
   390 fun prt_facts ctxt =
   391   flat o (separate [Pretty.fbrk, Pretty.str "and "]) o map (single o prt_fact ctxt);
   392 
   393 fun pretty_results ctxt ((kind, ""), facts) =
   394       Pretty.block (Pretty.str kind :: Pretty.brk 1 :: prt_facts ctxt facts)
   395   | pretty_results ctxt ((kind, name), facts) = Pretty.blk (1,
   396       [Pretty.str (kind ^ " " ^ name ^ ":"), Pretty.fbrk,
   397         Pretty.blk (1, Pretty.str "(" :: prt_facts ctxt facts @ [Pretty.str ")"])]);
   398 
   399 fun pretty_rule s ctxt thm =
   400   Pretty.block [Pretty.str (s ^ " to solve goal by exported rule:"),
   401     Pretty.fbrk, ProofContext.pretty_thm ctxt thm];
   402 
   403 in
   404 
   405 val print_result = Pretty.writeln oo pretty_results;
   406 fun print_result' ctxt (k, res) = print_result ctxt ((k, ""), res);
   407 
   408 fun cond_print_result_rule int =
   409   if int then (print_result', priority oo (Pretty.string_of oo pretty_rule "Attempt"))
   410   else (K (K ()), K (K ()));
   411 
   412 fun proof'' f = Toplevel.proof' (f o cond_print_result_rule);
   413 
   414 fun check_goal false state = state
   415   | check_goal true state =
   416       let
   417         val rule = ref (None: thm option);
   418         fun warn exn =
   419           (["Problem! Local statement will fail to solve any pending goal"] @
   420           (case exn of None => [] | Some e => [Toplevel.exn_message e]) @
   421           (case ! rule of None => [] | Some thm =>
   422             [Pretty.string_of (pretty_rule "Failed attempt" (Proof.context_of state) thm)]))
   423           |> cat_lines |> warning;
   424         val check =
   425           (fn () => Seq.pull (SkipProof.local_skip_proof (K (K ()),
   426             fn _ => fn thm => rule := Some thm) true state))
   427           |> Library.setmp proofs 0
   428           |> Library.transform_error;
   429         val result = (check (), None) handle Interrupt => raise Interrupt | e => (None, Some e);
   430       in (case result of (Some _, None) => () | (_, exn) => warn exn); state end;
   431 
   432 end;
   433 
   434 
   435 (* statements *)
   436 
   437 local
   438 
   439 fun global_attributes thy ((name, src), s) = ((name, map (Attrib.global_attribute thy) src), s);
   440 
   441 fun global_statement f args int thy =
   442   ProofHistory.init (Toplevel.undo_limit int) (f (map (global_attributes thy) args) thy);
   443 fun global_statement_i f args int thy = ProofHistory.init (Toplevel.undo_limit int) (f args thy);
   444 
   445 fun local_attributes state ((name, src), s) =
   446   ((name, map (Attrib.local_attribute (Proof.theory_of state)) src), s);
   447 
   448 fun local_statement' f g args int = ProofHistory.apply (fn state =>
   449   f (map (local_attributes state) args) int (g state));
   450 fun local_statement_i' f g args int = ProofHistory.apply (f args int o g);
   451 fun local_statement f g args = local_statement' (K o f) g args ();
   452 fun local_statement_i f g args = local_statement_i' (K o f) g args ();
   453 
   454 in
   455 
   456 fun multi_theorem k a (locale, elems) args int thy =
   457   global_statement (Proof.multi_theorem k (apsnd (map (Attrib.global_attribute thy)) a)
   458     (apsome (apsnd (map (Attrib.local_attribute thy))) locale)
   459     (map (Locale.attribute (Attrib.local_attribute thy)) elems)) (map Comment.ignore args) int thy;
   460 
   461 fun multi_theorem_i k a (locale, elems) =
   462   global_statement_i (Proof.multi_theorem_i k a locale elems) o map Comment.ignore;
   463 
   464 fun theorem k loc ((a, t), cmt) = multi_theorem k a loc [((("", []), [t]), cmt)];
   465 fun theorem_i k loc ((a, t), cmt) = multi_theorem_i k a loc [((("", []), [t]), cmt)];
   466 
   467 val assume      = local_statement Proof.assume I o map Comment.ignore;
   468 val assume_i    = local_statement_i Proof.assume_i I o map Comment.ignore;
   469 val presume     = local_statement Proof.presume I o map Comment.ignore;
   470 val presume_i   = local_statement_i Proof.presume_i I o map Comment.ignore;
   471 val have        = local_statement (Proof.have Seq.single) I o map Comment.ignore;
   472 val have_i      = local_statement_i (Proof.have_i Seq.single) I o map Comment.ignore;
   473 val hence       = local_statement (Proof.have Seq.single) Proof.chain o map Comment.ignore;
   474 val hence_i     = local_statement_i (Proof.have_i Seq.single) Proof.chain o map Comment.ignore;
   475 val show        = local_statement' (Proof.show check_goal Seq.single) I o map Comment.ignore;
   476 val show_i      = local_statement_i' (Proof.show_i check_goal Seq.single) I o map Comment.ignore;
   477 val thus = local_statement' (Proof.show check_goal Seq.single) Proof.chain o map Comment.ignore;
   478 val thus_i = local_statement_i' (Proof.show_i check_goal Seq.single) Proof.chain o map Comment.ignore;
   479 
   480 fun gen_def f ((name, srcs), def) = ProofHistory.apply (fn state =>
   481   f name (map (Attrib.local_attribute (Proof.theory_of state)) srcs) def state);
   482 
   483 val local_def = gen_def Proof.def o Comment.ignore;
   484 val local_def_i = gen_def Proof.def_i o Comment.ignore;
   485 
   486 fun obtain (xs, asms) = ProofHistory.applys (fn state =>
   487   Obtain.obtain (map Comment.ignore xs)
   488     (map (local_attributes state) (map Comment.ignore asms)) state);
   489 
   490 fun obtain_i (xs, asms) = ProofHistory.applys (fn state =>
   491   Obtain.obtain_i (map Comment.ignore xs) (map Comment.ignore asms) state);
   492 
   493 end;
   494 
   495 
   496 (* blocks *)
   497 
   498 fun begin_block comment_ignore = ProofHistory.apply Proof.begin_block;
   499 fun next_block comment_ignore = ProofHistory.apply Proof.next_block;
   500 fun end_block comment_ignore = ProofHistory.applys Proof.end_block;
   501 
   502 
   503 (* shuffle state *)
   504 
   505 fun shuffle meth i = Method.refine (Method.Basic (K (meth i))) o Proof.assert_no_chain;
   506 
   507 fun defer (i, comment_ignore) = ProofHistory.applys (shuffle Method.defer i);
   508 fun prefer (i, comment_ignore) = ProofHistory.applys (shuffle Method.prefer i);
   509 
   510 
   511 (* backward steps *)
   512 
   513 fun apply (m, comment_ignore) = ProofHistory.applys
   514   (Seq.map (Proof.goal_facts (K [])) o Method.refine m o Proof.assert_backward);
   515 
   516 fun apply_end (m, comment_ignore) = ProofHistory.applys
   517   (Method.refine_end m o Proof.assert_forward);
   518 
   519 val proof = ProofHistory.applys o Method.proof o
   520   apsome Comment.ignore_interest o Comment.ignore_interest' o Comment.ignore;
   521 
   522 
   523 (* local endings *)
   524 
   525 val local_qed =
   526   proof'' o (ProofHistory.applys oo Method.local_qed true) o apsome Comment.ignore_interest;
   527 
   528 fun ignore_interests (x, y) = (Comment.ignore_interest x, apsome Comment.ignore_interest y);
   529 
   530 val local_terminal_proof =
   531   proof'' o (ProofHistory.applys oo Method.local_terminal_proof) o ignore_interests;
   532 
   533 val local_default_proof = proof'' (ProofHistory.applys o Method.local_default_proof);
   534 val local_immediate_proof = proof'' (ProofHistory.applys o Method.local_immediate_proof);
   535 val local_done_proof = proof'' (ProofHistory.applys o Method.local_done_proof);
   536 val local_skip_proof = Toplevel.proof' (fn int =>
   537   ProofHistory.applys (SkipProof.local_skip_proof (cond_print_result_rule int) int));
   538 
   539 
   540 (* global endings *)
   541 
   542 fun global_result finish = Toplevel.proof_to_theory' (fn int => fn prf =>
   543   let
   544     val state = ProofHistory.current prf;
   545     val _ = if Proof.at_bottom state then () else raise Toplevel.UNDEF;
   546     val (thy, ((kind, name), res)) = finish int state;
   547   in
   548     if kind = "" orelse kind = Drule.internalK then ()
   549     else (print_result (Proof.context_of state) ((kind, name), res);
   550       Context.setmp (Some thy) Present.multi_result (kind, res));
   551     thy
   552   end);
   553 
   554 fun global_qed m = global_result (K (Method.global_qed true (apsome Comment.ignore_interest m)));
   555 fun global_terminal_proof m =
   556   global_result (K (Method.global_terminal_proof (ignore_interests m)));
   557 val global_default_proof = global_result (K Method.global_default_proof);
   558 val global_immediate_proof = global_result (K Method.global_immediate_proof);
   559 val global_skip_proof = global_result SkipProof.global_skip_proof;
   560 val global_done_proof = global_result (K Method.global_done_proof);
   561 
   562 
   563 (* common endings *)
   564 
   565 fun qed (meth, comment) = local_qed meth o global_qed meth;
   566 fun terminal_proof (meths, comment) = local_terminal_proof meths o global_terminal_proof meths;
   567 fun default_proof comment = local_default_proof o global_default_proof;
   568 fun immediate_proof comment = local_immediate_proof o global_immediate_proof;
   569 fun done_proof comment = local_done_proof o global_done_proof;
   570 fun skip_proof comment = local_skip_proof o global_skip_proof;
   571 
   572 fun forget_proof comment = Toplevel.proof_to_theory (Proof.theory_of o ProofHistory.current);
   573 
   574 
   575 (* calculational proof commands *)
   576 
   577 local
   578 
   579 fun cond_print_calc int ctxt thms =
   580   if int then
   581     Pretty.writeln (Pretty.big_list "calculation:" (map (ProofContext.pretty_thm ctxt) thms))
   582   else ();
   583 
   584 fun proof''' f = Toplevel.proof' (f o cond_print_calc);
   585 
   586 fun gen_calc get f (args, _) prt state =
   587   f (apsome (fn (srcs, _) => get srcs state) args) prt state;
   588 
   589 in
   590 
   591 fun get_thmss srcs = Proof.the_facts o local_have_thmss Proof.have_thmss [(("", []), srcs)];
   592 fun get_thmss_i thms _ = thms;
   593 
   594 fun also x = proof''' (ProofHistory.applys o gen_calc get_thmss Calculation.also x);
   595 fun also_i x = proof''' (ProofHistory.applys o gen_calc get_thmss_i Calculation.also x);
   596 fun finally x = proof''' (ProofHistory.applys o gen_calc get_thmss Calculation.finally x);
   597 fun finally_i x = proof''' (ProofHistory.applys o gen_calc get_thmss_i Calculation.finally x);
   598 fun moreover comment = proof''' (ProofHistory.apply o Calculation.moreover);
   599 fun ultimately comment = proof''' (ProofHistory.apply o Calculation.ultimately);
   600 
   601 end;
   602 
   603 
   604 (* translation functions *)
   605 
   606 val parse_ast_translation =
   607   Context.use_let "val parse_ast_translation: (string * (Syntax.ast list -> Syntax.ast)) list"
   608     "Theory.add_trfuns (parse_ast_translation, [], [], [])" o Comment.ignore;
   609 
   610 val parse_translation =
   611   Context.use_let "val parse_translation: (string * (term list -> term)) list"
   612     "Theory.add_trfuns ([], parse_translation, [], [])" o Comment.ignore;
   613 
   614 val print_translation =
   615   Context.use_let "val print_translation: (string * (term list -> term)) list"
   616     "Theory.add_trfuns ([], [], print_translation, [])" o Comment.ignore;
   617 
   618 val print_ast_translation =
   619   Context.use_let "val print_ast_translation: (string * (Syntax.ast list -> Syntax.ast)) list"
   620     "Theory.add_trfuns ([], [], [], print_ast_translation)" o Comment.ignore;
   621 
   622 val typed_print_translation =
   623   Context.use_let "val typed_print_translation: (string * (bool -> typ -> term list -> term)) list"
   624     "Theory.add_trfunsT typed_print_translation" o Comment.ignore;
   625 
   626 val token_translation =
   627   Context.use_let "val token_translation: (string * string * (string -> string * real)) list"
   628     "Theory.add_tokentrfuns token_translation" o Comment.ignore;
   629 
   630 
   631 (* add method *)
   632 
   633 fun method_setup ((name, txt, cmt), comment_ignore) =
   634   Context.use_let
   635     "val thm = PureThy.get_thm_closure (Context.the_context ());\n\
   636     \val thms = PureThy.get_thms_closure (Context.the_context ());\n\
   637     \val method: bstring * (Args.src -> Proof.context -> Proof.method) * string"
   638     "PureIsar.Method.add_method method"
   639     ("(" ^ quote name ^ ", " ^ txt ^ ", " ^ quote cmt ^ ")");
   640 
   641 
   642 (* add_oracle *)
   643 
   644 fun add_oracle ((name, txt), comment_ignore) =
   645   Context.use_let
   646     "val oracle: bstring * (Sign.sg * Object.T -> term)"
   647     "Theory.add_oracle oracle"
   648     ("(" ^ quote name ^ ", " ^ txt ^ ")");
   649 
   650 
   651 (* add_locale *)
   652 
   653 fun add_locale (name, imports, elems) thy =
   654   Locale.add_locale name imports
   655     (map (Locale.attribute (Attrib.local_attribute thy) o Comment.ignore) elems) thy;
   656 
   657 
   658 (* theory init and exit *)
   659 
   660 fun gen_begin_theory upd name parents files =
   661   ThyInfo.begin_theory Present.begin_theory upd name parents (map (apfst Path.unpack) files);
   662 
   663 val begin_theory = gen_begin_theory false;
   664 
   665 fun end_theory thy =
   666   if ThyInfo.check_known_thy (PureThy.get_name thy) then ThyInfo.end_theory thy
   667   else thy;
   668 
   669 val kill_theory = ThyInfo.if_known_thy ThyInfo.remove_thy;
   670 
   671 
   672 fun bg_theory (name, parents, files) int = gen_begin_theory int name parents files;
   673 fun en_theory thy = (end_theory thy; ());
   674 
   675 fun theory spec = Toplevel.init_theory (bg_theory spec) en_theory (kill_theory o PureThy.get_name);
   676 
   677 
   678 (* context switch *)
   679 
   680 fun fetch_context f x =
   681   (case Context.pass None f x of
   682     ((), None) => raise Toplevel.UNDEF
   683   | ((), Some thy) => thy);
   684 
   685 fun init_context f x = Toplevel.init_theory (fn _ => fetch_context f x) (K ()) (K ());
   686 
   687 val context = init_context (ThyInfo.quiet_update_thy true);
   688 
   689 
   690 end;