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