author  haftmann 
Fri, 12 Oct 2007 14:42:30 +0200  
changeset 25002  c3d9cb390471 
parent 24981  4ec3f95190bf 
child 25010  8bc74ba1423d 
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 

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

16 

25002  17 
val class: bstring > class list > Element.context_i Locale.element list 
24218  18 
> string list > theory > string * Proof.context 
25002  19 
val class_cmd: bstring > xstring list > Element.context Locale.element list 
24589  20 
> xstring list > theory > string * Proof.context 
24914
95cda5dd58d5
added proper subclass concept; improved class target
haftmann
parents:
24901
diff
changeset

21 
val init: class > Proof.context > Proof.context; 
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

22 
val add_const_in_class: string > (string * term) * Syntax.mixfix 
24914
95cda5dd58d5
added proper subclass concept; improved class target
haftmann
parents:
24901
diff
changeset

23 
> theory > string * theory 
95cda5dd58d5
added proper subclass concept; improved class target
haftmann
parents:
24901
diff
changeset

24 
val add_abbrev_in_class: string > Syntax.mode > (string * term) * mixfix 
95cda5dd58d5
added proper subclass concept; improved class target
haftmann
parents:
24901
diff
changeset

25 
> theory > string * theory 
25002  26 
val remove_constraint: class > string > Proof.context > Proof.context 
27 
val class_of_locale: theory > string > class option 

28 
val locale_of_class: theory > class > string 

29 
val these_params: theory > sort > (string * (string * typ)) list 

24589  30 
val intro_classes_tac: thm list > tactic 
31 
val default_intro_classes_tac: thm list > tactic 

32 
val print_classes: theory > unit 

25002  33 
val uncheck: bool ref 
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

34 

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

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

37 
> (thm list > theory > theory) 
24218  38 
> theory > Proof.state 
24589  39 
val instance_cmd: (bstring * xstring list * xstring) list 
40 
> ((bstring * Attrib.src list) * xstring) list 

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

41 
> (thm list > theory > theory) 
24218  42 
> theory > Proof.state 
24589  43 
val prove_instance: tactic > arity list 
24218  44 
> ((bstring * Attrib.src list) * term) list 
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

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

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

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

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

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

50 
val param_const: theory > string > (string * string) option 
24218  51 
end; 
52 

53 
structure Class : CLASS = 

54 
struct 

55 

56 
(** auxiliary **) 

57 

58 
fun fork_mixfix is_loc some_class mx = 

59 
let 

60 
val mx' = Syntax.unlocalize_mixfix mx; 

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

61 
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

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

65 

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

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

70 
#> ProofContext.theory_of; 

71 

72 
fun OF_LAST thm1 thm2 = 

73 
let 

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

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

76 

77 
fun strip_all_ofclass thy sort = 

78 
let 

24847  79 
val typ = TVar ((Name.aT, 0), sort); 
24589  80 
fun prem_inclass t = 
81 
case Logic.strip_imp_prems t 

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

83 
 [] => NONE; 

84 
fun strip_ofclass class thm = 

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

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

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

88 
 NONE => thm; 

89 
in strip end; 

90 

91 

92 
(** axclass command **) 

93 

24218  94 
fun axclass_cmd (class, raw_superclasses) raw_specs thy = 
95 
let 

96 
val ctxt = ProofContext.init thy; 

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

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

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

101 
raw_specs) 

24218  102 
> snd 
103 
> (map o map) fst; 

24589  104 
in 
105 
AxClass.define_class (class, superclasses) [] 

106 
(name_atts ~~ axiomss) thy 

107 
end; 

24218  108 

109 
local 

110 

111 
fun gen_instance mk_prop add_thm after_qed insts thy = 

112 
let 

113 
fun after_qed' results = 

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

115 
in 

116 
thy 

117 
> ProofContext.init 

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

24218  120 
end; 
121 

122 
in 

123 

24589  124 
val instance_arity = 
24218  125 
gen_instance (Logic.mk_arities oo Sign.cert_arity) AxClass.add_arity; 
24589  126 
val classrel = 
24218  127 
gen_instance (single oo (Logic.mk_classrel oo AxClass.cert_classrel)) 
128 
AxClass.add_classrel I o single; 

24589  129 
val classrel_cmd = 
130 
gen_instance (single oo (Logic.mk_classrel oo AxClass.read_classrel)) 

131 
AxClass.add_classrel I o single; 

24218  132 

133 
end; (*local*) 

134 

135 

24589  136 
(** explicit constants for overloaded definitions **) 
24304  137 

138 
structure InstData = TheoryDataFun 

139 
( 

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

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

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

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

143 
val empty = (Symtab.empty, Symtab.empty); 
24304  144 
val copy = I; 
145 
val extend = I; 

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

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

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

148 
Symtab.merge (K true) (tabb1, tabb2)); 
24304  149 
); 
150 

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

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

154 
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

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

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

24304  159 

160 
fun inst_const thy (c, tyco) = 

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

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

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

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

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

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

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

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

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

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

171 

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

172 
val param_const = Symtab.lookup o snd o InstData.get; 
24304  173 

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

175 
let 

176 
val tyco_base = NameSpace.base tyco; 

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

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

179 
in 

180 
thy 

181 
> Sign.sticky_prefix name_inst 

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

182 
> Sign.declare_const [] (c_inst_base, ty, Syntax.NoSyn) 
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset

183 
> (fn const as Const (c_inst, _) => 
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset

184 
PureThy.add_defs_i false 
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset

185 
[((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

186 
#> (fn [thm] => add_inst (c, tyco) (c_inst, Thm.symmetric thm))) 
24435  187 
> Sign.restore_naming thy 
24304  188 
end; 
189 

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

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

191 
if case Symtab.lookup (fst (InstData.get thy)) c 
24304  192 
of NONE => true 
193 
 SOME tab => is_none (Symtab.lookup tab tyco) 

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

195 
else thy; 

196 

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

198 
let 

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

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

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

24701  205 
*) add_inst' _ t = add_inst_def (class, tyco) (c, ty); 
24304  206 
in 
207 
thy 

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

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

210 
end; 

211 

212 

24589  213 
(** instances with implicit parameter handling **) 
24218  214 

215 
local 

216 

24707  217 
fun gen_read_def thy prep_att parse_prop ((raw_name, raw_atts), raw_t) = 
24218  218 
let 
24707  219 
val ctxt = ProofContext.init thy; 
220 
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

221 
val ((c, ty), _) = Sign.cert_def ctxt t; 
24218  222 
val atts = map (prep_att thy) raw_atts; 
223 
val insts = Consts.typargs (Sign.consts_of thy) (c, ty); 

224 
val name = case raw_name 

225 
of "" => NONE 

226 
 _ => SOME raw_name; 

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

228 

24707  229 
fun read_def_cmd thy = gen_read_def thy Attrib.intern_src Syntax.parse_prop; 
24218  230 
fun read_def thy = gen_read_def thy (K I) (K I); 
231 

24589  232 
fun gen_instance prep_arity read_def do_proof raw_arities raw_defs after_qed theory = 
24218  233 
let 
234 
val arities = map (prep_arity theory) raw_arities; 

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

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

237 
of [] => () 

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

239 
^ (commas o map quote) dupl_tycos); 

24836  240 
fun get_remove_constraint c thy = 
241 
let 

242 
val ty = Sign.the_const_constraint thy c; 

243 
in 

244 
thy 

245 
> Sign.add_const_constraint (c, NONE) 

246 
> pair (c, Logic.unvarifyT ty) 

247 
end; 

24218  248 
fun get_consts_class tyco ty class = 
249 
let 

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

250 
val cs = (these o try (#params o AxClass.get_info theory)) class; 
24218  251 
val subst_ty = map_type_tfree (K ty); 
252 
in 

24304  253 
map (fn (c, ty) => (c, ((class, tyco), subst_ty ty))) cs 
24218  254 
end; 
255 
fun get_consts_sort (tyco, asorts, sort) = 

256 
let 

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

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

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

264 
 NONE => NONE; 

265 
fun read_defs defs cs thy_read = 

266 
let 

267 
fun read raw_def cs = 

268 
let 

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

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

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

274 
val name = case name_opt 

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

276 
 SOME name => name; 

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

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

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

280 
(Sign.string_of_typ thy_read) ty)) 

281 
 SOME norm => map_types norm t 

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

283 
in fold_map read defs cs end; 

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

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

288 
#> after_qed defs; 
24218  289 
in 
290 
theory 

24748  291 
> fold_map get_remove_constraint (map fst cs > distinct (op =)) 
24304  292 
>> fold_map add_def defs 
293 
> 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

294 
> (fn (cs, defs) => do_proof (after_qed' cs defs) arities defs) 
24218  295 
end; 
296 

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

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

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

300 
#> pair defs; 
24218  301 

302 
in 

303 

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

306 
val instance_cmd = gen_instance Sign.read_arity read_def_cmd 

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

308 
fun prove_instance tac arities defs = 

309 
gen_instance Sign.cert_arity read_def 

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

24218  311 

312 
end; (*local*) 

313 

314 

315 

24589  316 
(** class data **) 
24218  317 

318 
datatype class_data = ClassData of { 

319 
locale: string, 

320 
consts: (string * string) list 

24836  321 
(*locale parameter ~> constant name*), 
24748  322 
local_sort: sort, 
24589  323 
inst: typ Symtab.table * term Symtab.table 
324 
(*canonical interpretation*), 

24657  325 
intro: thm, 
326 
defs: thm list, 

25002  327 
operations: (string * (term * (typ * int))) list 
328 
(*constant name ~> (locale term, (constant constraint, instantiaton index of class typ))*), 

329 
operations_rev: (string * string) list 

330 
(*locale operation ~> constant name*) 

24657  331 
}; 
24218  332 

24657  333 
fun rep_class_data (ClassData d) = d; 
25002  334 
fun mk_class_data ((locale, consts, local_sort, inst, intro), 
335 
(defs, operations, operations_rev)) = 

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

336 
ClassData { locale = locale, consts = consts, local_sort = local_sort, inst = inst, 
25002  337 
intro = intro, defs = defs, operations = operations, 
338 
operations_rev = operations_rev }; 

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

339 
fun map_class_data f (ClassData { locale, consts, local_sort, inst, intro, 
25002  340 
defs, operations, operations_rev }) = 
341 
mk_class_data (f ((locale, consts, local_sort, inst, intro), 

342 
(defs, operations, operations_rev))); 

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

343 
fun merge_class_data _ (ClassData { locale = locale, consts = consts, 
25002  344 
local_sort = local_sort, inst = inst, intro = intro, 
345 
defs = defs1, operations = operations1, operations_rev = operations_rev1 }, 

346 
ClassData { locale = _, consts = _, local_sort = _, inst = _, intro = _, 

347 
defs = defs2, operations = operations2, operations_rev = operations_rev2 }) = 

348 
mk_class_data ((locale, consts, local_sort, inst, intro), 

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

349 
(Thm.merge_thms (defs1, defs2), 
25002  350 
AList.merge (op =) (K true) (operations1, operations2), 
351 
AList.merge (op =) (K true) (operations_rev1, operations_rev2))); 

24218  352 

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

354 

355 
structure ClassData = TheoryDataFun 

356 
( 

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

24218  359 
val empty = (Graph.empty, Symtab.empty); 
360 
val copy = I; 

361 
val extend = I; 

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

365 

366 
(* queries *) 

367 

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

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

374 
 SOME data => data; 

24218  375 

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

376 
val locale_of_class = #locale oo the_class_data; 
95cda5dd58d5
added proper subclass concept; improved class target
haftmann
parents:
24901
diff
changeset

377 

24218  378 
val ancestry = Graph.all_succs o fst o ClassData.get; 
379 

25002  380 
fun these_params thy = 
24218  381 
let 
382 
fun params class = 

383 
let 

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

384 
val const_typs = (#params o AxClass.get_info thy) class; 
24657  385 
val const_names = (#consts o the_class_data thy) class; 
24218  386 
in 
387 
(map o apsnd) (fn c => (c, (the o AList.lookup (op =) const_typs) c)) const_names 

388 
end; 

389 
in maps params o ancestry thy end; 

390 

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

393 
fun these_intros thy = 

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

24836  397 
fun these_operations thy = 
398 
maps (#operations o the_class_data thy) o ancestry thy; 

24657  399 

25002  400 
fun these_operations_rev thy = 
401 
maps (#operations_rev o the_class_data thy) o ancestry thy; 

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

402 

25002  403 
fun local_operation thy = AList.lookup (op =) o these_operations thy; 
404 

405 
fun global_operation thy = AList.lookup (op =) o these_operations_rev thy; 

24657  406 

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

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

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

409 
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

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

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

412 
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

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

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

415 

24218  416 
fun print_classes thy = 
417 
let 

24920  418 
val ctxt = ProofContext.init thy; 
419 

24218  420 
val algebra = Sign.classes_of thy; 
421 
val arities = 

422 
Symtab.empty 

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

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

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

426 
val the_arities = these o Symtab.lookup arities; 

427 
fun mk_arity class tyco = 

428 
let 

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

24920  430 
in Syntax.pretty_arity ctxt (tyco, Ss, [class]) end; 
24218  431 
fun mk_param (c, ty) = Pretty.str (Sign.extern_const thy c ^ " :: " 
24920  432 
^ setmp show_sorts false (Syntax.string_of_typ ctxt o Type.strip_sorts) ty); 
24218  433 
fun mk_entry class = (Pretty.block o Pretty.fbreaks o map_filter I) [ 
434 
(SOME o Pretty.str) ("class " ^ class ^ ":"), 

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

24920  436 
(Syntax.pretty_sort ctxt o Sign.minimize_sort thy o Sign.super_classes thy) class], 
24657  437 
Option.map (Pretty.str o prefix "locale: " o #locale) (lookup_class_data thy class), 
24218  438 
((fn [] => NONE  ps => (SOME o Pretty.block o Pretty.fbreaks) (Pretty.str "parameters:" :: ps)) o map mk_param 
24930
cc2e0e8c81af
renamed AxClass.get_definition to AxClass.get_info (again);
wenzelm
parents:
24920
diff
changeset

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

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

443 
] 

444 
] 

445 
in 

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

24218  448 
end; 
449 

450 

451 
(* updaters *) 

452 

25002  453 
fun add_class_data ((class, superclasses), (locale, cs, local_sort, inst, intro)) = 
454 
let 

455 
val operations = map (fn (v_ty, (c, ty)) => (c, (Free v_ty, (ty, 0)))) cs; 

456 
val cs = (map o pairself) fst cs; 

457 
val add_class = Graph.new_node (class, mk_class_data ((locale, 

458 
cs, local_sort, inst, intro), 

459 
([], operations, []))) 

460 
#> fold (curry Graph.add_edge class) superclasses; 

461 
val add_locale = Symtab.update (locale, class); 

462 
in 

463 
ClassData.map (fn (gr, tab) => (add_class gr, add_locale tab)) 

464 
end; 

24218  465 

25002  466 
fun register_operation class (entry, some_def) = 
24657  467 
(ClassData.map o apfst o Graph.map_node class o map_class_data o apsnd) 
25002  468 
(fn (defs, operations, operations_rev) => 
469 
(case some_def of NONE => defs  SOME def => def :: defs, 

470 
entry :: operations, (*FIXME*)operations_rev)); 

24218  471 

24589  472 

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

474 

475 
fun class_intro thy locale class sups = 

476 
let 

477 
fun class_elim class = 

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

478 
case (map Drule.unconstrainTs o #axioms o AxClass.get_info thy) class 
24589  479 
of [thm] => SOME thm 
480 
 [] => NONE; 

481 
val pred_intro = case Locale.intros thy locale 

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

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

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

485 
 _ => NONE; 

486 
val pred_intro' = pred_intro 

487 
> 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

488 
val class_intro = (#intro o AxClass.get_info thy) class; 
24589  489 
val raw_intro = case pred_intro' 
490 
of SOME pred_intro => class_intro > OF_LAST pred_intro 

491 
 NONE => class_intro; 

492 
val sort = Sign.super_classes thy class; 

24847  493 
val typ = TVar ((Name.aT, 0), sort); 
24589  494 
val defs = these_defs thy sups; 
495 
in 

496 
raw_intro 

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

498 
> strip_all_ofclass thy sort 

499 
> Thm.strip_shyps 

500 
> MetaSimplifier.rewrite_rule defs 

501 
> Drule.unconstrainTs 

502 
end; 

503 

504 
fun class_interpretation class facts defs thy = 

505 
let 

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

509 
in 

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

511 
(inst, defs) thy 

512 
end; 

513 

514 
fun interpretation_in_rule thy (class1, class2) = 

515 
let 

516 
fun mk_axioms class = 

517 
let 

24657  518 
val { locale, inst = (_, insttab), ... } = the_class_data thy class; 
24589  519 
in 
520 
Locale.global_asms_of thy locale 

521 
> maps snd 

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

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

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

527 
in 

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

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

530 
end; 

24218  531 

532 
fun intro_classes_tac facts st = 

533 
let 

534 
val thy = Thm.theory_of_thm st; 

535 
val classes = Sign.all_classes thy; 

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

537 
val class_intros = these_intros thy; 

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

538 
val axclass_intros = map_filter (try (#intro o AxClass.get_info thy)) classes; 
24218  539 
in 
24930
cc2e0e8c81af
renamed AxClass.get_definition to AxClass.get_info (again);
wenzelm
parents:
24920
diff
changeset

540 
(ALLGOALS (Method.insert_tac facts THEN' 
cc2e0e8c81af
renamed AxClass.get_definition to AxClass.get_info (again);
wenzelm
parents:
24920
diff
changeset

541 
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

542 
THEN Tactic.distinct_subgoals_tac) st 
24218  543 
end; 
544 

545 
fun default_intro_classes_tac [] = intro_classes_tac [] 

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

546 
 default_intro_classes_tac _ = no_tac; 
24218  547 

548 
fun default_tac rules ctxt facts = 

549 
HEADGOAL (Method.some_rule_tac rules ctxt facts) ORELSE 

550 
default_intro_classes_tac facts; 

551 

552 
val _ = Context.add_setup (Method.add_methods 

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

554 
"backchain introduction rules of classes"), 

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

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

557 

558 

24589  559 
(** classes and class target **) 
24218  560 

25002  561 
(* class context syntax *) 
24748  562 

25002  563 
fun internal_remove_constraint local_sort (c, (_, (ty, typidx))) ctxt = 
24914
95cda5dd58d5
added proper subclass concept; improved class target
haftmann
parents:
24901
diff
changeset

564 
let 
25002  565 
val consts = ProofContext.consts_of ctxt; 
566 
val typargs = Consts.typargs consts (c, ty); 

567 
val typargs' = nth_map typidx (K (TVar ((Name.aT, 0), local_sort))) typargs; 

568 
val ty' = Consts.instance consts (c, typargs'); 

569 
in ProofContext.add_const_constraint (c, SOME ty') ctxt end; 

570 

571 
fun remove_constraint class c ctxt = 

572 
let 

573 
val thy = ProofContext.theory_of ctxt; 

574 
val SOME entry = local_operation thy [class] c; 

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

575 
in 
25002  576 
internal_remove_constraint 
577 
((#local_sort o the_class_data thy) class) (c, entry) ctxt 

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

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

579 

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

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

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

583 
val local_operation = local_operation thy sups; 
25002  584 
val constraints = these_operations thy sups > (map o apsnd) (fst o snd); 
24901
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

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

586 
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

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

588 
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

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

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

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

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

593 
fun add_const (Const (c, ty)) = (case local_operation c 
25002  594 
of SOME (t', (_, idx)) => check_typ (c, ty) (t', idx) 
24901
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

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

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

597 
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

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

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

600 
#> (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

601 
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

602 
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

603 
in (ts', ctxt') end; 
24748  604 

25002  605 
val uncheck = ref false; 
606 

607 
fun sort_term_uncheck sups ts ctxt = 

608 
let 

609 
val thy = ProofContext.theory_of ctxt; 

610 
val global_param = AList.lookup (op =) (these_params thy sups) #> Option.map fst; 

611 
val global_operation = global_operation thy sups; 

612 
fun globalize (t as Free (v, ty)) = (case global_param v 

613 
of SOME c => Const (c, ty) 

614 
 NONE => t) 

615 
 globalize (t as Const (c, ty)) = (case global_operation c 

616 
of SOME c => Const (c, ty) 

617 
 NONE => t) 

618 
 globalize t = t; 

619 
val ts' = if ! uncheck then (map o map_aterms) globalize ts else ts; 

620 
in (ts', ctxt) end; 

621 

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

622 
fun init_class_ctxt sups local_sort ctxt = 
95cda5dd58d5
added proper subclass concept; improved class target
haftmann
parents:
24901
diff
changeset

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

624 
val operations = these_operations (ProofContext.theory_of ctxt) sups; 
95cda5dd58d5
added proper subclass concept; improved class target
haftmann
parents:
24901
diff
changeset

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

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

627 
> Variable.declare_term 
95cda5dd58d5
added proper subclass concept; improved class target
haftmann
parents:
24901
diff
changeset

628 
(Logic.mk_type (TFree (Name.aT, local_sort))) 
25002  629 
> fold (internal_remove_constraint local_sort) operations 
24914
95cda5dd58d5
added proper subclass concept; improved class target
haftmann
parents:
24901
diff
changeset

630 
> Context.proof_map (Syntax.add_term_check 50 "class" 
25002  631 
(sort_term_check sups local_sort) 
632 
#> Syntax.add_term_uncheck 50 "class" 

633 
(sort_term_uncheck sups)) 

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

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

635 

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

636 
fun init class ctxt = 
24914
95cda5dd58d5
added proper subclass concept; improved class target
haftmann
parents:
24901
diff
changeset

637 
init_class_ctxt [class] 
95cda5dd58d5
added proper subclass concept; improved class target
haftmann
parents:
24901
diff
changeset

638 
((#local_sort o the_class_data (ProofContext.theory_of ctxt)) class) ctxt; 
95cda5dd58d5
added proper subclass concept; improved class target
haftmann
parents:
24901
diff
changeset

639 

24748  640 

24589  641 
(* class definition *) 
24218  642 

643 
local 

644 

24748  645 
fun gen_class_spec prep_class prep_expr process_expr thy raw_supclasses raw_includes_elems = 
24218  646 
let 
24748  647 
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

648 
val (sups, local_sort) = sups_local_sort thy supclasses; 
24748  649 
val supsort = Sign.minimize_sort thy supclasses; 
650 
val suplocales = map (Locale.Locale o #locale o the_class_data thy) sups; 

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

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

653 
val supexpr = Locale.Merge suplocales; 

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

25002  655 
val supconsts = AList.make (the o AList.lookup (op =) (these_params thy sups)) 
24748  656 
(map fst supparams); 
657 
val mergeexpr = Locale.Merge (suplocales @ includes); 

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

24847  659 
(fn TFree (_, sort) => TFree (Name.aT, sort)) supparams); 
24748  660 
in 
661 
ProofContext.init thy 

662 
> Locale.cert_expr supexpr [constrain] 

663 
> snd 

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

664 
> init_class_ctxt sups local_sort 
24748  665 
> process_expr Locale.empty raw_elems 
666 
> fst 

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

670 

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

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

673 

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

674 
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

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

676 
val superclasses = map (Sign.certify_class thy) raw_superclasses; 
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset

677 
val consts = (map o apfst o apsnd) (Sign.certify_typ thy) raw_consts; 
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset

678 
fun add_const ((c, ty), syn) = Sign.declare_const [] (c, ty, syn) #>> Term.dest_Const; 
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset

679 
fun mk_axioms cs thy = 
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset

680 
raw_dep_axioms thy cs 
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset

681 
> (map o apsnd o map) (Sign.cert_prop thy) 
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset

682 
> rpair thy; 
25002  683 
fun constrain_typs class = (map o apsnd o Term.map_type_tfree) 
684 
(fn (v, _) => TFree (v, [class])) 

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

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

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

687 
> Sign.add_path (Logic.const_of_class name) 
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset

688 
> fold_map add_const consts 
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset

689 
> Sign.restore_naming thy 
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset

690 
> (fn cs => mk_axioms cs 
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset

691 
#> (fn axioms_prop => AxClass.define_class (name, superclasses) 
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset

692 
(map fst cs @ other_consts) axioms_prop 
25002  693 
#> (fn class => `(fn _ => constrain_typs class cs) 
694 
#> (fn cs' => `(fn thy => AxClass.get_info thy class) 

695 
#> (fn {axioms, ...} => fold (Sign.add_const_constraint o apsnd SOME) cs' 

696 
#> pair (class, (cs', axioms))))))) 

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

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

698 

25002  699 
fun gen_class prep_spec prep_param bname 
24748  700 
raw_supclasses raw_includes_elems raw_other_consts thy = 
701 
let 

24836  702 
val (((sups, supconsts), (supsort, local_sort, mergeexpr)), elems) = 
24748  703 
prep_spec thy raw_supclasses raw_includes_elems; 
24968
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset

704 
val other_consts = map (tap (Sign.the_const_type thy) o prep_param thy) raw_other_consts; 
24589  705 
fun mk_instT class = Symtab.empty 
24847  706 
> Symtab.update (Name.aT, TFree (Name.aT, [class])); 
24589  707 
fun mk_inst class param_names cs = 
708 
Symtab.empty 

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

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

24218  711 
fun extract_params thy name_locale = 
712 
let 

713 
val params = Locale.parameters_of thy name_locale; 

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

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

717 
^ Sign.string_of_sort thy supsort); 

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

719 
(map fst params, params 
24847  720 
> (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

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

723 
> snd) 
24218  724 
end; 
725 
fun extract_assumes name_locale params thy cs = 

726 
let 

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

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

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

730 
 subst t = t; 

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

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

24589  733 
(map o map_aterms) subst ts); 
24218  734 
in 
735 
Locale.global_asms_of thy name_locale 

736 
> map prep_asm 

737 
end; 

738 
fun note_intro name_axclass class_intro = 

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

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

741 
#> snd 

742 
in 

743 
thy 

24748  744 
> Locale.add_locale_i (SOME "") bname mergeexpr elems 
24218  745 
> (fn name_locale => ProofContext.theory_result ( 
746 
`(fn thy => extract_params thy name_locale) 

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

747 
#> (fn (globals, params) => 
24968
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset

748 
define_class_params (bname, supsort) params 
24589  749 
(extract_assumes name_locale params) other_consts 
750 
#> (fn (name_axclass, (consts, axioms)) => 

24218  751 
`(fn thy => class_intro thy name_locale name_axclass sups) 
752 
#> (fn class_intro => 

753 
add_class_data ((name_axclass, sups), 

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

754 
(name_locale, map fst params ~~ consts, local_sort, 
24657  755 
(mk_instT name_axclass, mk_inst name_axclass (map fst globals) 
25002  756 
(map snd supconsts @ consts)), class_intro)) 
24218  757 
#> note_intro name_axclass class_intro 
24589  758 
#> class_interpretation name_axclass axioms [] 
24218  759 
#> pair name_axclass 
760 
))))) 

761 
end; 

762 

763 
in 

764 

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

765 
val class_cmd = gen_class read_class_spec ((#1 o Term.dest_Const) oo Sign.read_const); 
24748  766 
val class = gen_class check_class_spec (K I); 
24218  767 

768 
end; (*local*) 

769 

770 

24589  771 
(* definition in class target *) 
24218  772 

773 
fun export_fixes thy class = 

774 
let 

25002  775 
val cs = these_params thy [class]; 
776 
fun subst_aterm (t as Free (v, ty)) = (case AList.lookup (op =) cs v 

24218  777 
of SOME (c, _) => Const (c, ty) 
778 
 NONE => t) 

779 
 subst_aterm t = t; 

24657  780 
in Term.map_aterms subst_aterm end; 
24218  781 

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

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

783 
let 
25002  784 
val ty = Logic.unvarifyT (Sign.the_const_constraint thy c); 
24914
95cda5dd58d5
added proper subclass concept; improved class target
haftmann
parents:
24901
diff
changeset

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

786 
val typidx = find_index (fn TFree (w, _) => Name.aT = w  _ => false) typargs; 
25002  787 
in (c, (rhs, (ty, typidx))) end; 
24901
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

788 

24218  789 
fun add_const_in_class class ((c, rhs), syn) thy = 
790 
let 

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

24657  792 
fun mk_name c = 
24218  793 
let 
794 
val n1 = Sign.full_name thy c; 

795 
val n2 = NameSpace.qualifier n1; 

796 
val n3 = NameSpace.base n1; 

24657  797 
in NameSpace.implode [n2, prfx, n3] end; 
24748  798 
val rhs' = export_fixes thy class rhs; 
24657  799 
val subst_typ = Term.map_type_tfree (fn var as (w, sort) => 
25002  800 
if w = Name.aT then TFree (w, [class]) else TFree var); 
24218  801 
val ty' = Term.fastype_of rhs'; 
24657  802 
val ty'' = subst_typ ty'; 
803 
val c' = mk_name c; 

804 
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

805 
val (syn', _) = fork_mixfix true (SOME class) syn; 
24657  806 
fun interpret def thy = 
24218  807 
let 
24589  808 
val def' = symmetric def; 
25002  809 
val def_eq = (map_types Logic.unvarifyT o Thm.prop_of) def'; 
24218  810 
in 
24657  811 
thy 
812 
> class_interpretation class [def'] [def_eq] 

25002  813 
> Sign.add_const_constraint (c', SOME ty'') 
814 
> `(fn thy => mk_operation_entry thy (c', rhs)) 

815 
> (fn entry => register_operation class (entry, SOME def')) 

24218  816 
end; 
817 
in 

818 
thy 

819 
> Sign.add_path prfx 

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

820 
> Sign.declare_const [] (c, ty', syn') > snd 
24218  821 
> Sign.parent_path 
822 
> Sign.sticky_prefix prfx 

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

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

825 
> Sign.restore_naming thy 

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

826 
> pair c' 
24218  827 
end; 
828 

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

829 

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

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

831 

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

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

834 
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

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

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

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

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

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

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

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

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

843 
val ty' = fastype_of rhs'; 
25002  844 
val entry = mk_operation_entry thy (c', rhs); 
24836  845 
in 
846 
thy 

24949  847 
> Sign.notation true prmode [(Const (c', ty'), syn)] 
25002  848 
> register_operation class (entry, NONE) 
24914
95cda5dd58d5
added proper subclass concept; improved class target
haftmann
parents:
24901
diff
changeset

849 
> pair c' 
24836  850 
end; 
851 

24218  852 
end; 