author  haftmann 
Mon, 15 Oct 2007 15:29:43 +0200  
changeset 25038  522abf8a5f87 
parent 25024  0615bb9955dd 
child 25060  17c313217998 
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 

25010  10 
val fork_mixfix: bool > bool > mixfix > mixfix * mixfix 
24218  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; 
25038  22 
val add_const_in_class: string > (string * mixfix) * (string * term) 
23 
> theory > string * theory 

24 
val add_abbrev_in_class: string > Syntax.mode > (string * mixfix) * (string * term) 

25 
> theory > string * theory 

25002  26 
val remove_constraint: class > string > Proof.context > Proof.context 
25038  27 
val is_class: theory > class > bool 
25002  28 
val these_params: theory > sort > (string * (string * typ)) list 
24589  29 
val intro_classes_tac: thm list > tactic 
30 
val default_intro_classes_tac: thm list > tactic 

31 
val print_classes: theory > unit 

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

33 

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

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

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

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

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

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

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

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

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

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

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

52 
structure Class : CLASS = 

53 
struct 

54 

55 
(** auxiliary **) 

56 

25010  57 
fun fork_mixfix is_locale is_class mx = 
24218  58 
let 
59 
val mx' = Syntax.unlocalize_mixfix mx; 

25010  60 
val mx_global = if not is_locale orelse (is_class andalso not (mx = mx')) 
24901
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

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

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

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

69 
#> ProofContext.theory_of; 

70 

25020  71 
fun OF_LAST thm1 thm2 = thm1 RSN (Thm.nprems_of thm2, thm2); 
24589  72 

73 
fun strip_all_ofclass thy sort = 

74 
let 

24847  75 
val typ = TVar ((Name.aT, 0), sort); 
24589  76 
fun prem_inclass t = 
77 
case Logic.strip_imp_prems t 

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

79 
 [] => NONE; 

80 
fun strip_ofclass class thm = 

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

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

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

84 
 NONE => thm; 

85 
in strip end; 

86 

25038  87 
fun get_remove_global_constraint c thy = 
88 
let 

89 
val ty = Sign.the_const_constraint thy c; 

90 
in 

91 
thy 

92 
> Sign.add_const_constraint (c, NONE) 

93 
> pair (c, Logic.unvarifyT ty) 

94 
end; 

95 

24589  96 

97 
(** axclass command **) 

98 

24218  99 
fun axclass_cmd (class, raw_superclasses) raw_specs thy = 
100 
let 

101 
val ctxt = ProofContext.init thy; 

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

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

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

106 
raw_specs) 

24218  107 
> snd 
108 
> (map o map) fst; 

24589  109 
in 
110 
AxClass.define_class (class, superclasses) [] 

111 
(name_atts ~~ axiomss) thy 

112 
end; 

24218  113 

114 
local 

115 

116 
fun gen_instance mk_prop add_thm after_qed insts thy = 

117 
let 

118 
fun after_qed' results = 

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

120 
in 

121 
thy 

122 
> ProofContext.init 

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

24218  125 
end; 
126 

127 
in 

128 

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

24589  134 
val classrel_cmd = 
135 
gen_instance (single oo (Logic.mk_classrel oo AxClass.read_classrel)) 

136 
AxClass.add_classrel I o single; 

24218  137 

138 
end; (*local*) 

139 

140 

24589  141 
(** explicit constants for overloaded definitions **) 
24304  142 

143 
structure InstData = TheoryDataFun 

144 
( 

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

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

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

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

148 
val empty = (Symtab.empty, Symtab.empty); 
24304  149 
val copy = I; 
150 
val extend = I; 

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

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

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

153 
Symtab.merge (K true) (tabb1, tabb2)); 
24304  154 
); 
155 

25020  156 
fun inst_thms thy = (Symtab.fold (Symtab.fold (cons o snd o snd) o snd) o fst) 
24589  157 
(InstData.get thy) []; 
158 
fun add_inst (c, tyco) inst = (InstData.map o apfst 

159 
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

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

25020  162 
fun unoverload thy = MetaSimplifier.rewrite true (inst_thms thy); 
163 
fun overload thy = MetaSimplifier.rewrite true (map Thm.symmetric (inst_thms thy)); 

24304  164 

165 
fun inst_const thy (c, tyco) = 

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

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

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

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

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

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

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

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

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

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

176 

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

177 
val param_const = Symtab.lookup o snd o InstData.get; 
24304  178 

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

180 
let 

25024  181 
val tyco_base = Sign.base_name tyco; 
182 
val name_inst = Sign.base_name class ^ "_" ^ tyco_base ^ "_inst"; 

183 
val c_inst_base = Sign.base_name c ^ "_" ^ tyco_base; 

24304  184 
in 
185 
thy 

186 
> Sign.sticky_prefix name_inst 

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

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

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

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

191 
#> (fn [thm] => add_inst (c, tyco) (c_inst, Thm.symmetric thm))) 
24435  192 
> Sign.restore_naming thy 
24304  193 
end; 
194 

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

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

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

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

200 
else thy; 

201 

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

203 
let 

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

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

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

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

25020  213 
> PureThy.add_defs_i true [((name, prop), map (Attrib.attribute_i thy) atts)] 
24304  214 
> (fn [def] => add_inst' def (args, rhs) #> pair def) 
215 
end; 

216 

217 

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

220 
local 

221 

24707  222 
fun gen_read_def thy prep_att parse_prop ((raw_name, raw_atts), raw_t) = 
24218  223 
let 
24707  224 
val ctxt = ProofContext.init thy; 
225 
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

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

229 
val name = case raw_name 

230 
of "" => NONE 

231 
 _ => SOME raw_name; 

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

233 

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

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

25020  240 
val _ = if null arities then error "At least one arity must be given" else (); 
24218  241 
val _ = case (duplicates (op =) o map #1) arities 
242 
of [] => () 

25020  243 
 dupl_tycos => error ("Type constructors occur more than once in arities: " 
244 
^ commas_quote dupl_tycos); 

24218  245 
fun get_consts_class tyco ty class = 
246 
let 

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

247 
val cs = (these o try (#params o AxClass.get_info theory)) class; 
24218  248 
val subst_ty = map_type_tfree (K ty); 
249 
in 

24304  250 
map (fn (c, ty) => (c, ((class, tyco), subst_ty ty))) cs 
24218  251 
end; 
252 
fun get_consts_sort (tyco, asorts, sort) = 

253 
let 

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

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

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

261 
 NONE => NONE; 

262 
fun read_defs defs cs thy_read = 

263 
let 

264 
fun read raw_def cs = 

265 
let 

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

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

24304  268 
val ((class, tyco), ty') = case AList.lookup (op =) cs c 
25020  269 
of NONE => error ("Illegal definition for constant " ^ quote c) 
24218  270 
 SOME class_ty => class_ty; 
271 
val name = case name_opt 

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

273 
 SOME name => name; 

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

25020  275 
of NONE => error ("Illegal definition for constant " ^ 
24218  276 
quote (c ^ "::" ^ setmp show_sorts true 
277 
(Sign.string_of_typ thy_read) ty)) 

278 
 SOME norm => map_types norm t 

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

280 
in fold_map read defs cs end; 

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

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

285 
#> after_qed defs; 
24218  286 
in 
287 
theory 

25038  288 
> fold_map get_remove_global_constraint (map fst cs > distinct (op =)) 
24304  289 
>> fold_map add_def defs 
290 
> 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

291 
> (fn (cs, defs) => do_proof (after_qed' cs defs) arities defs) 
24218  292 
end; 
293 

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

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

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

297 
#> pair defs; 
24218  298 

299 
in 

300 

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

303 
val instance_cmd = gen_instance Sign.read_arity read_def_cmd 

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

305 
fun prove_instance tac arities defs = 

306 
gen_instance Sign.cert_arity read_def 

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

24218  308 

309 
end; (*local*) 

310 

311 

312 

24589  313 
(** class data **) 
24218  314 

315 
datatype class_data = ClassData of { 

316 
consts: (string * string) list 

24836  317 
(*locale parameter ~> constant name*), 
24748  318 
local_sort: sort, 
25038  319 
inst: (typ option list * term option list) * term Symtab.table 
320 
(*canonical interpretation FIXME*), 

24657  321 
intro: thm, 
322 
defs: thm list, 

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

325 
operations_rev: (string * string) list 

326 
(*locale operation ~> constant name*) 

24657  327 
}; 
24218  328 

24657  329 
fun rep_class_data (ClassData d) = d; 
25038  330 
fun mk_class_data ((consts, local_sort, inst, intro), 
25002  331 
(defs, operations, operations_rev)) = 
25038  332 
ClassData { consts = consts, local_sort = local_sort, inst = inst, 
25002  333 
intro = intro, defs = defs, operations = operations, 
334 
operations_rev = operations_rev }; 

25038  335 
fun map_class_data f (ClassData { consts, local_sort, inst, intro, 
25002  336 
defs, operations, operations_rev }) = 
25038  337 
mk_class_data (f ((consts, local_sort, inst, intro), 
25002  338 
(defs, operations, operations_rev))); 
25038  339 
fun merge_class_data _ (ClassData { consts = consts, 
25002  340 
local_sort = local_sort, inst = inst, intro = intro, 
341 
defs = defs1, operations = operations1, operations_rev = operations_rev1 }, 

25038  342 
ClassData { consts = _, local_sort = _, inst = _, intro = _, 
25002  343 
defs = defs2, operations = operations2, operations_rev = operations_rev2 }) = 
25038  344 
mk_class_data ((consts, local_sort, inst, intro), 
24914
95cda5dd58d5
added proper subclass concept; improved class target
haftmann
parents:
24901
diff
changeset

345 
(Thm.merge_thms (defs1, defs2), 
25002  346 
AList.merge (op =) (K true) (operations1, operations2), 
347 
AList.merge (op =) (K true) (operations_rev1, operations_rev2))); 

24218  348 

349 
structure ClassData = TheoryDataFun 

350 
( 

25038  351 
type T = class_data Graph.T 
352 
val empty = Graph.empty; 

24218  353 
val copy = I; 
354 
val extend = I; 

25038  355 
fun merge _ = Graph.join merge_class_data; 
24218  356 
); 
357 

358 

359 
(* queries *) 

360 

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

24589  363 
fun the_class_data thy class = case lookup_class_data thy class 
25020  364 
of NONE => error ("Undeclared class " ^ quote class) 
24589  365 
 SOME data => data; 
24218  366 

25038  367 
val is_class = is_some oo lookup_class_data; 
368 

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

24218  370 

25002  371 
fun these_params thy = 
24218  372 
let 
373 
fun params class = 

374 
let 

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

375 
val const_typs = (#params o AxClass.get_info thy) class; 
24657  376 
val const_names = (#consts o the_class_data thy) class; 
24218  377 
in 
378 
(map o apsnd) (fn c => (c, (the o AList.lookup (op =) const_typs) c)) const_names 

379 
end; 

380 
in maps params o ancestry thy end; 

381 

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

384 
fun these_intros thy = 

24657  385 
Graph.fold (fn (_, (data, _)) => insert Thm.eq_thm ((#intro o rep_class_data) data)) 
25038  386 
(ClassData.get thy) []; 
24218  387 

24836  388 
fun these_operations thy = 
389 
maps (#operations o the_class_data thy) o ancestry thy; 

24657  390 

25002  391 
fun these_operations_rev thy = 
392 
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

393 

25002  394 
fun local_operation thy = AList.lookup (op =) o these_operations thy; 
395 

396 
fun global_operation thy = AList.lookup (op =) o these_operations_rev 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 

24218  407 
fun print_classes thy = 
408 
let 

24920  409 
val ctxt = ProofContext.init thy; 
410 

24218  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]; 

24920  421 
in Syntax.pretty_arity ctxt (tyco, Ss, [class]) end; 
24218  422 
fun mk_param (c, ty) = Pretty.str (Sign.extern_const thy c ^ " :: " 
24920  423 
^ setmp show_sorts false (Syntax.string_of_typ ctxt o Type.strip_sorts) ty); 
24218  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: ", 

24920  427 
(Syntax.pretty_sort ctxt o Sign.minimize_sort thy o Sign.super_classes thy) class], 
25038  428 
if is_class thy class then (SOME o Pretty.str) ("locale: " ^ class) else NONE, 
24218  429 
((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

430 
o these o Option.map #params o try (AxClass.get_info thy)) class, 
24218  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 

25038  444 
fun add_class_data ((class, superclasses), (cs, local_sort, inst, intro)) thy = 
25002  445 
let 
25038  446 
(*FIXME*) 
447 
val is_empty = null (fold (fn ((_, ty), _) => fold_atyps cons ty) cs []) 

448 
andalso null ((fold o fold_types o fold_atyps) cons 

449 
(maps snd (Locale.global_asms_of thy class)) []); 

450 
(*FIXME*) 

451 
val inst_params = map 

452 
(SOME o the o Symtab.lookup inst o fst o fst) 

453 
(Locale.parameters_of_expr thy (Locale.Locale class)); 

454 
val instT = if is_empty then [] else [SOME (TFree (Name.aT, [class]))]; 

455 
val inst' = ((instT, inst_params), inst); 

25002  456 
val operations = map (fn (v_ty, (c, ty)) => (c, (Free v_ty, (ty, 0)))) cs; 
457 
val cs = (map o pairself) fst cs; 

25038  458 
val add_class = Graph.new_node (class, 
459 
mk_class_data ((cs, local_sort, inst', intro), ([], operations, []))) 

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

25038  462 
ClassData.map add_class thy 
25002  463 
end; 
24218  464 

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

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

24218  470 

24589  471 

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

473 

25024  474 
val class_prefix = Logic.const_of_class o Sign.base_name; 
475 

25038  476 
fun class_intro thy class sups = 
24589  477 
let 
478 
fun class_elim class = 

25020  479 
case (#axioms o AxClass.get_info thy) class 
480 
of [thm] => SOME (Drule.unconstrainTs thm) 

24589  481 
 [] => NONE; 
25038  482 
val pred_intro = case Locale.intros thy class 
24589  483 
of ([ax_intro], [intro]) => intro > OF_LAST ax_intro > SOME 
484 
 ([intro], []) => SOME intro 

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

486 
 _ => NONE; 

487 
val pred_intro' = pred_intro 

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

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

492 
 NONE => class_intro; 

493 
val sort = Sign.super_classes thy class; 

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

497 
raw_intro 

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

499 
> strip_all_ofclass thy sort 

500 
> Thm.strip_shyps 

501 
> MetaSimplifier.rewrite_rule defs 

502 
> Drule.unconstrainTs 

503 
end; 

504 

505 
fun class_interpretation class facts defs thy = 

506 
let 

25038  507 
val params = these_params thy [class]; 
508 
val { inst = ((_, inst), _), ... } = the_class_data thy class; 

509 
(*val _ = tracing ("interpreting with " ^ cat_lines (map (setmp show_sorts true makestring) 

510 
(map_filter I inst)));*) 

25020  511 
val tac = ALLGOALS (ProofContext.fact_tac facts); 
25038  512 
val prfx = class_prefix class; 
24589  513 
in 
25038  514 
thy 
515 
> fold_map (get_remove_global_constraint o fst o snd) params 

516 
> prove_interpretation tac ((false, prfx), []) (Locale.Locale class) (inst, defs) 

517 
> (fn cs => fold (Sign.add_const_constraint o apsnd SOME) cs) 

24589  518 
end; 
24218  519 

520 
fun intro_classes_tac facts st = 

521 
let 

522 
val thy = Thm.theory_of_thm st; 

523 
val classes = Sign.all_classes thy; 

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

525 
val class_intros = these_intros thy; 

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

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

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

529 
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

530 
THEN Tactic.distinct_subgoals_tac) st 
24218  531 
end; 
532 

533 
fun default_intro_classes_tac [] = intro_classes_tac [] 

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

534 
 default_intro_classes_tac _ = no_tac; 
24218  535 

536 
fun default_tac rules ctxt facts = 

537 
HEADGOAL (Method.some_rule_tac rules ctxt facts) ORELSE 

538 
default_intro_classes_tac facts; 

539 

540 
val _ = Context.add_setup (Method.add_methods 

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

542 
"backchain introduction rules of classes"), 

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

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

545 

546 

24589  547 
(** classes and class target **) 
24218  548 

25002  549 
(* class context syntax *) 
24748  550 

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

552 
let 
25002  553 
val consts = ProofContext.consts_of ctxt; 
554 
val typargs = Consts.typargs consts (c, ty); 

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

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

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

558 

559 
fun remove_constraint class c ctxt = 

560 
let 

561 
val thy = ProofContext.theory_of ctxt; 

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

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

563 
in 
25002  564 
internal_remove_constraint 
565 
((#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

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

567 

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

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

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

571 
val local_operation = local_operation thy sups; 
25002  572 
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

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

574 
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

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

576 
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

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

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

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

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

581 
fun add_const (Const (c, ty)) = (case local_operation c 
25002  582 
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

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

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

585 
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

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

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

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

589 
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

590 
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

591 
in (ts', ctxt') end; 
24748  592 

25002  593 
val uncheck = ref false; 
594 

595 
fun sort_term_uncheck sups ts ctxt = 

596 
let 

597 
val thy = ProofContext.theory_of ctxt; 

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

599 
val global_operation = global_operation thy sups; 

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

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

602 
 NONE => t) 

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

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

605 
 NONE => t) 

606 
 globalize t = t; 

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

608 
in (ts', ctxt) end; 

609 

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

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

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

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

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

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

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

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

618 
> Context.proof_map (Syntax.add_term_check 50 "class" 
25002  619 
(sort_term_check sups local_sort) 
620 
#> Syntax.add_term_uncheck 50 "class" 

621 
(sort_term_uncheck sups)) 

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

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

623 

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

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

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

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

627 

24748  628 

24589  629 
(* class definition *) 
24218  630 

631 
local 

632 

24748  633 
fun gen_class_spec prep_class prep_expr process_expr thy raw_supclasses raw_includes_elems = 
24218  634 
let 
24748  635 
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

636 
val (sups, local_sort) = sups_local_sort thy supclasses; 
24748  637 
val supsort = Sign.minimize_sort thy supclasses; 
25038  638 
val suplocales = map Locale.Locale sups; 
24748  639 
val (raw_elems, includes) = fold_rev (fn Locale.Elem e => apfst (cons e) 
640 
 Locale.Expr i => apsnd (cons (prep_expr thy i))) raw_includes_elems ([], []); 

641 
val supexpr = Locale.Merge suplocales; 

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

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

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

24847  647 
(fn TFree (_, sort) => TFree (Name.aT, sort)) supparams); 
24748  648 
in 
649 
ProofContext.init thy 

650 
> Locale.cert_expr supexpr [constrain] 

651 
> snd 

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

652 
> init_class_ctxt sups local_sort 
24748  653 
> process_expr Locale.empty raw_elems 
654 
> fst 

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

658 

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

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

661 

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

662 
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

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

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

665 
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

666 
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

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

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

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

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

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

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

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

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

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

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

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

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

680 
(map fst cs @ other_consts) axioms_prop 
25002  681 
#> (fn class => `(fn _ => constrain_typs class cs) 
682 
#> (fn cs' => `(fn thy => AxClass.get_info thy class) 

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

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

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

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

686 

25002  687 
fun gen_class prep_spec prep_param bname 
24748  688 
raw_supclasses raw_includes_elems raw_other_consts thy = 
689 
let 

25038  690 
val class = Sign.full_name thy bname; 
24836  691 
val (((sups, supconsts), (supsort, local_sort, mergeexpr)), elems) = 
24748  692 
prep_spec thy raw_supclasses raw_includes_elems; 
24968
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset

693 
val other_consts = map (tap (Sign.the_const_type thy) o prep_param thy) raw_other_consts; 
24589  694 
fun mk_inst class param_names cs = 
695 
Symtab.empty 

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

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

25038  698 
fun extract_params thy = 
24218  699 
let 
25038  700 
val params = Locale.parameters_of thy class; 
24748  701 
val _ = if Sign.subsort thy (supsort, local_sort) then () else error 
702 
("Sort " ^ Sign.string_of_sort thy local_sort 

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

704 
^ Sign.string_of_sort thy supsort); 

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

706 
(map fst params, params 
24847  707 
> (map o apfst o apsnd o Term.map_type_tfree) (K (TFree (Name.aT, local_sort))) 
25010  708 
> (map o apsnd) (fork_mixfix true true #> fst) 
24218  709 
> chop (length supconsts) 
24901
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

710 
> snd) 
24218  711 
end; 
25038  712 
fun extract_assumes params thy cs = 
24218  713 
let 
714 
val consts = supconsts @ (map (fst o fst) params ~~ cs); 

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

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

717 
 subst t = t; 

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

25024  719 
((Sign.base_name name, map (Attrib.attribute_i thy) atts), 
24589  720 
(map o map_aterms) subst ts); 
24218  721 
in 
25038  722 
Locale.global_asms_of thy class 
24218  723 
> map prep_asm 
724 
end; 

25038  725 
fun note_intro class_intro = 
726 
PureThy.note_thmss_qualified "" (class_prefix class) 

24218  727 
[(("intro", []), [([class_intro], [])])] 
728 
#> snd 

729 
in 

730 
thy 

24748  731 
> Locale.add_locale_i (SOME "") bname mergeexpr elems 
25038  732 
> snd 
733 
> ProofContext.theory (`extract_params 

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

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

735 
define_class_params (bname, supsort) params 
25038  736 
(extract_assumes params) other_consts 
737 
#> (fn (_, (consts, axioms)) => 

738 
`(fn thy => class_intro thy class sups) 

24218  739 
#> (fn class_intro => 
25038  740 
add_class_data ((class, sups), 
741 
(map fst params ~~ consts, local_sort, 

742 
mk_inst class (map fst globals) (map snd supconsts @ consts), 

743 
class_intro)) 

744 
#> note_intro class_intro 

745 
#> class_interpretation class axioms [] 

746 
)))) 

747 
> pair class 

24218  748 
end; 
749 

750 
in 

751 

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

752 
val class_cmd = gen_class read_class_spec ((#1 o Term.dest_Const) oo Sign.read_const); 
24748  753 
val class = gen_class check_class_spec (K I); 
24218  754 

755 
end; (*local*) 

756 

757 

24589  758 
(* definition in class target *) 
24218  759 

760 
fun export_fixes thy class = 

761 
let 

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

24218  764 
of SOME (c, _) => Const (c, ty) 
765 
 NONE => t) 

766 
 subst_aterm t = t; 

24657  767 
in Term.map_aterms subst_aterm end; 
24218  768 

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

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

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

772 
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

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

775 

25038  776 
fun add_const_in_class class ((c, mx), (c_loc, rhs)) thy = 
24218  777 
let 
25038  778 
val _ = tracing c_loc; 
25024  779 
val prfx = class_prefix class; 
780 
val thy' = thy > Sign.add_path prfx; 

781 

782 
val rhs' = export_fixes thy' class rhs; 

24657  783 
val subst_typ = Term.map_type_tfree (fn var as (w, sort) => 
25002  784 
if w = Name.aT then TFree (w, [class]) else TFree var); 
24218  785 
val ty' = Term.fastype_of rhs'; 
24657  786 
val ty'' = subst_typ ty'; 
25024  787 
val c' = Sign.full_name thy' c; 
25038  788 
val c'' = NameSpace.full (Sign.naming_of thy' > NameSpace.add_path prfx) c; 
24657  789 
val def = (c, Logic.mk_equals (Const (c', ty'), rhs')); 
25024  790 
val (mx', _) = fork_mixfix true true mx; 
24657  791 
fun interpret def thy = 
24218  792 
let 
24589  793 
val def' = symmetric def; 
25002  794 
val def_eq = (map_types Logic.unvarifyT o Thm.prop_of) def'; 
24218  795 
in 
24657  796 
thy 
797 
> class_interpretation class [def'] [def_eq] 

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

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

24218  801 
end; 
802 
in 

25024  803 
thy' 
25038  804 
> Sign.hide_consts_i false [c''] 
25024  805 
> Sign.declare_const [] (c, ty', mx') > snd 
24218  806 
> Sign.parent_path 
807 
> Sign.sticky_prefix prfx 

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

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

810 
> Sign.restore_naming thy 

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

811 
> pair c' 
24218  812 
end; 
813 

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

814 

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

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

816 

25038  817 
fun add_abbrev_in_class class prmode ((c, mx), (c_loc, rhs)) thy = 
24836  818 
let 
25038  819 
val _ = tracing c_loc; 
25024  820 
val prfx = class_prefix class; 
25038  821 
val naming = Sign.naming_of thy > NameSpace.add_path prfx > NameSpace.add_path prfx; 
822 
(*FIXME*) 

25024  823 
val c' = NameSpace.full naming c; 
24901
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

824 
val rhs' = export_fixes thy class rhs; 
25020  825 
val ty' = Term.fastype_of rhs'; 
25002  826 
val entry = mk_operation_entry thy (c', rhs); 
24836  827 
in 
828 
thy 

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

831 
> pair c' 
24836  832 
end; 
833 

24218  834 
end; 