author  haftmann 
Mon, 08 Oct 2007 08:04:28 +0200  
changeset 24901  d3cbf79769b9 
parent 24847  bc15dcaed517 
child 24914  95cda5dd58d5 
permissions  rwrr 
24218  1 
(* Title: Pure/Isar/class.ML 
2 
ID: $Id$ 

3 
Author: Florian Haftmann, TU Muenchen 

4 

5 
Type classes derived from primitive axclasses and locales. 

6 
*) 

7 

8 
signature CLASS = 

9 
sig 

10 
val fork_mixfix: bool > string option > mixfix > mixfix * mixfix 

11 

12 
val axclass_cmd: bstring * xstring list 

24589  13 
> ((bstring * Attrib.src list) * string list) list 
14 
> theory > class * theory 

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

24748  16 
val class: bool > bstring > class list > Element.context_i Locale.element list 
24218  17 
> string list > theory > string * Proof.context 
24748  18 
val class_cmd: bool > bstring > xstring list > Element.context Locale.element list 
24589  19 
> xstring list > theory > string * Proof.context 
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

20 
val add_const_in_class: string > (string * term) * Syntax.mixfix 
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

21 
> theory > theory 
24589  22 
val interpretation_in_class: class * class > theory > Proof.state 
23 
val interpretation_in_class_cmd: xstring * xstring > theory > Proof.state 

24 
val prove_interpretation_in_class: tactic > class * class > theory > theory 

25 
val intro_classes_tac: thm list > tactic 

26 
val default_intro_classes_tac: thm list > tactic 

27 
val class_of_locale: theory > string > class option 

28 
val print_classes: theory > unit 

24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

29 

24589  30 
val instance_arity: (theory > theory) > arity list > theory > Proof.state 
31 
val instance: arity list > ((bstring * Attrib.src list) * term) list 

24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

32 
> (thm list > theory > theory) 
24218  33 
> theory > Proof.state 
24589  34 
val instance_cmd: (bstring * xstring list * xstring) list 
35 
> ((bstring * Attrib.src list) * xstring) 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 prove_instance: tactic > arity list 
24218  39 
> ((bstring * Attrib.src list) * term) list 
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

40 
> theory > thm list * theory 
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

41 
val unoverload: theory > conv 
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

42 
val overload: theory > conv 
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

43 
val unoverload_const: theory > string * typ > string 
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

44 
val inst_const: theory > string * string > string 
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

45 
val param_const: theory > string > (string * string) option 
24435  46 
val params_of_sort: theory > sort > (string * (string * typ)) list 
24657  47 

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

48 
val init: class > Proof.context > Proof.context; 
24836  49 
val local_syntax: theory > class > bool 
24901
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

50 
val add_abbrev_in_class: string > Syntax.mode > (string * term) * mixfix 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

51 
> theory > theory 
24218  52 
end; 
53 

54 
structure Class : CLASS = 

55 
struct 

56 

57 
(** auxiliary **) 

58 

59 
fun fork_mixfix is_loc some_class mx = 

60 
let 

61 
val mx' = Syntax.unlocalize_mixfix mx; 

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

62 
val mx_global = if not is_loc orelse (is_some some_class andalso not (mx = mx')) 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

63 
then mx' else NoSyn; 
24218  64 
val mx_local = if is_loc then mx else NoSyn; 
65 
in (mx_global, mx_local) end; 

66 

24589  67 
fun prove_interpretation tac prfx_atts expr insts = 
68 
Locale.interpretation_i I prfx_atts expr insts 

69 
#> Proof.global_terminal_proof 

70 
(Method.Basic (K (Method.SIMPLE_METHOD tac), Position.none), NONE) 

71 
#> ProofContext.theory_of; 

72 

73 
fun prove_interpretation_in tac after_qed (name, expr) = 

74 
Locale.interpretation_in_locale 

75 
(ProofContext.theory after_qed) (name, expr) 

76 
#> Proof.global_terminal_proof 

77 
(Method.Basic (K (Method.SIMPLE_METHOD tac), Position.none), NONE) 

78 
#> ProofContext.theory_of; 

79 

80 
fun OF_LAST thm1 thm2 = 

81 
let 

82 
val n = (length o Logic.strip_imp_prems o prop_of) thm2; 

83 
in (thm1 RSN (n, thm2)) end; 

84 

85 
fun strip_all_ofclass thy sort = 

86 
let 

24847  87 
val typ = TVar ((Name.aT, 0), sort); 
24589  88 
fun prem_inclass t = 
89 
case Logic.strip_imp_prems t 

90 
of ofcls :: _ => try Logic.dest_inclass ofcls 

91 
 [] => NONE; 

92 
fun strip_ofclass class thm = 

93 
thm OF (fst o AxClass.of_sort thy (typ, [class])) AxClass.cache; 

94 
fun strip thm = case (prem_inclass o Thm.prop_of) thm 

95 
of SOME (_, class) => thm > strip_ofclass class > strip 

96 
 NONE => thm; 

97 
in strip end; 

98 

99 

100 
(** axclass command **) 

101 

24218  102 
fun axclass_cmd (class, raw_superclasses) raw_specs thy = 
103 
let 

104 
val ctxt = ProofContext.init thy; 

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

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

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

109 
raw_specs) 

24218  110 
> snd 
111 
> (map o map) fst; 

24589  112 
in 
113 
AxClass.define_class (class, superclasses) [] 

114 
(name_atts ~~ axiomss) thy 

115 
end; 

24218  116 

117 
local 

118 

119 
fun gen_instance mk_prop add_thm after_qed insts thy = 

120 
let 

121 
fun after_qed' results = 

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

123 
in 

124 
thy 

125 
> ProofContext.init 

24589  126 
> Proof.theorem_i NONE after_qed' ((map (fn t => [(t, [])]) 
127 
o maps (mk_prop thy)) insts) 

24218  128 
end; 
129 

130 
in 

131 

24589  132 
val instance_arity = 
24218  133 
gen_instance (Logic.mk_arities oo Sign.cert_arity) AxClass.add_arity; 
24589  134 
val classrel = 
24218  135 
gen_instance (single oo (Logic.mk_classrel oo AxClass.cert_classrel)) 
136 
AxClass.add_classrel I o single; 

24589  137 
val classrel_cmd = 
138 
gen_instance (single oo (Logic.mk_classrel oo AxClass.read_classrel)) 

139 
AxClass.add_classrel I o single; 

24218  140 

141 
end; (*local*) 

142 

143 

24589  144 
(** explicit constants for overloaded definitions **) 
24304  145 

146 
structure InstData = TheoryDataFun 

147 
( 

24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

148 
type T = (string * thm) Symtab.table Symtab.table * (string * string) Symtab.table; 
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

149 
(*constant name ~> type constructor ~> (constant name, equation), 
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

150 
constant name ~> (constant name, type constructor)*) 
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

151 
val empty = (Symtab.empty, Symtab.empty); 
24304  152 
val copy = I; 
153 
val extend = I; 

24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

154 
fun merge _ ((taba1, tabb1), (taba2, tabb2)) = 
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

155 
(Symtab.join (K (Symtab.merge (K true))) (taba1, taba2), 
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

156 
Symtab.merge (K true) (tabb1, tabb2)); 
24304  157 
); 
158 

24589  159 
fun inst_thms f thy = (Symtab.fold (Symtab.fold (cons o f o snd o snd) o snd) o fst) 
160 
(InstData.get thy) []; 

161 
fun add_inst (c, tyco) inst = (InstData.map o apfst 

162 
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

163 
#> (InstData.map o apsnd) (Symtab.update_new (fst inst, (c, tyco))); 
24304  164 

24589  165 
fun unoverload thy = MetaSimplifier.rewrite false (inst_thms I thy); 
166 
fun overload thy = MetaSimplifier.rewrite false (inst_thms symmetric thy); 

24304  167 

168 
fun inst_const thy (c, tyco) = 

24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

169 
(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

170 
fun unoverload_const thy (c_ty as (c, _)) = 
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

171 
case AxClass.class_of_param thy c 
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

172 
of SOME class => (case Sign.const_typargs thy c_ty 
24589  173 
of [Type (tyco, _)] => (case Symtab.lookup 
174 
((the o Symtab.lookup (fst (InstData.get thy))) c) tyco 

24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

175 
of SOME (c, _) => c 
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

176 
 NONE => c) 
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

177 
 [_] => c) 
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

178 
 NONE => c; 
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

179 

ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

180 
val param_const = Symtab.lookup o snd o InstData.get; 
24304  181 

182 
fun add_inst_def (class, tyco) (c, ty) thy = 

183 
let 

184 
val tyco_base = NameSpace.base tyco; 

185 
val name_inst = NameSpace.base class ^ "_" ^ tyco_base ^ "_inst"; 

186 
val c_inst_base = NameSpace.base c ^ "_" ^ tyco_base; 

187 
in 

188 
thy 

189 
> Sign.sticky_prefix name_inst 

24435  190 
> PureThy.simple_def ("", []) 
191 
(((c_inst_base, ty, Syntax.NoSyn), []), Const (c, ty)) 

192 
> (fn (c_inst, thm) => add_inst (c, tyco) (c_inst, symmetric thm)) 

193 
> Sign.restore_naming thy 

24304  194 
end; 
195 

196 
fun add_inst_def' (class, tyco) (c, ty) thy = 

24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

197 
if case Symtab.lookup (fst (InstData.get thy)) c 
24304  198 
of NONE => true 
199 
 SOME tab => is_none (Symtab.lookup tab tyco) 

200 
then add_inst_def (class, tyco) (c, Logic.unvarifyT ty) thy 

201 
else thy; 

202 

203 
fun add_def ((class, tyco), ((name, prop), atts)) thy = 

204 
let 

24589  205 
val ((lhs as Const (c, ty), args), rhs) = 
206 
(apfst Term.strip_comb o Logic.dest_equals) prop; 

24701  207 
fun (*add_inst' def ([], (Const (c_inst, ty))) = 
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

208 
if forall (fn TFree _ => true  _ => false) (Sign.const_typargs thy (c_inst, ty)) 
24304  209 
then add_inst (c, tyco) (c_inst, def) 
210 
else add_inst_def (class, tyco) (c, ty) 

24701  211 
*) add_inst' _ t = add_inst_def (class, tyco) (c, ty); 
24304  212 
in 
213 
thy 

214 
> PureThy.add_defs_i true [((name, prop), map (Attrib.attribute thy) atts)] 

215 
> (fn [def] => add_inst' def (args, rhs) #> pair def) 

216 
end; 

217 

218 

24589  219 
(** instances with implicit parameter handling **) 
24218  220 

221 
local 

222 

24707  223 
fun gen_read_def thy prep_att parse_prop ((raw_name, raw_atts), raw_t) = 
24218  224 
let 
24707  225 
val ctxt = ProofContext.init thy; 
226 
val t = parse_prop ctxt raw_t > Syntax.check_prop ctxt; 

24218  227 
val ((c, ty), _) = Sign.cert_def (Sign.pp thy) t; 
228 
val atts = map (prep_att thy) raw_atts; 

229 
val insts = Consts.typargs (Sign.consts_of thy) (c, ty); 

230 
val name = case raw_name 

231 
of "" => NONE 

232 
 _ => SOME raw_name; 

233 
in (c, (insts, ((name, t), atts))) end; 

234 

24707  235 
fun read_def_cmd thy = gen_read_def thy Attrib.intern_src Syntax.parse_prop; 
24218  236 
fun read_def thy = gen_read_def thy (K I) (K I); 
237 

24589  238 
fun gen_instance prep_arity read_def do_proof raw_arities raw_defs after_qed theory = 
24218  239 
let 
240 
val arities = map (prep_arity theory) raw_arities; 

241 
val _ = if null arities then error "at least one arity must be given" else (); 

242 
val _ = case (duplicates (op =) o map #1) arities 

243 
of [] => () 

244 
 dupl_tycos => error ("type constructors occur more than once in arities: " 

245 
^ (commas o map quote) dupl_tycos); 

24836  246 
fun get_remove_constraint c thy = 
247 
let 

248 
val ty = Sign.the_const_constraint thy c; 

249 
in 

250 
thy 

251 
> Sign.add_const_constraint (c, NONE) 

252 
> pair (c, Logic.unvarifyT ty) 

253 
end; 

24218  254 
fun get_consts_class tyco ty class = 
255 
let 

256 
val cs = (these o Option.map snd o try (AxClass.params_of_class theory)) class; 

257 
val subst_ty = map_type_tfree (K ty); 

258 
in 

24304  259 
map (fn (c, ty) => (c, ((class, tyco), subst_ty ty))) cs 
24218  260 
end; 
261 
fun get_consts_sort (tyco, asorts, sort) = 

262 
let 

24589  263 
val ty = Type (tyco, map (fn (v, sort) => TVar ((v, 0), sort)) 
24847  264 
(Name.names Name.context Name.aT asorts)) 
24731  265 
in maps (get_consts_class tyco ty) (Sign.complete_sort theory sort) end; 
24218  266 
val cs = maps get_consts_sort arities; 
267 
fun mk_typnorm thy (ty, ty_sc) = 

268 
case try (Sign.typ_match thy (Logic.varifyT ty_sc, ty)) Vartab.empty 

269 
of SOME env => SOME (Logic.varifyT #> Envir.typ_subst_TVars env #> Logic.unvarifyT) 

270 
 NONE => NONE; 

271 
fun read_defs defs cs thy_read = 

272 
let 

273 
fun read raw_def cs = 

274 
let 

275 
val (c, (inst, ((name_opt, t), atts))) = read_def thy_read raw_def; 

276 
val ty = Consts.instance (Sign.consts_of thy_read) (c, inst); 

24304  277 
val ((class, tyco), ty') = case AList.lookup (op =) cs c 
24218  278 
of NONE => error ("illegal definition for constant " ^ quote c) 
279 
 SOME class_ty => class_ty; 

280 
val name = case name_opt 

281 
of NONE => Thm.def_name (Logic.name_arity (tyco, [], c)) 

282 
 SOME name => name; 

283 
val t' = case mk_typnorm thy_read (ty', ty) 

284 
of NONE => error ("illegal definition for constant " ^ 

285 
quote (c ^ "::" ^ setmp show_sorts true 

286 
(Sign.string_of_typ thy_read) ty)) 

287 
 SOME norm => map_types norm t 

288 
in (((class, tyco), ((name, t'), atts)), AList.delete (op =) c cs) end; 

289 
in fold_map read defs cs end; 

24304  290 
val (defs, other_cs) = read_defs raw_defs cs 
24218  291 
(fold Sign.primitive_arity arities (Theory.copy theory)); 
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

292 
fun after_qed' cs defs = 
24766  293 
fold Sign.add_const_constraint (map (apsnd SOME) cs) 
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

294 
#> after_qed defs; 
24218  295 
in 
296 
theory 

24748  297 
> fold_map get_remove_constraint (map fst cs > distinct (op =)) 
24304  298 
>> fold_map add_def defs 
299 
> 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

300 
> (fn (cs, defs) => do_proof (after_qed' cs defs) arities defs) 
24218  301 
end; 
302 

24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

303 
fun tactic_proof tac f arities defs = 
24218  304 
fold (fn arity => AxClass.prove_arity arity tac) arities 
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

305 
#> f 
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

306 
#> pair defs; 
24218  307 

308 
in 

309 

24589  310 
val instance = gen_instance Sign.cert_arity read_def 
311 
(fn f => fn arities => fn defs => instance_arity f arities); 

312 
val instance_cmd = gen_instance Sign.read_arity read_def_cmd 

313 
(fn f => fn arities => fn defs => instance_arity f arities); 

314 
fun prove_instance tac arities defs = 

315 
gen_instance Sign.cert_arity read_def 

316 
(tactic_proof tac) arities defs (K I); 

24218  317 

318 
end; (*local*) 

319 

320 

321 

24589  322 
(** class data **) 
24218  323 

324 
datatype class_data = ClassData of { 

325 
locale: string, 

326 
consts: (string * string) list 

24836  327 
(*locale parameter ~> constant name*), 
24748  328 
local_sort: sort, 
24589  329 
inst: typ Symtab.table * term Symtab.table 
330 
(*canonical interpretation*), 

24657  331 
intro: thm, 
24748  332 
local_syntax: bool, 
24657  333 
defs: thm list, 
24836  334 
operations: (string * (term * int) option) list 
335 
(*constant name ~> (locale term, instantiaton index of class typ)*) 

24657  336 
}; 
24218  337 

24657  338 
fun rep_class_data (ClassData d) = d; 
24836  339 
fun mk_class_data ((locale, consts, local_sort, inst, intro, local_syntax), (defs, operations)) = 
24748  340 
ClassData { locale = locale, consts = consts, local_sort = local_sort, inst = inst, intro = intro, 
24836  341 
local_syntax = local_syntax, defs = defs, operations = operations }; 
342 
fun map_class_data f (ClassData { locale, consts, local_sort, inst, intro, local_syntax, defs, operations }) = 

343 
mk_class_data (f ((locale, consts, local_sort, inst, intro, local_syntax), (defs, operations))) 

24748  344 
fun merge_class_data _ (ClassData { locale = locale, consts = consts, local_sort = local_sort, inst = inst, 
24836  345 
intro = intro, local_syntax = local_syntax, defs = defs1, operations = operations1 }, 
24748  346 
ClassData { locale = _, consts = _, local_sort = _, inst = _, intro = _, local_syntax = _, 
24836  347 
defs = defs2, operations = operations2 }) = 
24748  348 
mk_class_data ((locale, consts, local_sort, inst, intro, local_syntax), 
24836  349 
(Thm.merge_thms (defs1, defs2), AList.merge (op =) (K true) (operations1, operations2))); 
24218  350 

351 
fun merge_pair f1 f2 ((x1, y1), (x2, y2)) = (f1 (x1, x2), f2 (y1, y2)); 

352 

353 
structure ClassData = TheoryDataFun 

354 
( 

24657  355 
type T = class_data Graph.T * class Symtab.table 
356 
(*locale name ~> class name*); 

24218  357 
val empty = (Graph.empty, Symtab.empty); 
358 
val copy = I; 

359 
val extend = I; 

24657  360 
fun merge _ = merge_pair (Graph.join merge_class_data) (Symtab.merge (K true)); 
24218  361 
); 
362 

363 

364 
(* queries *) 

365 

24657  366 
val lookup_class_data = Option.map rep_class_data oo try o Graph.get_node 
24589  367 
o fst o ClassData.get; 
24218  368 
fun class_of_locale thy = Symtab.lookup ((snd o ClassData.get) thy); 
369 

24589  370 
fun the_class_data thy class = case lookup_class_data thy class 
371 
of NONE => error ("undeclared class " ^ quote class) 

372 
 SOME data => data; 

24218  373 

374 
val ancestry = Graph.all_succs o fst o ClassData.get; 

375 

24435  376 
fun params_of_sort thy = 
24218  377 
let 
378 
fun params class = 

379 
let 

380 
val const_typs = (#params o AxClass.get_definition thy) class; 

24657  381 
val const_names = (#consts o the_class_data thy) class; 
24218  382 
in 
383 
(map o apsnd) (fn c => (c, (the o AList.lookup (op =) const_typs) c)) const_names 

384 
end; 

385 
in maps params o ancestry thy end; 

386 

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

389 
fun these_intros thy = 

24657  390 
Graph.fold (fn (_, (data, _)) => insert Thm.eq_thm ((#intro o rep_class_data) data)) 
24218  391 
((fst o ClassData.get) thy) []; 
392 

24836  393 
fun these_operations thy = 
394 
maps (#operations o the_class_data thy) o ancestry thy; 

24657  395 

24836  396 
fun local_operation thy = Option.join oo AList.lookup (op =) o these_operations thy; 
24657  397 

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

398 
fun sups_local_sort thy sort = 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

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

400 
val sups = filter (is_some o lookup_class_data thy) sort 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

401 
> Sign.minimize_sort thy; 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

402 
val local_sort = case sups 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

403 
of sup :: _ => #local_sort (the_class_data thy sup) 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

404 
 [] => sort; 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

405 
in (sups, local_sort) end; 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

406 

24836  407 
fun local_syntax thy = #local_syntax o the_class_data thy; 
24748  408 

24218  409 
fun print_classes thy = 
410 
let 

411 
val algebra = Sign.classes_of thy; 

412 
val arities = 

413 
Symtab.empty 

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

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

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

417 
val the_arities = these o Symtab.lookup arities; 

418 
fun mk_arity class tyco = 

419 
let 

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

421 
in Sign.pretty_arity thy (tyco, Ss, [class]) end; 

422 
fun mk_param (c, ty) = Pretty.str (Sign.extern_const thy c ^ " :: " 

423 
^ setmp show_sorts false (Sign.string_of_typ thy o Type.strip_sorts) ty); 

424 
fun mk_entry class = (Pretty.block o Pretty.fbreaks o map_filter I) [ 

425 
(SOME o Pretty.str) ("class " ^ class ^ ":"), 

426 
(SOME o Pretty.block) [Pretty.str "supersort: ", 

24731  427 
(Sign.pretty_sort thy o Sign.minimize_sort thy o Sign.super_classes thy) class], 
24657  428 
Option.map (Pretty.str o prefix "locale: " o #locale) (lookup_class_data thy class), 
24218  429 
((fn [] => NONE  ps => (SOME o Pretty.block o Pretty.fbreaks) (Pretty.str "parameters:" :: ps)) o map mk_param 
430 
o these o Option.map #params o try (AxClass.get_definition thy)) class, 

431 
(SOME o Pretty.block o Pretty.breaks) [ 

432 
Pretty.str "instances:", 

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

434 
] 

435 
] 

436 
in 

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

24218  439 
end; 
440 

441 

442 
(* updaters *) 

443 

24748  444 
fun add_class_data ((class, superclasses), (locale, consts, local_sort, inst, intro, local_syntax)) = 
24218  445 
ClassData.map (fn (gr, tab) => ( 
446 
gr 

24748  447 
> Graph.new_node (class, mk_class_data ((locale, (map o apfst) fst consts, local_sort, inst, 
24836  448 
intro, local_syntax), ([], map (apsnd (SOME o rpair 0 o Free) o swap) consts))) 
24218  449 
> fold (curry Graph.add_edge class) superclasses, 
450 
tab 

451 
> Symtab.update (locale, class) 

452 
)); 

453 

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

454 
fun register_const class (entry, def) = 
24657  455 
(ClassData.map o apfst o Graph.map_node class o map_class_data o apsnd) 
24836  456 
(fn (defs, operations) => (def :: defs, apsnd SOME entry :: operations)); 
457 

458 
fun register_abbrev class abbrev = 

459 
(ClassData.map o apfst o Graph.map_node class o map_class_data o apsnd o apsnd) 

460 
(cons (abbrev, NONE)); 

24218  461 

24589  462 

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

464 

465 
fun class_intro thy locale class sups = 

466 
let 

467 
fun class_elim class = 

468 
case (map Drule.unconstrainTs o #axioms o AxClass.get_definition thy) class 

469 
of [thm] => SOME thm 

470 
 [] => NONE; 

471 
val pred_intro = case Locale.intros thy locale 

472 
of ([ax_intro], [intro]) => intro > OF_LAST ax_intro > SOME 

473 
 ([intro], []) => SOME intro 

474 
 ([], [intro]) => SOME intro 

475 
 _ => NONE; 

476 
val pred_intro' = pred_intro 

477 
> Option.map (fn intro => intro OF map_filter class_elim sups); 

478 
val class_intro = (#intro o AxClass.get_definition thy) class; 

479 
val raw_intro = case pred_intro' 

480 
of SOME pred_intro => class_intro > OF_LAST pred_intro 

481 
 NONE => class_intro; 

482 
val sort = Sign.super_classes thy class; 

24847  483 
val typ = TVar ((Name.aT, 0), sort); 
24589  484 
val defs = these_defs thy sups; 
485 
in 

486 
raw_intro 

487 
> Drule.instantiate' [SOME (Thm.ctyp_of thy typ)] [] 

488 
> strip_all_ofclass thy sort 

489 
> Thm.strip_shyps 

490 
> MetaSimplifier.rewrite_rule defs 

491 
> Drule.unconstrainTs 

492 
end; 

493 

494 
fun class_interpretation class facts defs thy = 

495 
let 

24657  496 
val { locale, inst, ... } = the_class_data thy class; 
24589  497 
val tac = (ALLGOALS o ProofContext.fact_tac) facts; 
498 
val prfx = Logic.const_of_class (NameSpace.base class); 

499 
in 

500 
prove_interpretation tac ((false, prfx), []) (Locale.Locale locale) 

501 
(inst, defs) thy 

502 
end; 

503 

504 
fun interpretation_in_rule thy (class1, class2) = 

505 
let 

506 
fun mk_axioms class = 

507 
let 

24657  508 
val { locale, inst = (_, insttab), ... } = the_class_data thy class; 
24589  509 
in 
510 
Locale.global_asms_of thy locale 

511 
> maps snd 

512 
> (map o map_aterms) (fn Free (s, _) => (the o Symtab.lookup insttab) s  t => t) 

24847  513 
> (map o map_types o map_atyps) (fn TFree _ => TFree (Name.aT, [class1])  T => T) 
24589  514 
> map (ObjectLogic.ensure_propT thy) 
515 
end; 

516 
val (prems, concls) = pairself mk_axioms (class1, class2); 

517 
in 

518 
Goal.prove_global thy [] prems (Logic.mk_conjunction_list concls) 

519 
(Locale.intro_locales_tac true (ProofContext.init thy)) 

520 
end; 

24218  521 

522 
fun intro_classes_tac facts st = 

523 
let 

524 
val thy = Thm.theory_of_thm st; 

525 
val classes = Sign.all_classes thy; 

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

527 
val class_intros = these_intros thy; 

528 
fun add_axclass_intro class = 

529 
case try (AxClass.get_definition thy) class of SOME {intro, ...} => cons intro  _ => I; 

530 
val axclass_intros = fold add_axclass_intro classes []; 

531 
in 

532 
st 

533 
> ((ALLGOALS (Method.insert_tac facts THEN' 

534 
REPEAT_ALL_NEW (resolve_tac (class_trivs @ class_intros @ axclass_intros)))) 

535 
THEN Tactic.distinct_subgoals_tac) 

536 
end; 

537 

538 
fun default_intro_classes_tac [] = intro_classes_tac [] 

539 
 default_intro_classes_tac _ = Tactical.no_tac; (*no error message!*) 

540 

541 
fun default_tac rules ctxt facts = 

542 
HEADGOAL (Method.some_rule_tac rules ctxt facts) ORELSE 

543 
default_intro_classes_tac facts; 

544 

545 
val _ = Context.add_setup (Method.add_methods 

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

547 
"backchain introduction rules of classes"), 

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

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

550 

551 

24589  552 
(** classes and class target **) 
24218  553 

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

554 
(* class context initialization *) 
24748  555 

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

556 
fun get_remove_constraints sups local_sort ctxt = 
24748  557 
let 
24901
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

558 
val thy = ProofContext.theory_of ctxt; 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

559 
val operations = these_operations thy sups; 
24836  560 
fun get_remove (c, _) ctxt = 
561 
let 

562 
val ty = ProofContext.the_const_constraint ctxt c; 

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

563 
val ty' = map_atyps (fn ty as TFree (v, _) => if v = Name.aT 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

564 
then TFree (v, local_sort) else ty  ty => ty) ty; 
24836  565 
in 
566 
ctxt 

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

567 
> ProofContext.add_const_constraint (c, SOME ty') 
24836  568 
> pair (c, ty) 
569 
end; 

24748  570 
in 
571 
ctxt 

24836  572 
> fold_map get_remove operations 
24748  573 
end; 
574 

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

575 
fun sort_term_check thy sups local_sort constraints ts ctxt = 
24748  576 
let 
24901
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

577 
val local_operation = local_operation thy sups; 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

578 
val consts = ProofContext.consts_of ctxt; 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

579 
fun check_typ (c, ty) (t', idx) = case nth (Consts.typargs consts (c, ty)) idx 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

580 
of TFree (v, _) => if v = Name.aT 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

581 
then apfst (AList.update (op =) ((c, ty), t')) else I 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

582 
 TVar (vi, _) => if TypeInfer.is_param vi 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

583 
then apfst (AList.update (op =) ((c, ty), t')) 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

584 
#> apsnd (insert (op =) vi) else I 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

585 
 _ => I; 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

586 
fun add_const (Const (c, ty)) = (case local_operation c 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

587 
of SOME (t', idx) => check_typ (c, ty) (t', idx) 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

588 
 NONE => I) 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

589 
 add_const _ = I; 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

590 
val (cs, typarams) = (fold o fold_aterms) add_const ts ([], []); 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

591 
val ts' = map (map_aterms 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

592 
(fn t as Const (c, ty) => the_default t (AList.lookup (op =) cs (c, ty))  t => t) 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

593 
#> (map_types o map_type_tvar) (fn var as (vi, _) => if member (op =) typarams vi 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

594 
then TFree (Name.aT, local_sort) else TVar var)) ts; 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

595 
val ctxt' = fold (ProofContext.add_const_constraint o apsnd SOME) constraints ctxt; 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

596 
in (ts', ctxt') end; 
24748  597 

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

598 
fun init_class_ctxt thy sups local_sort ctxt = 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

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

600 
> Variable.declare_term 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

601 
(Logic.mk_type (TFree (Name.aT, local_sort))) 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

602 
> get_remove_constraints sups local_sort 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

603 
> (fn constraints => Context.proof_map (Syntax.add_term_check 50 "class" 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

604 
(sort_term_check thy sups local_sort constraints))); 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

605 

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

606 
fun init class ctxt = 
24748  607 
let 
608 
val thy = ProofContext.theory_of ctxt; 

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

609 
val local_sort = (#local_sort o the_class_data thy) class; 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

610 
in init_class_ctxt thy [class] local_sort ctxt end; 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

611 

24748  612 

24589  613 
(* class definition *) 
24218  614 

615 
local 

616 

24707  617 
fun read_param thy raw_t = (* FIXME ProofContext.read_const (!?) *) 
24218  618 
let 
24707  619 
val t = Syntax.read_term_global thy raw_t 
24218  620 
in case try dest_Const t 
621 
of SOME (c, _) => c 

622 
 NONE => error ("Not a constant: " ^ Sign.string_of_term thy t) 

623 
end; 

624 

24748  625 
fun gen_class_spec prep_class prep_expr process_expr thy raw_supclasses raw_includes_elems = 
24218  626 
let 
24748  627 
val supclasses = map (prep_class thy) raw_supclasses; 
24901
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

628 
val (sups, local_sort) = sups_local_sort thy supclasses; 
24748  629 
val supsort = Sign.minimize_sort thy supclasses; 
630 
val suplocales = map (Locale.Locale o #locale o the_class_data thy) sups; 

631 
val (raw_elems, includes) = fold_rev (fn Locale.Elem e => apfst (cons e) 

632 
 Locale.Expr i => apsnd (cons (prep_expr thy i))) raw_includes_elems ([], []); 

633 
val supexpr = Locale.Merge suplocales; 

634 
val supparams = (map fst o Locale.parameters_of_expr thy) supexpr; 

635 
val supconsts = AList.make (the o AList.lookup (op =) (params_of_sort thy sups)) 

636 
(map fst supparams); 

637 
val mergeexpr = Locale.Merge (suplocales @ includes); 

638 
val constrain = Element.Constrains ((map o apsnd o map_atyps) 

24847  639 
(fn TFree (_, sort) => TFree (Name.aT, sort)) supparams); 
24748  640 
in 
641 
ProofContext.init thy 

642 
> Locale.cert_expr supexpr [constrain] 

643 
> snd 

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

644 
> init_class_ctxt thy sups local_sort 
24748  645 
> process_expr Locale.empty raw_elems 
646 
> fst 

24836  647 
> (fn elems => ((((sups, supconsts), (supsort, local_sort, mergeexpr)), 
24748  648 
(*FIXME*) if null includes then constrain :: elems else elems))) 
649 
end; 

650 

651 
val read_class_spec = gen_class_spec Sign.intern_class Locale.intern_expr Locale.read_expr; 

652 
val check_class_spec = gen_class_spec (K I) (K I) Locale.cert_expr; 

653 

654 
fun gen_class prep_spec prep_param local_syntax bname 

655 
raw_supclasses raw_includes_elems raw_other_consts thy = 

656 
let 

24836  657 
val (((sups, supconsts), (supsort, local_sort, mergeexpr)), elems) = 
24748  658 
prep_spec thy raw_supclasses raw_includes_elems; 
659 
val other_consts = map (prep_param thy) raw_other_consts; 

24589  660 
fun mk_instT class = Symtab.empty 
24847  661 
> Symtab.update (Name.aT, TFree (Name.aT, [class])); 
24589  662 
fun mk_inst class param_names cs = 
663 
Symtab.empty 

664 
> fold2 (fn v => fn (c, ty) => Symtab.update (v, Const 

665 
(c, Term.map_type_tfree (fn (v, _) => TFree (v, [class])) ty))) param_names cs; 

24218  666 
fun extract_params thy name_locale = 
667 
let 

668 
val params = Locale.parameters_of thy name_locale; 

24748  669 
val _ = if Sign.subsort thy (supsort, local_sort) then () else error 
670 
("Sort " ^ Sign.string_of_sort thy local_sort 

671 
^ " is less general than permitted least general sort " 

672 
^ Sign.string_of_sort thy supsort); 

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

674 
(map fst params, params 
24847  675 
> (map o apfst o apsnd o Term.map_type_tfree) (K (TFree (Name.aT, local_sort))) 
24901
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

676 
> (map o apsnd) (fork_mixfix true (SOME "") #> fst) 
24218  677 
> chop (length supconsts) 
24901
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

678 
> snd) 
24218  679 
end; 
680 
fun extract_assumes name_locale params thy cs = 

681 
let 

682 
val consts = supconsts @ (map (fst o fst) params ~~ cs); 

683 
fun subst (Free (c, ty)) = 

684 
Const ((fst o the o AList.lookup (op =) consts) c, ty) 

685 
 subst t = t; 

686 
fun prep_asm ((name, atts), ts) = 

687 
((NameSpace.base name, map (Attrib.attribute thy) atts), 

24589  688 
(map o map_aterms) subst ts); 
24218  689 
in 
690 
Locale.global_asms_of thy name_locale 

691 
> map prep_asm 

692 
end; 

693 
fun note_intro name_axclass class_intro = 

694 
PureThy.note_thmss_qualified "" ((Logic.const_of_class o NameSpace.base) name_axclass) 

695 
[(("intro", []), [([class_intro], [])])] 

696 
#> snd 

697 
in 

698 
thy 

24748  699 
> Locale.add_locale_i (SOME "") bname mergeexpr elems 
24218  700 
> (fn name_locale => ProofContext.theory_result ( 
701 
`(fn thy => extract_params thy name_locale) 

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

702 
#> (fn (globals, params) => 
24589  703 
AxClass.define_class_params (bname, supsort) params 
704 
(extract_assumes name_locale params) other_consts 

705 
#> (fn (name_axclass, (consts, axioms)) => 

24218  706 
`(fn thy => class_intro thy name_locale name_axclass sups) 
707 
#> (fn class_intro => 

708 
add_class_data ((name_axclass, sups), 

24748  709 
(name_locale, map fst params ~~ map fst consts, local_sort, 
24657  710 
(mk_instT name_axclass, mk_inst name_axclass (map fst globals) 
24748  711 
(map snd supconsts @ consts)), class_intro, local_syntax)) 
24218  712 
#> note_intro name_axclass class_intro 
24589  713 
#> class_interpretation name_axclass axioms [] 
24218  714 
#> pair name_axclass 
715 
))))) 

716 
end; 

717 

718 
in 

719 

24748  720 
val class_cmd = gen_class read_class_spec read_param; 
721 
val class = gen_class check_class_spec (K I); 

24218  722 

723 
end; (*local*) 

724 

725 

24589  726 
(* definition in class target *) 
24218  727 

728 
fun export_fixes thy class = 

729 
let 

24435  730 
val consts = params_of_sort thy [class]; 
24218  731 
fun subst_aterm (t as Free (v, ty)) = (case AList.lookup (op =) consts v 
732 
of SOME (c, _) => Const (c, ty) 

733 
 NONE => t) 

734 
 subst_aterm t = t; 

24657  735 
in Term.map_aterms subst_aterm end; 
24218  736 

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

737 
fun mk_operation_entry thy (c, rhs) = 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

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

739 
val typargs = Sign.const_typargs thy (c, fastype_of rhs); 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

740 
val typidx = find_index (fn TFree (w, _) => Name.aT = w  _ => false) typargs; 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

741 
in (c, (rhs, typidx)) end; 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

742 

24218  743 
fun add_const_in_class class ((c, rhs), syn) thy = 
744 
let 

745 
val prfx = (Logic.const_of_class o NameSpace.base) class; 

24657  746 
fun mk_name c = 
24218  747 
let 
748 
val n1 = Sign.full_name thy c; 

749 
val n2 = NameSpace.qualifier n1; 

750 
val n3 = NameSpace.base n1; 

24657  751 
in NameSpace.implode [n2, prfx, n3] end; 
752 
val constrain_sort = curry (Sorts.inter_sort (Sign.classes_of thy)) [class]; 

24748  753 
val rhs' = export_fixes thy class rhs; 
24657  754 
val subst_typ = Term.map_type_tfree (fn var as (w, sort) => 
24847  755 
if w = Name.aT then TFree (w, constrain_sort sort) else TFree var); 
24218  756 
val ty' = Term.fastype_of rhs'; 
24657  757 
val ty'' = subst_typ ty'; 
758 
val c' = mk_name c; 

759 
val def = (c, Logic.mk_equals (Const (c', ty'), rhs')); 

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

760 
val (syn', _) = fork_mixfix true (SOME class) syn; 
24657  761 
fun interpret def thy = 
24218  762 
let 
24589  763 
val def' = symmetric def; 
24218  764 
val def_eq = Thm.prop_of def'; 
24901
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

765 
val entry = mk_operation_entry thy (c', rhs); 
24218  766 
in 
24657  767 
thy 
768 
> class_interpretation class [def'] [def_eq] 

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

769 
> register_const class (entry, def') 
24218  770 
end; 
771 
in 

772 
thy 

773 
> Sign.add_path prfx 

24770
695a8e087b9f
Sign.add_consts_authentic: tags (Markup.property list);
wenzelm
parents:
24766
diff
changeset

774 
> Sign.add_consts_authentic [] [(c, ty', syn')] 
24218  775 
> Sign.parent_path 
776 
> Sign.sticky_prefix prfx 

777 
> PureThy.add_defs_i false [(def, [])] 

778 
> (fn [def] => interpret def) 

24766  779 
> Sign.add_const_constraint (c', SOME ty'') 
24218  780 
> Sign.restore_naming thy 
781 
end; 

782 

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

783 

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

784 
(* abbreviation in class target *) 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

785 

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

786 
fun add_abbrev_in_class class prmode ((c, rhs), syn) thy = 
24836  787 
let 
24901
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

788 
val prfx = (Logic.const_of_class o NameSpace.base) class; 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

789 
fun mk_name c = 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

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

791 
val n1 = Sign.full_name thy c; 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

792 
val n2 = NameSpace.qualifier n1; 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

793 
val n3 = NameSpace.base n1; 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

794 
in NameSpace.implode [n2, prfx, prfx, n3] end; 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

795 
val c' = mk_name c; 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

796 
val rhs' = export_fixes thy class rhs; 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

797 
val ty' = fastype_of rhs'; 
24836  798 
in 
799 
thy 

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

800 
> Sign.add_notation prmode [(Const (c', ty'), syn)] 
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

801 
> register_abbrev class c' 
24836  802 
end; 
803 

24589  804 

805 
(* interpretation in class target *) 

806 

807 
local 

808 

809 
fun gen_interpretation_in_class prep_class do_proof (raw_class, raw_superclass) theory = 

810 
let 

811 
val class = prep_class theory raw_class; 

812 
val superclass = prep_class theory raw_superclass; 

24657  813 
val loc_name = (#locale o the_class_data theory) class; 
814 
val loc_expr = (Locale.Locale o #locale o the_class_data theory) superclass; 

24589  815 
fun prove_classrel (class, superclass) thy = 
816 
let 

24731  817 
val classes = Sign.complete_sort thy [superclass] 
24589  818 
> filter_out (fn class' => Sign.subsort thy ([class], [class'])); 
819 
fun instance_subclass (class1, class2) thy = 

820 
let 

821 
val interp = interpretation_in_rule thy (class1, class2); 

822 
val ax = #axioms (AxClass.get_definition thy class1); 

823 
val intro = #intro (AxClass.get_definition thy class2) 

824 
> Drule.instantiate' [SOME (Thm.ctyp_of thy 

24847  825 
(TVar ((Name.aT, 0), [class1])))] []; 
24731  826 
val thm = 
24589  827 
intro 
828 
> OF_LAST (interp OF ax) 

829 
> strip_all_ofclass thy (Sign.super_classes thy class2); 

830 
in 

831 
thy > AxClass.add_classrel thm 

832 
end; 

833 
in 

834 
thy > fold_rev (curry instance_subclass class) classes 

835 
end; 

836 
in 

837 
theory 

838 
> do_proof (prove_classrel (class, superclass)) (loc_name, loc_expr) 

839 
end; 

840 

841 
in 

842 

843 
val interpretation_in_class = gen_interpretation_in_class Sign.certify_class 

844 
(Locale.interpretation_in_locale o ProofContext.theory); 

845 
val interpretation_in_class_cmd = gen_interpretation_in_class Sign.read_class 

846 
(Locale.interpretation_in_locale o ProofContext.theory); 

847 
val prove_interpretation_in_class = gen_interpretation_in_class Sign.certify_class 

848 
o prove_interpretation_in; 

849 

850 
end; (*local*) 

851 

24218  852 
end; 