src/Pure/Isar/isar_cmd.ML
author wenzelm
Sat Dec 30 12:33:25 2006 +0100 (2006-12-30 ago)
changeset 21955 c1a6fad248ca
parent 21947 ccce5aea39b1
child 22087 a13299166175
permissions -rw-r--r--
removed obsolete clear_undos_theory;
undo/cannot_undo: proper undo of 'end';
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@21350
    10
  val add_axioms: ((bstring * string) * Attrib.src list) list -> theory -> theory
wenzelm@21350
    11
  val add_defs: (bool * bool) * ((bstring * string) * Attrib.src list) list -> theory -> theory
wenzelm@21350
    12
  val apply_theorems: (thmref * Attrib.src list) list -> theory -> thm list * theory
wenzelm@21350
    13
  val apply_theorems_i: (thm list * attribute list) list -> theory -> thm list * theory
wenzelm@21350
    14
  val have: ((string * Attrib.src list) * (string * string list) list) list ->
wenzelm@21350
    15
    bool -> Proof.state -> Proof.state
wenzelm@21350
    16
  val hence: ((string * Attrib.src list) * (string * string list) list) list ->
wenzelm@21350
    17
    bool -> Proof.state -> Proof.state
wenzelm@21350
    18
  val show: ((string * Attrib.src list) * (string * string list) list) list ->
wenzelm@21350
    19
    bool -> Proof.state -> Proof.state
wenzelm@21350
    20
  val thus: ((string * Attrib.src list) * (string * string list) list) list ->
wenzelm@21350
    21
    bool -> Proof.state -> Proof.state
wenzelm@21350
    22
  val qed: Method.text option -> Toplevel.transition -> Toplevel.transition
wenzelm@21350
    23
  val terminal_proof: Method.text * Method.text option ->
wenzelm@21350
    24
    Toplevel.transition -> Toplevel.transition
wenzelm@21350
    25
  val default_proof: Toplevel.transition -> Toplevel.transition
wenzelm@21350
    26
  val immediate_proof: Toplevel.transition -> Toplevel.transition
wenzelm@21350
    27
  val done_proof: Toplevel.transition -> Toplevel.transition
wenzelm@21350
    28
  val skip_proof: Toplevel.transition -> Toplevel.transition
wenzelm@21350
    29
  val begin_theory: string -> string list -> (string * bool) list -> bool -> theory
wenzelm@21350
    30
  val end_theory: theory -> theory
wenzelm@21350
    31
  val kill_theory: string -> unit
wenzelm@21350
    32
  val theory: string * string list * (string * bool) list
wenzelm@21350
    33
    -> Toplevel.transition -> Toplevel.transition
wenzelm@7462
    34
  val welcome: Toplevel.transition -> Toplevel.transition
wenzelm@7462
    35
  val init_toplevel: Toplevel.transition -> Toplevel.transition
wenzelm@5831
    36
  val exit: Toplevel.transition -> Toplevel.transition
wenzelm@5831
    37
  val quit: Toplevel.transition -> Toplevel.transition
wenzelm@7908
    38
  val touch_child_thys: string -> Toplevel.transition -> Toplevel.transition
wenzelm@7101
    39
  val touch_all_thys: Toplevel.transition -> Toplevel.transition
wenzelm@7101
    40
  val touch_thy: string -> Toplevel.transition -> Toplevel.transition
wenzelm@7101
    41
  val remove_thy: string -> Toplevel.transition -> Toplevel.transition
wenzelm@7931
    42
  val kill_thy: string -> Toplevel.transition -> Toplevel.transition
wenzelm@9731
    43
  val pr: string list * (int option * int option) -> Toplevel.transition -> Toplevel.transition
wenzelm@8453
    44
  val disable_pr: Toplevel.transition -> Toplevel.transition
wenzelm@8453
    45
  val enable_pr: Toplevel.transition -> Toplevel.transition
wenzelm@6742
    46
  val redo: Toplevel.transition -> Toplevel.transition
wenzelm@6742
    47
  val undos_proof: int -> Toplevel.transition -> Toplevel.transition
wenzelm@7936
    48
  val kill_proof_notify: (unit -> unit) -> Toplevel.transition -> Toplevel.transition
wenzelm@6742
    49
  val kill_proof: Toplevel.transition -> Toplevel.transition
wenzelm@6742
    50
  val undo_theory: Toplevel.transition -> Toplevel.transition
wenzelm@6686
    51
  val undo: Toplevel.transition -> Toplevel.transition
wenzelm@21955
    52
  val cannot_undo: string -> Toplevel.transition -> Toplevel.transition
wenzelm@8498
    53
  val kill: Toplevel.transition -> Toplevel.transition
wenzelm@17066
    54
  val back: Toplevel.transition -> Toplevel.transition
wenzelm@14950
    55
  val use: Path.T -> Toplevel.transition -> Toplevel.transition
wenzelm@12876
    56
  val use_mltext_theory: string -> Toplevel.transition -> Toplevel.transition
wenzelm@12876
    57
  val use_mltext: bool -> string -> Toplevel.transition -> Toplevel.transition
wenzelm@5831
    58
  val use_commit: Toplevel.transition -> Toplevel.transition
wenzelm@14950
    59
  val cd: Path.T -> Toplevel.transition -> Toplevel.transition
wenzelm@5831
    60
  val pwd: Toplevel.transition -> Toplevel.transition
wenzelm@5831
    61
  val use_thy: string -> Toplevel.transition -> Toplevel.transition
wenzelm@6694
    62
  val use_thy_only: string -> Toplevel.transition -> Toplevel.transition
wenzelm@6195
    63
  val update_thy: string -> Toplevel.transition -> Toplevel.transition
wenzelm@7101
    64
  val update_thy_only: string -> Toplevel.transition -> Toplevel.transition
wenzelm@14950
    65
  val display_drafts: Path.T list -> Toplevel.transition -> Toplevel.transition
wenzelm@14950
    66
  val print_drafts: Path.T list -> Toplevel.transition -> Toplevel.transition
wenzelm@7124
    67
  val pretty_setmargin: int -> Toplevel.transition -> Toplevel.transition
wenzelm@7308
    68
  val print_context: Toplevel.transition -> Toplevel.transition
wenzelm@20621
    69
  val print_theory: bool -> Toplevel.transition -> Toplevel.transition
wenzelm@5831
    70
  val print_syntax: Toplevel.transition -> Toplevel.transition
wenzelm@21725
    71
  val print_abbrevs: Toplevel.transition -> Toplevel.transition
wenzelm@21003
    72
  val print_facts: Toplevel.transition -> Toplevel.transition
wenzelm@5880
    73
  val print_theorems: Toplevel.transition -> Toplevel.transition
wenzelm@12060
    74
  val print_locales: Toplevel.transition -> Toplevel.transition
wenzelm@18135
    75
  val print_locale: bool * (Locale.expr * Element.context list)
wenzelm@12758
    76
    -> Toplevel.transition -> Toplevel.transition
ballarin@17139
    77
  val print_registrations: bool -> string -> Toplevel.transition -> Toplevel.transition
wenzelm@5831
    78
  val print_attributes: Toplevel.transition -> Toplevel.transition
wenzelm@16026
    79
  val print_simpset: Toplevel.transition -> Toplevel.transition
wenzelm@12382
    80
  val print_rules: Toplevel.transition -> Toplevel.transition
wenzelm@11666
    81
  val print_induct_rules: Toplevel.transition -> Toplevel.transition
wenzelm@9219
    82
  val print_trans_rules: Toplevel.transition -> Toplevel.transition
wenzelm@5831
    83
  val print_methods: Toplevel.transition -> Toplevel.transition
wenzelm@9219
    84
  val print_antiquotations: Toplevel.transition -> Toplevel.transition
wenzelm@20574
    85
  val class_deps: Toplevel.transition -> Toplevel.transition
wenzelm@20574
    86
  val thm_deps: (thmref * Attrib.src list) list -> Toplevel.transition -> Toplevel.transition
wenzelm@16037
    87
  val find_theorems: int option * (bool * string FindTheorems.criterion) list
wenzelm@13284
    88
    -> Toplevel.transition -> Toplevel.transition
wenzelm@5831
    89
  val print_binds: Toplevel.transition -> Toplevel.transition
wenzelm@8369
    90
  val print_cases: Toplevel.transition -> Toplevel.transition
wenzelm@19268
    91
  val print_stmts: string list * (thmref * Attrib.src list) list
wenzelm@19268
    92
    -> Toplevel.transition -> Toplevel.transition
wenzelm@15703
    93
  val print_thms: string list * (thmref * Attrib.src list) list
wenzelm@10581
    94
    -> Toplevel.transition -> Toplevel.transition
wenzelm@15703
    95
  val print_prfs: bool -> string list * (thmref * Attrib.src list) list option
berghofe@11524
    96
    -> Toplevel.transition -> Toplevel.transition
wenzelm@12876
    97
  val print_prop: (string list * string) -> Toplevel.transition -> Toplevel.transition
wenzelm@12876
    98
  val print_term: (string list * string) -> Toplevel.transition -> Toplevel.transition
wenzelm@12876
    99
  val print_type: (string list * string) -> Toplevel.transition -> Toplevel.transition
wenzelm@12938
   100
  val add_header: string * Position.T -> Toplevel.transition -> Toplevel.transition
wenzelm@17262
   101
  val add_chapter: xstring option * (string * Position.T) ->
wenzelm@17262
   102
    Toplevel.transition -> Toplevel.transition
wenzelm@17262
   103
  val add_section: xstring option * (string * Position.T) ->
wenzelm@17262
   104
    Toplevel.transition -> Toplevel.transition
wenzelm@17262
   105
  val add_subsection: xstring option * (string * Position.T) ->
wenzelm@17262
   106
    Toplevel.transition -> Toplevel.transition
wenzelm@17262
   107
  val add_subsubsection: xstring option * (string * Position.T) ->
wenzelm@17262
   108
    Toplevel.transition -> Toplevel.transition
wenzelm@17262
   109
  val add_text: xstring option * (string * Position.T) ->
wenzelm@17262
   110
    Toplevel.transition -> Toplevel.transition
wenzelm@12938
   111
  val add_text_raw: string * Position.T -> Toplevel.transition -> Toplevel.transition
wenzelm@12938
   112
  val add_sect: string * Position.T -> Toplevel.transition -> Toplevel.transition
wenzelm@12938
   113
  val add_subsect: string * Position.T -> Toplevel.transition -> Toplevel.transition
wenzelm@12938
   114
  val add_subsubsect: string * Position.T -> Toplevel.transition -> Toplevel.transition
wenzelm@12938
   115
  val add_txt: string * Position.T -> Toplevel.transition -> Toplevel.transition
wenzelm@12938
   116
  val add_txt_raw: string * Position.T -> Toplevel.transition -> Toplevel.transition
wenzelm@5831
   117
end;
wenzelm@5831
   118
wenzelm@5831
   119
structure IsarCmd: ISAR_CMD =
wenzelm@5831
   120
struct
wenzelm@5831
   121
wenzelm@5831
   122
wenzelm@21350
   123
(* axioms *)
wenzelm@21350
   124
wenzelm@21350
   125
fun add_axms f args thy =
wenzelm@21350
   126
  f (map (fn (x, srcs) => (x, map (Attrib.attribute thy) srcs)) args) thy;
wenzelm@21350
   127
wenzelm@21350
   128
val add_axioms = add_axms (snd oo PureThy.add_axioms);
wenzelm@21350
   129
wenzelm@21350
   130
fun add_defs ((unchecked, overloaded), args) =
wenzelm@21350
   131
  add_axms
wenzelm@21350
   132
    (snd oo (if unchecked then PureThy.add_defs_unchecked else PureThy.add_defs) overloaded) args;
wenzelm@21350
   133
wenzelm@21350
   134
wenzelm@21350
   135
(* facts *)
wenzelm@21350
   136
wenzelm@21350
   137
fun apply_theorems args thy =
wenzelm@21350
   138
  let val facts = Attrib.map_facts (Attrib.attribute thy) [(("", []), args)]
wenzelm@21350
   139
  in apfst (maps snd) (PureThy.note_thmss "" facts thy) end;
wenzelm@21350
   140
wenzelm@21350
   141
fun apply_theorems_i args = apfst (maps snd) o PureThy.note_thmss_i "" [(("", []), args)];
wenzelm@21350
   142
wenzelm@21350
   143
wenzelm@21350
   144
(* goals *)
wenzelm@21350
   145
wenzelm@21350
   146
fun goal opt_chain goal stmt int =
wenzelm@21350
   147
  opt_chain #> goal NONE (K Seq.single) stmt int;
wenzelm@21350
   148
wenzelm@21350
   149
val have = goal I Proof.have;
wenzelm@21350
   150
val hence = goal Proof.chain Proof.have;
wenzelm@21350
   151
val show = goal I Proof.show;
wenzelm@21350
   152
val thus = goal Proof.chain Proof.show;
wenzelm@21350
   153
wenzelm@21350
   154
wenzelm@21350
   155
(* local endings *)
wenzelm@21350
   156
wenzelm@21350
   157
fun local_qed m = Toplevel.proofs (Proof.local_qed (m, true));
wenzelm@21350
   158
val local_terminal_proof = Toplevel.proofs o Proof.local_terminal_proof;
wenzelm@21350
   159
val local_default_proof = Toplevel.proofs Proof.local_default_proof;
wenzelm@21350
   160
val local_immediate_proof = Toplevel.proofs Proof.local_immediate_proof;
wenzelm@21350
   161
val local_done_proof = Toplevel.proofs Proof.local_done_proof;
wenzelm@21350
   162
val local_skip_proof = Toplevel.proofs' Proof.local_skip_proof;
wenzelm@21350
   163
wenzelm@21350
   164
val skip_local_qed =
wenzelm@21350
   165
  Toplevel.skip_proof (History.apply (fn i => if i > 1 then i - 1 else raise Toplevel.UNDEF));
wenzelm@21350
   166
wenzelm@21350
   167
wenzelm@21350
   168
(* global endings *)
wenzelm@21350
   169
wenzelm@21350
   170
fun global_qed m = Toplevel.end_proof (K (Proof.global_qed (m, true)));
wenzelm@21350
   171
val global_terminal_proof = Toplevel.end_proof o K o Proof.global_terminal_proof;
wenzelm@21350
   172
val global_default_proof = Toplevel.end_proof (K Proof.global_default_proof);
wenzelm@21350
   173
val global_immediate_proof = Toplevel.end_proof (K Proof.global_immediate_proof);
wenzelm@21350
   174
val global_skip_proof = Toplevel.end_proof Proof.global_skip_proof;
wenzelm@21350
   175
val global_done_proof = Toplevel.end_proof (K Proof.global_done_proof);
wenzelm@21350
   176
wenzelm@21350
   177
val skip_global_qed = Toplevel.skip_proof_to_theory (equal 1);
wenzelm@21350
   178
wenzelm@21350
   179
wenzelm@21350
   180
(* common endings *)
wenzelm@21350
   181
wenzelm@21350
   182
fun qed m = local_qed m o global_qed m o skip_local_qed o skip_global_qed;
wenzelm@21350
   183
fun terminal_proof m = local_terminal_proof m o global_terminal_proof m;
wenzelm@21350
   184
val default_proof = local_default_proof o global_default_proof;
wenzelm@21350
   185
val immediate_proof = local_immediate_proof o global_immediate_proof;
wenzelm@21350
   186
val done_proof = local_done_proof o global_done_proof;
wenzelm@21350
   187
val skip_proof = local_skip_proof o global_skip_proof;
wenzelm@21350
   188
wenzelm@21350
   189
wenzelm@21350
   190
(* init and exit *)
wenzelm@21350
   191
wenzelm@21350
   192
fun begin_theory name imports uses =
wenzelm@21858
   193
  ThyInfo.begin_theory Present.begin_theory name imports (map (apfst Path.explode) uses);
wenzelm@21350
   194
wenzelm@21566
   195
fun end_theory thy =
wenzelm@21566
   196
  if ThyInfo.check_known_thy (Context.theory_name thy) then ThyInfo.end_theory thy else thy;
wenzelm@21350
   197
wenzelm@21350
   198
val kill_theory = ThyInfo.if_known_thy ThyInfo.remove_thy;
wenzelm@21350
   199
wenzelm@21350
   200
fun theory (name, imports, uses) =
wenzelm@21350
   201
  Toplevel.init_theory (begin_theory name imports uses)
wenzelm@21350
   202
    (fn thy => (end_theory thy; ()))
wenzelm@21350
   203
    (kill_theory o Context.theory_name);
wenzelm@21350
   204
wenzelm@7462
   205
val init_toplevel = Toplevel.imperative (fn () => raise Toplevel.RESTART);
wenzelm@21350
   206
wenzelm@7462
   207
val welcome = Toplevel.imperative (writeln o Session.welcome);
wenzelm@5831
   208
wenzelm@5831
   209
val exit = Toplevel.keep (fn state =>
wenzelm@21725
   210
  (Context.set_context (try Toplevel.theory_of state); raise Toplevel.TERMINATE));
wenzelm@5831
   211
wenzelm@5831
   212
val quit = Toplevel.imperative quit;
wenzelm@5831
   213
wenzelm@7101
   214
wenzelm@7101
   215
(* touch theories *)
wenzelm@7101
   216
wenzelm@7908
   217
fun touch_child_thys name = Toplevel.imperative (fn () => ThyInfo.touch_child_thys name);
wenzelm@7101
   218
val touch_all_thys = Toplevel.imperative ThyInfo.touch_all_thys;
wenzelm@7101
   219
fun touch_thy name = Toplevel.imperative (fn () => ThyInfo.touch_thy name);
wenzelm@7101
   220
fun remove_thy name = Toplevel.imperative (fn () => ThyInfo.remove_thy name);
wenzelm@21350
   221
fun kill_thy name = Toplevel.imperative (fn () => kill_theory name);
wenzelm@7101
   222
wenzelm@5831
   223
wenzelm@8453
   224
(* print state *)
wenzelm@8453
   225
wenzelm@8463
   226
fun with_modes modes e =
wenzelm@8463
   227
  Library.setmp print_mode (modes @ ! print_mode) e ();
wenzelm@8463
   228
skalberg@15531
   229
fun set_limit _ NONE = ()
skalberg@15531
   230
  | set_limit r (SOME n) = r := n;
wenzelm@9731
   231
wenzelm@19385
   232
fun pr (modes, (lim1, lim2)) = Toplevel.keep (fn state =>
wenzelm@9731
   233
  (set_limit goals_limit lim1; set_limit ProofContext.prems_limit lim2; Toplevel.quiet := false;
wenzelm@19385
   234
    with_modes modes (fn () => Toplevel.print_state true state)));
wenzelm@8453
   235
wenzelm@8453
   236
val disable_pr = Toplevel.imperative (fn () => Toplevel.quiet := true);
wenzelm@8453
   237
val enable_pr = Toplevel.imperative (fn () => Toplevel.quiet := false);
wenzelm@8453
   238
wenzelm@8453
   239
wenzelm@6686
   240
(* history commands *)
wenzelm@6686
   241
wenzelm@16812
   242
val redo =
wenzelm@16812
   243
  Toplevel.history History.redo o
wenzelm@16812
   244
  Toplevel.actual_proof ProofHistory.redo o
berghofe@15237
   245
  Toplevel.skip_proof History.redo;
wenzelm@6686
   246
wenzelm@16812
   247
fun undos_proof n =
wenzelm@16812
   248
  Toplevel.actual_proof (fn prf =>
berghofe@15237
   249
    if ProofHistory.is_initial prf then raise Toplevel.UNDEF else funpow n ProofHistory.undo prf) o
berghofe@15237
   250
  Toplevel.skip_proof (fn h =>
berghofe@15237
   251
    if History.is_initial h then raise Toplevel.UNDEF else funpow n History.undo h);
wenzelm@6686
   252
wenzelm@7936
   253
fun kill_proof_notify (f: unit -> unit) = Toplevel.history (fn hist =>
wenzelm@18588
   254
  if is_some (Toplevel.theory_node (History.current hist)) then raise Toplevel.UNDEF
wenzelm@18588
   255
  else (f (); History.undo hist));
wenzelm@7936
   256
wenzelm@7936
   257
val kill_proof = kill_proof_notify (K ());
wenzelm@6686
   258
wenzelm@6742
   259
val undo_theory = Toplevel.history (fn hist =>
wenzelm@6742
   260
  if History.is_initial hist then raise Toplevel.UNDEF else History.undo hist);
wenzelm@6686
   261
wenzelm@21955
   262
val undo = Toplevel.kill o undos_proof 1 o undo_theory o Toplevel.undo_exit;
wenzelm@21955
   263
wenzelm@21955
   264
fun cannot_undo "end" = undo   (*ProofGeneral legacy*)
wenzelm@21955
   265
  | cannot_undo txt = Toplevel.imperative (fn () => error ("Cannot undo " ^ quote txt));
wenzelm@21955
   266
wenzelm@21003
   267
val kill = Toplevel.kill o kill_proof;
wenzelm@17899
   268
wenzelm@17899
   269
val back =
wenzelm@17899
   270
  Toplevel.actual_proof ProofHistory.back o
wenzelm@17899
   271
  Toplevel.skip_proof (History.apply I);
wenzelm@9273
   272
wenzelm@6686
   273
wenzelm@5831
   274
(* use ML text *)
wenzelm@5831
   275
wenzelm@16045
   276
fun use path = Toplevel.keep (fn state =>
wenzelm@16045
   277
  Context.setmp (try Toplevel.theory_of state) (ThyInfo.load_file false) path);
wenzelm@5831
   278
wenzelm@5831
   279
(*passes changes of theory context*)
wenzelm@12876
   280
val use_mltext_theory = Toplevel.theory' o Context.use_mltext_theory;
wenzelm@5831
   281
wenzelm@5831
   282
(*ignore result theory context*)
wenzelm@12876
   283
fun use_mltext v txt = Toplevel.keep' (fn verb => fn state =>
wenzelm@8349
   284
  (Context.use_mltext txt (v andalso verb) (try Toplevel.theory_of state)));
wenzelm@5831
   285
wenzelm@20927
   286
val use_commit = Toplevel.imperative Secure.commit;
wenzelm@5831
   287
wenzelm@5831
   288
wenzelm@5831
   289
(* current working directory *)
wenzelm@5831
   290
wenzelm@14950
   291
fun cd path = Toplevel.imperative (fn () => (File.cd path));
wenzelm@21858
   292
val pwd = Toplevel.imperative (fn () => writeln (Path.implode (File.pwd ())));
wenzelm@5831
   293
wenzelm@5831
   294
wenzelm@5831
   295
(* load theory files *)
wenzelm@5831
   296
wenzelm@6243
   297
fun use_thy name = Toplevel.imperative (fn () => Context.save ThyInfo.use_thy name);
wenzelm@6694
   298
fun use_thy_only name = Toplevel.imperative (fn () => Context.save ThyInfo.use_thy_only name);
wenzelm@6243
   299
fun update_thy name = Toplevel.imperative (fn () => Context.save ThyInfo.update_thy name);
wenzelm@7124
   300
fun update_thy_only name =
wenzelm@7124
   301
  Toplevel.imperative (fn () => Context.save ThyInfo.update_thy_only name);
wenzelm@7124
   302
wenzelm@7124
   303
wenzelm@14934
   304
(* present draft files *)
wenzelm@14934
   305
wenzelm@14934
   306
fun display_drafts files = Toplevel.imperative (fn () =>
wenzelm@16258
   307
  let val outfile = File.shell_path (Present.drafts (getenv "ISABELLE_DOC_FORMAT") files)
wenzelm@16258
   308
  in File.isatool ("display -c " ^ outfile ^ " &"); () end);
wenzelm@14934
   309
wenzelm@14934
   310
fun print_drafts files = Toplevel.imperative (fn () =>
wenzelm@16258
   311
  let val outfile = File.shell_path (Present.drafts "ps" files)
wenzelm@16258
   312
  in File.isatool ("print -c " ^ outfile); () end);
wenzelm@14934
   313
wenzelm@14934
   314
wenzelm@7124
   315
(* pretty_setmargin *)
wenzelm@7124
   316
wenzelm@7124
   317
fun pretty_setmargin n = Toplevel.imperative (fn () => Pretty.setmargin n);
wenzelm@5831
   318
wenzelm@5831
   319
wenzelm@9513
   320
(* print parts of theory and proof context *)
wenzelm@5831
   321
wenzelm@7308
   322
val print_context = Toplevel.keep Toplevel.print_state_context;
wenzelm@9513
   323
wenzelm@20621
   324
fun print_theory verbose = Toplevel.unknown_theory o
wenzelm@20621
   325
  Toplevel.keep (ProofDisplay.print_full_theory verbose o Toplevel.theory_of);
wenzelm@9513
   326
wenzelm@21663
   327
val print_syntax = Toplevel.unknown_context o
wenzelm@21663
   328
  Toplevel.keep (ProofContext.print_syntax o Toplevel.context_of);
wenzelm@9513
   329
wenzelm@21725
   330
val print_abbrevs = Toplevel.unknown_context o
wenzelm@21725
   331
  Toplevel.keep (ProofContext.print_abbrevs o Toplevel.context_of);
wenzelm@21725
   332
wenzelm@21003
   333
val print_facts = Toplevel.unknown_context o Toplevel.keep (fn state =>
wenzelm@21003
   334
  ProofContext.setmp_verbose
wenzelm@21506
   335
    ProofContext.print_lthms (Toplevel.context_of state));
wenzelm@21003
   336
wenzelm@17066
   337
val print_theorems_proof = Toplevel.keep (fn state =>
wenzelm@17066
   338
  ProofContext.setmp_verbose
wenzelm@17066
   339
    ProofContext.print_lthms (Proof.context_of (Toplevel.proof_of state)));
wenzelm@17066
   340
wenzelm@18588
   341
val print_theorems_theory = Toplevel.keep (fn state =>
wenzelm@18588
   342
  Toplevel.theory_of state |>
wenzelm@18588
   343
  (case Option.map Toplevel.theory_node (History.previous (Toplevel.node_history_of state)) of
wenzelm@20957
   344
    SOME (SOME prev_thy) => ProofDisplay.print_theorems_diff (Context.theory_of prev_thy)
wenzelm@19430
   345
  | _ => ProofDisplay.print_theorems));
wenzelm@18588
   346
wenzelm@21663
   347
val print_theorems = Toplevel.unknown_context o print_theorems_theory o print_theorems_proof;
wenzelm@9513
   348
wenzelm@12060
   349
val print_locales = Toplevel.unknown_theory o
wenzelm@12060
   350
  Toplevel.keep (Locale.print_locales o Toplevel.theory_of);
wenzelm@12060
   351
wenzelm@19385
   352
fun print_locale (show_facts, (import, body)) = Toplevel.unknown_theory o
wenzelm@19385
   353
  Toplevel.keep (fn state =>
wenzelm@19385
   354
    Locale.print_locale (Toplevel.theory_of state) show_facts import body);
ballarin@15596
   355
ballarin@17139
   356
fun print_registrations show_wits name = Toplevel.unknown_context o
wenzelm@20957
   357
  Toplevel.keep (Toplevel.node_case
wenzelm@20957
   358
      (Context.cases (Locale.print_global_registrations show_wits name)
wenzelm@20957
   359
        (Locale.print_local_registrations show_wits name))
ballarin@17139
   360
    (Locale.print_local_registrations show_wits name o Proof.context_of));
wenzelm@12060
   361
wenzelm@9513
   362
val print_attributes = Toplevel.unknown_theory o
wenzelm@9513
   363
  Toplevel.keep (Attrib.print_attributes o Toplevel.theory_of);
wenzelm@9513
   364
wenzelm@16026
   365
val print_simpset = Toplevel.unknown_context o
wenzelm@20957
   366
  Toplevel.keep (Toplevel.node_case
wenzelm@20957
   367
    (Context.cases Simplifier.print_simpset Simplifier.print_local_simpset)
wenzelm@16026
   368
    (Simplifier.print_local_simpset o Proof.context_of));
wenzelm@16026
   369
wenzelm@12382
   370
val print_rules = Toplevel.unknown_context o
wenzelm@18639
   371
  Toplevel.keep (ContextRules.print_rules o Toplevel.context_of);
wenzelm@12382
   372
wenzelm@11666
   373
val print_induct_rules = Toplevel.unknown_context o
wenzelm@18639
   374
  Toplevel.keep (InductAttrib.print_rules o Toplevel.context_of);
wenzelm@11666
   375
wenzelm@9513
   376
val print_trans_rules = Toplevel.unknown_context o
wenzelm@18639
   377
  Toplevel.keep (Calculation.print_rules o Toplevel.context_of);
wenzelm@9513
   378
wenzelm@9513
   379
val print_methods = Toplevel.unknown_theory o
wenzelm@9513
   380
  Toplevel.keep (Method.print_methods o Toplevel.theory_of);
wenzelm@9513
   381
wenzelm@9219
   382
val print_antiquotations = Toplevel.imperative IsarOutput.print_antiquotations;
wenzelm@5831
   383
wenzelm@20574
   384
val class_deps = Toplevel.unknown_theory o Toplevel.keep (fn state =>
wenzelm@20574
   385
  let
wenzelm@20574
   386
    val thy = Toplevel.theory_of state;
wenzelm@20574
   387
    val {classes = (space, algebra), ...} = Type.rep_tsig (Sign.tsig_of thy);
wenzelm@20574
   388
    val {classes, ...} = Sorts.rep_algebra algebra;
wenzelm@20574
   389
    fun entry (c, (i, (_, cs))) =
wenzelm@20574
   390
      (i, {name = NameSpace.extern space c, ID = c, parents = cs,
wenzelm@20574
   391
            dir = "", unfold = true, path = ""});
wenzelm@20574
   392
    val gr =
wenzelm@20574
   393
      Graph.fold (cons o entry) classes []
wenzelm@20574
   394
      |> sort (int_ord o pairself #1) |> map #2;
wenzelm@20574
   395
  in Present.display_graph gr end);
wenzelm@20574
   396
kleing@15964
   397
wenzelm@16026
   398
(* retrieve theorems *)
wenzelm@7615
   399
wenzelm@9513
   400
fun thm_deps args = Toplevel.unknown_theory o Toplevel.keep (fn state =>
wenzelm@21003
   401
  ThmDeps.thm_deps (Proof.get_thmss (Toplevel.enter_proof_body state) args));
wenzelm@9454
   402
wenzelm@16026
   403
fun find_theorems (opt_lim, spec) = Toplevel.unknown_theory o Toplevel.keep (fn state =>
wenzelm@16026
   404
  let
wenzelm@21003
   405
    val proof_state = Toplevel.enter_proof_body state;
wenzelm@16026
   406
    val ctxt = Proof.context_of proof_state;
wenzelm@16026
   407
    val opt_goal = try Proof.get_goal proof_state |> Option.map (Thm.prop_of o #2 o #2);
wenzelm@16026
   408
  in FindTheorems.print_theorems ctxt opt_goal opt_lim spec end);
wenzelm@16026
   409
wenzelm@5831
   410
wenzelm@5831
   411
(* print proof context contents *)
wenzelm@5831
   412
wenzelm@21663
   413
val print_binds = Toplevel.unknown_context o Toplevel.keep (fn state =>
wenzelm@21663
   414
  ProofContext.setmp_verbose ProofContext.print_binds (Toplevel.context_of state));
wenzelm@9513
   415
wenzelm@21663
   416
val print_cases = Toplevel.unknown_context o Toplevel.keep (fn state =>
wenzelm@21663
   417
  ProofContext.setmp_verbose ProofContext.print_cases (Toplevel.context_of state));
wenzelm@5831
   418
wenzelm@5831
   419
wenzelm@19268
   420
(* print theorems, terms, types etc. *)
wenzelm@19268
   421
wenzelm@19385
   422
local
wenzelm@19385
   423
wenzelm@19385
   424
fun string_of_stmts state args =
wenzelm@19268
   425
  Proof.get_thmss state args
wenzelm@21437
   426
  |> map (Element.pretty_statement (Proof.context_of state) Thm.theoremK)
wenzelm@19385
   427
  |> Pretty.chunks2 |> Pretty.string_of;
wenzelm@5880
   428
wenzelm@19385
   429
fun string_of_thms state args =
wenzelm@12055
   430
  Pretty.string_of (ProofContext.pretty_thms (Proof.context_of state)
wenzelm@19385
   431
    (Proof.get_thmss state args));
wenzelm@5895
   432
wenzelm@19385
   433
fun string_of_prfs full state arg =
wenzelm@17066
   434
  Pretty.string_of (case arg of
skalberg@15531
   435
      NONE =>
berghofe@12125
   436
        let
wenzelm@17066
   437
          val (ctxt, (_, thm)) = Proof.get_goal state;
wenzelm@17066
   438
          val {thy, der = (_, prf), ...} = Thm.rep_thm thm;
wenzelm@17066
   439
          val prop = Thm.full_prop_of thm;
berghofe@12125
   440
          val prf' = Proofterm.rewrite_proof_notypes ([], []) prf
berghofe@12125
   441
        in
wenzelm@17066
   442
          ProofContext.pretty_proof ctxt
wenzelm@17066
   443
            (if full then Reconstruct.reconstruct_proof thy prop prf' else prf')
berghofe@12125
   444
        end
skalberg@15531
   445
    | SOME args => Pretty.chunks
wenzelm@17066
   446
        (map (ProofContext.pretty_proof_of (Proof.context_of state) full)
wenzelm@19385
   447
          (Proof.get_thmss state args)));
berghofe@11524
   448
wenzelm@19385
   449
fun string_of_prop state s =
wenzelm@5831
   450
  let
wenzelm@12055
   451
    val ctxt = Proof.context_of state;
wenzelm@12055
   452
    val prop = ProofContext.read_prop ctxt s;
wenzelm@19385
   453
  in Pretty.string_of (Pretty.quote (ProofContext.pretty_term ctxt prop)) end;
wenzelm@5831
   454
wenzelm@19385
   455
fun string_of_term state s =
wenzelm@5831
   456
  let
wenzelm@12055
   457
    val ctxt = Proof.context_of state;
wenzelm@12055
   458
    val t = ProofContext.read_term ctxt s;
wenzelm@5831
   459
    val T = Term.type_of t;
wenzelm@5831
   460
  in
wenzelm@19385
   461
    Pretty.string_of
wenzelm@12055
   462
      (Pretty.block [Pretty.quote (ProofContext.pretty_term ctxt t), Pretty.fbrk,
wenzelm@19385
   463
        Pretty.str "::", Pretty.brk 1, Pretty.quote (ProofContext.pretty_typ ctxt T)])
wenzelm@9128
   464
  end;
wenzelm@5831
   465
wenzelm@19385
   466
fun string_of_type state s =
wenzelm@5831
   467
  let
wenzelm@12055
   468
    val ctxt = Proof.context_of state;
wenzelm@12055
   469
    val T = ProofContext.read_typ ctxt s;
wenzelm@19385
   470
  in Pretty.string_of (Pretty.quote (ProofContext.pretty_typ ctxt T)) end;
wenzelm@9128
   471
wenzelm@19385
   472
fun print_item string_of (modes, arg) = Toplevel.keep (fn state => with_modes modes (fn () =>
wenzelm@21003
   473
  writeln (string_of (Toplevel.enter_proof_body state) arg)));
wenzelm@19385
   474
wenzelm@19385
   475
in
wenzelm@9128
   476
wenzelm@19268
   477
val print_stmts = print_item string_of_stmts;
wenzelm@12876
   478
val print_thms = print_item string_of_thms;
wenzelm@19385
   479
val print_prfs = print_item o string_of_prfs;
wenzelm@12876
   480
val print_prop = print_item string_of_prop;
wenzelm@12876
   481
val print_term = print_item string_of_term;
wenzelm@12876
   482
val print_type = print_item string_of_type;
wenzelm@5831
   483
wenzelm@19385
   484
end;
wenzelm@19385
   485
wenzelm@12938
   486
wenzelm@12938
   487
(* markup commands *)
wenzelm@12938
   488
wenzelm@12938
   489
fun add_header s = Toplevel.keep' (fn int => fn state =>
wenzelm@21858
   490
  (if Toplevel.is_toplevel state then () else raise Toplevel.UNDEF;
wenzelm@19057
   491
   if int then OuterSyntax.check_text s NONE else ()));
wenzelm@12938
   492
wenzelm@12953
   493
local
wenzelm@12953
   494
wenzelm@19057
   495
fun present _ txt true node = OuterSyntax.check_text txt (SOME node)
wenzelm@19057
   496
  | present f (s, _) false node =
wenzelm@20957
   497
      Context.setmp (try (Toplevel.cases_node Context.theory_of Proof.theory_of) node) f s;
wenzelm@12953
   498
wenzelm@19057
   499
fun present_local_theory f (loc, txt) = Toplevel.present_local_theory loc (present f txt);
wenzelm@19057
   500
fun present_proof f txt = Toplevel.print o Toplevel.present_proof (present f txt);
wenzelm@12938
   501
wenzelm@12953
   502
in
wenzelm@12953
   503
wenzelm@19057
   504
val add_chapter       = present_local_theory Present.section;
wenzelm@19057
   505
val add_section       = present_local_theory Present.section;
wenzelm@19057
   506
val add_subsection    = present_local_theory Present.subsection;
wenzelm@19057
   507
val add_subsubsection = present_local_theory Present.subsubsection;
wenzelm@19057
   508
val add_text          = present_local_theory (K ());
wenzelm@19057
   509
fun add_text_raw txt  = present_local_theory (K ()) (NONE, txt);
wenzelm@19057
   510
val add_txt           = present_proof (K ());
wenzelm@19057
   511
val add_txt_raw       = add_txt;
wenzelm@19057
   512
val add_sect          = add_txt;
wenzelm@19057
   513
val add_subsect       = add_txt;
wenzelm@19057
   514
val add_subsubsect    = add_txt;
wenzelm@12938
   515
wenzelm@5831
   516
end;
wenzelm@12953
   517
wenzelm@12953
   518
end;