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