1 (* Title: Pure/Isar/attrib.ML
3 Author: Markus Wenzel, TU Muenchen
5 Symbolic representation of attributes -- with name and syntax.
8 signature BASIC_ATTRIB =
10 val print_attributes: theory -> unit
17 val intern: theory -> xstring -> string
18 val intern_src: theory -> src -> src
19 val pretty_attribs: Proof.context -> src list -> Pretty.T list
20 val attribute: theory -> src -> attribute
21 val attribute_i: theory -> src -> attribute
22 val eval_thms: Proof.context -> (Facts.ref * src list) list -> thm list
23 val map_specs: ('a -> 'att) ->
24 (('c * 'a list) * 'd) list -> (('c * 'att list) * 'd) list
25 val map_facts: ('a -> 'att) ->
26 (('c * 'a list) * ('d * 'a list) list) list ->
27 (('c * 'att list) * ('d * 'att list) list) list
28 val crude_closure: Proof.context -> src -> src
29 val add_attributes: (bstring * (src -> attribute) * string) list -> theory -> theory
30 val syntax: (Context.generic * Args.T list ->
31 attribute * (Context.generic * Args.T list)) -> src -> attribute
32 val no_args: attribute -> src -> attribute
33 val add_del_args: attribute -> attribute -> src -> attribute
34 val thm: Context.generic * Args.T list -> thm * (Context.generic * Args.T list)
35 val thms: Context.generic * Args.T list -> thm list * (Context.generic * Args.T list)
36 val multi_thm: Context.generic * Args.T list -> thm list * (Context.generic * Args.T list)
37 val print_configs: Proof.context -> unit
38 val internal: (morphism -> attribute) -> src
39 val register_config: Config.value Config.T -> theory -> theory
40 val config_bool: bstring -> bool -> bool Config.T * (theory -> theory)
41 val config_int: bstring -> int -> int Config.T * (theory -> theory)
42 val config_string: bstring -> string -> string Config.T * (theory -> theory)
43 val config_bool_global: bstring -> bool -> bool Config.T * (theory -> theory)
44 val config_int_global: bstring -> int -> int Config.T * (theory -> theory)
45 val config_string_global: bstring -> string -> string Config.T * (theory -> theory)
48 structure Attrib: ATTRIB =
53 (** named attributes **)
57 structure Attributes = TheoryDataFun
59 type T = (((src -> attribute) * string) * stamp) NameSpace.table;
60 val empty = NameSpace.empty_table;
63 fun merge _ tables : T = NameSpace.merge_tables (eq_snd (op =)) tables handle Symtab.DUP dup =>
64 error ("Attempt to merge different versions of attribute " ^ quote dup);
67 fun print_attributes thy =
69 val attribs = Attributes.get thy;
70 fun prt_attr (name, ((_, comment), _)) = Pretty.block
71 [Pretty.str (name ^ ":"), Pretty.brk 2, Pretty.str comment];
73 [Pretty.big_list "attributes:" (map prt_attr (NameSpace.extern_table attribs))]
74 |> Pretty.chunks |> Pretty.writeln
80 val intern = NameSpace.intern o #1 o Attributes.get;
81 val intern_src = Args.map_name o intern;
83 val extern = NameSpace.extern o #1 o Attributes.get o ProofContext.theory_of;
88 fun pretty_attribs _ [] = []
89 | pretty_attribs ctxt srcs =
90 [Pretty.enclose "[" "]"
91 (Pretty.commas (map (Args.pretty_src ctxt o Args.map_name (extern ctxt)) srcs))];
98 val attrs = #2 (Attributes.get thy);
100 let val ((name, _), pos) = Args.dest_src src in
101 (case Symtab.lookup attrs name of
102 NONE => error ("Unknown attribute: " ^ quote name ^ Position.str_of pos)
103 | SOME ((att, _), _) => att src)
107 fun attribute thy = attribute_i thy o intern_src thy;
109 fun eval_thms ctxt args = ProofContext.note_thmss Thm.theoremK
110 [(("", []), map (apsnd (map (attribute (ProofContext.theory_of ctxt)))) args)] ctxt
111 |> (flat o map snd o fst);
114 (* attributed declarations *)
116 fun map_specs f = map (apfst (apsnd (map f)));
117 fun map_facts f = map (apfst (apsnd (map f)) o apsnd (map (apsnd (map f))));
122 (*Produce closure without knowing facts in advance! The following
123 works reasonably well for attribute parsers that do not peek at the
126 fun crude_closure ctxt src =
127 (try (fn () => attribute_i (ProofContext.theory_of ctxt) src
128 (Context.Proof ctxt, Drule.asm_rl)) ();
134 fun add_attributes raw_attrs thy =
137 raw_attrs |> map (fn (name, att, comment) => (name, ((att, comment), stamp ())));
138 fun add attrs = NameSpace.extend_table (Sign.naming_of thy) new_attrs attrs
139 handle Symtab.DUP dup => error ("Duplicate declaration of attributes " ^ quote dup);
140 in Attributes.map add thy end;
143 (* attribute syntax *)
145 fun syntax scan src (st, th) =
146 let val (f: attribute, st') = Args.syntax "attribute" scan src st
149 fun no_args x = syntax (Scan.succeed x);
151 fun add_del_args add del = syntax
152 (Scan.lift (Args.add >> K add || Args.del >> K del || Scan.succeed add));
156 (** parsing attributed theorems **)
160 val fact_name = Args.internal_fact >> K "<fact>" || Args.name;
162 fun gen_thm pick = Scan.depend (fn context =>
164 val thy = Context.theory_of context;
165 val get = Context.cases PureThy.get_fact ProofContext.get_fact context;
166 val get_fact = get o Facts.Fact;
167 val get_named = get o Facts.named;
169 Args.$$$ "[" |-- Args.attribs (intern thy) --| Args.$$$ "]" >> (fn srcs =>
171 val atts = map (attribute_i thy) srcs;
172 val (context', th') = Library.apply atts (context, Drule.dummy_thm);
173 in (context', pick "" [th']) end)
175 (Scan.ahead Args.alt_name -- Args.named_fact get_fact
176 >> (fn (s, fact) => ("", Facts.Fact s, fact))
177 || Scan.ahead fact_name -- Args.position (Args.named_fact get_named) -- Scan.option Args.thm_sel
178 >> (fn ((name, (fact, pos)), sel) => (name, Facts.Named ((name, pos), sel), fact)))
179 -- Args.opt_attribs (intern thy) >> (fn ((name, thmref, fact), srcs) =>
181 val ths = Facts.select thmref fact;
182 val atts = map (attribute_i thy) srcs;
183 val (context', ths') = foldl_map (Library.apply atts) (context, ths);
184 in (context', pick name ths') end)
189 val thm = gen_thm Facts.the_single;
190 val multi_thm = gen_thm (K I);
191 val thms = Scan.repeat multi_thm >> flat;
197 (** basic attributes **)
201 fun internal att = Args.src (("Pure.attribute", [Args.mk_attribute att]), Position.none);
204 syntax (Scan.lift Args.internal_attribute >> Morphism.form);
209 val tagged = syntax (Scan.lift (Args.name -- Args.name) >> PureThy.tag);
210 val untagged = syntax (Scan.lift Args.name >> PureThy.untag);
212 val kind = syntax (Scan.lift Args.name >> PureThy.kind);
215 (* rule composition *)
218 syntax (Scan.lift (Scan.optional (Args.bracks Args.nat) 1) -- thm
219 >> (fn (i, B) => Thm.rule_attribute (fn _ => fn A => Drule.compose_single (A, i, B))));
222 syntax (Scan.lift (Scan.optional (Args.bracks Args.nat) 1) -- thm
223 >> (fn (i, B) => Thm.rule_attribute (fn _ => fn A => A RSN (i, B))));
226 syntax (thms >> (fn Bs => Thm.rule_attribute (fn _ => fn A => Bs MRS A)));
231 val rename_abs = syntax
232 (Scan.lift (Scan.repeat (Args.maybe Args.name) >> (apsnd o Drule.rename_bvars')));
235 (* unfold / fold definitions *)
237 fun unfolded_syntax rule =
239 (fn ths => Thm.rule_attribute (fn context => rule (Context.proof_of context) ths)));
241 val unfolded = unfolded_syntax LocalDefs.unfold;
242 val folded = unfolded_syntax LocalDefs.fold;
247 val consumes = syntax (Scan.lift (Scan.optional Args.nat 1) >> RuleCases.consumes);
248 val case_names = syntax (Scan.lift (Scan.repeat1 Args.name) >> RuleCases.case_names);
249 val case_conclusion =
250 syntax (Scan.lift (Args.name -- Scan.repeat Args.name) >> RuleCases.case_conclusion);
251 val params = syntax (Args.and_list1 (Scan.lift (Scan.repeat Args.name)) >> RuleCases.params);
256 val rule_format = syntax (Args.mode "no_asm"
257 >> (fn true => ObjectLogic.rule_format_no_asm | false => ObjectLogic.rule_format));
259 val elim_format = no_args (Thm.rule_attribute (K Tactic.make_elim));
264 val standard = no_args (Thm.rule_attribute (K Drule.standard));
266 val no_vars = no_args (Thm.rule_attribute (fn ctxt => fn th =>
267 let val ((_, [th']), _) = Variable.import_thms true [th] (Context.proof_of ctxt)
271 no_args (Thm.rule_attribute (K (Conv.fconv_rule Drule.eta_long_conversion)));
274 (Scan.lift (Scan.optional Args.int 1) >> (fn n => Thm.rule_attribute (K (rotate_prems n))));
281 [("attribute", internal_att, "internal attribute"),
282 ("tagged", tagged, "tagged theorem"),
283 ("untagged", untagged, "untagged theorem"),
284 ("kind", kind, "theorem kind"),
285 ("COMP", COMP_att, "direct composition with rules (no lifting)"),
286 ("THEN", THEN_att, "resolution with rule"),
287 ("OF", OF_att, "rule applied to facts"),
288 ("rename_abs", rename_abs, "rename bound variables in abstractions"),
289 ("unfolded", unfolded, "unfolded definitions"),
290 ("folded", folded, "folded definitions"),
291 ("standard", standard, "result put into standard form"),
292 ("elim_format", elim_format, "destruct rule turned into elimination rule format"),
293 ("no_vars", no_vars, "frozen schematic vars"),
294 ("eta_long", eta_long, "put theorem into eta long beta normal form"),
295 ("consumes", consumes, "number of consumed facts"),
296 ("case_names", case_names, "named rule cases"),
297 ("case_conclusion", case_conclusion, "named conclusion of rule cases"),
298 ("params", params, "named rule parameters"),
299 ("atomize", no_args ObjectLogic.declare_atomize, "declaration of atomize rule"),
300 ("rulify", no_args ObjectLogic.declare_rulify, "declaration of rulify rule"),
301 ("rule_format", rule_format, "result put into standard rule format"),
302 ("rotated", rotated, "rotated theorem premises"),
303 ("defn", add_del_args LocalDefs.defn_add LocalDefs.defn_del,
304 "declaration of definitional transformations")]);
308 (** configuration options **)
312 structure Configs = TheoryDataFun
314 type T = Config.value Config.T Symtab.table;
315 val empty = Symtab.empty;
318 fun merge _ = Symtab.merge (K true);
321 fun print_configs ctxt =
323 val thy = ProofContext.theory_of ctxt;
324 fun prt (name, config) =
325 let val value = Config.get ctxt config in
326 Pretty.block [Pretty.str (name ^ ": " ^ Config.print_type value ^ " ="), Pretty.brk 1,
327 Pretty.str (Config.print_value value)]
329 val configs = NameSpace.extern_table (#1 (Attributes.get thy), Configs.get thy);
330 in Pretty.writeln (Pretty.big_list "configuration options" (map prt configs)) end;
333 (* concrete syntax *)
337 val equals = Args.$$$ "=";
339 fun scan_value (Config.Bool _) =
340 equals -- Args.$$$ "false" >> K (Config.Bool false) ||
341 equals -- Args.$$$ "true" >> K (Config.Bool true) ||
342 Scan.succeed (Config.Bool true)
343 | scan_value (Config.Int _) = equals |-- Args.int >> Config.Int
344 | scan_value (Config.String _) = equals |-- Args.name >> Config.String;
346 fun scan_config thy config =
347 let val config_type = Config.get_thy thy config
348 in scan_value config_type >> (K o Thm.declaration_attribute o K o Config.put_generic config) end;
352 fun register_config config thy =
354 val bname = Config.name_of config;
355 val name = Sign.full_name thy bname;
358 |> add_attributes [(bname, syntax (Scan.lift (scan_config thy config) >> Morphism.form),
359 "configuration option")]
360 |> Configs.map (Symtab.update (name, config))
363 fun declare_config make coerce global name default =
365 val config_value = Config.declare global name (make default);
366 val config = coerce config_value;
367 in (config, register_config config_value) end;
369 val config_bool = declare_config Config.Bool Config.bool false;
370 val config_int = declare_config Config.Int Config.int false;
371 val config_string = declare_config Config.String Config.string false;
373 val config_bool_global = declare_config Config.Bool Config.bool true;
374 val config_int_global = declare_config Config.Int Config.int true;
375 val config_string_global = declare_config Config.String Config.string true;
383 (register_config Unify.trace_bound_value #>
384 register_config Unify.search_bound_value #>
385 register_config Unify.trace_simp_value #>
386 register_config Unify.trace_types_value #>
387 register_config MetaSimplifier.simp_depth_limit_value);
391 structure BasicAttrib: BASIC_ATTRIB = Attrib;