author  haftmann 
Sat, 31 May 2014 09:35:07 +0200  
changeset 57139  5e9507c002cc 
parent 57119  f6d1f88021be 
child 57140  26df5a93ec27 
permissions  rwrr 
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 
57072
dfac6ef0ca28
moved const declaration further down in bootstrap hierarchy: keep Named_Target free of lowlevel stuff
haftmann
parents:
57070
diff
changeset

21 
val abbrev: class > Syntax.mode > (binding * mixfix) * term > term > 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
selfcontained formulation of subclass command, avoiding hardwired 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; nonqualified 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 userspace 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; nonqualified 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; nonqualified 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; nonqualified 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; nonqualified 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 

25368
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

230 
fun register_operation class (c, (t, some_def)) 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; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

236 
val t' = map_types prep_typ t; 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

237 
val ty' = Term.fastype_of t'; 
25062  238 
in 
239 
thy 

46919  240 
> (Class_Data.map o Graph.map_node class o map_class_data o apsnd) 
25368
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

241 
(fn (defs, operations) => 
25096  242 
(fold cons (the_list some_def) defs, 
25368
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

243 
(c, (class, (ty', t'))) :: operations)) 
36674
d95f39448121
eq_morphism is always optional: avoid trivial morphism for empty list of equations
haftmann
parents:
36672
diff
changeset

244 
> activate_defs class (the_list some_def) 
25062  245 
end; 
24218  246 

247 

24589  248 
(** classes and class target **) 
24218  249 

25002  250 
(* class context syntax *) 
24748  251 

35858
0d394a82337e
handle hidden polymorphism in class target (without class target syntax, though)
haftmann
parents:
35845
diff
changeset

252 
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

253 
o these_operations thy; 
29577  254 

29632
c3d576157244
fixed reading of class specs: declare class operations in context
haftmann
parents:
29610
diff
changeset

255 
fun redeclare_const thy c = 
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30344
diff
changeset

256 
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

257 
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

258 

29577  259 
fun synchronize_class_syntax sort base_sort ctxt = 
24914
95cda5dd58d5
added proper subclass concept; improved class target
haftmann
parents:
24901
diff
changeset

260 
let 
42360  261 
val thy = Proof_Context.theory_of ctxt; 
26596  262 
val algebra = Sign.classes_of thy; 
29577  263 
val operations = these_operations thy sort; 
26518  264 
fun subst_class_typ sort = map_type_tfree (K (TVar ((Name.aT, 0), sort))); 
265 
val primary_constraints = 

25368
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

266 
(map o apsnd) (subst_class_typ base_sort o fst o snd) operations; 
26518  267 
val secondary_constraints = 
25368
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

268 
(map o apsnd) (fn (class, (ty, _)) => subst_class_typ [class] ty) operations; 
46919  269 
fun improve (c, ty) = 
270 
(case AList.lookup (op =) primary_constraints c of 

271 
SOME ty' => 

272 
(case try (Type.raw_match (ty', ty)) Vartab.empty of 

273 
SOME tyenv => 

274 
(case Vartab.lookup tyenv (Name.aT, 0) of 

275 
SOME (_, ty' as TVar (vi, sort)) => 

276 
if Type_Infer.is_param vi andalso Sorts.sort_le algebra (base_sort, sort) 

277 
then SOME (ty', TFree (Name.aT, base_sort)) 

278 
else NONE 

26238  279 
 _ => NONE) 
280 
 NONE => NONE) 

46919  281 
 NONE => NONE); 
47005
421760a1efe7
maintain generic context naming in structure Name_Space (NB: empty = default_naming, init = local_naming);
wenzelm
parents:
46923
diff
changeset

282 
fun subst (c, _) = Option.map snd (AList.lookup (op =) operations c); 
29577  283 
val unchecks = these_unchecks thy sort; 
25083  284 
in 
285 
ctxt 

29632
c3d576157244
fixed reading of class specs: declare class operations in context
haftmann
parents:
29610
diff
changeset

286 
> fold (redeclare_const thy o fst) primary_constraints 
26518  287 
> Overloading.map_improvable_syntax (K (((primary_constraints, secondary_constraints), 
26730  288 
(((improve, subst), true), unchecks)), false)) 
26518  289 
> Overloading.set_primary_constraints 
25083  290 
end; 
291 

54866
7b9a67cbd48f
selfcontained formulation of subclass command, avoiding hardwired Named_Target.init
haftmann
parents:
54742
diff
changeset

292 
fun synchronize_class_syntax_target class lthy = 
7b9a67cbd48f
selfcontained formulation of subclass command, avoiding hardwired Named_Target.init
haftmann
parents:
54742
diff
changeset

293 
lthy 
7b9a67cbd48f
selfcontained formulation of subclass command, avoiding hardwired Named_Target.init
haftmann
parents:
54742
diff
changeset

294 
> Local_Theory.map_contexts 
7b9a67cbd48f
selfcontained formulation of subclass command, avoiding hardwired Named_Target.init
haftmann
parents:
54742
diff
changeset

295 
(K (synchronize_class_syntax [class] (base_sort (Proof_Context.theory_of lthy) class))); 
7b9a67cbd48f
selfcontained formulation of subclass command, avoiding hardwired Named_Target.init
haftmann
parents:
54742
diff
changeset

296 

29632
c3d576157244
fixed reading of class specs: declare class operations in context
haftmann
parents:
29610
diff
changeset

297 
fun redeclare_operations thy sort = 
c3d576157244
fixed reading of class specs: declare class operations in context
haftmann
parents:
29610
diff
changeset

298 
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

299 

29577  300 
fun begin sort base_sort ctxt = 
25083  301 
ctxt 
302 
> Variable.declare_term 

303 
(Logic.mk_type (TFree (Name.aT, base_sort))) 

29577  304 
> synchronize_class_syntax sort base_sort 
39378
df86b1b4ce10
more precise name for activation of improveable syntax
haftmann
parents:
39134
diff
changeset

305 
> Overloading.activate_improvable_syntax; 
24901
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

306 

25311  307 
fun init class thy = 
308 
thy 

29509
1ff0f3f08a7b
migrated class package to new locale implementation
haftmann
parents:
29439
diff
changeset

309 
> Locale.init class 
29358  310 
> begin [class] (base_sort thy class); 
24914
95cda5dd58d5
added proper subclass concept; improved class target
haftmann
parents:
24901
diff
changeset

311 

24748  312 

27690
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

313 
(* class target *) 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

314 

30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30344
diff
changeset

315 
val class_prefix = Logic.const_of_class o Long_Name.base_name; 
29526  316 

47078  317 
local 
318 

57119  319 
fun target_extension f class b_mx_rhs = 
320 
Local_Theory.raw_theory (fn thy => f class (morphism thy class) b_mx_rhs thy) 

321 
#> synchronize_class_syntax_target class; 

38619
25e401d53900
tuned: less formal noise in Named_Target, more coherence in Class
haftmann
parents:
38392
diff
changeset

322 

57074  323 
fun class_const class prmode (b, rhs) = 
57072
dfac6ef0ca28
moved const declaration further down in bootstrap hierarchy: keep Named_Target free of lowlevel stuff
haftmann
parents:
57070
diff
changeset

324 
Generic_Target.locale_declaration class true (fn phi => 
dfac6ef0ca28
moved const declaration further down in bootstrap hierarchy: keep Named_Target free of lowlevel stuff
haftmann
parents:
57070
diff
changeset

325 
let 
dfac6ef0ca28
moved const declaration further down in bootstrap hierarchy: keep Named_Target free of lowlevel stuff
haftmann
parents:
57070
diff
changeset

326 
val b' = Morphism.binding phi b; 
dfac6ef0ca28
moved const declaration further down in bootstrap hierarchy: keep Named_Target free of lowlevel stuff
haftmann
parents:
57070
diff
changeset

327 
val rhs' = Morphism.term phi rhs; 
dfac6ef0ca28
moved const declaration further down in bootstrap hierarchy: keep Named_Target free of lowlevel stuff
haftmann
parents:
57070
diff
changeset

328 
val same_shape = Term.aconv_untyped (rhs, rhs'); 
dfac6ef0ca28
moved const declaration further down in bootstrap hierarchy: keep Named_Target free of lowlevel stuff
haftmann
parents:
57070
diff
changeset

329 

dfac6ef0ca28
moved const declaration further down in bootstrap hierarchy: keep Named_Target free of lowlevel stuff
haftmann
parents:
57070
diff
changeset

330 
(* FIXME workaround based on educated guess *) 
dfac6ef0ca28
moved const declaration further down in bootstrap hierarchy: keep Named_Target free of lowlevel stuff
haftmann
parents:
57070
diff
changeset

331 
val prefix' = Binding.prefix_of b'; 
dfac6ef0ca28
moved const declaration further down in bootstrap hierarchy: keep Named_Target free of lowlevel stuff
haftmann
parents:
57070
diff
changeset

332 
val is_canonical_class = 
dfac6ef0ca28
moved const declaration further down in bootstrap hierarchy: keep Named_Target free of lowlevel stuff
haftmann
parents:
57070
diff
changeset

333 
Binding.eq_name (b, b') 
dfac6ef0ca28
moved const declaration further down in bootstrap hierarchy: keep Named_Target free of lowlevel stuff
haftmann
parents:
57070
diff
changeset

334 
andalso not (null prefix') 
dfac6ef0ca28
moved const declaration further down in bootstrap hierarchy: keep Named_Target free of lowlevel stuff
haftmann
parents:
57070
diff
changeset

335 
andalso List.last prefix' = (class_prefix class, false) 
dfac6ef0ca28
moved const declaration further down in bootstrap hierarchy: keep Named_Target free of lowlevel stuff
haftmann
parents:
57070
diff
changeset

336 
orelse same_shape; 
dfac6ef0ca28
moved const declaration further down in bootstrap hierarchy: keep Named_Target free of lowlevel stuff
haftmann
parents:
57070
diff
changeset

337 
in 
dfac6ef0ca28
moved const declaration further down in bootstrap hierarchy: keep Named_Target free of lowlevel stuff
haftmann
parents:
57070
diff
changeset

338 
not is_canonical_class ? Generic_Target.generic_const same_shape prmode ((b', NoSyn), rhs') 
dfac6ef0ca28
moved const declaration further down in bootstrap hierarchy: keep Named_Target free of lowlevel stuff
haftmann
parents:
57070
diff
changeset

339 
end) #> 
57074  340 
Generic_Target.const (fn (this, other) => other <> 0 andalso this <> other) prmode ((b, NoSyn), rhs); 
57072
dfac6ef0ca28
moved const declaration further down in bootstrap hierarchy: keep Named_Target free of lowlevel stuff
haftmann
parents:
57070
diff
changeset

341 

57119  342 
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

343 
let 
57119  344 
val class_param_names = 
345 
map fst (these_params (Proof_Context.theory_of lthy) [class]); 

346 
val dangling_term_params = 

347 
subtract (fn (v, Free (w, _)) => v = w  _ => false) class_param_names term_params; 

348 
in type_params @ dangling_term_params end; 

349 

350 
fun global_def (b, eq) thy = 

351 
thy 

352 
> Thm.add_def_global false false (b, eq) 

353 
>> (Thm.varifyT_global o snd) 

354 
> (fn def_thm => Global_Theory.store_thm (b, def_thm) 

355 
#> snd 

356 
#> pair def_thm); 

357 

358 
fun global_const dangling_params class phi ((b, mx), rhs) thy = 

359 
let 

360 
val dangling_params' = map (Morphism.term phi) dangling_params; 

57070  361 
val b' = Morphism.binding phi b; 
57139
5e9507c002cc
dropped accidental duplicate application of morphism
haftmann
parents:
57119
diff
changeset

362 
val b_def = Binding.suffix_name "_dict" b'; 
57119  363 
val rhs' = Morphism.term phi rhs; 
57069  364 
val c' = Sign.full_name thy b'; 
57119  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 
57069  370 
> Sign.declare_const_global ((b', Type.strip_sorts ty'), mx) 
29577  371 
> snd 
57119  372 
> global_def (b_def, def_eq) 
373 
> (fn def_thm => 

374 
null dangling_params' ? register_operation class (c', (rhs', SOME (Thm.symmetric def_thm)))) 

27690
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

375 
> Sign.add_const_constraint (c', SOME ty') 
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 

57074  378 
fun global_abbrev prmode class phi ((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]; 
57070  381 
val b' = Morphism.binding phi b; 
57119  382 
val rhs' = Pattern.rewrite_term thy unchecks [] rhs; 
57069  383 
val c' = Sign.full_name thy b'; 
27690
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

384 
val ty' = Term.fastype_of rhs'; 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

385 
in 
29577  386 
thy 
57069  387 
> Sign.add_abbrev (#1 prmode) (b', Logic.varify_types_global rhs') 
29577  388 
> snd 
27690
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

389 
> Sign.notation true prmode [(Const (c', ty'), mx)] 
37146
f652333bbf8e
renamed structure PrintMode to Print_Mode, keeping the old name as legacy alias for some time;
wenzelm
parents:
37145
diff
changeset

390 
> not (#1 prmode = Print_Mode.input) ? register_operation class (c', (rhs', NONE)) 
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 

398 
val dangling_params = dangling_params_for lthy class params; 

399 
in 

400 
lthy 

401 
> class_const class Syntax.mode_default (b, lhs) 

402 
> target_extension (global_const dangling_params) class ((b, mx), lhs) 

403 
end; 

57072
dfac6ef0ca28
moved const declaration further down in bootstrap hierarchy: keep Named_Target free of lowlevel stuff
haftmann
parents:
57070
diff
changeset

404 

57109  405 
fun abbrev class prmode ((b, mx), lhs) rhs' = 
57074  406 
class_const class prmode (b, lhs) 
57109  407 
#> target_extension (global_abbrev prmode) class ((b, mx), rhs'); 
38619
25e401d53900
tuned: less formal noise in Named_Target, more coherence in Class
haftmann
parents:
38392
diff
changeset

408 

25e401d53900
tuned: less formal noise in Named_Target, more coherence in Class
haftmann
parents:
38392
diff
changeset

409 
end; 
25e401d53900
tuned: less formal noise in Named_Target, more coherence in Class
haftmann
parents:
38392
diff
changeset

410 

27690
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

411 

54866
7b9a67cbd48f
selfcontained formulation of subclass command, avoiding hardwired Named_Target.init
haftmann
parents:
54742
diff
changeset

412 
(* subclasses *) 
7b9a67cbd48f
selfcontained formulation of subclass command, avoiding hardwired Named_Target.init
haftmann
parents:
54742
diff
changeset

413 

7b9a67cbd48f
selfcontained formulation of subclass command, avoiding hardwired Named_Target.init
haftmann
parents:
54742
diff
changeset

414 
fun register_subclass (sub, sup) some_dep_morph some_witn export lthy = 
7b9a67cbd48f
selfcontained formulation of subclass command, avoiding hardwired Named_Target.init
haftmann
parents:
54742
diff
changeset

415 
let 
7b9a67cbd48f
selfcontained formulation of subclass command, avoiding hardwired Named_Target.init
haftmann
parents:
54742
diff
changeset

416 
val thy = Proof_Context.theory_of lthy; 
7b9a67cbd48f
selfcontained formulation of subclass command, avoiding hardwired Named_Target.init
haftmann
parents:
54742
diff
changeset

417 
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

418 
[Option.map (Drule.export_without_context_open o Element.conclude_witness lthy) some_witn, 
54866
7b9a67cbd48f
selfcontained formulation of subclass command, avoiding hardwired Named_Target.init
haftmann
parents:
54742
diff
changeset

419 
(fst o rules thy) sub]; 
7b9a67cbd48f
selfcontained formulation of subclass command, avoiding hardwired Named_Target.init
haftmann
parents:
54742
diff
changeset

420 
val classrel = 
7b9a67cbd48f
selfcontained formulation of subclass command, avoiding hardwired Named_Target.init
haftmann
parents:
54742
diff
changeset

421 
Goal.prove_sorry_global thy [] [] (Logic.mk_classrel (sub, sup)) 
7b9a67cbd48f
selfcontained formulation of subclass command, avoiding hardwired Named_Target.init
haftmann
parents:
54742
diff
changeset

422 
(K (EVERY (map (TRYALL o rtac) intros))); 
7b9a67cbd48f
selfcontained formulation of subclass command, avoiding hardwired Named_Target.init
haftmann
parents:
54742
diff
changeset

423 
val diff_sort = Sign.complete_sort thy [sup] 
7b9a67cbd48f
selfcontained formulation of subclass command, avoiding hardwired Named_Target.init
haftmann
parents:
54742
diff
changeset

424 
> subtract (op =) (Sign.complete_sort thy [sub]) 
7b9a67cbd48f
selfcontained formulation of subclass command, avoiding hardwired Named_Target.init
haftmann
parents:
54742
diff
changeset

425 
> filter (is_class thy); 
7b9a67cbd48f
selfcontained formulation of subclass command, avoiding hardwired Named_Target.init
haftmann
parents:
54742
diff
changeset

426 
fun add_dependency some_wit = case some_dep_morph of 
7b9a67cbd48f
selfcontained formulation of subclass command, avoiding hardwired Named_Target.init
haftmann
parents:
54742
diff
changeset

427 
SOME dep_morph => Generic_Target.locale_dependency sub 
7b9a67cbd48f
selfcontained formulation of subclass command, avoiding hardwired Named_Target.init
haftmann
parents:
54742
diff
changeset

428 
(sup, dep_morph $> Element.satisfy_morphism (the_list some_witn)) NONE export 
7b9a67cbd48f
selfcontained formulation of subclass command, avoiding hardwired Named_Target.init
haftmann
parents:
54742
diff
changeset

429 
 NONE => I; 
7b9a67cbd48f
selfcontained formulation of subclass command, avoiding hardwired Named_Target.init
haftmann
parents:
54742
diff
changeset

430 
in 
7b9a67cbd48f
selfcontained formulation of subclass command, avoiding hardwired Named_Target.init
haftmann
parents:
54742
diff
changeset

431 
lthy 
7b9a67cbd48f
selfcontained formulation of subclass command, avoiding hardwired Named_Target.init
haftmann
parents:
54742
diff
changeset

432 
> Local_Theory.raw_theory 
7b9a67cbd48f
selfcontained formulation of subclass command, avoiding hardwired Named_Target.init
haftmann
parents:
54742
diff
changeset

433 
(Axclass.add_classrel classrel 
7b9a67cbd48f
selfcontained formulation of subclass command, avoiding hardwired Named_Target.init
haftmann
parents:
54742
diff
changeset

434 
#> Class_Data.map (Graph.add_edge (sub, sup)) 
7b9a67cbd48f
selfcontained formulation of subclass command, avoiding hardwired Named_Target.init
haftmann
parents:
54742
diff
changeset

435 
#> activate_defs sub (these_defs thy diff_sort)) 
7b9a67cbd48f
selfcontained formulation of subclass command, avoiding hardwired Named_Target.init
haftmann
parents:
54742
diff
changeset

436 
> add_dependency some_witn 
7b9a67cbd48f
selfcontained formulation of subclass command, avoiding hardwired Named_Target.init
haftmann
parents:
54742
diff
changeset

437 
> synchronize_class_syntax_target sub 
7b9a67cbd48f
selfcontained formulation of subclass command, avoiding hardwired Named_Target.init
haftmann
parents:
54742
diff
changeset

438 
end; 
31635  439 

440 
local 

441 

442 
fun gen_classrel mk_prop classrel thy = 

443 
let 

444 
fun after_qed results = 

51685
385ef6706252
more standard module name Axclass (according to file name);
wenzelm
parents:
51578
diff
changeset

445 
Proof_Context.background_theory ((fold o fold) Axclass.add_classrel results); 
31635  446 
in 
447 
thy 

42360  448 
> Proof_Context.init_global 
36323
655e2d74de3a
modernized naming conventions of main Isar proof elements;
wenzelm
parents:
36106
diff
changeset

449 
> Proof.theorem NONE after_qed [[(mk_prop thy classrel, [])]] 
31635  450 
end; 
451 

452 
in 

453 

454 
val classrel = 

51685
385ef6706252
more standard module name Axclass (according to file name);
wenzelm
parents:
51578
diff
changeset

455 
gen_classrel (Logic.mk_classrel oo Axclass.cert_classrel); 
31635  456 
val classrel_cmd = 
51685
385ef6706252
more standard module name Axclass (according to file name);
wenzelm
parents:
51578
diff
changeset

457 
gen_classrel (Logic.mk_classrel oo Axclass.read_classrel); 
31635  458 

459 
end; (*local*) 

460 

461 

25462  462 
(** instantiation target **) 
463 

464 
(* bookkeeping *) 

465 

466 
datatype instantiation = Instantiation of { 

25864  467 
arities: string list * (string * sort) list * sort, 
25462  468 
params: ((string * string) * (string * typ)) list 
25603  469 
(*(instantiation parameter, type constructor), (local instantiation parameter, typ)*) 
25462  470 
} 
471 

33519  472 
structure Instantiation = Proof_Data 
25462  473 
( 
46919  474 
type T = instantiation; 
475 
fun init _ = Instantiation {arities = ([], [], []), params = []}; 

25462  476 
); 
477 

25485  478 
fun mk_instantiation (arities, params) = 
46919  479 
Instantiation {arities = arities, params = params}; 
480 

481 
val get_instantiation = 

482 
(fn Instantiation data => data) o Instantiation.get o Local_Theory.target_of; 

25462  483 

46919  484 
fun map_instantiation f = 
485 
(Local_Theory.target o Instantiation.map) 

486 
(fn Instantiation {arities, params} => mk_instantiation (f (arities, params))); 

487 

488 
fun the_instantiation lthy = 

489 
(case get_instantiation lthy of 

490 
{arities = ([], [], []), ...} => error "No instantiation target" 

491 
 data => data); 

25462  492 

25485  493 
val instantiation_params = #params o get_instantiation; 
25462  494 

30519
c05c0199826f
coherent binding policy with primitive target operations
haftmann
parents:
30364
diff
changeset

495 
fun instantiation_param lthy b = instantiation_params lthy 
c05c0199826f
coherent binding policy with primitive target operations
haftmann
parents:
30364
diff
changeset

496 
> find_first (fn (_, (v, _)) => Binding.name_of b = v) 
25462  497 
> Option.map (fst o fst); 
498 

31869  499 
fun read_multi_arity thy (raw_tycos, raw_sorts, raw_sort) = 
500 
let 

42360  501 
val ctxt = Proof_Context.init_global thy; 
502 
val all_arities = map (fn raw_tyco => Proof_Context.read_arity ctxt 

31869  503 
(raw_tyco, raw_sorts, raw_sort)) raw_tycos; 
504 
val tycos = map #1 all_arities; 

505 
val (_, sorts, sort) = hd all_arities; 

43329
84472e198515
tuned signature: Name.invent and Name.invent_names;
wenzelm
parents:
42402
diff
changeset

506 
val vs = Name.invent_names Name.context Name.aT sorts; 
31869  507 
in (tycos, vs, sort) end; 
508 

25462  509 

510 
(* syntax *) 

511 

26238  512 
fun synchronize_inst_syntax ctxt = 
25462  513 
let 
46919  514 
val Instantiation {params, ...} = Instantiation.get ctxt; 
31249  515 

51685
385ef6706252
more standard module name Axclass (according to file name);
wenzelm
parents:
51578
diff
changeset

516 
val lookup_inst_param = Axclass.lookup_inst_param 
42360  517 
(Sign.consts_of (Proof_Context.theory_of ctxt)) params; 
46919  518 
fun subst (c, ty) = 
519 
(case lookup_inst_param (c, ty) of 

520 
SOME (v_ty as (_, ty)) => SOME (ty, Free v_ty) 

521 
 NONE => NONE); 

26238  522 
val unchecks = 
523 
map (fn ((c, _), v_ty as (_, ty)) => (Free v_ty, Const (c, ty))) params; 

524 
in 

525 
ctxt 

26259  526 
> Overloading.map_improvable_syntax 
46919  527 
(fn (((primary_constraints, _), (((improve, _), _), _)), _) => 
528 
(((primary_constraints, []), (((improve, subst), false), unchecks)), false)) 

26238  529 
end; 
25462  530 

42385
b46b47775cbe
simplified Sorts.class_error: plain Proof.context;
wenzelm
parents:
42383
diff
changeset

531 
fun resort_terms ctxt algebra consts constraints ts = 
38382  532 
let 
42385
b46b47775cbe
simplified Sorts.class_error: plain Proof.context;
wenzelm
parents:
42383
diff
changeset

533 
fun matchings (Const (c_ty as (c, _))) = 
b46b47775cbe
simplified Sorts.class_error: plain Proof.context;
wenzelm
parents:
42383
diff
changeset

534 
(case constraints c of 
b46b47775cbe
simplified Sorts.class_error: plain Proof.context;
wenzelm
parents:
42383
diff
changeset

535 
NONE => I 
b46b47775cbe
simplified Sorts.class_error: plain Proof.context;
wenzelm
parents:
42383
diff
changeset

536 
 SOME sorts => 
b46b47775cbe
simplified Sorts.class_error: plain Proof.context;
wenzelm
parents:
42383
diff
changeset

537 
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

538 
 matchings _ = I; 
38382  539 
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

540 
handle Sorts.CLASS_ERROR e => error (Sorts.class_error (Context.pretty ctxt) e); 
38382  541 
val inst = map_type_tvar 
542 
(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

543 
in if Vartab.is_empty tvartab then ts else (map o map_types) inst ts end; 
38382  544 

25462  545 

546 
(* target *) 

547 

47078  548 
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

549 
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

550 
##>> Axclass.define_overloaded b_def (c, rhs)) 
38382  551 
##> (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

552 
##> Local_Theory.map_contexts (K synchronize_inst_syntax); 
38382  553 

47289  554 
fun foundation (((b, U), mx), (b_def, rhs)) params lthy = 
46919  555 
(case instantiation_param lthy b of 
556 
SOME c => 

557 
if mx <> NoSyn then error ("Illegal mixfix syntax for overloaded constant " ^ quote c) 

558 
else lthy > define_overloaded (c, U) (Binding.name_of b) (b_def, rhs) 

47289  559 
 NONE => lthy > Generic_Target.theory_foundation (((b, U), mx), (b_def, rhs)) params); 
38382  560 

561 
fun pretty lthy = 

26518  562 
let 
46919  563 
val {arities = (tycos, vs, sort), params} = the_instantiation lthy; 
38382  564 
fun pr_arity tyco = Syntax.pretty_arity lthy (tyco, map snd vs, sort); 
565 
fun pr_param ((c, _), (v, ty)) = 

42359  566 
Pretty.block (Pretty.breaks 
55304  567 
[Pretty.str v, Pretty.str "==", Proof_Context.pretty_const lthy c, 
42359  568 
Pretty.str "::", Syntax.pretty_typ lthy ty]); 
55763  569 
in Pretty.keyword1 "instantiation" :: map pr_arity tycos @ map pr_param params end; 
26518  570 

38382  571 
fun conclude lthy = 
572 
let 

42359  573 
val (tycos, vs, sort) = #arities (the_instantiation lthy); 
42360  574 
val thy = Proof_Context.theory_of lthy; 
42359  575 
val _ = tycos > List.app (fn tyco => 
46919  576 
if Sign.of_sort thy (Type (tyco, map TFree vs), sort) then () 
55304  577 
else error ("Missing instance proof for type " ^ quote (Proof_Context.markup_type lthy tyco))); 
38382  578 
in lthy end; 
579 

580 
fun instantiation (tycos, vs, sort) thy = 

25462  581 
let 
47061
355317493f34
clarified Local_Theory.init: avoid hardwired naming policy, discontinued odd/unused group argument (cf. 5ee13e0428d2);
wenzelm
parents:
47005
diff
changeset

582 
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

583 

25536  584 
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

585 
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

586 
fun get_param tyco (param, (_, (c, ty))) = 
51685
385ef6706252
more standard module name Axclass (according to file name);
wenzelm
parents:
51578
diff
changeset

587 
if can (Axclass.param_of_inst thy) (c, tyco) 
25603  588 
then NONE else SOME ((c, tyco), 
46917  589 
(param ^ "_" ^ Long_Name.base_name tyco, map_atyps (K (Type (tyco, map TFree vs))) ty)); 
31249  590 
val params = map_product get_param tycos class_params > map_filter I; 
51578  591 
val _ = if null params andalso forall (fn tyco => can (Sign.arity_sorts thy tyco) sort) tycos 
592 
then error "No parameters and no pending instance proof obligations in instantiation." 

593 
else (); 

26518  594 
val primary_constraints = map (apsnd 
31249  595 
(map_atyps (K (TVar ((Name.aT, 0), [])))) o snd o snd) class_params; 
26518  596 
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

597 
> fold (fn tyco => Sorts.add_arities (Context.pretty_global thy) 
26518  598 
(tyco, map (fn class => (class, map snd vs)) sort)) tycos; 
599 
val consts = Sign.consts_of thy; 

600 
val improve_constraints = AList.lookup (op =) 

31249  601 
(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

602 
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

603 
val lookup_inst_param = Axclass.lookup_inst_param consts params; 
42388  604 
fun improve (c, ty) = 
605 
(case lookup_inst_param (c, ty) of 

606 
SOME (_, ty') => if Sign.typ_instance thy (ty', ty) then SOME (ty, ty') else NONE 

607 
 NONE => NONE); 

25485  608 
in 
609 
thy 

56056
4d46d53566e6
more efficient local theory operations, by imposing a linear change discipline on the main types/consts tables, in order to speedup Proof_Context.transfer_syntax required for Local_Theory.raw_theory_result;
wenzelm
parents:
55763
diff
changeset

610 
> Sign.change_begin 
42360  611 
> Proof_Context.init_global 
31249  612 
> Instantiation.put (mk_instantiation ((tycos, vs, sort), params)) 
27281  613 
> fold (Variable.declare_typ o TFree) vs 
31249  614 
> fold (Variable.declare_names o Free o snd) params 
26259  615 
> (Overloading.map_improvable_syntax o apfst) 
29969
9dbb046136d0
more precise improvement in instantiation user space type system
haftmann
parents:
29632
diff
changeset

616 
(K ((primary_constraints, []), (((improve, K NONE), false), []))) 
39378
df86b1b4ce10
more precise name for activation of improveable syntax
haftmann
parents:
39134
diff
changeset

617 
> Overloading.activate_improvable_syntax 
45429  618 
> Context.proof_map (Syntax_Phases.term_check 0 "resorting" resort_check) 
26238  619 
> 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

620 
> Local_Theory.init naming 
38382  621 
{define = Generic_Target.define foundation, 
47250
6523a21076a8
clarified Generic_Target.notes: always perform Attrib.partial_evaluation;
wenzelm
parents:
47245
diff
changeset

622 
notes = Generic_Target.notes Generic_Target.theory_notes, 
47286
392c4cd97e5c
more uniform theory_abbrev with const_declaration;
wenzelm
parents:
47279
diff
changeset

623 
abbrev = Generic_Target.abbrev Generic_Target.theory_abbrev, 
47279
4bab649dedf0
clarified standard_declaration vs. theory_declaration;
wenzelm
parents:
47250
diff
changeset

624 
declaration = K Generic_Target.theory_declaration, 
56723
a8f71445c265
subscription as targetspecific implementation device
haftmann
parents:
56334
diff
changeset

625 
subscription = Generic_Target.theory_registration, 
38382  626 
pretty = pretty, 
56056
4d46d53566e6
more efficient local theory operations, by imposing a linear change discipline on the main types/consts tables, in order to speedup Proof_Context.transfer_syntax required for Local_Theory.raw_theory_result;
wenzelm
parents:
55763
diff
changeset

627 
exit = conclude #> Local_Theory.target_of #> Sign.change_end_local} 
25485  628 
end; 
629 

38382  630 
fun instantiation_cmd arities thy = 
631 
instantiation (read_multi_arity thy arities) thy; 

26238  632 

25485  633 
fun gen_instantiation_instance do_proof after_qed lthy = 
634 
let 

25864  635 
val (tycos, vs, sort) = (#arities o the_instantiation) lthy; 
636 
val arities_proof = maps (fn tyco => Logic.mk_arities (tyco, map snd vs, sort)) tycos; 

25462  637 
fun after_qed' results = 
51685
385ef6706252
more standard module name Axclass (according to file name);
wenzelm
parents:
51578
diff
changeset

638 
Local_Theory.background_theory (fold (Axclass.add_arity o Thm.varifyT_global) results) 
25462  639 
#> after_qed; 
640 
in 

641 
lthy 

642 
> do_proof after_qed' arities_proof 

643 
end; 

644 

25485  645 
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

646 
Proof.theorem NONE (after_qed o map the_single) (map (fn t => [(t, [])]) ts)); 
25462  647 

25485  648 
fun prove_instantiation_instance tac = gen_instantiation_instance (fn after_qed => 
25502  649 
fn ts => fn lthy => after_qed (map (fn t => Goal.prove lthy [] [] t 
650 
(fn {context, ...} => tac context)) ts) lthy) I; 

25462  651 

28666  652 
fun prove_instantiation_exit tac = prove_instantiation_instance tac 
33671  653 
#> Local_Theory.exit_global; 
28666  654 

655 
fun prove_instantiation_exit_result f tac x lthy = 

656 
let 

42360  657 
val morph = Proof_Context.export_morphism lthy 
658 
(Proof_Context.init_global (Proof_Context.theory_of lthy)); 

29439  659 
val y = f morph x; 
28666  660 
in 
661 
lthy 

662 
> prove_instantiation_exit (fn ctxt => tac ctxt y) 

663 
> pair y 

664 
end; 

665 

29526  666 

31635  667 
(* simplified instantiation interface with no class parameter *) 
668 

31869  669 
fun instance_arity_cmd raw_arities thy = 
31635  670 
let 
31869  671 
val (tycos, vs, sort) = read_multi_arity thy raw_arities; 
672 
val sorts = map snd vs; 

673 
val arities = maps (fn tyco => Logic.mk_arities (tyco, sorts, sort)) tycos; 

47078  674 
fun after_qed results = 
51685
385ef6706252
more standard module name Axclass (according to file name);
wenzelm
parents:
51578
diff
changeset

675 
Proof_Context.background_theory ((fold o fold) Axclass.add_arity results); 
31635  676 
in 
677 
thy 

42360  678 
> Proof_Context.init_global 
36323
655e2d74de3a
modernized naming conventions of main Isar proof elements;
wenzelm
parents:
36106
diff
changeset

679 
> Proof.theorem NONE after_qed (map (fn t => [(t, [])]) arities) 
31635  680 
end; 
681 

682 

29526  683 
(** tactics and methods **) 
684 

685 
fun intro_classes_tac facts st = 

686 
let 

687 
val thy = Thm.theory_of_thm st; 

688 
val classes = Sign.all_classes thy; 

689 
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

690 
val class_intros = map_filter (try (#intro o Axclass.get_info thy)) classes; 
29526  691 
val assm_intros = all_assm_intros thy; 
692 
in 

693 
Method.intros_tac (class_trivs @ class_intros @ assm_intros) facts st 

694 
end; 

695 

696 
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

697 
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

698 
(intro_classes_tac [] ORELSE Locale.intro_locales_tac true ctxt []) 
29526  699 
 default_intro_tac _ _ = no_tac; 
700 

701 
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

702 
HEADGOAL (Method.some_rule_tac ctxt rules facts) ORELSE 
29526  703 
default_intro_tac ctxt facts; 
704 

53171  705 
val _ = Theory.setup 
56204  706 
(Method.setup @{binding intro_classes} (Scan.succeed (K (METHOD intro_classes_tac))) 
30515  707 
"backchain introduction rules of classes" #> 
56204  708 
Method.setup @{binding default} (Attrib.thms >> (METHOD oo default_tac)) 
53171  709 
"apply some intro/elim rule"); 
29526  710 

24218  711 
end; 
25683  712 