src/Pure/Isar/isar_cmd.ML
author wenzelm
Tue Mar 25 16:11:00 2014 +0100 (2014-03-25 ago)
changeset 56278 2576d3a40ed6
parent 56275 600f432ab556
child 56304 40274e4f5ebf
permissions -rw-r--r--
separate tokenization and language context for SML: no symbols, no antiquotes;
     1 (*  Title:      Pure/Isar/isar_cmd.ML
     2     Author:     Markus Wenzel, TU Muenchen
     3 
     4 Miscellaneous Isar commands.
     5 *)
     6 
     7 signature ISAR_CMD =
     8 sig
     9   val global_setup: Symbol_Pos.source -> theory -> theory
    10   val local_setup: Symbol_Pos.source -> Proof.context -> Proof.context
    11   val parse_ast_translation: Symbol_Pos.source -> theory -> theory
    12   val parse_translation: Symbol_Pos.source -> theory -> theory
    13   val print_translation: Symbol_Pos.source -> theory -> theory
    14   val typed_print_translation: Symbol_Pos.source -> theory -> theory
    15   val print_ast_translation: Symbol_Pos.source -> theory -> theory
    16   val translations: (xstring * string) Syntax.trrule list -> theory -> theory
    17   val no_translations: (xstring * string) Syntax.trrule list -> theory -> theory
    18   val oracle: bstring * Position.T -> Symbol_Pos.source -> theory -> theory
    19   val add_defs: (bool * bool) * ((binding * string) * Attrib.src list) list -> theory -> theory
    20   val declaration: {syntax: bool, pervasive: bool} ->
    21     Symbol_Pos.source -> local_theory -> local_theory
    22   val simproc_setup: string * Position.T -> string list -> Symbol_Pos.source ->
    23     string list -> local_theory -> local_theory
    24   val have: (Attrib.binding * (string * string list) list) list -> bool -> Proof.state -> Proof.state
    25   val hence: (Attrib.binding * (string * string list) list) list -> bool -> Proof.state -> Proof.state
    26   val show: (Attrib.binding * (string * string list) list) list -> bool -> Proof.state -> Proof.state
    27   val thus: (Attrib.binding * (string * string list) list) list -> bool -> Proof.state -> Proof.state
    28   val qed: Method.text_range option -> Toplevel.transition -> Toplevel.transition
    29   val terminal_proof: Method.text_range * Method.text_range option ->
    30     Toplevel.transition -> Toplevel.transition
    31   val default_proof: Toplevel.transition -> Toplevel.transition
    32   val immediate_proof: Toplevel.transition -> Toplevel.transition
    33   val done_proof: Toplevel.transition -> Toplevel.transition
    34   val skip_proof: Toplevel.transition -> Toplevel.transition
    35   val ml_diag: bool -> Symbol_Pos.source -> Toplevel.transition -> Toplevel.transition
    36   val diag_state: Proof.context -> Toplevel.state
    37   val diag_goal: Proof.context -> {context: Proof.context, facts: thm list, goal: thm}
    38   val print_theorems: bool -> Toplevel.transition -> Toplevel.transition
    39   val thy_deps: Toplevel.transition -> Toplevel.transition
    40   val locale_deps: Toplevel.transition -> Toplevel.transition
    41   val class_deps: Toplevel.transition -> Toplevel.transition
    42   val thm_deps: (Facts.ref * Attrib.src list) list -> Toplevel.transition -> Toplevel.transition
    43   val unused_thms: (string list * string list option) option ->
    44     Toplevel.transition -> Toplevel.transition
    45   val print_stmts: string list * (Facts.ref * Attrib.src list) list
    46     -> Toplevel.transition -> Toplevel.transition
    47   val print_thms: string list * (Facts.ref * Attrib.src list) list
    48     -> Toplevel.transition -> Toplevel.transition
    49   val print_prfs: bool -> string list * (Facts.ref * Attrib.src list) list option
    50     -> Toplevel.transition -> Toplevel.transition
    51   val print_prop: (string list * string) -> Toplevel.transition -> Toplevel.transition
    52   val print_term: (string list * string) -> Toplevel.transition -> Toplevel.transition
    53   val print_type: (string list * (string * string option)) ->
    54     Toplevel.transition -> Toplevel.transition
    55   val header_markup: Symbol_Pos.source -> Toplevel.transition -> Toplevel.transition
    56   val local_theory_markup: (xstring * Position.T) option * (Symbol_Pos.source) ->
    57     Toplevel.transition -> Toplevel.transition
    58   val proof_markup: Symbol_Pos.source -> Toplevel.transition -> Toplevel.transition
    59 end;
    60 
    61 structure Isar_Cmd: ISAR_CMD =
    62 struct
    63 
    64 
    65 (** theory declarations **)
    66 
    67 (* generic setup *)
    68 
    69 fun global_setup source =
    70   ML_Lex.read_source false source
    71   |> ML_Context.expression (#pos source) "val setup: theory -> theory" "Context.map_theory setup"
    72   |> Context.theory_map;
    73 
    74 fun local_setup source =
    75   ML_Lex.read_source false source
    76   |> ML_Context.expression (#pos source) "val setup: local_theory -> local_theory" "Context.map_proof setup"
    77   |> Context.proof_map;
    78 
    79 
    80 (* translation functions *)
    81 
    82 fun parse_ast_translation source =
    83   ML_Lex.read_source false source
    84   |> ML_Context.expression (#pos source)
    85     "val parse_ast_translation: (string * (Proof.context -> Ast.ast list -> Ast.ast)) list"
    86     "Context.map_theory (Sign.parse_ast_translation parse_ast_translation)"
    87   |> Context.theory_map;
    88 
    89 fun parse_translation source =
    90   ML_Lex.read_source false source
    91   |> ML_Context.expression (#pos source)
    92     "val parse_translation: (string * (Proof.context -> term list -> term)) list"
    93     "Context.map_theory (Sign.parse_translation parse_translation)"
    94   |> Context.theory_map;
    95 
    96 fun print_translation source =
    97   ML_Lex.read_source false source
    98   |> ML_Context.expression (#pos source)
    99     "val print_translation: (string * (Proof.context -> term list -> term)) list"
   100     "Context.map_theory (Sign.print_translation print_translation)"
   101   |> Context.theory_map;
   102 
   103 fun typed_print_translation source =
   104   ML_Lex.read_source false source
   105   |> ML_Context.expression (#pos source)
   106     "val typed_print_translation: (string * (Proof.context -> typ -> term list -> term)) list"
   107     "Context.map_theory (Sign.typed_print_translation typed_print_translation)"
   108   |> Context.theory_map;
   109 
   110 fun print_ast_translation source =
   111   ML_Lex.read_source false source
   112   |> ML_Context.expression (#pos source)
   113     "val print_ast_translation: (string * (Proof.context -> Ast.ast list -> Ast.ast)) list"
   114     "Context.map_theory (Sign.print_ast_translation print_ast_translation)"
   115   |> Context.theory_map;
   116 
   117 
   118 (* translation rules *)
   119 
   120 fun read_trrules thy raw_rules =
   121   let
   122     val ctxt = Proof_Context.init_global thy;
   123     val read_root =
   124       #1 o dest_Type o Proof_Context.read_type_name {proper = true, strict = false} ctxt;
   125   in
   126     raw_rules
   127     |> map (Syntax.map_trrule (fn (r, s) => Syntax_Phases.parse_ast_pattern ctxt (read_root r, s)))
   128   end;
   129 
   130 fun translations args thy = Sign.add_trrules (read_trrules thy args) thy;
   131 fun no_translations args thy = Sign.del_trrules (read_trrules thy args) thy;
   132 
   133 
   134 (* oracles *)
   135 
   136 fun oracle (name, pos) source =
   137   let
   138     val body = ML_Lex.read_source false source;
   139     val ants =
   140       ML_Lex.read Position.none
   141        ("local\n\
   142         \  val binding = " ^ ML_Syntax.make_binding (name, pos) ^ ";\n\
   143         \  val body = ") @ body @ ML_Lex.read Position.none (";\n\
   144         \in\n\
   145         \  val " ^ name ^
   146         " = snd (Context.>>> (Context.map_theory_result (Thm.add_oracle (binding, body))));\n\
   147         \end;\n");
   148     val flags = {SML = false, verbose = false};
   149   in Context.theory_map (ML_Context.exec (fn () => ML_Context.eval flags (#pos source) ants)) end;
   150 
   151 
   152 (* old-style defs *)
   153 
   154 fun add_defs ((unchecked, overloaded), args) thy =
   155   thy |>
   156     (if unchecked then Global_Theory.add_defs_unchecked_cmd else Global_Theory.add_defs_cmd)
   157       overloaded
   158       (map (fn ((b, ax), srcs) => ((b, ax), map (Attrib.attribute_cmd_global thy) srcs)) args)
   159   |> snd;
   160 
   161 
   162 (* declarations *)
   163 
   164 fun declaration {syntax, pervasive} source =
   165   ML_Lex.read_source false source
   166   |> ML_Context.expression (#pos source)
   167     "val declaration: Morphism.declaration"
   168     ("Context.map_proof (Local_Theory.declaration {syntax = " ^ Bool.toString syntax ^ ", \
   169       \pervasive = " ^ Bool.toString pervasive ^ "} declaration)")
   170   |> Context.proof_map;
   171 
   172 
   173 (* simprocs *)
   174 
   175 fun simproc_setup name lhss source identifier =
   176   ML_Lex.read_source false source
   177   |> ML_Context.expression (#pos source)
   178     "val proc: Morphism.morphism -> Proof.context -> cterm -> thm option"
   179     ("Context.map_proof (Simplifier.def_simproc_cmd {name = " ^ ML_Syntax.make_binding name ^ ", \
   180       \lhss = " ^ ML_Syntax.print_strings lhss ^ ", proc = proc, \
   181       \identifier = Library.maps ML_Context.thms " ^ ML_Syntax.print_strings identifier ^ "})")
   182   |> Context.proof_map;
   183 
   184 
   185 (* goals *)
   186 
   187 fun goal opt_chain goal stmt int =
   188   opt_chain #> goal NONE (K I) stmt int;
   189 
   190 val have = goal I Proof.have_cmd;
   191 val hence = goal Proof.chain Proof.have_cmd;
   192 val show = goal I Proof.show_cmd;
   193 val thus = goal Proof.chain Proof.show_cmd;
   194 
   195 
   196 (* local endings *)
   197 
   198 fun local_qed m = Toplevel.proof (Proof.local_qed (m, true));
   199 val local_terminal_proof = Toplevel.proof' o Proof.local_future_terminal_proof;
   200 val local_default_proof = Toplevel.proof Proof.local_default_proof;
   201 val local_immediate_proof = Toplevel.proof Proof.local_immediate_proof;
   202 val local_done_proof = Toplevel.proof Proof.local_done_proof;
   203 val local_skip_proof = Toplevel.proof' Proof.local_skip_proof;
   204 
   205 val skip_local_qed = Toplevel.skip_proof (fn i => if i > 1 then i - 1 else raise Toplevel.UNDEF);
   206 
   207 
   208 (* global endings *)
   209 
   210 fun global_qed m = Toplevel.end_proof (K (Proof.global_qed (m, true)));
   211 val global_terminal_proof = Toplevel.end_proof o Proof.global_future_terminal_proof;
   212 val global_default_proof = Toplevel.end_proof (K Proof.global_default_proof);
   213 val global_immediate_proof = Toplevel.end_proof (K Proof.global_immediate_proof);
   214 val global_skip_proof = Toplevel.end_proof Proof.global_skip_proof;
   215 val global_done_proof = Toplevel.end_proof (K Proof.global_done_proof);
   216 
   217 val skip_global_qed = Toplevel.skip_proof_to_theory (fn n => n = 1);
   218 
   219 
   220 (* common endings *)
   221 
   222 fun qed m = local_qed m o global_qed m o skip_local_qed o skip_global_qed;
   223 fun terminal_proof m = local_terminal_proof m o global_terminal_proof m;
   224 val default_proof = local_default_proof o global_default_proof;
   225 val immediate_proof = local_immediate_proof o global_immediate_proof;
   226 val done_proof = local_done_proof o global_done_proof;
   227 val skip_proof = local_skip_proof o global_skip_proof;
   228 
   229 
   230 (* diagnostic ML evaluation *)
   231 
   232 structure Diag_State = Proof_Data
   233 (
   234   type T = Toplevel.state;
   235   fun init _ = Toplevel.toplevel;
   236 );
   237 
   238 fun ml_diag verbose source = Toplevel.keep (fn state =>
   239   let val opt_ctxt =
   240     try Toplevel.generic_theory_of state
   241     |> Option.map (Context.proof_of #> Diag_State.put state)
   242   in ML_Context.eval_source_in opt_ctxt {SML = false, verbose = verbose} source end);
   243 
   244 val diag_state = Diag_State.get;
   245 
   246 fun diag_goal ctxt =
   247   Proof.goal (Toplevel.proof_of (diag_state ctxt))
   248     handle Toplevel.UNDEF => error "No goal present";
   249 
   250 val _ = Theory.setup
   251   (ML_Antiquotation.value (Binding.qualify true "Isar" @{binding state})
   252     (Scan.succeed "Isar_Cmd.diag_state ML_context") #>
   253    ML_Antiquotation.value (Binding.qualify true "Isar" @{binding goal})
   254     (Scan.succeed "Isar_Cmd.diag_goal ML_context"));
   255 
   256 
   257 (* print theorems *)
   258 
   259 fun print_theorems_proof verbose =
   260   Toplevel.keep (fn st =>
   261     Proof_Context.print_local_facts (Proof.context_of (Toplevel.proof_of st)) verbose);
   262 
   263 fun print_theorems_theory verbose = Toplevel.keep (fn state =>
   264   Toplevel.theory_of state |>
   265   (case Toplevel.previous_context_of state of
   266     SOME prev => Proof_Display.print_theorems_diff verbose (Proof_Context.theory_of prev)
   267   | NONE => Proof_Display.print_theorems verbose));
   268 
   269 fun print_theorems verbose =
   270   Toplevel.unknown_context o print_theorems_theory verbose o print_theorems_proof verbose;
   271 
   272 
   273 (* display dependencies *)
   274 
   275 val thy_deps = Toplevel.unknown_theory o Toplevel.keep (fn state =>
   276   let
   277     val thy = Toplevel.theory_of state;
   278     val thy_session = Present.session_name thy;
   279 
   280     val gr = rev (Theory.nodes_of thy) |> map (fn node =>
   281       let
   282         val name = Context.theory_name node;
   283         val parents = map Context.theory_name (Theory.parents_of node);
   284         val session = Present.session_name node;
   285         val unfold = (session = thy_session);
   286       in
   287        {name = name, ID = name, parents = parents, dir = session,
   288         unfold = unfold, path = "", content = []}
   289       end);
   290   in Graph_Display.display_graph gr end);
   291 
   292 val locale_deps = Toplevel.unknown_theory o Toplevel.keep (fn state =>
   293   let
   294     val thy = Toplevel.theory_of state;
   295     val gr = Locale.pretty_locale_deps thy |> map (fn {name, parents, body} =>
   296      {name = Locale.extern thy name, ID = name, parents = parents,
   297       dir = "", unfold = true, path = "", content = [body]});
   298   in Graph_Display.display_graph gr end);
   299 
   300 val class_deps = Toplevel.unknown_theory o Toplevel.keep (fn state =>
   301   let
   302     val ctxt = Toplevel.context_of state;
   303     val {classes = (space, algebra), ...} = Type.rep_tsig (Proof_Context.tsig_of ctxt);
   304     val classes = Sorts.classes_of algebra;
   305     fun entry (c, (i, (_, cs))) =
   306       (i, {name = Name_Space.extern ctxt space c, ID = c, parents = Graph.Keys.dest cs,
   307             dir = "", unfold = true, path = "", content = []});
   308     val gr =
   309       Graph.fold (cons o entry) classes []
   310       |> sort (int_ord o pairself #1) |> map #2;
   311   in Graph_Display.display_graph gr end);
   312 
   313 fun thm_deps args = Toplevel.unknown_theory o Toplevel.keep (fn state =>
   314   Thm_Deps.thm_deps (Toplevel.theory_of state)
   315     (Attrib.eval_thms (Toplevel.context_of state) args));
   316 
   317 
   318 (* find unused theorems *)
   319 
   320 fun unused_thms opt_range = Toplevel.keep (fn state =>
   321   let
   322     val thy = Toplevel.theory_of state;
   323     val ctxt = Toplevel.context_of state;
   324     fun pretty_thm (a, th) = Proof_Context.pretty_fact ctxt (a, [th]);
   325     val get_theory = Context.get_theory thy;
   326   in
   327     Thm_Deps.unused_thms
   328       (case opt_range of
   329         NONE => (Theory.parents_of thy, [thy])
   330       | SOME (xs, NONE) => (map get_theory xs, [thy])
   331       | SOME (xs, SOME ys) => (map get_theory xs, map get_theory ys))
   332     |> map pretty_thm |> Pretty.chunks |> Pretty.writeln
   333   end);
   334 
   335 
   336 (* print theorems, terms, types etc. *)
   337 
   338 local
   339 
   340 fun string_of_stmts ctxt args =
   341   Attrib.eval_thms ctxt args
   342   |> map (Element.pretty_statement ctxt Thm.theoremK)
   343   |> Pretty.chunks2 |> Pretty.string_of;
   344 
   345 fun string_of_thms ctxt args =
   346   Pretty.string_of (Proof_Context.pretty_fact ctxt ("", Attrib.eval_thms ctxt args));
   347 
   348 fun string_of_prfs full state arg =
   349   Pretty.string_of
   350     (case arg of
   351       NONE =>
   352         let
   353           val {context = ctxt, goal = thm} = Proof.simple_goal (Toplevel.proof_of state);
   354           val thy = Proof_Context.theory_of ctxt;
   355           val prf = Thm.proof_of thm;
   356           val prop = Thm.full_prop_of thm;
   357           val prf' = Proofterm.rewrite_proof_notypes ([], []) prf;
   358         in
   359           Proof_Syntax.pretty_proof ctxt
   360             (if full then Reconstruct.reconstruct_proof thy prop prf' else prf')
   361         end
   362     | SOME srcs =>
   363         let val ctxt = Toplevel.context_of state
   364         in map (Proof_Syntax.pretty_proof_of ctxt full) (Attrib.eval_thms ctxt srcs) end
   365         |> Pretty.chunks);
   366 
   367 fun string_of_prop ctxt s =
   368   let
   369     val prop = Syntax.read_prop ctxt s;
   370     val ctxt' = Variable.auto_fixes prop ctxt;
   371   in Pretty.string_of (Pretty.quote (Syntax.pretty_term ctxt' prop)) end;
   372 
   373 fun string_of_term ctxt s =
   374   let
   375     val t = Syntax.read_term ctxt s;
   376     val T = Term.type_of t;
   377     val ctxt' = Variable.auto_fixes t ctxt;
   378   in
   379     Pretty.string_of
   380       (Pretty.block [Pretty.quote (Syntax.pretty_term ctxt' t), Pretty.fbrk,
   381         Pretty.str "::", Pretty.brk 1, Pretty.quote (Syntax.pretty_typ ctxt' T)])
   382   end;
   383 
   384 fun string_of_type ctxt (s, NONE) =
   385       let val T = Syntax.read_typ ctxt s
   386       in Pretty.string_of (Pretty.quote (Syntax.pretty_typ ctxt T)) end
   387   | string_of_type ctxt (s1, SOME s2) =
   388       let
   389         val ctxt' = Config.put show_sorts true ctxt;
   390         val raw_T = Syntax.parse_typ ctxt' s1;
   391         val S = Syntax.read_sort ctxt' s2;
   392         val T =
   393           Syntax.check_term ctxt'
   394             (Logic.mk_type raw_T |> Type.constraint (Term.itselfT (Type_Infer.anyT S)))
   395           |> Logic.dest_type;
   396       in Pretty.string_of (Pretty.quote (Syntax.pretty_typ ctxt' T)) end;
   397 
   398 fun print_item string_of (modes, arg) = Toplevel.keep (fn state =>
   399   Print_Mode.with_modes modes (fn () => writeln (string_of state arg)) ());
   400 
   401 in
   402 
   403 val print_stmts = print_item (string_of_stmts o Toplevel.context_of);
   404 val print_thms = print_item (string_of_thms o Toplevel.context_of);
   405 val print_prfs = print_item o string_of_prfs;
   406 val print_prop = print_item (string_of_prop o Toplevel.context_of);
   407 val print_term = print_item (string_of_term o Toplevel.context_of);
   408 val print_type = print_item (string_of_type o Toplevel.context_of);
   409 
   410 end;
   411 
   412 
   413 (* markup commands *)
   414 
   415 fun header_markup txt = Toplevel.keep (fn state =>
   416   if Toplevel.is_toplevel state then Thy_Output.check_text txt state
   417   else raise Toplevel.UNDEF);
   418 
   419 fun local_theory_markup (loc, txt) = Toplevel.present_local_theory loc (Thy_Output.check_text txt);
   420 val proof_markup = Toplevel.present_proof o Thy_Output.check_text;
   421 
   422 end;