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