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