src/Pure/Isar/isar_cmd.ML
author haftmann
Wed Jan 21 16:47:04 2009 +0100 (2009-01-21 ago)
changeset 29579 cb520b766e00
parent 29383 223f18cfbb32
child 29857 2cc976ed8a3c
permissions -rw-r--r--
binding replaces bstring
wenzelm@5831
     1
(*  Title:      Pure/Isar/isar_cmd.ML
wenzelm@5831
     2
    Author:     Markus Wenzel, TU Muenchen
wenzelm@5831
     3
wenzelm@21350
     4
Derived Isar commands.
wenzelm@5831
     5
*)
wenzelm@5831
     6
wenzelm@5831
     7
signature ISAR_CMD =
wenzelm@5831
     8
sig
wenzelm@26435
     9
  val generic_setup: string * Position.T -> theory -> theory
wenzelm@26385
    10
  val parse_ast_translation: bool * (string * Position.T) -> theory -> theory
wenzelm@26385
    11
  val parse_translation: bool * (string * Position.T) -> theory -> theory
wenzelm@26385
    12
  val print_translation: bool * (string * Position.T) -> theory -> theory
wenzelm@26385
    13
  val typed_print_translation: bool * (string * Position.T) -> theory -> theory
wenzelm@26385
    14
  val print_ast_translation: bool * (string * Position.T) -> theory -> theory
wenzelm@28290
    15
  val oracle: bstring -> SymbolPos.text * Position.T -> theory -> theory
haftmann@29579
    16
  val add_axioms: ((binding * string) * Attrib.src list) list -> theory -> theory
haftmann@29579
    17
  val add_defs: (bool * bool) * ((binding * string) * Attrib.src list) list -> theory -> theory
wenzelm@26385
    18
  val declaration: string * Position.T -> local_theory -> local_theory
wenzelm@26385
    19
  val simproc_setup: string -> string list -> string * Position.T -> string list ->
wenzelm@26385
    20
    local_theory -> local_theory
wenzelm@26671
    21
  val hide_names: bool -> string * xstring list -> theory -> theory
wenzelm@28084
    22
  val have: (Attrib.binding * (string * string list) list) list -> bool -> Proof.state -> Proof.state
wenzelm@28084
    23
  val hence: (Attrib.binding * (string * string list) list) list -> bool -> Proof.state -> Proof.state
wenzelm@28084
    24
  val show: (Attrib.binding * (string * string list) list) list -> bool -> Proof.state -> Proof.state
wenzelm@28084
    25
  val thus: (Attrib.binding * (string * string list) list) list -> bool -> Proof.state -> Proof.state
wenzelm@21350
    26
  val qed: Method.text option -> Toplevel.transition -> Toplevel.transition
wenzelm@21350
    27
  val terminal_proof: Method.text * Method.text option ->
wenzelm@21350
    28
    Toplevel.transition -> Toplevel.transition
wenzelm@21350
    29
  val default_proof: Toplevel.transition -> Toplevel.transition
wenzelm@21350
    30
  val immediate_proof: Toplevel.transition -> Toplevel.transition
wenzelm@21350
    31
  val done_proof: Toplevel.transition -> Toplevel.transition
wenzelm@21350
    32
  val skip_proof: Toplevel.transition -> Toplevel.transition
wenzelm@27574
    33
  val init_theory: string * string list * (string * bool) list ->
wenzelm@27574
    34
    Toplevel.transition -> Toplevel.transition
wenzelm@7462
    35
  val welcome: Toplevel.transition -> Toplevel.transition
wenzelm@5831
    36
  val exit: Toplevel.transition -> Toplevel.transition
wenzelm@5831
    37
  val quit: Toplevel.transition -> Toplevel.transition
wenzelm@9731
    38
  val pr: string list * (int option * int option) -> Toplevel.transition -> Toplevel.transition
wenzelm@8453
    39
  val disable_pr: Toplevel.transition -> Toplevel.transition
wenzelm@8453
    40
  val enable_pr: Toplevel.transition -> Toplevel.transition
wenzelm@26489
    41
  val ml_diag: bool -> string * Position.T -> Toplevel.transition -> Toplevel.transition
wenzelm@14950
    42
  val cd: Path.T -> Toplevel.transition -> Toplevel.transition
wenzelm@5831
    43
  val pwd: Toplevel.transition -> Toplevel.transition
wenzelm@14950
    44
  val display_drafts: Path.T list -> Toplevel.transition -> Toplevel.transition
wenzelm@14950
    45
  val print_drafts: Path.T list -> Toplevel.transition -> Toplevel.transition
wenzelm@7124
    46
  val pretty_setmargin: int -> Toplevel.transition -> Toplevel.transition
wenzelm@7308
    47
  val print_context: Toplevel.transition -> Toplevel.transition
wenzelm@20621
    48
  val print_theory: bool -> Toplevel.transition -> Toplevel.transition
wenzelm@5831
    49
  val print_syntax: Toplevel.transition -> Toplevel.transition
wenzelm@21725
    50
  val print_abbrevs: Toplevel.transition -> Toplevel.transition
wenzelm@21003
    51
  val print_facts: Toplevel.transition -> Toplevel.transition
wenzelm@24115
    52
  val print_configs: Toplevel.transition -> Toplevel.transition
wenzelm@5880
    53
  val print_theorems: Toplevel.transition -> Toplevel.transition
wenzelm@12060
    54
  val print_locales: Toplevel.transition -> Toplevel.transition
ballarin@29223
    55
  val print_locale: bool * xstring -> Toplevel.transition -> Toplevel.transition
wenzelm@5831
    56
  val print_attributes: Toplevel.transition -> Toplevel.transition
wenzelm@16026
    57
  val print_simpset: Toplevel.transition -> Toplevel.transition
wenzelm@12382
    58
  val print_rules: Toplevel.transition -> Toplevel.transition
wenzelm@9219
    59
  val print_trans_rules: Toplevel.transition -> Toplevel.transition
wenzelm@5831
    60
  val print_methods: Toplevel.transition -> Toplevel.transition
wenzelm@9219
    61
  val print_antiquotations: Toplevel.transition -> Toplevel.transition
wenzelm@20574
    62
  val class_deps: Toplevel.transition -> Toplevel.transition
haftmann@22485
    63
  val thy_deps: Toplevel.transition -> Toplevel.transition
wenzelm@26336
    64
  val thm_deps: (Facts.ref * Attrib.src list) list -> Toplevel.transition -> Toplevel.transition
kleing@22340
    65
  val find_theorems: (int option * bool) * (bool * string FindTheorems.criterion) list
wenzelm@13284
    66
    -> Toplevel.transition -> Toplevel.transition
berghofe@26184
    67
  val unused_thms: (string list * string list option) option ->
berghofe@26184
    68
    Toplevel.transition -> Toplevel.transition
wenzelm@5831
    69
  val print_binds: Toplevel.transition -> Toplevel.transition
wenzelm@8369
    70
  val print_cases: Toplevel.transition -> Toplevel.transition
wenzelm@26336
    71
  val print_stmts: string list * (Facts.ref * Attrib.src list) list
wenzelm@19268
    72
    -> Toplevel.transition -> Toplevel.transition
wenzelm@26336
    73
  val print_thms: string list * (Facts.ref * Attrib.src list) list
wenzelm@10581
    74
    -> Toplevel.transition -> Toplevel.transition
wenzelm@26336
    75
  val print_prfs: bool -> string list * (Facts.ref * Attrib.src list) list option
berghofe@11524
    76
    -> Toplevel.transition -> Toplevel.transition
wenzelm@12876
    77
  val print_prop: (string list * string) -> Toplevel.transition -> Toplevel.transition
wenzelm@12876
    78
  val print_term: (string list * string) -> Toplevel.transition -> Toplevel.transition
wenzelm@12876
    79
  val print_type: (string list * string) -> Toplevel.transition -> Toplevel.transition
wenzelm@27871
    80
  val header_markup: SymbolPos.text * Position.T -> Toplevel.transition -> Toplevel.transition
wenzelm@27871
    81
  val local_theory_markup: xstring option * (SymbolPos.text * Position.T) ->
wenzelm@17262
    82
    Toplevel.transition -> Toplevel.transition
wenzelm@27871
    83
  val proof_markup: SymbolPos.text * Position.T -> Toplevel.transition -> Toplevel.transition
wenzelm@5831
    84
end;
wenzelm@5831
    85
wenzelm@5831
    86
structure IsarCmd: ISAR_CMD =
wenzelm@5831
    87
struct
wenzelm@5831
    88
wenzelm@5831
    89
wenzelm@22116
    90
(** theory declarations **)
wenzelm@22116
    91
wenzelm@22116
    92
(* generic_setup *)
wenzelm@22116
    93
wenzelm@26435
    94
fun generic_setup (txt, pos) =
wenzelm@26455
    95
  ML_Context.expression pos "val setup: theory -> theory" "Context.map_theory setup" txt
wenzelm@26435
    96
  |> Context.theory_map;
wenzelm@22116
    97
wenzelm@22116
    98
wenzelm@22116
    99
(* translation functions *)
wenzelm@22116
   100
wenzelm@22116
   101
local
wenzelm@22116
   102
wenzelm@22116
   103
fun advancedT false = ""
wenzelm@22116
   104
  | advancedT true = "Proof.context -> ";
wenzelm@22116
   105
wenzelm@22116
   106
fun advancedN false = ""
wenzelm@22116
   107
  | advancedN true = "advanced_";
wenzelm@22116
   108
wenzelm@22116
   109
in
wenzelm@22116
   110
wenzelm@26385
   111
fun parse_ast_translation (a, (txt, pos)) =
wenzelm@26455
   112
  txt |> ML_Context.expression pos
wenzelm@26455
   113
    ("val parse_ast_translation: (string * (" ^ advancedT a ^
wenzelm@22116
   114
      "Syntax.ast list -> Syntax.ast)) list")
wenzelm@22116
   115
    ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfuns (parse_ast_translation, [], [], []))")
wenzelm@22116
   116
  |> Context.theory_map;
wenzelm@22116
   117
wenzelm@26385
   118
fun parse_translation (a, (txt, pos)) =
wenzelm@26455
   119
  txt |> ML_Context.expression pos
wenzelm@26455
   120
    ("val parse_translation: (string * (" ^ advancedT a ^
wenzelm@22116
   121
      "term list -> term)) list")
wenzelm@22116
   122
    ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfuns ([], parse_translation, [], []))")
wenzelm@22116
   123
  |> Context.theory_map;
wenzelm@22116
   124
wenzelm@26385
   125
fun print_translation (a, (txt, pos)) =
wenzelm@26455
   126
  txt |> ML_Context.expression pos
wenzelm@26455
   127
    ("val print_translation: (string * (" ^ advancedT a ^
wenzelm@22116
   128
      "term list -> term)) list")
wenzelm@22116
   129
    ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfuns ([], [], print_translation, []))")
wenzelm@22116
   130
  |> Context.theory_map;
wenzelm@22116
   131
wenzelm@26385
   132
fun print_ast_translation (a, (txt, pos)) =
wenzelm@26455
   133
  txt |> ML_Context.expression pos
wenzelm@26455
   134
    ("val print_ast_translation: (string * (" ^ advancedT a ^
wenzelm@22116
   135
      "Syntax.ast list -> Syntax.ast)) list")
wenzelm@22116
   136
    ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfuns ([], [], [], print_ast_translation))")
wenzelm@22116
   137
  |> Context.theory_map;
wenzelm@22116
   138
wenzelm@26385
   139
fun typed_print_translation (a, (txt, pos)) =
wenzelm@26455
   140
  txt |> ML_Context.expression pos
wenzelm@26455
   141
    ("val typed_print_translation: (string * (" ^ advancedT a ^
wenzelm@22116
   142
      "bool -> typ -> term list -> term)) list")
wenzelm@22116
   143
    ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfunsT typed_print_translation)")
wenzelm@22116
   144
  |> Context.theory_map;
wenzelm@22116
   145
wenzelm@22116
   146
end;
wenzelm@22116
   147
wenzelm@22116
   148
wenzelm@22116
   149
(* oracles *)
wenzelm@22116
   150
wenzelm@28290
   151
fun oracle name (oracle_txt, pos) =
wenzelm@27871
   152
  let
wenzelm@27871
   153
    val oracle = SymbolPos.content (SymbolPos.explode (oracle_txt, pos));
wenzelm@27871
   154
    val txt =
wenzelm@28290
   155
      "local\n\
wenzelm@27871
   156
      \  val name = " ^ quote name ^ ";\n\
wenzelm@28290
   157
      \  val oracle = " ^ oracle ^ ";\n\
wenzelm@27871
   158
      \in\n\
wenzelm@28290
   159
      \  val " ^ name ^ " = snd (Context.>>> (Context.map_theory_result (Thm.add_oracle (name, oracle))));\n\
wenzelm@27871
   160
      \end;\n";
wenzelm@26455
   161
  in Context.theory_map (ML_Context.exec (fn () => ML_Context.eval false pos txt)) end;
wenzelm@22116
   162
wenzelm@22116
   163
wenzelm@21350
   164
(* axioms *)
wenzelm@21350
   165
wenzelm@21350
   166
fun add_axms f args thy =
haftmann@29006
   167
  f (map (fn ((b, ax), srcs) => ((Binding.base_name b, ax), map (Attrib.attribute thy) srcs)) args) thy;
wenzelm@21350
   168
haftmann@27691
   169
val add_axioms = add_axms (snd oo PureThy.add_axioms_cmd);
wenzelm@21350
   170
wenzelm@21350
   171
fun add_defs ((unchecked, overloaded), args) =
wenzelm@21350
   172
  add_axms
haftmann@27691
   173
    (snd oo (if unchecked then PureThy.add_defs_unchecked_cmd else PureThy.add_defs_cmd) overloaded) args;
wenzelm@21350
   174
wenzelm@21350
   175
wenzelm@22087
   176
(* declarations *)
wenzelm@22087
   177
wenzelm@26385
   178
fun declaration (txt, pos) =
wenzelm@26455
   179
  txt |> ML_Context.expression pos
wenzelm@26455
   180
    "val declaration: Morphism.declaration"
wenzelm@24020
   181
    "Context.map_proof (LocalTheory.declaration declaration)"
wenzelm@26385
   182
  |> Context.proof_map;
wenzelm@22087
   183
wenzelm@22087
   184
wenzelm@22202
   185
(* simprocs *)
wenzelm@22202
   186
wenzelm@26385
   187
fun simproc_setup name lhss (proc, pos) identifier =
wenzelm@26455
   188
  ML_Context.expression pos
wenzelm@22239
   189
    "val proc: Morphism.morphism -> Simplifier.simpset -> cterm -> thm option"
wenzelm@22239
   190
  ("Context.map_proof (Simplifier.def_simproc {name = " ^ ML_Syntax.print_string name ^ ", \
wenzelm@22239
   191
    \lhss = " ^ ML_Syntax.print_strings lhss ^ ", proc = proc, \
wenzelm@22239
   192
    \identifier = Library.maps ML_Context.thms " ^ ML_Syntax.print_strings identifier ^ "})") proc
wenzelm@22202
   193
  |> Context.proof_map;
wenzelm@22202
   194
wenzelm@22202
   195
wenzelm@26671
   196
(* hide names *)
wenzelm@26671
   197
wenzelm@26671
   198
val hide_kinds =
wenzelm@26671
   199
 [("class", (Sign.intern_class, can o Sign.certify_class, Sign.hide_class)),
wenzelm@26671
   200
  ("type", (Sign.intern_type, Sign.declared_tyname, Sign.hide_type)),
wenzelm@26671
   201
  ("const", (Sign.intern_const, Sign.declared_const, Sign.hide_const)),
wenzelm@26694
   202
  ("fact", (PureThy.intern_fact, PureThy.defined_fact, PureThy.hide_fact))];
wenzelm@26671
   203
wenzelm@26671
   204
fun hide_names b (kind, xnames) thy =
wenzelm@26671
   205
  (case AList.lookup (op =) hide_kinds kind of
wenzelm@26671
   206
    SOME (intern, check, hide) =>
wenzelm@26671
   207
      let
wenzelm@26671
   208
        val names = map (intern thy) xnames;
wenzelm@26671
   209
        val bads = filter_out (check thy) names;
wenzelm@26671
   210
      in
wenzelm@26671
   211
        if null bads then fold (hide b) names thy
wenzelm@26671
   212
        else error ("Attempt to hide undeclared item(s): " ^ commas_quote bads)
wenzelm@26671
   213
      end
wenzelm@26671
   214
  | NONE => error ("Bad name space specification: " ^ quote kind));
wenzelm@26671
   215
wenzelm@26671
   216
wenzelm@21350
   217
(* goals *)
wenzelm@21350
   218
wenzelm@21350
   219
fun goal opt_chain goal stmt int =
wenzelm@29383
   220
  opt_chain #> goal NONE (K I) stmt int;
wenzelm@21350
   221
wenzelm@21350
   222
val have = goal I Proof.have;
wenzelm@21350
   223
val hence = goal Proof.chain Proof.have;
wenzelm@21350
   224
val show = goal I Proof.show;
wenzelm@21350
   225
val thus = goal Proof.chain Proof.show;
wenzelm@21350
   226
wenzelm@21350
   227
wenzelm@21350
   228
(* local endings *)
wenzelm@21350
   229
wenzelm@29383
   230
fun local_qed m = Toplevel.proof (Proof.local_qed (m, true));
wenzelm@29383
   231
val local_terminal_proof = Toplevel.proof o Proof.local_terminal_proof;
wenzelm@29383
   232
val local_default_proof = Toplevel.proof Proof.local_default_proof;
wenzelm@29383
   233
val local_immediate_proof = Toplevel.proof Proof.local_immediate_proof;
wenzelm@29383
   234
val local_done_proof = Toplevel.proof Proof.local_done_proof;
wenzelm@29383
   235
val local_skip_proof = Toplevel.proof' Proof.local_skip_proof;
wenzelm@21350
   236
wenzelm@27562
   237
val skip_local_qed = Toplevel.skip_proof (fn i => if i > 1 then i - 1 else raise Toplevel.UNDEF);
wenzelm@21350
   238
wenzelm@21350
   239
wenzelm@21350
   240
(* global endings *)
wenzelm@21350
   241
wenzelm@21350
   242
fun global_qed m = Toplevel.end_proof (K (Proof.global_qed (m, true)));
wenzelm@21350
   243
val global_terminal_proof = Toplevel.end_proof o K o Proof.global_terminal_proof;
wenzelm@21350
   244
val global_default_proof = Toplevel.end_proof (K Proof.global_default_proof);
wenzelm@21350
   245
val global_immediate_proof = Toplevel.end_proof (K Proof.global_immediate_proof);
wenzelm@21350
   246
val global_skip_proof = Toplevel.end_proof Proof.global_skip_proof;
wenzelm@21350
   247
val global_done_proof = Toplevel.end_proof (K Proof.global_done_proof);
wenzelm@21350
   248
wenzelm@28375
   249
val skip_global_qed = Toplevel.skip_proof_to_theory (fn n => n = 1);
wenzelm@21350
   250
wenzelm@21350
   251
wenzelm@21350
   252
(* common endings *)
wenzelm@21350
   253
wenzelm@21350
   254
fun qed m = local_qed m o global_qed m o skip_local_qed o skip_global_qed;
wenzelm@21350
   255
fun terminal_proof m = local_terminal_proof m o global_terminal_proof m;
wenzelm@21350
   256
val default_proof = local_default_proof o global_default_proof;
wenzelm@21350
   257
val immediate_proof = local_immediate_proof o global_immediate_proof;
wenzelm@21350
   258
val done_proof = local_done_proof o global_done_proof;
wenzelm@21350
   259
val skip_proof = local_skip_proof o global_skip_proof;
wenzelm@21350
   260
wenzelm@21350
   261
wenzelm@21350
   262
(* init and exit *)
wenzelm@21350
   263
wenzelm@27574
   264
fun init_theory (name, imports, uses) =
wenzelm@27574
   265
  Toplevel.init_theory name (ThyInfo.begin_theory name imports (map (apfst Path.explode) uses))
wenzelm@27574
   266
    (fn thy =>
wenzelm@27574
   267
      if ThyInfo.check_known_thy (Context.theory_name thy)
wenzelm@27574
   268
      then ThyInfo.end_theory thy else ());
wenzelm@21350
   269
wenzelm@7462
   270
val welcome = Toplevel.imperative (writeln o Session.welcome);
wenzelm@5831
   271
wenzelm@5831
   272
val exit = Toplevel.keep (fn state =>
wenzelm@26599
   273
 (Context.set_thread_data (try Toplevel.generic_theory_of state);
wenzelm@24071
   274
  raise Toplevel.TERMINATE));
wenzelm@5831
   275
wenzelm@5831
   276
val quit = Toplevel.imperative quit;
wenzelm@5831
   277
wenzelm@7101
   278
wenzelm@8453
   279
(* print state *)
wenzelm@8453
   280
skalberg@15531
   281
fun set_limit _ NONE = ()
skalberg@15531
   282
  | set_limit r (SOME n) = r := n;
wenzelm@9731
   283
wenzelm@19385
   284
fun pr (modes, (lim1, lim2)) = Toplevel.keep (fn state =>
wenzelm@9731
   285
  (set_limit goals_limit lim1; set_limit ProofContext.prems_limit lim2; Toplevel.quiet := false;
wenzelm@23935
   286
    PrintMode.with_modes modes (Toplevel.print_state true) state));
wenzelm@8453
   287
wenzelm@8453
   288
val disable_pr = Toplevel.imperative (fn () => Toplevel.quiet := true);
wenzelm@8453
   289
val enable_pr = Toplevel.imperative (fn () => Toplevel.quiet := false);
wenzelm@8453
   290
wenzelm@8453
   291
wenzelm@26489
   292
(* diagnostic ML evaluation *)
wenzelm@5831
   293
wenzelm@26489
   294
fun ml_diag verbose (txt, pos) = Toplevel.keep (fn state =>
wenzelm@28273
   295
  (ML_Context.eval_in
wenzelm@28273
   296
    (Option.map Context.proof_of (try Toplevel.generic_theory_of state)) verbose pos txt));
wenzelm@5831
   297
wenzelm@5831
   298
wenzelm@5831
   299
(* current working directory *)
wenzelm@5831
   300
wenzelm@14950
   301
fun cd path = Toplevel.imperative (fn () => (File.cd path));
wenzelm@21858
   302
val pwd = Toplevel.imperative (fn () => writeln (Path.implode (File.pwd ())));
wenzelm@5831
   303
wenzelm@5831
   304
wenzelm@14934
   305
(* present draft files *)
wenzelm@14934
   306
wenzelm@14934
   307
fun display_drafts files = Toplevel.imperative (fn () =>
wenzelm@16258
   308
  let val outfile = File.shell_path (Present.drafts (getenv "ISABELLE_DOC_FORMAT") files)
wenzelm@28496
   309
  in File.isabelle_tool ("display -c " ^ outfile ^ " &"); () end);
wenzelm@14934
   310
wenzelm@14934
   311
fun print_drafts files = Toplevel.imperative (fn () =>
wenzelm@16258
   312
  let val outfile = File.shell_path (Present.drafts "ps" files)
wenzelm@28496
   313
  in File.isabelle_tool ("print -c " ^ outfile); () end);
wenzelm@14934
   314
wenzelm@14934
   315
wenzelm@7124
   316
(* pretty_setmargin *)
wenzelm@7124
   317
wenzelm@7124
   318
fun pretty_setmargin n = Toplevel.imperative (fn () => Pretty.setmargin n);
wenzelm@5831
   319
wenzelm@5831
   320
wenzelm@9513
   321
(* print parts of theory and proof context *)
wenzelm@5831
   322
wenzelm@7308
   323
val print_context = Toplevel.keep Toplevel.print_state_context;
wenzelm@9513
   324
wenzelm@20621
   325
fun print_theory verbose = Toplevel.unknown_theory o
wenzelm@22872
   326
  Toplevel.keep (Pretty.writeln o ProofDisplay.pretty_full_theory verbose o Toplevel.theory_of);
wenzelm@9513
   327
wenzelm@21663
   328
val print_syntax = Toplevel.unknown_context o
wenzelm@21663
   329
  Toplevel.keep (ProofContext.print_syntax o Toplevel.context_of);
wenzelm@9513
   330
wenzelm@21725
   331
val print_abbrevs = Toplevel.unknown_context o
wenzelm@21725
   332
  Toplevel.keep (ProofContext.print_abbrevs o Toplevel.context_of);
wenzelm@21725
   333
wenzelm@21003
   334
val print_facts = Toplevel.unknown_context o Toplevel.keep (fn state =>
wenzelm@21003
   335
  ProofContext.setmp_verbose
wenzelm@21506
   336
    ProofContext.print_lthms (Toplevel.context_of state));
wenzelm@21003
   337
wenzelm@24115
   338
val print_configs = Toplevel.unknown_context o Toplevel.keep (fn state =>
wenzelm@24115
   339
  Attrib.print_configs (Toplevel.context_of state));
wenzelm@23989
   340
wenzelm@17066
   341
val print_theorems_proof = Toplevel.keep (fn state =>
wenzelm@17066
   342
  ProofContext.setmp_verbose
wenzelm@17066
   343
    ProofContext.print_lthms (Proof.context_of (Toplevel.proof_of state)));
wenzelm@17066
   344
wenzelm@18588
   345
val print_theorems_theory = Toplevel.keep (fn state =>
wenzelm@18588
   346
  Toplevel.theory_of state |>
wenzelm@29067
   347
  (case Toplevel.previous_node_of state of
wenzelm@29067
   348
    SOME prev_node =>
wenzelm@29067
   349
      ProofDisplay.print_theorems_diff (ProofContext.theory_of (Toplevel.context_node prev_node))
wenzelm@19430
   350
  | _ => ProofDisplay.print_theorems));
wenzelm@18588
   351
wenzelm@21663
   352
val print_theorems = Toplevel.unknown_context o print_theorems_theory o print_theorems_proof;
wenzelm@9513
   353
wenzelm@12060
   354
val print_locales = Toplevel.unknown_theory o
haftmann@29360
   355
  Toplevel.keep (Locale.print_locales o Toplevel.theory_of);
wenzelm@12060
   356
ballarin@29223
   357
fun print_locale (show_facts, name) = Toplevel.unknown_theory o
wenzelm@19385
   358
  Toplevel.keep (fn state =>
haftmann@29360
   359
    Locale.print_locale (Toplevel.theory_of state) show_facts name);
ballarin@15596
   360
wenzelm@9513
   361
val print_attributes = Toplevel.unknown_theory o
wenzelm@9513
   362
  Toplevel.keep (Attrib.print_attributes o Toplevel.theory_of);
wenzelm@9513
   363
wenzelm@16026
   364
val print_simpset = Toplevel.unknown_context o
haftmann@27582
   365
  Toplevel.keep (Pretty.writeln o Simplifier.pretty_ss o Simplifier.local_simpset_of o Toplevel.context_of);
wenzelm@16026
   366
wenzelm@12382
   367
val print_rules = Toplevel.unknown_context o
wenzelm@18639
   368
  Toplevel.keep (ContextRules.print_rules o Toplevel.context_of);
wenzelm@12382
   369
wenzelm@9513
   370
val print_trans_rules = Toplevel.unknown_context o
wenzelm@18639
   371
  Toplevel.keep (Calculation.print_rules o Toplevel.context_of);
wenzelm@9513
   372
wenzelm@9513
   373
val print_methods = Toplevel.unknown_theory o
wenzelm@9513
   374
  Toplevel.keep (Method.print_methods o Toplevel.theory_of);
wenzelm@9513
   375
wenzelm@22116
   376
val print_antiquotations = Toplevel.imperative ThyOutput.print_antiquotations;
wenzelm@5831
   377
haftmann@22485
   378
val thy_deps = Toplevel.unknown_theory o Toplevel.keep (fn state =>
haftmann@22485
   379
  let
haftmann@22485
   380
    val thy = Toplevel.theory_of state;
wenzelm@24560
   381
    val all_thys = sort ThyInfo.thy_ord (thy :: Theory.ancestors_of thy);
wenzelm@22604
   382
    val gr = all_thys |> map (fn node =>
wenzelm@22602
   383
      let
wenzelm@22602
   384
        val name = Context.theory_name node;
wenzelm@22602
   385
        val parents = map Context.theory_name (Theory.parents_of node);
wenzelm@24560
   386
        val dir = Present.session_name node;
wenzelm@24560
   387
        val unfold = not (ThyInfo.known_thy name andalso ThyInfo.is_finished name);
wenzelm@24560
   388
      in {name = name, ID = name, parents = parents, dir = dir, unfold = unfold, path = ""} end);
wenzelm@22602
   389
  in Present.display_graph gr end);
haftmann@22485
   390
wenzelm@20574
   391
val class_deps = Toplevel.unknown_theory o Toplevel.keep (fn state =>
wenzelm@20574
   392
  let
wenzelm@20574
   393
    val thy = Toplevel.theory_of state;
wenzelm@20574
   394
    val {classes = (space, algebra), ...} = Type.rep_tsig (Sign.tsig_of thy);
wenzelm@20574
   395
    val {classes, ...} = Sorts.rep_algebra algebra;
wenzelm@20574
   396
    fun entry (c, (i, (_, cs))) =
wenzelm@20574
   397
      (i, {name = NameSpace.extern space c, ID = c, parents = cs,
wenzelm@20574
   398
            dir = "", unfold = true, path = ""});
wenzelm@20574
   399
    val gr =
wenzelm@20574
   400
      Graph.fold (cons o entry) classes []
wenzelm@20574
   401
      |> sort (int_ord o pairself #1) |> map #2;
wenzelm@20574
   402
  in Present.display_graph gr end);
wenzelm@20574
   403
kleing@15964
   404
wenzelm@16026
   405
(* retrieve theorems *)
wenzelm@7615
   406
wenzelm@9513
   407
fun thm_deps args = Toplevel.unknown_theory o Toplevel.keep (fn state =>
wenzelm@21003
   408
  ThmDeps.thm_deps (Proof.get_thmss (Toplevel.enter_proof_body state) args));
wenzelm@9454
   409
wenzelm@24560
   410
fun find_theorems ((opt_lim, rem_dups), spec) =
kleing@22340
   411
  Toplevel.unknown_theory o Toplevel.keep (fn state =>
wenzelm@16026
   412
  let
wenzelm@21003
   413
    val proof_state = Toplevel.enter_proof_body state;
wenzelm@16026
   414
    val ctxt = Proof.context_of proof_state;
wenzelm@16026
   415
    val opt_goal = try Proof.get_goal proof_state |> Option.map (Thm.prop_of o #2 o #2);
kleing@22340
   416
  in FindTheorems.print_theorems ctxt opt_goal opt_lim rem_dups spec end);
wenzelm@16026
   417
wenzelm@5831
   418
berghofe@26184
   419
(* find unused theorems *)
berghofe@26184
   420
wenzelm@26186
   421
fun unused_thms opt_range = Toplevel.keep (fn state =>
wenzelm@26186
   422
  let
wenzelm@26186
   423
    val thy = Toplevel.theory_of state;
wenzelm@26186
   424
    val ctxt = Toplevel.context_of state;
wenzelm@26186
   425
    fun pretty_thm (a, th) = ProofContext.pretty_fact ctxt (a, [th]);
wenzelm@26186
   426
  in
wenzelm@26186
   427
    ThmDeps.unused_thms
wenzelm@26186
   428
      (case opt_range of
wenzelm@26694
   429
        NONE => (Theory.parents_of thy, [thy])
wenzelm@26694
   430
      | SOME (xs, NONE) => (map ThyInfo.get_theory xs, [thy])
wenzelm@26694
   431
      | SOME (xs, SOME ys) => (map ThyInfo.get_theory xs, map ThyInfo.get_theory ys))
wenzelm@26186
   432
    |> map pretty_thm |> Pretty.chunks |> Pretty.writeln
wenzelm@26186
   433
  end);
berghofe@26184
   434
berghofe@26184
   435
wenzelm@5831
   436
(* print proof context contents *)
wenzelm@5831
   437
wenzelm@21663
   438
val print_binds = Toplevel.unknown_context o Toplevel.keep (fn state =>
wenzelm@21663
   439
  ProofContext.setmp_verbose ProofContext.print_binds (Toplevel.context_of state));
wenzelm@9513
   440
wenzelm@21663
   441
val print_cases = Toplevel.unknown_context o Toplevel.keep (fn state =>
wenzelm@21663
   442
  ProofContext.setmp_verbose ProofContext.print_cases (Toplevel.context_of state));
wenzelm@5831
   443
wenzelm@5831
   444
wenzelm@19268
   445
(* print theorems, terms, types etc. *)
wenzelm@19268
   446
wenzelm@19385
   447
local
wenzelm@19385
   448
wenzelm@19385
   449
fun string_of_stmts state args =
wenzelm@19268
   450
  Proof.get_thmss state args
wenzelm@21437
   451
  |> map (Element.pretty_statement (Proof.context_of state) Thm.theoremK)
wenzelm@19385
   452
  |> Pretty.chunks2 |> Pretty.string_of;
wenzelm@5880
   453
wenzelm@19385
   454
fun string_of_thms state args =
wenzelm@12055
   455
  Pretty.string_of (ProofContext.pretty_thms (Proof.context_of state)
wenzelm@19385
   456
    (Proof.get_thmss state args));
wenzelm@5895
   457
wenzelm@19385
   458
fun string_of_prfs full state arg =
wenzelm@17066
   459
  Pretty.string_of (case arg of
skalberg@15531
   460
      NONE =>
berghofe@12125
   461
        let
wenzelm@17066
   462
          val (ctxt, (_, thm)) = Proof.get_goal state;
wenzelm@26626
   463
          val thy = ProofContext.theory_of ctxt;
wenzelm@28814
   464
          val prf = Thm.proof_of thm;
wenzelm@17066
   465
          val prop = Thm.full_prop_of thm;
berghofe@12125
   466
          val prf' = Proofterm.rewrite_proof_notypes ([], []) prf
berghofe@12125
   467
        in
wenzelm@27258
   468
          ProofSyntax.pretty_proof ctxt
wenzelm@17066
   469
            (if full then Reconstruct.reconstruct_proof thy prop prf' else prf')
berghofe@12125
   470
        end
skalberg@15531
   471
    | SOME args => Pretty.chunks
wenzelm@27258
   472
        (map (ProofSyntax.pretty_proof_of (Proof.context_of state) full)
wenzelm@19385
   473
          (Proof.get_thmss state args)));
berghofe@11524
   474
wenzelm@19385
   475
fun string_of_prop state s =
wenzelm@5831
   476
  let
wenzelm@12055
   477
    val ctxt = Proof.context_of state;
wenzelm@24508
   478
    val prop = Syntax.read_prop ctxt s;
wenzelm@26704
   479
    val ctxt' = Variable.auto_fixes prop ctxt;
wenzelm@26704
   480
  in Pretty.string_of (Pretty.quote (Syntax.pretty_term ctxt' prop)) end;
wenzelm@5831
   481
wenzelm@19385
   482
fun string_of_term state s =
wenzelm@5831
   483
  let
wenzelm@12055
   484
    val ctxt = Proof.context_of state;
wenzelm@24508
   485
    val t = Syntax.read_term ctxt s;
wenzelm@5831
   486
    val T = Term.type_of t;
wenzelm@26704
   487
    val ctxt' = Variable.auto_fixes t ctxt;
wenzelm@5831
   488
  in
wenzelm@19385
   489
    Pretty.string_of
wenzelm@26704
   490
      (Pretty.block [Pretty.quote (Syntax.pretty_term ctxt' t), Pretty.fbrk,
wenzelm@26704
   491
        Pretty.str "::", Pretty.brk 1, Pretty.quote (Syntax.pretty_typ ctxt' T)])
wenzelm@9128
   492
  end;
wenzelm@5831
   493
wenzelm@19385
   494
fun string_of_type state s =
wenzelm@5831
   495
  let
wenzelm@12055
   496
    val ctxt = Proof.context_of state;
wenzelm@25331
   497
    val T = Syntax.read_typ ctxt s;
wenzelm@24920
   498
  in Pretty.string_of (Pretty.quote (Syntax.pretty_typ ctxt T)) end;
wenzelm@9128
   499
wenzelm@23935
   500
fun print_item string_of (modes, arg) = Toplevel.keep (fn state =>
wenzelm@23935
   501
  PrintMode.with_modes modes (fn () =>
wenzelm@23935
   502
    writeln (string_of (Toplevel.enter_proof_body state) arg)) ());
wenzelm@19385
   503
wenzelm@19385
   504
in
wenzelm@9128
   505
wenzelm@19268
   506
val print_stmts = print_item string_of_stmts;
wenzelm@12876
   507
val print_thms = print_item string_of_thms;
wenzelm@19385
   508
val print_prfs = print_item o string_of_prfs;
wenzelm@12876
   509
val print_prop = print_item string_of_prop;
wenzelm@12876
   510
val print_term = print_item string_of_term;
wenzelm@12876
   511
val print_type = print_item string_of_type;
wenzelm@5831
   512
wenzelm@19385
   513
end;
wenzelm@19385
   514
wenzelm@12938
   515
wenzelm@12938
   516
(* markup commands *)
wenzelm@12938
   517
wenzelm@27876
   518
fun check_text (txt, pos) opt_node =
wenzelm@27876
   519
 (Position.report Markup.doc_source pos;
wenzelm@27876
   520
  ignore (ThyOutput.eval_antiquote (#1 (OuterKeyword.get_lexicons ())) opt_node (txt, pos)));
wenzelm@12953
   521
wenzelm@27853
   522
fun header_markup txt = Toplevel.keep (fn state =>
wenzelm@27853
   523
  if Toplevel.is_toplevel state then check_text txt NONE
wenzelm@27853
   524
  else raise Toplevel.UNDEF);
wenzelm@12953
   525
wenzelm@27853
   526
fun local_theory_markup (loc, txt) = Toplevel.present_local_theory loc (check_text txt o SOME);
wenzelm@27853
   527
fun proof_markup txt = Toplevel.present_proof (check_text txt o SOME);
wenzelm@12938
   528
wenzelm@5831
   529
end;