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