author | haftmann |
Wed, 12 Mar 2008 08:47:35 +0100 | |
changeset 26259 | d30f4a509361 |
parent 26247 | b6608fbeaae1 |
child 26329 | 3e58e4c67a2a |
permissions | -rw-r--r-- |
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 |
24218 | 12 |
-> string list -> theory -> string * Proof.context |
26247 | 13 |
val class_cmd: bstring -> xstring list -> Element.context list |
24589 | 14 |
-> xstring list -> theory -> string * Proof.context |
25485 | 15 |
|
25311 | 16 |
val init: class -> theory -> Proof.context |
25603 | 17 |
val declare: string -> Markup.property list |
25104 | 18 |
-> (string * mixfix) * term -> theory -> theory |
25603 | 19 |
val abbrev: string -> Syntax.mode -> Markup.property list |
25104 | 20 |
-> (string * mixfix) * term -> theory -> theory |
25083 | 21 |
val refresh_syntax: class -> Proof.context -> Proof.context |
25485 | 22 |
|
24589 | 23 |
val intro_classes_tac: thm list -> tactic |
24 |
val default_intro_classes_tac: thm list -> tactic |
|
25618 | 25 |
val prove_subclass: class * class -> thm -> theory -> theory |
25485 | 26 |
|
27 |
val class_prefix: string -> string |
|
28 |
val is_class: theory -> class -> bool |
|
29 |
val these_params: theory -> sort -> (string * (string * typ)) list |
|
24589 | 30 |
val print_classes: theory -> unit |
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset
|
31 |
|
25462 | 32 |
(*instances*) |
26247 | 33 |
val init_instantiation: string list * (string * sort) list * sort |
34 |
-> theory -> local_theory |
|
35 |
val instantiation_instance: (local_theory -> local_theory) |
|
36 |
-> local_theory -> Proof.state |
|
37 |
val prove_instantiation_instance: (Proof.context -> tactic) |
|
38 |
-> local_theory -> local_theory |
|
25485 | 39 |
val conclude_instantiation: local_theory -> local_theory |
25603 | 40 |
val instantiation_param: local_theory -> string -> string option |
25485 | 41 |
val confirm_declaration: string -> local_theory -> local_theory |
25603 | 42 |
val pretty_instantiation: local_theory -> Pretty.T |
26259 | 43 |
val type_name: string -> string |
25485 | 44 |
|
25462 | 45 |
(*old axclass layer*) |
46 |
val axclass_cmd: bstring * xstring list |
|
47 |
-> ((bstring * Attrib.src list) * string list) list |
|
48 |
-> theory -> class * theory |
|
49 |
val classrel_cmd: xstring * xstring -> theory -> Proof.state |
|
50 |
||
51 |
(*old instance layer*) |
|
25536 | 52 |
val instance_arity: (theory -> theory) -> arity -> theory -> Proof.state |
53 |
val instance_arity_cmd: bstring * xstring list * xstring -> theory -> Proof.state |
|
24218 | 54 |
end; |
55 |
||
56 |
structure Class : CLASS = |
|
57 |
struct |
|
58 |
||
59 |
(** auxiliary **) |
|
60 |
||
25062 | 61 |
val classN = "class"; |
62 |
val introN = "intro"; |
|
63 |
||
25002 | 64 |
fun prove_interpretation tac prfx_atts expr inst = |
65 |
Locale.interpretation_i I prfx_atts expr inst |
|
24589 | 66 |
#> Proof.global_terminal_proof |
67 |
(Method.Basic (K (Method.SIMPLE_METHOD tac), Position.none), NONE) |
|
68 |
#> ProofContext.theory_of; |
|
69 |
||
25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
70 |
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
|
71 |
Locale.interpretation_in_locale |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
72 |
(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
|
73 |
#> Proof.global_terminal_proof |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
74 |
(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
|
75 |
#> ProofContext.theory_of; |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
76 |
|
24589 | 77 |
|
25485 | 78 |
(** primitive axclass and instance commands **) |
24589 | 79 |
|
24218 | 80 |
fun axclass_cmd (class, raw_superclasses) raw_specs thy = |
81 |
let |
|
82 |
val ctxt = ProofContext.init thy; |
|
83 |
val superclasses = map (Sign.read_class thy) raw_superclasses; |
|
24589 | 84 |
val name_atts = map ((apsnd o map) (Attrib.attribute thy) o fst) |
85 |
raw_specs; |
|
86 |
val axiomss = ProofContext.read_propp (ctxt, map (map (rpair []) o snd) |
|
87 |
raw_specs) |
|
24218 | 88 |
|> snd |
89 |
|> (map o map) fst; |
|
24589 | 90 |
in |
91 |
AxClass.define_class (class, superclasses) [] |
|
92 |
(name_atts ~~ axiomss) thy |
|
93 |
end; |
|
24218 | 94 |
|
95 |
local |
|
96 |
||
97 |
fun gen_instance mk_prop add_thm after_qed insts thy = |
|
98 |
let |
|
99 |
fun after_qed' results = |
|
100 |
ProofContext.theory ((fold o fold) add_thm results #> after_qed); |
|
101 |
in |
|
102 |
thy |
|
103 |
|> ProofContext.init |
|
24589 | 104 |
|> Proof.theorem_i NONE after_qed' ((map (fn t => [(t, [])]) |
25536 | 105 |
o mk_prop thy) insts) |
24218 | 106 |
end; |
107 |
||
108 |
in |
|
109 |
||
24589 | 110 |
val instance_arity = |
24218 | 111 |
gen_instance (Logic.mk_arities oo Sign.cert_arity) AxClass.add_arity; |
25502 | 112 |
val instance_arity_cmd = |
113 |
gen_instance (Logic.mk_arities oo Sign.read_arity) AxClass.add_arity I; |
|
24589 | 114 |
val classrel = |
25536 | 115 |
gen_instance (single oo (Logic.mk_classrel oo AxClass.cert_classrel)) AxClass.add_classrel I; |
24589 | 116 |
val classrel_cmd = |
25536 | 117 |
gen_instance (single oo (Logic.mk_classrel oo AxClass.read_classrel)) AxClass.add_classrel I; |
24218 | 118 |
|
119 |
end; (*local*) |
|
120 |
||
121 |
||
24589 | 122 |
(** class data **) |
24218 | 123 |
|
124 |
datatype class_data = ClassData of { |
|
125 |
consts: (string * string) list |
|
24836 | 126 |
(*locale parameter ~> constant name*), |
25062 | 127 |
base_sort: sort, |
25083 | 128 |
inst: term option list |
129 |
(*canonical interpretation*), |
|
25711 | 130 |
morphism: theory -> thm list -> morphism, |
25062 | 131 |
(*partial morphism of canonical interpretation*) |
25618 | 132 |
assm_intro: thm option, |
133 |
of_class: thm, |
|
134 |
axiom: thm option, |
|
24657 | 135 |
defs: thm list, |
25368
f12613fda79d
proper implementation of check phase; non-qualified names for class operations
haftmann
parents:
25344
diff
changeset
|
136 |
operations: (string * (class * (typ * term))) list |
24657 | 137 |
}; |
24218 | 138 |
|
24657 | 139 |
fun rep_class_data (ClassData d) = d; |
25618 | 140 |
fun mk_class_data ((consts, base_sort, inst, morphism, assm_intro, of_class, axiom), |
25368
f12613fda79d
proper implementation of check phase; non-qualified names for class operations
haftmann
parents:
25344
diff
changeset
|
141 |
(defs, operations)) = |
25062 | 142 |
ClassData { consts = consts, base_sort = base_sort, inst = inst, |
25618 | 143 |
morphism = morphism, assm_intro = assm_intro, of_class = of_class, axiom = axiom, |
144 |
defs = defs, operations = operations }; |
|
145 |
fun map_class_data f (ClassData { consts, base_sort, inst, morphism, |
|
146 |
assm_intro, of_class, axiom, defs, operations }) = |
|
147 |
mk_class_data (f ((consts, base_sort, inst, morphism, assm_intro, of_class, axiom), |
|
25368
f12613fda79d
proper implementation of check phase; non-qualified names for class operations
haftmann
parents:
25344
diff
changeset
|
148 |
(defs, operations))); |
25038 | 149 |
fun merge_class_data _ (ClassData { consts = consts, |
25618 | 150 |
base_sort = base_sort, inst = inst, morphism = morphism, assm_intro = assm_intro, |
151 |
of_class = of_class, axiom = axiom, defs = defs1, operations = operations1 }, |
|
152 |
ClassData { consts = _, base_sort = _, inst = _, morphism = _, assm_intro = _, |
|
153 |
of_class = _, axiom = _, defs = defs2, operations = operations2 }) = |
|
154 |
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
|
155 |
(Thm.merge_thms (defs1, defs2), |
25368
f12613fda79d
proper implementation of check phase; non-qualified names for class operations
haftmann
parents:
25344
diff
changeset
|
156 |
AList.merge (op =) (K true) (operations1, operations2))); |
24218 | 157 |
|
158 |
structure ClassData = TheoryDataFun |
|
159 |
( |
|
25038 | 160 |
type T = class_data Graph.T |
161 |
val empty = Graph.empty; |
|
24218 | 162 |
val copy = I; |
163 |
val extend = I; |
|
25038 | 164 |
fun merge _ = Graph.join merge_class_data; |
24218 | 165 |
); |
166 |
||
167 |
||
168 |
(* queries *) |
|
169 |
||
25038 | 170 |
val lookup_class_data = Option.map rep_class_data oo try o Graph.get_node o ClassData.get; |
24218 | 171 |
|
24589 | 172 |
fun the_class_data thy class = case lookup_class_data thy class |
25020 | 173 |
of NONE => error ("Undeclared class " ^ quote class) |
24589 | 174 |
| SOME data => data; |
24218 | 175 |
|
25038 | 176 |
val is_class = is_some oo lookup_class_data; |
177 |
||
178 |
val ancestry = Graph.all_succs o ClassData.get; |
|
24218 | 179 |
|
25002 | 180 |
fun these_params thy = |
24218 | 181 |
let |
182 |
fun params class = |
|
183 |
let |
|
24930
cc2e0e8c81af
renamed AxClass.get_definition to AxClass.get_info (again);
wenzelm
parents:
24920
diff
changeset
|
184 |
val const_typs = (#params o AxClass.get_info thy) class; |
24657 | 185 |
val const_names = (#consts o the_class_data thy) class; |
24218 | 186 |
in |
187 |
(map o apsnd) (fn c => (c, (the o AList.lookup (op =) const_typs) c)) const_names |
|
188 |
end; |
|
189 |
in maps params o ancestry thy end; |
|
190 |
||
24657 | 191 |
fun these_defs thy = maps (these o Option.map #defs o lookup_class_data thy) o ancestry thy; |
24218 | 192 |
|
25711 | 193 |
fun partial_morphism thy class = #morphism (the_class_data thy class) thy []; |
194 |
fun morphism thy class = #morphism (the_class_data thy class) thy (these_defs thy [class]); |
|
25062 | 195 |
|
25618 | 196 |
fun these_assm_intros thy = |
197 |
Graph.fold (fn (_, (data, _)) => fold (insert Thm.eq_thm) |
|
198 |
((the_list o #assm_intro o rep_class_data) data)) (ClassData.get thy) []; |
|
24218 | 199 |
|
24836 | 200 |
fun these_operations thy = |
201 |
maps (#operations o the_class_data thy) o ancestry thy; |
|
24657 | 202 |
|
24218 | 203 |
fun print_classes thy = |
204 |
let |
|
24920 | 205 |
val ctxt = ProofContext.init thy; |
24218 | 206 |
val algebra = Sign.classes_of thy; |
207 |
val arities = |
|
208 |
Symtab.empty |
|
209 |
|> Symtab.fold (fn (tyco, arities) => fold (fn (class, _) => |
|
210 |
Symtab.map_default (class, []) (insert (op =) tyco)) arities) |
|
211 |
((#arities o Sorts.rep_algebra) algebra); |
|
212 |
val the_arities = these o Symtab.lookup arities; |
|
213 |
fun mk_arity class tyco = |
|
214 |
let |
|
215 |
val Ss = Sorts.mg_domain algebra tyco [class]; |
|
24920 | 216 |
in Syntax.pretty_arity ctxt (tyco, Ss, [class]) end; |
24218 | 217 |
fun mk_param (c, ty) = Pretty.str (Sign.extern_const thy c ^ " :: " |
24920 | 218 |
^ setmp show_sorts false (Syntax.string_of_typ ctxt o Type.strip_sorts) ty); |
24218 | 219 |
fun mk_entry class = (Pretty.block o Pretty.fbreaks o map_filter I) [ |
25062 | 220 |
(SOME o Pretty.str) ("class " ^ Sign.extern_class thy class ^ ":"), |
24218 | 221 |
(SOME o Pretty.block) [Pretty.str "supersort: ", |
24920 | 222 |
(Syntax.pretty_sort ctxt o Sign.minimize_sort thy o Sign.super_classes thy) class], |
25062 | 223 |
if is_class thy class then (SOME o Pretty.str) |
224 |
("locale: " ^ Locale.extern thy class) else NONE, |
|
225 |
((fn [] => NONE | ps => (SOME o Pretty.block o Pretty.fbreaks) |
|
226 |
(Pretty.str "parameters:" :: ps)) o map mk_param |
|
24930
cc2e0e8c81af
renamed AxClass.get_definition to AxClass.get_info (again);
wenzelm
parents:
24920
diff
changeset
|
227 |
o these o Option.map #params o try (AxClass.get_info thy)) class, |
24218 | 228 |
(SOME o Pretty.block o Pretty.breaks) [ |
229 |
Pretty.str "instances:", |
|
230 |
Pretty.list "" "" (map (mk_arity class) (the_arities class)) |
|
231 |
] |
|
232 |
] |
|
233 |
in |
|
24589 | 234 |
(Pretty.writeln o Pretty.chunks o separate (Pretty.str "") |
235 |
o map mk_entry o Sorts.all_classes) algebra |
|
24218 | 236 |
end; |
237 |
||
238 |
||
239 |
(* updaters *) |
|
240 |
||
25618 | 241 |
fun add_class_data ((class, superclasses), |
25711 | 242 |
(params, base_sort, inst, phi, axiom, assm_intro, of_class)) thy = |
25002 | 243 |
let |
25368
f12613fda79d
proper implementation of check phase; non-qualified names for class operations
haftmann
parents:
25344
diff
changeset
|
244 |
val operations = map (fn (v_ty as (_, ty), (c, _)) => |
25683 | 245 |
(c, (class, (ty, Free v_ty)))) params; |
25038 | 246 |
val add_class = Graph.new_node (class, |
25683 | 247 |
mk_class_data (((map o pairself) fst params, base_sort, |
25618 | 248 |
map (SOME o Const) inst, phi, assm_intro, of_class, axiom), ([], operations))) |
25002 | 249 |
#> fold (curry Graph.add_edge class) superclasses; |
25618 | 250 |
in ClassData.map add_class thy end; |
24218 | 251 |
|
25368
f12613fda79d
proper implementation of check phase; non-qualified names for class operations
haftmann
parents:
25344
diff
changeset
|
252 |
fun register_operation class (c, (t, some_def)) thy = |
25062 | 253 |
let |
25368
f12613fda79d
proper implementation of check phase; non-qualified names for class operations
haftmann
parents:
25344
diff
changeset
|
254 |
val base_sort = (#base_sort o the_class_data thy) class; |
25239 | 255 |
val prep_typ = map_atyps |
25368
f12613fda79d
proper implementation of check phase; non-qualified names for class operations
haftmann
parents:
25344
diff
changeset
|
256 |
(fn TVar (vi as (v, _), sort) => if Name.aT = v |
f12613fda79d
proper implementation of check phase; non-qualified names for class operations
haftmann
parents:
25344
diff
changeset
|
257 |
then TFree (v, base_sort) else TVar (vi, sort)); |
f12613fda79d
proper implementation of check phase; non-qualified names for class operations
haftmann
parents:
25344
diff
changeset
|
258 |
val t' = map_types prep_typ t; |
f12613fda79d
proper implementation of check phase; non-qualified names for class operations
haftmann
parents:
25344
diff
changeset
|
259 |
val ty' = Term.fastype_of t'; |
25062 | 260 |
in |
261 |
thy |
|
262 |
|> (ClassData.map o Graph.map_node class o map_class_data o apsnd) |
|
25368
f12613fda79d
proper implementation of check phase; non-qualified names for class operations
haftmann
parents:
25344
diff
changeset
|
263 |
(fn (defs, operations) => |
25096 | 264 |
(fold cons (the_list some_def) defs, |
25368
f12613fda79d
proper implementation of check phase; non-qualified names for class operations
haftmann
parents:
25344
diff
changeset
|
265 |
(c, (class, (ty', t'))) :: operations)) |
25062 | 266 |
end; |
24218 | 267 |
|
24589 | 268 |
|
269 |
(** rule calculation, tactics and methods **) |
|
270 |
||
25024 | 271 |
val class_prefix = Logic.const_of_class o Sign.base_name; |
272 |
||
26247 | 273 |
fun calculate sups base_sort assm_axiom param_map class thy = |
25062 | 274 |
let |
25711 | 275 |
(*static parts of morphism*) |
25683 | 276 |
val subst_typ = map_atyps (fn TFree (v, sort) => |
277 |
if v = Name.aT then TVar ((v, 0), [class]) else TVar ((v, 0), sort) |
|
278 |
| ty => ty); |
|
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); |
|
287 |
val instantiate_base_sort = instantiate thy base_sort; |
|
288 |
val instantiate_class = instantiate thy [class]; |
|
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 |
294 |
|> Option.map (Drule.standard o (fn thm => thm OF axiom_premises) o instantiate_class) |
|
295 |
|> (fn x as SOME _ => x | NONE => assm_axiom); |
|
296 |
val lift_axiom = case axiom |
|
297 |
of SOME axiom => (fn thm => Thm.implies_elim thm axiom) |
|
25683 | 298 |
| NONE => I; |
25062 | 299 |
|
25711 | 300 |
(*dynamic parts of morphism*) |
301 |
fun rew_term thy defs = Pattern.rewrite_term thy |
|
302 |
(map (Logic.dest_equals o Thm.prop_of) defs) []; |
|
303 |
fun subst_term thy defs = map_aterms subst_aterm #> rew_term thy defs |
|
304 |
#> map_types subst_typ; |
|
305 |
fun subst_thm defs = Drule.standard' #> instantiate_class #> lift_axiom |
|
306 |
#> MetaSimplifier.rewrite_rule defs; |
|
307 |
fun morphism thy defs = |
|
308 |
Morphism.typ_morphism subst_typ |
|
309 |
$> Morphism.term_morphism (subst_term thy defs) |
|
310 |
$> Morphism.thm_morphism (subst_thm defs); |
|
311 |
||
312 |
(*class rules*) |
|
313 |
val defs = these_defs thy sups; |
|
25618 | 314 |
val assm_intro = proto_assm_intro |
25711 | 315 |
|> Option.map instantiate_base_sort |
316 |
|> Option.map (MetaSimplifier.rewrite_rule defs) |
|
25668 | 317 |
|> Option.map Goal.close_result; |
26247 | 318 |
val class_intro = (#intro o AxClass.get_info thy) class; |
25711 | 319 |
val fixate = Thm.instantiate |
320 |
(map (pairself (Thm.ctyp_of thy)) [(TVar ((Name.aT, 0), []), TFree (Name.aT, base_sort)), |
|
321 |
(TVar ((Name.aT, 0), base_sort), TFree (Name.aT, base_sort))], []) |
|
25618 | 322 |
val of_class_sups = if null sups |
25711 | 323 |
then map (fixate o Thm.class_triv thy) base_sort |
324 |
else map (fixate o #of_class o the_class_data thy) sups; |
|
25683 | 325 |
val locale_dests = map Drule.standard' (Locale.dests thy class); |
25711 | 326 |
val num_trivs = case length locale_dests |
327 |
of 0 => if is_none axiom then 0 else 1 |
|
328 |
| n => n; |
|
329 |
val pred_trivs = if num_trivs = 0 then [] |
|
330 |
else the axiom |
|
331 |
|> Thm.prop_of |
|
332 |
|> (map_types o map_atyps o K) (TFree (Name.aT, base_sort)) |
|
333 |
|> (Thm.assume o Thm.cterm_of thy) |
|
334 |
|> replicate num_trivs; |
|
26247 | 335 |
val of_class = (fixate class_intro OF of_class_sups OF locale_dests OF pred_trivs) |
25711 | 336 |
|> Drule.standard' |
25668 | 337 |
|> Goal.close_result; |
26247 | 338 |
val this_intro = assm_intro |> the_default class_intro; |
339 |
in |
|
340 |
thy |
|
341 |
|> Sign.sticky_prefix (class_prefix class ^ "_" ^ AxClass.axiomsN) |
|
342 |
|> PureThy.note Thm.internalK (AxClass.introN, this_intro) |
|
343 |
|> snd |
|
344 |
|> Sign.restore_naming thy |
|
345 |
|> pair (morphism, axiom, assm_intro, of_class) |
|
346 |
end; |
|
24589 | 347 |
|
348 |
fun class_interpretation class facts defs thy = |
|
349 |
let |
|
25038 | 350 |
val params = these_params thy [class]; |
26238 | 351 |
val consts = map (fst o snd) params; |
352 |
val constraints = map (fn c => map_atyps (K (TFree (Name.aT, |
|
353 |
[the (AxClass.class_of_param thy c)]))) (Sign.the_const_type thy c)) consts; |
|
354 |
val no_constraints = map (map_atyps (K (TFree (Name.aT, [])))) constraints; |
|
355 |
fun add_constraint c T = Sign.add_const_constraint (c, SOME T); |
|
25083 | 356 |
val inst = (#inst o the_class_data thy) class; |
25020 | 357 |
val tac = ALLGOALS (ProofContext.fact_tac facts); |
25038 | 358 |
val prfx = class_prefix class; |
24589 | 359 |
in |
25038 | 360 |
thy |
26238 | 361 |
|> fold2 add_constraint consts no_constraints |
362 |
|> prove_interpretation tac ((false, prfx), []) (Locale.Locale class) |
|
25094
ba43514068fd
Interpretation equations may have name and/or attribute.
ballarin
parents:
25083
diff
changeset
|
363 |
(inst, map (fn def => (("", []), def)) defs) |
26238 | 364 |
|> fold2 add_constraint consts constraints |
24589 | 365 |
end; |
24218 | 366 |
|
25618 | 367 |
fun prove_subclass (sub, sup) thm thy = |
368 |
let |
|
25711 | 369 |
val of_class = (#of_class o the_class_data thy) sup; |
25683 | 370 |
val intro = Drule.standard' (of_class OF [Drule.standard' thm]); |
25618 | 371 |
val classrel = intro OF (the_list o #axiom o the_class_data thy) sub; |
372 |
in |
|
373 |
thy |
|
374 |
|> AxClass.add_classrel classrel |
|
375 |
|> prove_interpretation_in (ALLGOALS (ProofContext.fact_tac [thm])) |
|
376 |
I (sub, Locale.Locale sup) |
|
377 |
|> ClassData.map (Graph.add_edge (sub, sup)) |
|
378 |
end; |
|
379 |
||
24218 | 380 |
fun intro_classes_tac facts st = |
381 |
let |
|
382 |
val thy = Thm.theory_of_thm st; |
|
383 |
val classes = Sign.all_classes thy; |
|
384 |
val class_trivs = map (Thm.class_triv thy) classes; |
|
25618 | 385 |
val class_intros = map_filter (try (#intro o AxClass.get_info thy)) classes; |
386 |
val assm_intros = these_assm_intros thy; |
|
24218 | 387 |
in |
25618 | 388 |
Method.intros_tac (class_trivs @ class_intros @ assm_intros) facts st |
24218 | 389 |
end; |
390 |
||
391 |
fun default_intro_classes_tac [] = intro_classes_tac [] |
|
24930
cc2e0e8c81af
renamed AxClass.get_definition to AxClass.get_info (again);
wenzelm
parents:
24920
diff
changeset
|
392 |
| default_intro_classes_tac _ = no_tac; |
24218 | 393 |
|
394 |
fun default_tac rules ctxt facts = |
|
395 |
HEADGOAL (Method.some_rule_tac rules ctxt facts) ORELSE |
|
396 |
default_intro_classes_tac facts; |
|
397 |
||
398 |
val _ = Context.add_setup (Method.add_methods |
|
399 |
[("intro_classes", Method.no_args (Method.METHOD intro_classes_tac), |
|
400 |
"back-chain introduction rules of classes"), |
|
401 |
("default", Method.thms_ctxt_args (Method.METHOD oo default_tac), |
|
402 |
"apply some intro/elim rule")]); |
|
403 |
||
404 |
||
24589 | 405 |
(** classes and class target **) |
24218 | 406 |
|
25002 | 407 |
(* class context syntax *) |
24748 | 408 |
|
26238 | 409 |
fun synchronize_class_syntax sups base_sort ctxt = |
24914
95cda5dd58d5
added proper subclass concept; improved class target
haftmann
parents:
24901
diff
changeset
|
410 |
let |
25344
00c2179db769
synchronize_syntax: improved declare_const (still inactive);
wenzelm
parents:
25326
diff
changeset
|
411 |
val thy = ProofContext.theory_of ctxt; |
25368
f12613fda79d
proper implementation of check phase; non-qualified names for class operations
haftmann
parents:
25344
diff
changeset
|
412 |
fun subst_class_typ sort = map_atyps |
f12613fda79d
proper implementation of check phase; non-qualified names for class operations
haftmann
parents:
25344
diff
changeset
|
413 |
(fn TFree _ => TVar ((Name.aT, 0), sort) | ty' => ty'); |
25083 | 414 |
val operations = these_operations thy sups; |
25368
f12613fda79d
proper implementation of check phase; non-qualified names for class operations
haftmann
parents:
25344
diff
changeset
|
415 |
val local_constraints = |
f12613fda79d
proper implementation of check phase; non-qualified names for class operations
haftmann
parents:
25344
diff
changeset
|
416 |
(map o apsnd) (subst_class_typ base_sort o fst o snd) operations; |
f12613fda79d
proper implementation of check phase; non-qualified names for class operations
haftmann
parents:
25344
diff
changeset
|
417 |
val global_constraints = |
f12613fda79d
proper implementation of check phase; non-qualified names for class operations
haftmann
parents:
25344
diff
changeset
|
418 |
(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
|
419 |
fun declare_const (c, _) = |
c8352b38d47d
synchronize_syntax: declare operations within the local scope of fixes/consts
wenzelm
parents:
25311
diff
changeset
|
420 |
let val b = Sign.base_name c |
25344
00c2179db769
synchronize_syntax: improved declare_const (still inactive);
wenzelm
parents:
25326
diff
changeset
|
421 |
in Sign.intern_const thy b = c ? Variable.declare_const (b, c) end; |
26238 | 422 |
fun improve (c, ty) = (case AList.lookup (op =) local_constraints c |
423 |
of SOME ty' => (case try (Type.raw_match (ty', ty)) Vartab.empty |
|
424 |
of SOME tyenv => (case Vartab.lookup tyenv (Name.aT, 0) |
|
425 |
of SOME (_, ty' as TVar (tvar as (vi, _))) => |
|
426 |
if TypeInfer.is_param vi |
|
427 |
then SOME (ty', TFree (Name.aT, base_sort)) |
|
428 |
else NONE |
|
429 |
| _ => NONE) |
|
430 |
| NONE => NONE) |
|
431 |
| NONE => NONE) |
|
432 |
fun subst (c, ty) = Option.map snd (AList.lookup (op =) operations c); |
|
25368
f12613fda79d
proper implementation of check phase; non-qualified names for class operations
haftmann
parents:
25344
diff
changeset
|
433 |
val unchecks = map (fn (c, (_, (ty, t))) => (t, Const (c, ty))) operations; |
25083 | 434 |
in |
435 |
ctxt |
|
25368
f12613fda79d
proper implementation of check phase; non-qualified names for class operations
haftmann
parents:
25344
diff
changeset
|
436 |
|> fold declare_const local_constraints |
26247 | 437 |
|> Overloading.map_improvable_syntax (K (((local_constraints, global_constraints), |
438 |
((improve, subst), unchecks)), false)) |
|
26259 | 439 |
|> Overloading.set_local_constraints |
25083 | 440 |
end; |
441 |
||
442 |
fun refresh_syntax class ctxt = |
|
25002 | 443 |
let |
444 |
val thy = ProofContext.theory_of ctxt; |
|
25062 | 445 |
val base_sort = (#base_sort o the_class_data thy) class; |
26238 | 446 |
in synchronize_class_syntax [class] base_sort ctxt end; |
25002 | 447 |
|
25344
00c2179db769
synchronize_syntax: improved declare_const (still inactive);
wenzelm
parents:
25326
diff
changeset
|
448 |
fun init_ctxt sups base_sort ctxt = |
25083 | 449 |
ctxt |
450 |
|> Variable.declare_term |
|
451 |
(Logic.mk_type (TFree (Name.aT, base_sort))) |
|
26238 | 452 |
|> synchronize_class_syntax sups base_sort |
453 |
|> Overloading.add_improvable_syntax; |
|
24901
d3cbf79769b9
added first version of user-space type system for class target
haftmann
parents:
24847
diff
changeset
|
454 |
|
25311 | 455 |
fun init class thy = |
456 |
thy |
|
457 |
|> Locale.init class |
|
25344
00c2179db769
synchronize_syntax: improved declare_const (still inactive);
wenzelm
parents:
25326
diff
changeset
|
458 |
|> 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
|
459 |
|
24748 | 460 |
|
24589 | 461 |
(* class definition *) |
24218 | 462 |
|
463 |
local |
|
464 |
||
26247 | 465 |
fun gen_class_spec prep_class process_expr thy raw_supclasses raw_elems = |
24218 | 466 |
let |
24748 | 467 |
val supclasses = map (prep_class thy) raw_supclasses; |
468 |
val supsort = Sign.minimize_sort thy supclasses; |
|
25618 | 469 |
val sups = filter (is_class thy) supsort; |
470 |
val base_sort = if null sups then supsort else |
|
26167 | 471 |
foldr1 (Sorts.inter_sort (Sign.classes_of thy)) |
472 |
(map (#base_sort o the_class_data thy) sups); |
|
25038 | 473 |
val suplocales = map Locale.Locale sups; |
24748 | 474 |
val supexpr = Locale.Merge suplocales; |
475 |
val supparams = (map fst o Locale.parameters_of_expr thy) supexpr; |
|
26247 | 476 |
val mergeexpr = Locale.Merge (suplocales); |
24748 | 477 |
val constrain = Element.Constrains ((map o apsnd o map_atyps) |
26167 | 478 |
(K (TFree (Name.aT, base_sort))) supparams); |
25683 | 479 |
fun fork_syn (Element.Fixes xs) = |
480 |
fold_map (fn (c, ty, syn) => cons (c, syn) #> pair (c, ty, NoSyn)) xs |
|
481 |
#>> Element.Fixes |
|
482 |
| fork_syn x = pair x; |
|
483 |
fun fork_syntax elems = |
|
484 |
let |
|
485 |
val (elems', global_syntax) = fold_map fork_syn elems []; |
|
26247 | 486 |
in (constrain :: elems', global_syntax) end; |
25683 | 487 |
val (elems, global_syntax) = |
488 |
ProofContext.init thy |
|
489 |
|> Locale.cert_expr supexpr [constrain] |
|
490 |
|> snd |
|
491 |
|> init_ctxt sups base_sort |
|
492 |
|> process_expr Locale.empty raw_elems |
|
493 |
|> fst |
|
494 |
|> fork_syntax |
|
495 |
in (((sups, supparams), (supsort, base_sort, mergeexpr)), (elems, global_syntax)) end; |
|
24748 | 496 |
|
26247 | 497 |
val read_class_spec = gen_class_spec Sign.intern_class Locale.read_expr; |
498 |
val check_class_spec = gen_class_spec (K I) Locale.cert_expr; |
|
24748 | 499 |
|
25683 | 500 |
fun adjungate_axclass bname class base_sort sups supsort supparams global_syntax other_consts thy = |
24968
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset
|
501 |
let |
25683 | 502 |
val supconsts = map fst supparams |
503 |
|> AList.make (the o AList.lookup (op =) (these_params thy sups)) |
|
504 |
|> (map o apsnd o apsnd o map_atyps o K o TFree) (Name.aT, [class]); |
|
505 |
val all_params = map fst (Locale.parameters_of thy class); |
|
506 |
fun add_const (v, raw_ty) thy = |
|
507 |
let |
|
508 |
val c = Sign.full_name thy v; |
|
509 |
val ty = map_atyps (K (TFree (Name.aT, base_sort))) raw_ty; |
|
510 |
val ty0 = Type.strip_sorts ty; |
|
511 |
val ty' = map_atyps (K (TFree (Name.aT, [class]))) ty0; |
|
512 |
val syn = (the_default NoSyn o AList.lookup (op =) global_syntax) v; |
|
513 |
in |
|
514 |
thy |
|
515 |
|> Sign.declare_const [] (v, ty0, syn) |
|
516 |
|> snd |
|
517 |
|> pair ((v, ty), (c, ty')) |
|
518 |
end; |
|
519 |
fun add_consts raw_params thy = |
|
520 |
thy |
|
521 |
|> Sign.add_path (Logic.const_of_class bname) |
|
522 |
|> fold_map add_const raw_params |
|
523 |
||> Sign.restore_naming thy |
|
524 |
|-> (fn params => pair (supconsts @ (map o apfst) fst params, params)); |
|
525 |
fun globalize param_map = map_aterms |
|
526 |
(fn Free (v, ty) => Const ((fst o the o AList.lookup (op =) param_map) v, ty) |
|
527 |
| t => t); |
|
528 |
val raw_pred = Locale.intros thy class |
|
529 |
|> fst |
|
530 |
|> map (Logic.unvarify o Logic.strip_imp_concl o Thm.prop_of); |
|
531 |
fun get_axiom thy = case (#axioms o AxClass.get_info thy) class |
|
532 |
of [] => NONE |
|
533 |
| [thm] => SOME thm; |
|
24968
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset
|
534 |
in |
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset
|
535 |
thy |
25683 | 536 |
|> add_consts ((snd o chop (length supparams)) all_params) |
537 |
|-> (fn (param_map, params) => AxClass.define_class (bname, supsort) |
|
538 |
(map (fst o snd) params @ other_consts) |
|
539 |
[((bname ^ "_" ^ AxClass.axiomsN, []), map (globalize param_map) raw_pred)] |
|
540 |
#> snd |
|
541 |
#> `get_axiom |
|
542 |
#-> (fn assm_axiom => fold (Sign.add_const_constraint o apsnd SOME o snd) params |
|
543 |
#> pair (param_map, params, assm_axiom))) |
|
24968
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset
|
544 |
end; |
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset
|
545 |
|
25002 | 546 |
fun gen_class prep_spec prep_param bname |
26247 | 547 |
raw_supclasses raw_elems raw_other_consts thy = |
24748 | 548 |
let |
25038 | 549 |
val class = Sign.full_name thy bname; |
25683 | 550 |
val (((sups, supparams), (supsort, base_sort, mergeexpr)), (elems, global_syntax)) = |
26247 | 551 |
prep_spec thy raw_supclasses raw_elems; |
24968
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset
|
552 |
val other_consts = map (tap (Sign.the_const_type thy) o prep_param thy) raw_other_consts; |
24218 | 553 |
in |
554 |
thy |
|
24748 | 555 |
|> Locale.add_locale_i (SOME "") bname mergeexpr elems |
25038 | 556 |
|> snd |
25311 | 557 |
|> ProofContext.theory_of |
25683 | 558 |
|> adjungate_axclass bname class base_sort sups supsort supparams global_syntax other_consts |
559 |
|-> (fn (param_map, params, assm_axiom) => |
|
26247 | 560 |
calculate sups base_sort assm_axiom param_map class |
25711 | 561 |
#-> (fn (morphism, axiom, assm_intro, of_class) => |
25683 | 562 |
add_class_data ((class, sups), (params, base_sort, |
25711 | 563 |
map snd param_map, morphism, axiom, assm_intro, of_class)) |
25683 | 564 |
#> class_interpretation class (the_list axiom) [])) |
25268 | 565 |
|> init class |
25038 | 566 |
|> pair class |
24218 | 567 |
end; |
568 |
||
25326 | 569 |
fun read_const thy = #1 o Term.dest_Const o ProofContext.read_const (ProofContext.init thy); |
570 |
||
24218 | 571 |
in |
572 |
||
25326 | 573 |
val class_cmd = gen_class read_class_spec read_const; |
24748 | 574 |
val class = gen_class check_class_spec (K I); |
24218 | 575 |
|
576 |
end; (*local*) |
|
577 |
||
578 |
||
25485 | 579 |
(* class target *) |
24218 | 580 |
|
25603 | 581 |
fun declare class pos ((c, mx), dict) thy = |
24218 | 582 |
let |
25024 | 583 |
val prfx = class_prefix class; |
584 |
val thy' = thy |> Sign.add_path prfx; |
|
25711 | 585 |
val phi = partial_morphism thy' class; |
25024 | 586 |
|
25062 | 587 |
val c' = Sign.full_name thy' c; |
25239 | 588 |
val dict' = Morphism.term phi dict; |
589 |
val dict_def = map_types Logic.unvarifyT dict'; |
|
590 |
val ty' = Term.fastype_of dict_def; |
|
25083 | 591 |
val ty'' = Type.strip_sorts ty'; |
25239 | 592 |
val def_eq = Logic.mk_equals (Const (c', ty'), dict_def); |
26247 | 593 |
fun get_axiom thy = ((Thm.varifyT o Thm.get_axiom_i thy) c', thy); |
24218 | 594 |
in |
25024 | 595 |
thy' |
25096 | 596 |
|> Sign.declare_const pos (c, ty'', mx) |> snd |
25518 | 597 |
|> Thm.add_def false false (c, def_eq) |
25062 | 598 |
|>> Thm.symmetric |
25618 | 599 |
||>> get_axiom |
600 |
|-> (fn (def, def') => class_interpretation class [def] [Thm.prop_of def] |
|
26247 | 601 |
#> register_operation class (c', (dict', SOME (Thm.symmetric def'))) |
602 |
#> PureThy.note Thm.internalK (c, def') |
|
603 |
#> snd) |
|
24218 | 604 |
|> Sign.restore_naming thy |
25083 | 605 |
|> Sign.add_const_constraint (c', SOME ty') |
24218 | 606 |
end; |
607 |
||
25603 | 608 |
fun abbrev class prmode pos ((c, mx), rhs) thy = |
24836 | 609 |
let |
25024 | 610 |
val prfx = class_prefix class; |
25096 | 611 |
val thy' = thy |> Sign.add_path prfx; |
25062 | 612 |
val phi = morphism thy class; |
613 |
||
25096 | 614 |
val c' = Sign.full_name thy' c; |
25711 | 615 |
val rhs' = Morphism.term phi rhs; |
25239 | 616 |
val ty' = Logic.unvarifyT (Term.fastype_of rhs'); |
24836 | 617 |
in |
25096 | 618 |
thy' |
25146 | 619 |
|> Sign.add_abbrev (#1 prmode) pos (c, map_types Type.strip_sorts rhs') |> snd |
25096 | 620 |
|> Sign.add_const_constraint (c', SOME ty') |
25024 | 621 |
|> Sign.notation true prmode [(Const (c', ty'), mx)] |
25368
f12613fda79d
proper implementation of check phase; non-qualified names for class operations
haftmann
parents:
25344
diff
changeset
|
622 |
|> register_operation class (c', (rhs', NONE)) |
25096 | 623 |
|> Sign.restore_naming thy |
24836 | 624 |
end; |
625 |
||
25462 | 626 |
|
627 |
(** instantiation target **) |
|
628 |
||
629 |
(* bookkeeping *) |
|
630 |
||
631 |
datatype instantiation = Instantiation of { |
|
25864 | 632 |
arities: string list * (string * sort) list * sort, |
25462 | 633 |
params: ((string * string) * (string * typ)) list |
25603 | 634 |
(*(instantiation parameter, type constructor), (local instantiation parameter, typ)*) |
25462 | 635 |
} |
636 |
||
637 |
structure Instantiation = ProofDataFun |
|
638 |
( |
|
639 |
type T = instantiation |
|
25536 | 640 |
fun init _ = Instantiation { arities = ([], [], []), params = [] }; |
25462 | 641 |
); |
642 |
||
25485 | 643 |
fun mk_instantiation (arities, params) = |
644 |
Instantiation { arities = arities, params = params }; |
|
25514 | 645 |
fun get_instantiation lthy = case Instantiation.get (LocalTheory.target_of lthy) |
25485 | 646 |
of Instantiation data => data; |
25514 | 647 |
fun map_instantiation f = (LocalTheory.target o Instantiation.map) |
648 |
(fn Instantiation { arities, params } => mk_instantiation (f (arities, params))); |
|
25462 | 649 |
|
25514 | 650 |
fun the_instantiation lthy = case get_instantiation lthy |
25536 | 651 |
of { arities = ([], [], []), ... } => error "No instantiation target" |
25485 | 652 |
| data => data; |
25462 | 653 |
|
25485 | 654 |
val instantiation_params = #params o get_instantiation; |
25462 | 655 |
|
25514 | 656 |
fun instantiation_param lthy v = instantiation_params lthy |
25462 | 657 |
|> find_first (fn (_, (v', _)) => v = v') |
658 |
|> Option.map (fst o fst); |
|
659 |
||
660 |
||
661 |
(* syntax *) |
|
662 |
||
26238 | 663 |
fun synchronize_inst_syntax ctxt = |
25462 | 664 |
let |
26259 | 665 |
val Instantiation { arities = (_, _, sort), params = params } = Instantiation.get ctxt; |
26238 | 666 |
val thy = ProofContext.theory_of ctxt; |
667 |
fun subst_class_typ sort = map_atyps |
|
668 |
(fn TFree _ => TVar ((Name.aT, 0), sort) | ty' => ty'); |
|
26259 | 669 |
val operations = these_operations thy sort; |
670 |
val global_constraints = (*map_filter (fn (c, (class, (ty, _))) => |
|
26238 | 671 |
if exists (fn ((c', _), _) => c = c') params |
672 |
then SOME (c, subst_class_typ [class] ty) |
|
26259 | 673 |
else NONE) operations;*)[]; |
26238 | 674 |
(*| NONE => (case map_filter |
675 |
(fn ((c', _), (_, ty')) => if c' = c then SOME ty' else NONE) params |
|
676 |
of [ty'] => (case Sign.const_typargs thy (c, ty) |
|
677 |
of [TVar (vi, _)] => if TypeInfer.is_param vi then SOME (ty, ty') else NONE |
|
678 |
| _ => NONE) |
|
679 |
| _ => NONE*); |
|
680 |
fun subst (c, ty) = case AxClass.inst_tyco_of thy (c, ty) |
|
681 |
of SOME tyco => (case AList.lookup (op =) params (c, tyco) |
|
682 |
of SOME (v_ty as (_, ty)) => SOME (ty, Free v_ty) |
|
683 |
| NONE => NONE) |
|
684 |
| NONE => NONE; |
|
685 |
val unchecks = |
|
686 |
map (fn ((c, _), v_ty as (_, ty)) => (Free v_ty, Const (c, ty))) params; |
|
687 |
in |
|
688 |
ctxt |
|
26259 | 689 |
|> Overloading.map_improvable_syntax |
690 |
(fn (((local_constraints, _), ((improve, _), _)), _) => |
|
691 |
(((local_constraints, global_constraints), ((improve, subst), unchecks)), false)) |
|
26238 | 692 |
end; |
25462 | 693 |
|
694 |
||
695 |
(* target *) |
|
696 |
||
25485 | 697 |
val sanatize_name = (*FIXME*) |
698 |
let |
|
25574 | 699 |
fun is_valid s = Symbol.is_ascii_letter s orelse Symbol.is_ascii_digit s |
700 |
orelse s = "'" orelse s = "_"; |
|
25485 | 701 |
val is_junk = not o is_valid andf Symbol.is_regular; |
702 |
val junk = Scan.many is_junk; |
|
703 |
val scan_valids = Symbol.scanner "Malformed input" |
|
704 |
((junk |-- |
|
705 |
(Scan.optional (Scan.one Symbol.is_ascii_letter) "x" ^^ (Scan.many is_valid >> implode) |
|
706 |
--| junk)) |
|
25999 | 707 |
::: Scan.repeat ((Scan.many1 is_valid >> implode) --| junk)); |
25485 | 708 |
in |
709 |
explode #> scan_valids #> implode |
|
710 |
end; |
|
711 |
||
26259 | 712 |
fun type_name "*" = "prod" |
713 |
| type_name "+" = "sum" |
|
714 |
| type_name s = sanatize_name (NameSpace.base s); (*FIXME*) |
|
715 |
||
25864 | 716 |
fun init_instantiation (tycos, vs, sort) thy = |
25462 | 717 |
let |
25536 | 718 |
val _ = if null tycos then error "At least one arity must be given" else (); |
26259 | 719 |
fun subst_class_typ sort = map_atyps |
720 |
(fn TFree _ => TVar ((Name.aT, 0), sort) | ty' => ty'); |
|
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25574
diff
changeset
|
721 |
fun get_param tyco (param, (c, ty)) = if can (AxClass.param_of_inst thy) (c, tyco) |
25603 | 722 |
then NONE else SOME ((c, tyco), |
25864 | 723 |
(param ^ "_" ^ type_name tyco, map_atyps (K (Type (tyco, map TFree vs))) ty)); |
25536 | 724 |
val params = map_product get_param tycos (these_params thy sort) |> map_filter I; |
26259 | 725 |
val operations = these_operations thy sort; |
726 |
val local_constraints = (map o apsnd) (subst_class_typ [] o fst o snd) operations; |
|
727 |
fun improve (c, ty) = case AxClass.inst_tyco_of thy (c, ty) |
|
728 |
of SOME tyco => (case AList.lookup (op =) params (c, tyco) |
|
729 |
of SOME (_, ty') => SOME (ty, ty') |
|
730 |
| NONE => NONE) |
|
731 |
| NONE => NONE; |
|
25485 | 732 |
in |
733 |
thy |
|
734 |
|> ProofContext.init |
|
25864 | 735 |
|> Instantiation.put (mk_instantiation ((tycos, vs, sort), params)) |
736 |
|> fold (Variable.declare_term o Logic.mk_type o TFree) vs |
|
25574 | 737 |
|> fold (Variable.declare_names o Free o snd) params |
26259 | 738 |
|> (Overloading.map_improvable_syntax o apfst) |
739 |
(fn ((_, global_constraints), ((_, subst), unchecks)) => |
|
740 |
((local_constraints, global_constraints), ((improve, subst), unchecks))) |
|
741 |
|> Overloading.add_improvable_syntax |
|
26238 | 742 |
|> synchronize_inst_syntax |
25485 | 743 |
end; |
744 |
||
26238 | 745 |
fun confirm_declaration c = (map_instantiation o apsnd) |
746 |
(filter_out (fn (_, (c', _)) => c' = c)) |
|
747 |
#> LocalTheory.target synchronize_inst_syntax |
|
748 |
||
25485 | 749 |
fun gen_instantiation_instance do_proof after_qed lthy = |
750 |
let |
|
25864 | 751 |
val (tycos, vs, sort) = (#arities o the_instantiation) lthy; |
752 |
val arities_proof = maps (fn tyco => Logic.mk_arities (tyco, map snd vs, sort)) tycos; |
|
25462 | 753 |
fun after_qed' results = |
754 |
LocalTheory.theory (fold (AxClass.add_arity o Thm.varifyT) results) |
|
755 |
#> after_qed; |
|
756 |
in |
|
757 |
lthy |
|
758 |
|> do_proof after_qed' arities_proof |
|
759 |
end; |
|
760 |
||
25485 | 761 |
val instantiation_instance = gen_instantiation_instance (fn after_qed => fn ts => |
25462 | 762 |
Proof.theorem_i NONE (after_qed o map the_single) (map (fn t => [(t, [])]) ts)); |
763 |
||
25485 | 764 |
fun prove_instantiation_instance tac = gen_instantiation_instance (fn after_qed => |
25502 | 765 |
fn ts => fn lthy => after_qed (map (fn t => Goal.prove lthy [] [] t |
766 |
(fn {context, ...} => tac context)) ts) lthy) I; |
|
25462 | 767 |
|
768 |
fun conclude_instantiation lthy = |
|
769 |
let |
|
25485 | 770 |
val { arities, params } = the_instantiation lthy; |
25864 | 771 |
val (tycos, vs, sort) = arities; |
25462 | 772 |
val thy = ProofContext.theory_of lthy; |
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25574
diff
changeset
|
773 |
val _ = map (fn tyco => if Sign.of_sort thy |
25864 | 774 |
(Type (tyco, map TFree vs), sort) |
25462 | 775 |
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
|
776 |
tycos; |
25770 | 777 |
(*this checkpoint should move to AxClass as soon as "attach" has disappeared*) |
778 |
val _ = case map (fst o snd) params |
|
779 |
of [] => () |
|
780 |
| cs => Output.legacy_feature |
|
25829 | 781 |
("Missing specifications for overloaded parameters " ^ commas_quote cs) |
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25574
diff
changeset
|
782 |
in lthy end; |
25462 | 783 |
|
25603 | 784 |
fun pretty_instantiation lthy = |
785 |
let |
|
786 |
val { arities, params } = the_instantiation lthy; |
|
25864 | 787 |
val (tycos, vs, sort) = arities; |
25603 | 788 |
val thy = ProofContext.theory_of lthy; |
25864 | 789 |
fun pr_arity tyco = Syntax.pretty_arity lthy (tyco, map snd vs, sort); |
25603 | 790 |
fun pr_param ((c, _), (v, ty)) = |
25864 | 791 |
(Pretty.block o Pretty.breaks) [Pretty.str v, Pretty.str "==", |
792 |
(Pretty.str o Sign.extern_const thy) c, Pretty.str "::", Sign.pretty_typ thy ty]; |
|
25603 | 793 |
in |
794 |
(Pretty.block o Pretty.fbreaks) |
|
795 |
(Pretty.str "instantiation" :: map pr_arity tycos @ map pr_param params) |
|
796 |
end; |
|
797 |
||
24218 | 798 |
end; |
25683 | 799 |