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