src/Pure/Isar/isar_cmd.ML
author wenzelm
Wed Apr 16 21:53:02 2008 +0200 (2008-04-16 ago)
changeset 26694 29f5c1a296bc
parent 26671 c95590e01df5
child 26704 51ee753cc2e3
permissions -rw-r--r--
PureThy.defined_fact;
unused_thms: simplified signature;
wenzelm@5831
     1
(*  Title:      Pure/Isar/isar_cmd.ML
wenzelm@5831
     2
    ID:         $Id$
wenzelm@5831
     3
    Author:     Markus Wenzel, TU Muenchen
wenzelm@5831
     4
wenzelm@21350
     5
Derived Isar commands.
wenzelm@5831
     6
*)
wenzelm@5831
     7
wenzelm@5831
     8
signature ISAR_CMD =
wenzelm@5831
     9
sig
wenzelm@26435
    10
  val generic_setup: string * Position.T -> theory -> theory
wenzelm@26385
    11
  val parse_ast_translation: bool * (string * Position.T) -> theory -> theory
wenzelm@26385
    12
  val parse_translation: bool * (string * Position.T) -> theory -> theory
wenzelm@26385
    13
  val print_translation: bool * (string * Position.T) -> theory -> theory
wenzelm@26385
    14
  val typed_print_translation: bool * (string * Position.T) -> theory -> theory
wenzelm@26385
    15
  val print_ast_translation: bool * (string * Position.T) -> theory -> theory
wenzelm@26385
    16
  val token_translation: string * Position.T -> theory -> theory
wenzelm@26385
    17
  val oracle: bstring -> string -> string * Position.T -> theory -> theory
wenzelm@21350
    18
  val add_axioms: ((bstring * string) * Attrib.src list) list -> theory -> theory
wenzelm@21350
    19
  val add_defs: (bool * bool) * ((bstring * string) * Attrib.src list) list -> theory -> theory
wenzelm@26336
    20
  val apply_theorems: (Facts.ref * Attrib.src list) list -> theory -> thm list * theory
wenzelm@21350
    21
  val apply_theorems_i: (thm list * attribute list) list -> theory -> thm list * theory
wenzelm@26385
    22
  val declaration: string * Position.T -> local_theory -> local_theory
wenzelm@26385
    23
  val simproc_setup: string -> string list -> string * Position.T -> string list ->
wenzelm@26385
    24
    local_theory -> local_theory
wenzelm@26671
    25
  val hide_names: bool -> string * xstring list -> theory -> theory
wenzelm@21350
    26
  val have: ((string * Attrib.src list) * (string * string list) list) list ->
wenzelm@21350
    27
    bool -> Proof.state -> Proof.state
wenzelm@21350
    28
  val hence: ((string * Attrib.src list) * (string * string list) list) list ->
wenzelm@21350
    29
    bool -> Proof.state -> Proof.state
wenzelm@21350
    30
  val show: ((string * Attrib.src list) * (string * string list) list) list ->
wenzelm@21350
    31
    bool -> Proof.state -> Proof.state
wenzelm@21350
    32
  val thus: ((string * Attrib.src list) * (string * string list) list) list ->
wenzelm@21350
    33
    bool -> Proof.state -> Proof.state
wenzelm@21350
    34
  val qed: Method.text option -> Toplevel.transition -> Toplevel.transition
wenzelm@21350
    35
  val terminal_proof: Method.text * Method.text option ->
wenzelm@21350
    36
    Toplevel.transition -> Toplevel.transition
wenzelm@21350
    37
  val default_proof: Toplevel.transition -> Toplevel.transition
wenzelm@21350
    38
  val immediate_proof: Toplevel.transition -> Toplevel.transition
wenzelm@21350
    39
  val done_proof: Toplevel.transition -> Toplevel.transition
wenzelm@21350
    40
  val skip_proof: Toplevel.transition -> Toplevel.transition
wenzelm@21350
    41
  val begin_theory: string -> string list -> (string * bool) list -> bool -> theory
wenzelm@21350
    42
  val end_theory: theory -> theory
wenzelm@21350
    43
  val kill_theory: string -> unit
wenzelm@21350
    44
  val theory: string * string list * (string * bool) list
wenzelm@21350
    45
    -> Toplevel.transition -> Toplevel.transition
wenzelm@7462
    46
  val welcome: Toplevel.transition -> Toplevel.transition
wenzelm@7462
    47
  val init_toplevel: Toplevel.transition -> Toplevel.transition
wenzelm@5831
    48
  val exit: Toplevel.transition -> Toplevel.transition
wenzelm@5831
    49
  val quit: Toplevel.transition -> Toplevel.transition
wenzelm@7908
    50
  val touch_child_thys: string -> Toplevel.transition -> Toplevel.transition
wenzelm@7101
    51
  val touch_thy: string -> Toplevel.transition -> Toplevel.transition
wenzelm@7101
    52
  val remove_thy: string -> Toplevel.transition -> Toplevel.transition
wenzelm@7931
    53
  val kill_thy: string -> Toplevel.transition -> Toplevel.transition
wenzelm@9731
    54
  val pr: string list * (int option * int option) -> Toplevel.transition -> Toplevel.transition
wenzelm@8453
    55
  val disable_pr: Toplevel.transition -> Toplevel.transition
wenzelm@8453
    56
  val enable_pr: Toplevel.transition -> Toplevel.transition
wenzelm@6742
    57
  val redo: Toplevel.transition -> Toplevel.transition
wenzelm@6742
    58
  val undos_proof: int -> Toplevel.transition -> Toplevel.transition
wenzelm@7936
    59
  val kill_proof_notify: (unit -> unit) -> Toplevel.transition -> Toplevel.transition
wenzelm@6742
    60
  val kill_proof: Toplevel.transition -> Toplevel.transition
wenzelm@6742
    61
  val undo_theory: Toplevel.transition -> Toplevel.transition
wenzelm@6686
    62
  val undo: Toplevel.transition -> Toplevel.transition
wenzelm@21955
    63
  val cannot_undo: string -> Toplevel.transition -> Toplevel.transition
wenzelm@8498
    64
  val kill: Toplevel.transition -> Toplevel.transition
wenzelm@17066
    65
  val back: Toplevel.transition -> Toplevel.transition
wenzelm@26489
    66
  val ml_diag: bool -> string * Position.T -> Toplevel.transition -> Toplevel.transition
wenzelm@25793
    67
  val nested_command: Markup.property list -> string * Position.T -> Toplevel.transition
wenzelm@14950
    68
  val cd: Path.T -> Toplevel.transition -> Toplevel.transition
wenzelm@5831
    69
  val pwd: Toplevel.transition -> Toplevel.transition
wenzelm@14950
    70
  val display_drafts: Path.T list -> Toplevel.transition -> Toplevel.transition
wenzelm@14950
    71
  val print_drafts: Path.T list -> Toplevel.transition -> Toplevel.transition
wenzelm@7124
    72
  val pretty_setmargin: int -> Toplevel.transition -> Toplevel.transition
wenzelm@7308
    73
  val print_context: Toplevel.transition -> Toplevel.transition
wenzelm@20621
    74
  val print_theory: bool -> Toplevel.transition -> Toplevel.transition
wenzelm@5831
    75
  val print_syntax: Toplevel.transition -> Toplevel.transition
wenzelm@21725
    76
  val print_abbrevs: Toplevel.transition -> Toplevel.transition
wenzelm@21003
    77
  val print_facts: Toplevel.transition -> Toplevel.transition
wenzelm@24115
    78
  val print_configs: Toplevel.transition -> Toplevel.transition
wenzelm@5880
    79
  val print_theorems: Toplevel.transition -> Toplevel.transition
wenzelm@12060
    80
  val print_locales: Toplevel.transition -> Toplevel.transition
wenzelm@18135
    81
  val print_locale: bool * (Locale.expr * Element.context list)
wenzelm@12758
    82
    -> Toplevel.transition -> Toplevel.transition
ballarin@17139
    83
  val print_registrations: bool -> string -> Toplevel.transition -> Toplevel.transition
wenzelm@5831
    84
  val print_attributes: Toplevel.transition -> Toplevel.transition
wenzelm@16026
    85
  val print_simpset: Toplevel.transition -> Toplevel.transition
wenzelm@12382
    86
  val print_rules: Toplevel.transition -> Toplevel.transition
wenzelm@9219
    87
  val print_trans_rules: Toplevel.transition -> Toplevel.transition
wenzelm@5831
    88
  val print_methods: Toplevel.transition -> Toplevel.transition
wenzelm@9219
    89
  val print_antiquotations: Toplevel.transition -> Toplevel.transition
wenzelm@20574
    90
  val class_deps: Toplevel.transition -> Toplevel.transition
haftmann@22485
    91
  val thy_deps: Toplevel.transition -> Toplevel.transition
wenzelm@26336
    92
  val thm_deps: (Facts.ref * Attrib.src list) list -> Toplevel.transition -> Toplevel.transition
kleing@22340
    93
  val find_theorems: (int option * bool) * (bool * string FindTheorems.criterion) list
wenzelm@13284
    94
    -> Toplevel.transition -> Toplevel.transition
berghofe@26184
    95
  val unused_thms: (string list * string list option) option ->
berghofe@26184
    96
    Toplevel.transition -> Toplevel.transition
wenzelm@5831
    97
  val print_binds: Toplevel.transition -> Toplevel.transition
wenzelm@8369
    98
  val print_cases: Toplevel.transition -> Toplevel.transition
wenzelm@26336
    99
  val print_stmts: string list * (Facts.ref * Attrib.src list) list
wenzelm@19268
   100
    -> Toplevel.transition -> Toplevel.transition
wenzelm@26336
   101
  val print_thms: string list * (Facts.ref * Attrib.src list) list
wenzelm@10581
   102
    -> Toplevel.transition -> Toplevel.transition
wenzelm@26336
   103
  val print_prfs: bool -> string list * (Facts.ref * Attrib.src list) list option
berghofe@11524
   104
    -> Toplevel.transition -> Toplevel.transition
wenzelm@12876
   105
  val print_prop: (string list * string) -> Toplevel.transition -> Toplevel.transition
wenzelm@12876
   106
  val print_term: (string list * string) -> Toplevel.transition -> Toplevel.transition
wenzelm@12876
   107
  val print_type: (string list * string) -> Toplevel.transition -> Toplevel.transition
wenzelm@12938
   108
  val add_header: string * Position.T -> Toplevel.transition -> Toplevel.transition
wenzelm@17262
   109
  val add_chapter: xstring option * (string * Position.T) ->
wenzelm@17262
   110
    Toplevel.transition -> Toplevel.transition
wenzelm@17262
   111
  val add_section: xstring option * (string * Position.T) ->
wenzelm@17262
   112
    Toplevel.transition -> Toplevel.transition
wenzelm@17262
   113
  val add_subsection: xstring option * (string * Position.T) ->
wenzelm@17262
   114
    Toplevel.transition -> Toplevel.transition
wenzelm@17262
   115
  val add_subsubsection: xstring option * (string * Position.T) ->
wenzelm@17262
   116
    Toplevel.transition -> Toplevel.transition
wenzelm@17262
   117
  val add_text: xstring option * (string * Position.T) ->
wenzelm@17262
   118
    Toplevel.transition -> Toplevel.transition
wenzelm@12938
   119
  val add_text_raw: string * Position.T -> Toplevel.transition -> Toplevel.transition
wenzelm@12938
   120
  val add_sect: string * Position.T -> Toplevel.transition -> Toplevel.transition
wenzelm@12938
   121
  val add_subsect: string * Position.T -> Toplevel.transition -> Toplevel.transition
wenzelm@12938
   122
  val add_subsubsect: string * Position.T -> Toplevel.transition -> Toplevel.transition
wenzelm@12938
   123
  val add_txt: string * Position.T -> Toplevel.transition -> Toplevel.transition
wenzelm@12938
   124
  val add_txt_raw: string * Position.T -> Toplevel.transition -> Toplevel.transition
wenzelm@5831
   125
end;
wenzelm@5831
   126
wenzelm@5831
   127
structure IsarCmd: ISAR_CMD =
wenzelm@5831
   128
struct
wenzelm@5831
   129
wenzelm@5831
   130
wenzelm@22116
   131
(** theory declarations **)
wenzelm@22116
   132
wenzelm@22116
   133
(* generic_setup *)
wenzelm@22116
   134
wenzelm@26435
   135
fun generic_setup (txt, pos) =
wenzelm@26455
   136
  ML_Context.expression pos "val setup: theory -> theory" "Context.map_theory setup" txt
wenzelm@26435
   137
  |> Context.theory_map;
wenzelm@22116
   138
wenzelm@22116
   139
wenzelm@22116
   140
(* translation functions *)
wenzelm@22116
   141
wenzelm@22116
   142
local
wenzelm@22116
   143
wenzelm@22116
   144
fun advancedT false = ""
wenzelm@22116
   145
  | advancedT true = "Proof.context -> ";
wenzelm@22116
   146
wenzelm@22116
   147
fun advancedN false = ""
wenzelm@22116
   148
  | advancedN true = "advanced_";
wenzelm@22116
   149
wenzelm@22116
   150
in
wenzelm@22116
   151
wenzelm@26385
   152
fun parse_ast_translation (a, (txt, pos)) =
wenzelm@26455
   153
  txt |> ML_Context.expression pos
wenzelm@26455
   154
    ("val parse_ast_translation: (string * (" ^ advancedT a ^
wenzelm@22116
   155
      "Syntax.ast list -> Syntax.ast)) list")
wenzelm@22116
   156
    ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfuns (parse_ast_translation, [], [], []))")
wenzelm@22116
   157
  |> Context.theory_map;
wenzelm@22116
   158
wenzelm@26385
   159
fun parse_translation (a, (txt, pos)) =
wenzelm@26455
   160
  txt |> ML_Context.expression pos
wenzelm@26455
   161
    ("val parse_translation: (string * (" ^ advancedT a ^
wenzelm@22116
   162
      "term list -> term)) list")
wenzelm@22116
   163
    ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfuns ([], parse_translation, [], []))")
wenzelm@22116
   164
  |> Context.theory_map;
wenzelm@22116
   165
wenzelm@26385
   166
fun print_translation (a, (txt, pos)) =
wenzelm@26455
   167
  txt |> ML_Context.expression pos
wenzelm@26455
   168
    ("val print_translation: (string * (" ^ advancedT a ^
wenzelm@22116
   169
      "term list -> term)) list")
wenzelm@22116
   170
    ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfuns ([], [], print_translation, []))")
wenzelm@22116
   171
  |> Context.theory_map;
wenzelm@22116
   172
wenzelm@26385
   173
fun print_ast_translation (a, (txt, pos)) =
wenzelm@26455
   174
  txt |> ML_Context.expression pos
wenzelm@26455
   175
    ("val print_ast_translation: (string * (" ^ advancedT a ^
wenzelm@22116
   176
      "Syntax.ast list -> Syntax.ast)) list")
wenzelm@22116
   177
    ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfuns ([], [], [], print_ast_translation))")
wenzelm@22116
   178
  |> Context.theory_map;
wenzelm@22116
   179
wenzelm@26385
   180
fun typed_print_translation (a, (txt, pos)) =
wenzelm@26455
   181
  txt |> ML_Context.expression pos
wenzelm@26455
   182
    ("val typed_print_translation: (string * (" ^ advancedT a ^
wenzelm@22116
   183
      "bool -> typ -> term list -> term)) list")
wenzelm@22116
   184
    ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfunsT typed_print_translation)")
wenzelm@22116
   185
  |> Context.theory_map;
wenzelm@22116
   186
wenzelm@26385
   187
fun token_translation (txt, pos) =
wenzelm@26455
   188
  txt |> ML_Context.expression pos
wenzelm@26385
   189
    "val token_translation: (string * string * (string -> output * int)) list"
wenzelm@26385
   190
      "Context.map_theory (Sign.add_tokentrfuns token_translation)"
wenzelm@26385
   191
  |> Context.theory_map;
wenzelm@22116
   192
wenzelm@22116
   193
end;
wenzelm@22116
   194
wenzelm@22116
   195
wenzelm@22116
   196
(* oracles *)
wenzelm@22116
   197
wenzelm@26385
   198
fun oracle name typ (oracle, pos) =
wenzelm@22116
   199
  let val txt =
wenzelm@26385
   200
    "local\
wenzelm@26385
   201
    \  type T = " ^ typ ^ ";\
wenzelm@22116
   202
    \  val oracle: theory -> T -> term = " ^ oracle ^ ";\n\
wenzelm@22116
   203
    \  val name = " ^ quote name ^ ";\n\
wenzelm@22116
   204
    \  exception Arg of T;\n\
wenzelm@26463
   205
    \  val _ = Context.>> (Context.map_theory\n\
wenzelm@26463
   206
    \    (Theory.add_oracle (name, fn (thy, Arg x) => oracle thy x)));\n\
wenzelm@26425
   207
    \  val thy = ML_Context.the_global_context ();\n\
wenzelm@22116
   208
    \  val invoke_" ^ name ^ " = Thm.invoke_oracle_i thy (Sign.full_name thy name);\n\
wenzelm@22116
   209
    \in\n\
wenzelm@22116
   210
    \  fun " ^ name ^ " thy x = invoke_" ^ name ^ " (thy, Arg x);\n\
wenzelm@22116
   211
    \end;\n";
wenzelm@26455
   212
  in Context.theory_map (ML_Context.exec (fn () => ML_Context.eval false pos txt)) end;
wenzelm@22116
   213
wenzelm@22116
   214
wenzelm@21350
   215
(* axioms *)
wenzelm@21350
   216
wenzelm@21350
   217
fun add_axms f args thy =
wenzelm@21350
   218
  f (map (fn (x, srcs) => (x, map (Attrib.attribute thy) srcs)) args) thy;
wenzelm@21350
   219
wenzelm@21350
   220
val add_axioms = add_axms (snd oo PureThy.add_axioms);
wenzelm@21350
   221
wenzelm@21350
   222
fun add_defs ((unchecked, overloaded), args) =
wenzelm@21350
   223
  add_axms
wenzelm@21350
   224
    (snd oo (if unchecked then PureThy.add_defs_unchecked else PureThy.add_defs) overloaded) args;
wenzelm@21350
   225
wenzelm@21350
   226
wenzelm@21350
   227
(* facts *)
wenzelm@21350
   228
wenzelm@21350
   229
fun apply_theorems args thy =
wenzelm@21350
   230
  let val facts = Attrib.map_facts (Attrib.attribute thy) [(("", []), args)]
wenzelm@21350
   231
  in apfst (maps snd) (PureThy.note_thmss "" facts thy) end;
wenzelm@21350
   232
wenzelm@21350
   233
fun apply_theorems_i args = apfst (maps snd) o PureThy.note_thmss_i "" [(("", []), args)];
wenzelm@21350
   234
wenzelm@21350
   235
wenzelm@22087
   236
(* declarations *)
wenzelm@22087
   237
wenzelm@26385
   238
fun declaration (txt, pos) =
wenzelm@26455
   239
  txt |> ML_Context.expression pos
wenzelm@26455
   240
    "val declaration: Morphism.declaration"
wenzelm@24020
   241
    "Context.map_proof (LocalTheory.declaration declaration)"
wenzelm@26385
   242
  |> Context.proof_map;
wenzelm@22087
   243
wenzelm@22087
   244
wenzelm@22202
   245
(* simprocs *)
wenzelm@22202
   246
wenzelm@26385
   247
fun simproc_setup name lhss (proc, pos) identifier =
wenzelm@26455
   248
  ML_Context.expression pos
wenzelm@22239
   249
    "val proc: Morphism.morphism -> Simplifier.simpset -> cterm -> thm option"
wenzelm@22239
   250
  ("Context.map_proof (Simplifier.def_simproc {name = " ^ ML_Syntax.print_string name ^ ", \
wenzelm@22239
   251
    \lhss = " ^ ML_Syntax.print_strings lhss ^ ", proc = proc, \
wenzelm@22239
   252
    \identifier = Library.maps ML_Context.thms " ^ ML_Syntax.print_strings identifier ^ "})") proc
wenzelm@22202
   253
  |> Context.proof_map;
wenzelm@22202
   254
wenzelm@22202
   255
wenzelm@26671
   256
(* hide names *)
wenzelm@26671
   257
wenzelm@26671
   258
val hide_kinds =
wenzelm@26671
   259
 [("class", (Sign.intern_class, can o Sign.certify_class, Sign.hide_class)),
wenzelm@26671
   260
  ("type", (Sign.intern_type, Sign.declared_tyname, Sign.hide_type)),
wenzelm@26671
   261
  ("const", (Sign.intern_const, Sign.declared_const, Sign.hide_const)),
wenzelm@26694
   262
  ("fact", (PureThy.intern_fact, PureThy.defined_fact, PureThy.hide_fact))];
wenzelm@26671
   263
wenzelm@26671
   264
fun hide_names b (kind, xnames) thy =
wenzelm@26671
   265
  (case AList.lookup (op =) hide_kinds kind of
wenzelm@26671
   266
    SOME (intern, check, hide) =>
wenzelm@26671
   267
      let
wenzelm@26671
   268
        val names = map (intern thy) xnames;
wenzelm@26671
   269
        val bads = filter_out (check thy) names;
wenzelm@26671
   270
      in
wenzelm@26671
   271
        if null bads then fold (hide b) names thy
wenzelm@26671
   272
        else error ("Attempt to hide undeclared item(s): " ^ commas_quote bads)
wenzelm@26671
   273
      end
wenzelm@26671
   274
  | NONE => error ("Bad name space specification: " ^ quote kind));
wenzelm@26671
   275
wenzelm@26671
   276
wenzelm@21350
   277
(* goals *)
wenzelm@21350
   278
wenzelm@21350
   279
fun goal opt_chain goal stmt int =
wenzelm@21350
   280
  opt_chain #> goal NONE (K Seq.single) stmt int;
wenzelm@21350
   281
wenzelm@21350
   282
val have = goal I Proof.have;
wenzelm@21350
   283
val hence = goal Proof.chain Proof.have;
wenzelm@21350
   284
val show = goal I Proof.show;
wenzelm@21350
   285
val thus = goal Proof.chain Proof.show;
wenzelm@21350
   286
wenzelm@21350
   287
wenzelm@21350
   288
(* local endings *)
wenzelm@21350
   289
wenzelm@21350
   290
fun local_qed m = Toplevel.proofs (Proof.local_qed (m, true));
wenzelm@21350
   291
val local_terminal_proof = Toplevel.proofs o Proof.local_terminal_proof;
wenzelm@21350
   292
val local_default_proof = Toplevel.proofs Proof.local_default_proof;
wenzelm@21350
   293
val local_immediate_proof = Toplevel.proofs Proof.local_immediate_proof;
wenzelm@21350
   294
val local_done_proof = Toplevel.proofs Proof.local_done_proof;
wenzelm@21350
   295
val local_skip_proof = Toplevel.proofs' Proof.local_skip_proof;
wenzelm@21350
   296
wenzelm@21350
   297
val skip_local_qed =
wenzelm@21350
   298
  Toplevel.skip_proof (History.apply (fn i => if i > 1 then i - 1 else raise Toplevel.UNDEF));
wenzelm@21350
   299
wenzelm@21350
   300
wenzelm@21350
   301
(* global endings *)
wenzelm@21350
   302
wenzelm@21350
   303
fun global_qed m = Toplevel.end_proof (K (Proof.global_qed (m, true)));
wenzelm@21350
   304
val global_terminal_proof = Toplevel.end_proof o K o Proof.global_terminal_proof;
wenzelm@21350
   305
val global_default_proof = Toplevel.end_proof (K Proof.global_default_proof);
wenzelm@21350
   306
val global_immediate_proof = Toplevel.end_proof (K Proof.global_immediate_proof);
wenzelm@21350
   307
val global_skip_proof = Toplevel.end_proof Proof.global_skip_proof;
wenzelm@21350
   308
val global_done_proof = Toplevel.end_proof (K Proof.global_done_proof);
wenzelm@21350
   309
wenzelm@21350
   310
val skip_global_qed = Toplevel.skip_proof_to_theory (equal 1);
wenzelm@21350
   311
wenzelm@21350
   312
wenzelm@21350
   313
(* common endings *)
wenzelm@21350
   314
wenzelm@21350
   315
fun qed m = local_qed m o global_qed m o skip_local_qed o skip_global_qed;
wenzelm@21350
   316
fun terminal_proof m = local_terminal_proof m o global_terminal_proof m;
wenzelm@21350
   317
val default_proof = local_default_proof o global_default_proof;
wenzelm@21350
   318
val immediate_proof = local_immediate_proof o global_immediate_proof;
wenzelm@21350
   319
val done_proof = local_done_proof o global_done_proof;
wenzelm@21350
   320
val skip_proof = local_skip_proof o global_skip_proof;
wenzelm@21350
   321
wenzelm@21350
   322
wenzelm@21350
   323
(* init and exit *)
wenzelm@21350
   324
wenzelm@21350
   325
fun begin_theory name imports uses =
wenzelm@23897
   326
  ThyInfo.begin_theory name imports (map (apfst Path.explode) uses);
wenzelm@21350
   327
wenzelm@21566
   328
fun end_theory thy =
wenzelm@21566
   329
  if ThyInfo.check_known_thy (Context.theory_name thy) then ThyInfo.end_theory thy else thy;
wenzelm@21350
   330
wenzelm@21350
   331
val kill_theory = ThyInfo.if_known_thy ThyInfo.remove_thy;
wenzelm@21350
   332
wenzelm@21350
   333
fun theory (name, imports, uses) =
wenzelm@21350
   334
  Toplevel.init_theory (begin_theory name imports uses)
wenzelm@21350
   335
    (fn thy => (end_theory thy; ()))
wenzelm@21350
   336
    (kill_theory o Context.theory_name);
wenzelm@21350
   337
wenzelm@7462
   338
val init_toplevel = Toplevel.imperative (fn () => raise Toplevel.RESTART);
wenzelm@21350
   339
wenzelm@7462
   340
val welcome = Toplevel.imperative (writeln o Session.welcome);
wenzelm@5831
   341
wenzelm@5831
   342
val exit = Toplevel.keep (fn state =>
wenzelm@26599
   343
 (Context.set_thread_data (try Toplevel.generic_theory_of state);
wenzelm@24071
   344
  raise Toplevel.TERMINATE));
wenzelm@5831
   345
wenzelm@5831
   346
val quit = Toplevel.imperative quit;
wenzelm@5831
   347
wenzelm@7101
   348
wenzelm@7101
   349
(* touch theories *)
wenzelm@7101
   350
wenzelm@7908
   351
fun touch_child_thys name = Toplevel.imperative (fn () => ThyInfo.touch_child_thys name);
wenzelm@7101
   352
fun touch_thy name = Toplevel.imperative (fn () => ThyInfo.touch_thy name);
wenzelm@7101
   353
fun remove_thy name = Toplevel.imperative (fn () => ThyInfo.remove_thy name);
wenzelm@21350
   354
fun kill_thy name = Toplevel.imperative (fn () => kill_theory name);
wenzelm@7101
   355
wenzelm@5831
   356
wenzelm@8453
   357
(* print state *)
wenzelm@8453
   358
skalberg@15531
   359
fun set_limit _ NONE = ()
skalberg@15531
   360
  | set_limit r (SOME n) = r := n;
wenzelm@9731
   361
wenzelm@19385
   362
fun pr (modes, (lim1, lim2)) = Toplevel.keep (fn state =>
wenzelm@9731
   363
  (set_limit goals_limit lim1; set_limit ProofContext.prems_limit lim2; Toplevel.quiet := false;
wenzelm@23935
   364
    PrintMode.with_modes modes (Toplevel.print_state true) state));
wenzelm@8453
   365
wenzelm@8453
   366
val disable_pr = Toplevel.imperative (fn () => Toplevel.quiet := true);
wenzelm@8453
   367
val enable_pr = Toplevel.imperative (fn () => Toplevel.quiet := false);
wenzelm@8453
   368
wenzelm@8453
   369
wenzelm@6686
   370
(* history commands *)
wenzelm@6686
   371
wenzelm@16812
   372
val redo =
wenzelm@16812
   373
  Toplevel.history History.redo o
wenzelm@16812
   374
  Toplevel.actual_proof ProofHistory.redo o
berghofe@15237
   375
  Toplevel.skip_proof History.redo;
wenzelm@6686
   376
wenzelm@16812
   377
fun undos_proof n =
wenzelm@16812
   378
  Toplevel.actual_proof (fn prf =>
berghofe@15237
   379
    if ProofHistory.is_initial prf then raise Toplevel.UNDEF else funpow n ProofHistory.undo prf) o
berghofe@15237
   380
  Toplevel.skip_proof (fn h =>
berghofe@15237
   381
    if History.is_initial h then raise Toplevel.UNDEF else funpow n History.undo h);
wenzelm@6686
   382
wenzelm@7936
   383
fun kill_proof_notify (f: unit -> unit) = Toplevel.history (fn hist =>
wenzelm@18588
   384
  if is_some (Toplevel.theory_node (History.current hist)) then raise Toplevel.UNDEF
wenzelm@18588
   385
  else (f (); History.undo hist));
wenzelm@7936
   386
wenzelm@7936
   387
val kill_proof = kill_proof_notify (K ());
wenzelm@6686
   388
wenzelm@6742
   389
val undo_theory = Toplevel.history (fn hist =>
wenzelm@6742
   390
  if History.is_initial hist then raise Toplevel.UNDEF else History.undo hist);
wenzelm@6686
   391
wenzelm@23500
   392
val undo = Toplevel.kill o undo_theory o Toplevel.undo_exit o undos_proof 1;
wenzelm@21955
   393
wenzelm@21955
   394
fun cannot_undo "end" = undo   (*ProofGeneral legacy*)
wenzelm@21955
   395
  | cannot_undo txt = Toplevel.imperative (fn () => error ("Cannot undo " ^ quote txt));
wenzelm@21955
   396
wenzelm@21003
   397
val kill = Toplevel.kill o kill_proof;
wenzelm@17899
   398
wenzelm@17899
   399
val back =
wenzelm@17899
   400
  Toplevel.actual_proof ProofHistory.back o
wenzelm@17899
   401
  Toplevel.skip_proof (History.apply I);
wenzelm@9273
   402
wenzelm@6686
   403
wenzelm@26489
   404
(* diagnostic ML evaluation *)
wenzelm@5831
   405
wenzelm@26489
   406
fun ml_diag verbose (txt, pos) = Toplevel.keep (fn state =>
wenzelm@26489
   407
  (ML_Context.eval_in (try Toplevel.generic_theory_of state) verbose pos txt));
wenzelm@5831
   408
wenzelm@5831
   409
wenzelm@25793
   410
(* nested commands *)
wenzelm@25793
   411
wenzelm@25793
   412
fun nested_command props (str, pos) =
wenzelm@26053
   413
  let val pos' = Position.of_properties (props |> Position.default_properties pos) in
wenzelm@25793
   414
    (case OuterSyntax.parse pos' str of
wenzelm@25956
   415
      [transition] => transition
wenzelm@25793
   416
    | _ => error "exactly one command expected")
wenzelm@25793
   417
  end;
wenzelm@25793
   418
wenzelm@25793
   419
wenzelm@5831
   420
(* current working directory *)
wenzelm@5831
   421
wenzelm@14950
   422
fun cd path = Toplevel.imperative (fn () => (File.cd path));
wenzelm@21858
   423
val pwd = Toplevel.imperative (fn () => writeln (Path.implode (File.pwd ())));
wenzelm@5831
   424
wenzelm@5831
   425
wenzelm@14934
   426
(* present draft files *)
wenzelm@14934
   427
wenzelm@14934
   428
fun display_drafts files = Toplevel.imperative (fn () =>
wenzelm@16258
   429
  let val outfile = File.shell_path (Present.drafts (getenv "ISABELLE_DOC_FORMAT") files)
wenzelm@16258
   430
  in File.isatool ("display -c " ^ outfile ^ " &"); () end);
wenzelm@14934
   431
wenzelm@14934
   432
fun print_drafts files = Toplevel.imperative (fn () =>
wenzelm@16258
   433
  let val outfile = File.shell_path (Present.drafts "ps" files)
wenzelm@16258
   434
  in File.isatool ("print -c " ^ outfile); () end);
wenzelm@14934
   435
wenzelm@14934
   436
wenzelm@7124
   437
(* pretty_setmargin *)
wenzelm@7124
   438
wenzelm@7124
   439
fun pretty_setmargin n = Toplevel.imperative (fn () => Pretty.setmargin n);
wenzelm@5831
   440
wenzelm@5831
   441
wenzelm@9513
   442
(* print parts of theory and proof context *)
wenzelm@5831
   443
wenzelm@7308
   444
val print_context = Toplevel.keep Toplevel.print_state_context;
wenzelm@9513
   445
wenzelm@20621
   446
fun print_theory verbose = Toplevel.unknown_theory o
wenzelm@22872
   447
  Toplevel.keep (Pretty.writeln o ProofDisplay.pretty_full_theory verbose o Toplevel.theory_of);
wenzelm@9513
   448
wenzelm@21663
   449
val print_syntax = Toplevel.unknown_context o
wenzelm@21663
   450
  Toplevel.keep (ProofContext.print_syntax o Toplevel.context_of);
wenzelm@9513
   451
wenzelm@21725
   452
val print_abbrevs = Toplevel.unknown_context o
wenzelm@21725
   453
  Toplevel.keep (ProofContext.print_abbrevs o Toplevel.context_of);
wenzelm@21725
   454
wenzelm@21003
   455
val print_facts = Toplevel.unknown_context o Toplevel.keep (fn state =>
wenzelm@21003
   456
  ProofContext.setmp_verbose
wenzelm@21506
   457
    ProofContext.print_lthms (Toplevel.context_of state));
wenzelm@21003
   458
wenzelm@24115
   459
val print_configs = Toplevel.unknown_context o Toplevel.keep (fn state =>
wenzelm@24115
   460
  Attrib.print_configs (Toplevel.context_of state));
wenzelm@23989
   461
wenzelm@17066
   462
val print_theorems_proof = Toplevel.keep (fn state =>
wenzelm@17066
   463
  ProofContext.setmp_verbose
wenzelm@17066
   464
    ProofContext.print_lthms (Proof.context_of (Toplevel.proof_of state)));
wenzelm@17066
   465
wenzelm@18588
   466
val print_theorems_theory = Toplevel.keep (fn state =>
wenzelm@18588
   467
  Toplevel.theory_of state |>
wenzelm@18588
   468
  (case Option.map Toplevel.theory_node (History.previous (Toplevel.node_history_of state)) of
wenzelm@20957
   469
    SOME (SOME prev_thy) => ProofDisplay.print_theorems_diff (Context.theory_of prev_thy)
wenzelm@19430
   470
  | _ => ProofDisplay.print_theorems));
wenzelm@18588
   471
wenzelm@21663
   472
val print_theorems = Toplevel.unknown_context o print_theorems_theory o print_theorems_proof;
wenzelm@9513
   473
wenzelm@12060
   474
val print_locales = Toplevel.unknown_theory o
wenzelm@12060
   475
  Toplevel.keep (Locale.print_locales o Toplevel.theory_of);
wenzelm@12060
   476
wenzelm@22573
   477
fun print_locale (show_facts, (imports, body)) = Toplevel.unknown_theory o
wenzelm@19385
   478
  Toplevel.keep (fn state =>
wenzelm@22573
   479
    Locale.print_locale (Toplevel.theory_of state) show_facts imports body);
ballarin@15596
   480
ballarin@17139
   481
fun print_registrations show_wits name = Toplevel.unknown_context o
wenzelm@20957
   482
  Toplevel.keep (Toplevel.node_case
ballarin@24789
   483
      (Context.cases (Locale.print_registrations show_wits name o ProofContext.init)
ballarin@24789
   484
        (Locale.print_registrations show_wits name))
ballarin@24789
   485
    (Locale.print_registrations show_wits name o Proof.context_of));
wenzelm@12060
   486
wenzelm@9513
   487
val print_attributes = Toplevel.unknown_theory o
wenzelm@9513
   488
  Toplevel.keep (Attrib.print_attributes o Toplevel.theory_of);
wenzelm@9513
   489
wenzelm@16026
   490
val print_simpset = Toplevel.unknown_context o
wenzelm@26498
   491
  Toplevel.keep (Simplifier.print_ss o Simplifier.local_simpset_of o Toplevel.context_of);
wenzelm@16026
   492
wenzelm@12382
   493
val print_rules = Toplevel.unknown_context o
wenzelm@18639
   494
  Toplevel.keep (ContextRules.print_rules o Toplevel.context_of);
wenzelm@12382
   495
wenzelm@9513
   496
val print_trans_rules = Toplevel.unknown_context o
wenzelm@18639
   497
  Toplevel.keep (Calculation.print_rules o Toplevel.context_of);
wenzelm@9513
   498
wenzelm@9513
   499
val print_methods = Toplevel.unknown_theory o
wenzelm@9513
   500
  Toplevel.keep (Method.print_methods o Toplevel.theory_of);
wenzelm@9513
   501
wenzelm@22116
   502
val print_antiquotations = Toplevel.imperative ThyOutput.print_antiquotations;
wenzelm@5831
   503
haftmann@22485
   504
val thy_deps = Toplevel.unknown_theory o Toplevel.keep (fn state =>
haftmann@22485
   505
  let
haftmann@22485
   506
    val thy = Toplevel.theory_of state;
wenzelm@24560
   507
    val all_thys = sort ThyInfo.thy_ord (thy :: Theory.ancestors_of thy);
wenzelm@22604
   508
    val gr = all_thys |> map (fn node =>
wenzelm@22602
   509
      let
wenzelm@22602
   510
        val name = Context.theory_name node;
wenzelm@22602
   511
        val parents = map Context.theory_name (Theory.parents_of node);
wenzelm@24560
   512
        val dir = Present.session_name node;
wenzelm@24560
   513
        val unfold = not (ThyInfo.known_thy name andalso ThyInfo.is_finished name);
wenzelm@24560
   514
      in {name = name, ID = name, parents = parents, dir = dir, unfold = unfold, path = ""} end);
wenzelm@22602
   515
  in Present.display_graph gr end);
haftmann@22485
   516
wenzelm@20574
   517
val class_deps = Toplevel.unknown_theory o Toplevel.keep (fn state =>
wenzelm@20574
   518
  let
wenzelm@20574
   519
    val thy = Toplevel.theory_of state;
wenzelm@20574
   520
    val {classes = (space, algebra), ...} = Type.rep_tsig (Sign.tsig_of thy);
wenzelm@20574
   521
    val {classes, ...} = Sorts.rep_algebra algebra;
wenzelm@20574
   522
    fun entry (c, (i, (_, cs))) =
wenzelm@20574
   523
      (i, {name = NameSpace.extern space c, ID = c, parents = cs,
wenzelm@20574
   524
            dir = "", unfold = true, path = ""});
wenzelm@20574
   525
    val gr =
wenzelm@20574
   526
      Graph.fold (cons o entry) classes []
wenzelm@20574
   527
      |> sort (int_ord o pairself #1) |> map #2;
wenzelm@20574
   528
  in Present.display_graph gr end);
wenzelm@20574
   529
kleing@15964
   530
wenzelm@16026
   531
(* retrieve theorems *)
wenzelm@7615
   532
wenzelm@9513
   533
fun thm_deps args = Toplevel.unknown_theory o Toplevel.keep (fn state =>
wenzelm@21003
   534
  ThmDeps.thm_deps (Proof.get_thmss (Toplevel.enter_proof_body state) args));
wenzelm@9454
   535
wenzelm@24560
   536
fun find_theorems ((opt_lim, rem_dups), spec) =
kleing@22340
   537
  Toplevel.unknown_theory o Toplevel.keep (fn state =>
wenzelm@16026
   538
  let
wenzelm@21003
   539
    val proof_state = Toplevel.enter_proof_body state;
wenzelm@16026
   540
    val ctxt = Proof.context_of proof_state;
wenzelm@16026
   541
    val opt_goal = try Proof.get_goal proof_state |> Option.map (Thm.prop_of o #2 o #2);
kleing@22340
   542
  in FindTheorems.print_theorems ctxt opt_goal opt_lim rem_dups spec end);
wenzelm@16026
   543
wenzelm@5831
   544
berghofe@26184
   545
(* find unused theorems *)
berghofe@26184
   546
wenzelm@26186
   547
fun unused_thms opt_range = Toplevel.keep (fn state =>
wenzelm@26186
   548
  let
wenzelm@26186
   549
    val thy = Toplevel.theory_of state;
wenzelm@26186
   550
    val ctxt = Toplevel.context_of state;
wenzelm@26186
   551
    fun pretty_thm (a, th) = ProofContext.pretty_fact ctxt (a, [th]);
wenzelm@26186
   552
  in
wenzelm@26186
   553
    ThmDeps.unused_thms
wenzelm@26186
   554
      (case opt_range of
wenzelm@26694
   555
        NONE => (Theory.parents_of thy, [thy])
wenzelm@26694
   556
      | SOME (xs, NONE) => (map ThyInfo.get_theory xs, [thy])
wenzelm@26694
   557
      | SOME (xs, SOME ys) => (map ThyInfo.get_theory xs, map ThyInfo.get_theory ys))
wenzelm@26186
   558
    |> map pretty_thm |> Pretty.chunks |> Pretty.writeln
wenzelm@26186
   559
  end);
berghofe@26184
   560
berghofe@26184
   561
wenzelm@5831
   562
(* print proof context contents *)
wenzelm@5831
   563
wenzelm@21663
   564
val print_binds = Toplevel.unknown_context o Toplevel.keep (fn state =>
wenzelm@21663
   565
  ProofContext.setmp_verbose ProofContext.print_binds (Toplevel.context_of state));
wenzelm@9513
   566
wenzelm@21663
   567
val print_cases = Toplevel.unknown_context o Toplevel.keep (fn state =>
wenzelm@21663
   568
  ProofContext.setmp_verbose ProofContext.print_cases (Toplevel.context_of state));
wenzelm@5831
   569
wenzelm@5831
   570
wenzelm@19268
   571
(* print theorems, terms, types etc. *)
wenzelm@19268
   572
wenzelm@19385
   573
local
wenzelm@19385
   574
wenzelm@19385
   575
fun string_of_stmts state args =
wenzelm@19268
   576
  Proof.get_thmss state args
wenzelm@21437
   577
  |> map (Element.pretty_statement (Proof.context_of state) Thm.theoremK)
wenzelm@19385
   578
  |> Pretty.chunks2 |> Pretty.string_of;
wenzelm@5880
   579
wenzelm@19385
   580
fun string_of_thms state args =
wenzelm@12055
   581
  Pretty.string_of (ProofContext.pretty_thms (Proof.context_of state)
wenzelm@19385
   582
    (Proof.get_thmss state args));
wenzelm@5895
   583
wenzelm@19385
   584
fun string_of_prfs full state arg =
wenzelm@17066
   585
  Pretty.string_of (case arg of
skalberg@15531
   586
      NONE =>
berghofe@12125
   587
        let
wenzelm@17066
   588
          val (ctxt, (_, thm)) = Proof.get_goal state;
wenzelm@26626
   589
          val thy = ProofContext.theory_of ctxt;
wenzelm@26626
   590
          val prf = Thm.proof_of thm;
wenzelm@17066
   591
          val prop = Thm.full_prop_of thm;
berghofe@12125
   592
          val prf' = Proofterm.rewrite_proof_notypes ([], []) prf
berghofe@12125
   593
        in
wenzelm@17066
   594
          ProofContext.pretty_proof ctxt
wenzelm@17066
   595
            (if full then Reconstruct.reconstruct_proof thy prop prf' else prf')
berghofe@12125
   596
        end
skalberg@15531
   597
    | SOME args => Pretty.chunks
wenzelm@17066
   598
        (map (ProofContext.pretty_proof_of (Proof.context_of state) full)
wenzelm@19385
   599
          (Proof.get_thmss state args)));
berghofe@11524
   600
wenzelm@19385
   601
fun string_of_prop state s =
wenzelm@5831
   602
  let
wenzelm@12055
   603
    val ctxt = Proof.context_of state;
wenzelm@24508
   604
    val prop = Syntax.read_prop ctxt s;
wenzelm@24920
   605
  in Pretty.string_of (Pretty.quote (Syntax.pretty_term ctxt prop)) end;
wenzelm@5831
   606
wenzelm@19385
   607
fun string_of_term state s =
wenzelm@5831
   608
  let
wenzelm@12055
   609
    val ctxt = Proof.context_of state;
wenzelm@24508
   610
    val t = Syntax.read_term ctxt s;
wenzelm@5831
   611
    val T = Term.type_of t;
wenzelm@5831
   612
  in
wenzelm@19385
   613
    Pretty.string_of
wenzelm@24920
   614
      (Pretty.block [Pretty.quote (Syntax.pretty_term ctxt t), Pretty.fbrk,
wenzelm@24920
   615
        Pretty.str "::", Pretty.brk 1, Pretty.quote (Syntax.pretty_typ ctxt T)])
wenzelm@9128
   616
  end;
wenzelm@5831
   617
wenzelm@19385
   618
fun string_of_type state s =
wenzelm@5831
   619
  let
wenzelm@12055
   620
    val ctxt = Proof.context_of state;
wenzelm@25331
   621
    val T = Syntax.read_typ ctxt s;
wenzelm@24920
   622
  in Pretty.string_of (Pretty.quote (Syntax.pretty_typ ctxt T)) end;
wenzelm@9128
   623
wenzelm@23935
   624
fun print_item string_of (modes, arg) = Toplevel.keep (fn state =>
wenzelm@23935
   625
  PrintMode.with_modes modes (fn () =>
wenzelm@23935
   626
    writeln (string_of (Toplevel.enter_proof_body state) arg)) ());
wenzelm@19385
   627
wenzelm@19385
   628
in
wenzelm@9128
   629
wenzelm@19268
   630
val print_stmts = print_item string_of_stmts;
wenzelm@12876
   631
val print_thms = print_item string_of_thms;
wenzelm@19385
   632
val print_prfs = print_item o string_of_prfs;
wenzelm@12876
   633
val print_prop = print_item string_of_prop;
wenzelm@12876
   634
val print_term = print_item string_of_term;
wenzelm@12876
   635
val print_type = print_item string_of_type;
wenzelm@5831
   636
wenzelm@19385
   637
end;
wenzelm@19385
   638
wenzelm@12938
   639
wenzelm@12938
   640
(* markup commands *)
wenzelm@12938
   641
wenzelm@12938
   642
fun add_header s = Toplevel.keep' (fn int => fn state =>
wenzelm@21858
   643
  (if Toplevel.is_toplevel state then () else raise Toplevel.UNDEF;
wenzelm@19057
   644
   if int then OuterSyntax.check_text s NONE else ()));
wenzelm@12938
   645
wenzelm@12953
   646
local
wenzelm@12953
   647
wenzelm@19057
   648
fun present _ txt true node = OuterSyntax.check_text txt (SOME node)
wenzelm@26415
   649
  | present f (s, _) false node = Context.setmp_thread_data
wenzelm@26415
   650
      (try (Toplevel.cases_node I (Context.Proof o Proof.context_of)) node) f s;
wenzelm@12953
   651
wenzelm@19057
   652
fun present_local_theory f (loc, txt) = Toplevel.present_local_theory loc (present f txt);
wenzelm@19057
   653
fun present_proof f txt = Toplevel.print o Toplevel.present_proof (present f txt);
wenzelm@12938
   654
wenzelm@12953
   655
in
wenzelm@12953
   656
wenzelm@19057
   657
val add_chapter       = present_local_theory Present.section;
wenzelm@19057
   658
val add_section       = present_local_theory Present.section;
wenzelm@19057
   659
val add_subsection    = present_local_theory Present.subsection;
wenzelm@19057
   660
val add_subsubsection = present_local_theory Present.subsubsection;
wenzelm@19057
   661
val add_text          = present_local_theory (K ());
wenzelm@19057
   662
fun add_text_raw txt  = present_local_theory (K ()) (NONE, txt);
wenzelm@19057
   663
val add_txt           = present_proof (K ());
wenzelm@19057
   664
val add_txt_raw       = add_txt;
wenzelm@19057
   665
val add_sect          = add_txt;
wenzelm@19057
   666
val add_subsect       = add_txt;
wenzelm@19057
   667
val add_subsubsect    = add_txt;
wenzelm@12938
   668
wenzelm@5831
   669
end;
wenzelm@12953
   670
wenzelm@12953
   671
end;