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