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