author  haftmann 
Sat, 29 Sep 2007 08:58:51 +0200  
changeset 24748  ee0a0eb6b738 
parent 24731  c25aa6ae64ec 
child 24766  d0de4e48b526 
permissions  rwrr 
24218  1 
(* Title: Pure/Isar/class.ML 
2 
ID: $Id$ 

3 
Author: Florian Haftmann, TU Muenchen 

4 

5 
Type classes derived from primitive axclasses and locales. 

6 
*) 

7 

8 
signature CLASS = 

9 
sig 

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

11 

12 
val axclass_cmd: bstring * xstring list 

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

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

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

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

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

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

25 
val intro_classes_tac: thm list > tactic 

26 
val default_intro_classes_tac: thm list > tactic 

27 
val class_of_locale: theory > string > class option 

24748  28 
val local_syntax: theory > class > bool 
24589  29 
val print_classes: theory > unit 
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

30 

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

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

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

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

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

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

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

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

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

49 
(*experimental*) 

24748  50 
val init_ref: (sort > Proof.context > Proof.context) ref 
51 
val init: sort > Proof.context > Proof.context; 

52 
val init_default: sort > Proof.context > Proof.context; 

53 
val local_param: theory > sort > string > (term * (class * int)) option 

54 
val remove_constraints': sort > theory > (string * typ) list * theory 

55 
val remove_constraints: sort > Proof.context > (string * typ) list * Proof.context 

24218  56 
end; 
57 

58 
structure Class : CLASS = 

59 
struct 

60 

61 
(** auxiliary **) 

62 

63 
fun fork_mixfix is_loc some_class mx = 

64 
let 

65 
val mx' = Syntax.unlocalize_mixfix mx; 

66 
val mx_global = if is_some some_class orelse (is_loc andalso mx = mx') 

67 
then NoSyn else mx'; 

68 
val mx_local = if is_loc then mx else NoSyn; 

69 
in (mx_global, mx_local) end; 

70 

24589  71 
fun prove_interpretation tac prfx_atts expr insts = 
72 
Locale.interpretation_i I prfx_atts expr insts 

73 
#> Proof.global_terminal_proof 

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

75 
#> ProofContext.theory_of; 

76 

77 
fun prove_interpretation_in tac after_qed (name, expr) = 

78 
Locale.interpretation_in_locale 

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

80 
#> Proof.global_terminal_proof 

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

82 
#> ProofContext.theory_of; 

83 

84 
fun OF_LAST thm1 thm2 = 

85 
let 

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

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

88 

89 
fun strip_all_ofclass thy sort = 

90 
let 

91 
val typ = TVar ((AxClass.param_tyvarname, 0), sort); 

92 
fun prem_inclass t = 

93 
case Logic.strip_imp_prems t 

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

95 
 [] => NONE; 

96 
fun strip_ofclass class thm = 

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

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

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

100 
 NONE => thm; 

101 
in strip end; 

102 

24748  103 
fun get_remove_constraint c thy = 
24657  104 
let 
105 
val ty = Sign.the_const_constraint thy c; 

106 
in 

107 
thy 

108 
> Sign.add_const_constraint_i (c, NONE) 

109 
> pair (c, Logic.unvarifyT ty) 

110 
end; 

111 

24589  112 

113 
(** axclass command **) 

114 

24218  115 
fun axclass_cmd (class, raw_superclasses) raw_specs thy = 
116 
let 

117 
val ctxt = ProofContext.init thy; 

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

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

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

122 
raw_specs) 

24218  123 
> snd 
124 
> (map o map) fst; 

24589  125 
in 
126 
AxClass.define_class (class, superclasses) [] 

127 
(name_atts ~~ axiomss) thy 

128 
end; 

24218  129 

130 
local 

131 

132 
fun gen_instance mk_prop add_thm after_qed insts thy = 

133 
let 

134 
fun after_qed' results = 

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

136 
in 

137 
thy 

138 
> ProofContext.init 

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

24218  141 
end; 
142 

143 
in 

144 

24589  145 
val instance_arity = 
24218  146 
gen_instance (Logic.mk_arities oo Sign.cert_arity) AxClass.add_arity; 
24589  147 
val classrel = 
24218  148 
gen_instance (single oo (Logic.mk_classrel oo AxClass.cert_classrel)) 
149 
AxClass.add_classrel I o single; 

24589  150 
val classrel_cmd = 
151 
gen_instance (single oo (Logic.mk_classrel oo AxClass.read_classrel)) 

152 
AxClass.add_classrel I o single; 

24218  153 

154 
end; (*local*) 

155 

156 

24589  157 
(** explicit constants for overloaded definitions **) 
24304  158 

159 
structure InstData = TheoryDataFun 

160 
( 

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

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

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

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

164 
val empty = (Symtab.empty, Symtab.empty); 
24304  165 
val copy = I; 
166 
val extend = I; 

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

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

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

169 
Symtab.merge (K true) (tabb1, tabb2)); 
24304  170 
); 
171 

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

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

175 
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

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

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

24304  180 

181 
fun inst_const thy (c, tyco) = 

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

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

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

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

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

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

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

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

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

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

192 

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

193 
val param_const = Symtab.lookup o snd o InstData.get; 
24304  194 

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

196 
let 

197 
val tyco_base = NameSpace.base tyco; 

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

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

200 
in 

201 
thy 

202 
> Sign.sticky_prefix name_inst 

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

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

206 
> Sign.restore_naming thy 

24304  207 
end; 
208 

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

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

210 
if case Symtab.lookup (fst (InstData.get thy)) c 
24304  211 
of NONE => true 
212 
 SOME tab => is_none (Symtab.lookup tab tyco) 

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

214 
else thy; 

215 

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

217 
let 

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

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

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

24701  224 
*) add_inst' _ t = add_inst_def (class, tyco) (c, ty); 
24304  225 
in 
226 
thy 

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

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

229 
end; 

230 

231 

24589  232 
(** instances with implicit parameter handling **) 
24218  233 

234 
local 

235 

24707  236 
fun gen_read_def thy prep_att parse_prop ((raw_name, raw_atts), raw_t) = 
24218  237 
let 
24707  238 
val ctxt = ProofContext.init thy; 
239 
val t = parse_prop ctxt raw_t > Syntax.check_prop ctxt; 

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

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

243 
val name = case raw_name 

244 
of "" => NONE 

245 
 _ => SOME raw_name; 

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

247 

24707  248 
fun read_def_cmd thy = gen_read_def thy Attrib.intern_src Syntax.parse_prop; 
24218  249 
fun read_def thy = gen_read_def thy (K I) (K I); 
250 

24589  251 
fun gen_instance prep_arity read_def do_proof raw_arities raw_defs after_qed theory = 
24218  252 
let 
253 
val arities = map (prep_arity theory) raw_arities; 

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

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

256 
of [] => () 

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

258 
^ (commas o map quote) dupl_tycos); 

259 
fun get_consts_class tyco ty class = 

260 
let 

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

262 
val subst_ty = map_type_tfree (K ty); 

263 
in 

24304  264 
map (fn (c, ty) => (c, ((class, tyco), subst_ty ty))) cs 
24218  265 
end; 
266 
fun get_consts_sort (tyco, asorts, sort) = 

267 
let 

24589  268 
val ty = Type (tyco, map (fn (v, sort) => TVar ((v, 0), sort)) 
269 
(Name.names Name.context "'a" asorts)) 

24731  270 
in maps (get_consts_class tyco ty) (Sign.complete_sort theory sort) end; 
24218  271 
val cs = maps get_consts_sort arities; 
272 
fun mk_typnorm thy (ty, ty_sc) = 

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

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

275 
 NONE => NONE; 

276 
fun read_defs defs cs thy_read = 

277 
let 

278 
fun read raw_def cs = 

279 
let 

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

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

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

285 
val name = case name_opt 

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

287 
 SOME name => name; 

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

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

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

291 
(Sign.string_of_typ thy_read) ty)) 

292 
 SOME norm => map_types norm t 

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

294 
in fold_map read defs cs end; 

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

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

299 
#> after_qed defs; 
24218  300 
in 
301 
theory 

24748  302 
> fold_map get_remove_constraint (map fst cs > distinct (op =)) 
24304  303 
>> fold_map add_def defs 
304 
> 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

305 
> (fn (cs, defs) => do_proof (after_qed' cs defs) arities defs) 
24218  306 
end; 
307 

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

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

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

311 
#> pair defs; 
24218  312 

313 
in 

314 

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

317 
val instance_cmd = gen_instance Sign.read_arity read_def_cmd 

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

319 
fun prove_instance tac arities defs = 

320 
gen_instance Sign.cert_arity read_def 

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

24218  322 

323 
end; (*local*) 

324 

325 

326 

24589  327 
(** class data **) 
24218  328 

329 
datatype class_data = ClassData of { 

330 
locale: string, 

331 
consts: (string * string) list 

24657  332 
(*locale parameter ~> theory constant name*), 
24748  333 
local_sort: sort, 
24589  334 
inst: typ Symtab.table * term Symtab.table 
335 
(*canonical interpretation*), 

24657  336 
intro: thm, 
24748  337 
local_syntax: bool, 
24657  338 
defs: thm list, 
339 
localized: (string * (term * (class * int))) list 

340 
(*theory constant name ~> (locale parameter, (class, instantiaton index of class typ))*) 

341 
}; 

24218  342 

24657  343 
fun rep_class_data (ClassData d) = d; 
24748  344 
fun mk_class_data ((locale, consts, local_sort, inst, intro, local_syntax), (defs, localized)) = 
345 
ClassData { locale = locale, consts = consts, local_sort = local_sort, inst = inst, intro = intro, 

346 
local_syntax = local_syntax, defs = defs, localized = localized }; 

347 
fun map_class_data f (ClassData { locale, consts, local_sort, inst, intro, local_syntax, defs, localized }) = 

348 
mk_class_data (f ((locale, consts, local_sort, inst, intro, local_syntax), (defs, localized))) 

349 
fun merge_class_data _ (ClassData { locale = locale, consts = consts, local_sort = local_sort, inst = inst, 

350 
intro = intro, local_syntax = local_syntax, defs = defs1, localized = localized1 }, 

351 
ClassData { locale = _, consts = _, local_sort = _, inst = _, intro = _, local_syntax = _, 

24657  352 
defs = defs2, localized = localized2 }) = 
24748  353 
mk_class_data ((locale, consts, local_sort, inst, intro, local_syntax), 
24657  354 
(Thm.merge_thms (defs1, defs2), AList.merge (op =) (K true) (localized1, localized2))); 
24218  355 

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

357 

358 
structure ClassData = TheoryDataFun 

359 
( 

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

24218  362 
val empty = (Graph.empty, Symtab.empty); 
363 
val copy = I; 

364 
val extend = I; 

24657  365 
fun merge _ = merge_pair (Graph.join merge_class_data) (Symtab.merge (K true)); 
24218  366 
); 
367 

368 

369 
(* queries *) 

370 

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

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

377 
 SOME data => data; 

24218  378 

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

380 

24435  381 
fun params_of_sort thy = 
24218  382 
let 
383 
fun params class = 

384 
let 

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

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

389 
end; 

390 
in maps params o ancestry thy end; 

391 

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

394 
fun these_intros thy = 

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

24748  398 
fun these_localized thy = 
399 
maps (#localized o the_class_data thy) o ancestry thy; 

24657  400 

401 
fun local_param thy = AList.lookup (op =) o these_localized thy; 

402 

24748  403 
fun local_syntax thy = #local_syntax o the_class_data thy 
404 

24218  405 
fun print_classes thy = 
406 
let 

407 
val algebra = Sign.classes_of thy; 

408 
val arities = 

409 
Symtab.empty 

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

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

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

413 
val the_arities = these o Symtab.lookup arities; 

414 
fun mk_arity class tyco = 

415 
let 

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

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

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

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

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

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

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

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

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

428 
Pretty.str "instances:", 

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

430 
] 

431 
] 

432 
in 

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

24218  435 
end; 
436 

437 

438 
(* updaters *) 

439 

24748  440 
fun add_class_data ((class, superclasses), (locale, consts, local_sort, inst, intro, local_syntax)) = 
24218  441 
ClassData.map (fn (gr, tab) => ( 
442 
gr 

24748  443 
> Graph.new_node (class, mk_class_data ((locale, (map o apfst) fst consts, local_sort, inst, 
444 
intro, local_syntax), ([], map (apsnd (rpair (class, 0) o Free) o swap) consts))) 

24218  445 
> fold (curry Graph.add_edge class) superclasses, 
446 
tab 

447 
> Symtab.update (locale, class) 

448 
)); 

449 

24657  450 
fun add_class_const_def (class, (entry, def)) = 
451 
(ClassData.map o apfst o Graph.map_node class o map_class_data o apsnd) 

452 
(fn (defs, localized) => (def :: defs, (apsnd o apsnd) (pair class) entry :: localized)); 

24218  453 

24589  454 

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

456 

457 
fun class_intro thy locale class sups = 

458 
let 

459 
fun class_elim class = 

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

461 
of [thm] => SOME thm 

462 
 [] => NONE; 

463 
val pred_intro = case Locale.intros thy locale 

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

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

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

467 
 _ => NONE; 

468 
val pred_intro' = pred_intro 

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

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

471 
val raw_intro = case pred_intro' 

472 
of SOME pred_intro => class_intro > OF_LAST pred_intro 

473 
 NONE => class_intro; 

474 
val sort = Sign.super_classes thy class; 

475 
val typ = TVar ((AxClass.param_tyvarname, 0), sort); 

476 
val defs = these_defs thy sups; 

477 
in 

478 
raw_intro 

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

480 
> strip_all_ofclass thy sort 

481 
> Thm.strip_shyps 

482 
> MetaSimplifier.rewrite_rule defs 

483 
> Drule.unconstrainTs 

484 
end; 

485 

486 
fun class_interpretation class facts defs thy = 

487 
let 

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

491 
in 

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

493 
(inst, defs) thy 

494 
end; 

495 

496 
fun interpretation_in_rule thy (class1, class2) = 

497 
let 

498 
fun mk_axioms class = 

499 
let 

24657  500 
val { locale, inst = (_, insttab), ... } = the_class_data thy class; 
24589  501 
in 
502 
Locale.global_asms_of thy locale 

503 
> maps snd 

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

505 
> (map o map_types o map_atyps) (fn TFree _ => TFree ("'a", [class1])  T => T) 

506 
> map (ObjectLogic.ensure_propT thy) 

507 
end; 

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

509 
in 

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

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

512 
end; 

24218  513 

514 
fun intro_classes_tac facts st = 

515 
let 

516 
val thy = Thm.theory_of_thm st; 

517 
val classes = Sign.all_classes thy; 

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

519 
val class_intros = these_intros thy; 

520 
fun add_axclass_intro class = 

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

522 
val axclass_intros = fold add_axclass_intro classes []; 

523 
in 

524 
st 

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

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

527 
THEN Tactic.distinct_subgoals_tac) 

528 
end; 

529 

530 
fun default_intro_classes_tac [] = intro_classes_tac [] 

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

532 

533 
fun default_tac rules ctxt facts = 

534 
HEADGOAL (Method.some_rule_tac rules ctxt facts) ORELSE 

535 
default_intro_classes_tac facts; 

536 

537 
val _ = Context.add_setup (Method.add_methods 

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

539 
"backchain introduction rules of classes"), 

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

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

542 

543 

24589  544 
(** classes and class target **) 
24218  545 

24748  546 
(* class context initialization *) 
547 

548 
(*experimental*) 

549 
fun get_remove_constraint_ctxt c ctxt = 

550 
let 

551 
val ty = ProofContext.the_const_constraint ctxt c; 

552 
in 

553 
ctxt 

554 
> ProofContext.add_const_constraint (c, NONE) 

555 
> pair (c, ty) 

556 
end; 

557 

558 
fun remove_constraints' class thy = 

559 
thy > fold_map (get_remove_constraint o fst) (these_localized thy class); 

560 

561 
fun remove_constraints class ctxt = 

562 
ctxt > fold_map (get_remove_constraint_ctxt o fst) (these_localized (ProofContext.theory_of ctxt) class); 

563 

564 
fun default_typ ctxt constraints c = 

565 
case AList.lookup (op =) constraints c 

566 
of SOME ty => SOME ty 

567 
 NONE => try (Consts.the_constraint (ProofContext.consts_of ctxt)) c; 

568 

569 
fun infer_constraints ctxt constraints ts = 

570 
TypeInfer.infer_types (ProofContext.pp ctxt) (Sign.tsig_of (ProofContext.theory_of ctxt)) 

571 
(Syntax.check_typs ctxt) 

572 
(default_typ ctxt constraints) (K NONE) 

573 
(Variable.names_of ctxt) true (map (rpair dummyT) ts) 

574 
> #1 > map #1 

575 
handle TYPE (msg, _, _) => error msg 

576 

577 
fun subst_typ local_sort = 

578 
map_atyps (fn (t as TFree (v, _)) => if v = AxClass.param_tyvarname 

579 
then TFree (v, local_sort) 

580 
else t 

581 
 t => t); 

582 

583 
fun sort_typ_check thy sort = 

584 
let 

585 
val local_sort = (#local_sort o the_class_data thy) (hd sort); 

586 
in 

587 
pair o map (subst_typ local_sort) 

588 
end; 

589 

590 
fun sort_term_check thy sort constraints = 

591 
let 

592 
val algebra = Sign.classes_of thy; 

593 
val local_sort = (#local_sort o the_class_data thy) (hd sort); 

594 
val v = AxClass.param_tyvarname; 

595 
val local_param = local_param thy sort; 

596 
(*FIXME efficiency*) 

597 
fun class_arg c idx ty = 

598 
let 

599 
val typargs = Sign.const_typargs thy (c, ty); 

600 
fun classtyp (TFree (w, _)) = w = v 

601 
 classtyp t = false; 

602 
in classtyp (nth typargs idx) end; 

603 
fun subst (t as Const (c, ty)) = (case local_param c 

604 
of NONE => t 

605 
 SOME (t', (_, idx)) => if class_arg c idx ty 

606 
then t' else t) 

607 
 subst t = t; 

608 
in fn ts => fn ctxt => 

609 
((map (map_aterms subst) #> infer_constraints ctxt constraints) ts, ctxt) 

610 
end; 

611 

612 
fun init_default sort ctxt = 

613 
let 

614 
val thy = ProofContext.theory_of ctxt; 

615 
val typ_check = sort_typ_check thy sort; 

616 
val term_check = sort_term_check thy sort; 

617 
in 

618 
ctxt 

619 
> remove_constraints sort 

620 
> Variable.declare_term (Logic.mk_type (TFree (AxClass.param_tyvarname, sort))) 

621 
> Context.proof_map (Syntax.add_typ_check typ_check) 

622 
> (fn constraints => 

623 
Context.proof_map (Syntax.add_term_check (term_check constraints))) 

624 
end; 

625 

626 
val init_ref = ref (K I : sort > Proof.context > Proof.context); 

627 
fun init class = ! init_ref class; 

628 

629 

24589  630 
(* class definition *) 
24218  631 

632 
local 

633 

24707  634 
fun read_param thy raw_t = (* FIXME ProofContext.read_const (!?) *) 
24218  635 
let 
24707  636 
val t = Syntax.read_term_global thy raw_t 
24218  637 
in case try dest_Const t 
638 
of SOME (c, _) => c 

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

640 
end; 

641 

24748  642 
fun gen_class_spec prep_class prep_expr process_expr thy raw_supclasses raw_includes_elems = 
24218  643 
let 
24748  644 
val supclasses = map (prep_class thy) raw_supclasses; 
645 
val sups = filter (is_some o lookup_class_data thy) supclasses 

646 
> Sign.minimize_sort thy; 

647 
val supsort = Sign.minimize_sort thy supclasses; 

648 
val suplocales = map (Locale.Locale o #locale o the_class_data thy) sups; 

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

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

651 
val supexpr = Locale.Merge suplocales; 

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

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

654 
(map fst supparams); 

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

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

657 
(fn TFree (_, sort) => TFree (AxClass.param_tyvarname, sort)) supparams); 

658 
in 

659 
ProofContext.init thy 

660 
> Locale.cert_expr supexpr [constrain] 

661 
> snd 

662 
> init supsort 

663 
> process_expr Locale.empty raw_elems 

664 
> fst 

665 
> (fn elems => ((((sups, supconsts), (supsort, mergeexpr)), 

666 
(*FIXME*) if null includes then constrain :: elems else elems))) 

667 
end; 

668 

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

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

671 

672 
fun gen_class prep_spec prep_param local_syntax bname 

673 
raw_supclasses raw_includes_elems raw_other_consts thy = 

674 
let 

675 
val (((sups, supconsts), (supsort, mergeexpr)), elems) = 

676 
prep_spec thy raw_supclasses raw_includes_elems; 

677 
val other_consts = map (prep_param thy) raw_other_consts; 

24589  678 
fun mk_instT class = Symtab.empty 
679 
> Symtab.update (AxClass.param_tyvarname, TFree (AxClass.param_tyvarname, [class])); 

680 
fun mk_inst class param_names cs = 

681 
Symtab.empty 

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

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

24218  684 
fun extract_params thy name_locale = 
685 
let 

686 
val params = Locale.parameters_of thy name_locale; 

24748  687 
val local_sort = case AList.group (op =) ((maps typ_tfrees o map (snd o fst)) params) 
688 
of [(_, local_sort :: _)] => local_sort 

689 
 _ => Sign.defaultS thy 

690 
 vs => error ("exactly one type variable required: " ^ commas (map fst vs)); 

691 
val _ = if Sign.subsort thy (supsort, local_sort) then () else error 

692 
("Sort " ^ Sign.string_of_sort thy local_sort 

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

694 
^ Sign.string_of_sort thy supsort); 

24218  695 
in 
24748  696 
(local_sort, (map fst params, params 
697 
> (map o apfst o apsnd o Term.map_type_tfree) (K (TFree (AxClass.param_tyvarname, local_sort))) 

24218  698 
> (map o apsnd) (fork_mixfix true NONE #> fst) 
699 
> chop (length supconsts) 

700 
> snd)) 

701 
end; 

702 
fun extract_assumes name_locale params thy cs = 

703 
let 

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

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

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

707 
 subst t = t; 

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

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

24589  710 
(map o map_aterms) subst ts); 
24218  711 
in 
712 
Locale.global_asms_of thy name_locale 

713 
> map prep_asm 

714 
end; 

715 
fun note_intro name_axclass class_intro = 

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

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

718 
#> snd 

719 
in 

720 
thy 

24748  721 
> Locale.add_locale_i (SOME "") bname mergeexpr elems 
24218  722 
> (fn name_locale => ProofContext.theory_result ( 
723 
`(fn thy => extract_params thy name_locale) 

24748  724 
#> (fn (local_sort, (globals, params)) => 
24589  725 
AxClass.define_class_params (bname, supsort) params 
726 
(extract_assumes name_locale params) other_consts 

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

24218  728 
`(fn thy => class_intro thy name_locale name_axclass sups) 
729 
#> (fn class_intro => 

730 
add_class_data ((name_axclass, sups), 

24748  731 
(name_locale, map fst params ~~ map fst consts, local_sort, 
24657  732 
(mk_instT name_axclass, mk_inst name_axclass (map fst globals) 
24748  733 
(map snd supconsts @ consts)), class_intro, local_syntax)) 
24218  734 
#> note_intro name_axclass class_intro 
24589  735 
#> class_interpretation name_axclass axioms [] 
24218  736 
#> pair name_axclass 
737 
))))) 

738 
end; 

739 

740 
in 

741 

24748  742 
val class_cmd = gen_class read_class_spec read_param; 
743 
val class = gen_class check_class_spec (K I); 

24218  744 

745 
end; (*local*) 

746 

747 

24589  748 
(* definition in class target *) 
24218  749 

750 
fun export_fixes thy class = 

751 
let 

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

755 
 NONE => t) 

756 
 subst_aterm t = t; 

24657  757 
in Term.map_aterms subst_aterm end; 
24218  758 

759 
fun add_const_in_class class ((c, rhs), syn) thy = 

760 
let 

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

24657  762 
fun mk_name c = 
24218  763 
let 
764 
val n1 = Sign.full_name thy c; 

765 
val n2 = NameSpace.qualifier n1; 

766 
val n3 = NameSpace.base n1; 

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

24748  769 
val rhs' = export_fixes thy class rhs; 
24657  770 
val subst_typ = Term.map_type_tfree (fn var as (w, sort) => 
24748  771 
if w = AxClass.param_tyvarname then TFree (w, constrain_sort sort) else TFree var); 
24218  772 
val ty' = Term.fastype_of rhs'; 
24657  773 
val ty'' = subst_typ ty'; 
774 
val c' = mk_name c; 

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

24218  776 
val (syn', _) = fork_mixfix true NONE syn; 
24657  777 
fun interpret def thy = 
24218  778 
let 
24589  779 
val def' = symmetric def; 
24218  780 
val def_eq = Thm.prop_of def'; 
24657  781 
val typargs = Sign.const_typargs thy (c', fastype_of rhs); 
24748  782 
val typidx = find_index (fn TFree (w, _) => AxClass.param_tyvarname = w  _ => false) typargs; 
24218  783 
in 
24657  784 
thy 
785 
> class_interpretation class [def'] [def_eq] 

786 
> add_class_const_def (class, ((c', (rhs, typidx)), def')) 

24218  787 
end; 
788 
in 

789 
thy 

790 
> Sign.add_path prfx 

791 
> Sign.add_consts_authentic [(c, ty', syn')] 

792 
> Sign.parent_path 

793 
> Sign.sticky_prefix prfx 

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

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

24657  796 
> Sign.add_const_constraint_i (c', SOME ty'') 
24218  797 
> Sign.restore_naming thy 
798 
end; 

799 

24589  800 

801 
(* interpretation in class target *) 

802 

803 
local 

804 

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

806 
let 

807 
val class = prep_class theory raw_class; 

808 
val superclass = prep_class theory raw_superclass; 

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

24589  811 
fun prove_classrel (class, superclass) thy = 
812 
let 

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

816 
let 

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

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

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

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

821 
(TVar ((AxClass.param_tyvarname, 0), [class1])))] []; 

24731  822 
val thm = 
24589  823 
intro 
824 
> OF_LAST (interp OF ax) 

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

826 
in 

827 
thy > AxClass.add_classrel thm 

828 
end; 

829 
in 

830 
thy > fold_rev (curry instance_subclass class) classes 

831 
end; 

832 
in 

833 
theory 

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

835 
end; 

836 

837 
in 

838 

839 
val interpretation_in_class = gen_interpretation_in_class Sign.certify_class 

840 
(Locale.interpretation_in_locale o ProofContext.theory); 

841 
val interpretation_in_class_cmd = gen_interpretation_in_class Sign.read_class 

842 
(Locale.interpretation_in_locale o ProofContext.theory); 

843 
val prove_interpretation_in_class = gen_interpretation_in_class Sign.certify_class 

844 
o prove_interpretation_in; 

845 

846 
end; (*local*) 

847 

24218  848 
end; 