src/Pure/Isar/attrib.ML
author wenzelm
Sat Apr 16 15:47:52 2011 +0200 (2011-04-16)
changeset 42360 da8817d01e7c
parent 42358 b47d41d9f4b5
child 42375 774df7c59508
permissions -rw-r--r--
modernized structure Proof_Context;
     1 (*  Title:      Pure/Isar/attrib.ML
     2     Author:     Markus Wenzel, TU Muenchen
     3 
     4 Symbolic representation of attributes -- with name and syntax.
     5 *)
     6 
     7 signature ATTRIB =
     8 sig
     9   type src = Args.src
    10   type binding = binding * src list
    11   val empty_binding: binding
    12   val print_attributes: theory -> unit
    13   val intern: theory -> xstring -> string
    14   val intern_src: theory -> src -> src
    15   val pretty_attribs: Proof.context -> src list -> Pretty.T list
    16   val defined: theory -> string -> bool
    17   val attribute: theory -> src -> attribute
    18   val attribute_i: theory -> src -> attribute
    19   val map_specs: ('a -> 'att) ->
    20     (('c * 'a list) * 'b) list -> (('c * 'att list) * 'b) list
    21   val map_facts: ('a -> 'att) ->
    22     (('c * 'a list) * ('d * 'a list) list) list ->
    23     (('c * 'att list) * ('d * 'att list) list) list
    24   val map_facts_refs: ('a -> 'att) -> ('b -> 'fact) ->
    25     (('c * 'a list) * ('b * 'a list) list) list ->
    26     (('c * 'att list) * ('fact * 'att list) list) list
    27   val eval_thms: Proof.context -> (Facts.ref * src list) list -> thm list
    28   val crude_closure: Proof.context -> src -> src
    29   val setup: Binding.binding -> attribute context_parser -> string -> theory -> theory
    30   val attribute_setup: bstring * Position.T -> Symbol_Pos.text * Position.T -> string ->
    31     theory -> theory
    32   val add_del: attribute -> attribute -> attribute context_parser
    33   val thm_sel: Facts.interval list parser
    34   val thm: thm context_parser
    35   val thms: thm list context_parser
    36   val multi_thm: thm list context_parser
    37   val print_configs: Proof.context -> unit
    38   val internal: (morphism -> attribute) -> src
    39   val config_bool: bstring -> (Context.generic -> bool) -> bool Config.T * (theory -> theory)
    40   val config_int: bstring -> (Context.generic -> int) -> int Config.T * (theory -> theory)
    41   val config_real: bstring -> (Context.generic -> real) -> real Config.T * (theory -> theory)
    42   val config_string: bstring -> (Context.generic -> string) -> string Config.T * (theory -> theory)
    43   val config_bool_global: bstring -> (Context.generic -> bool) -> bool Config.T * (theory -> theory)
    44   val config_int_global: bstring -> (Context.generic -> int) -> int Config.T * (theory -> theory)
    45   val config_real_global: bstring -> (Context.generic -> real) -> real Config.T * (theory -> theory)
    46   val config_string_global:
    47     bstring -> (Context.generic -> string) -> string Config.T * (theory -> theory)
    48 end;
    49 
    50 structure Attrib: ATTRIB =
    51 struct
    52 
    53 (* source and bindings *)
    54 
    55 type src = Args.src;
    56 
    57 type binding = binding * src list;
    58 val empty_binding: binding = (Binding.empty, []);
    59 
    60 
    61 
    62 (** named attributes **)
    63 
    64 (* theory data *)
    65 
    66 structure Attributes = Theory_Data
    67 (
    68   type T = ((src -> attribute) * string) Name_Space.table;
    69   val empty : T = Name_Space.empty_table "attribute";
    70   val extend = I;
    71   fun merge data : T = Name_Space.merge_tables data;
    72 );
    73 
    74 fun print_attributes thy =
    75   let
    76     val ctxt = Proof_Context.init_global thy;
    77     val attribs = Attributes.get thy;
    78     fun prt_attr (name, (_, comment)) = Pretty.block
    79       [Pretty.str (name ^ ":"), Pretty.brk 2, Pretty.str comment];
    80   in
    81     [Pretty.big_list "attributes:" (map prt_attr (Name_Space.extern_table ctxt attribs))]
    82     |> Pretty.chunks |> Pretty.writeln
    83   end;
    84 
    85 fun add_attribute name att comment thy = thy
    86   |> Attributes.map (#2 o Name_Space.define true (Sign.naming_of thy) (name, (att, comment)));
    87 
    88 
    89 (* name space *)
    90 
    91 val intern = Name_Space.intern o #1 o Attributes.get;
    92 val intern_src = Args.map_name o intern;
    93 
    94 fun extern ctxt = Name_Space.extern ctxt (#1 (Attributes.get (Proof_Context.theory_of ctxt)));
    95 
    96 
    97 (* pretty printing *)
    98 
    99 fun pretty_attribs _ [] = []
   100   | pretty_attribs ctxt srcs =
   101       [Pretty.enum "," "[" "]" (map (Args.pretty_src ctxt o Args.map_name (extern ctxt)) srcs)];
   102 
   103 
   104 (* get attributes *)
   105 
   106 val defined = Symtab.defined o #2 o Attributes.get;
   107 
   108 fun attribute_i thy =
   109   let
   110     val attrs = #2 (Attributes.get thy);
   111     fun attr src =
   112       let val ((name, _), pos) = Args.dest_src src in
   113         (case Symtab.lookup attrs name of
   114           NONE => error ("Unknown attribute: " ^ quote name ^ Position.str_of pos)
   115         | SOME (att, _) => (Position.report pos (Markup.attribute name); att src))
   116       end;
   117   in attr end;
   118 
   119 fun attribute thy = attribute_i thy o intern_src thy;
   120 
   121 
   122 (* attributed declarations *)
   123 
   124 fun map_specs f = map (apfst (apsnd (map f)));
   125 
   126 fun map_facts f = map (apfst (apsnd (map f)) o apsnd (map (apsnd (map f))));
   127 fun map_facts_refs f g = map_facts f #> map (apsnd (map (apfst g)));
   128 
   129 
   130 (* fact expressions *)
   131 
   132 fun eval_thms ctxt srcs = ctxt
   133   |> Proof_Context.note_thmss ""
   134     (map_facts_refs (attribute (Proof_Context.theory_of ctxt)) (Proof_Context.get_fact ctxt)
   135       [((Binding.empty, []), srcs)])
   136   |> fst |> maps snd;
   137 
   138 
   139 (* crude_closure *)
   140 
   141 (*Produce closure without knowing facts in advance! The following
   142   works reasonably well for attribute parsers that do not peek at the
   143   thm structure.*)
   144 
   145 fun crude_closure ctxt src =
   146  (try (fn () => attribute_i (Proof_Context.theory_of ctxt) src
   147     (Context.Proof ctxt, Drule.asm_rl)) ();
   148   Args.closure src);
   149 
   150 
   151 (* attribute setup *)
   152 
   153 fun syntax scan = Args.syntax "attribute" scan;
   154 
   155 fun setup name scan =
   156   add_attribute name
   157     (fn src => fn (ctxt, th) => let val (a, ctxt') = syntax scan src ctxt in a (ctxt', th) end);
   158 
   159 fun attribute_setup name (txt, pos) cmt =
   160   Context.theory_map (ML_Context.expression pos
   161     "val (name, scan, comment): binding * attribute context_parser * string"
   162     "Context.map_theory (Attrib.setup name scan comment)"
   163     (ML_Lex.read Position.none ("(" ^ ML_Syntax.make_binding name ^ ", ") @
   164       ML_Lex.read pos txt @
   165       ML_Lex.read Position.none (", " ^ ML_Syntax.print_string cmt ^ ")")));
   166 
   167 
   168 (* add/del syntax *)
   169 
   170 fun add_del add del = Scan.lift (Args.add >> K add || Args.del >> K del || Scan.succeed add);
   171 
   172 
   173 
   174 (** parsing attributed theorems **)
   175 
   176 val thm_sel = Parse.$$$ "(" |-- Parse.list1
   177  (Parse.nat --| Parse.minus -- Parse.nat >> Facts.FromTo ||
   178   Parse.nat --| Parse.minus >> Facts.From ||
   179   Parse.nat >> Facts.Single) --| Parse.$$$ ")";
   180 
   181 local
   182 
   183 val fact_name = Args.internal_fact >> K "<fact>" || Args.name;
   184 
   185 fun gen_thm pick = Scan.depend (fn context =>
   186   let
   187     val thy = Context.theory_of context;
   188     val get = Context.cases (Global_Theory.get_fact context) Proof_Context.get_fact context;
   189     val get_fact = get o Facts.Fact;
   190     fun get_named pos name = get (Facts.Named ((name, pos), NONE));
   191   in
   192     Parse.$$$ "[" |-- Args.attribs (intern thy) --| Parse.$$$ "]" >> (fn srcs =>
   193       let
   194         val atts = map (attribute_i thy) srcs;
   195         val (context', th') = Library.apply atts (context, Drule.dummy_thm);
   196       in (context', pick "" [th']) end)
   197     ||
   198     (Scan.ahead Args.alt_name -- Args.named_fact get_fact
   199       >> (fn (s, fact) => ("", Facts.Fact s, fact)) ||
   200      Scan.ahead (Parse.position fact_name) :|-- (fn (name, pos) =>
   201       Args.named_fact (get_named pos) -- Scan.option thm_sel
   202         >> (fn (fact, sel) => (name, Facts.Named ((name, pos), sel), fact))))
   203     -- Args.opt_attribs (intern thy) >> (fn ((name, thmref, fact), srcs) =>
   204       let
   205         val ths = Facts.select thmref fact;
   206         val atts = map (attribute_i thy) srcs;
   207         val (context', ths') = Library.foldl_map (Library.apply atts) (context, ths);
   208       in (context', pick name ths') end)
   209   end);
   210 
   211 in
   212 
   213 val thm = gen_thm Facts.the_single;
   214 val multi_thm = gen_thm (K I);
   215 val thms = Scan.repeat multi_thm >> flat;
   216 
   217 end;
   218 
   219 
   220 
   221 (** basic attributes **)
   222 
   223 (* internal *)
   224 
   225 fun internal att = Args.src (("Pure.attribute", [Token.mk_attribute att]), Position.none);
   226 
   227 
   228 (* rule composition *)
   229 
   230 val COMP_att =
   231   Scan.lift (Scan.optional (Args.bracks Parse.nat) 1) -- thm
   232     >> (fn (i, B) => Thm.rule_attribute (fn _ => fn A => Drule.compose_single (A, i, B)));
   233 
   234 val THEN_att =
   235   Scan.lift (Scan.optional (Args.bracks Parse.nat) 1) -- thm
   236     >> (fn (i, B) => Thm.rule_attribute (fn _ => fn A => A RSN (i, B)));
   237 
   238 val OF_att =
   239   thms >> (fn Bs => Thm.rule_attribute (fn _ => fn A => Bs MRS A));
   240 
   241 
   242 (* rename_abs *)
   243 
   244 fun rename_abs x = (Scan.repeat (Args.maybe Args.name) >> (apsnd o Drule.rename_bvars')) x;
   245 
   246 
   247 (* unfold / fold definitions *)
   248 
   249 fun unfolded_syntax rule =
   250   thms >> (fn ths => Thm.rule_attribute (fn context => rule (Context.proof_of context) ths));
   251 
   252 val unfolded = unfolded_syntax Local_Defs.unfold;
   253 val folded = unfolded_syntax Local_Defs.fold;
   254 
   255 
   256 (* rule format *)
   257 
   258 val rule_format = Args.mode "no_asm"
   259   >> (fn true => Object_Logic.rule_format_no_asm | false => Object_Logic.rule_format);
   260 
   261 val elim_format = Thm.rule_attribute (K Tactic.make_elim);
   262 
   263 
   264 (* misc rules *)
   265 
   266 val no_vars = Thm.rule_attribute (fn context => fn th =>
   267   let
   268     val ctxt = Variable.set_body false (Context.proof_of context);
   269     val ((_, [th']), _) = Variable.import true [th] ctxt;
   270   in th' end);
   271 
   272 val eta_long =
   273   Thm.rule_attribute (K (Conv.fconv_rule Drule.eta_long_conversion));
   274 
   275 val rotated = Scan.optional Parse.int 1 >> (fn n => Thm.rule_attribute (K (rotate_prems n)));
   276 
   277 
   278 (* theory setup *)
   279 
   280 val _ = Context.>> (Context.map_theory
   281  (setup (Binding.name "attribute") (Scan.lift Args.internal_attribute >> Morphism.form)
   282     "internal attribute" #>
   283   setup (Binding.name "tagged") (Scan.lift (Args.name -- Args.name) >> Thm.tag) "tagged theorem" #>
   284   setup (Binding.name "untagged") (Scan.lift Args.name >> Thm.untag) "untagged theorem" #>
   285   setup (Binding.name "kind") (Scan.lift Args.name >> Thm.kind) "theorem kind" #>
   286   setup (Binding.name "COMP") COMP_att "direct composition with rules (no lifting)" #>
   287   setup (Binding.name "THEN") THEN_att "resolution with rule" #>
   288   setup (Binding.name "OF") OF_att "rule applied to facts" #>
   289   setup (Binding.name "rename_abs") (Scan.lift rename_abs)
   290     "rename bound variables in abstractions" #>
   291   setup (Binding.name "unfolded") unfolded "unfolded definitions" #>
   292   setup (Binding.name "folded") folded "folded definitions" #>
   293   setup (Binding.name "consumes") (Scan.lift (Scan.optional Parse.nat 1) >> Rule_Cases.consumes)
   294     "number of consumed facts" #>
   295   setup (Binding.name "constraints") (Scan.lift Parse.nat >> Rule_Cases.constraints)
   296     "number of equality constraints" #>
   297   setup (Binding.name "case_names") (Scan.lift (Scan.repeat1 Args.name) >> Rule_Cases.case_names)
   298     "named rule cases" #>
   299   setup (Binding.name "case_conclusion")
   300     (Scan.lift (Args.name -- Scan.repeat Args.name) >> Rule_Cases.case_conclusion)
   301     "named conclusion of rule cases" #>
   302   setup (Binding.name "params")
   303     (Scan.lift (Parse.and_list1 (Scan.repeat Args.name)) >> Rule_Cases.params)
   304     "named rule parameters" #>
   305   setup (Binding.name "standard") (Scan.succeed (Thm.rule_attribute (K Drule.export_without_context)))
   306     "result put into standard form (legacy)" #>
   307   setup (Binding.name "rule_format") rule_format "result put into canonical rule format" #>
   308   setup (Binding.name "elim_format") (Scan.succeed elim_format)
   309     "destruct rule turned into elimination rule format" #>
   310   setup (Binding.name "no_vars") (Scan.succeed no_vars) "frozen schematic vars" #>
   311   setup (Binding.name "eta_long") (Scan.succeed eta_long)
   312     "put theorem into eta long beta normal form" #>
   313   setup (Binding.name "atomize") (Scan.succeed Object_Logic.declare_atomize)
   314     "declaration of atomize rule" #>
   315   setup (Binding.name "rulify") (Scan.succeed Object_Logic.declare_rulify)
   316     "declaration of rulify rule" #>
   317   setup (Binding.name "rotated") (Scan.lift rotated) "rotated theorem premises" #>
   318   setup (Binding.name "defn") (add_del Local_Defs.defn_add Local_Defs.defn_del)
   319     "declaration of definitional transformations" #>
   320   setup (Binding.name "abs_def") (Scan.succeed (Thm.rule_attribute (K Drule.abs_def)))
   321     "abstract over free variables of a definition"));
   322 
   323 
   324 
   325 (** configuration options **)
   326 
   327 (* naming *)
   328 
   329 structure Configs = Theory_Data
   330 (
   331   type T = Config.raw Symtab.table;
   332   val empty = Symtab.empty;
   333   val extend = I;
   334   fun merge data = Symtab.merge (K true) data;
   335 );
   336 
   337 fun print_configs ctxt =
   338   let
   339     val thy = Proof_Context.theory_of ctxt;
   340     fun prt (name, config) =
   341       let val value = Config.get ctxt config in
   342         Pretty.block [Pretty.str (name ^ ": " ^ Config.print_type value ^ " ="), Pretty.brk 1,
   343           Pretty.str (Config.print_value value)]
   344       end;
   345     val configs = Name_Space.extern_table ctxt (#1 (Attributes.get thy), Configs.get thy);
   346   in Pretty.writeln (Pretty.big_list "configuration options" (map prt configs)) end;
   347 
   348 
   349 (* concrete syntax *)
   350 
   351 local
   352 
   353 val equals = Parse.$$$ "=";
   354 
   355 fun scan_value (Config.Bool _) =
   356       equals -- Args.$$$ "false" >> K (Config.Bool false) ||
   357       equals -- Args.$$$ "true" >> K (Config.Bool true) ||
   358       Scan.succeed (Config.Bool true)
   359   | scan_value (Config.Int _) = equals |-- Parse.int >> Config.Int
   360   | scan_value (Config.Real _) = equals |-- Parse.real >> Config.Real
   361   | scan_value (Config.String _) = equals |-- Args.name >> Config.String;
   362 
   363 fun scan_config thy config =
   364   let val config_type = Config.get_global thy config
   365   in scan_value config_type >> (K o Thm.declaration_attribute o K o Config.put_generic config) end;
   366 
   367 in
   368 
   369 fun register_config config thy =
   370   let
   371     val bname = Config.name_of config;
   372     val name = Sign.full_bname thy bname;
   373   in
   374     thy
   375     |> setup (Binding.name bname) (Scan.lift (scan_config thy config) >> Morphism.form)
   376       "configuration option"
   377     |> Configs.map (Symtab.update (name, config))
   378   end;
   379 
   380 fun declare_config make coerce global name default =
   381   let
   382     val config_value = Config.declare_generic {global = global} name (make o default);
   383     val config = coerce config_value;
   384   in (config, register_config config_value) end;
   385 
   386 val config_bool = declare_config Config.Bool Config.bool false;
   387 val config_int = declare_config Config.Int Config.int false;
   388 val config_real = declare_config Config.Real Config.real false;
   389 val config_string = declare_config Config.String Config.string false;
   390 
   391 val config_bool_global = declare_config Config.Bool Config.bool true;
   392 val config_int_global = declare_config Config.Int Config.int true;
   393 val config_real_global = declare_config Config.Real Config.real true;
   394 val config_string_global = declare_config Config.String Config.string true;
   395 
   396 end;
   397 
   398 
   399 (* theory setup *)
   400 
   401 val _ = Context.>> (Context.map_theory
   402  (register_config Ast.trace_raw #>
   403   register_config Ast.stat_raw #>
   404   register_config Syntax.positions_raw #>
   405   register_config Printer.show_brackets_raw #>
   406   register_config Printer.show_sorts_raw #>
   407   register_config Printer.show_types_raw #>
   408   register_config Printer.show_structs_raw #>
   409   register_config Printer.show_question_marks_raw #>
   410   register_config Syntax.ambiguity_level_raw #>
   411   register_config Syntax_Trans.eta_contract_raw #>
   412   register_config Name_Space.long_names_raw #>
   413   register_config Name_Space.short_names_raw #>
   414   register_config Name_Space.unique_names_raw #>
   415   register_config ML_Context.trace_raw #>
   416   register_config Proof_Context.show_abbrevs_raw #>
   417   register_config Goal_Display.goals_limit_raw #>
   418   register_config Goal_Display.show_main_goal_raw #>
   419   register_config Goal_Display.show_consts_raw #>
   420   register_config Display.show_hyps_raw #>
   421   register_config Display.show_tags_raw #>
   422   register_config Unify.trace_bound_raw #>
   423   register_config Unify.search_bound_raw #>
   424   register_config Unify.trace_simp_raw #>
   425   register_config Unify.trace_types_raw #>
   426   register_config Raw_Simplifier.simp_depth_limit_raw #>
   427   register_config Raw_Simplifier.simp_trace_depth_limit_raw #>
   428   register_config Raw_Simplifier.simp_debug_raw #>
   429   register_config Raw_Simplifier.simp_trace_raw));
   430 
   431 end;