src/Pure/Isar/isar_cmd.ML
author haftmann
Tue Mar 20 15:52:42 2007 +0100 (2007-03-20 ago)
changeset 22485 3a7d623485fa
parent 22340 275802767bf3
child 22573 2ac646ab2f6c
permissions -rw-r--r--
added theory dependency graph
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
haftmann@22485
    96
  val thy_deps: Toplevel.transition -> Toplevel.transition
wenzelm@20574
    97
  val thm_deps: (thmref * Attrib.src list) list -> Toplevel.transition -> Toplevel.transition
kleing@22340
    98
  val find_theorems: (int option * bool) * (bool * string FindTheorems.criterion) list
wenzelm@13284
    99
    -> Toplevel.transition -> Toplevel.transition
wenzelm@5831
   100
  val print_binds: Toplevel.transition -> Toplevel.transition
wenzelm@8369
   101
  val print_cases: Toplevel.transition -> Toplevel.transition
wenzelm@19268
   102
  val print_stmts: string list * (thmref * Attrib.src list) list
wenzelm@19268
   103
    -> Toplevel.transition -> Toplevel.transition
wenzelm@15703
   104
  val print_thms: string list * (thmref * Attrib.src list) list
wenzelm@10581
   105
    -> Toplevel.transition -> Toplevel.transition
wenzelm@15703
   106
  val print_prfs: bool -> string list * (thmref * Attrib.src list) list option
berghofe@11524
   107
    -> Toplevel.transition -> Toplevel.transition
wenzelm@12876
   108
  val print_prop: (string list * string) -> Toplevel.transition -> Toplevel.transition
wenzelm@12876
   109
  val print_term: (string list * string) -> Toplevel.transition -> Toplevel.transition
wenzelm@12876
   110
  val print_type: (string list * string) -> Toplevel.transition -> Toplevel.transition
wenzelm@12938
   111
  val add_header: string * Position.T -> Toplevel.transition -> Toplevel.transition
wenzelm@17262
   112
  val add_chapter: xstring option * (string * Position.T) ->
wenzelm@17262
   113
    Toplevel.transition -> Toplevel.transition
wenzelm@17262
   114
  val add_section: xstring option * (string * Position.T) ->
wenzelm@17262
   115
    Toplevel.transition -> Toplevel.transition
wenzelm@17262
   116
  val add_subsection: xstring option * (string * Position.T) ->
wenzelm@17262
   117
    Toplevel.transition -> Toplevel.transition
wenzelm@17262
   118
  val add_subsubsection: xstring option * (string * Position.T) ->
wenzelm@17262
   119
    Toplevel.transition -> Toplevel.transition
wenzelm@17262
   120
  val add_text: xstring option * (string * Position.T) ->
wenzelm@17262
   121
    Toplevel.transition -> Toplevel.transition
wenzelm@12938
   122
  val add_text_raw: string * Position.T -> Toplevel.transition -> Toplevel.transition
wenzelm@12938
   123
  val add_sect: string * Position.T -> Toplevel.transition -> Toplevel.transition
wenzelm@12938
   124
  val add_subsect: string * Position.T -> Toplevel.transition -> Toplevel.transition
wenzelm@12938
   125
  val add_subsubsect: string * Position.T -> Toplevel.transition -> Toplevel.transition
wenzelm@12938
   126
  val add_txt: string * Position.T -> Toplevel.transition -> Toplevel.transition
wenzelm@12938
   127
  val add_txt_raw: string * Position.T -> Toplevel.transition -> Toplevel.transition
wenzelm@5831
   128
end;
wenzelm@5831
   129
wenzelm@5831
   130
structure IsarCmd: ISAR_CMD =
wenzelm@5831
   131
struct
wenzelm@5831
   132
wenzelm@5831
   133
wenzelm@22116
   134
(** theory declarations **)
wenzelm@22116
   135
wenzelm@22116
   136
(* generic_setup *)
wenzelm@22116
   137
wenzelm@22116
   138
fun generic_setup NONE = (fn thy => thy |> Context.setup ())
wenzelm@22116
   139
  | generic_setup (SOME txt) =
wenzelm@22116
   140
      ML_Context.use_let "val setup: theory -> theory" "Context.map_theory setup" txt
wenzelm@22116
   141
      |> Context.theory_map;
wenzelm@22116
   142
wenzelm@22116
   143
wenzelm@22116
   144
(* translation functions *)
wenzelm@22116
   145
wenzelm@22116
   146
local
wenzelm@22116
   147
wenzelm@22116
   148
fun advancedT false = ""
wenzelm@22116
   149
  | advancedT true = "Proof.context -> ";
wenzelm@22116
   150
wenzelm@22116
   151
fun advancedN false = ""
wenzelm@22116
   152
  | advancedN true = "advanced_";
wenzelm@22116
   153
wenzelm@22116
   154
in
wenzelm@22116
   155
wenzelm@22116
   156
fun parse_ast_translation (a, txt) =
wenzelm@22116
   157
  txt |> ML_Context.use_let ("val parse_ast_translation: (string * (" ^ advancedT a ^
wenzelm@22116
   158
      "Syntax.ast list -> Syntax.ast)) list")
wenzelm@22116
   159
    ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfuns (parse_ast_translation, [], [], []))")
wenzelm@22116
   160
  |> Context.theory_map;
wenzelm@22116
   161
wenzelm@22116
   162
fun parse_translation (a, txt) =
wenzelm@22116
   163
  txt |> ML_Context.use_let ("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@22116
   168
fun print_translation (a, txt) =
wenzelm@22116
   169
  txt |> ML_Context.use_let ("val print_translation: (string * (" ^ advancedT a ^
wenzelm@22116
   170
      "term list -> term)) list")
wenzelm@22116
   171
    ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfuns ([], [], print_translation, []))")
wenzelm@22116
   172
  |> Context.theory_map;
wenzelm@22116
   173
wenzelm@22116
   174
fun print_ast_translation (a, txt) =
wenzelm@22116
   175
  txt |> ML_Context.use_let ("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@22116
   180
fun typed_print_translation (a, txt) =
wenzelm@22116
   181
  txt |> ML_Context.use_let ("val typed_print_translation: (string * (" ^ advancedT a ^
wenzelm@22116
   182
      "bool -> typ -> term list -> term)) list")
wenzelm@22116
   183
    ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfunsT typed_print_translation)")
wenzelm@22116
   184
  |> Context.theory_map;
wenzelm@22116
   185
wenzelm@22116
   186
val token_translation =
wenzelm@22116
   187
  ML_Context.use_let "val token_translation: (string * string * (string -> string * real)) list"
wenzelm@22116
   188
    "Context.map_theory (Sign.add_tokentrfuns token_translation)"
wenzelm@22116
   189
  #> Context.theory_map;
wenzelm@22116
   190
wenzelm@22116
   191
end;
wenzelm@22116
   192
wenzelm@22116
   193
wenzelm@22116
   194
(* oracles *)
wenzelm@22116
   195
wenzelm@22239
   196
fun oracle name typ oracle =
wenzelm@22116
   197
  let val txt =
wenzelm@22116
   198
    "local\n\
wenzelm@22239
   199
    \  type T = " ^ typ ^ ";\n\
wenzelm@22116
   200
    \  val oracle: theory -> T -> term = " ^ oracle ^ ";\n\
wenzelm@22116
   201
    \  val name = " ^ quote name ^ ";\n\
wenzelm@22116
   202
    \  exception Arg of T;\n\
wenzelm@22116
   203
    \  val _ = ML_Context.>> (Theory.add_oracle (name, fn (thy, Arg x) => oracle thy x));\n\
wenzelm@22116
   204
    \  val thy = ML_Context.the_context ();\n\
wenzelm@22116
   205
    \  val invoke_" ^ name ^ " = Thm.invoke_oracle_i thy (Sign.full_name thy name);\n\
wenzelm@22116
   206
    \in\n\
wenzelm@22116
   207
    \  fun " ^ name ^ " thy x = invoke_" ^ name ^ " (thy, Arg x);\n\
wenzelm@22116
   208
    \end;\n";
wenzelm@22116
   209
  in ML_Context.use_mltext_update txt false end
wenzelm@22116
   210
  |> Context.theory_map;
wenzelm@22116
   211
wenzelm@22116
   212
wenzelm@21350
   213
(* axioms *)
wenzelm@21350
   214
wenzelm@21350
   215
fun add_axms f args thy =
wenzelm@21350
   216
  f (map (fn (x, srcs) => (x, map (Attrib.attribute thy) srcs)) args) thy;
wenzelm@21350
   217
wenzelm@21350
   218
val add_axioms = add_axms (snd oo PureThy.add_axioms);
wenzelm@21350
   219
wenzelm@21350
   220
fun add_defs ((unchecked, overloaded), args) =
wenzelm@21350
   221
  add_axms
wenzelm@21350
   222
    (snd oo (if unchecked then PureThy.add_defs_unchecked else PureThy.add_defs) overloaded) args;
wenzelm@21350
   223
wenzelm@21350
   224
wenzelm@21350
   225
(* facts *)
wenzelm@21350
   226
wenzelm@21350
   227
fun apply_theorems args thy =
wenzelm@21350
   228
  let val facts = Attrib.map_facts (Attrib.attribute thy) [(("", []), args)]
wenzelm@21350
   229
  in apfst (maps snd) (PureThy.note_thmss "" facts thy) end;
wenzelm@21350
   230
wenzelm@21350
   231
fun apply_theorems_i args = apfst (maps snd) o PureThy.note_thmss_i "" [(("", []), args)];
wenzelm@21350
   232
wenzelm@21350
   233
wenzelm@22087
   234
(* declarations *)
wenzelm@22087
   235
wenzelm@22087
   236
val declaration =
wenzelm@22116
   237
  ML_Context.use_let
wenzelm@22116
   238
    "val declaration: Morphism.morphism -> Context.generic -> Context.generic"
wenzelm@22087
   239
  "Context.map_proof (LocalTheory.declaration declaration)"
wenzelm@22087
   240
  #> Context.proof_map;
wenzelm@22087
   241
wenzelm@22087
   242
wenzelm@22202
   243
(* simprocs *)
wenzelm@22202
   244
wenzelm@22239
   245
fun simproc_setup name lhss proc identifier =
wenzelm@22202
   246
  ML_Context.use_let
wenzelm@22239
   247
    "val proc: Morphism.morphism -> Simplifier.simpset -> cterm -> thm option"
wenzelm@22239
   248
  ("Context.map_proof (Simplifier.def_simproc {name = " ^ ML_Syntax.print_string name ^ ", \
wenzelm@22239
   249
    \lhss = " ^ ML_Syntax.print_strings lhss ^ ", proc = proc, \
wenzelm@22239
   250
    \identifier = Library.maps ML_Context.thms " ^ ML_Syntax.print_strings identifier ^ "})") proc
wenzelm@22202
   251
  |> Context.proof_map;
wenzelm@22202
   252
wenzelm@22202
   253
wenzelm@21350
   254
(* goals *)
wenzelm@21350
   255
wenzelm@21350
   256
fun goal opt_chain goal stmt int =
wenzelm@21350
   257
  opt_chain #> goal NONE (K Seq.single) stmt int;
wenzelm@21350
   258
wenzelm@21350
   259
val have = goal I Proof.have;
wenzelm@21350
   260
val hence = goal Proof.chain Proof.have;
wenzelm@21350
   261
val show = goal I Proof.show;
wenzelm@21350
   262
val thus = goal Proof.chain Proof.show;
wenzelm@21350
   263
wenzelm@21350
   264
wenzelm@21350
   265
(* local endings *)
wenzelm@21350
   266
wenzelm@21350
   267
fun local_qed m = Toplevel.proofs (Proof.local_qed (m, true));
wenzelm@21350
   268
val local_terminal_proof = Toplevel.proofs o Proof.local_terminal_proof;
wenzelm@21350
   269
val local_default_proof = Toplevel.proofs Proof.local_default_proof;
wenzelm@21350
   270
val local_immediate_proof = Toplevel.proofs Proof.local_immediate_proof;
wenzelm@21350
   271
val local_done_proof = Toplevel.proofs Proof.local_done_proof;
wenzelm@21350
   272
val local_skip_proof = Toplevel.proofs' Proof.local_skip_proof;
wenzelm@21350
   273
wenzelm@21350
   274
val skip_local_qed =
wenzelm@21350
   275
  Toplevel.skip_proof (History.apply (fn i => if i > 1 then i - 1 else raise Toplevel.UNDEF));
wenzelm@21350
   276
wenzelm@21350
   277
wenzelm@21350
   278
(* global endings *)
wenzelm@21350
   279
wenzelm@21350
   280
fun global_qed m = Toplevel.end_proof (K (Proof.global_qed (m, true)));
wenzelm@21350
   281
val global_terminal_proof = Toplevel.end_proof o K o Proof.global_terminal_proof;
wenzelm@21350
   282
val global_default_proof = Toplevel.end_proof (K Proof.global_default_proof);
wenzelm@21350
   283
val global_immediate_proof = Toplevel.end_proof (K Proof.global_immediate_proof);
wenzelm@21350
   284
val global_skip_proof = Toplevel.end_proof Proof.global_skip_proof;
wenzelm@21350
   285
val global_done_proof = Toplevel.end_proof (K Proof.global_done_proof);
wenzelm@21350
   286
wenzelm@21350
   287
val skip_global_qed = Toplevel.skip_proof_to_theory (equal 1);
wenzelm@21350
   288
wenzelm@21350
   289
wenzelm@21350
   290
(* common endings *)
wenzelm@21350
   291
wenzelm@21350
   292
fun qed m = local_qed m o global_qed m o skip_local_qed o skip_global_qed;
wenzelm@21350
   293
fun terminal_proof m = local_terminal_proof m o global_terminal_proof m;
wenzelm@21350
   294
val default_proof = local_default_proof o global_default_proof;
wenzelm@21350
   295
val immediate_proof = local_immediate_proof o global_immediate_proof;
wenzelm@21350
   296
val done_proof = local_done_proof o global_done_proof;
wenzelm@21350
   297
val skip_proof = local_skip_proof o global_skip_proof;
wenzelm@21350
   298
wenzelm@21350
   299
wenzelm@21350
   300
(* init and exit *)
wenzelm@21350
   301
wenzelm@21350
   302
fun begin_theory name imports uses =
wenzelm@21858
   303
  ThyInfo.begin_theory Present.begin_theory name imports (map (apfst Path.explode) uses);
wenzelm@21350
   304
wenzelm@21566
   305
fun end_theory thy =
wenzelm@21566
   306
  if ThyInfo.check_known_thy (Context.theory_name thy) then ThyInfo.end_theory thy else thy;
wenzelm@21350
   307
wenzelm@21350
   308
val kill_theory = ThyInfo.if_known_thy ThyInfo.remove_thy;
wenzelm@21350
   309
wenzelm@21350
   310
fun theory (name, imports, uses) =
wenzelm@21350
   311
  Toplevel.init_theory (begin_theory name imports uses)
wenzelm@21350
   312
    (fn thy => (end_theory thy; ()))
wenzelm@21350
   313
    (kill_theory o Context.theory_name);
wenzelm@21350
   314
wenzelm@7462
   315
val init_toplevel = Toplevel.imperative (fn () => raise Toplevel.RESTART);
wenzelm@21350
   316
wenzelm@7462
   317
val welcome = Toplevel.imperative (writeln o Session.welcome);
wenzelm@5831
   318
wenzelm@5831
   319
val exit = Toplevel.keep (fn state =>
wenzelm@22116
   320
  (ML_Context.set_context (try Toplevel.generic_theory_of state); raise Toplevel.TERMINATE));
wenzelm@5831
   321
wenzelm@5831
   322
val quit = Toplevel.imperative quit;
wenzelm@5831
   323
wenzelm@7101
   324
wenzelm@7101
   325
(* touch theories *)
wenzelm@7101
   326
wenzelm@7908
   327
fun touch_child_thys name = Toplevel.imperative (fn () => ThyInfo.touch_child_thys name);
wenzelm@7101
   328
val touch_all_thys = Toplevel.imperative ThyInfo.touch_all_thys;
wenzelm@7101
   329
fun touch_thy name = Toplevel.imperative (fn () => ThyInfo.touch_thy name);
wenzelm@7101
   330
fun remove_thy name = Toplevel.imperative (fn () => ThyInfo.remove_thy name);
wenzelm@21350
   331
fun kill_thy name = Toplevel.imperative (fn () => kill_theory name);
wenzelm@7101
   332
wenzelm@5831
   333
wenzelm@8453
   334
(* print state *)
wenzelm@8453
   335
wenzelm@8463
   336
fun with_modes modes e =
wenzelm@8463
   337
  Library.setmp print_mode (modes @ ! print_mode) e ();
wenzelm@8463
   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@19385
   344
    with_modes modes (fn () => 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@21955
   372
val undo = Toplevel.kill o undos_proof 1 o undo_theory o Toplevel.undo_exit;
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@22116
   387
  ML_Context.setmp (try Toplevel.generic_theory_of state) (ThyInfo.load_file false) path);
wenzelm@5831
   388
wenzelm@5831
   389
(*passes changes of theory context*)
wenzelm@22116
   390
val use_mltext_theory = Toplevel.theory' o (Context.theory_map oo ML_Context.use_mltext_update);
wenzelm@5831
   391
wenzelm@5831
   392
(*ignore result theory context*)
wenzelm@12876
   393
fun use_mltext v txt = Toplevel.keep' (fn verb => fn state =>
wenzelm@22116
   394
  (ML_Context.use_mltext txt (v andalso verb) (try Toplevel.generic_theory_of state)));
wenzelm@5831
   395
wenzelm@20927
   396
val use_commit = Toplevel.imperative Secure.commit;
wenzelm@5831
   397
wenzelm@5831
   398
wenzelm@5831
   399
(* current working directory *)
wenzelm@5831
   400
wenzelm@14950
   401
fun cd path = Toplevel.imperative (fn () => (File.cd path));
wenzelm@21858
   402
val pwd = Toplevel.imperative (fn () => writeln (Path.implode (File.pwd ())));
wenzelm@5831
   403
wenzelm@5831
   404
wenzelm@5831
   405
(* load theory files *)
wenzelm@5831
   406
wenzelm@22116
   407
fun use_thy name = Toplevel.imperative (fn () => ML_Context.save ThyInfo.use_thy name);
wenzelm@22116
   408
fun use_thy_only name = Toplevel.imperative (fn () => ML_Context.save ThyInfo.use_thy_only name);
wenzelm@22116
   409
fun update_thy name = Toplevel.imperative (fn () => ML_Context.save ThyInfo.update_thy name);
wenzelm@7124
   410
fun update_thy_only name =
wenzelm@22116
   411
  Toplevel.imperative (fn () => ML_Context.save ThyInfo.update_thy_only name);
wenzelm@7124
   412
wenzelm@7124
   413
wenzelm@14934
   414
(* present draft files *)
wenzelm@14934
   415
wenzelm@14934
   416
fun display_drafts files = Toplevel.imperative (fn () =>
wenzelm@16258
   417
  let val outfile = File.shell_path (Present.drafts (getenv "ISABELLE_DOC_FORMAT") files)
wenzelm@16258
   418
  in File.isatool ("display -c " ^ outfile ^ " &"); () end);
wenzelm@14934
   419
wenzelm@14934
   420
fun print_drafts files = Toplevel.imperative (fn () =>
wenzelm@16258
   421
  let val outfile = File.shell_path (Present.drafts "ps" files)
wenzelm@16258
   422
  in File.isatool ("print -c " ^ outfile); () end);
wenzelm@14934
   423
wenzelm@14934
   424
wenzelm@7124
   425
(* pretty_setmargin *)
wenzelm@7124
   426
wenzelm@7124
   427
fun pretty_setmargin n = Toplevel.imperative (fn () => Pretty.setmargin n);
wenzelm@5831
   428
wenzelm@5831
   429
wenzelm@9513
   430
(* print parts of theory and proof context *)
wenzelm@5831
   431
wenzelm@7308
   432
val print_context = Toplevel.keep Toplevel.print_state_context;
wenzelm@9513
   433
wenzelm@20621
   434
fun print_theory verbose = Toplevel.unknown_theory o
wenzelm@20621
   435
  Toplevel.keep (ProofDisplay.print_full_theory verbose o Toplevel.theory_of);
wenzelm@9513
   436
wenzelm@21663
   437
val print_syntax = Toplevel.unknown_context o
wenzelm@21663
   438
  Toplevel.keep (ProofContext.print_syntax o Toplevel.context_of);
wenzelm@9513
   439
wenzelm@21725
   440
val print_abbrevs = Toplevel.unknown_context o
wenzelm@21725
   441
  Toplevel.keep (ProofContext.print_abbrevs o Toplevel.context_of);
wenzelm@21725
   442
wenzelm@21003
   443
val print_facts = Toplevel.unknown_context o Toplevel.keep (fn state =>
wenzelm@21003
   444
  ProofContext.setmp_verbose
wenzelm@21506
   445
    ProofContext.print_lthms (Toplevel.context_of state));
wenzelm@21003
   446
wenzelm@17066
   447
val print_theorems_proof = Toplevel.keep (fn state =>
wenzelm@17066
   448
  ProofContext.setmp_verbose
wenzelm@17066
   449
    ProofContext.print_lthms (Proof.context_of (Toplevel.proof_of state)));
wenzelm@17066
   450
wenzelm@18588
   451
val print_theorems_theory = Toplevel.keep (fn state =>
wenzelm@18588
   452
  Toplevel.theory_of state |>
wenzelm@18588
   453
  (case Option.map Toplevel.theory_node (History.previous (Toplevel.node_history_of state)) of
wenzelm@20957
   454
    SOME (SOME prev_thy) => ProofDisplay.print_theorems_diff (Context.theory_of prev_thy)
wenzelm@19430
   455
  | _ => ProofDisplay.print_theorems));
wenzelm@18588
   456
wenzelm@21663
   457
val print_theorems = Toplevel.unknown_context o print_theorems_theory o print_theorems_proof;
wenzelm@9513
   458
wenzelm@12060
   459
val print_locales = Toplevel.unknown_theory o
wenzelm@12060
   460
  Toplevel.keep (Locale.print_locales o Toplevel.theory_of);
wenzelm@12060
   461
wenzelm@19385
   462
fun print_locale (show_facts, (import, body)) = Toplevel.unknown_theory o
wenzelm@19385
   463
  Toplevel.keep (fn state =>
wenzelm@19385
   464
    Locale.print_locale (Toplevel.theory_of state) show_facts import body);
ballarin@15596
   465
ballarin@17139
   466
fun print_registrations show_wits name = Toplevel.unknown_context o
wenzelm@20957
   467
  Toplevel.keep (Toplevel.node_case
wenzelm@20957
   468
      (Context.cases (Locale.print_global_registrations show_wits name)
wenzelm@20957
   469
        (Locale.print_local_registrations show_wits name))
ballarin@17139
   470
    (Locale.print_local_registrations show_wits name o Proof.context_of));
wenzelm@12060
   471
wenzelm@9513
   472
val print_attributes = Toplevel.unknown_theory o
wenzelm@9513
   473
  Toplevel.keep (Attrib.print_attributes o Toplevel.theory_of);
wenzelm@9513
   474
wenzelm@16026
   475
val print_simpset = Toplevel.unknown_context o
wenzelm@20957
   476
  Toplevel.keep (Toplevel.node_case
wenzelm@20957
   477
    (Context.cases Simplifier.print_simpset Simplifier.print_local_simpset)
wenzelm@16026
   478
    (Simplifier.print_local_simpset o Proof.context_of));
wenzelm@16026
   479
wenzelm@12382
   480
val print_rules = Toplevel.unknown_context o
wenzelm@18639
   481
  Toplevel.keep (ContextRules.print_rules o Toplevel.context_of);
wenzelm@12382
   482
wenzelm@11666
   483
val print_induct_rules = Toplevel.unknown_context o
wenzelm@18639
   484
  Toplevel.keep (InductAttrib.print_rules o Toplevel.context_of);
wenzelm@11666
   485
wenzelm@9513
   486
val print_trans_rules = Toplevel.unknown_context o
wenzelm@18639
   487
  Toplevel.keep (Calculation.print_rules o Toplevel.context_of);
wenzelm@9513
   488
wenzelm@9513
   489
val print_methods = Toplevel.unknown_theory o
wenzelm@9513
   490
  Toplevel.keep (Method.print_methods o Toplevel.theory_of);
wenzelm@9513
   491
wenzelm@22116
   492
val print_antiquotations = Toplevel.imperative ThyOutput.print_antiquotations;
wenzelm@5831
   493
haftmann@22485
   494
val thy_deps = Toplevel.unknown_theory o Toplevel.keep (fn state =>
haftmann@22485
   495
  let
haftmann@22485
   496
    val thy = Toplevel.theory_of state;
haftmann@22485
   497
    val gr = Theory.dep_graph thy;
haftmann@22485
   498
    fun mk_entry (name, ((), (_, parents))) =
haftmann@22485
   499
      { name = name, ID = name, dir = "", unfold = true,
haftmann@22485
   500
        path = "", parents = parents };
haftmann@22485
   501
    val prgr = Graph.fold ((fn x => fn xs => xs @ [x]) o mk_entry) gr [];
haftmann@22485
   502
  in Present.display_graph prgr end);
haftmann@22485
   503
wenzelm@20574
   504
val class_deps = Toplevel.unknown_theory o Toplevel.keep (fn state =>
wenzelm@20574
   505
  let
wenzelm@20574
   506
    val thy = Toplevel.theory_of state;
wenzelm@20574
   507
    val {classes = (space, algebra), ...} = Type.rep_tsig (Sign.tsig_of thy);
wenzelm@20574
   508
    val {classes, ...} = Sorts.rep_algebra algebra;
wenzelm@20574
   509
    fun entry (c, (i, (_, cs))) =
wenzelm@20574
   510
      (i, {name = NameSpace.extern space c, ID = c, parents = cs,
wenzelm@20574
   511
            dir = "", unfold = true, path = ""});
wenzelm@20574
   512
    val gr =
wenzelm@20574
   513
      Graph.fold (cons o entry) classes []
wenzelm@20574
   514
      |> sort (int_ord o pairself #1) |> map #2;
wenzelm@20574
   515
  in Present.display_graph gr end);
wenzelm@20574
   516
kleing@15964
   517
wenzelm@16026
   518
(* retrieve theorems *)
wenzelm@7615
   519
wenzelm@9513
   520
fun thm_deps args = Toplevel.unknown_theory o Toplevel.keep (fn state =>
wenzelm@21003
   521
  ThmDeps.thm_deps (Proof.get_thmss (Toplevel.enter_proof_body state) args));
wenzelm@9454
   522
kleing@22340
   523
fun find_theorems ((opt_lim, rem_dups), spec) = 
kleing@22340
   524
  Toplevel.unknown_theory o Toplevel.keep (fn state =>
wenzelm@16026
   525
  let
wenzelm@21003
   526
    val proof_state = Toplevel.enter_proof_body state;
wenzelm@16026
   527
    val ctxt = Proof.context_of proof_state;
wenzelm@16026
   528
    val opt_goal = try Proof.get_goal proof_state |> Option.map (Thm.prop_of o #2 o #2);
kleing@22340
   529
  in FindTheorems.print_theorems ctxt opt_goal opt_lim rem_dups spec end);
wenzelm@16026
   530
wenzelm@5831
   531
wenzelm@5831
   532
(* print proof context contents *)
wenzelm@5831
   533
wenzelm@21663
   534
val print_binds = Toplevel.unknown_context o Toplevel.keep (fn state =>
wenzelm@21663
   535
  ProofContext.setmp_verbose ProofContext.print_binds (Toplevel.context_of state));
wenzelm@9513
   536
wenzelm@21663
   537
val print_cases = Toplevel.unknown_context o Toplevel.keep (fn state =>
wenzelm@21663
   538
  ProofContext.setmp_verbose ProofContext.print_cases (Toplevel.context_of state));
wenzelm@5831
   539
wenzelm@5831
   540
wenzelm@19268
   541
(* print theorems, terms, types etc. *)
wenzelm@19268
   542
wenzelm@19385
   543
local
wenzelm@19385
   544
wenzelm@19385
   545
fun string_of_stmts state args =
wenzelm@19268
   546
  Proof.get_thmss state args
wenzelm@21437
   547
  |> map (Element.pretty_statement (Proof.context_of state) Thm.theoremK)
wenzelm@19385
   548
  |> Pretty.chunks2 |> Pretty.string_of;
wenzelm@5880
   549
wenzelm@19385
   550
fun string_of_thms state args =
wenzelm@12055
   551
  Pretty.string_of (ProofContext.pretty_thms (Proof.context_of state)
wenzelm@19385
   552
    (Proof.get_thmss state args));
wenzelm@5895
   553
wenzelm@19385
   554
fun string_of_prfs full state arg =
wenzelm@17066
   555
  Pretty.string_of (case arg of
skalberg@15531
   556
      NONE =>
berghofe@12125
   557
        let
wenzelm@17066
   558
          val (ctxt, (_, thm)) = Proof.get_goal state;
wenzelm@17066
   559
          val {thy, der = (_, prf), ...} = Thm.rep_thm thm;
wenzelm@17066
   560
          val prop = Thm.full_prop_of thm;
berghofe@12125
   561
          val prf' = Proofterm.rewrite_proof_notypes ([], []) prf
berghofe@12125
   562
        in
wenzelm@17066
   563
          ProofContext.pretty_proof ctxt
wenzelm@17066
   564
            (if full then Reconstruct.reconstruct_proof thy prop prf' else prf')
berghofe@12125
   565
        end
skalberg@15531
   566
    | SOME args => Pretty.chunks
wenzelm@17066
   567
        (map (ProofContext.pretty_proof_of (Proof.context_of state) full)
wenzelm@19385
   568
          (Proof.get_thmss state args)));
berghofe@11524
   569
wenzelm@19385
   570
fun string_of_prop state s =
wenzelm@5831
   571
  let
wenzelm@12055
   572
    val ctxt = Proof.context_of state;
wenzelm@12055
   573
    val prop = ProofContext.read_prop ctxt s;
wenzelm@19385
   574
  in Pretty.string_of (Pretty.quote (ProofContext.pretty_term ctxt prop)) end;
wenzelm@5831
   575
wenzelm@19385
   576
fun string_of_term state s =
wenzelm@5831
   577
  let
wenzelm@12055
   578
    val ctxt = Proof.context_of state;
wenzelm@12055
   579
    val t = ProofContext.read_term ctxt s;
wenzelm@5831
   580
    val T = Term.type_of t;
wenzelm@5831
   581
  in
wenzelm@19385
   582
    Pretty.string_of
wenzelm@12055
   583
      (Pretty.block [Pretty.quote (ProofContext.pretty_term ctxt t), Pretty.fbrk,
wenzelm@19385
   584
        Pretty.str "::", Pretty.brk 1, Pretty.quote (ProofContext.pretty_typ ctxt T)])
wenzelm@9128
   585
  end;
wenzelm@5831
   586
wenzelm@19385
   587
fun string_of_type state s =
wenzelm@5831
   588
  let
wenzelm@12055
   589
    val ctxt = Proof.context_of state;
wenzelm@12055
   590
    val T = ProofContext.read_typ ctxt s;
wenzelm@19385
   591
  in Pretty.string_of (Pretty.quote (ProofContext.pretty_typ ctxt T)) end;
wenzelm@9128
   592
wenzelm@19385
   593
fun print_item string_of (modes, arg) = Toplevel.keep (fn state => with_modes modes (fn () =>
wenzelm@21003
   594
  writeln (string_of (Toplevel.enter_proof_body state) arg)));
wenzelm@19385
   595
wenzelm@19385
   596
in
wenzelm@9128
   597
wenzelm@19268
   598
val print_stmts = print_item string_of_stmts;
wenzelm@12876
   599
val print_thms = print_item string_of_thms;
wenzelm@19385
   600
val print_prfs = print_item o string_of_prfs;
wenzelm@12876
   601
val print_prop = print_item string_of_prop;
wenzelm@12876
   602
val print_term = print_item string_of_term;
wenzelm@12876
   603
val print_type = print_item string_of_type;
wenzelm@5831
   604
wenzelm@19385
   605
end;
wenzelm@19385
   606
wenzelm@12938
   607
wenzelm@12938
   608
(* markup commands *)
wenzelm@12938
   609
wenzelm@12938
   610
fun add_header s = Toplevel.keep' (fn int => fn state =>
wenzelm@21858
   611
  (if Toplevel.is_toplevel state then () else raise Toplevel.UNDEF;
wenzelm@19057
   612
   if int then OuterSyntax.check_text s NONE else ()));
wenzelm@12938
   613
wenzelm@12953
   614
local
wenzelm@12953
   615
wenzelm@19057
   616
fun present _ txt true node = OuterSyntax.check_text txt (SOME node)
wenzelm@19057
   617
  | present f (s, _) false node =
wenzelm@22116
   618
      ML_Context.setmp (try (Toplevel.cases_node I (Context.Proof o Proof.context_of)) node) f s;
wenzelm@12953
   619
wenzelm@19057
   620
fun present_local_theory f (loc, txt) = Toplevel.present_local_theory loc (present f txt);
wenzelm@19057
   621
fun present_proof f txt = Toplevel.print o Toplevel.present_proof (present f txt);
wenzelm@12938
   622
wenzelm@12953
   623
in
wenzelm@12953
   624
wenzelm@19057
   625
val add_chapter       = present_local_theory Present.section;
wenzelm@19057
   626
val add_section       = present_local_theory Present.section;
wenzelm@19057
   627
val add_subsection    = present_local_theory Present.subsection;
wenzelm@19057
   628
val add_subsubsection = present_local_theory Present.subsubsection;
wenzelm@19057
   629
val add_text          = present_local_theory (K ());
wenzelm@19057
   630
fun add_text_raw txt  = present_local_theory (K ()) (NONE, txt);
wenzelm@19057
   631
val add_txt           = present_proof (K ());
wenzelm@19057
   632
val add_txt_raw       = add_txt;
wenzelm@19057
   633
val add_sect          = add_txt;
wenzelm@19057
   634
val add_subsect       = add_txt;
wenzelm@19057
   635
val add_subsubsect    = add_txt;
wenzelm@12938
   636
wenzelm@5831
   637
end;
wenzelm@12953
   638
wenzelm@12953
   639
end;