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