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