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