src/Pure/Isar/attrib.ML
author wenzelm
Tue Sep 02 14:10:45 2008 +0200 (2008-09-02)
changeset 28083 103d9282a946
parent 27865 27a8ad9612a3
child 28084 a05ca48ef263
permissions -rw-r--r--
explicit type Name.binding for higher-specification elements;
     1 (*  Title:      Pure/Isar/attrib.ML
     2     ID:         $Id$
     3     Author:     Markus Wenzel, TU Muenchen
     4 
     5 Symbolic representation of attributes -- with name and syntax.
     6 *)
     7 
     8 signature ATTRIB =
     9 sig
    10   type src = Args.src
    11   val print_attributes: theory -> unit
    12   val intern: theory -> xstring -> string
    13   val intern_src: theory -> src -> src
    14   val pretty_attribs: Proof.context -> src list -> Pretty.T list
    15   val defined: theory -> string -> bool
    16   val attribute: theory -> src -> attribute
    17   val attribute_i: theory -> src -> attribute
    18   val eval_thms: Proof.context -> (Facts.ref * src list) list -> thm list
    19   val map_specs: ('a -> 'att) ->
    20     (('c * 'a list) * 'd) list -> (('c * 'att list) * 'd) 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 crude_closure: Proof.context -> src -> src
    25   val add_attributes: (bstring * (src -> attribute) * string) list -> theory -> theory
    26   val syntax: (Context.generic * Args.T list ->
    27     attribute * (Context.generic * Args.T list)) -> src -> attribute
    28   val no_args: attribute -> src -> attribute
    29   val add_del_args: attribute -> attribute -> src -> attribute
    30   val thm_sel: Args.T list -> Facts.interval list * Args.T list
    31   val thm: Context.generic * Args.T list -> thm * (Context.generic * Args.T list)
    32   val thms: Context.generic * Args.T list -> thm list * (Context.generic * Args.T list)
    33   val multi_thm: Context.generic * Args.T list -> thm list * (Context.generic * Args.T list)
    34   val print_configs: Proof.context -> unit
    35   val internal: (morphism -> attribute) -> src
    36   val register_config: Config.value Config.T -> theory -> theory
    37   val config_bool: bstring -> bool -> bool Config.T * (theory -> theory)
    38   val config_int: bstring -> int -> int Config.T * (theory -> theory)
    39   val config_string: bstring -> string -> string Config.T * (theory -> theory)
    40   val config_bool_global: bstring -> bool -> bool Config.T * (theory -> theory)
    41   val config_int_global: bstring -> int -> int Config.T * (theory -> theory)
    42   val config_string_global: bstring -> string -> string Config.T * (theory -> theory)
    43 end;
    44 
    45 structure Attrib: ATTRIB =
    46 struct
    47 
    48 structure T = OuterLex;
    49 structure P = OuterParse;
    50 
    51 type src = Args.src;
    52 
    53 
    54 (** named attributes **)
    55 
    56 (* theory data *)
    57 
    58 structure Attributes = TheoryDataFun
    59 (
    60   type T = (((src -> attribute) * string) * stamp) NameSpace.table;
    61   val empty = NameSpace.empty_table;
    62   val copy = I;
    63   val extend = I;
    64   fun merge _ tables : T = NameSpace.merge_tables (eq_snd (op =)) tables handle Symtab.DUP dup =>
    65     error ("Attempt to merge different versions of attribute " ^ quote dup);
    66 );
    67 
    68 fun print_attributes thy =
    69   let
    70     val attribs = Attributes.get thy;
    71     fun prt_attr (name, ((_, comment), _)) = Pretty.block
    72       [Pretty.str (name ^ ":"), Pretty.brk 2, Pretty.str comment];
    73   in
    74     [Pretty.big_list "attributes:" (map prt_attr (NameSpace.extern_table attribs))]
    75     |> Pretty.chunks |> Pretty.writeln
    76   end;
    77 
    78 
    79 (* name space *)
    80 
    81 val intern = NameSpace.intern o #1 o Attributes.get;
    82 val intern_src = Args.map_name o intern;
    83 
    84 val extern = NameSpace.extern o #1 o Attributes.get o ProofContext.theory_of;
    85 
    86 
    87 (* pretty printing *)
    88 
    89 fun pretty_attribs _ [] = []
    90   | pretty_attribs ctxt srcs =
    91       [Pretty.enclose "[" "]"
    92         (Pretty.commas (map (Args.pretty_src ctxt o Args.map_name (extern ctxt)) srcs))];
    93 
    94 
    95 (* get attributes *)
    96 
    97 val defined = Symtab.defined o #2 o Attributes.get;
    98 
    99 fun attribute_i thy =
   100   let
   101     val attrs = #2 (Attributes.get thy);
   102     fun attr src =
   103       let val ((name, _), pos) = Args.dest_src src in
   104         (case Symtab.lookup attrs name of
   105           NONE => error ("Unknown attribute: " ^ quote name ^ Position.str_of pos)
   106         | SOME ((att, _), _) => (Position.report (Markup.attribute name) pos; att src))
   107       end;
   108   in attr end;
   109 
   110 fun attribute thy = attribute_i thy o intern_src thy;
   111 
   112 fun eval_thms ctxt args = ProofContext.note_thmss Thm.theoremK
   113     [((Name.no_binding, []),
   114       map (apsnd (map (attribute (ProofContext.theory_of ctxt)))) args)] ctxt
   115   |> fst |> maps snd;
   116 
   117 
   118 (* attributed declarations *)
   119 
   120 fun map_specs f = map (apfst (apsnd (map f)));
   121 fun map_facts f = map (apfst (apsnd (map f)) o apsnd (map (apsnd (map f))));
   122 
   123 
   124 (* crude_closure *)
   125 
   126 (*Produce closure without knowing facts in advance! The following
   127   works reasonably well for attribute parsers that do not peek at the
   128   thm structure.*)
   129 
   130 fun crude_closure ctxt src =
   131  (try (fn () => attribute_i (ProofContext.theory_of ctxt) src
   132     (Context.Proof ctxt, Drule.asm_rl)) ();
   133   Args.closure src);
   134 
   135 
   136 (* add_attributes *)
   137 
   138 fun add_attributes raw_attrs thy =
   139   let
   140     val new_attrs =
   141       raw_attrs |> map (fn (name, att, comment) => (name, ((att, comment), stamp ())));
   142     fun add attrs = NameSpace.extend_table (Sign.naming_of thy) new_attrs attrs
   143       handle Symtab.DUP dup => error ("Duplicate declaration of attributes " ^ quote dup);
   144   in Attributes.map add thy end;
   145 
   146 
   147 (* attribute syntax *)
   148 
   149 fun syntax scan src (st, th) =
   150   let val (f: attribute, st') = Args.syntax "attribute" scan src st
   151   in f (st', th) end;
   152 
   153 fun no_args x = syntax (Scan.succeed x);
   154 
   155 fun add_del_args add del = syntax
   156   (Scan.lift (Args.add >> K add || Args.del >> K del || Scan.succeed add));
   157 
   158 
   159 
   160 (** parsing attributed theorems **)
   161 
   162 val thm_sel = P.$$$ "(" |-- P.list1
   163  (P.nat --| P.minus -- P.nat >> Facts.FromTo ||
   164   P.nat --| P.minus >> Facts.From ||
   165   P.nat >> Facts.Single) --| P.$$$ ")";
   166 
   167 local
   168 
   169 val fact_name = Args.internal_fact >> K "<fact>" || Args.name;
   170 
   171 fun gen_thm pick = Scan.depend (fn context =>
   172   let
   173     val thy = Context.theory_of context;
   174     val get = Context.cases (PureThy.get_fact context) ProofContext.get_fact context;
   175     val get_fact = get o Facts.Fact;
   176     fun get_named pos name = get (Facts.Named ((name, pos), NONE));
   177   in
   178     P.$$$ "[" |-- Args.attribs (intern thy) --| P.$$$ "]" >> (fn srcs =>
   179       let
   180         val atts = map (attribute_i thy) srcs;
   181         val (context', th') = Library.apply atts (context, Drule.dummy_thm);
   182       in (context', pick "" [th']) end)
   183     ||
   184     (Scan.ahead Args.alt_name -- Args.named_fact get_fact
   185       >> (fn (s, fact) => ("", Facts.Fact s, fact)) ||
   186      Scan.ahead (P.position fact_name) :|-- (fn (name, pos) =>
   187       Args.named_fact (get_named pos) -- Scan.option thm_sel
   188         >> (fn (fact, sel) => (name, Facts.Named ((name, pos), sel), fact))))
   189     -- Args.opt_attribs (intern thy) >> (fn ((name, thmref, fact), srcs) =>
   190       let
   191         val ths = Facts.select thmref fact;
   192         val atts = map (attribute_i thy) srcs;
   193         val (context', ths') = foldl_map (Library.apply atts) (context, ths);
   194       in (context', pick name ths') end)
   195   end);
   196 
   197 in
   198 
   199 val thm = gen_thm Facts.the_single;
   200 val multi_thm = gen_thm (K I);
   201 val thms = Scan.repeat multi_thm >> flat;
   202 
   203 end;
   204 
   205 
   206 
   207 (** basic attributes **)
   208 
   209 (* internal *)
   210 
   211 fun internal att = Args.src (("Pure.attribute", [T.mk_attribute att]), Position.none);
   212 
   213 val internal_att =
   214   syntax (Scan.lift Args.internal_attribute >> Morphism.form);
   215 
   216 
   217 (* tags *)
   218 
   219 val tagged = syntax (Scan.lift (Args.name -- Args.name) >> Thm.tag);
   220 val untagged = syntax (Scan.lift Args.name >> Thm.untag);
   221 
   222 val kind = syntax (Scan.lift Args.name >> Thm.kind);
   223 
   224 
   225 (* rule composition *)
   226 
   227 val COMP_att =
   228   syntax (Scan.lift (Scan.optional (Args.bracks P.nat) 1) -- thm
   229     >> (fn (i, B) => Thm.rule_attribute (fn _ => fn A => Drule.compose_single (A, i, B))));
   230 
   231 val THEN_att =
   232   syntax (Scan.lift (Scan.optional (Args.bracks P.nat) 1) -- thm
   233     >> (fn (i, B) => Thm.rule_attribute (fn _ => fn A => A RSN (i, B))));
   234 
   235 val OF_att =
   236   syntax (thms >> (fn Bs => Thm.rule_attribute (fn _ => fn A => Bs MRS A)));
   237 
   238 
   239 (* rename_abs *)
   240 
   241 val rename_abs = syntax
   242   (Scan.lift (Scan.repeat (Args.maybe Args.name) >> (apsnd o Drule.rename_bvars')));
   243 
   244 
   245 (* unfold / fold definitions *)
   246 
   247 fun unfolded_syntax rule =
   248   syntax (thms >>
   249     (fn ths => Thm.rule_attribute (fn context => rule (Context.proof_of context) ths)));
   250 
   251 val unfolded = unfolded_syntax LocalDefs.unfold;
   252 val folded = unfolded_syntax LocalDefs.fold;
   253 
   254 
   255 (* rule cases *)
   256 
   257 val consumes = syntax (Scan.lift (Scan.optional P.nat 1) >> RuleCases.consumes);
   258 val case_names = syntax (Scan.lift (Scan.repeat1 Args.name) >> RuleCases.case_names);
   259 val case_conclusion =
   260   syntax (Scan.lift (Args.name -- Scan.repeat Args.name) >> RuleCases.case_conclusion);
   261 val params = syntax (Scan.lift (P.and_list1 (Scan.repeat Args.name)) >> RuleCases.params);
   262 
   263 
   264 (* rule format *)
   265 
   266 val rule_format = syntax (Args.mode "no_asm"
   267   >> (fn true => ObjectLogic.rule_format_no_asm | false => ObjectLogic.rule_format));
   268 
   269 val elim_format = no_args (Thm.rule_attribute (K Tactic.make_elim));
   270 
   271 
   272 (* misc rules *)
   273 
   274 val standard = no_args (Thm.rule_attribute (K Drule.standard));
   275 
   276 val no_vars = no_args (Thm.rule_attribute (fn context => fn th =>
   277   let
   278     val ctxt = Variable.set_body false (Context.proof_of context);
   279     val ((_, [th']), _) = Variable.import_thms true [th] ctxt;
   280   in th' end));
   281 
   282 val eta_long =
   283   no_args (Thm.rule_attribute (K (Conv.fconv_rule Drule.eta_long_conversion)));
   284 
   285 val rotated = syntax
   286   (Scan.lift (Scan.optional P.int 1) >> (fn n => Thm.rule_attribute (K (rotate_prems n))));
   287 
   288 
   289 (* theory setup *)
   290 
   291 val _ = Context.>> (Context.map_theory
   292  (add_attributes
   293    [("attribute", internal_att, "internal attribute"),
   294     ("tagged", tagged, "tagged theorem"),
   295     ("untagged", untagged, "untagged theorem"),
   296     ("kind", kind, "theorem kind"),
   297     ("COMP", COMP_att, "direct composition with rules (no lifting)"),
   298     ("THEN", THEN_att, "resolution with rule"),
   299     ("OF", OF_att, "rule applied to facts"),
   300     ("rename_abs", rename_abs, "rename bound variables in abstractions"),
   301     ("unfolded", unfolded, "unfolded definitions"),
   302     ("folded", folded, "folded definitions"),
   303     ("standard", standard, "result put into standard form"),
   304     ("elim_format", elim_format, "destruct rule turned into elimination rule format"),
   305     ("no_vars", no_vars, "frozen schematic vars"),
   306     ("eta_long", eta_long, "put theorem into eta long beta normal form"),
   307     ("consumes", consumes, "number of consumed facts"),
   308     ("case_names", case_names, "named rule cases"),
   309     ("case_conclusion", case_conclusion, "named conclusion of rule cases"),
   310     ("params", params, "named rule parameters"),
   311     ("atomize", no_args ObjectLogic.declare_atomize, "declaration of atomize rule"),
   312     ("rulify", no_args ObjectLogic.declare_rulify, "declaration of rulify rule"),
   313     ("rule_format", rule_format, "result put into standard rule format"),
   314     ("rotated", rotated, "rotated theorem premises"),
   315     ("defn", add_del_args LocalDefs.defn_add LocalDefs.defn_del,
   316       "declaration of definitional transformations")]));
   317 
   318 
   319 
   320 (** configuration options **)
   321 
   322 (* naming *)
   323 
   324 structure Configs = TheoryDataFun
   325 (
   326   type T = Config.value Config.T Symtab.table;
   327   val empty = Symtab.empty;
   328   val copy = I;
   329   val extend = I;
   330   fun merge _ = Symtab.merge (K true);
   331 );
   332 
   333 fun print_configs ctxt =
   334   let
   335     val thy = ProofContext.theory_of ctxt;
   336     fun prt (name, config) =
   337       let val value = Config.get ctxt config in
   338         Pretty.block [Pretty.str (name ^ ": " ^ Config.print_type value ^ " ="), Pretty.brk 1,
   339           Pretty.str (Config.print_value value)]
   340       end;
   341     val configs = NameSpace.extern_table (#1 (Attributes.get thy), Configs.get thy);
   342   in Pretty.writeln (Pretty.big_list "configuration options" (map prt configs)) end;
   343 
   344 
   345 (* concrete syntax *)
   346 
   347 local
   348 
   349 val equals = P.$$$ "=";
   350 
   351 fun scan_value (Config.Bool _) =
   352       equals -- Args.$$$ "false" >> K (Config.Bool false) ||
   353       equals -- Args.$$$ "true" >> K (Config.Bool true) ||
   354       Scan.succeed (Config.Bool true)
   355   | scan_value (Config.Int _) = equals |-- P.int >> Config.Int
   356   | scan_value (Config.String _) = equals |-- Args.name >> Config.String;
   357 
   358 fun scan_config thy config =
   359   let val config_type = Config.get_thy thy config
   360   in scan_value config_type >> (K o Thm.declaration_attribute o K o Config.put_generic config) end;
   361 
   362 in
   363 
   364 fun register_config config thy =
   365   let
   366     val bname = Config.name_of config;
   367     val name = Sign.full_name thy bname;
   368   in
   369     thy
   370     |> add_attributes [(bname, syntax (Scan.lift (scan_config thy config) >> Morphism.form),
   371       "configuration option")]
   372     |> Configs.map (Symtab.update (name, config))
   373   end;
   374 
   375 fun declare_config make coerce global name default =
   376   let
   377     val config_value = Config.declare global name (make default);
   378     val config = coerce config_value;
   379   in (config, register_config config_value) end;
   380 
   381 val config_bool   = declare_config Config.Bool Config.bool false;
   382 val config_int    = declare_config Config.Int Config.int false;
   383 val config_string = declare_config Config.String Config.string false;
   384 
   385 val config_bool_global   = declare_config Config.Bool Config.bool true;
   386 val config_int_global    = declare_config Config.Int Config.int true;
   387 val config_string_global = declare_config Config.String Config.string true;
   388 
   389 end;
   390 
   391 
   392 (* theory setup *)
   393 
   394 val _ = Context.>> (Context.map_theory
   395  (register_config Unify.trace_bound_value #>
   396   register_config Unify.search_bound_value #>
   397   register_config Unify.trace_simp_value #>
   398   register_config Unify.trace_types_value #>
   399   register_config MetaSimplifier.simp_depth_limit_value));
   400 
   401 end;