author | blanchet |
Fri, 01 Aug 2014 14:43:57 +0200 | |
changeset 57743 | 0af2d5dfb0ac |
parent 57192 | 180e955711cf |
child 58668 | 1891f17c6124 |
permissions | -rw-r--r-- |
38379
67d71449e85b
more convenient split of class modules: class and class_declaration
haftmann
parents:
38377
diff
changeset
|
1 |
(* Title: Pure/Isar/class.ML |
24218 | 2 |
Author: Florian Haftmann, TU Muenchen |
3 |
||
38379
67d71449e85b
more convenient split of class modules: class and class_declaration
haftmann
parents:
38377
diff
changeset
|
4 |
Type classes derived from primitive axclasses and locales. |
24218 | 5 |
*) |
6 |
||
38379
67d71449e85b
more convenient split of class modules: class and class_declaration
haftmann
parents:
38377
diff
changeset
|
7 |
signature CLASS = |
24218 | 8 |
sig |
25462 | 9 |
(*classes*) |
29526 | 10 |
val is_class: theory -> class -> bool |
11 |
val these_params: theory -> sort -> (string * (class * (string * typ))) list |
|
38379
67d71449e85b
more convenient split of class modules: class and class_declaration
haftmann
parents:
38377
diff
changeset
|
12 |
val base_sort: theory -> class -> sort |
67d71449e85b
more convenient split of class modules: class and class_declaration
haftmann
parents:
38377
diff
changeset
|
13 |
val rules: theory -> class -> thm option * thm |
67d71449e85b
more convenient split of class modules: class and class_declaration
haftmann
parents:
38377
diff
changeset
|
14 |
val these_defs: theory -> sort -> thm list |
67d71449e85b
more convenient split of class modules: class and class_declaration
haftmann
parents:
38377
diff
changeset
|
15 |
val these_operations: theory -> sort |
67d71449e85b
more convenient split of class modules: class and class_declaration
haftmann
parents:
38377
diff
changeset
|
16 |
-> (string * (class * (typ * term))) list |
42359 | 17 |
val print_classes: Proof.context -> unit |
25311 | 18 |
val init: class -> theory -> Proof.context |
38379
67d71449e85b
more convenient split of class modules: class and class_declaration
haftmann
parents:
38377
diff
changeset
|
19 |
val begin: class list -> sort -> Proof.context -> Proof.context |
57067 | 20 |
val const: class -> (binding * mixfix) * term -> term list * term list -> local_theory -> local_theory |
57161
6254c51cd210
formal treatment of dangling parameters for class abbrevs analogously to class consts
haftmann
parents:
57148
diff
changeset
|
21 |
val abbrev: class -> Syntax.mode -> (binding * mixfix) * term -> term -> term list * term list -> local_theory -> local_theory |
38379
67d71449e85b
more convenient split of class modules: class and class_declaration
haftmann
parents:
38377
diff
changeset
|
22 |
val redeclare_operations: theory -> sort -> Proof.context -> Proof.context |
29526 | 23 |
val class_prefix: string -> string |
38379
67d71449e85b
more convenient split of class modules: class and class_declaration
haftmann
parents:
38377
diff
changeset
|
24 |
val register: class -> class list -> ((string * typ) * (string * typ)) list |
67d71449e85b
more convenient split of class modules: class and class_declaration
haftmann
parents:
38377
diff
changeset
|
25 |
-> sort -> morphism -> morphism -> thm option -> thm option -> thm |
67d71449e85b
more convenient split of class modules: class and class_declaration
haftmann
parents:
38377
diff
changeset
|
26 |
-> theory -> theory |
25485 | 27 |
|
25462 | 28 |
(*instances*) |
38379
67d71449e85b
more convenient split of class modules: class and class_declaration
haftmann
parents:
38377
diff
changeset
|
29 |
val instantiation: string list * (string * sort) list * sort -> theory -> local_theory |
26247 | 30 |
val instantiation_instance: (local_theory -> local_theory) |
31 |
-> local_theory -> Proof.state |
|
32 |
val prove_instantiation_instance: (Proof.context -> tactic) |
|
33 |
-> local_theory -> local_theory |
|
28666 | 34 |
val prove_instantiation_exit: (Proof.context -> tactic) |
35 |
-> local_theory -> theory |
|
36 |
val prove_instantiation_exit_result: (morphism -> 'a -> 'b) |
|
37 |
-> (Proof.context -> 'b -> tactic) -> 'a -> local_theory -> 'b * theory |
|
31869 | 38 |
val read_multi_arity: theory -> xstring list * xstring list * xstring |
39 |
-> string list * (string * sort) list * sort |
|
38348
cf7b2121ad9d
moved instantiation target formally to class_target.ML
haftmann
parents:
38107
diff
changeset
|
40 |
val instantiation_cmd: xstring list * xstring list * xstring -> theory -> local_theory |
38377 | 41 |
val instance_arity_cmd: xstring list * xstring list * xstring -> theory -> Proof.state |
25485 | 42 |
|
31635 | 43 |
(*subclasses*) |
44 |
val classrel: class * class -> theory -> Proof.state |
|
45 |
val classrel_cmd: xstring * xstring -> theory -> Proof.state |
|
38379
67d71449e85b
more convenient split of class modules: class and class_declaration
haftmann
parents:
38377
diff
changeset
|
46 |
val register_subclass: class * class -> morphism option -> Element.witness option |
54866
7b9a67cbd48f
self-contained formulation of subclass command, avoiding hard-wired Named_Target.init
haftmann
parents:
54742
diff
changeset
|
47 |
-> morphism -> local_theory -> local_theory |
31635 | 48 |
|
49 |
(*tactics*) |
|
29526 | 50 |
val intro_classes_tac: thm list -> tactic |
51 |
val default_intro_tac: Proof.context -> thm list -> tactic |
|
24218 | 52 |
end; |
53 |
||
38379
67d71449e85b
more convenient split of class modules: class and class_declaration
haftmann
parents:
38377
diff
changeset
|
54 |
structure Class: CLASS = |
24218 | 55 |
struct |
56 |
||
24589 | 57 |
(** class data **) |
24218 | 58 |
|
46919 | 59 |
datatype class_data = Class_Data of { |
28715
238f9966c80e
class morphism stemming from locale interpretation
haftmann
parents:
28674
diff
changeset
|
60 |
|
238f9966c80e
class morphism stemming from locale interpretation
haftmann
parents:
28674
diff
changeset
|
61 |
(* static part *) |
24218 | 62 |
consts: (string * string) list |
24836 | 63 |
(*locale parameter ~> constant name*), |
25062 | 64 |
base_sort: sort, |
29545 | 65 |
base_morph: morphism |
29439 | 66 |
(*static part of canonical morphism*), |
32850 | 67 |
export_morph: morphism, |
25618 | 68 |
assm_intro: thm option, |
69 |
of_class: thm, |
|
70 |
axiom: thm option, |
|
42359 | 71 |
|
28715
238f9966c80e
class morphism stemming from locale interpretation
haftmann
parents:
28674
diff
changeset
|
72 |
(* dynamic part *) |
24657 | 73 |
defs: thm list, |
25368
f12613fda79d
proper implementation of check phase; non-qualified names for class operations
haftmann
parents:
25344
diff
changeset
|
74 |
operations: (string * (class * (typ * term))) list |
28715
238f9966c80e
class morphism stemming from locale interpretation
haftmann
parents:
28674
diff
changeset
|
75 |
|
48106 | 76 |
(* n.b. |
77 |
params = logical parameters of class |
|
78 |
operations = operations participating in user-space type system |
|
79 |
*) |
|
24657 | 80 |
}; |
24218 | 81 |
|
32850 | 82 |
fun make_class_data ((consts, base_sort, base_morph, export_morph, assm_intro, of_class, axiom), |
25368
f12613fda79d
proper implementation of check phase; non-qualified names for class operations
haftmann
parents:
25344
diff
changeset
|
83 |
(defs, operations)) = |
46919 | 84 |
Class_Data {consts = consts, base_sort = base_sort, |
32850 | 85 |
base_morph = base_morph, export_morph = export_morph, assm_intro = assm_intro, |
46919 | 86 |
of_class = of_class, axiom = axiom, defs = defs, operations = operations}; |
87 |
fun map_class_data f (Class_Data {consts, base_sort, base_morph, export_morph, assm_intro, |
|
88 |
of_class, axiom, defs, operations}) = |
|
32850 | 89 |
make_class_data (f ((consts, base_sort, base_morph, export_morph, assm_intro, of_class, axiom), |
25368
f12613fda79d
proper implementation of check phase; non-qualified names for class operations
haftmann
parents:
25344
diff
changeset
|
90 |
(defs, operations))); |
46919 | 91 |
fun merge_class_data _ (Class_Data {consts = consts, |
32850 | 92 |
base_sort = base_sort, base_morph = base_morph, export_morph = export_morph, assm_intro = assm_intro, |
46919 | 93 |
of_class = of_class, axiom = axiom, defs = defs1, operations = operations1}, |
94 |
Class_Data {consts = _, base_sort = _, base_morph = _, export_morph = _, assm_intro = _, |
|
95 |
of_class = _, axiom = _, defs = defs2, operations = operations2}) = |
|
32850 | 96 |
make_class_data ((consts, base_sort, base_morph, export_morph, assm_intro, of_class, axiom), |
24914
95cda5dd58d5
added proper subclass concept; improved class target
haftmann
parents:
24901
diff
changeset
|
97 |
(Thm.merge_thms (defs1, defs2), |
25368
f12613fda79d
proper implementation of check phase; non-qualified names for class operations
haftmann
parents:
25344
diff
changeset
|
98 |
AList.merge (op =) (K true) (operations1, operations2))); |
24218 | 99 |
|
46919 | 100 |
structure Class_Data = Theory_Data |
24218 | 101 |
( |
25038 | 102 |
type T = class_data Graph.T |
103 |
val empty = Graph.empty; |
|
24218 | 104 |
val extend = I; |
33522 | 105 |
val merge = Graph.join merge_class_data; |
24218 | 106 |
); |
107 |
||
108 |
||
109 |
(* queries *) |
|
110 |
||
46919 | 111 |
fun lookup_class_data thy class = |
112 |
(case try (Graph.get_node (Class_Data.get thy)) class of |
|
113 |
SOME (Class_Data data) => SOME data |
|
114 |
| NONE => NONE); |
|
24218 | 115 |
|
46919 | 116 |
fun the_class_data thy class = |
117 |
(case lookup_class_data thy class of |
|
118 |
NONE => error ("Undeclared class " ^ quote class) |
|
119 |
| SOME data => data); |
|
24218 | 120 |
|
25038 | 121 |
val is_class = is_some oo lookup_class_data; |
122 |
||
46919 | 123 |
val ancestry = Graph.all_succs o Class_Data.get; |
124 |
val heritage = Graph.all_preds o Class_Data.get; |
|
29509
1ff0f3f08a7b
migrated class package to new locale implementation
haftmann
parents:
29439
diff
changeset
|
125 |
|
25002 | 126 |
fun these_params thy = |
24218 | 127 |
let |
128 |
fun params class = |
|
129 |
let |
|
51685
385ef6706252
more standard module name Axclass (according to file name);
wenzelm
parents:
51578
diff
changeset
|
130 |
val const_typs = (#params o Axclass.get_info thy) class; |
24657 | 131 |
val const_names = (#consts o the_class_data thy) class; |
24218 | 132 |
in |
26518 | 133 |
(map o apsnd) |
134 |
(fn c => (class, (c, (the o AList.lookup (op =) const_typs) c))) const_names |
|
24218 | 135 |
end; |
136 |
in maps params o ancestry thy end; |
|
137 |
||
29526 | 138 |
val base_sort = #base_sort oo the_class_data; |
139 |
||
140 |
fun rules thy class = |
|
46919 | 141 |
let val {axiom, of_class, ...} = the_class_data thy class |
29526 | 142 |
in (axiom, of_class) end; |
143 |
||
144 |
fun all_assm_intros thy = |
|
46919 | 145 |
Graph.fold (fn (_, (Class_Data {assm_intro, ...}, _)) => fold (insert Thm.eq_thm) |
146 |
(the_list assm_intro)) (Class_Data.get thy) []; |
|
24218 | 147 |
|
29526 | 148 |
fun these_defs thy = maps (#defs o the_class_data thy) o ancestry thy; |
149 |
fun these_operations thy = maps (#operations o the_class_data thy) o ancestry thy; |
|
29358 | 150 |
|
29526 | 151 |
val base_morphism = #base_morph oo the_class_data; |
47078 | 152 |
|
46919 | 153 |
fun morphism thy class = |
154 |
(case Element.eq_morphism thy (these_defs thy [class]) of |
|
155 |
SOME eq_morph => base_morphism thy class $> eq_morph |
|
156 |
| NONE => base_morphism thy class); |
|
47078 | 157 |
|
32850 | 158 |
val export_morphism = #export_morph oo the_class_data; |
28715
238f9966c80e
class morphism stemming from locale interpretation
haftmann
parents:
28674
diff
changeset
|
159 |
|
42359 | 160 |
fun print_classes ctxt = |
24218 | 161 |
let |
42360 | 162 |
val thy = Proof_Context.theory_of ctxt; |
24218 | 163 |
val algebra = Sign.classes_of thy; |
51510
b4f7e6734acc
tuned print_classes: more standard order, markup, formatting;
wenzelm
parents:
49687
diff
changeset
|
164 |
|
b4f7e6734acc
tuned print_classes: more standard order, markup, formatting;
wenzelm
parents:
49687
diff
changeset
|
165 |
val class_space = Proof_Context.class_space ctxt; |
b4f7e6734acc
tuned print_classes: more standard order, markup, formatting;
wenzelm
parents:
49687
diff
changeset
|
166 |
val type_space = Proof_Context.type_space ctxt; |
b4f7e6734acc
tuned print_classes: more standard order, markup, formatting;
wenzelm
parents:
49687
diff
changeset
|
167 |
val const_space = Proof_Context.const_space ctxt; |
b4f7e6734acc
tuned print_classes: more standard order, markup, formatting;
wenzelm
parents:
49687
diff
changeset
|
168 |
|
24218 | 169 |
val arities = |
170 |
Symtab.empty |
|
171 |
|> Symtab.fold (fn (tyco, arities) => fold (fn (class, _) => |
|
172 |
Symtab.map_default (class, []) (insert (op =) tyco)) arities) |
|
36328
4d9deabf6474
replaced Sorts.rep_algebra by slightly more abstract selectors classes_of/arities_of;
wenzelm
parents:
36323
diff
changeset
|
173 |
(Sorts.arities_of algebra); |
51510
b4f7e6734acc
tuned print_classes: more standard order, markup, formatting;
wenzelm
parents:
49687
diff
changeset
|
174 |
|
b4f7e6734acc
tuned print_classes: more standard order, markup, formatting;
wenzelm
parents:
49687
diff
changeset
|
175 |
fun prt_supersort class = |
b4f7e6734acc
tuned print_classes: more standard order, markup, formatting;
wenzelm
parents:
49687
diff
changeset
|
176 |
Syntax.pretty_sort ctxt (Sign.minimize_sort thy (Sign.super_classes thy class)); |
b4f7e6734acc
tuned print_classes: more standard order, markup, formatting;
wenzelm
parents:
49687
diff
changeset
|
177 |
|
b4f7e6734acc
tuned print_classes: more standard order, markup, formatting;
wenzelm
parents:
49687
diff
changeset
|
178 |
fun prt_arity class tyco = |
24218 | 179 |
let |
180 |
val Ss = Sorts.mg_domain algebra tyco [class]; |
|
24920 | 181 |
in Syntax.pretty_arity ctxt (tyco, Ss, [class]) end; |
51510
b4f7e6734acc
tuned print_classes: more standard order, markup, formatting;
wenzelm
parents:
49687
diff
changeset
|
182 |
|
b4f7e6734acc
tuned print_classes: more standard order, markup, formatting;
wenzelm
parents:
49687
diff
changeset
|
183 |
fun prt_param (c, ty) = |
b4f7e6734acc
tuned print_classes: more standard order, markup, formatting;
wenzelm
parents:
49687
diff
changeset
|
184 |
Pretty.block |
53539 | 185 |
[Name_Space.pretty ctxt const_space c, Pretty.str " ::", |
51510
b4f7e6734acc
tuned print_classes: more standard order, markup, formatting;
wenzelm
parents:
49687
diff
changeset
|
186 |
Pretty.brk 1, Syntax.pretty_typ ctxt (Type.strip_sorts_dummy ty)]; |
b4f7e6734acc
tuned print_classes: more standard order, markup, formatting;
wenzelm
parents:
49687
diff
changeset
|
187 |
|
b4f7e6734acc
tuned print_classes: more standard order, markup, formatting;
wenzelm
parents:
49687
diff
changeset
|
188 |
fun prt_entry class = |
b4f7e6734acc
tuned print_classes: more standard order, markup, formatting;
wenzelm
parents:
49687
diff
changeset
|
189 |
Pretty.block |
55763 | 190 |
([Pretty.keyword1 "class", Pretty.brk 1, |
53539 | 191 |
Name_Space.pretty ctxt class_space class, Pretty.str ":", Pretty.fbrk, |
192 |
Pretty.block [Pretty.str "supersort: ", prt_supersort class]] @ |
|
51685
385ef6706252
more standard module name Axclass (according to file name);
wenzelm
parents:
51578
diff
changeset
|
193 |
(case try (Axclass.get_info thy) class of |
51510
b4f7e6734acc
tuned print_classes: more standard order, markup, formatting;
wenzelm
parents:
49687
diff
changeset
|
194 |
NONE => [] |
b4f7e6734acc
tuned print_classes: more standard order, markup, formatting;
wenzelm
parents:
49687
diff
changeset
|
195 |
| SOME {params, ...} => |
b4f7e6734acc
tuned print_classes: more standard order, markup, formatting;
wenzelm
parents:
49687
diff
changeset
|
196 |
[Pretty.fbrk, Pretty.big_list "parameters:" (map prt_param params)]) @ |
b4f7e6734acc
tuned print_classes: more standard order, markup, formatting;
wenzelm
parents:
49687
diff
changeset
|
197 |
(case Symtab.lookup arities class of |
b4f7e6734acc
tuned print_classes: more standard order, markup, formatting;
wenzelm
parents:
49687
diff
changeset
|
198 |
NONE => [] |
b4f7e6734acc
tuned print_classes: more standard order, markup, formatting;
wenzelm
parents:
49687
diff
changeset
|
199 |
| SOME ars => |
b4f7e6734acc
tuned print_classes: more standard order, markup, formatting;
wenzelm
parents:
49687
diff
changeset
|
200 |
[Pretty.fbrk, Pretty.big_list "instances:" |
b4f7e6734acc
tuned print_classes: more standard order, markup, formatting;
wenzelm
parents:
49687
diff
changeset
|
201 |
(map (prt_arity class) (sort (Name_Space.extern_ord ctxt type_space) ars))])); |
24218 | 202 |
in |
51510
b4f7e6734acc
tuned print_classes: more standard order, markup, formatting;
wenzelm
parents:
49687
diff
changeset
|
203 |
Sorts.all_classes algebra |
b4f7e6734acc
tuned print_classes: more standard order, markup, formatting;
wenzelm
parents:
49687
diff
changeset
|
204 |
|> sort (Name_Space.extern_ord ctxt class_space) |
b4f7e6734acc
tuned print_classes: more standard order, markup, formatting;
wenzelm
parents:
49687
diff
changeset
|
205 |
|> map prt_entry |
56334
6b3739fee456
some shortcuts for chunks, which sometimes avoid bulky string output;
wenzelm
parents:
56204
diff
changeset
|
206 |
|> Pretty.writeln_chunks2 |
24218 | 207 |
end; |
208 |
||
209 |
||
210 |
(* updaters *) |
|
211 |
||
32850 | 212 |
fun register class sups params base_sort base_morph export_morph |
52636 | 213 |
some_axiom some_assm_intro of_class thy = |
25002 | 214 |
let |
25368
f12613fda79d
proper implementation of check phase; non-qualified names for class operations
haftmann
parents:
25344
diff
changeset
|
215 |
val operations = map (fn (v_ty as (_, ty), (c, _)) => |
25683 | 216 |
(c, (class, (ty, Free v_ty)))) params; |
25038 | 217 |
val add_class = Graph.new_node (class, |
31599 | 218 |
make_class_data (((map o pairself) fst params, base_sort, |
52636 | 219 |
base_morph, export_morph, some_assm_intro, of_class, some_axiom), ([], operations))) |
29526 | 220 |
#> fold (curry Graph.add_edge class) sups; |
46919 | 221 |
in Class_Data.map add_class thy end; |
24218 | 222 |
|
46919 | 223 |
fun activate_defs class thms thy = |
224 |
(case Element.eq_morphism thy thms of |
|
225 |
SOME eq_morph => fold (fn cls => fn thy => |
|
38107 | 226 |
Context.theory_map (Locale.amend_registration (cls, base_morphism thy cls) |
227 |
(eq_morph, true) (export_morphism thy cls)) thy) (heritage thy [class]) thy |
|
46919 | 228 |
| NONE => thy); |
29526 | 229 |
|
57173
897cc57a6f55
always refine interpretation morphism using canonical constant's definition theorem
haftmann
parents:
57161
diff
changeset
|
230 |
fun register_operation class (c, t) thy = |
25062 | 231 |
let |
29358 | 232 |
val base_sort = base_sort thy class; |
29439 | 233 |
val prep_typ = map_type_tfree |
234 |
(fn (v, sort) => if Name.aT = v |
|
235 |
then TFree (v, base_sort) else TVar ((v, 0), sort)); |
|
25368
f12613fda79d
proper implementation of check phase; non-qualified names for class operations
haftmann
parents:
25344
diff
changeset
|
236 |
val t' = map_types prep_typ t; |
f12613fda79d
proper implementation of check phase; non-qualified names for class operations
haftmann
parents:
25344
diff
changeset
|
237 |
val ty' = Term.fastype_of t'; |
25062 | 238 |
in |
239 |
thy |
|
57173
897cc57a6f55
always refine interpretation morphism using canonical constant's definition theorem
haftmann
parents:
57161
diff
changeset
|
240 |
|> (Class_Data.map o Graph.map_node class o map_class_data o apsnd o apsnd) |
897cc57a6f55
always refine interpretation morphism using canonical constant's definition theorem
haftmann
parents:
57161
diff
changeset
|
241 |
(cons (c, (class, (ty', t')))) |
897cc57a6f55
always refine interpretation morphism using canonical constant's definition theorem
haftmann
parents:
57161
diff
changeset
|
242 |
end; |
897cc57a6f55
always refine interpretation morphism using canonical constant's definition theorem
haftmann
parents:
57161
diff
changeset
|
243 |
|
897cc57a6f55
always refine interpretation morphism using canonical constant's definition theorem
haftmann
parents:
57161
diff
changeset
|
244 |
fun register_def class def_thm thy = |
897cc57a6f55
always refine interpretation morphism using canonical constant's definition theorem
haftmann
parents:
57161
diff
changeset
|
245 |
let |
897cc57a6f55
always refine interpretation morphism using canonical constant's definition theorem
haftmann
parents:
57161
diff
changeset
|
246 |
val sym_thm = Thm.symmetric def_thm |
897cc57a6f55
always refine interpretation morphism using canonical constant's definition theorem
haftmann
parents:
57161
diff
changeset
|
247 |
in |
897cc57a6f55
always refine interpretation morphism using canonical constant's definition theorem
haftmann
parents:
57161
diff
changeset
|
248 |
thy |
897cc57a6f55
always refine interpretation morphism using canonical constant's definition theorem
haftmann
parents:
57161
diff
changeset
|
249 |
|> (Class_Data.map o Graph.map_node class o map_class_data o apsnd o apfst) |
897cc57a6f55
always refine interpretation morphism using canonical constant's definition theorem
haftmann
parents:
57161
diff
changeset
|
250 |
(cons sym_thm) |
897cc57a6f55
always refine interpretation morphism using canonical constant's definition theorem
haftmann
parents:
57161
diff
changeset
|
251 |
|> activate_defs class [sym_thm] |
25062 | 252 |
end; |
24218 | 253 |
|
254 |
||
24589 | 255 |
(** classes and class target **) |
24218 | 256 |
|
25002 | 257 |
(* class context syntax *) |
24748 | 258 |
|
35858
0d394a82337e
handle hidden polymorphism in class target (without class target syntax, though)
haftmann
parents:
35845
diff
changeset
|
259 |
fun these_unchecks thy = map (fn (c, (_, (ty, t))) => (t, Const (c, ty))) |
0d394a82337e
handle hidden polymorphism in class target (without class target syntax, though)
haftmann
parents:
35845
diff
changeset
|
260 |
o these_operations thy; |
29577 | 261 |
|
29632
c3d576157244
fixed reading of class specs: declare class operations in context
haftmann
parents:
29610
diff
changeset
|
262 |
fun redeclare_const thy c = |
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30344
diff
changeset
|
263 |
let val b = Long_Name.base_name c |
29632
c3d576157244
fixed reading of class specs: declare class operations in context
haftmann
parents:
29610
diff
changeset
|
264 |
in Sign.intern_const thy b = c ? Variable.declare_const (b, c) end; |
c3d576157244
fixed reading of class specs: declare class operations in context
haftmann
parents:
29610
diff
changeset
|
265 |
|
29577 | 266 |
fun synchronize_class_syntax sort base_sort ctxt = |
24914
95cda5dd58d5
added proper subclass concept; improved class target
haftmann
parents:
24901
diff
changeset
|
267 |
let |
42360 | 268 |
val thy = Proof_Context.theory_of ctxt; |
26596 | 269 |
val algebra = Sign.classes_of thy; |
29577 | 270 |
val operations = these_operations thy sort; |
26518 | 271 |
fun subst_class_typ sort = map_type_tfree (K (TVar ((Name.aT, 0), sort))); |
272 |
val primary_constraints = |
|
25368
f12613fda79d
proper implementation of check phase; non-qualified names for class operations
haftmann
parents:
25344
diff
changeset
|
273 |
(map o apsnd) (subst_class_typ base_sort o fst o snd) operations; |
26518 | 274 |
val secondary_constraints = |
25368
f12613fda79d
proper implementation of check phase; non-qualified names for class operations
haftmann
parents:
25344
diff
changeset
|
275 |
(map o apsnd) (fn (class, (ty, _)) => subst_class_typ [class] ty) operations; |
46919 | 276 |
fun improve (c, ty) = |
277 |
(case AList.lookup (op =) primary_constraints c of |
|
278 |
SOME ty' => |
|
279 |
(case try (Type.raw_match (ty', ty)) Vartab.empty of |
|
280 |
SOME tyenv => |
|
281 |
(case Vartab.lookup tyenv (Name.aT, 0) of |
|
282 |
SOME (_, ty' as TVar (vi, sort)) => |
|
283 |
if Type_Infer.is_param vi andalso Sorts.sort_le algebra (base_sort, sort) |
|
284 |
then SOME (ty', TFree (Name.aT, base_sort)) |
|
285 |
else NONE |
|
26238 | 286 |
| _ => NONE) |
287 |
| NONE => NONE) |
|
46919 | 288 |
| NONE => NONE); |
47005
421760a1efe7
maintain generic context naming in structure Name_Space (NB: empty = default_naming, init = local_naming);
wenzelm
parents:
46923
diff
changeset
|
289 |
fun subst (c, _) = Option.map snd (AList.lookup (op =) operations c); |
29577 | 290 |
val unchecks = these_unchecks thy sort; |
25083 | 291 |
in |
292 |
ctxt |
|
29632
c3d576157244
fixed reading of class specs: declare class operations in context
haftmann
parents:
29610
diff
changeset
|
293 |
|> fold (redeclare_const thy o fst) primary_constraints |
26518 | 294 |
|> Overloading.map_improvable_syntax (K (((primary_constraints, secondary_constraints), |
26730 | 295 |
(((improve, subst), true), unchecks)), false)) |
26518 | 296 |
|> Overloading.set_primary_constraints |
25083 | 297 |
end; |
298 |
||
54866
7b9a67cbd48f
self-contained formulation of subclass command, avoiding hard-wired Named_Target.init
haftmann
parents:
54742
diff
changeset
|
299 |
fun synchronize_class_syntax_target class lthy = |
7b9a67cbd48f
self-contained formulation of subclass command, avoiding hard-wired Named_Target.init
haftmann
parents:
54742
diff
changeset
|
300 |
lthy |
7b9a67cbd48f
self-contained formulation of subclass command, avoiding hard-wired Named_Target.init
haftmann
parents:
54742
diff
changeset
|
301 |
|> Local_Theory.map_contexts |
7b9a67cbd48f
self-contained formulation of subclass command, avoiding hard-wired Named_Target.init
haftmann
parents:
54742
diff
changeset
|
302 |
(K (synchronize_class_syntax [class] (base_sort (Proof_Context.theory_of lthy) class))); |
7b9a67cbd48f
self-contained formulation of subclass command, avoiding hard-wired Named_Target.init
haftmann
parents:
54742
diff
changeset
|
303 |
|
29632
c3d576157244
fixed reading of class specs: declare class operations in context
haftmann
parents:
29610
diff
changeset
|
304 |
fun redeclare_operations thy sort = |
c3d576157244
fixed reading of class specs: declare class operations in context
haftmann
parents:
29610
diff
changeset
|
305 |
fold (redeclare_const thy o fst) (these_operations thy sort); |
c3d576157244
fixed reading of class specs: declare class operations in context
haftmann
parents:
29610
diff
changeset
|
306 |
|
29577 | 307 |
fun begin sort base_sort ctxt = |
25083 | 308 |
ctxt |
309 |
|> Variable.declare_term |
|
310 |
(Logic.mk_type (TFree (Name.aT, base_sort))) |
|
29577 | 311 |
|> synchronize_class_syntax sort base_sort |
39378
df86b1b4ce10
more precise name for activation of improveable syntax
haftmann
parents:
39134
diff
changeset
|
312 |
|> Overloading.activate_improvable_syntax; |
24901
d3cbf79769b9
added first version of user-space type system for class target
haftmann
parents:
24847
diff
changeset
|
313 |
|
25311 | 314 |
fun init class thy = |
315 |
thy |
|
29509
1ff0f3f08a7b
migrated class package to new locale implementation
haftmann
parents:
29439
diff
changeset
|
316 |
|> Locale.init class |
29358 | 317 |
|> begin [class] (base_sort thy class); |
24914
95cda5dd58d5
added proper subclass concept; improved class target
haftmann
parents:
24901
diff
changeset
|
318 |
|
24748 | 319 |
|
27690
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset
|
320 |
(* class target *) |
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset
|
321 |
|
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30344
diff
changeset
|
322 |
val class_prefix = Logic.const_of_class o Long_Name.base_name; |
29526 | 323 |
|
47078 | 324 |
local |
325 |
||
57187
de00494fa8b3
less ad-hoc verision of educated guess: guess identity of declaration morphism wrt. canonical morphism rather than observing particular effects of declaration morphisms only;
haftmann
parents:
57186
diff
changeset
|
326 |
fun guess_morphism_identity (b, rhs) phi1 phi2 = |
de00494fa8b3
less ad-hoc verision of educated guess: guess identity of declaration morphism wrt. canonical morphism rather than observing particular effects of declaration morphisms only;
haftmann
parents:
57186
diff
changeset
|
327 |
let |
de00494fa8b3
less ad-hoc verision of educated guess: guess identity of declaration morphism wrt. canonical morphism rather than observing particular effects of declaration morphisms only;
haftmann
parents:
57186
diff
changeset
|
328 |
(*FIXME proper concept to identify morphism instead of educated guess*) |
de00494fa8b3
less ad-hoc verision of educated guess: guess identity of declaration morphism wrt. canonical morphism rather than observing particular effects of declaration morphisms only;
haftmann
parents:
57186
diff
changeset
|
329 |
val name_of_binding = Name_Space.full_name Name_Space.default_naming; |
de00494fa8b3
less ad-hoc verision of educated guess: guess identity of declaration morphism wrt. canonical morphism rather than observing particular effects of declaration morphisms only;
haftmann
parents:
57186
diff
changeset
|
330 |
val n1 = (name_of_binding o Morphism.binding phi1) b; |
de00494fa8b3
less ad-hoc verision of educated guess: guess identity of declaration morphism wrt. canonical morphism rather than observing particular effects of declaration morphisms only;
haftmann
parents:
57186
diff
changeset
|
331 |
val n2 = (name_of_binding o Morphism.binding phi2) b; |
de00494fa8b3
less ad-hoc verision of educated guess: guess identity of declaration morphism wrt. canonical morphism rather than observing particular effects of declaration morphisms only;
haftmann
parents:
57186
diff
changeset
|
332 |
val rhs1 = Morphism.term phi1 rhs; |
de00494fa8b3
less ad-hoc verision of educated guess: guess identity of declaration morphism wrt. canonical morphism rather than observing particular effects of declaration morphisms only;
haftmann
parents:
57186
diff
changeset
|
333 |
val rhs2 = Morphism.term phi2 rhs; |
de00494fa8b3
less ad-hoc verision of educated guess: guess identity of declaration morphism wrt. canonical morphism rather than observing particular effects of declaration morphisms only;
haftmann
parents:
57186
diff
changeset
|
334 |
in n1 = n2 andalso Term.aconv_untyped (rhs1, rhs2) end; |
de00494fa8b3
less ad-hoc verision of educated guess: guess identity of declaration morphism wrt. canonical morphism rather than observing particular effects of declaration morphisms only;
haftmann
parents:
57186
diff
changeset
|
335 |
|
57192
180e955711cf
yet another attempt for terminology: foo_target_bar denotes an operation bar operating solely on the target context of target foo, foo_bar denotes a whole stack of operations to accomplish bar for target foo
haftmann
parents:
57189
diff
changeset
|
336 |
fun target_const class phi0 prmode ((b, _), rhs) = |
57189
5140ddfccea7
re-unified approach towards class and locale consts, with refined terminology: foo_const_declaration denotes declaration for a particular logical layer, foo_const the full stack for a particular target
haftmann
parents:
57188
diff
changeset
|
337 |
let |
5140ddfccea7
re-unified approach towards class and locale consts, with refined terminology: foo_const_declaration denotes declaration for a particular logical layer, foo_const the full stack for a particular target
haftmann
parents:
57188
diff
changeset
|
338 |
val guess_identity = guess_morphism_identity (b, rhs) Morphism.identity; |
5140ddfccea7
re-unified approach towards class and locale consts, with refined terminology: foo_const_declaration denotes declaration for a particular logical layer, foo_const the full stack for a particular target
haftmann
parents:
57188
diff
changeset
|
339 |
val guess_canonical = guess_morphism_identity (b, rhs) phi0; |
5140ddfccea7
re-unified approach towards class and locale consts, with refined terminology: foo_const_declaration denotes declaration for a particular logical layer, foo_const the full stack for a particular target
haftmann
parents:
57188
diff
changeset
|
340 |
in |
57192
180e955711cf
yet another attempt for terminology: foo_target_bar denotes an operation bar operating solely on the target context of target foo, foo_bar denotes a whole stack of operations to accomplish bar for target foo
haftmann
parents:
57189
diff
changeset
|
341 |
Generic_Target.locale_target_const class |
57189
5140ddfccea7
re-unified approach towards class and locale consts, with refined terminology: foo_const_declaration denotes declaration for a particular logical layer, foo_const the full stack for a particular target
haftmann
parents:
57188
diff
changeset
|
342 |
(not o (guess_identity orf guess_canonical)) prmode ((b, NoSyn), rhs) |
5140ddfccea7
re-unified approach towards class and locale consts, with refined terminology: foo_const_declaration denotes declaration for a particular logical layer, foo_const the full stack for a particular target
haftmann
parents:
57188
diff
changeset
|
343 |
end; |
57072
dfac6ef0ca28
moved const declaration further down in bootstrap hierarchy: keep Named_Target free of low-level stuff
haftmann
parents:
57070
diff
changeset
|
344 |
|
57119 | 345 |
fun dangling_params_for lthy class (type_params, term_params) = |
27690
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset
|
346 |
let |
57119 | 347 |
val class_param_names = |
348 |
map fst (these_params (Proof_Context.theory_of lthy) [class]); |
|
349 |
val dangling_term_params = |
|
350 |
subtract (fn (v, Free (w, _)) => v = w | _ => false) class_param_names term_params; |
|
57161
6254c51cd210
formal treatment of dangling parameters for class abbrevs analogously to class consts
haftmann
parents:
57148
diff
changeset
|
351 |
in (type_params, dangling_term_params) end; |
57119 | 352 |
|
353 |
fun global_def (b, eq) thy = |
|
354 |
thy |
|
355 |
|> Thm.add_def_global false false (b, eq) |
|
356 |
|>> (Thm.varifyT_global o snd) |
|
357 |
|-> (fn def_thm => Global_Theory.store_thm (b, def_thm) |
|
358 |
#> snd |
|
359 |
#> pair def_thm); |
|
360 |
||
57142 | 361 |
fun canonical_const class phi dangling_params ((b, mx), rhs) thy = |
57119 | 362 |
let |
57147 | 363 |
val b_def = Binding.suffix_name "_dict" b; |
364 |
val c = Sign.full_name thy b; |
|
365 |
val ty = map Term.fastype_of dangling_params ---> Term.fastype_of rhs; |
|
366 |
val def_eq = Logic.mk_equals (list_comb (Const (c, ty), dangling_params), rhs) |
|
29577 | 367 |
|> map_types Type.strip_sorts; |
27690
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset
|
368 |
in |
29577 | 369 |
thy |
57147 | 370 |
|> Sign.declare_const_global ((b, Type.strip_sorts ty), mx) |
29577 | 371 |
|> snd |
57119 | 372 |
|> global_def (b_def, def_eq) |
57173
897cc57a6f55
always refine interpretation morphism using canonical constant's definition theorem
haftmann
parents:
57161
diff
changeset
|
373 |
|-> (fn def_thm => register_def class def_thm) |
897cc57a6f55
always refine interpretation morphism using canonical constant's definition theorem
haftmann
parents:
57161
diff
changeset
|
374 |
|> null dangling_params ? register_operation class (c, rhs) |
57147 | 375 |
|> Sign.add_const_constraint (c, SOME ty) |
27690
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset
|
376 |
end; |
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset
|
377 |
|
57161
6254c51cd210
formal treatment of dangling parameters for class abbrevs analogously to class consts
haftmann
parents:
57148
diff
changeset
|
378 |
fun canonical_abbrev class phi prmode dangling_term_params ((b, mx), rhs) thy = |
27690
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset
|
379 |
let |
29577 | 380 |
val unchecks = these_unchecks thy [class]; |
57119 | 381 |
val rhs' = Pattern.rewrite_term thy unchecks [] rhs; |
57161
6254c51cd210
formal treatment of dangling parameters for class abbrevs analogously to class consts
haftmann
parents:
57148
diff
changeset
|
382 |
val c' = Sign.full_name thy b; |
6254c51cd210
formal treatment of dangling parameters for class abbrevs analogously to class consts
haftmann
parents:
57148
diff
changeset
|
383 |
val ty' = map Term.fastype_of dangling_term_params ---> Term.fastype_of rhs'; |
27690
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset
|
384 |
in |
29577 | 385 |
thy |
57161
6254c51cd210
formal treatment of dangling parameters for class abbrevs analogously to class consts
haftmann
parents:
57148
diff
changeset
|
386 |
|> Sign.add_abbrev (#1 prmode) (b, Logic.varify_types_global (fold lambda dangling_term_params rhs')) |
29577 | 387 |
|> snd |
27690
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset
|
388 |
|> Sign.notation true prmode [(Const (c', ty'), mx)] |
57161
6254c51cd210
formal treatment of dangling parameters for class abbrevs analogously to class consts
haftmann
parents:
57148
diff
changeset
|
389 |
|> (null dangling_term_params andalso not (#1 prmode = Print_Mode.input)) |
57173
897cc57a6f55
always refine interpretation morphism using canonical constant's definition theorem
haftmann
parents:
57161
diff
changeset
|
390 |
? register_operation class (c', rhs') |
57069 | 391 |
|> Sign.add_const_constraint (c', SOME ty') |
27690
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset
|
392 |
end; |
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset
|
393 |
|
38619
25e401d53900
tuned: less formal noise in Named_Target, more coherence in Class
haftmann
parents:
38392
diff
changeset
|
394 |
in |
25e401d53900
tuned: less formal noise in Named_Target, more coherence in Class
haftmann
parents:
38392
diff
changeset
|
395 |
|
57119 | 396 |
fun const class ((b, mx), lhs) params lthy = |
397 |
let |
|
57141 | 398 |
val phi = morphism (Proof_Context.theory_of lthy) class; |
57161
6254c51cd210
formal treatment of dangling parameters for class abbrevs analogously to class consts
haftmann
parents:
57148
diff
changeset
|
399 |
val dangling_params = map (Morphism.term phi) (uncurry append (dangling_params_for lthy class params)); |
57119 | 400 |
in |
401 |
lthy |
|
57192
180e955711cf
yet another attempt for terminology: foo_target_bar denotes an operation bar operating solely on the target context of target foo, foo_bar denotes a whole stack of operations to accomplish bar for target foo
haftmann
parents:
57189
diff
changeset
|
402 |
|> target_const class phi Syntax.mode_default ((b, mx), lhs) |
57148
4069c9b3803a
definition in class: provide explicit auxiliary abbreviation carrying potential mixfix syntax in presence of dangling parameters
haftmann
parents:
57147
diff
changeset
|
403 |
|> Local_Theory.raw_theory (canonical_const class phi dangling_params |
4069c9b3803a
definition in class: provide explicit auxiliary abbreviation carrying potential mixfix syntax in presence of dangling parameters
haftmann
parents:
57147
diff
changeset
|
404 |
((Morphism.binding phi b, if null dangling_params then mx else NoSyn), Morphism.term phi lhs)) |
57192
180e955711cf
yet another attempt for terminology: foo_target_bar denotes an operation bar operating solely on the target context of target foo, foo_bar denotes a whole stack of operations to accomplish bar for target foo
haftmann
parents:
57189
diff
changeset
|
405 |
|> Generic_Target.standard_const (fn (this, other) => other <> 0 andalso this <> other) |
57148
4069c9b3803a
definition in class: provide explicit auxiliary abbreviation carrying potential mixfix syntax in presence of dangling parameters
haftmann
parents:
57147
diff
changeset
|
406 |
Syntax.mode_default ((b, if null dangling_params then NoSyn else mx), lhs) |
57141 | 407 |
|> synchronize_class_syntax_target class |
57119 | 408 |
end; |
57072
dfac6ef0ca28
moved const declaration further down in bootstrap hierarchy: keep Named_Target free of low-level stuff
haftmann
parents:
57070
diff
changeset
|
409 |
|
57161
6254c51cd210
formal treatment of dangling parameters for class abbrevs analogously to class consts
haftmann
parents:
57148
diff
changeset
|
410 |
fun abbrev class prmode ((b, mx), lhs) rhs' params lthy = |
57141 | 411 |
let |
412 |
val phi = morphism (Proof_Context.theory_of lthy) class; |
|
57161
6254c51cd210
formal treatment of dangling parameters for class abbrevs analogously to class consts
haftmann
parents:
57148
diff
changeset
|
413 |
val dangling_term_params = map (Morphism.term phi) (snd (dangling_params_for lthy class params)); |
57141 | 414 |
in |
415 |
lthy |
|
57192
180e955711cf
yet another attempt for terminology: foo_target_bar denotes an operation bar operating solely on the target context of target foo, foo_bar denotes a whole stack of operations to accomplish bar for target foo
haftmann
parents:
57189
diff
changeset
|
416 |
|> target_const class phi prmode ((b, mx), lhs) |
57161
6254c51cd210
formal treatment of dangling parameters for class abbrevs analogously to class consts
haftmann
parents:
57148
diff
changeset
|
417 |
|> Local_Theory.raw_theory (canonical_abbrev class phi prmode dangling_term_params |
6254c51cd210
formal treatment of dangling parameters for class abbrevs analogously to class consts
haftmann
parents:
57148
diff
changeset
|
418 |
((Morphism.binding phi b, if null dangling_term_params then mx else NoSyn), rhs')) |
57192
180e955711cf
yet another attempt for terminology: foo_target_bar denotes an operation bar operating solely on the target context of target foo, foo_bar denotes a whole stack of operations to accomplish bar for target foo
haftmann
parents:
57189
diff
changeset
|
419 |
|> Generic_Target.standard_const (fn (this, other) => other <> 0 andalso this <> other) |
57161
6254c51cd210
formal treatment of dangling parameters for class abbrevs analogously to class consts
haftmann
parents:
57148
diff
changeset
|
420 |
prmode ((b, if null dangling_term_params then NoSyn else mx), lhs) |
57141 | 421 |
|> synchronize_class_syntax_target class |
422 |
end; |
|
38619
25e401d53900
tuned: less formal noise in Named_Target, more coherence in Class
haftmann
parents:
38392
diff
changeset
|
423 |
|
25e401d53900
tuned: less formal noise in Named_Target, more coherence in Class
haftmann
parents:
38392
diff
changeset
|
424 |
end; |
25e401d53900
tuned: less formal noise in Named_Target, more coherence in Class
haftmann
parents:
38392
diff
changeset
|
425 |
|
27690
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset
|
426 |
|
54866
7b9a67cbd48f
self-contained formulation of subclass command, avoiding hard-wired Named_Target.init
haftmann
parents:
54742
diff
changeset
|
427 |
(* subclasses *) |
7b9a67cbd48f
self-contained formulation of subclass command, avoiding hard-wired Named_Target.init
haftmann
parents:
54742
diff
changeset
|
428 |
|
7b9a67cbd48f
self-contained formulation of subclass command, avoiding hard-wired Named_Target.init
haftmann
parents:
54742
diff
changeset
|
429 |
fun register_subclass (sub, sup) some_dep_morph some_witn export lthy = |
7b9a67cbd48f
self-contained formulation of subclass command, avoiding hard-wired Named_Target.init
haftmann
parents:
54742
diff
changeset
|
430 |
let |
7b9a67cbd48f
self-contained formulation of subclass command, avoiding hard-wired Named_Target.init
haftmann
parents:
54742
diff
changeset
|
431 |
val thy = Proof_Context.theory_of lthy; |
7b9a67cbd48f
self-contained formulation of subclass command, avoiding hard-wired Named_Target.init
haftmann
parents:
54742
diff
changeset
|
432 |
val intros = (snd o rules thy) sup :: map_filter I |
54883
dd04a8b654fc
proper context for norm_hhf and derived operations;
wenzelm
parents:
54866
diff
changeset
|
433 |
[Option.map (Drule.export_without_context_open o Element.conclude_witness lthy) some_witn, |
54866
7b9a67cbd48f
self-contained formulation of subclass command, avoiding hard-wired Named_Target.init
haftmann
parents:
54742
diff
changeset
|
434 |
(fst o rules thy) sub]; |
7b9a67cbd48f
self-contained formulation of subclass command, avoiding hard-wired Named_Target.init
haftmann
parents:
54742
diff
changeset
|
435 |
val classrel = |
7b9a67cbd48f
self-contained formulation of subclass command, avoiding hard-wired Named_Target.init
haftmann
parents:
54742
diff
changeset
|
436 |
Goal.prove_sorry_global thy [] [] (Logic.mk_classrel (sub, sup)) |
7b9a67cbd48f
self-contained formulation of subclass command, avoiding hard-wired Named_Target.init
haftmann
parents:
54742
diff
changeset
|
437 |
(K (EVERY (map (TRYALL o rtac) intros))); |
7b9a67cbd48f
self-contained formulation of subclass command, avoiding hard-wired Named_Target.init
haftmann
parents:
54742
diff
changeset
|
438 |
val diff_sort = Sign.complete_sort thy [sup] |
7b9a67cbd48f
self-contained formulation of subclass command, avoiding hard-wired Named_Target.init
haftmann
parents:
54742
diff
changeset
|
439 |
|> subtract (op =) (Sign.complete_sort thy [sub]) |
7b9a67cbd48f
self-contained formulation of subclass command, avoiding hard-wired Named_Target.init
haftmann
parents:
54742
diff
changeset
|
440 |
|> filter (is_class thy); |
7b9a67cbd48f
self-contained formulation of subclass command, avoiding hard-wired Named_Target.init
haftmann
parents:
54742
diff
changeset
|
441 |
fun add_dependency some_wit = case some_dep_morph of |
7b9a67cbd48f
self-contained formulation of subclass command, avoiding hard-wired Named_Target.init
haftmann
parents:
54742
diff
changeset
|
442 |
SOME dep_morph => Generic_Target.locale_dependency sub |
7b9a67cbd48f
self-contained formulation of subclass command, avoiding hard-wired Named_Target.init
haftmann
parents:
54742
diff
changeset
|
443 |
(sup, dep_morph $> Element.satisfy_morphism (the_list some_witn)) NONE export |
7b9a67cbd48f
self-contained formulation of subclass command, avoiding hard-wired Named_Target.init
haftmann
parents:
54742
diff
changeset
|
444 |
| NONE => I; |
7b9a67cbd48f
self-contained formulation of subclass command, avoiding hard-wired Named_Target.init
haftmann
parents:
54742
diff
changeset
|
445 |
in |
7b9a67cbd48f
self-contained formulation of subclass command, avoiding hard-wired Named_Target.init
haftmann
parents:
54742
diff
changeset
|
446 |
lthy |
7b9a67cbd48f
self-contained formulation of subclass command, avoiding hard-wired Named_Target.init
haftmann
parents:
54742
diff
changeset
|
447 |
|> Local_Theory.raw_theory |
7b9a67cbd48f
self-contained formulation of subclass command, avoiding hard-wired Named_Target.init
haftmann
parents:
54742
diff
changeset
|
448 |
(Axclass.add_classrel classrel |
7b9a67cbd48f
self-contained formulation of subclass command, avoiding hard-wired Named_Target.init
haftmann
parents:
54742
diff
changeset
|
449 |
#> Class_Data.map (Graph.add_edge (sub, sup)) |
7b9a67cbd48f
self-contained formulation of subclass command, avoiding hard-wired Named_Target.init
haftmann
parents:
54742
diff
changeset
|
450 |
#> activate_defs sub (these_defs thy diff_sort)) |
7b9a67cbd48f
self-contained formulation of subclass command, avoiding hard-wired Named_Target.init
haftmann
parents:
54742
diff
changeset
|
451 |
|> add_dependency some_witn |
7b9a67cbd48f
self-contained formulation of subclass command, avoiding hard-wired Named_Target.init
haftmann
parents:
54742
diff
changeset
|
452 |
|> synchronize_class_syntax_target sub |
7b9a67cbd48f
self-contained formulation of subclass command, avoiding hard-wired Named_Target.init
haftmann
parents:
54742
diff
changeset
|
453 |
end; |
31635 | 454 |
|
455 |
local |
|
456 |
||
457 |
fun gen_classrel mk_prop classrel thy = |
|
458 |
let |
|
459 |
fun after_qed results = |
|
51685
385ef6706252
more standard module name Axclass (according to file name);
wenzelm
parents:
51578
diff
changeset
|
460 |
Proof_Context.background_theory ((fold o fold) Axclass.add_classrel results); |
31635 | 461 |
in |
462 |
thy |
|
42360 | 463 |
|> Proof_Context.init_global |
36323
655e2d74de3a
modernized naming conventions of main Isar proof elements;
wenzelm
parents:
36106
diff
changeset
|
464 |
|> Proof.theorem NONE after_qed [[(mk_prop thy classrel, [])]] |
31635 | 465 |
end; |
466 |
||
467 |
in |
|
468 |
||
469 |
val classrel = |
|
51685
385ef6706252
more standard module name Axclass (according to file name);
wenzelm
parents:
51578
diff
changeset
|
470 |
gen_classrel (Logic.mk_classrel oo Axclass.cert_classrel); |
31635 | 471 |
val classrel_cmd = |
51685
385ef6706252
more standard module name Axclass (according to file name);
wenzelm
parents:
51578
diff
changeset
|
472 |
gen_classrel (Logic.mk_classrel oo Axclass.read_classrel); |
31635 | 473 |
|
474 |
end; (*local*) |
|
475 |
||
476 |
||
25462 | 477 |
(** instantiation target **) |
478 |
||
479 |
(* bookkeeping *) |
|
480 |
||
481 |
datatype instantiation = Instantiation of { |
|
25864 | 482 |
arities: string list * (string * sort) list * sort, |
25462 | 483 |
params: ((string * string) * (string * typ)) list |
25603 | 484 |
(*(instantiation parameter, type constructor), (local instantiation parameter, typ)*) |
25462 | 485 |
} |
486 |
||
33519 | 487 |
structure Instantiation = Proof_Data |
25462 | 488 |
( |
46919 | 489 |
type T = instantiation; |
490 |
fun init _ = Instantiation {arities = ([], [], []), params = []}; |
|
25462 | 491 |
); |
492 |
||
25485 | 493 |
fun mk_instantiation (arities, params) = |
46919 | 494 |
Instantiation {arities = arities, params = params}; |
495 |
||
496 |
val get_instantiation = |
|
497 |
(fn Instantiation data => data) o Instantiation.get o Local_Theory.target_of; |
|
25462 | 498 |
|
46919 | 499 |
fun map_instantiation f = |
500 |
(Local_Theory.target o Instantiation.map) |
|
501 |
(fn Instantiation {arities, params} => mk_instantiation (f (arities, params))); |
|
502 |
||
503 |
fun the_instantiation lthy = |
|
504 |
(case get_instantiation lthy of |
|
505 |
{arities = ([], [], []), ...} => error "No instantiation target" |
|
506 |
| data => data); |
|
25462 | 507 |
|
25485 | 508 |
val instantiation_params = #params o get_instantiation; |
25462 | 509 |
|
30519
c05c0199826f
coherent binding policy with primitive target operations
haftmann
parents:
30364
diff
changeset
|
510 |
fun instantiation_param lthy b = instantiation_params lthy |
c05c0199826f
coherent binding policy with primitive target operations
haftmann
parents:
30364
diff
changeset
|
511 |
|> find_first (fn (_, (v, _)) => Binding.name_of b = v) |
25462 | 512 |
|> Option.map (fst o fst); |
513 |
||
31869 | 514 |
fun read_multi_arity thy (raw_tycos, raw_sorts, raw_sort) = |
515 |
let |
|
42360 | 516 |
val ctxt = Proof_Context.init_global thy; |
517 |
val all_arities = map (fn raw_tyco => Proof_Context.read_arity ctxt |
|
31869 | 518 |
(raw_tyco, raw_sorts, raw_sort)) raw_tycos; |
519 |
val tycos = map #1 all_arities; |
|
520 |
val (_, sorts, sort) = hd all_arities; |
|
43329
84472e198515
tuned signature: Name.invent and Name.invent_names;
wenzelm
parents:
42402
diff
changeset
|
521 |
val vs = Name.invent_names Name.context Name.aT sorts; |
31869 | 522 |
in (tycos, vs, sort) end; |
523 |
||
25462 | 524 |
|
525 |
(* syntax *) |
|
526 |
||
26238 | 527 |
fun synchronize_inst_syntax ctxt = |
25462 | 528 |
let |
46919 | 529 |
val Instantiation {params, ...} = Instantiation.get ctxt; |
31249 | 530 |
|
51685
385ef6706252
more standard module name Axclass (according to file name);
wenzelm
parents:
51578
diff
changeset
|
531 |
val lookup_inst_param = Axclass.lookup_inst_param |
42360 | 532 |
(Sign.consts_of (Proof_Context.theory_of ctxt)) params; |
46919 | 533 |
fun subst (c, ty) = |
534 |
(case lookup_inst_param (c, ty) of |
|
535 |
SOME (v_ty as (_, ty)) => SOME (ty, Free v_ty) |
|
536 |
| NONE => NONE); |
|
26238 | 537 |
val unchecks = |
538 |
map (fn ((c, _), v_ty as (_, ty)) => (Free v_ty, Const (c, ty))) params; |
|
539 |
in |
|
540 |
ctxt |
|
26259 | 541 |
|> Overloading.map_improvable_syntax |
46919 | 542 |
(fn (((primary_constraints, _), (((improve, _), _), _)), _) => |
543 |
(((primary_constraints, []), (((improve, subst), false), unchecks)), false)) |
|
26238 | 544 |
end; |
25462 | 545 |
|
42385
b46b47775cbe
simplified Sorts.class_error: plain Proof.context;
wenzelm
parents:
42383
diff
changeset
|
546 |
fun resort_terms ctxt algebra consts constraints ts = |
38382 | 547 |
let |
42385
b46b47775cbe
simplified Sorts.class_error: plain Proof.context;
wenzelm
parents:
42383
diff
changeset
|
548 |
fun matchings (Const (c_ty as (c, _))) = |
b46b47775cbe
simplified Sorts.class_error: plain Proof.context;
wenzelm
parents:
42383
diff
changeset
|
549 |
(case constraints c of |
b46b47775cbe
simplified Sorts.class_error: plain Proof.context;
wenzelm
parents:
42383
diff
changeset
|
550 |
NONE => I |
b46b47775cbe
simplified Sorts.class_error: plain Proof.context;
wenzelm
parents:
42383
diff
changeset
|
551 |
| SOME sorts => |
b46b47775cbe
simplified Sorts.class_error: plain Proof.context;
wenzelm
parents:
42383
diff
changeset
|
552 |
fold2 (curry (Sorts.meet_sort algebra)) (Consts.typargs consts c_ty) sorts) |
b46b47775cbe
simplified Sorts.class_error: plain Proof.context;
wenzelm
parents:
42383
diff
changeset
|
553 |
| matchings _ = I; |
38382 | 554 |
val tvartab = (fold o fold_aterms) matchings ts Vartab.empty |
47005
421760a1efe7
maintain generic context naming in structure Name_Space (NB: empty = default_naming, init = local_naming);
wenzelm
parents:
46923
diff
changeset
|
555 |
handle Sorts.CLASS_ERROR e => error (Sorts.class_error (Context.pretty ctxt) e); |
38382 | 556 |
val inst = map_type_tvar |
557 |
(fn (vi, sort) => TVar (vi, the_default sort (Vartab.lookup tvartab vi))); |
|
42402
c7139609b67d
simplified check/uncheck interfaces: result comparison is hardwired by default;
wenzelm
parents:
42388
diff
changeset
|
558 |
in if Vartab.is_empty tvartab then ts else (map o map_types) inst ts end; |
38382 | 559 |
|
25462 | 560 |
|
561 |
(* target *) |
|
562 |
||
47078 | 563 |
fun define_overloaded (c, U) v (b_def, rhs) = |
51685
385ef6706252
more standard module name Axclass (according to file name);
wenzelm
parents:
51578
diff
changeset
|
564 |
Local_Theory.background_theory_result (Axclass.declare_overloaded (c, U) |
385ef6706252
more standard module name Axclass (according to file name);
wenzelm
parents:
51578
diff
changeset
|
565 |
##>> Axclass.define_overloaded b_def (c, rhs)) |
38382 | 566 |
##> (map_instantiation o apsnd) (filter_out (fn (_, (v', _)) => v' = v)) |
47245
ff1770df59b8
Local_Theory.map_contexts with explicit level indication: 0 = main target at bottom;
wenzelm
parents:
47081
diff
changeset
|
567 |
##> Local_Theory.map_contexts (K synchronize_inst_syntax); |
38382 | 568 |
|
47289 | 569 |
fun foundation (((b, U), mx), (b_def, rhs)) params lthy = |
46919 | 570 |
(case instantiation_param lthy b of |
571 |
SOME c => |
|
572 |
if mx <> NoSyn then error ("Illegal mixfix syntax for overloaded constant " ^ quote c) |
|
573 |
else lthy |> define_overloaded (c, U) (Binding.name_of b) (b_def, rhs) |
|
47289 | 574 |
| NONE => lthy |> Generic_Target.theory_foundation (((b, U), mx), (b_def, rhs)) params); |
38382 | 575 |
|
576 |
fun pretty lthy = |
|
26518 | 577 |
let |
46919 | 578 |
val {arities = (tycos, vs, sort), params} = the_instantiation lthy; |
38382 | 579 |
fun pr_arity tyco = Syntax.pretty_arity lthy (tyco, map snd vs, sort); |
580 |
fun pr_param ((c, _), (v, ty)) = |
|
42359 | 581 |
Pretty.block (Pretty.breaks |
55304 | 582 |
[Pretty.str v, Pretty.str "==", Proof_Context.pretty_const lthy c, |
42359 | 583 |
Pretty.str "::", Syntax.pretty_typ lthy ty]); |
55763 | 584 |
in Pretty.keyword1 "instantiation" :: map pr_arity tycos @ map pr_param params end; |
26518 | 585 |
|
38382 | 586 |
fun conclude lthy = |
587 |
let |
|
42359 | 588 |
val (tycos, vs, sort) = #arities (the_instantiation lthy); |
42360 | 589 |
val thy = Proof_Context.theory_of lthy; |
42359 | 590 |
val _ = tycos |> List.app (fn tyco => |
46919 | 591 |
if Sign.of_sort thy (Type (tyco, map TFree vs), sort) then () |
55304 | 592 |
else error ("Missing instance proof for type " ^ quote (Proof_Context.markup_type lthy tyco))); |
38382 | 593 |
in lthy end; |
594 |
||
595 |
fun instantiation (tycos, vs, sort) thy = |
|
25462 | 596 |
let |
47061
355317493f34
clarified Local_Theory.init: avoid hardwired naming policy, discontinued odd/unused group argument (cf. 5ee13e0428d2);
wenzelm
parents:
47005
diff
changeset
|
597 |
val naming = Sign.naming_of thy; |
355317493f34
clarified Local_Theory.init: avoid hardwired naming policy, discontinued odd/unused group argument (cf. 5ee13e0428d2);
wenzelm
parents:
47005
diff
changeset
|
598 |
|
25536 | 599 |
val _ = if null tycos then error "At least one arity must be given" else (); |
51685
385ef6706252
more standard module name Axclass (according to file name);
wenzelm
parents:
51578
diff
changeset
|
600 |
val class_params = these_params thy (filter (can (Axclass.get_info thy)) sort); |
29632
c3d576157244
fixed reading of class specs: declare class operations in context
haftmann
parents:
29610
diff
changeset
|
601 |
fun get_param tyco (param, (_, (c, ty))) = |
51685
385ef6706252
more standard module name Axclass (according to file name);
wenzelm
parents:
51578
diff
changeset
|
602 |
if can (Axclass.param_of_inst thy) (c, tyco) |
25603 | 603 |
then NONE else SOME ((c, tyco), |
46917 | 604 |
(param ^ "_" ^ Long_Name.base_name tyco, map_atyps (K (Type (tyco, map TFree vs))) ty)); |
31249 | 605 |
val params = map_product get_param tycos class_params |> map_filter I; |
51578 | 606 |
val _ = if null params andalso forall (fn tyco => can (Sign.arity_sorts thy tyco) sort) tycos |
607 |
then error "No parameters and no pending instance proof obligations in instantiation." |
|
608 |
else (); |
|
26518 | 609 |
val primary_constraints = map (apsnd |
31249 | 610 |
(map_atyps (K (TVar ((Name.aT, 0), [])))) o snd o snd) class_params; |
26518 | 611 |
val algebra = Sign.classes_of thy |
47005
421760a1efe7
maintain generic context naming in structure Name_Space (NB: empty = default_naming, init = local_naming);
wenzelm
parents:
46923
diff
changeset
|
612 |
|> fold (fn tyco => Sorts.add_arities (Context.pretty_global thy) |
26518 | 613 |
(tyco, map (fn class => (class, map snd vs)) sort)) tycos; |
614 |
val consts = Sign.consts_of thy; |
|
615 |
val improve_constraints = AList.lookup (op =) |
|
31249 | 616 |
(map (fn (_, (class, (c, _))) => (c, [[class]])) class_params); |
42402
c7139609b67d
simplified check/uncheck interfaces: result comparison is hardwired by default;
wenzelm
parents:
42388
diff
changeset
|
617 |
fun resort_check ctxt ts = resort_terms ctxt algebra consts improve_constraints ts; |
51685
385ef6706252
more standard module name Axclass (according to file name);
wenzelm
parents:
51578
diff
changeset
|
618 |
val lookup_inst_param = Axclass.lookup_inst_param consts params; |
42388 | 619 |
fun improve (c, ty) = |
620 |
(case lookup_inst_param (c, ty) of |
|
621 |
SOME (_, ty') => if Sign.typ_instance thy (ty', ty) then SOME (ty, ty') else NONE |
|
622 |
| NONE => NONE); |
|
25485 | 623 |
in |
624 |
thy |
|
56056
4d46d53566e6
more efficient local theory operations, by imposing a linear change discipline on the main types/consts tables, in order to speed-up Proof_Context.transfer_syntax required for Local_Theory.raw_theory_result;
wenzelm
parents:
55763
diff
changeset
|
625 |
|> Sign.change_begin |
42360 | 626 |
|> Proof_Context.init_global |
31249 | 627 |
|> Instantiation.put (mk_instantiation ((tycos, vs, sort), params)) |
27281 | 628 |
|> fold (Variable.declare_typ o TFree) vs |
31249 | 629 |
|> fold (Variable.declare_names o Free o snd) params |
26259 | 630 |
|> (Overloading.map_improvable_syntax o apfst) |
29969
9dbb046136d0
more precise improvement in instantiation user space type system
haftmann
parents:
29632
diff
changeset
|
631 |
(K ((primary_constraints, []), (((improve, K NONE), false), []))) |
39378
df86b1b4ce10
more precise name for activation of improveable syntax
haftmann
parents:
39134
diff
changeset
|
632 |
|> Overloading.activate_improvable_syntax |
45429 | 633 |
|> Context.proof_map (Syntax_Phases.term_check 0 "resorting" resort_check) |
26238 | 634 |
|> synchronize_inst_syntax |
47061
355317493f34
clarified Local_Theory.init: avoid hardwired naming policy, discontinued odd/unused group argument (cf. 5ee13e0428d2);
wenzelm
parents:
47005
diff
changeset
|
635 |
|> Local_Theory.init naming |
38382 | 636 |
{define = Generic_Target.define foundation, |
47250
6523a21076a8
clarified Generic_Target.notes: always perform Attrib.partial_evaluation;
wenzelm
parents:
47245
diff
changeset
|
637 |
notes = Generic_Target.notes Generic_Target.theory_notes, |
47286
392c4cd97e5c
more uniform theory_abbrev with const_declaration;
wenzelm
parents:
47279
diff
changeset
|
638 |
abbrev = Generic_Target.abbrev Generic_Target.theory_abbrev, |
47279
4bab649dedf0
clarified standard_declaration vs. theory_declaration;
wenzelm
parents:
47250
diff
changeset
|
639 |
declaration = K Generic_Target.theory_declaration, |
56723
a8f71445c265
subscription as target-specific implementation device
haftmann
parents:
56334
diff
changeset
|
640 |
subscription = Generic_Target.theory_registration, |
38382 | 641 |
pretty = pretty, |
56056
4d46d53566e6
more efficient local theory operations, by imposing a linear change discipline on the main types/consts tables, in order to speed-up Proof_Context.transfer_syntax required for Local_Theory.raw_theory_result;
wenzelm
parents:
55763
diff
changeset
|
642 |
exit = conclude #> Local_Theory.target_of #> Sign.change_end_local} |
25485 | 643 |
end; |
644 |
||
38382 | 645 |
fun instantiation_cmd arities thy = |
646 |
instantiation (read_multi_arity thy arities) thy; |
|
26238 | 647 |
|
25485 | 648 |
fun gen_instantiation_instance do_proof after_qed lthy = |
649 |
let |
|
25864 | 650 |
val (tycos, vs, sort) = (#arities o the_instantiation) lthy; |
651 |
val arities_proof = maps (fn tyco => Logic.mk_arities (tyco, map snd vs, sort)) tycos; |
|
25462 | 652 |
fun after_qed' results = |
51685
385ef6706252
more standard module name Axclass (according to file name);
wenzelm
parents:
51578
diff
changeset
|
653 |
Local_Theory.background_theory (fold (Axclass.add_arity o Thm.varifyT_global) results) |
25462 | 654 |
#> after_qed; |
655 |
in |
|
656 |
lthy |
|
657 |
|> do_proof after_qed' arities_proof |
|
658 |
end; |
|
659 |
||
25485 | 660 |
val instantiation_instance = gen_instantiation_instance (fn after_qed => fn ts => |
36323
655e2d74de3a
modernized naming conventions of main Isar proof elements;
wenzelm
parents:
36106
diff
changeset
|
661 |
Proof.theorem NONE (after_qed o map the_single) (map (fn t => [(t, [])]) ts)); |
25462 | 662 |
|
25485 | 663 |
fun prove_instantiation_instance tac = gen_instantiation_instance (fn after_qed => |
25502 | 664 |
fn ts => fn lthy => after_qed (map (fn t => Goal.prove lthy [] [] t |
665 |
(fn {context, ...} => tac context)) ts) lthy) I; |
|
25462 | 666 |
|
28666 | 667 |
fun prove_instantiation_exit tac = prove_instantiation_instance tac |
33671 | 668 |
#> Local_Theory.exit_global; |
28666 | 669 |
|
670 |
fun prove_instantiation_exit_result f tac x lthy = |
|
671 |
let |
|
42360 | 672 |
val morph = Proof_Context.export_morphism lthy |
673 |
(Proof_Context.init_global (Proof_Context.theory_of lthy)); |
|
29439 | 674 |
val y = f morph x; |
28666 | 675 |
in |
676 |
lthy |
|
677 |
|> prove_instantiation_exit (fn ctxt => tac ctxt y) |
|
678 |
|> pair y |
|
679 |
end; |
|
680 |
||
29526 | 681 |
|
31635 | 682 |
(* simplified instantiation interface with no class parameter *) |
683 |
||
31869 | 684 |
fun instance_arity_cmd raw_arities thy = |
31635 | 685 |
let |
31869 | 686 |
val (tycos, vs, sort) = read_multi_arity thy raw_arities; |
687 |
val sorts = map snd vs; |
|
688 |
val arities = maps (fn tyco => Logic.mk_arities (tyco, sorts, sort)) tycos; |
|
47078 | 689 |
fun after_qed results = |
51685
385ef6706252
more standard module name Axclass (according to file name);
wenzelm
parents:
51578
diff
changeset
|
690 |
Proof_Context.background_theory ((fold o fold) Axclass.add_arity results); |
31635 | 691 |
in |
692 |
thy |
|
42360 | 693 |
|> Proof_Context.init_global |
36323
655e2d74de3a
modernized naming conventions of main Isar proof elements;
wenzelm
parents:
36106
diff
changeset
|
694 |
|> Proof.theorem NONE after_qed (map (fn t => [(t, [])]) arities) |
31635 | 695 |
end; |
696 |
||
697 |
||
29526 | 698 |
(** tactics and methods **) |
699 |
||
700 |
fun intro_classes_tac facts st = |
|
701 |
let |
|
702 |
val thy = Thm.theory_of_thm st; |
|
703 |
val classes = Sign.all_classes thy; |
|
704 |
val class_trivs = map (Thm.class_triv thy) classes; |
|
51685
385ef6706252
more standard module name Axclass (according to file name);
wenzelm
parents:
51578
diff
changeset
|
705 |
val class_intros = map_filter (try (#intro o Axclass.get_info thy)) classes; |
29526 | 706 |
val assm_intros = all_assm_intros thy; |
707 |
in |
|
708 |
Method.intros_tac (class_trivs @ class_intros @ assm_intros) facts st |
|
709 |
end; |
|
710 |
||
711 |
fun default_intro_tac ctxt [] = |
|
39438
c5ece2a7a86e
Isar "default" step needs to fail for solved problems, for clear distinction of '.' and '..' for example -- amending lapse introduced in 9de4d64eee3b (April 2004);
wenzelm
parents:
39378
diff
changeset
|
712 |
COND Thm.no_prems no_tac |
c5ece2a7a86e
Isar "default" step needs to fail for solved problems, for clear distinction of '.' and '..' for example -- amending lapse introduced in 9de4d64eee3b (April 2004);
wenzelm
parents:
39378
diff
changeset
|
713 |
(intro_classes_tac [] ORELSE Locale.intro_locales_tac true ctxt []) |
29526 | 714 |
| default_intro_tac _ _ = no_tac; |
715 |
||
716 |
fun default_tac rules ctxt facts = |
|
54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
53539
diff
changeset
|
717 |
HEADGOAL (Method.some_rule_tac ctxt rules facts) ORELSE |
29526 | 718 |
default_intro_tac ctxt facts; |
719 |
||
53171 | 720 |
val _ = Theory.setup |
56204 | 721 |
(Method.setup @{binding intro_classes} (Scan.succeed (K (METHOD intro_classes_tac))) |
30515 | 722 |
"back-chain introduction rules of classes" #> |
56204 | 723 |
Method.setup @{binding default} (Attrib.thms >> (METHOD oo default_tac)) |
53171 | 724 |
"apply some intro/elim rule"); |
29526 | 725 |
|
24218 | 726 |
end; |
25683 | 727 |