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