src/Pure/Isar/isar_cmd.ML
author wenzelm
Mon Apr 06 12:51:25 2015 +0200 (2015-04-06 ago)
changeset 59930 bdbc4b761c31
parent 59917 9830c944670f
child 60082 d3573eb7728f
permissions -rw-r--r--
tuned signature;
wenzelm@5831
     1
(*  Title:      Pure/Isar/isar_cmd.ML
wenzelm@5831
     2
    Author:     Markus Wenzel, TU Muenchen
wenzelm@5831
     3
wenzelm@30805
     4
Miscellaneous Isar commands.
wenzelm@5831
     5
*)
wenzelm@5831
     6
wenzelm@5831
     7
signature ISAR_CMD =
wenzelm@5831
     8
sig
wenzelm@59930
     9
  val setup: Input.source -> theory -> theory
wenzelm@59064
    10
  val local_setup: Input.source -> Proof.context -> Proof.context
wenzelm@59064
    11
  val parse_ast_translation: Input.source -> theory -> theory
wenzelm@59064
    12
  val parse_translation: Input.source -> theory -> theory
wenzelm@59064
    13
  val print_translation: Input.source -> theory -> theory
wenzelm@59064
    14
  val typed_print_translation: Input.source -> theory -> theory
wenzelm@59064
    15
  val print_ast_translation: Input.source -> 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@59064
    18
  val oracle: bstring * Position.range -> Input.source -> theory -> theory
wenzelm@58011
    19
  val add_defs: (bool * bool) * ((binding * string) * Token.src list) list -> theory -> theory
wenzelm@59064
    20
  val declaration: {syntax: bool, pervasive: bool} -> Input.source -> local_theory -> local_theory
wenzelm@59064
    21
  val simproc_setup: string * Position.T -> string list -> Input.source ->
wenzelm@42464
    22
    string list -> local_theory -> local_theory
wenzelm@28084
    23
  val have: (Attrib.binding * (string * string list) list) list -> bool -> Proof.state -> Proof.state
wenzelm@28084
    24
  val hence: (Attrib.binding * (string * string list) list) list -> bool -> Proof.state -> Proof.state
wenzelm@28084
    25
  val show: (Attrib.binding * (string * string list) list) list -> bool -> Proof.state -> Proof.state
wenzelm@28084
    26
  val thus: (Attrib.binding * (string * string list) list) list -> bool -> Proof.state -> Proof.state
wenzelm@49889
    27
  val qed: Method.text_range option -> Toplevel.transition -> Toplevel.transition
wenzelm@49889
    28
  val terminal_proof: Method.text_range * Method.text_range option ->
wenzelm@21350
    29
    Toplevel.transition -> Toplevel.transition
wenzelm@21350
    30
  val default_proof: Toplevel.transition -> Toplevel.transition
wenzelm@21350
    31
  val immediate_proof: Toplevel.transition -> Toplevel.transition
wenzelm@21350
    32
  val done_proof: Toplevel.transition -> Toplevel.transition
wenzelm@21350
    33
  val skip_proof: Toplevel.transition -> Toplevel.transition
wenzelm@59064
    34
  val ml_diag: bool -> Input.source -> Toplevel.transition -> Toplevel.transition
wenzelm@48776
    35
  val diag_state: Proof.context -> Toplevel.state
wenzelm@48776
    36
  val diag_goal: Proof.context -> {context: Proof.context, facts: thm list, goal: thm}
wenzelm@57605
    37
  val pretty_theorems: bool -> Toplevel.state -> Pretty.T list
wenzelm@49569
    38
  val thy_deps: Toplevel.transition -> Toplevel.transition
wenzelm@49569
    39
  val locale_deps: Toplevel.transition -> Toplevel.transition
wenzelm@58011
    40
  val print_stmts: string list * (Facts.ref * Token.src list) list
wenzelm@19268
    41
    -> Toplevel.transition -> Toplevel.transition
wenzelm@58011
    42
  val print_thms: string list * (Facts.ref * Token.src list) list
wenzelm@10581
    43
    -> Toplevel.transition -> Toplevel.transition
wenzelm@58011
    44
  val print_prfs: bool -> string list * (Facts.ref * Token.src list) list option
berghofe@11524
    45
    -> Toplevel.transition -> Toplevel.transition
wenzelm@12876
    46
  val print_prop: (string list * string) -> Toplevel.transition -> Toplevel.transition
wenzelm@12876
    47
  val print_term: (string list * string) -> Toplevel.transition -> Toplevel.transition
wenzelm@48792
    48
  val print_type: (string list * (string * string option)) ->
wenzelm@48792
    49
    Toplevel.transition -> Toplevel.transition
wenzelm@5831
    50
end;
wenzelm@5831
    51
wenzelm@37216
    52
structure Isar_Cmd: ISAR_CMD =
wenzelm@5831
    53
struct
wenzelm@5831
    54
wenzelm@5831
    55
wenzelm@22116
    56
(** theory declarations **)
wenzelm@22116
    57
wenzelm@30461
    58
(* generic setup *)
wenzelm@22116
    59
wenzelm@59930
    60
fun setup source =
wenzelm@56278
    61
  ML_Lex.read_source false source
wenzelm@59064
    62
  |> ML_Context.expression (Input.range_of source) "setup" "theory -> theory"
wenzelm@58991
    63
    "Context.map_theory setup"
wenzelm@26435
    64
  |> Context.theory_map;
wenzelm@22116
    65
wenzelm@55828
    66
fun local_setup source =
wenzelm@56278
    67
  ML_Lex.read_source false source
wenzelm@59064
    68
  |> ML_Context.expression (Input.range_of source) "local_setup" "local_theory -> local_theory"
wenzelm@58991
    69
    "Context.map_proof local_setup"
wenzelm@30461
    70
  |> Context.proof_map;
wenzelm@30461
    71
wenzelm@22116
    72
wenzelm@22116
    73
(* translation functions *)
wenzelm@22116
    74
wenzelm@55828
    75
fun parse_ast_translation source =
wenzelm@56278
    76
  ML_Lex.read_source false source
wenzelm@59064
    77
  |> ML_Context.expression (Input.range_of source) "parse_ast_translation"
wenzelm@58991
    78
    "(string * (Proof.context -> Ast.ast list -> Ast.ast)) list"
wenzelm@52143
    79
    "Context.map_theory (Sign.parse_ast_translation parse_ast_translation)"
wenzelm@22116
    80
  |> Context.theory_map;
wenzelm@22116
    81
wenzelm@55828
    82
fun parse_translation source =
wenzelm@56278
    83
  ML_Lex.read_source false source
wenzelm@59064
    84
  |> ML_Context.expression (Input.range_of source) "parse_translation"
wenzelm@58991
    85
    "(string * (Proof.context -> term list -> term)) list"
wenzelm@52143
    86
    "Context.map_theory (Sign.parse_translation parse_translation)"
wenzelm@52143
    87
  |> Context.theory_map;
wenzelm@52143
    88
wenzelm@55828
    89
fun print_translation source =
wenzelm@56278
    90
  ML_Lex.read_source false source
wenzelm@59064
    91
  |> ML_Context.expression (Input.range_of source) "print_translation"
wenzelm@58991
    92
    "(string * (Proof.context -> term list -> term)) list"
wenzelm@52143
    93
    "Context.map_theory (Sign.print_translation print_translation)"
wenzelm@22116
    94
  |> Context.theory_map;
wenzelm@22116
    95
wenzelm@55828
    96
fun typed_print_translation source =
wenzelm@56278
    97
  ML_Lex.read_source false source
wenzelm@59064
    98
  |> ML_Context.expression (Input.range_of source) "typed_print_translation"
wenzelm@58991
    99
    "(string * (Proof.context -> typ -> term list -> term)) list"
wenzelm@52143
   100
    "Context.map_theory (Sign.typed_print_translation typed_print_translation)"
wenzelm@22116
   101
  |> Context.theory_map;
wenzelm@22116
   102
wenzelm@55828
   103
fun print_ast_translation source =
wenzelm@56278
   104
  ML_Lex.read_source false source
wenzelm@59064
   105
  |> ML_Context.expression (Input.range_of source) "print_ast_translation"
wenzelm@58991
   106
    "(string * (Proof.context -> Ast.ast list -> Ast.ast)) list"
wenzelm@52143
   107
    "Context.map_theory (Sign.print_ast_translation print_ast_translation)"
wenzelm@22116
   108
  |> Context.theory_map;
wenzelm@22116
   109
wenzelm@22116
   110
wenzelm@42204
   111
(* translation rules *)
wenzelm@42204
   112
wenzelm@42204
   113
fun read_trrules thy raw_rules =
wenzelm@42204
   114
  let
wenzelm@42360
   115
    val ctxt = Proof_Context.init_global thy;
wenzelm@56006
   116
    val read_root =
wenzelm@56006
   117
      #1 o dest_Type o Proof_Context.read_type_name {proper = true, strict = false} ctxt;
wenzelm@42204
   118
  in
wenzelm@56006
   119
    raw_rules
wenzelm@56006
   120
    |> map (Syntax.map_trrule (fn (r, s) => Syntax_Phases.parse_ast_pattern ctxt (read_root r, s)))
wenzelm@42204
   121
  end;
wenzelm@42204
   122
wenzelm@42204
   123
fun translations args thy = Sign.add_trrules (read_trrules thy args) thy;
wenzelm@42204
   124
fun no_translations args thy = Sign.del_trrules (read_trrules thy args) thy;
wenzelm@42204
   125
wenzelm@42204
   126
wenzelm@22116
   127
(* oracles *)
wenzelm@22116
   128
wenzelm@59029
   129
fun oracle (name, range) source =
wenzelm@27871
   130
  let
wenzelm@59064
   131
    val body_range = Input.range_of source;
wenzelm@56278
   132
    val body = ML_Lex.read_source false source;
wenzelm@59029
   133
wenzelm@37198
   134
    val ants =
wenzelm@59067
   135
      ML_Lex.read
wenzelm@37198
   136
       ("local\n\
wenzelm@59029
   137
        \  val binding = " ^ ML_Syntax.make_binding (name, #1 range) ^ ";\n\
wenzelm@59067
   138
        \  val") @ ML_Lex.read_set_range body_range "oracle" @ ML_Lex.read "=" @ body @
wenzelm@59067
   139
        ML_Lex.read (";\nin\n\
wenzelm@59067
   140
        \  val") @ ML_Lex.read_set_range range name @ ML_Lex.read "=\
wenzelm@59029
   141
        \ snd (Context.>>> (Context.map_theory_result (Thm.add_oracle (binding, oracle))));\n\
wenzelm@59029
   142
        \end;\n";
wenzelm@56304
   143
  in
wenzelm@56304
   144
    Context.theory_map
wenzelm@59029
   145
      (ML_Context.exec (fn () => ML_Context.eval ML_Compiler.flags (#1 body_range) ants))
wenzelm@56304
   146
  end;
wenzelm@22116
   147
wenzelm@22116
   148
wenzelm@50737
   149
(* old-style defs *)
wenzelm@21350
   150
wenzelm@35852
   151
fun add_defs ((unchecked, overloaded), args) thy =
wenzelm@57683
   152
 (legacy_feature "Old 'defs' command -- use 'definition' (with 'overloading') instead";
wenzelm@39557
   153
  thy |>
wenzelm@39557
   154
    (if unchecked then Global_Theory.add_defs_unchecked_cmd else Global_Theory.add_defs_cmd)
wenzelm@47815
   155
      overloaded
wenzelm@47815
   156
      (map (fn ((b, ax), srcs) => ((b, ax), map (Attrib.attribute_cmd_global thy) srcs)) args)
wenzelm@57683
   157
  |> snd);
wenzelm@21350
   158
wenzelm@21350
   159
wenzelm@22087
   160
(* declarations *)
wenzelm@22087
   161
wenzelm@55828
   162
fun declaration {syntax, pervasive} source =
wenzelm@56278
   163
  ML_Lex.read_source false source
wenzelm@59064
   164
  |> ML_Context.expression (Input.range_of source) "declaration" "Morphism.declaration"
wenzelm@45291
   165
    ("Context.map_proof (Local_Theory.declaration {syntax = " ^ Bool.toString syntax ^ ", \
wenzelm@45291
   166
      \pervasive = " ^ Bool.toString pervasive ^ "} declaration)")
wenzelm@26385
   167
  |> Context.proof_map;
wenzelm@22087
   168
wenzelm@22087
   169
wenzelm@22202
   170
(* simprocs *)
wenzelm@22202
   171
wenzelm@55828
   172
fun simproc_setup name lhss source identifier =
wenzelm@56278
   173
  ML_Lex.read_source false source
wenzelm@59064
   174
  |> ML_Context.expression (Input.range_of source) "proc"
wenzelm@58991
   175
    "Morphism.morphism -> Proof.context -> cterm -> thm option"
wenzelm@42464
   176
    ("Context.map_proof (Simplifier.def_simproc_cmd {name = " ^ ML_Syntax.make_binding name ^ ", \
wenzelm@37198
   177
      \lhss = " ^ ML_Syntax.print_strings lhss ^ ", proc = proc, \
wenzelm@37198
   178
      \identifier = Library.maps ML_Context.thms " ^ ML_Syntax.print_strings identifier ^ "})")
wenzelm@22202
   179
  |> Context.proof_map;
wenzelm@22202
   180
wenzelm@22202
   181
wenzelm@21350
   182
(* goals *)
wenzelm@21350
   183
wenzelm@21350
   184
fun goal opt_chain goal stmt int =
wenzelm@29383
   185
  opt_chain #> goal NONE (K I) stmt int;
wenzelm@21350
   186
wenzelm@36323
   187
val have = goal I Proof.have_cmd;
wenzelm@36323
   188
val hence = goal Proof.chain Proof.have_cmd;
wenzelm@36323
   189
val show = goal I Proof.show_cmd;
wenzelm@36323
   190
val thus = goal Proof.chain Proof.show_cmd;
wenzelm@21350
   191
wenzelm@21350
   192
wenzelm@21350
   193
(* local endings *)
wenzelm@21350
   194
wenzelm@29383
   195
fun local_qed m = Toplevel.proof (Proof.local_qed (m, true));
wenzelm@32061
   196
val local_terminal_proof = Toplevel.proof' o Proof.local_future_terminal_proof;
wenzelm@29383
   197
val local_default_proof = Toplevel.proof Proof.local_default_proof;
wenzelm@29383
   198
val local_immediate_proof = Toplevel.proof Proof.local_immediate_proof;
wenzelm@29383
   199
val local_done_proof = Toplevel.proof Proof.local_done_proof;
wenzelm@29383
   200
val local_skip_proof = Toplevel.proof' Proof.local_skip_proof;
wenzelm@21350
   201
wenzelm@27562
   202
val skip_local_qed = Toplevel.skip_proof (fn i => if i > 1 then i - 1 else raise Toplevel.UNDEF);
wenzelm@21350
   203
wenzelm@21350
   204
wenzelm@21350
   205
(* global endings *)
wenzelm@21350
   206
wenzelm@21350
   207
fun global_qed m = Toplevel.end_proof (K (Proof.global_qed (m, true)));
wenzelm@49012
   208
val global_terminal_proof = Toplevel.end_proof o Proof.global_future_terminal_proof;
wenzelm@21350
   209
val global_default_proof = Toplevel.end_proof (K Proof.global_default_proof);
wenzelm@21350
   210
val global_immediate_proof = Toplevel.end_proof (K Proof.global_immediate_proof);
wenzelm@21350
   211
val global_skip_proof = Toplevel.end_proof Proof.global_skip_proof;
wenzelm@21350
   212
val global_done_proof = Toplevel.end_proof (K Proof.global_done_proof);
wenzelm@21350
   213
wenzelm@28375
   214
val skip_global_qed = Toplevel.skip_proof_to_theory (fn n => n = 1);
wenzelm@21350
   215
wenzelm@21350
   216
wenzelm@21350
   217
(* common endings *)
wenzelm@21350
   218
wenzelm@21350
   219
fun qed m = local_qed m o global_qed m o skip_local_qed o skip_global_qed;
wenzelm@21350
   220
fun terminal_proof m = local_terminal_proof m o global_terminal_proof m;
wenzelm@21350
   221
val default_proof = local_default_proof o global_default_proof;
wenzelm@21350
   222
val immediate_proof = local_immediate_proof o global_immediate_proof;
wenzelm@21350
   223
val done_proof = local_done_proof o global_done_proof;
wenzelm@21350
   224
val skip_proof = local_skip_proof o global_skip_proof;
wenzelm@21350
   225
wenzelm@21350
   226
wenzelm@26489
   227
(* diagnostic ML evaluation *)
wenzelm@5831
   228
wenzelm@37305
   229
structure Diag_State = Proof_Data
wenzelm@37305
   230
(
wenzelm@37305
   231
  type T = Toplevel.state;
wenzelm@37305
   232
  fun init _ = Toplevel.toplevel;
wenzelm@37305
   233
);
wenzelm@37305
   234
wenzelm@55828
   235
fun ml_diag verbose source = Toplevel.keep (fn state =>
wenzelm@56304
   236
  let
wenzelm@56304
   237
    val opt_ctxt =
wenzelm@56304
   238
      try Toplevel.generic_theory_of state
wenzelm@56304
   239
      |> Option.map (Context.proof_of #> Diag_State.put state);
wenzelm@56304
   240
    val flags = ML_Compiler.verbose verbose ML_Compiler.flags;
wenzelm@56304
   241
  in ML_Context.eval_source_in opt_ctxt flags source end);
wenzelm@37305
   242
wenzelm@48776
   243
val diag_state = Diag_State.get;
wenzelm@37305
   244
wenzelm@48776
   245
fun diag_goal ctxt =
wenzelm@48776
   246
  Proof.goal (Toplevel.proof_of (diag_state ctxt))
wenzelm@37305
   247
    handle Toplevel.UNDEF => error "No goal present";
wenzelm@37305
   248
wenzelm@53171
   249
val _ = Theory.setup
wenzelm@56204
   250
  (ML_Antiquotation.value (Binding.qualify true "Isar" @{binding state})
wenzelm@53171
   251
    (Scan.succeed "Isar_Cmd.diag_state ML_context") #>
wenzelm@56204
   252
   ML_Antiquotation.value (Binding.qualify true "Isar" @{binding goal})
wenzelm@53171
   253
    (Scan.succeed "Isar_Cmd.diag_goal ML_context"));
wenzelm@5831
   254
wenzelm@5831
   255
wenzelm@56868
   256
(* theorems of theory or proof context *)
wenzelm@17066
   257
wenzelm@56868
   258
fun pretty_theorems verbose st =
wenzelm@56868
   259
  if Toplevel.is_proof st then
wenzelm@59917
   260
    Proof_Context.pretty_local_facts verbose (Toplevel.context_of st)
wenzelm@56868
   261
  else
wenzelm@56868
   262
    let
wenzelm@56868
   263
      val thy = Toplevel.theory_of st;
wenzelm@56868
   264
      val prev_thys =
wenzelm@56868
   265
        (case Toplevel.previous_context_of st of
wenzelm@56868
   266
          SOME prev => [Proof_Context.theory_of prev]
wenzelm@56868
   267
        | NONE => Theory.parents_of thy);
wenzelm@56868
   268
    in Proof_Display.pretty_theorems_diff verbose prev_thys thy end;
wenzelm@9513
   269
wenzelm@12060
   270
wenzelm@50737
   271
(* display dependencies *)
wenzelm@5831
   272
haftmann@22485
   273
val thy_deps = Toplevel.unknown_theory o Toplevel.keep (fn state =>
haftmann@22485
   274
  let
haftmann@22485
   275
    val thy = Toplevel.theory_of state;
wenzelm@37866
   276
    val thy_session = Present.session_name thy;
wenzelm@59210
   277
  in
wenzelm@59210
   278
    Theory.nodes_of thy
wenzelm@59210
   279
    |> map (fn thy_node =>
wenzelm@59210
   280
        let
wenzelm@59210
   281
          val name = Context.theory_name thy_node;
wenzelm@59210
   282
          val parents = map Context.theory_name (Theory.parents_of thy_node);
wenzelm@59210
   283
          val session = Present.session_name thy_node;
wenzelm@59210
   284
          val node =
wenzelm@59210
   285
            Graph_Display.session_node
wenzelm@59210
   286
              {name = name, directory = session, unfold = session = thy_session, path = ""};
wenzelm@59210
   287
        in ((name, node), parents) end)
wenzelm@59210
   288
    |> Graph_Display.display_graph
wenzelm@59210
   289
  end);
haftmann@22485
   290
wenzelm@49569
   291
val locale_deps = Toplevel.unknown_theory o Toplevel.keep (fn state =>
wenzelm@49569
   292
  let
wenzelm@49569
   293
    val thy = Toplevel.theory_of state;
wenzelm@59210
   294
  in
wenzelm@59210
   295
    Locale.pretty_locale_deps thy
wenzelm@59210
   296
    |> map (fn {name, parents, body} =>
wenzelm@59210
   297
      ((name, Graph_Display.content_node (Locale.extern thy name) [body]), parents))
wenzelm@59210
   298
    |> Graph_Display.display_graph
wenzelm@59210
   299
  end);
wenzelm@49569
   300
berghofe@26184
   301
wenzelm@19268
   302
(* print theorems, terms, types etc. *)
wenzelm@19268
   303
wenzelm@19385
   304
local
wenzelm@19385
   305
wenzelm@38331
   306
fun string_of_stmts ctxt args =
wenzelm@38331
   307
  Attrib.eval_thms ctxt args
wenzelm@38331
   308
  |> map (Element.pretty_statement ctxt Thm.theoremK)
wenzelm@19385
   309
  |> Pretty.chunks2 |> Pretty.string_of;
wenzelm@5880
   310
wenzelm@38331
   311
fun string_of_thms ctxt args =
wenzelm@51583
   312
  Pretty.string_of (Proof_Context.pretty_fact ctxt ("", Attrib.eval_thms ctxt args));
wenzelm@5895
   313
wenzelm@19385
   314
fun string_of_prfs full state arg =
wenzelm@32859
   315
  Pretty.string_of
wenzelm@32859
   316
    (case arg of
skalberg@15531
   317
      NONE =>
berghofe@12125
   318
        let
wenzelm@38331
   319
          val {context = ctxt, goal = thm} = Proof.simple_goal (Toplevel.proof_of state);
wenzelm@42360
   320
          val thy = Proof_Context.theory_of ctxt;
wenzelm@28814
   321
          val prf = Thm.proof_of thm;
wenzelm@17066
   322
          val prop = Thm.full_prop_of thm;
wenzelm@32859
   323
          val prf' = Proofterm.rewrite_proof_notypes ([], []) prf;
berghofe@12125
   324
        in
wenzelm@33388
   325
          Proof_Syntax.pretty_proof ctxt
wenzelm@17066
   326
            (if full then Reconstruct.reconstruct_proof thy prop prf' else prf')
berghofe@12125
   327
        end
wenzelm@38331
   328
    | SOME srcs =>
wenzelm@38331
   329
        let val ctxt = Toplevel.context_of state
wenzelm@38331
   330
        in map (Proof_Syntax.pretty_proof_of ctxt full) (Attrib.eval_thms ctxt srcs) end
wenzelm@38331
   331
        |> Pretty.chunks);
berghofe@11524
   332
wenzelm@38331
   333
fun string_of_prop ctxt s =
wenzelm@5831
   334
  let
wenzelm@24508
   335
    val prop = Syntax.read_prop ctxt s;
wenzelm@26704
   336
    val ctxt' = Variable.auto_fixes prop ctxt;
wenzelm@26704
   337
  in Pretty.string_of (Pretty.quote (Syntax.pretty_term ctxt' prop)) end;
wenzelm@5831
   338
wenzelm@38331
   339
fun string_of_term ctxt s =
wenzelm@5831
   340
  let
wenzelm@24508
   341
    val t = Syntax.read_term ctxt s;
wenzelm@5831
   342
    val T = Term.type_of t;
wenzelm@26704
   343
    val ctxt' = Variable.auto_fixes t ctxt;
wenzelm@5831
   344
  in
wenzelm@19385
   345
    Pretty.string_of
wenzelm@26704
   346
      (Pretty.block [Pretty.quote (Syntax.pretty_term ctxt' t), Pretty.fbrk,
wenzelm@26704
   347
        Pretty.str "::", Pretty.brk 1, Pretty.quote (Syntax.pretty_typ ctxt' T)])
wenzelm@9128
   348
  end;
wenzelm@5831
   349
wenzelm@48792
   350
fun string_of_type ctxt (s, NONE) =
wenzelm@48792
   351
      let val T = Syntax.read_typ ctxt s
wenzelm@48792
   352
      in Pretty.string_of (Pretty.quote (Syntax.pretty_typ ctxt T)) end
wenzelm@48792
   353
  | string_of_type ctxt (s1, SOME s2) =
wenzelm@48792
   354
      let
wenzelm@48792
   355
        val ctxt' = Config.put show_sorts true ctxt;
wenzelm@48792
   356
        val raw_T = Syntax.parse_typ ctxt' s1;
wenzelm@48792
   357
        val S = Syntax.read_sort ctxt' s2;
wenzelm@48792
   358
        val T =
wenzelm@48792
   359
          Syntax.check_term ctxt'
wenzelm@48792
   360
            (Logic.mk_type raw_T |> Type.constraint (Term.itselfT (Type_Infer.anyT S)))
wenzelm@48792
   361
          |> Logic.dest_type;
wenzelm@48792
   362
      in Pretty.string_of (Pretty.quote (Syntax.pretty_typ ctxt' T)) end;
wenzelm@9128
   363
wenzelm@23935
   364
fun print_item string_of (modes, arg) = Toplevel.keep (fn state =>
wenzelm@38331
   365
  Print_Mode.with_modes modes (fn () => writeln (string_of state arg)) ());
wenzelm@19385
   366
wenzelm@19385
   367
in
wenzelm@9128
   368
wenzelm@38331
   369
val print_stmts = print_item (string_of_stmts o Toplevel.context_of);
wenzelm@38331
   370
val print_thms = print_item (string_of_thms o Toplevel.context_of);
wenzelm@19385
   371
val print_prfs = print_item o string_of_prfs;
wenzelm@38331
   372
val print_prop = print_item (string_of_prop o Toplevel.context_of);
wenzelm@38331
   373
val print_term = print_item (string_of_term o Toplevel.context_of);
wenzelm@38331
   374
val print_type = print_item (string_of_type o Toplevel.context_of);
wenzelm@5831
   375
wenzelm@19385
   376
end;
wenzelm@19385
   377
wenzelm@5831
   378
end;