src/Pure/Isar/isar_cmd.ML
author wenzelm
Sat Mar 30 12:13:39 2013 +0100 (2013-03-30 ago)
changeset 51583 9100c8e66b69
parent 50737 f310d1735d93
child 51717 9e7d1c139569
permissions -rw-r--r--
item markup for Proof_Context.pretty_fact;
tuned signature;
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@42204
    16
  val translations: (xstring * string) Syntax.trrule list -> theory -> theory
wenzelm@42204
    17
  val no_translations: (xstring * string) Syntax.trrule list -> theory -> theory
wenzelm@30573
    18
  val oracle: bstring * Position.T -> Symbol_Pos.text * Position.T -> theory -> theory
haftmann@29579
    19
  val add_defs: (bool * bool) * ((binding * string) * Attrib.src list) list -> theory -> theory
wenzelm@40784
    20
  val declaration: {syntax: bool, pervasive: bool} ->
wenzelm@40784
    21
    Symbol_Pos.text * Position.T -> local_theory -> local_theory
wenzelm@42464
    22
  val simproc_setup: string * Position.T -> string list -> Symbol_Pos.text * Position.T ->
wenzelm@42464
    23
    string list -> local_theory -> local_theory
wenzelm@36176
    24
  val hide_class: bool -> xstring list -> theory -> theory
wenzelm@36176
    25
  val hide_type: bool -> xstring list -> theory -> theory
wenzelm@36176
    26
  val hide_const: bool -> xstring list -> theory -> theory
wenzelm@36176
    27
  val hide_fact: bool -> xstring list -> theory -> theory
wenzelm@28084
    28
  val have: (Attrib.binding * (string * string list) list) list -> bool -> Proof.state -> Proof.state
wenzelm@28084
    29
  val hence: (Attrib.binding * (string * string list) list) list -> bool -> Proof.state -> Proof.state
wenzelm@28084
    30
  val show: (Attrib.binding * (string * string list) list) list -> bool -> Proof.state -> Proof.state
wenzelm@28084
    31
  val thus: (Attrib.binding * (string * string list) list) list -> bool -> Proof.state -> Proof.state
wenzelm@49889
    32
  val qed: Method.text_range option -> Toplevel.transition -> Toplevel.transition
wenzelm@49889
    33
  val terminal_proof: Method.text_range * Method.text_range option ->
wenzelm@21350
    34
    Toplevel.transition -> Toplevel.transition
wenzelm@21350
    35
  val default_proof: Toplevel.transition -> Toplevel.transition
wenzelm@21350
    36
  val immediate_proof: Toplevel.transition -> Toplevel.transition
wenzelm@21350
    37
  val done_proof: Toplevel.transition -> Toplevel.transition
wenzelm@21350
    38
  val skip_proof: Toplevel.transition -> Toplevel.transition
wenzelm@30575
    39
  val ml_diag: bool -> Symbol_Pos.text * Position.T -> Toplevel.transition -> Toplevel.transition
wenzelm@48776
    40
  val diag_state: Proof.context -> Toplevel.state
wenzelm@48776
    41
  val diag_goal: Proof.context -> {context: Proof.context, facts: thm list, goal: thm}
wenzelm@48881
    42
  val display_drafts: string list -> Toplevel.transition -> Toplevel.transition
wenzelm@48881
    43
  val print_drafts: string list -> Toplevel.transition -> Toplevel.transition
wenzelm@33515
    44
  val print_theorems: bool -> Toplevel.transition -> Toplevel.transition
wenzelm@49569
    45
  val thy_deps: Toplevel.transition -> Toplevel.transition
wenzelm@49569
    46
  val locale_deps: Toplevel.transition -> Toplevel.transition
wenzelm@20574
    47
  val class_deps: Toplevel.transition -> Toplevel.transition
wenzelm@26336
    48
  val thm_deps: (Facts.ref * Attrib.src list) list -> Toplevel.transition -> Toplevel.transition
berghofe@26184
    49
  val unused_thms: (string list * string list option) option ->
berghofe@26184
    50
    Toplevel.transition -> Toplevel.transition
wenzelm@26336
    51
  val print_stmts: string list * (Facts.ref * Attrib.src list) list
wenzelm@19268
    52
    -> Toplevel.transition -> Toplevel.transition
wenzelm@26336
    53
  val print_thms: string list * (Facts.ref * Attrib.src list) list
wenzelm@10581
    54
    -> Toplevel.transition -> Toplevel.transition
wenzelm@26336
    55
  val print_prfs: bool -> string list * (Facts.ref * Attrib.src list) list option
berghofe@11524
    56
    -> Toplevel.transition -> Toplevel.transition
wenzelm@12876
    57
  val print_prop: (string list * string) -> Toplevel.transition -> Toplevel.transition
wenzelm@12876
    58
  val print_term: (string list * string) -> Toplevel.transition -> Toplevel.transition
wenzelm@48792
    59
  val print_type: (string list * (string * string option)) ->
wenzelm@48792
    60
    Toplevel.transition -> Toplevel.transition
wenzelm@30573
    61
  val header_markup: Symbol_Pos.text * Position.T -> Toplevel.transition -> Toplevel.transition
wenzelm@45488
    62
  val local_theory_markup: (xstring * Position.T) option * (Symbol_Pos.text * Position.T) ->
wenzelm@17262
    63
    Toplevel.transition -> Toplevel.transition
wenzelm@30573
    64
  val proof_markup: Symbol_Pos.text * Position.T -> Toplevel.transition -> Toplevel.transition
wenzelm@5831
    65
end;
wenzelm@5831
    66
wenzelm@37216
    67
structure Isar_Cmd: ISAR_CMD =
wenzelm@5831
    68
struct
wenzelm@5831
    69
wenzelm@5831
    70
wenzelm@22116
    71
(** theory declarations **)
wenzelm@22116
    72
wenzelm@30461
    73
(* generic setup *)
wenzelm@22116
    74
wenzelm@30461
    75
fun global_setup (txt, pos) =
wenzelm@37198
    76
  ML_Lex.read pos txt
wenzelm@37198
    77
  |> ML_Context.expression pos "val setup: theory -> theory" "Context.map_theory setup"
wenzelm@26435
    78
  |> Context.theory_map;
wenzelm@22116
    79
wenzelm@30461
    80
fun local_setup (txt, pos) =
wenzelm@37198
    81
  ML_Lex.read pos txt
wenzelm@37198
    82
  |> ML_Context.expression pos "val setup: local_theory -> local_theory" "Context.map_proof setup"
wenzelm@30461
    83
  |> Context.proof_map;
wenzelm@30461
    84
wenzelm@22116
    85
wenzelm@22116
    86
(* translation functions *)
wenzelm@22116
    87
wenzelm@22116
    88
local
wenzelm@22116
    89
wenzelm@22116
    90
fun advancedT false = ""
wenzelm@22116
    91
  | advancedT true = "Proof.context -> ";
wenzelm@22116
    92
wenzelm@22116
    93
fun advancedN false = ""
wenzelm@22116
    94
  | advancedN true = "advanced_";
wenzelm@22116
    95
wenzelm@22116
    96
in
wenzelm@22116
    97
wenzelm@26385
    98
fun parse_ast_translation (a, (txt, pos)) =
wenzelm@37198
    99
  ML_Lex.read pos txt
wenzelm@37198
   100
  |> ML_Context.expression pos
wenzelm@26455
   101
    ("val parse_ast_translation: (string * (" ^ advancedT a ^
wenzelm@42224
   102
      "Ast.ast list -> Ast.ast)) list")
wenzelm@22116
   103
    ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfuns (parse_ast_translation, [], [], []))")
wenzelm@22116
   104
  |> Context.theory_map;
wenzelm@22116
   105
wenzelm@26385
   106
fun parse_translation (a, (txt, pos)) =
wenzelm@37198
   107
  ML_Lex.read pos txt
wenzelm@37198
   108
  |> ML_Context.expression pos
wenzelm@26455
   109
    ("val parse_translation: (string * (" ^ advancedT a ^
wenzelm@22116
   110
      "term list -> term)) list")
wenzelm@22116
   111
    ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfuns ([], parse_translation, [], []))")
wenzelm@22116
   112
  |> Context.theory_map;
wenzelm@22116
   113
wenzelm@26385
   114
fun print_translation (a, (txt, pos)) =
wenzelm@37198
   115
  ML_Lex.read pos txt
wenzelm@37198
   116
  |> ML_Context.expression pos
wenzelm@26455
   117
    ("val print_translation: (string * (" ^ advancedT a ^
wenzelm@22116
   118
      "term list -> term)) list")
wenzelm@22116
   119
    ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfuns ([], [], print_translation, []))")
wenzelm@22116
   120
  |> Context.theory_map;
wenzelm@22116
   121
wenzelm@26385
   122
fun print_ast_translation (a, (txt, pos)) =
wenzelm@37198
   123
  ML_Lex.read pos txt
wenzelm@37198
   124
  |> ML_Context.expression pos
wenzelm@26455
   125
    ("val print_ast_translation: (string * (" ^ advancedT a ^
wenzelm@42224
   126
      "Ast.ast list -> Ast.ast)) list")
wenzelm@22116
   127
    ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfuns ([], [], [], print_ast_translation))")
wenzelm@22116
   128
  |> Context.theory_map;
wenzelm@22116
   129
wenzelm@26385
   130
fun typed_print_translation (a, (txt, pos)) =
wenzelm@37198
   131
  ML_Lex.read pos txt
wenzelm@37198
   132
  |> ML_Context.expression pos
wenzelm@42247
   133
    ("val typed_print_translation: (string * (" ^ advancedT a ^ "typ -> term list -> term)) list")
wenzelm@22116
   134
    ("Context.map_theory (Sign.add_" ^ advancedN a ^ "trfunsT typed_print_translation)")
wenzelm@22116
   135
  |> Context.theory_map;
wenzelm@22116
   136
wenzelm@22116
   137
end;
wenzelm@22116
   138
wenzelm@22116
   139
wenzelm@42204
   140
(* translation rules *)
wenzelm@42204
   141
wenzelm@42204
   142
fun read_trrules thy raw_rules =
wenzelm@42204
   143
  let
wenzelm@42360
   144
    val ctxt = Proof_Context.init_global thy;
wenzelm@42204
   145
  in
wenzelm@42204
   146
    raw_rules |> map (Syntax.map_trrule (fn (r, s) =>
wenzelm@42360
   147
      Syntax_Phases.parse_ast_pattern ctxt (Proof_Context.intern_type ctxt r, s)))
wenzelm@42204
   148
  end;
wenzelm@42204
   149
wenzelm@42204
   150
fun translations args thy = Sign.add_trrules (read_trrules thy args) thy;
wenzelm@42204
   151
fun no_translations args thy = Sign.del_trrules (read_trrules thy args) thy;
wenzelm@42204
   152
wenzelm@42204
   153
wenzelm@22116
   154
(* oracles *)
wenzelm@22116
   155
wenzelm@30334
   156
fun oracle (name, pos) (body_txt, body_pos) =
wenzelm@27871
   157
  let
wenzelm@37198
   158
    val body = ML_Lex.read body_pos body_txt;
wenzelm@37198
   159
    val ants =
wenzelm@37198
   160
      ML_Lex.read Position.none
wenzelm@37198
   161
       ("local\n\
wenzelm@37198
   162
        \  val binding = " ^ ML_Syntax.make_binding (name, pos) ^ ";\n\
wenzelm@37198
   163
        \  val body = ") @ body @ ML_Lex.read Position.none (";\n\
wenzelm@37198
   164
        \in\n\
wenzelm@37198
   165
        \  val " ^ name ^ " = snd (Context.>>> (Context.map_theory_result (Thm.add_oracle (binding, body))));\n\
wenzelm@37198
   166
        \end;\n");
wenzelm@37198
   167
  in Context.theory_map (ML_Context.exec (fn () => ML_Context.eval false body_pos ants)) end;
wenzelm@22116
   168
wenzelm@22116
   169
wenzelm@50737
   170
(* old-style defs *)
wenzelm@21350
   171
wenzelm@35852
   172
fun add_defs ((unchecked, overloaded), args) thy =
wenzelm@39557
   173
  thy |>
wenzelm@39557
   174
    (if unchecked then Global_Theory.add_defs_unchecked_cmd else Global_Theory.add_defs_cmd)
wenzelm@47815
   175
      overloaded
wenzelm@47815
   176
      (map (fn ((b, ax), srcs) => ((b, ax), map (Attrib.attribute_cmd_global thy) srcs)) args)
wenzelm@35852
   177
  |> snd;
wenzelm@21350
   178
wenzelm@21350
   179
wenzelm@22087
   180
(* declarations *)
wenzelm@22087
   181
wenzelm@40784
   182
fun declaration {syntax, pervasive} (txt, pos) =
wenzelm@37198
   183
  ML_Lex.read pos txt
wenzelm@37198
   184
  |> ML_Context.expression pos
wenzelm@26455
   185
    "val declaration: Morphism.declaration"
wenzelm@45291
   186
    ("Context.map_proof (Local_Theory.declaration {syntax = " ^ Bool.toString syntax ^ ", \
wenzelm@45291
   187
      \pervasive = " ^ Bool.toString pervasive ^ "} declaration)")
wenzelm@26385
   188
  |> Context.proof_map;
wenzelm@22087
   189
wenzelm@22087
   190
wenzelm@22202
   191
(* simprocs *)
wenzelm@22202
   192
wenzelm@37198
   193
fun simproc_setup name lhss (txt, pos) identifier =
wenzelm@37198
   194
  ML_Lex.read pos txt
wenzelm@37198
   195
  |> ML_Context.expression pos
wenzelm@22239
   196
    "val proc: Morphism.morphism -> Simplifier.simpset -> cterm -> thm option"
wenzelm@42464
   197
    ("Context.map_proof (Simplifier.def_simproc_cmd {name = " ^ ML_Syntax.make_binding name ^ ", \
wenzelm@37198
   198
      \lhss = " ^ ML_Syntax.print_strings lhss ^ ", proc = proc, \
wenzelm@37198
   199
      \identifier = Library.maps ML_Context.thms " ^ ML_Syntax.print_strings identifier ^ "})")
wenzelm@22202
   200
  |> Context.proof_map;
wenzelm@22202
   201
wenzelm@22202
   202
wenzelm@26671
   203
(* hide names *)
wenzelm@26671
   204
wenzelm@36176
   205
fun hide_names intern check hide fully xnames thy =
wenzelm@36176
   206
  let
wenzelm@36176
   207
    val names = map (intern thy) xnames;
wenzelm@36176
   208
    val bads = filter_out (check thy) names;
wenzelm@36176
   209
  in
wenzelm@36176
   210
    if null bads then fold (hide fully) names thy
wenzelm@36176
   211
    else error ("Attempt to hide undeclared item(s): " ^ commas_quote bads)
wenzelm@36176
   212
  end;
wenzelm@26671
   213
wenzelm@36176
   214
val hide_class = hide_names Sign.intern_class (can o Sign.certify_class) Sign.hide_class;
wenzelm@36176
   215
val hide_type = hide_names Sign.intern_type Sign.declared_tyname Sign.hide_type;
wenzelm@36176
   216
val hide_const = hide_names Sign.intern_const Sign.declared_const Sign.hide_const;
wenzelm@39557
   217
val hide_fact =
wenzelm@39557
   218
  hide_names Global_Theory.intern_fact Global_Theory.defined_fact Global_Theory.hide_fact;
wenzelm@26671
   219
wenzelm@26671
   220
wenzelm@21350
   221
(* goals *)
wenzelm@21350
   222
wenzelm@21350
   223
fun goal opt_chain goal stmt int =
wenzelm@29383
   224
  opt_chain #> goal NONE (K I) stmt int;
wenzelm@21350
   225
wenzelm@36323
   226
val have = goal I Proof.have_cmd;
wenzelm@36323
   227
val hence = goal Proof.chain Proof.have_cmd;
wenzelm@36323
   228
val show = goal I Proof.show_cmd;
wenzelm@36323
   229
val thus = goal Proof.chain Proof.show_cmd;
wenzelm@21350
   230
wenzelm@21350
   231
wenzelm@21350
   232
(* local endings *)
wenzelm@21350
   233
wenzelm@29383
   234
fun local_qed m = Toplevel.proof (Proof.local_qed (m, true));
wenzelm@32061
   235
val local_terminal_proof = Toplevel.proof' o Proof.local_future_terminal_proof;
wenzelm@29383
   236
val local_default_proof = Toplevel.proof Proof.local_default_proof;
wenzelm@29383
   237
val local_immediate_proof = Toplevel.proof Proof.local_immediate_proof;
wenzelm@29383
   238
val local_done_proof = Toplevel.proof Proof.local_done_proof;
wenzelm@29383
   239
val local_skip_proof = Toplevel.proof' Proof.local_skip_proof;
wenzelm@21350
   240
wenzelm@27562
   241
val skip_local_qed = Toplevel.skip_proof (fn i => if i > 1 then i - 1 else raise Toplevel.UNDEF);
wenzelm@21350
   242
wenzelm@21350
   243
wenzelm@21350
   244
(* global endings *)
wenzelm@21350
   245
wenzelm@21350
   246
fun global_qed m = Toplevel.end_proof (K (Proof.global_qed (m, true)));
wenzelm@49012
   247
val global_terminal_proof = Toplevel.end_proof o Proof.global_future_terminal_proof;
wenzelm@21350
   248
val global_default_proof = Toplevel.end_proof (K Proof.global_default_proof);
wenzelm@21350
   249
val global_immediate_proof = Toplevel.end_proof (K Proof.global_immediate_proof);
wenzelm@21350
   250
val global_skip_proof = Toplevel.end_proof Proof.global_skip_proof;
wenzelm@21350
   251
val global_done_proof = Toplevel.end_proof (K Proof.global_done_proof);
wenzelm@21350
   252
wenzelm@28375
   253
val skip_global_qed = Toplevel.skip_proof_to_theory (fn n => n = 1);
wenzelm@21350
   254
wenzelm@21350
   255
wenzelm@21350
   256
(* common endings *)
wenzelm@21350
   257
wenzelm@21350
   258
fun qed m = local_qed m o global_qed m o skip_local_qed o skip_global_qed;
wenzelm@21350
   259
fun terminal_proof m = local_terminal_proof m o global_terminal_proof m;
wenzelm@21350
   260
val default_proof = local_default_proof o global_default_proof;
wenzelm@21350
   261
val immediate_proof = local_immediate_proof o global_immediate_proof;
wenzelm@21350
   262
val done_proof = local_done_proof o global_done_proof;
wenzelm@21350
   263
val skip_proof = local_skip_proof o global_skip_proof;
wenzelm@21350
   264
wenzelm@21350
   265
wenzelm@26489
   266
(* diagnostic ML evaluation *)
wenzelm@5831
   267
wenzelm@37305
   268
structure Diag_State = Proof_Data
wenzelm@37305
   269
(
wenzelm@37305
   270
  type T = Toplevel.state;
wenzelm@37305
   271
  fun init _ = Toplevel.toplevel;
wenzelm@37305
   272
);
wenzelm@37305
   273
wenzelm@26489
   274
fun ml_diag verbose (txt, pos) = Toplevel.keep (fn state =>
wenzelm@37305
   275
  let val opt_ctxt =
wenzelm@37305
   276
    try Toplevel.generic_theory_of state
wenzelm@37305
   277
    |> Option.map (Context.proof_of #> Diag_State.put state)
wenzelm@37305
   278
  in ML_Context.eval_text_in opt_ctxt verbose pos txt end);
wenzelm@37305
   279
wenzelm@48776
   280
val diag_state = Diag_State.get;
wenzelm@37305
   281
wenzelm@48776
   282
fun diag_goal ctxt =
wenzelm@48776
   283
  Proof.goal (Toplevel.proof_of (diag_state ctxt))
wenzelm@37305
   284
    handle Toplevel.UNDEF => error "No goal present";
wenzelm@37305
   285
wenzelm@43560
   286
val _ =
wenzelm@43560
   287
  Context.>> (Context.map_theory
wenzelm@43560
   288
   (ML_Antiquote.value (Binding.qualify true "Isar" (Binding.name "state"))
wenzelm@48776
   289
      (Scan.succeed "Isar_Cmd.diag_state ML_context") #>
wenzelm@43560
   290
    ML_Antiquote.value (Binding.qualify true "Isar" (Binding.name "goal"))
wenzelm@48776
   291
      (Scan.succeed "Isar_Cmd.diag_goal ML_context")));
wenzelm@5831
   292
wenzelm@5831
   293
wenzelm@14934
   294
(* present draft files *)
wenzelm@14934
   295
wenzelm@48881
   296
fun display_drafts names = Toplevel.imperative (fn () =>
wenzelm@48881
   297
  let
wenzelm@48881
   298
    val paths = map Path.explode names;
wenzelm@48881
   299
    val outfile = File.shell_path (Present.drafts (getenv "ISABELLE_DOC_FORMAT") paths);
wenzelm@40743
   300
  in Isabelle_System.isabelle_tool "display" ("-c " ^ outfile ^ " &"); () end);
wenzelm@14934
   301
wenzelm@48881
   302
fun print_drafts names = Toplevel.imperative (fn () =>
wenzelm@48881
   303
  let
wenzelm@48881
   304
    val paths = map Path.explode names;
wenzelm@48881
   305
    val outfile = File.shell_path (Present.drafts "ps" paths);
wenzelm@40743
   306
  in Isabelle_System.isabelle_tool "print" ("-c " ^ outfile); () end);
wenzelm@14934
   307
wenzelm@14934
   308
wenzelm@50737
   309
(* print theorems *)
wenzelm@23989
   310
wenzelm@35141
   311
val print_theorems_proof =
wenzelm@42360
   312
  Toplevel.keep (Proof_Context.print_lthms o Proof.context_of o Toplevel.proof_of);
wenzelm@17066
   313
wenzelm@33515
   314
fun print_theorems_theory verbose = Toplevel.keep (fn state =>
wenzelm@18588
   315
  Toplevel.theory_of state |>
wenzelm@30801
   316
  (case Toplevel.previous_context_of state of
wenzelm@42360
   317
    SOME prev => Proof_Display.print_theorems_diff verbose (Proof_Context.theory_of prev)
wenzelm@33515
   318
  | NONE => Proof_Display.print_theorems verbose));
wenzelm@18588
   319
wenzelm@33515
   320
fun print_theorems verbose =
wenzelm@33515
   321
  Toplevel.unknown_context o print_theorems_theory verbose o print_theorems_proof;
wenzelm@9513
   322
wenzelm@12060
   323
wenzelm@50737
   324
(* display dependencies *)
wenzelm@5831
   325
haftmann@22485
   326
val thy_deps = Toplevel.unknown_theory o Toplevel.keep (fn state =>
haftmann@22485
   327
  let
haftmann@22485
   328
    val thy = Toplevel.theory_of state;
wenzelm@37866
   329
    val thy_session = Present.session_name thy;
wenzelm@37866
   330
wenzelm@42425
   331
    val gr = rev (Theory.nodes_of thy) |> map (fn node =>
wenzelm@22602
   332
      let
wenzelm@22602
   333
        val name = Context.theory_name node;
wenzelm@22602
   334
        val parents = map Context.theory_name (Theory.parents_of node);
wenzelm@37866
   335
        val session = Present.session_name node;
wenzelm@37866
   336
        val unfold = (session = thy_session);
wenzelm@49561
   337
      in
wenzelm@49561
   338
       {name = name, ID = name, parents = parents, dir = session,
wenzelm@49561
   339
        unfold = unfold, path = "", content = []}
wenzelm@49561
   340
      end);
wenzelm@49561
   341
  in Graph_Display.display_graph gr end);
haftmann@22485
   342
wenzelm@49569
   343
val locale_deps = Toplevel.unknown_theory o Toplevel.keep (fn state =>
wenzelm@49569
   344
  let
wenzelm@49569
   345
    val thy = Toplevel.theory_of state;
wenzelm@49569
   346
    val gr = Locale.pretty_locale_deps thy |> map (fn {name, parents, body} =>
wenzelm@49569
   347
     {name = Locale.extern thy name, ID = name, parents = parents,
wenzelm@49569
   348
      dir = "", unfold = true, path = "", content = [body]});
wenzelm@49569
   349
  in Graph_Display.display_graph gr end);
wenzelm@49569
   350
wenzelm@20574
   351
val class_deps = Toplevel.unknown_theory o Toplevel.keep (fn state =>
wenzelm@20574
   352
  let
wenzelm@42358
   353
    val ctxt = Toplevel.context_of state;
wenzelm@42360
   354
    val {classes = (space, algebra), ...} = Type.rep_tsig (Proof_Context.tsig_of ctxt);
wenzelm@36328
   355
    val classes = Sorts.classes_of algebra;
wenzelm@20574
   356
    fun entry (c, (i, (_, cs))) =
wenzelm@44338
   357
      (i, {name = Name_Space.extern ctxt space c, ID = c, parents = Graph.Keys.dest cs,
wenzelm@49561
   358
            dir = "", unfold = true, path = "", content = []});
wenzelm@20574
   359
    val gr =
wenzelm@20574
   360
      Graph.fold (cons o entry) classes []
wenzelm@20574
   361
      |> sort (int_ord o pairself #1) |> map #2;
wenzelm@49561
   362
  in Graph_Display.display_graph gr end);
wenzelm@20574
   363
wenzelm@9513
   364
fun thm_deps args = Toplevel.unknown_theory o Toplevel.keep (fn state =>
wenzelm@37870
   365
  Thm_Deps.thm_deps (Toplevel.theory_of state)
wenzelm@38331
   366
    (Attrib.eval_thms (Toplevel.context_of state) args));
wenzelm@9454
   367
wenzelm@5831
   368
berghofe@26184
   369
(* find unused theorems *)
berghofe@26184
   370
wenzelm@26186
   371
fun unused_thms opt_range = Toplevel.keep (fn state =>
wenzelm@26186
   372
  let
wenzelm@26186
   373
    val thy = Toplevel.theory_of state;
wenzelm@26186
   374
    val ctxt = Toplevel.context_of state;
wenzelm@42360
   375
    fun pretty_thm (a, th) = Proof_Context.pretty_fact ctxt (a, [th]);
wenzelm@37870
   376
    val get_theory = Context.get_theory thy;
wenzelm@26186
   377
  in
wenzelm@33391
   378
    Thm_Deps.unused_thms
wenzelm@26186
   379
      (case opt_range of
wenzelm@26694
   380
        NONE => (Theory.parents_of thy, [thy])
wenzelm@37870
   381
      | SOME (xs, NONE) => (map get_theory xs, [thy])
wenzelm@37870
   382
      | SOME (xs, SOME ys) => (map get_theory xs, map get_theory ys))
wenzelm@26186
   383
    |> map pretty_thm |> Pretty.chunks |> Pretty.writeln
wenzelm@26186
   384
  end);
berghofe@26184
   385
berghofe@26184
   386
wenzelm@19268
   387
(* print theorems, terms, types etc. *)
wenzelm@19268
   388
wenzelm@19385
   389
local
wenzelm@19385
   390
wenzelm@38331
   391
fun string_of_stmts ctxt args =
wenzelm@38331
   392
  Attrib.eval_thms ctxt args
wenzelm@38331
   393
  |> map (Element.pretty_statement ctxt Thm.theoremK)
wenzelm@19385
   394
  |> Pretty.chunks2 |> Pretty.string_of;
wenzelm@5880
   395
wenzelm@38331
   396
fun string_of_thms ctxt args =
wenzelm@51583
   397
  Pretty.string_of (Proof_Context.pretty_fact ctxt ("", Attrib.eval_thms ctxt args));
wenzelm@5895
   398
wenzelm@19385
   399
fun string_of_prfs full state arg =
wenzelm@32859
   400
  Pretty.string_of
wenzelm@32859
   401
    (case arg of
skalberg@15531
   402
      NONE =>
berghofe@12125
   403
        let
wenzelm@38331
   404
          val {context = ctxt, goal = thm} = Proof.simple_goal (Toplevel.proof_of state);
wenzelm@42360
   405
          val thy = Proof_Context.theory_of ctxt;
wenzelm@28814
   406
          val prf = Thm.proof_of thm;
wenzelm@17066
   407
          val prop = Thm.full_prop_of thm;
wenzelm@32859
   408
          val prf' = Proofterm.rewrite_proof_notypes ([], []) prf;
berghofe@12125
   409
        in
wenzelm@33388
   410
          Proof_Syntax.pretty_proof ctxt
wenzelm@17066
   411
            (if full then Reconstruct.reconstruct_proof thy prop prf' else prf')
berghofe@12125
   412
        end
wenzelm@38331
   413
    | SOME srcs =>
wenzelm@38331
   414
        let val ctxt = Toplevel.context_of state
wenzelm@38331
   415
        in map (Proof_Syntax.pretty_proof_of ctxt full) (Attrib.eval_thms ctxt srcs) end
wenzelm@38331
   416
        |> Pretty.chunks);
berghofe@11524
   417
wenzelm@38331
   418
fun string_of_prop ctxt s =
wenzelm@5831
   419
  let
wenzelm@24508
   420
    val prop = Syntax.read_prop ctxt s;
wenzelm@26704
   421
    val ctxt' = Variable.auto_fixes prop ctxt;
wenzelm@26704
   422
  in Pretty.string_of (Pretty.quote (Syntax.pretty_term ctxt' prop)) end;
wenzelm@5831
   423
wenzelm@38331
   424
fun string_of_term ctxt s =
wenzelm@5831
   425
  let
wenzelm@24508
   426
    val t = Syntax.read_term ctxt s;
wenzelm@5831
   427
    val T = Term.type_of t;
wenzelm@26704
   428
    val ctxt' = Variable.auto_fixes t ctxt;
wenzelm@5831
   429
  in
wenzelm@19385
   430
    Pretty.string_of
wenzelm@26704
   431
      (Pretty.block [Pretty.quote (Syntax.pretty_term ctxt' t), Pretty.fbrk,
wenzelm@26704
   432
        Pretty.str "::", Pretty.brk 1, Pretty.quote (Syntax.pretty_typ ctxt' T)])
wenzelm@9128
   433
  end;
wenzelm@5831
   434
wenzelm@48792
   435
fun string_of_type ctxt (s, NONE) =
wenzelm@48792
   436
      let val T = Syntax.read_typ ctxt s
wenzelm@48792
   437
      in Pretty.string_of (Pretty.quote (Syntax.pretty_typ ctxt T)) end
wenzelm@48792
   438
  | string_of_type ctxt (s1, SOME s2) =
wenzelm@48792
   439
      let
wenzelm@48792
   440
        val ctxt' = Config.put show_sorts true ctxt;
wenzelm@48792
   441
        val raw_T = Syntax.parse_typ ctxt' s1;
wenzelm@48792
   442
        val S = Syntax.read_sort ctxt' s2;
wenzelm@48792
   443
        val T =
wenzelm@48792
   444
          Syntax.check_term ctxt'
wenzelm@48792
   445
            (Logic.mk_type raw_T |> Type.constraint (Term.itselfT (Type_Infer.anyT S)))
wenzelm@48792
   446
          |> Logic.dest_type;
wenzelm@48792
   447
      in Pretty.string_of (Pretty.quote (Syntax.pretty_typ ctxt' T)) end;
wenzelm@9128
   448
wenzelm@23935
   449
fun print_item string_of (modes, arg) = Toplevel.keep (fn state =>
wenzelm@38331
   450
  Print_Mode.with_modes modes (fn () => writeln (string_of state arg)) ());
wenzelm@19385
   451
wenzelm@19385
   452
in
wenzelm@9128
   453
wenzelm@38331
   454
val print_stmts = print_item (string_of_stmts o Toplevel.context_of);
wenzelm@38331
   455
val print_thms = print_item (string_of_thms o Toplevel.context_of);
wenzelm@19385
   456
val print_prfs = print_item o string_of_prfs;
wenzelm@38331
   457
val print_prop = print_item (string_of_prop o Toplevel.context_of);
wenzelm@38331
   458
val print_term = print_item (string_of_term o Toplevel.context_of);
wenzelm@38331
   459
val print_type = print_item (string_of_type o Toplevel.context_of);
wenzelm@5831
   460
wenzelm@19385
   461
end;
wenzelm@19385
   462
wenzelm@12938
   463
wenzelm@12938
   464
(* markup commands *)
wenzelm@12938
   465
wenzelm@27853
   466
fun header_markup txt = Toplevel.keep (fn state =>
wenzelm@48918
   467
  if Toplevel.is_toplevel state then Thy_Output.check_text txt state
wenzelm@27853
   468
  else raise Toplevel.UNDEF);
wenzelm@12953
   469
wenzelm@48918
   470
fun local_theory_markup (loc, txt) = Toplevel.present_local_theory loc (Thy_Output.check_text txt);
wenzelm@48918
   471
val proof_markup = Toplevel.present_proof o Thy_Output.check_text;
wenzelm@12938
   472
wenzelm@5831
   473
end;