author  haftmann 
Tue, 29 Jul 2008 08:15:39 +0200  
changeset 27690  24738db98d34 
parent 27684  f45fd1159a4b 
child 27708  7471449b9695 
permissions  rwrr 
24218  1 
(* Title: Pure/Isar/class.ML 
2 
ID: $Id$ 

3 
Author: Florian Haftmann, TU Muenchen 

4 

5 
Type classes derived from primitive axclasses and locales. 

6 
*) 

7 

8 
signature CLASS = 

9 
sig 

25462  10 
(*classes*) 
26247  11 
val class: bstring > class list > Element.context_i list 
26518  12 
> theory > string * Proof.context 
26247  13 
val class_cmd: bstring > xstring list > Element.context list 
26518  14 
> theory > string * Proof.context 
25485  15 

25311  16 
val init: class > theory > Proof.context 
27690
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

17 
val declare: class > Markup.property list 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

18 
> (string * mixfix) * term > theory > theory 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

19 
val abbrev: class > Syntax.mode > Markup.property list 
25104  20 
> (string * mixfix) * term > theory > theory 
27690
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

21 
val note: class > string 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

22 
> ((string * Attrib.src list) * (thm list * Attrib.src list) list) list 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

23 
> theory > (bstring * thm list) list * theory 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

24 
val declaration: class > declaration > theory > theory 
25083  25 
val refresh_syntax: class > Proof.context > Proof.context 
25485  26 

24589  27 
val intro_classes_tac: thm list > tactic 
26470  28 
val default_intro_tac: Proof.context > thm list > tactic 
27684
f45fd1159a4b
subclass now also works for subclasses with empty specificaton
haftmann
parents:
27281
diff
changeset

29 
val prove_subclass: class * class > thm option > theory > theory 
25485  30 

31 
val class_prefix: string > string 

32 
val is_class: theory > class > bool 

26518  33 
val these_params: theory > sort > (string * (class * (string * typ))) list 
24589  34 
val print_classes: theory > unit 
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

35 

25462  36 
(*instances*) 
26247  37 
val init_instantiation: string list * (string * sort) list * sort 
38 
> theory > local_theory 

39 
val instantiation_instance: (local_theory > local_theory) 

40 
> local_theory > Proof.state 

41 
val prove_instantiation_instance: (Proof.context > tactic) 

42 
> local_theory > local_theory 

25485  43 
val conclude_instantiation: local_theory > local_theory 
25603  44 
val instantiation_param: local_theory > string > string option 
25485  45 
val confirm_declaration: string > local_theory > local_theory 
25603  46 
val pretty_instantiation: local_theory > Pretty.T 
26259  47 
val type_name: string > string 
25485  48 

25462  49 
(*old axclass layer*) 
50 
val axclass_cmd: bstring * xstring list 

51 
> ((bstring * Attrib.src list) * string list) list 

52 
> theory > class * theory 

53 
val classrel_cmd: xstring * xstring > theory > Proof.state 

54 

55 
(*old instance layer*) 

25536  56 
val instance_arity: (theory > theory) > arity > theory > Proof.state 
57 
val instance_arity_cmd: bstring * xstring list * xstring > theory > Proof.state 

24218  58 
end; 
59 

60 
structure Class : CLASS = 

61 
struct 

62 

63 
(** auxiliary **) 

64 

25002  65 
fun prove_interpretation tac prfx_atts expr inst = 
66 
Locale.interpretation_i I prfx_atts expr inst 

24589  67 
#> Proof.global_terminal_proof 
68 
(Method.Basic (K (Method.SIMPLE_METHOD tac), Position.none), NONE) 

69 
#> ProofContext.theory_of; 

70 

25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset

71 
fun prove_interpretation_in tac after_qed (name, expr) = 
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset

72 
Locale.interpretation_in_locale 
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset

73 
(ProofContext.theory after_qed) (name, expr) 
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset

74 
#> Proof.global_terminal_proof 
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset

75 
(Method.Basic (K (Method.SIMPLE_METHOD tac), Position.none), NONE) 
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset

76 
#> ProofContext.theory_of; 
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset

77 

24589  78 

25485  79 
(** primitive axclass and instance commands **) 
24589  80 

24218  81 
fun axclass_cmd (class, raw_superclasses) raw_specs thy = 
82 
let 

83 
val ctxt = ProofContext.init thy; 

84 
val superclasses = map (Sign.read_class thy) raw_superclasses; 

24589  85 
val name_atts = map ((apsnd o map) (Attrib.attribute thy) o fst) 
86 
raw_specs; 

87 
val axiomss = ProofContext.read_propp (ctxt, map (map (rpair []) o snd) 

88 
raw_specs) 

24218  89 
> snd 
90 
> (map o map) fst; 

24589  91 
in 
92 
AxClass.define_class (class, superclasses) [] 

93 
(name_atts ~~ axiomss) thy 

94 
end; 

24218  95 

96 
local 

97 

98 
fun gen_instance mk_prop add_thm after_qed insts thy = 

99 
let 

100 
fun after_qed' results = 

101 
ProofContext.theory ((fold o fold) add_thm results #> after_qed); 

102 
in 

103 
thy 

104 
> ProofContext.init 

24589  105 
> Proof.theorem_i NONE after_qed' ((map (fn t => [(t, [])]) 
25536  106 
o mk_prop thy) insts) 
24218  107 
end; 
108 

109 
in 

110 

24589  111 
val instance_arity = 
24218  112 
gen_instance (Logic.mk_arities oo Sign.cert_arity) AxClass.add_arity; 
25502  113 
val instance_arity_cmd = 
114 
gen_instance (Logic.mk_arities oo Sign.read_arity) AxClass.add_arity I; 

24589  115 
val classrel = 
25536  116 
gen_instance (single oo (Logic.mk_classrel oo AxClass.cert_classrel)) AxClass.add_classrel I; 
24589  117 
val classrel_cmd = 
25536  118 
gen_instance (single oo (Logic.mk_classrel oo AxClass.read_classrel)) AxClass.add_classrel I; 
24218  119 

120 
end; (*local*) 

121 

122 

24589  123 
(** class data **) 
24218  124 

125 
datatype class_data = ClassData of { 

126 
consts: (string * string) list 

24836  127 
(*locale parameter ~> constant name*), 
25062  128 
base_sort: sort, 
25083  129 
inst: term option list 
130 
(*canonical interpretation*), 

25711  131 
morphism: theory > thm list > morphism, 
25062  132 
(*partial morphism of canonical interpretation*) 
25618  133 
assm_intro: thm option, 
134 
of_class: thm, 

135 
axiom: thm option, 

24657  136 
defs: thm list, 
25368
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

137 
operations: (string * (class * (typ * term))) list 
24657  138 
}; 
24218  139 

24657  140 
fun rep_class_data (ClassData d) = d; 
25618  141 
fun mk_class_data ((consts, base_sort, inst, morphism, assm_intro, of_class, axiom), 
25368
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

142 
(defs, operations)) = 
25062  143 
ClassData { consts = consts, base_sort = base_sort, inst = inst, 
26463  144 
morphism = morphism, assm_intro = assm_intro, of_class = of_class, axiom = axiom, 
25618  145 
defs = defs, operations = operations }; 
146 
fun map_class_data f (ClassData { consts, base_sort, inst, morphism, 

147 
assm_intro, of_class, axiom, defs, operations }) = 

148 
mk_class_data (f ((consts, base_sort, inst, morphism, assm_intro, of_class, axiom), 

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

149 
(defs, operations))); 
25038  150 
fun merge_class_data _ (ClassData { consts = consts, 
25618  151 
base_sort = base_sort, inst = inst, morphism = morphism, assm_intro = assm_intro, 
152 
of_class = of_class, axiom = axiom, defs = defs1, operations = operations1 }, 

153 
ClassData { consts = _, base_sort = _, inst = _, morphism = _, assm_intro = _, 

154 
of_class = _, axiom = _, defs = defs2, operations = operations2 }) = 

155 
mk_class_data ((consts, base_sort, inst, morphism, assm_intro, of_class, axiom), 

24914
95cda5dd58d5
added proper subclass concept; improved class target
haftmann
parents:
24901
diff
changeset

156 
(Thm.merge_thms (defs1, defs2), 
25368
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

157 
AList.merge (op =) (K true) (operations1, operations2))); 
24218  158 

159 
structure ClassData = TheoryDataFun 

160 
( 

25038  161 
type T = class_data Graph.T 
162 
val empty = Graph.empty; 

24218  163 
val copy = I; 
164 
val extend = I; 

25038  165 
fun merge _ = Graph.join merge_class_data; 
24218  166 
); 
167 

168 

169 
(* queries *) 

170 

25038  171 
val lookup_class_data = Option.map rep_class_data oo try o Graph.get_node o ClassData.get; 
24218  172 

24589  173 
fun the_class_data thy class = case lookup_class_data thy class 
25020  174 
of NONE => error ("Undeclared class " ^ quote class) 
24589  175 
 SOME data => data; 
24218  176 

25038  177 
val is_class = is_some oo lookup_class_data; 
178 

179 
val ancestry = Graph.all_succs o ClassData.get; 

24218  180 

25002  181 
fun these_params thy = 
24218  182 
let 
183 
fun params class = 

184 
let 

24930
cc2e0e8c81af
renamed AxClass.get_definition to AxClass.get_info (again);
wenzelm
parents:
24920
diff
changeset

185 
val const_typs = (#params o AxClass.get_info thy) class; 
24657  186 
val const_names = (#consts o the_class_data thy) class; 
24218  187 
in 
26518  188 
(map o apsnd) 
189 
(fn c => (class, (c, (the o AList.lookup (op =) const_typs) c))) const_names 

24218  190 
end; 
191 
in maps params o ancestry thy end; 

192 

24657  193 
fun these_defs thy = maps (these o Option.map #defs o lookup_class_data thy) o ancestry thy; 
24218  194 

25711  195 
fun morphism thy class = #morphism (the_class_data thy class) thy (these_defs thy [class]); 
25062  196 

25618  197 
fun these_assm_intros thy = 
198 
Graph.fold (fn (_, (data, _)) => fold (insert Thm.eq_thm) 

199 
((the_list o #assm_intro o rep_class_data) data)) (ClassData.get thy) []; 

24218  200 

24836  201 
fun these_operations thy = 
202 
maps (#operations o the_class_data thy) o ancestry thy; 

24657  203 

24218  204 
fun print_classes thy = 
205 
let 

24920  206 
val ctxt = ProofContext.init thy; 
24218  207 
val algebra = Sign.classes_of thy; 
208 
val arities = 

209 
Symtab.empty 

210 
> Symtab.fold (fn (tyco, arities) => fold (fn (class, _) => 

211 
Symtab.map_default (class, []) (insert (op =) tyco)) arities) 

212 
((#arities o Sorts.rep_algebra) algebra); 

213 
val the_arities = these o Symtab.lookup arities; 

214 
fun mk_arity class tyco = 

215 
let 

216 
val Ss = Sorts.mg_domain algebra tyco [class]; 

24920  217 
in Syntax.pretty_arity ctxt (tyco, Ss, [class]) end; 
24218  218 
fun mk_param (c, ty) = Pretty.str (Sign.extern_const thy c ^ " :: " 
24920  219 
^ setmp show_sorts false (Syntax.string_of_typ ctxt o Type.strip_sorts) ty); 
24218  220 
fun mk_entry class = (Pretty.block o Pretty.fbreaks o map_filter I) [ 
25062  221 
(SOME o Pretty.str) ("class " ^ Sign.extern_class thy class ^ ":"), 
24218  222 
(SOME o Pretty.block) [Pretty.str "supersort: ", 
24920  223 
(Syntax.pretty_sort ctxt o Sign.minimize_sort thy o Sign.super_classes thy) class], 
25062  224 
if is_class thy class then (SOME o Pretty.str) 
225 
("locale: " ^ Locale.extern thy class) else NONE, 

226 
((fn [] => NONE  ps => (SOME o Pretty.block o Pretty.fbreaks) 

227 
(Pretty.str "parameters:" :: ps)) o map mk_param 

24930
cc2e0e8c81af
renamed AxClass.get_definition to AxClass.get_info (again);
wenzelm
parents:
24920
diff
changeset

228 
o these o Option.map #params o try (AxClass.get_info thy)) class, 
24218  229 
(SOME o Pretty.block o Pretty.breaks) [ 
230 
Pretty.str "instances:", 

231 
Pretty.list "" "" (map (mk_arity class) (the_arities class)) 

232 
] 

233 
] 

234 
in 

24589  235 
(Pretty.writeln o Pretty.chunks o separate (Pretty.str "") 
236 
o map mk_entry o Sorts.all_classes) algebra 

24218  237 
end; 
238 

239 

240 
(* updaters *) 

241 

25618  242 
fun add_class_data ((class, superclasses), 
25711  243 
(params, base_sort, inst, phi, axiom, assm_intro, of_class)) thy = 
25002  244 
let 
25368
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

245 
val operations = map (fn (v_ty as (_, ty), (c, _)) => 
25683  246 
(c, (class, (ty, Free v_ty)))) params; 
25038  247 
val add_class = Graph.new_node (class, 
25683  248 
mk_class_data (((map o pairself) fst params, base_sort, 
25618  249 
map (SOME o Const) inst, phi, assm_intro, of_class, axiom), ([], operations))) 
25002  250 
#> fold (curry Graph.add_edge class) superclasses; 
25618  251 
in ClassData.map add_class thy end; 
24218  252 

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

253 
fun register_operation class (c, (t, some_def)) thy = 
25062  254 
let 
25368
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

255 
val base_sort = (#base_sort o the_class_data thy) class; 
26518  256 
val prep_typ = map_type_tvar 
257 
(fn (vi as (v, _), sort) => if Name.aT = v 

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

258 
then TFree (v, base_sort) else TVar (vi, sort)); 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

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

260 
val ty' = Term.fastype_of t'; 
25062  261 
in 
262 
thy 

263 
> (ClassData.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

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

266 
(c, (class, (ty', t'))) :: operations)) 
25062  267 
end; 
24218  268 

24589  269 

270 
(** rule calculation, tactics and methods **) 

271 

25024  272 
val class_prefix = Logic.const_of_class o Sign.base_name; 
273 

26247  274 
fun calculate sups base_sort assm_axiom param_map class thy = 
25062  275 
let 
25711  276 
(*static parts of morphism*) 
26518  277 
val subst_typ = map_type_tfree (fn (v, sort) => 
278 
if v = Name.aT then TVar ((v, 0), [class]) else TVar ((v, 0), sort)); 

25683  279 
fun subst_aterm (t as Free (v, ty)) = (case AList.lookup (op =) param_map v 
25062  280 
of SOME (c, _) => Const (c, ty) 
281 
 NONE => t) 

282 
 subst_aterm t = t; 

25711  283 
fun instantiate thy sort = Thm.instantiate ([pairself (Thm.ctyp_of thy o TVar o pair (Name.aT, 0)) 
284 
(base_sort, sort)], map (fn (v, (c, ty)) => pairself (Thm.cterm_of thy) 

285 
(Var ((v, 0), map_atyps (fn _ => TVar ((Name.aT, 0), sort)) ty), 

286 
Const (c, map_atyps (fn _ => TVar ((Name.aT, 0), sort)) ty))) param_map); 

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

287 
(*fun inst thy sort thm = (tracing (makestring thm); instantiate thy sort thm); 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

288 
val instantiate = inst;*) 
25683  289 
val (proto_assm_intro, locale_intro) = Locale.intros thy class 
290 
> pairself (try the_single); 

291 
val axiom_premises = map_filter (#axiom o the_class_data thy) sups 

292 
@ the_list assm_axiom; 

25711  293 
val axiom = locale_intro 
27690
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

294 
> Option.map (Thm.close_derivation o Drule.standard' o (fn thm => thm OF axiom_premises) o instantiate thy [class]) 
25711  295 
> (fn x as SOME _ => x  NONE => assm_axiom); 
296 
val lift_axiom = case axiom 

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

297 
of SOME axiom => (fn thm => ((*tracing "(morphism)"; 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

298 
tracing (makestring thm); 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

299 
tracing (makestring axiom);*) 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

300 
Thm.implies_elim thm axiom)) 
25683  301 
 NONE => I; 
25062  302 

25711  303 
(*dynamic parts of morphism*) 
304 
fun rew_term thy defs = Pattern.rewrite_term thy 

305 
(map (Logic.dest_equals o Thm.prop_of) defs) []; 

306 
fun subst_term thy defs = map_aterms subst_aterm #> rew_term thy defs 

307 
#> map_types subst_typ; 

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

308 
fun subst_thm thy defs = Drule.standard' #> instantiate thy [class] #> lift_axiom 
25711  309 
#> MetaSimplifier.rewrite_rule defs; 
26463  310 
fun morphism thy defs = 
25711  311 
Morphism.typ_morphism subst_typ 
312 
$> Morphism.term_morphism (subst_term thy defs) 

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

313 
$> Morphism.thm_morphism (subst_thm thy defs); 
25711  314 

315 
(*class rules*) 

316 
val defs = these_defs thy sups; 

25618  317 
val assm_intro = proto_assm_intro 
27690
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

318 
> Option.map (instantiate thy base_sort) 
25711  319 
> Option.map (MetaSimplifier.rewrite_rule defs) 
26628
63306cb94313
replaced Drule.close_derivation/Goal.close_result by Thm.close_derivation (removed obsolete compression);
wenzelm
parents:
26596
diff
changeset

320 
> Option.map Thm.close_derivation; 
26247  321 
val class_intro = (#intro o AxClass.get_info thy) class; 
25711  322 
val fixate = Thm.instantiate 
323 
(map (pairself (Thm.ctyp_of thy)) [(TVar ((Name.aT, 0), []), TFree (Name.aT, base_sort)), 

324 
(TVar ((Name.aT, 0), base_sort), TFree (Name.aT, base_sort))], []) 

25618  325 
val of_class_sups = if null sups 
25711  326 
then map (fixate o Thm.class_triv thy) base_sort 
327 
else map (fixate o #of_class o the_class_data thy) sups; 

25683  328 
val locale_dests = map Drule.standard' (Locale.dests thy class); 
25711  329 
val num_trivs = case length locale_dests 
330 
of 0 => if is_none axiom then 0 else 1 

331 
 n => n; 

332 
val pred_trivs = if num_trivs = 0 then [] 

333 
else the axiom 

334 
> Thm.prop_of 

335 
> (map_types o map_atyps o K) (TFree (Name.aT, base_sort)) 

336 
> (Thm.assume o Thm.cterm_of thy) 

337 
> replicate num_trivs; 

26247  338 
val of_class = (fixate class_intro OF of_class_sups OF locale_dests OF pred_trivs) 
25711  339 
> Drule.standard' 
26628
63306cb94313
replaced Drule.close_derivation/Goal.close_result by Thm.close_derivation (removed obsolete compression);
wenzelm
parents:
26596
diff
changeset

340 
> Thm.close_derivation; 
26247  341 
val this_intro = assm_intro > the_default class_intro; 
342 
in 

343 
thy 

344 
> Sign.sticky_prefix (class_prefix class ^ "_" ^ AxClass.axiomsN) 

27684
f45fd1159a4b
subclass now also works for subclasses with empty specificaton
haftmann
parents:
27281
diff
changeset

345 
> PureThy.store_thm (AxClass.introN, this_intro) 
26247  346 
> snd 
347 
> Sign.restore_naming thy 

348 
> pair (morphism, axiom, assm_intro, of_class) 

349 
end; 

24589  350 

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

351 
fun class_interpretation class facts defs thy = thy; 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

352 

24589  353 
fun class_interpretation class facts defs thy = 
354 
let 

26518  355 
val consts = map (apsnd fst o snd) (these_params thy [class]); 
356 
val constraints = map (fn (class, c) => map_atyps (K (TFree (Name.aT, 

357 
[class]))) (Sign.the_const_type thy c)) consts; 

26238  358 
val no_constraints = map (map_atyps (K (TFree (Name.aT, [])))) constraints; 
359 
fun add_constraint c T = Sign.add_const_constraint (c, SOME T); 

25083  360 
val inst = (#inst o the_class_data thy) class; 
25020  361 
val tac = ALLGOALS (ProofContext.fact_tac facts); 
25038  362 
val prfx = class_prefix class; 
24589  363 
in 
25038  364 
thy 
26518  365 
> fold2 add_constraint (map snd consts) no_constraints 
26238  366 
> prove_interpretation tac ((false, prfx), []) (Locale.Locale class) 
25094
ba43514068fd
Interpretation equations may have name and/or attribute.
ballarin
parents:
25083
diff
changeset

367 
(inst, map (fn def => (("", []), def)) defs) 
26518  368 
> fold2 add_constraint (map snd consts) constraints 
24589  369 
end; 
24218  370 

27684
f45fd1159a4b
subclass now also works for subclasses with empty specificaton
haftmann
parents:
27281
diff
changeset

371 
fun prove_subclass (sub, sup) some_thm thy = 
25618  372 
let 
25711  373 
val of_class = (#of_class o the_class_data thy) sup; 
27684
f45fd1159a4b
subclass now also works for subclasses with empty specificaton
haftmann
parents:
27281
diff
changeset

374 
val intro = case some_thm 
f45fd1159a4b
subclass now also works for subclasses with empty specificaton
haftmann
parents:
27281
diff
changeset

375 
of SOME thm => Drule.standard' (of_class OF [Drule.standard' thm]) 
f45fd1159a4b
subclass now also works for subclasses with empty specificaton
haftmann
parents:
27281
diff
changeset

376 
 NONE => Thm.instantiate ([pairself (Thm.ctyp_of thy o TVar o pair (Name.aT, 0)) 
f45fd1159a4b
subclass now also works for subclasses with empty specificaton
haftmann
parents:
27281
diff
changeset

377 
([], [sub])], []) of_class; 
f45fd1159a4b
subclass now also works for subclasses with empty specificaton
haftmann
parents:
27281
diff
changeset

378 
val classrel = (intro OF (the_list o #axiom o the_class_data thy) sub) 
f45fd1159a4b
subclass now also works for subclasses with empty specificaton
haftmann
parents:
27281
diff
changeset

379 
> Thm.close_derivation; 
25618  380 
in 
381 
thy 

382 
> AxClass.add_classrel classrel 

27684
f45fd1159a4b
subclass now also works for subclasses with empty specificaton
haftmann
parents:
27281
diff
changeset

383 
> prove_interpretation_in (ALLGOALS (ProofContext.fact_tac (the_list some_thm))) 
25618  384 
I (sub, Locale.Locale sup) 
385 
> ClassData.map (Graph.add_edge (sub, sup)) 

386 
end; 

387 

24218  388 
fun intro_classes_tac facts st = 
389 
let 

390 
val thy = Thm.theory_of_thm st; 

391 
val classes = Sign.all_classes thy; 

392 
val class_trivs = map (Thm.class_triv thy) classes; 

25618  393 
val class_intros = map_filter (try (#intro o AxClass.get_info thy)) classes; 
394 
val assm_intros = these_assm_intros thy; 

24218  395 
in 
25618  396 
Method.intros_tac (class_trivs @ class_intros @ assm_intros) facts st 
24218  397 
end; 
398 

26470  399 
fun default_intro_tac ctxt [] = 
400 
intro_classes_tac [] ORELSE Locale.intro_locales_tac true ctxt [] 

401 
 default_intro_tac _ _ = no_tac; 

24218  402 

403 
fun default_tac rules ctxt facts = 

404 
HEADGOAL (Method.some_rule_tac rules ctxt facts) ORELSE 

26470  405 
default_intro_tac ctxt facts; 
24218  406 

26463  407 
val _ = Context.>> (Context.map_theory 
408 
(Method.add_methods 

409 
[("intro_classes", Method.no_args (Method.METHOD intro_classes_tac), 

410 
"backchain introduction rules of classes"), 

411 
("default", Method.thms_ctxt_args (Method.METHOD oo default_tac), 

412 
"apply some intro/elim rule")])); 

413 

24218  414 

24589  415 
(** classes and class target **) 
24218  416 

25002  417 
(* class context syntax *) 
24748  418 

26238  419 
fun synchronize_class_syntax sups base_sort ctxt = 
24914
95cda5dd58d5
added proper subclass concept; improved class target
haftmann
parents:
24901
diff
changeset

420 
let 
25344
00c2179db769
synchronize_syntax: improved declare_const (still inactive);
wenzelm
parents:
25326
diff
changeset

421 
val thy = ProofContext.theory_of ctxt; 
26596  422 
val algebra = Sign.classes_of thy; 
25083  423 
val operations = these_operations thy sups; 
26518  424 
fun subst_class_typ sort = map_type_tfree (K (TVar ((Name.aT, 0), sort))); 
425 
val primary_constraints = 

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

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

428 
(map o apsnd) (fn (class, (ty, _)) => subst_class_typ [class] ty) operations; 
25318
c8352b38d47d
synchronize_syntax: declare operations within the local scope of fixes/consts
wenzelm
parents:
25311
diff
changeset

429 
fun declare_const (c, _) = 
c8352b38d47d
synchronize_syntax: declare operations within the local scope of fixes/consts
wenzelm
parents:
25311
diff
changeset

430 
let val b = Sign.base_name c 
25344
00c2179db769
synchronize_syntax: improved declare_const (still inactive);
wenzelm
parents:
25326
diff
changeset

431 
in Sign.intern_const thy b = c ? Variable.declare_const (b, c) end; 
26518  432 
fun improve (c, ty) = (case AList.lookup (op =) primary_constraints c 
26238  433 
of SOME ty' => (case try (Type.raw_match (ty', ty)) Vartab.empty 
434 
of SOME tyenv => (case Vartab.lookup tyenv (Name.aT, 0) 

26596  435 
of SOME (_, ty' as TVar (tvar as (vi, sort))) => 
26238  436 
if TypeInfer.is_param vi 
26596  437 
andalso Sorts.sort_le algebra (base_sort, sort) 
438 
then SOME (ty', TFree (Name.aT, base_sort)) 

439 
else NONE 

26238  440 
 _ => NONE) 
441 
 NONE => NONE) 

442 
 NONE => NONE) 

443 
fun subst (c, ty) = Option.map snd (AList.lookup (op =) operations c); 

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

444 
val unchecks = map (fn (c, (_, (ty, t))) => (t, Const (c, ty))) operations; 
25083  445 
in 
446 
ctxt 

26518  447 
> fold declare_const primary_constraints 
448 
> Overloading.map_improvable_syntax (K (((primary_constraints, secondary_constraints), 

26730  449 
(((improve, subst), true), unchecks)), false)) 
26518  450 
> Overloading.set_primary_constraints 
25083  451 
end; 
452 

453 
fun refresh_syntax class ctxt = 

25002  454 
let 
455 
val thy = ProofContext.theory_of ctxt; 

25062  456 
val base_sort = (#base_sort o the_class_data thy) class; 
26238  457 
in synchronize_class_syntax [class] base_sort ctxt end; 
25002  458 

25344
00c2179db769
synchronize_syntax: improved declare_const (still inactive);
wenzelm
parents:
25326
diff
changeset

459 
fun init_ctxt sups base_sort ctxt = 
25083  460 
ctxt 
461 
> Variable.declare_term 

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

26238  463 
> synchronize_class_syntax sups base_sort 
464 
> Overloading.add_improvable_syntax; 

24901
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

465 

25311  466 
fun init class thy = 
467 
thy 

468 
> Locale.init class 

25344
00c2179db769
synchronize_syntax: improved declare_const (still inactive);
wenzelm
parents:
25326
diff
changeset

469 
> init_ctxt [class] ((#base_sort o the_class_data thy) class); 
24914
95cda5dd58d5
added proper subclass concept; improved class target
haftmann
parents:
24901
diff
changeset

470 

24748  471 

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

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

473 

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

474 
fun declare class pos ((c, mx), dict) thy = 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

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

476 
val prfx = class_prefix class; 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

477 
val thy' = thy > Sign.add_path prfx; 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

478 
val phi = morphism thy' class; 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

479 

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

480 
val c' = Sign.full_name thy' c; 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

481 
val dict' = Morphism.term phi dict; 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

482 
val dict_def = map_types Logic.unvarifyT dict'; 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

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

484 
val ty'' = Type.strip_sorts ty'; 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

485 
val def_eq = Logic.mk_equals (Const (c', ty'), dict_def); 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

486 
fun get_axiom thy = ((Thm.varifyT o Thm.get_axiom_i thy) c', thy); 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

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

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

489 
> Sign.declare_const pos (c, ty'', mx) > snd 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

490 
> Thm.add_def false false (c, def_eq) 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

491 
>> Thm.symmetric 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

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

493 
> (fn (def, def') => class_interpretation class [def] [Thm.prop_of def] 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

494 
#> register_operation class (c', (dict', SOME (Thm.symmetric def'))) 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

495 
#> PureThy.store_thm (c ^ "_raw", def') 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

496 
#> snd) 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

497 
> Sign.restore_naming thy 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

498 
> Sign.add_const_constraint (c', SOME ty') 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

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

500 

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

501 
fun abbrev class prmode pos ((c, mx), rhs) thy = 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

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

503 
val prfx = class_prefix class; 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

504 
val thy' = thy > Sign.add_path prfx; 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

505 

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

506 
val unchecks = map (fn (c, (_, (ty, t))) => (t, Const (c, ty))) 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

507 
(these_operations thy [class]); 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

508 
val c' = Sign.full_name thy' c; 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

509 
val rhs' = Pattern.rewrite_term thy unchecks [] rhs; 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

510 
val rhs'' = map_types Logic.varifyT rhs'; 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

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

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

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

514 
> Sign.add_abbrev (#1 prmode) pos (c, map_types Type.strip_sorts rhs'') > snd 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

515 
> Sign.add_const_constraint (c', SOME ty') 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

516 
> Sign.notation true prmode [(Const (c', ty'), mx)] 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

517 
> not (#1 prmode = PrintMode.input) ? register_operation class (c', (rhs', NONE)) 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

518 
> Sign.restore_naming thy 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

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

520 

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

521 
fun note class kind facts thy = 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

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

523 
val phi = morphism thy class; 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

524 
val facts' = facts 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

525 
> PureThy.map_facts (Morphism.thm phi) 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

526 
> Attrib.map_facts (Attrib.attribute_i thy); 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

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

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

529 
> Sign.add_path (class_prefix class) 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

530 
> PureThy.note_thmss kind facts' 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

531 
> Sign.restore_naming thy 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

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

533 

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

534 
fun declaration class decl thy = 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

535 
Context.theory_map (decl (morphism thy class)) thy; 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

536 

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

537 

24589  538 
(* class definition *) 
24218  539 

540 
local 

541 

26247  542 
fun gen_class_spec prep_class process_expr thy raw_supclasses raw_elems = 
24218  543 
let 
24748  544 
val supclasses = map (prep_class thy) raw_supclasses; 
545 
val supsort = Sign.minimize_sort thy supclasses; 

25618  546 
val sups = filter (is_class thy) supsort; 
26995  547 
val supparam_names = map fst (these_params thy sups); 
548 
val _ = if has_duplicates (op =) supparam_names 

549 
then error ("Duplicate parameter(s) in superclasses: " 

550 
^ (commas o map quote o duplicates (op =)) supparam_names) 

551 
else (); 

25618  552 
val base_sort = if null sups then supsort else 
26167  553 
foldr1 (Sorts.inter_sort (Sign.classes_of thy)) 
554 
(map (#base_sort o the_class_data thy) sups); 

25038  555 
val suplocales = map Locale.Locale sups; 
24748  556 
val supexpr = Locale.Merge suplocales; 
557 
val supparams = (map fst o Locale.parameters_of_expr thy) supexpr; 

26247  558 
val mergeexpr = Locale.Merge (suplocales); 
24748  559 
val constrain = Element.Constrains ((map o apsnd o map_atyps) 
26167  560 
(K (TFree (Name.aT, base_sort))) supparams); 
25683  561 
fun fork_syn (Element.Fixes xs) = 
562 
fold_map (fn (c, ty, syn) => cons (c, syn) #> pair (c, ty, NoSyn)) xs 

563 
#>> Element.Fixes 

564 
 fork_syn x = pair x; 

565 
fun fork_syntax elems = 

566 
let 

567 
val (elems', global_syntax) = fold_map fork_syn elems []; 

26247  568 
in (constrain :: elems', global_syntax) end; 
25683  569 
val (elems, global_syntax) = 
570 
ProofContext.init thy 

571 
> Locale.cert_expr supexpr [constrain] 

572 
> snd 

573 
> init_ctxt sups base_sort 

574 
> process_expr Locale.empty raw_elems 

575 
> fst 

576 
> fork_syntax 

577 
in (((sups, supparams), (supsort, base_sort, mergeexpr)), (elems, global_syntax)) end; 

24748  578 

26247  579 
val read_class_spec = gen_class_spec Sign.intern_class Locale.read_expr; 
580 
val check_class_spec = gen_class_spec (K I) Locale.cert_expr; 

24748  581 

26518  582 
fun adjungate_axclass bname class base_sort sups supsort supparams global_syntax thy = 
24968
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset

583 
let 
25683  584 
val supconsts = map fst supparams 
26518  585 
> AList.make (snd o the o AList.lookup (op =) (these_params thy sups)) 
25683  586 
> (map o apsnd o apsnd o map_atyps o K o TFree) (Name.aT, [class]); 
587 
val all_params = map fst (Locale.parameters_of thy class); 

588 
fun add_const (v, raw_ty) thy = 

589 
let 

590 
val c = Sign.full_name thy v; 

591 
val ty = map_atyps (K (TFree (Name.aT, base_sort))) raw_ty; 

592 
val ty0 = Type.strip_sorts ty; 

593 
val ty' = map_atyps (K (TFree (Name.aT, [class]))) ty0; 

594 
val syn = (the_default NoSyn o AList.lookup (op =) global_syntax) v; 

595 
in 

596 
thy 

597 
> Sign.declare_const [] (v, ty0, syn) 

598 
> snd 

599 
> pair ((v, ty), (c, ty')) 

600 
end; 

601 
fun add_consts raw_params thy = 

602 
thy 

603 
> Sign.add_path (Logic.const_of_class bname) 

604 
> fold_map add_const raw_params 

605 
> Sign.restore_naming thy 

606 
> (fn params => pair (supconsts @ (map o apfst) fst params, params)); 

607 
fun globalize param_map = map_aterms 

608 
(fn Free (v, ty) => Const ((fst o the o AList.lookup (op =) param_map) v, ty) 

609 
 t => t); 

610 
val raw_pred = Locale.intros thy class 

611 
> fst 

612 
> map (Logic.unvarify o Logic.strip_imp_concl o Thm.prop_of); 

613 
fun get_axiom thy = case (#axioms o AxClass.get_info thy) class 

614 
of [] => NONE 

615 
 [thm] => SOME thm; 

24968
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset

616 
in 
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset

617 
thy 
25683  618 
> add_consts ((snd o chop (length supparams)) all_params) 
619 
> (fn (param_map, params) => AxClass.define_class (bname, supsort) 

26518  620 
(map (fst o snd) params) 
25683  621 
[((bname ^ "_" ^ AxClass.axiomsN, []), map (globalize param_map) raw_pred)] 
622 
#> snd 

623 
#> `get_axiom 

624 
#> (fn assm_axiom => fold (Sign.add_const_constraint o apsnd SOME o snd) params 

625 
#> pair (param_map, params, assm_axiom))) 

24968
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset

626 
end; 
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset

627 

26518  628 
fun gen_class prep_spec bname raw_supclasses raw_elems thy = 
24748  629 
let 
25038  630 
val class = Sign.full_name thy bname; 
25683  631 
val (((sups, supparams), (supsort, base_sort, mergeexpr)), (elems, global_syntax)) = 
26247  632 
prep_spec thy raw_supclasses raw_elems; 
27690
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

633 
fun assms_of thy class = 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

634 
Locale.elems thy class 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

635 
> map_filter (fn Element.Notes (_, facts) => SOME facts  _ => NONE); 
24218  636 
in 
637 
thy 

27684
f45fd1159a4b
subclass now also works for subclasses with empty specificaton
haftmann
parents:
27281
diff
changeset

638 
> Locale.add_locale_i "" bname mergeexpr elems 
25038  639 
> snd 
25311  640 
> ProofContext.theory_of 
26518  641 
> adjungate_axclass bname class base_sort sups supsort supparams global_syntax 
25683  642 
> (fn (param_map, params, assm_axiom) => 
26247  643 
calculate sups base_sort assm_axiom param_map class 
25711  644 
#> (fn (morphism, axiom, assm_intro, of_class) => 
25683  645 
add_class_data ((class, sups), (params, base_sort, 
25711  646 
map snd param_map, morphism, axiom, assm_intro, of_class)) 
27690
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

647 
(*#> `(fn thy => assms_of thy class) 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

648 
#> (fn assms => fold_map (note class Thm.assumptionK) assms 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

649 
#> snd*) 
24738db98d34
some steps towards explicit class target for canonical interpretation
haftmann
parents:
27684
diff
changeset

650 
#> class_interpretation class (the_list axiom) []))(*)*) 
25268  651 
> init class 
25038  652 
> pair class 
24218  653 
end; 
654 

655 
in 

656 

26518  657 
val class_cmd = gen_class read_class_spec; 
658 
val class = gen_class check_class_spec; 

24218  659 

660 
end; (*local*) 

661 

662 

25462  663 

664 
(** instantiation target **) 

665 

666 
(* bookkeeping *) 

667 

668 
datatype instantiation = Instantiation of { 

25864  669 
arities: string list * (string * sort) list * sort, 
25462  670 
params: ((string * string) * (string * typ)) list 
25603  671 
(*(instantiation parameter, type constructor), (local instantiation parameter, typ)*) 
25462  672 
} 
673 

674 
structure Instantiation = ProofDataFun 

675 
( 

676 
type T = instantiation 

25536  677 
fun init _ = Instantiation { arities = ([], [], []), params = [] }; 
25462  678 
); 
679 

25485  680 
fun mk_instantiation (arities, params) = 
681 
Instantiation { arities = arities, params = params }; 

25514  682 
fun get_instantiation lthy = case Instantiation.get (LocalTheory.target_of lthy) 
25485  683 
of Instantiation data => data; 
25514  684 
fun map_instantiation f = (LocalTheory.target o Instantiation.map) 
685 
(fn Instantiation { arities, params } => mk_instantiation (f (arities, params))); 

25462  686 

25514  687 
fun the_instantiation lthy = case get_instantiation lthy 
25536  688 
of { arities = ([], [], []), ... } => error "No instantiation target" 
25485  689 
 data => data; 
25462  690 

25485  691 
val instantiation_params = #params o get_instantiation; 
25462  692 

25514  693 
fun instantiation_param lthy v = instantiation_params lthy 
25462  694 
> find_first (fn (_, (v', _)) => v = v') 
695 
> Option.map (fst o fst); 

696 

697 

698 
(* syntax *) 

699 

26238  700 
fun synchronize_inst_syntax ctxt = 
25462  701 
let 
26259  702 
val Instantiation { arities = (_, _, sort), params = params } = Instantiation.get ctxt; 
26238  703 
val thy = ProofContext.theory_of ctxt; 
704 
fun subst (c, ty) = case AxClass.inst_tyco_of thy (c, ty) 

705 
of SOME tyco => (case AList.lookup (op =) params (c, tyco) 

706 
of SOME (v_ty as (_, ty)) => SOME (ty, Free v_ty) 

707 
 NONE => NONE) 

708 
 NONE => NONE; 

709 
val unchecks = 

710 
map (fn ((c, _), v_ty as (_, ty)) => (Free v_ty, Const (c, ty))) params; 

711 
in 

712 
ctxt 

26259  713 
> Overloading.map_improvable_syntax 
26730  714 
(fn (((primary_constraints, _), (((improve, _), _), _)), _) => 
715 
(((primary_constraints, []), (((improve, subst), false), unchecks)), false)) 

26238  716 
end; 
25462  717 

718 

719 
(* target *) 

720 

25485  721 
val sanatize_name = (*FIXME*) 
722 
let 

25574  723 
fun is_valid s = Symbol.is_ascii_letter s orelse Symbol.is_ascii_digit s 
724 
orelse s = "'" orelse s = "_"; 

25485  725 
val is_junk = not o is_valid andf Symbol.is_regular; 
726 
val junk = Scan.many is_junk; 

727 
val scan_valids = Symbol.scanner "Malformed input" 

728 
((junk  

729 
(Scan.optional (Scan.one Symbol.is_ascii_letter) "x" ^^ (Scan.many is_valid >> implode) 

730 
 junk)) 

25999  731 
::: Scan.repeat ((Scan.many1 is_valid >> implode)  junk)); 
25485  732 
in 
733 
explode #> scan_valids #> implode 

734 
end; 

735 

26259  736 
fun type_name "*" = "prod" 
737 
 type_name "+" = "sum" 

738 
 type_name s = sanatize_name (NameSpace.base s); (*FIXME*) 

739 

26518  740 
fun resort_terms pp algebra consts constraints ts = 
741 
let 

742 
fun matchings (Const (c_ty as (c, _))) = (case constraints c 

743 
of NONE => I 

744 
 SOME sorts => fold2 (curry (Sorts.meet_sort algebra)) 

745 
(Consts.typargs consts c_ty) sorts) 

746 
 matchings _ = I 

747 
val tvartab = (fold o fold_aterms) matchings ts Vartab.empty 

26642
454d11701fa4
Sorts.class_error: produce message only (formerly msg_class_error);
wenzelm
parents:
26628
diff
changeset

748 
handle Sorts.CLASS_ERROR e => error (Sorts.class_error pp e); 
27089
480f19078b65
fixed wrong treatment of type variables in instantiation target
haftmann
parents:
26995
diff
changeset

749 
val inst = map_type_tvar 
480f19078b65
fixed wrong treatment of type variables in instantiation target
haftmann
parents:
26995
diff
changeset

750 
(fn (vi, sort) => TVar (vi, the_default sort (Vartab.lookup tvartab vi))); 
26518  751 
in if Vartab.is_empty tvartab then NONE else SOME ((map o map_types) inst ts) end; 
752 

25864  753 
fun init_instantiation (tycos, vs, sort) thy = 
25462  754 
let 
25536  755 
val _ = if null tycos then error "At least one arity must be given" else (); 
26518  756 
val params = these_params thy sort; 
757 
fun get_param tyco (param, (_, (c, ty))) = if can (AxClass.param_of_inst thy) (c, tyco) 

25603  758 
then NONE else SOME ((c, tyco), 
25864  759 
(param ^ "_" ^ type_name tyco, map_atyps (K (Type (tyco, map TFree vs))) ty)); 
26518  760 
val inst_params = map_product get_param tycos params > map_filter I; 
761 
val primary_constraints = map (apsnd 

762 
(map_atyps (K (TVar ((Name.aT, 0), [])))) o snd o snd) params; 

26939
1035c89b4c02
moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents:
26761
diff
changeset

763 
val pp = Syntax.pp_global thy; 
26518  764 
val algebra = Sign.classes_of thy 
765 
> fold (fn tyco => Sorts.add_arities pp 

766 
(tyco, map (fn class => (class, map snd vs)) sort)) tycos; 

767 
val consts = Sign.consts_of thy; 

768 
val improve_constraints = AList.lookup (op =) 

769 
(map (fn (_, (class, (c, _))) => (c, [[class]])) params); 

770 
fun resort_check ts ctxt = case resort_terms pp algebra consts improve_constraints ts 

771 
of NONE => NONE 

772 
 SOME ts' => SOME (ts', ctxt); 

773 
fun improve (c, ty) = case AxClass.inst_tyco_of thy (c, ty) 

26329
3e58e4c67a2a
instantiation less liberal with dangling constraints
haftmann
parents:
26259
diff
changeset

774 
of SOME tyco => (case AList.lookup (op =) inst_params (c, tyco) 
26518  775 
of SOME (_, ty') => if Type.raw_instance (ty', ty) then SOME (ty, ty') else NONE 
26259  776 
 NONE => NONE) 
777 
 NONE => NONE; 

25485  778 
in 
779 
thy 

780 
> ProofContext.init 

26329
3e58e4c67a2a
instantiation less liberal with dangling constraints
haftmann
parents:
26259
diff
changeset

781 
> Instantiation.put (mk_instantiation ((tycos, vs, sort), inst_params)) 
27281  782 
> fold (Variable.declare_typ o TFree) vs 
26329
3e58e4c67a2a
instantiation less liberal with dangling constraints
haftmann
parents:
26259
diff
changeset

783 
> fold (Variable.declare_names o Free o snd) inst_params 
26259  784 
> (Overloading.map_improvable_syntax o apfst) 
26329
3e58e4c67a2a
instantiation less liberal with dangling constraints
haftmann
parents:
26259
diff
changeset

785 
(fn ((_, _), ((_, subst), unchecks)) => 
26730  786 
((primary_constraints, []), (((improve, K NONE), false), []))) 
26259  787 
> Overloading.add_improvable_syntax 
26518  788 
> Context.proof_map (Syntax.add_term_check 0 "resorting" resort_check) 
26238  789 
> synchronize_inst_syntax 
25485  790 
end; 
791 

26238  792 
fun confirm_declaration c = (map_instantiation o apsnd) 
793 
(filter_out (fn (_, (c', _)) => c' = c)) 

794 
#> LocalTheory.target synchronize_inst_syntax 

795 

25485  796 
fun gen_instantiation_instance do_proof after_qed lthy = 
797 
let 

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

25462  800 
fun after_qed' results = 
801 
LocalTheory.theory (fold (AxClass.add_arity o Thm.varifyT) results) 

802 
#> after_qed; 

803 
in 

804 
lthy 

805 
> do_proof after_qed' arities_proof 

806 
end; 

807 

25485  808 
val instantiation_instance = gen_instantiation_instance (fn after_qed => fn ts => 
25462  809 
Proof.theorem_i NONE (after_qed o map the_single) (map (fn t => [(t, [])]) ts)); 
810 

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

25462  814 

815 
fun conclude_instantiation lthy = 

816 
let 

25485  817 
val { arities, params } = the_instantiation lthy; 
25864  818 
val (tycos, vs, sort) = arities; 
25462  819 
val thy = ProofContext.theory_of lthy; 
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25574
diff
changeset

820 
val _ = map (fn tyco => if Sign.of_sort thy 
25864  821 
(Type (tyco, map TFree vs), sort) 
25462  822 
then () else error ("Missing instance proof for type " ^ quote (Sign.extern_type thy tyco))) 
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25574
diff
changeset

823 
tycos; 
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25574
diff
changeset

824 
in lthy end; 
25462  825 

25603  826 
fun pretty_instantiation lthy = 
827 
let 

828 
val { arities, params } = the_instantiation lthy; 

25864  829 
val (tycos, vs, sort) = arities; 
25603  830 
val thy = ProofContext.theory_of lthy; 
25864  831 
fun pr_arity tyco = Syntax.pretty_arity lthy (tyco, map snd vs, sort); 
25603  832 
fun pr_param ((c, _), (v, ty)) = 
25864  833 
(Pretty.block o Pretty.breaks) [Pretty.str v, Pretty.str "==", 
26939
1035c89b4c02
moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents:
26761
diff
changeset

834 
(Pretty.str o Sign.extern_const thy) c, Pretty.str "::", Syntax.pretty_typ_global thy ty]; 
25603  835 
in 
836 
(Pretty.block o Pretty.fbreaks) 

837 
(Pretty.str "instantiation" :: map pr_arity tycos @ map pr_param params) 

838 
end; 

839 

24218  840 
end; 
25683  841 