author | haftmann |
Fri, 26 Oct 2007 21:22:20 +0200 | |
changeset 25209 | bc21d8de18a9 |
parent 25195 | 62638dcafe38 |
child 25210 | 5b5659801257 |
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 |
|
10 |
val axclass_cmd: bstring * xstring list |
|
24589 | 11 |
-> ((bstring * Attrib.src list) * string list) list |
12 |
-> theory -> class * theory |
|
13 |
val classrel_cmd: xstring * xstring -> theory -> Proof.state |
|
24914
95cda5dd58d5
added proper subclass concept; improved class target
haftmann
parents:
24901
diff
changeset
|
14 |
|
25002 | 15 |
val class: bstring -> class list -> Element.context_i Locale.element list |
24218 | 16 |
-> string list -> theory -> string * Proof.context |
25002 | 17 |
val class_cmd: bstring -> xstring list -> Element.context Locale.element list |
24589 | 18 |
-> xstring list -> theory -> string * Proof.context |
25038 | 19 |
val is_class: theory -> class -> bool |
25002 | 20 |
val these_params: theory -> sort -> (string * (string * typ)) list |
25083 | 21 |
val init: class -> Proof.context -> Proof.context |
25096 | 22 |
val add_logical_const: string -> Markup.property list |
25104 | 23 |
-> (string * mixfix) * term -> theory -> theory |
25096 | 24 |
val add_syntactic_const: string -> Syntax.mode -> Markup.property list |
25104 | 25 |
-> (string * mixfix) * term -> theory -> theory |
25083 | 26 |
val refresh_syntax: class -> Proof.context -> Proof.context |
24589 | 27 |
val intro_classes_tac: thm list -> tactic |
28 |
val default_intro_classes_tac: thm list -> tactic |
|
25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
29 |
val prove_subclass: class * class -> thm list -> Proof.context |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
30 |
-> theory -> theory |
24589 | 31 |
val print_classes: theory -> unit |
25002 | 32 |
val uncheck: bool ref |
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset
|
33 |
|
24589 | 34 |
val instance_arity: (theory -> theory) -> arity list -> theory -> Proof.state |
35 |
val instance: arity list -> ((bstring * Attrib.src list) * term) list |
|
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset
|
36 |
-> (thm list -> theory -> theory) |
24218 | 37 |
-> theory -> Proof.state |
24589 | 38 |
val instance_cmd: (bstring * xstring list * xstring) list |
39 |
-> ((bstring * Attrib.src list) * xstring) list |
|
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset
|
40 |
-> (thm list -> theory -> theory) |
24218 | 41 |
-> theory -> Proof.state |
24589 | 42 |
val prove_instance: tactic -> arity list |
24218 | 43 |
-> ((bstring * Attrib.src list) * term) list |
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset
|
44 |
-> theory -> thm list * theory |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset
|
45 |
val unoverload: theory -> conv |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset
|
46 |
val overload: theory -> conv |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset
|
47 |
val unoverload_const: theory -> string * typ -> string |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset
|
48 |
val inst_const: theory -> string * string -> string |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset
|
49 |
val param_const: theory -> string -> (string * string) option |
24218 | 50 |
end; |
51 |
||
52 |
structure Class : CLASS = |
|
53 |
struct |
|
54 |
||
55 |
(** auxiliary **) |
|
56 |
||
25062 | 57 |
val classN = "class"; |
58 |
val introN = "intro"; |
|
59 |
||
25002 | 60 |
fun prove_interpretation tac prfx_atts expr inst = |
61 |
Locale.interpretation_i I prfx_atts expr inst |
|
24589 | 62 |
#> Proof.global_terminal_proof |
63 |
(Method.Basic (K (Method.SIMPLE_METHOD tac), Position.none), NONE) |
|
64 |
#> ProofContext.theory_of; |
|
65 |
||
25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
66 |
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
|
67 |
Locale.interpretation_in_locale |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
68 |
(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
|
69 |
#> Proof.global_terminal_proof |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
70 |
(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
|
71 |
#> ProofContext.theory_of; |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
72 |
|
25020 | 73 |
fun OF_LAST thm1 thm2 = thm1 RSN (Thm.nprems_of thm2, thm2); |
24589 | 74 |
|
75 |
fun strip_all_ofclass thy sort = |
|
76 |
let |
|
24847 | 77 |
val typ = TVar ((Name.aT, 0), sort); |
24589 | 78 |
fun prem_inclass t = |
79 |
case Logic.strip_imp_prems t |
|
80 |
of ofcls :: _ => try Logic.dest_inclass ofcls |
|
81 |
| [] => NONE; |
|
82 |
fun strip_ofclass class thm = |
|
83 |
thm OF (fst o AxClass.of_sort thy (typ, [class])) AxClass.cache; |
|
84 |
fun strip thm = case (prem_inclass o Thm.prop_of) thm |
|
85 |
of SOME (_, class) => thm |> strip_ofclass class |> strip |
|
86 |
| NONE => thm; |
|
87 |
in strip end; |
|
88 |
||
25038 | 89 |
fun get_remove_global_constraint c thy = |
90 |
let |
|
91 |
val ty = Sign.the_const_constraint thy c; |
|
92 |
in |
|
93 |
thy |
|
94 |
|> Sign.add_const_constraint (c, NONE) |
|
95 |
|> pair (c, Logic.unvarifyT ty) |
|
96 |
end; |
|
97 |
||
24589 | 98 |
|
99 |
(** axclass command **) |
|
100 |
||
24218 | 101 |
fun axclass_cmd (class, raw_superclasses) raw_specs thy = |
102 |
let |
|
103 |
val ctxt = ProofContext.init thy; |
|
104 |
val superclasses = map (Sign.read_class thy) raw_superclasses; |
|
24589 | 105 |
val name_atts = map ((apsnd o map) (Attrib.attribute thy) o fst) |
106 |
raw_specs; |
|
107 |
val axiomss = ProofContext.read_propp (ctxt, map (map (rpair []) o snd) |
|
108 |
raw_specs) |
|
24218 | 109 |
|> snd |
110 |
|> (map o map) fst; |
|
24589 | 111 |
in |
112 |
AxClass.define_class (class, superclasses) [] |
|
113 |
(name_atts ~~ axiomss) thy |
|
114 |
end; |
|
24218 | 115 |
|
116 |
local |
|
117 |
||
118 |
fun gen_instance mk_prop add_thm after_qed insts thy = |
|
119 |
let |
|
120 |
fun after_qed' results = |
|
121 |
ProofContext.theory ((fold o fold) add_thm results #> after_qed); |
|
122 |
in |
|
123 |
thy |
|
124 |
|> ProofContext.init |
|
24589 | 125 |
|> Proof.theorem_i NONE after_qed' ((map (fn t => [(t, [])]) |
126 |
o maps (mk_prop thy)) insts) |
|
24218 | 127 |
end; |
128 |
||
129 |
in |
|
130 |
||
24589 | 131 |
val instance_arity = |
24218 | 132 |
gen_instance (Logic.mk_arities oo Sign.cert_arity) AxClass.add_arity; |
24589 | 133 |
val classrel = |
24218 | 134 |
gen_instance (single oo (Logic.mk_classrel oo AxClass.cert_classrel)) |
135 |
AxClass.add_classrel I o single; |
|
24589 | 136 |
val classrel_cmd = |
137 |
gen_instance (single oo (Logic.mk_classrel oo AxClass.read_classrel)) |
|
138 |
AxClass.add_classrel I o single; |
|
24218 | 139 |
|
140 |
end; (*local*) |
|
141 |
||
142 |
||
24589 | 143 |
(** explicit constants for overloaded definitions **) |
24304 | 144 |
|
145 |
structure InstData = TheoryDataFun |
|
146 |
( |
|
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset
|
147 |
type T = (string * thm) Symtab.table Symtab.table * (string * string) Symtab.table; |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset
|
148 |
(*constant name ~> type constructor ~> (constant name, equation), |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset
|
149 |
constant name ~> (constant name, type constructor)*) |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset
|
150 |
val empty = (Symtab.empty, Symtab.empty); |
24304 | 151 |
val copy = I; |
152 |
val extend = I; |
|
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset
|
153 |
fun merge _ ((taba1, tabb1), (taba2, tabb2)) = |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset
|
154 |
(Symtab.join (K (Symtab.merge (K true))) (taba1, taba2), |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset
|
155 |
Symtab.merge (K true) (tabb1, tabb2)); |
24304 | 156 |
); |
157 |
||
25020 | 158 |
fun inst_thms thy = (Symtab.fold (Symtab.fold (cons o snd o snd) o snd) o fst) |
24589 | 159 |
(InstData.get thy) []; |
160 |
fun add_inst (c, tyco) inst = (InstData.map o apfst |
|
161 |
o Symtab.map_default (c, Symtab.empty)) (Symtab.update_new (tyco, inst)) |
|
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset
|
162 |
#> (InstData.map o apsnd) (Symtab.update_new (fst inst, (c, tyco))); |
24304 | 163 |
|
25020 | 164 |
fun unoverload thy = MetaSimplifier.rewrite true (inst_thms thy); |
165 |
fun overload thy = MetaSimplifier.rewrite true (map Thm.symmetric (inst_thms thy)); |
|
24304 | 166 |
|
167 |
fun inst_const thy (c, tyco) = |
|
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset
|
168 |
(fst o the o Symtab.lookup ((the o Symtab.lookup (fst (InstData.get thy))) c)) tyco; |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset
|
169 |
fun unoverload_const thy (c_ty as (c, _)) = |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset
|
170 |
case AxClass.class_of_param thy c |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset
|
171 |
of SOME class => (case Sign.const_typargs thy c_ty |
24589 | 172 |
of [Type (tyco, _)] => (case Symtab.lookup |
173 |
((the o Symtab.lookup (fst (InstData.get thy))) c) tyco |
|
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset
|
174 |
of SOME (c, _) => c |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset
|
175 |
| NONE => c) |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset
|
176 |
| [_] => c) |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset
|
177 |
| NONE => c; |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset
|
178 |
|
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset
|
179 |
val param_const = Symtab.lookup o snd o InstData.get; |
24304 | 180 |
|
181 |
fun add_inst_def (class, tyco) (c, ty) thy = |
|
182 |
let |
|
25024 | 183 |
val tyco_base = Sign.base_name tyco; |
184 |
val name_inst = Sign.base_name class ^ "_" ^ tyco_base ^ "_inst"; |
|
185 |
val c_inst_base = Sign.base_name c ^ "_" ^ tyco_base; |
|
24304 | 186 |
in |
187 |
thy |
|
188 |
|> Sign.sticky_prefix name_inst |
|
25020 | 189 |
|> Sign.declare_const [] (c_inst_base, ty, NoSyn) |
24968
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset
|
190 |
|-> (fn const as Const (c_inst, _) => |
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset
|
191 |
PureThy.add_defs_i false |
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset
|
192 |
[((Thm.def_name c_inst_base, Logic.mk_equals (const, Const (c, ty))), [])] |
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset
|
193 |
#-> (fn [thm] => add_inst (c, tyco) (c_inst, Thm.symmetric thm))) |
24435 | 194 |
|> Sign.restore_naming thy |
24304 | 195 |
end; |
196 |
||
197 |
fun add_inst_def' (class, tyco) (c, ty) thy = |
|
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset
|
198 |
if case Symtab.lookup (fst (InstData.get thy)) c |
24304 | 199 |
of NONE => true |
200 |
| SOME tab => is_none (Symtab.lookup tab tyco) |
|
201 |
then add_inst_def (class, tyco) (c, Logic.unvarifyT ty) thy |
|
202 |
else thy; |
|
203 |
||
204 |
fun add_def ((class, tyco), ((name, prop), atts)) thy = |
|
205 |
let |
|
24589 | 206 |
val ((lhs as Const (c, ty), args), rhs) = |
207 |
(apfst Term.strip_comb o Logic.dest_equals) prop; |
|
24701 | 208 |
fun (*add_inst' def ([], (Const (c_inst, ty))) = |
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset
|
209 |
if forall (fn TFree _ => true | _ => false) (Sign.const_typargs thy (c_inst, ty)) |
24304 | 210 |
then add_inst (c, tyco) (c_inst, def) |
211 |
else add_inst_def (class, tyco) (c, ty) |
|
24701 | 212 |
|*) add_inst' _ t = add_inst_def (class, tyco) (c, ty); |
24304 | 213 |
in |
214 |
thy |
|
25020 | 215 |
|> PureThy.add_defs_i true [((name, prop), map (Attrib.attribute_i thy) atts)] |
24304 | 216 |
|-> (fn [def] => add_inst' def (args, rhs) #> pair def) |
217 |
end; |
|
218 |
||
219 |
||
24589 | 220 |
(** instances with implicit parameter handling **) |
24218 | 221 |
|
222 |
local |
|
223 |
||
24707 | 224 |
fun gen_read_def thy prep_att parse_prop ((raw_name, raw_atts), raw_t) = |
24218 | 225 |
let |
24707 | 226 |
val ctxt = ProofContext.init thy; |
227 |
val t = parse_prop ctxt raw_t |> Syntax.check_prop ctxt; |
|
24981
4ec3f95190bf
dest/cert_def: replaced Pretty.pp by explicit Proof.context;
wenzelm
parents:
24968
diff
changeset
|
228 |
val ((c, ty), _) = Sign.cert_def ctxt t; |
24218 | 229 |
val atts = map (prep_att thy) raw_atts; |
230 |
val insts = Consts.typargs (Sign.consts_of thy) (c, ty); |
|
231 |
val name = case raw_name |
|
232 |
of "" => NONE |
|
233 |
| _ => SOME raw_name; |
|
234 |
in (c, (insts, ((name, t), atts))) end; |
|
235 |
||
24707 | 236 |
fun read_def_cmd thy = gen_read_def thy Attrib.intern_src Syntax.parse_prop; |
24218 | 237 |
fun read_def thy = gen_read_def thy (K I) (K I); |
238 |
||
24589 | 239 |
fun gen_instance prep_arity read_def do_proof raw_arities raw_defs after_qed theory = |
24218 | 240 |
let |
241 |
val arities = map (prep_arity theory) raw_arities; |
|
25020 | 242 |
val _ = if null arities then error "At least one arity must be given" else (); |
24218 | 243 |
val _ = case (duplicates (op =) o map #1) arities |
244 |
of [] => () |
|
25020 | 245 |
| dupl_tycos => error ("Type constructors occur more than once in arities: " |
246 |
^ commas_quote dupl_tycos); |
|
24218 | 247 |
fun get_consts_class tyco ty class = |
248 |
let |
|
24968
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset
|
249 |
val cs = (these o try (#params o AxClass.get_info theory)) class; |
24218 | 250 |
val subst_ty = map_type_tfree (K ty); |
251 |
in |
|
24304 | 252 |
map (fn (c, ty) => (c, ((class, tyco), subst_ty ty))) cs |
24218 | 253 |
end; |
254 |
fun get_consts_sort (tyco, asorts, sort) = |
|
255 |
let |
|
24589 | 256 |
val ty = Type (tyco, map (fn (v, sort) => TVar ((v, 0), sort)) |
24847 | 257 |
(Name.names Name.context Name.aT asorts)) |
24731 | 258 |
in maps (get_consts_class tyco ty) (Sign.complete_sort theory sort) end; |
24218 | 259 |
val cs = maps get_consts_sort arities; |
260 |
fun mk_typnorm thy (ty, ty_sc) = |
|
261 |
case try (Sign.typ_match thy (Logic.varifyT ty_sc, ty)) Vartab.empty |
|
262 |
of SOME env => SOME (Logic.varifyT #> Envir.typ_subst_TVars env #> Logic.unvarifyT) |
|
263 |
| NONE => NONE; |
|
264 |
fun read_defs defs cs thy_read = |
|
265 |
let |
|
266 |
fun read raw_def cs = |
|
267 |
let |
|
268 |
val (c, (inst, ((name_opt, t), atts))) = read_def thy_read raw_def; |
|
269 |
val ty = Consts.instance (Sign.consts_of thy_read) (c, inst); |
|
24304 | 270 |
val ((class, tyco), ty') = case AList.lookup (op =) cs c |
25020 | 271 |
of NONE => error ("Illegal definition for constant " ^ quote c) |
24218 | 272 |
| SOME class_ty => class_ty; |
273 |
val name = case name_opt |
|
274 |
of NONE => Thm.def_name (Logic.name_arity (tyco, [], c)) |
|
275 |
| SOME name => name; |
|
276 |
val t' = case mk_typnorm thy_read (ty', ty) |
|
25020 | 277 |
of NONE => error ("Illegal definition for constant " ^ |
24218 | 278 |
quote (c ^ "::" ^ setmp show_sorts true |
279 |
(Sign.string_of_typ thy_read) ty)) |
|
280 |
| SOME norm => map_types norm t |
|
281 |
in (((class, tyco), ((name, t'), atts)), AList.delete (op =) c cs) end; |
|
282 |
in fold_map read defs cs end; |
|
24304 | 283 |
val (defs, other_cs) = read_defs raw_defs cs |
24218 | 284 |
(fold Sign.primitive_arity arities (Theory.copy theory)); |
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset
|
285 |
fun after_qed' cs defs = |
24766 | 286 |
fold Sign.add_const_constraint (map (apsnd SOME) cs) |
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset
|
287 |
#> after_qed defs; |
24218 | 288 |
in |
289 |
theory |
|
25038 | 290 |
|> fold_map get_remove_global_constraint (map fst cs |> distinct (op =)) |
24304 | 291 |
||>> fold_map add_def defs |
292 |
||> fold (fn (c, ((class, tyco), ty)) => add_inst_def' (class, tyco) (c, ty)) other_cs |
|
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset
|
293 |
|-> (fn (cs, defs) => do_proof (after_qed' cs defs) arities defs) |
24218 | 294 |
end; |
295 |
||
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset
|
296 |
fun tactic_proof tac f arities defs = |
24218 | 297 |
fold (fn arity => AxClass.prove_arity arity tac) arities |
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset
|
298 |
#> f |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset
|
299 |
#> pair defs; |
24218 | 300 |
|
301 |
in |
|
302 |
||
24589 | 303 |
val instance = gen_instance Sign.cert_arity read_def |
304 |
(fn f => fn arities => fn defs => instance_arity f arities); |
|
305 |
val instance_cmd = gen_instance Sign.read_arity read_def_cmd |
|
306 |
(fn f => fn arities => fn defs => instance_arity f arities); |
|
307 |
fun prove_instance tac arities defs = |
|
308 |
gen_instance Sign.cert_arity read_def |
|
309 |
(tactic_proof tac) arities defs (K I); |
|
24218 | 310 |
|
311 |
end; (*local*) |
|
312 |
||
313 |
||
314 |
||
24589 | 315 |
(** class data **) |
24218 | 316 |
|
317 |
datatype class_data = ClassData of { |
|
318 |
consts: (string * string) list |
|
24836 | 319 |
(*locale parameter ~> constant name*), |
25062 | 320 |
base_sort: sort, |
25083 | 321 |
inst: term option list |
322 |
(*canonical interpretation*), |
|
25062 | 323 |
morphism: morphism, |
324 |
(*partial morphism of canonical interpretation*) |
|
24657 | 325 |
intro: thm, |
326 |
defs: thm list, |
|
25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
327 |
operations: (string * (term * (typ * int))) list, |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
328 |
(*constant name ~> (locale term, |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
329 |
(constant constraint, instantiaton index of class typ))*) |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
330 |
unchecks: (term * term) list |
24657 | 331 |
}; |
24218 | 332 |
|
24657 | 333 |
fun rep_class_data (ClassData d) = d; |
25062 | 334 |
fun mk_class_data ((consts, base_sort, inst, morphism, intro), |
25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
335 |
(defs, (operations, unchecks))) = |
25062 | 336 |
ClassData { consts = consts, base_sort = base_sort, inst = inst, |
337 |
morphism = morphism, intro = intro, defs = defs, |
|
25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
338 |
operations = operations, unchecks = unchecks }; |
25062 | 339 |
fun map_class_data f (ClassData { consts, base_sort, inst, morphism, intro, |
25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
340 |
defs, operations, unchecks }) = |
25062 | 341 |
mk_class_data (f ((consts, base_sort, inst, morphism, intro), |
25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
342 |
(defs, (operations, unchecks)))); |
25038 | 343 |
fun merge_class_data _ (ClassData { consts = consts, |
25062 | 344 |
base_sort = base_sort, inst = inst, morphism = morphism, intro = intro, |
25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
345 |
defs = defs1, operations = operations1, unchecks = unchecks1 }, |
25062 | 346 |
ClassData { consts = _, base_sort = _, inst = _, morphism = _, intro = _, |
25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
347 |
defs = defs2, operations = operations2, unchecks = unchecks2 }) = |
25062 | 348 |
mk_class_data ((consts, base_sort, inst, morphism, intro), |
24914
95cda5dd58d5
added proper subclass concept; improved class target
haftmann
parents:
24901
diff
changeset
|
349 |
(Thm.merge_thms (defs1, defs2), |
25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
350 |
(AList.merge (op =) (K true) (operations1, operations2), |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
351 |
Library.merge (op aconv o pairself snd) (unchecks1, unchecks2)))); |
24218 | 352 |
|
353 |
structure ClassData = TheoryDataFun |
|
354 |
( |
|
25038 | 355 |
type T = class_data Graph.T |
356 |
val empty = Graph.empty; |
|
24218 | 357 |
val copy = I; |
358 |
val extend = I; |
|
25038 | 359 |
fun merge _ = Graph.join merge_class_data; |
24218 | 360 |
); |
361 |
||
362 |
||
363 |
(* queries *) |
|
364 |
||
25038 | 365 |
val lookup_class_data = Option.map rep_class_data oo try o Graph.get_node o ClassData.get; |
24218 | 366 |
|
24589 | 367 |
fun the_class_data thy class = case lookup_class_data thy class |
25020 | 368 |
of NONE => error ("Undeclared class " ^ quote class) |
24589 | 369 |
| SOME data => data; |
24218 | 370 |
|
25038 | 371 |
val is_class = is_some oo lookup_class_data; |
372 |
||
373 |
val ancestry = Graph.all_succs o ClassData.get; |
|
24218 | 374 |
|
25002 | 375 |
fun these_params thy = |
24218 | 376 |
let |
377 |
fun params class = |
|
378 |
let |
|
24930
cc2e0e8c81af
renamed AxClass.get_definition to AxClass.get_info (again);
wenzelm
parents:
24920
diff
changeset
|
379 |
val const_typs = (#params o AxClass.get_info thy) class; |
24657 | 380 |
val const_names = (#consts o the_class_data thy) class; |
24218 | 381 |
in |
382 |
(map o apsnd) (fn c => (c, (the o AList.lookup (op =) const_typs) c)) const_names |
|
383 |
end; |
|
384 |
in maps params o ancestry thy end; |
|
385 |
||
24657 | 386 |
fun these_defs thy = maps (these o Option.map #defs o lookup_class_data thy) o ancestry thy; |
24218 | 387 |
|
25062 | 388 |
fun morphism thy = #morphism o the_class_data thy; |
389 |
||
24218 | 390 |
fun these_intros thy = |
24657 | 391 |
Graph.fold (fn (_, (data, _)) => insert Thm.eq_thm ((#intro o rep_class_data) data)) |
25038 | 392 |
(ClassData.get thy) []; |
24218 | 393 |
|
24836 | 394 |
fun these_operations thy = |
395 |
maps (#operations o the_class_data thy) o ancestry thy; |
|
24657 | 396 |
|
25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
397 |
fun these_unchecks thy = |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
398 |
maps (#unchecks o the_class_data thy) o ancestry thy; |
25002 | 399 |
|
24218 | 400 |
fun print_classes thy = |
401 |
let |
|
24920 | 402 |
val ctxt = ProofContext.init thy; |
24218 | 403 |
val algebra = Sign.classes_of thy; |
404 |
val arities = |
|
405 |
Symtab.empty |
|
406 |
|> Symtab.fold (fn (tyco, arities) => fold (fn (class, _) => |
|
407 |
Symtab.map_default (class, []) (insert (op =) tyco)) arities) |
|
408 |
((#arities o Sorts.rep_algebra) algebra); |
|
409 |
val the_arities = these o Symtab.lookup arities; |
|
410 |
fun mk_arity class tyco = |
|
411 |
let |
|
412 |
val Ss = Sorts.mg_domain algebra tyco [class]; |
|
24920 | 413 |
in Syntax.pretty_arity ctxt (tyco, Ss, [class]) end; |
24218 | 414 |
fun mk_param (c, ty) = Pretty.str (Sign.extern_const thy c ^ " :: " |
24920 | 415 |
^ setmp show_sorts false (Syntax.string_of_typ ctxt o Type.strip_sorts) ty); |
24218 | 416 |
fun mk_entry class = (Pretty.block o Pretty.fbreaks o map_filter I) [ |
25062 | 417 |
(SOME o Pretty.str) ("class " ^ Sign.extern_class thy class ^ ":"), |
24218 | 418 |
(SOME o Pretty.block) [Pretty.str "supersort: ", |
24920 | 419 |
(Syntax.pretty_sort ctxt o Sign.minimize_sort thy o Sign.super_classes thy) class], |
25062 | 420 |
if is_class thy class then (SOME o Pretty.str) |
421 |
("locale: " ^ Locale.extern thy class) else NONE, |
|
422 |
((fn [] => NONE | ps => (SOME o Pretty.block o Pretty.fbreaks) |
|
423 |
(Pretty.str "parameters:" :: ps)) o map mk_param |
|
24930
cc2e0e8c81af
renamed AxClass.get_definition to AxClass.get_info (again);
wenzelm
parents:
24920
diff
changeset
|
424 |
o these o Option.map #params o try (AxClass.get_info thy)) class, |
24218 | 425 |
(SOME o Pretty.block o Pretty.breaks) [ |
426 |
Pretty.str "instances:", |
|
427 |
Pretty.list "" "" (map (mk_arity class) (the_arities class)) |
|
428 |
] |
|
429 |
] |
|
430 |
in |
|
24589 | 431 |
(Pretty.writeln o Pretty.chunks o separate (Pretty.str "") |
432 |
o map mk_entry o Sorts.all_classes) algebra |
|
24218 | 433 |
end; |
434 |
||
435 |
||
436 |
(* updaters *) |
|
437 |
||
25163 | 438 |
fun add_class_data ((class, superclasses), (cs, base_sort, inst, phi, intro)) thy = |
25002 | 439 |
let |
25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
440 |
val operations = map (fn (v_ty, (c, ty)) => |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
441 |
(c, ((Free v_ty, (Logic.varifyT ty, 0))))) cs; |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
442 |
val unchecks = map (fn ((v, ty'), (c, _)) => |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
443 |
(Free (v, Type.strip_sorts ty'), Const (c, Type.strip_sorts ty'))) cs; |
25002 | 444 |
val cs = (map o pairself) fst cs; |
25038 | 445 |
val add_class = Graph.new_node (class, |
25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
446 |
mk_class_data ((cs, base_sort, map (SOME o Const) inst, phi, intro), ([], (operations, unchecks)))) |
25002 | 447 |
#> fold (curry Graph.add_edge class) superclasses; |
448 |
in |
|
25038 | 449 |
ClassData.map add_class thy |
25002 | 450 |
end; |
24218 | 451 |
|
25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
452 |
fun register_operation class (c, ((t, some_t_rev), some_def)) thy = |
25062 | 453 |
let |
454 |
val ty = Sign.the_const_constraint thy c; |
|
455 |
val typargs = Sign.const_typargs thy (c, ty); |
|
456 |
val typidx = find_index (fn TVar ((v, _), _) => Name.aT = v | _ => false) typargs; |
|
25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
457 |
fun mk_uncheck t_rev = |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
458 |
let |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
459 |
val t_rev' = map_types Type.strip_sorts t_rev; |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
460 |
val ty' = Term.fastype_of t_rev'; |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
461 |
in (t_rev', Const (c, ty')) end; |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
462 |
val some_t_rev' = Option.map mk_uncheck some_t_rev; |
25062 | 463 |
in |
464 |
thy |
|
465 |
|> (ClassData.map o Graph.map_node class o map_class_data o apsnd) |
|
25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
466 |
(fn (defs, (operations, unchecks)) => |
25096 | 467 |
(fold cons (the_list some_def) defs, |
25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
468 |
((c, (t, (ty, typidx))) :: operations, fold cons (the_list some_t_rev') unchecks))) |
25062 | 469 |
end; |
24218 | 470 |
|
24589 | 471 |
|
472 |
(** rule calculation, tactics and methods **) |
|
473 |
||
25024 | 474 |
val class_prefix = Logic.const_of_class o Sign.base_name; |
475 |
||
25062 | 476 |
fun calculate_morphism class cs = |
477 |
let |
|
478 |
val subst_typ = Term.map_type_tfree (fn var as (v, sort) => |
|
479 |
if v = Name.aT then TVar ((v, 0), [class]) else TVar ((v, 0), sort)); |
|
480 |
fun subst_aterm (t as Free (v, ty)) = (case AList.lookup (op =) cs v |
|
481 |
of SOME (c, _) => Const (c, ty) |
|
482 |
| NONE => t) |
|
483 |
| subst_aterm t = t; |
|
484 |
val subst_term = map_aterms subst_aterm #> map_types subst_typ; |
|
485 |
in |
|
25209 | 486 |
Morphism.term_morphism subst_term |
25062 | 487 |
$> Morphism.typ_morphism subst_typ |
488 |
end; |
|
489 |
||
25038 | 490 |
fun class_intro thy class sups = |
24589 | 491 |
let |
492 |
fun class_elim class = |
|
25020 | 493 |
case (#axioms o AxClass.get_info thy) class |
494 |
of [thm] => SOME (Drule.unconstrainTs thm) |
|
24589 | 495 |
| [] => NONE; |
25038 | 496 |
val pred_intro = case Locale.intros thy class |
24589 | 497 |
of ([ax_intro], [intro]) => intro |> OF_LAST ax_intro |> SOME |
498 |
| ([intro], []) => SOME intro |
|
499 |
| ([], [intro]) => SOME intro |
|
500 |
| _ => NONE; |
|
501 |
val pred_intro' = pred_intro |
|
502 |
|> Option.map (fn intro => intro OF map_filter class_elim sups); |
|
24930
cc2e0e8c81af
renamed AxClass.get_definition to AxClass.get_info (again);
wenzelm
parents:
24920
diff
changeset
|
503 |
val class_intro = (#intro o AxClass.get_info thy) class; |
24589 | 504 |
val raw_intro = case pred_intro' |
505 |
of SOME pred_intro => class_intro |> OF_LAST pred_intro |
|
506 |
| NONE => class_intro; |
|
507 |
val sort = Sign.super_classes thy class; |
|
24847 | 508 |
val typ = TVar ((Name.aT, 0), sort); |
24589 | 509 |
val defs = these_defs thy sups; |
510 |
in |
|
511 |
raw_intro |
|
512 |
|> Drule.instantiate' [SOME (Thm.ctyp_of thy typ)] [] |
|
513 |
|> strip_all_ofclass thy sort |
|
514 |
|> Thm.strip_shyps |
|
515 |
|> MetaSimplifier.rewrite_rule defs |
|
516 |
|> Drule.unconstrainTs |
|
517 |
end; |
|
518 |
||
519 |
fun class_interpretation class facts defs thy = |
|
520 |
let |
|
25038 | 521 |
val params = these_params thy [class]; |
25083 | 522 |
val inst = (#inst o the_class_data thy) class; |
25020 | 523 |
val tac = ALLGOALS (ProofContext.fact_tac facts); |
25038 | 524 |
val prfx = class_prefix class; |
24589 | 525 |
in |
25038 | 526 |
thy |
527 |
|> fold_map (get_remove_global_constraint o fst o snd) params |
|
25094
ba43514068fd
Interpretation equations may have name and/or attribute.
ballarin
parents:
25083
diff
changeset
|
528 |
||> prove_interpretation tac ((false, prfx), []) (Locale.Locale class) |
ba43514068fd
Interpretation equations may have name and/or attribute.
ballarin
parents:
25083
diff
changeset
|
529 |
(inst, map (fn def => (("", []), def)) defs) |
25038 | 530 |
|-> (fn cs => fold (Sign.add_const_constraint o apsnd SOME) cs) |
24589 | 531 |
end; |
24218 | 532 |
|
533 |
fun intro_classes_tac facts st = |
|
534 |
let |
|
535 |
val thy = Thm.theory_of_thm st; |
|
536 |
val classes = Sign.all_classes thy; |
|
537 |
val class_trivs = map (Thm.class_triv thy) classes; |
|
538 |
val class_intros = these_intros thy; |
|
24930
cc2e0e8c81af
renamed AxClass.get_definition to AxClass.get_info (again);
wenzelm
parents:
24920
diff
changeset
|
539 |
val axclass_intros = map_filter (try (#intro o AxClass.get_info thy)) classes; |
24218 | 540 |
in |
24930
cc2e0e8c81af
renamed AxClass.get_definition to AxClass.get_info (again);
wenzelm
parents:
24920
diff
changeset
|
541 |
(ALLGOALS (Method.insert_tac facts THEN' |
cc2e0e8c81af
renamed AxClass.get_definition to AxClass.get_info (again);
wenzelm
parents:
24920
diff
changeset
|
542 |
REPEAT_ALL_NEW (resolve_tac (class_trivs @ class_intros @ axclass_intros))) |
cc2e0e8c81af
renamed AxClass.get_definition to AxClass.get_info (again);
wenzelm
parents:
24920
diff
changeset
|
543 |
THEN Tactic.distinct_subgoals_tac) st |
24218 | 544 |
end; |
545 |
||
546 |
fun default_intro_classes_tac [] = intro_classes_tac [] |
|
24930
cc2e0e8c81af
renamed AxClass.get_definition to AxClass.get_info (again);
wenzelm
parents:
24920
diff
changeset
|
547 |
| default_intro_classes_tac _ = no_tac; |
24218 | 548 |
|
549 |
fun default_tac rules ctxt facts = |
|
550 |
HEADGOAL (Method.some_rule_tac rules ctxt facts) ORELSE |
|
551 |
default_intro_classes_tac facts; |
|
552 |
||
553 |
val _ = Context.add_setup (Method.add_methods |
|
554 |
[("intro_classes", Method.no_args (Method.METHOD intro_classes_tac), |
|
555 |
"back-chain introduction rules of classes"), |
|
556 |
("default", Method.thms_ctxt_args (Method.METHOD oo default_tac), |
|
557 |
"apply some intro/elim rule")]); |
|
558 |
||
25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
559 |
fun subclass_rule thy (sub, sup) = |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
560 |
let |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
561 |
val ctxt = Locale.init sub thy; |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
562 |
val ctxt_thy = ProofContext.init thy; |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
563 |
val props = |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
564 |
Locale.global_asms_of thy sup |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
565 |
|> maps snd |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
566 |
|> map (ObjectLogic.ensure_propT thy); |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
567 |
fun tac { prems, context } = |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
568 |
Locale.intro_locales_tac true context prems |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
569 |
ORELSE ALLGOALS assume_tac; |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
570 |
in |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
571 |
Goal.prove_multi ctxt [] [] props tac |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
572 |
|> map (Assumption.export false ctxt ctxt_thy) |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
573 |
|> Variable.export ctxt ctxt_thy |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
574 |
end; |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
575 |
|
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
576 |
fun prove_single_subclass (sub, sup) thms ctxt thy = |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
577 |
let |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
578 |
val ctxt_thy = ProofContext.init thy; |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
579 |
val subclass_rule = Conjunction.intr_balanced thms |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
580 |
|> Assumption.export false ctxt ctxt_thy |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
581 |
|> singleton (Variable.export ctxt ctxt_thy); |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
582 |
val sub_inst = Thm.ctyp_of thy (TVar ((Name.aT, 0), [sub])); |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
583 |
val sub_ax = #axioms (AxClass.get_info thy sub); |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
584 |
val classrel = |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
585 |
#intro (AxClass.get_info thy sup) |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
586 |
|> Drule.instantiate' [SOME sub_inst] [] |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
587 |
|> OF_LAST (subclass_rule OF sub_ax) |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
588 |
|> strip_all_ofclass thy (Sign.super_classes thy sup) |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
589 |
|> Thm.strip_shyps |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
590 |
in |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
591 |
thy |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
592 |
|> AxClass.add_classrel classrel |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
593 |
|> prove_interpretation_in (ALLGOALS (ProofContext.fact_tac thms)) |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
594 |
I (sub, Locale.Locale sup) |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
595 |
|> ClassData.map (Graph.add_edge (sub, sup)) |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
596 |
end; |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
597 |
|
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
598 |
fun prove_subclass (sub, sup) thms ctxt thy = |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
599 |
let |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
600 |
val supclasses = Sign.complete_sort thy [sup] |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
601 |
|> filter_out (fn class => Sign.subsort thy ([sub], [class])); |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
602 |
fun transform sup' = subclass_rule thy (sup, sup') |> map (fn thm => thm OF thms); |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
603 |
in |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
604 |
thy |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
605 |
|> fold_rev (fn sup' => prove_single_subclass (sub, sup') |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
606 |
(transform sup') ctxt) supclasses |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
607 |
end; |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
608 |
|
24218 | 609 |
|
24589 | 610 |
(** classes and class target **) |
24218 | 611 |
|
25002 | 612 |
(* class context syntax *) |
24748 | 613 |
|
25083 | 614 |
structure ClassSyntax = ProofDataFun( |
615 |
type T = { |
|
616 |
constraints: (string * typ) list, |
|
617 |
base_sort: sort, |
|
618 |
local_operation: string * typ -> (typ * term) option, |
|
25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
619 |
unchecks: (term * term) list, |
25083 | 620 |
passed: bool |
621 |
} option; |
|
622 |
fun init _ = NONE; |
|
623 |
); |
|
624 |
||
625 |
fun synchronize_syntax thy sups base_sort ctxt = |
|
24914
95cda5dd58d5
added proper subclass concept; improved class target
haftmann
parents:
24901
diff
changeset
|
626 |
let |
25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
627 |
(* constraints *) |
25083 | 628 |
val operations = these_operations thy sups; |
25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
629 |
fun local_constraint (c, (_, (ty, _))) = |
25083 | 630 |
let |
631 |
val ty' = ty |
|
632 |
|> map_atyps (fn ty as TVar ((v, 0), _) => |
|
633 |
if v = Name.aT then TVar ((v, 0), base_sort) else ty) |
|
634 |
|> SOME; |
|
635 |
in (c, ty') end |
|
25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
636 |
val constraints = (map o apsnd) (fst o snd) operations; |
25083 | 637 |
|
638 |
(* check phase *) |
|
639 |
val typargs = Consts.typargs (ProofContext.consts_of ctxt); |
|
25209 | 640 |
fun check_const (c, ty) (t, (_, typidx)) = ((nth (typargs (c, ty)) typidx), t); |
25083 | 641 |
fun local_operation (c_ty as (c, _)) = AList.lookup (op =) operations c |
642 |
|> Option.map (check_const c_ty); |
|
25002 | 643 |
|
25083 | 644 |
(* uncheck phase *) |
25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
645 |
val basify = |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
646 |
map_atyps (fn ty as TFree (v, _) => if Name.aT = v then TFree (v, base_sort) |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
647 |
else ty | ty => ty); |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
648 |
val unchecks = these_unchecks thy sups |
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
649 |
|> (map o pairself o map_types) basify; |
25083 | 650 |
in |
651 |
ctxt |
|
652 |
|> fold (ProofContext.add_const_constraint o local_constraint) operations |
|
25209 | 653 |
|> ClassSyntax.put (SOME { |
25083 | 654 |
constraints = constraints, |
655 |
base_sort = base_sort, |
|
656 |
local_operation = local_operation, |
|
25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
657 |
unchecks = unchecks, |
25083 | 658 |
passed = false |
25209 | 659 |
}) |
25083 | 660 |
end; |
661 |
||
662 |
fun refresh_syntax class ctxt = |
|
25002 | 663 |
let |
664 |
val thy = ProofContext.theory_of ctxt; |
|
25062 | 665 |
val base_sort = (#base_sort o the_class_data thy) class; |
25083 | 666 |
in synchronize_syntax thy [class] base_sort ctxt end; |
24914
95cda5dd58d5
added proper subclass concept; improved class target
haftmann
parents:
24901
diff
changeset
|
667 |
|
25083 | 668 |
val mark_passed = (ClassSyntax.map o Option.map) |
25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
669 |
(fn { constraints, base_sort, local_operation, unchecks, passed } => |
25083 | 670 |
{ constraints = constraints, base_sort = base_sort, |
25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
671 |
local_operation = local_operation, unchecks = unchecks, passed = true }); |
25083 | 672 |
|
673 |
fun sort_term_check ts ctxt = |
|
24748 | 674 |
let |
25083 | 675 |
val { constraints, base_sort, local_operation, passed, ... } = |
676 |
the (ClassSyntax.get ctxt); |
|
677 |
fun check_typ (c, ty) (TFree (v, _), t) = if v = Name.aT |
|
25062 | 678 |
then apfst (AList.update (op =) ((c, ty), t)) else I |
25083 | 679 |
| check_typ (c, ty) (TVar (vi, _), t) = if TypeInfer.is_param vi |
25062 | 680 |
then apfst (AList.update (op =) ((c, ty), t)) |
24901
d3cbf79769b9
added first version of user-space type system for class target
haftmann
parents:
24847
diff
changeset
|
681 |
#> apsnd (insert (op =) vi) else I |
25083 | 682 |
| check_typ _ _ = I; |
683 |
fun add_const (Const c_ty) = Option.map (check_typ c_ty) (local_operation c_ty) |
|
25062 | 684 |
|> the_default I |
24901
d3cbf79769b9
added first version of user-space type system for class target
haftmann
parents:
24847
diff
changeset
|
685 |
| add_const _ = I; |
d3cbf79769b9
added first version of user-space type system for class target
haftmann
parents:
24847
diff
changeset
|
686 |
val (cs, typarams) = (fold o fold_aterms) add_const ts ([], []); |
25062 | 687 |
val subst_typ = map_type_tvar (fn var as (vi, _) => |
688 |
if member (op =) typarams vi then TFree (Name.aT, base_sort) else TVar var); |
|
689 |
val subst_term = map_aterms |
|
24901
d3cbf79769b9
added first version of user-space type system for class target
haftmann
parents:
24847
diff
changeset
|
690 |
(fn t as Const (c, ty) => the_default t (AList.lookup (op =) cs (c, ty)) | t => t) |
25062 | 691 |
#> map_types subst_typ; |
692 |
val ts' = map subst_term ts; |
|
25083 | 693 |
in if eq_list (op aconv) (ts, ts') andalso passed then NONE |
694 |
else |
|
695 |
ctxt |
|
696 |
|> fold (ProofContext.add_const_constraint o apsnd SOME) constraints |
|
697 |
|> mark_passed |
|
698 |
|> pair ts' |
|
699 |
|> SOME |
|
700 |
end; |
|
24748 | 701 |
|
25062 | 702 |
val uncheck = ref true; |
25002 | 703 |
|
25083 | 704 |
fun sort_term_uncheck ts ctxt = |
25002 | 705 |
let |
706 |
val thy = ProofContext.theory_of ctxt; |
|
25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
707 |
val unchecks = (#unchecks o the o ClassSyntax.get) ctxt; |
25062 | 708 |
val ts' = if ! uncheck |
25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
709 |
then map (Pattern.rewrite_term thy unchecks []) ts else ts; |
25060 | 710 |
in if eq_list (op aconv) (ts, ts') then NONE else SOME (ts', ctxt) end; |
25002 | 711 |
|
25083 | 712 |
fun init_ctxt thy sups base_sort ctxt = |
713 |
ctxt |
|
714 |
|> Variable.declare_term |
|
715 |
(Logic.mk_type (TFree (Name.aT, base_sort))) |
|
716 |
|> synchronize_syntax thy sups base_sort |
|
717 |
|> Context.proof_map ( |
|
718 |
Syntax.add_term_check 0 "class" sort_term_check |
|
25103 | 719 |
#> Syntax.add_term_uncheck 0 "class" sort_term_uncheck) |
24901
d3cbf79769b9
added first version of user-space type system for class target
haftmann
parents:
24847
diff
changeset
|
720 |
|
d3cbf79769b9
added first version of user-space type system for class target
haftmann
parents:
24847
diff
changeset
|
721 |
fun init class ctxt = |
25083 | 722 |
let |
723 |
val thy = ProofContext.theory_of ctxt; |
|
724 |
in |
|
725 |
init_ctxt thy [class] ((#base_sort o the_class_data thy) class) ctxt |
|
726 |
end; |
|
24914
95cda5dd58d5
added proper subclass concept; improved class target
haftmann
parents:
24901
diff
changeset
|
727 |
|
24748 | 728 |
|
24589 | 729 |
(* class definition *) |
24218 | 730 |
|
731 |
local |
|
732 |
||
24748 | 733 |
fun gen_class_spec prep_class prep_expr process_expr thy raw_supclasses raw_includes_elems = |
24218 | 734 |
let |
24748 | 735 |
val supclasses = map (prep_class thy) raw_supclasses; |
25209 | 736 |
val sups = filter (is_class thy) supclasses; |
737 |
fun the_base_sort class = lookup_class_data thy class |
|
738 |
|> Option.map #base_sort |
|
739 |
|> the_default [class]; |
|
740 |
val base_sort = Sign.minimize_sort thy (maps the_base_sort supclasses); |
|
24748 | 741 |
val supsort = Sign.minimize_sort thy supclasses; |
25038 | 742 |
val suplocales = map Locale.Locale sups; |
24748 | 743 |
val (raw_elems, includes) = fold_rev (fn Locale.Elem e => apfst (cons e) |
744 |
| Locale.Expr i => apsnd (cons (prep_expr thy i))) raw_includes_elems ([], []); |
|
745 |
val supexpr = Locale.Merge suplocales; |
|
746 |
val supparams = (map fst o Locale.parameters_of_expr thy) supexpr; |
|
25002 | 747 |
val supconsts = AList.make (the o AList.lookup (op =) (these_params thy sups)) |
24748 | 748 |
(map fst supparams); |
749 |
val mergeexpr = Locale.Merge (suplocales @ includes); |
|
750 |
val constrain = Element.Constrains ((map o apsnd o map_atyps) |
|
24847 | 751 |
(fn TFree (_, sort) => TFree (Name.aT, sort)) supparams); |
24748 | 752 |
in |
753 |
ProofContext.init thy |
|
754 |
|> Locale.cert_expr supexpr [constrain] |
|
755 |
|> snd |
|
25083 | 756 |
|> init_ctxt thy sups base_sort |
24748 | 757 |
|> process_expr Locale.empty raw_elems |
758 |
|> fst |
|
25062 | 759 |
|> (fn elems => ((((sups, supconsts), (supsort, base_sort, mergeexpr)), |
24748 | 760 |
(*FIXME*) if null includes then constrain :: elems else elems))) |
761 |
end; |
|
762 |
||
763 |
val read_class_spec = gen_class_spec Sign.intern_class Locale.intern_expr Locale.read_expr; |
|
764 |
val check_class_spec = gen_class_spec (K I) (K I) Locale.cert_expr; |
|
765 |
||
24968
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset
|
766 |
fun define_class_params (name, raw_superclasses) raw_consts raw_dep_axioms other_consts thy = |
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset
|
767 |
let |
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset
|
768 |
val superclasses = map (Sign.certify_class thy) raw_superclasses; |
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset
|
769 |
val consts = (map o apfst o apsnd) (Sign.certify_typ thy) raw_consts; |
25083 | 770 |
fun add_const ((c, ty), syn) = |
771 |
Sign.declare_const [] (c, Type.strip_sorts ty, syn) #>> Term.dest_Const; |
|
24968
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset
|
772 |
fun mk_axioms cs thy = |
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset
|
773 |
raw_dep_axioms thy cs |
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset
|
774 |
|> (map o apsnd o map) (Sign.cert_prop thy) |
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset
|
775 |
|> rpair thy; |
25002 | 776 |
fun constrain_typs class = (map o apsnd o Term.map_type_tfree) |
777 |
(fn (v, _) => TFree (v, [class])) |
|
24968
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset
|
778 |
in |
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset
|
779 |
thy |
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset
|
780 |
|> Sign.add_path (Logic.const_of_class name) |
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset
|
781 |
|> fold_map add_const consts |
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset
|
782 |
||> Sign.restore_naming thy |
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset
|
783 |
|-> (fn cs => mk_axioms cs |
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset
|
784 |
#-> (fn axioms_prop => AxClass.define_class (name, superclasses) |
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset
|
785 |
(map fst cs @ other_consts) axioms_prop |
25002 | 786 |
#-> (fn class => `(fn _ => constrain_typs class cs) |
787 |
#-> (fn cs' => `(fn thy => AxClass.get_info thy class) |
|
788 |
#-> (fn {axioms, ...} => fold (Sign.add_const_constraint o apsnd SOME) cs' |
|
789 |
#> pair (class, (cs', axioms))))))) |
|
24968
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset
|
790 |
end; |
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset
|
791 |
|
25002 | 792 |
fun gen_class prep_spec prep_param bname |
24748 | 793 |
raw_supclasses raw_includes_elems raw_other_consts thy = |
794 |
let |
|
25038 | 795 |
val class = Sign.full_name thy bname; |
25062 | 796 |
val (((sups, supconsts), (supsort, base_sort, mergeexpr)), elems_syn) = |
24748 | 797 |
prep_spec thy raw_supclasses raw_includes_elems; |
24968
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset
|
798 |
val other_consts = map (tap (Sign.the_const_type thy) o prep_param thy) raw_other_consts; |
25163 | 799 |
fun mk_inst class cs = |
800 |
(map o apsnd o Term.map_type_tfree) (fn (v, _) => TFree (v, [class])) cs; |
|
25062 | 801 |
fun fork_syntax (Element.Fixes xs) = |
802 |
fold_map (fn (c, ty, syn) => cons (c, syn) #> pair (c, ty, NoSyn)) xs |
|
803 |
#>> Element.Fixes |
|
804 |
| fork_syntax x = pair x; |
|
805 |
val (elems, global_syn) = fold_map fork_syntax elems_syn []; |
|
806 |
fun globalize (c, ty) = |
|
807 |
((c, Term.map_type_tfree (K (TFree (Name.aT, base_sort))) ty), |
|
808 |
(the_default NoSyn o AList.lookup (op =) global_syn) c); |
|
25038 | 809 |
fun extract_params thy = |
24218 | 810 |
let |
25062 | 811 |
val params = map fst (Locale.parameters_of thy class); |
24218 | 812 |
in |
25062 | 813 |
(params, (map globalize o snd o chop (length supconsts)) params) |
24218 | 814 |
end; |
25038 | 815 |
fun extract_assumes params thy cs = |
24218 | 816 |
let |
817 |
val consts = supconsts @ (map (fst o fst) params ~~ cs); |
|
818 |
fun subst (Free (c, ty)) = |
|
819 |
Const ((fst o the o AList.lookup (op =) consts) c, ty) |
|
820 |
| subst t = t; |
|
821 |
fun prep_asm ((name, atts), ts) = |
|
25024 | 822 |
((Sign.base_name name, map (Attrib.attribute_i thy) atts), |
24589 | 823 |
(map o map_aterms) subst ts); |
24218 | 824 |
in |
25038 | 825 |
Locale.global_asms_of thy class |
24218 | 826 |
|> map prep_asm |
827 |
end; |
|
828 |
in |
|
829 |
thy |
|
24748 | 830 |
|> Locale.add_locale_i (SOME "") bname mergeexpr elems |
25038 | 831 |
|> snd |
832 |
|> ProofContext.theory (`extract_params |
|
25062 | 833 |
#-> (fn (all_params, params) => |
24968
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset
|
834 |
define_class_params (bname, supsort) params |
25038 | 835 |
(extract_assumes params) other_consts |
836 |
#-> (fn (_, (consts, axioms)) => |
|
837 |
`(fn thy => class_intro thy class sups) |
|
24218 | 838 |
#-> (fn class_intro => |
25062 | 839 |
PureThy.note_thmss_qualified "" (NameSpace.append class classN) |
840 |
[((introN, []), [([class_intro], [])])] |
|
841 |
#-> (fn [(_, [class_intro])] => |
|
25038 | 842 |
add_class_data ((class, sups), |
25062 | 843 |
(map fst params ~~ consts, base_sort, |
25163 | 844 |
mk_inst class (map snd supconsts @ consts), |
25062 | 845 |
calculate_morphism class (supconsts @ (map (fst o fst) params ~~ consts)), class_intro)) |
25038 | 846 |
#> class_interpretation class axioms [] |
25062 | 847 |
))))) |
25038 | 848 |
|> pair class |
24218 | 849 |
end; |
850 |
||
851 |
in |
|
852 |
||
24968
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset
|
853 |
val class_cmd = gen_class read_class_spec ((#1 o Term.dest_Const) oo Sign.read_const); |
24748 | 854 |
val class = gen_class check_class_spec (K I); |
24218 | 855 |
|
856 |
end; (*local*) |
|
857 |
||
858 |
||
24589 | 859 |
(* definition in class target *) |
24218 | 860 |
|
25096 | 861 |
fun add_logical_const class pos ((c, mx), dict) thy = |
24218 | 862 |
let |
25024 | 863 |
val prfx = class_prefix class; |
864 |
val thy' = thy |> Sign.add_path prfx; |
|
25062 | 865 |
val phi = morphism thy' class; |
25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
866 |
val base_sort = (#base_sort o the_class_data thy) class; |
25024 | 867 |
|
25062 | 868 |
val c' = Sign.full_name thy' c; |
25083 | 869 |
val dict' = (map_types Logic.unvarifyT o Morphism.term phi) dict; |
870 |
val ty' = Term.fastype_of dict'; |
|
871 |
val ty'' = Type.strip_sorts ty'; |
|
872 |
val def_eq = Logic.mk_equals (Const (c', ty'), dict'); |
|
25096 | 873 |
|
25062 | 874 |
val c'' = NameSpace.full (Sign.naming_of thy' |> NameSpace.add_path prfx) c; |
24218 | 875 |
in |
25024 | 876 |
thy' |
25096 | 877 |
|> Sign.hide_consts_i false [c''] (*FIXME*) |
878 |
|> Sign.declare_const pos (c, ty'', mx) |> snd |
|
25083 | 879 |
|> Thm.add_def false (c, def_eq) |
25062 | 880 |
|>> Thm.symmetric |
25083 | 881 |
|-> (fn def => class_interpretation class [def] [Thm.prop_of def] |
25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
882 |
#> register_operation class (c', ((dict, SOME dict'), SOME (Thm.varifyT def)))) |
24218 | 883 |
|> Sign.restore_naming thy |
25083 | 884 |
|> Sign.add_const_constraint (c', SOME ty') |
24218 | 885 |
end; |
886 |
||
24901
d3cbf79769b9
added first version of user-space type system for class target
haftmann
parents:
24847
diff
changeset
|
887 |
|
d3cbf79769b9
added first version of user-space type system for class target
haftmann
parents:
24847
diff
changeset
|
888 |
(* abbreviation in class target *) |
d3cbf79769b9
added first version of user-space type system for class target
haftmann
parents:
24847
diff
changeset
|
889 |
|
25103 | 890 |
fun add_syntactic_const class prmode pos ((c, mx), rhs) thy = |
24836 | 891 |
let |
25024 | 892 |
val prfx = class_prefix class; |
25096 | 893 |
val thy' = thy |> Sign.add_path prfx; |
25062 | 894 |
val phi = morphism thy class; |
895 |
||
25096 | 896 |
val c' = Sign.full_name thy' c; |
25146 | 897 |
val rews = map (Logic.dest_equals o Thm.prop_of) (these_defs thy' [class]) |
898 |
val rhs' = (Pattern.rewrite_term thy rews [] o Morphism.term phi) rhs; |
|
25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
899 |
val ty' = (Logic.unvarifyT o Term.fastype_of) rhs'; |
25096 | 900 |
|
901 |
val c'' = NameSpace.full (Sign.naming_of thy' |> NameSpace.add_path prfx) c; |
|
902 |
val ty'' = (Type.strip_sorts o Logic.unvarifyT) (Sign.the_const_constraint thy' c''); |
|
24836 | 903 |
in |
25096 | 904 |
thy' |
905 |
|> Sign.add_const_constraint (c'', SOME ty'') (*FIXME*) |
|
906 |
|> Sign.hide_consts_i false [c''] (*FIXME*) |
|
25146 | 907 |
|> Sign.add_abbrev (#1 prmode) pos (c, map_types Type.strip_sorts rhs') |> snd |
25096 | 908 |
|> Sign.add_const_constraint (c', SOME ty') |
25024 | 909 |
|> Sign.notation true prmode [(Const (c', ty'), mx)] |
25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset
|
910 |
|> register_operation class (c', ((rhs, NONE), NONE)) |
25096 | 911 |
|> Sign.restore_naming thy |
24836 | 912 |
end; |
913 |
||
24218 | 914 |
end; |