author  haftmann 
Mon, 17 Dec 2007 22:40:13 +0100  
changeset 25683  d9fefc4859be 
parent 25668  a9ebfc170fbc 
child 25711  91cee0cefaf7 
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 

25462  10 
(*classes*) 
25002  11 
val class: bstring > class list > Element.context_i Locale.element list 
24218  12 
> string list > theory > string * Proof.context 
25002  13 
val class_cmd: bstring > xstring list > Element.context Locale.element list 
24589  14 
> xstring list > theory > string * Proof.context 
25485  15 

25311  16 
val init: class > theory > Proof.context 
25603  17 
val declare: string > Markup.property list 
25104  18 
> (string * mixfix) * term > theory > theory 
25603  19 
val abbrev: string > Syntax.mode > Markup.property list 
25104  20 
> (string * mixfix) * term > theory > theory 
25083  21 
val refresh_syntax: class > Proof.context > Proof.context 
25485  22 

24589  23 
val intro_classes_tac: thm list > tactic 
24 
val default_intro_classes_tac: thm list > tactic 

25618  25 
val prove_subclass: class * class > thm > theory > theory 
25485  26 

27 
val class_prefix: string > string 

28 
val is_class: theory > class > bool 

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

24589  30 
val print_classes: theory > unit 
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24304
diff
changeset

31 

25462  32 
(*instances*) 
25536  33 
val init_instantiation: string list * sort list * sort > theory > local_theory 
25485  34 
val instantiation_instance: (local_theory > local_theory) > local_theory > Proof.state 
35 
val prove_instantiation_instance: (Proof.context > tactic) > local_theory > local_theory 

36 
val conclude_instantiation: local_theory > local_theory 

25603  37 
val instantiation_param: local_theory > string > string option 
25485  38 
val confirm_declaration: string > local_theory > local_theory 
25603  39 
val pretty_instantiation: local_theory > Pretty.T 
25485  40 

25462  41 
(*old axclass layer*) 
42 
val axclass_cmd: bstring * xstring list 

43 
> ((bstring * Attrib.src list) * string list) list 

44 
> theory > class * theory 

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

46 

47 
(*old instance layer*) 

25536  48 
val instance_arity: (theory > theory) > arity > theory > Proof.state 
49 
val instance_arity_cmd: bstring * xstring list * xstring > theory > Proof.state 

24218  50 
end; 
51 

52 
structure Class : CLASS = 

53 
struct 

54 

55 
(** auxiliary **) 

56 

25062  57 
val classN = "class"; 
58 
val introN = "intro"; 

59 

25002  60 
fun prove_interpretation tac prfx_atts expr inst = 
61 
Locale.interpretation_i I prfx_atts expr inst 

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

64 
#> ProofContext.theory_of; 

65 

25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset

66 
fun prove_interpretation_in tac after_qed (name, expr) = 
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset

67 
Locale.interpretation_in_locale 
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset

68 
(ProofContext.theory after_qed) (name, expr) 
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset

69 
#> Proof.global_terminal_proof 
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset

70 
(Method.Basic (K (Method.SIMPLE_METHOD tac), Position.none), NONE) 
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset

71 
#> ProofContext.theory_of; 
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset

72 

25038  73 
fun get_remove_global_constraint c thy = 
74 
let 

75 
val ty = Sign.the_const_constraint thy c; 

76 
in 

77 
thy 

78 
> Sign.add_const_constraint (c, NONE) 

79 
> pair (c, Logic.unvarifyT ty) 

80 
end; 

81 

24589  82 

25485  83 
(** primitive axclass and instance commands **) 
24589  84 

24218  85 
fun axclass_cmd (class, raw_superclasses) raw_specs thy = 
86 
let 

87 
val ctxt = ProofContext.init thy; 

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

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

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

92 
raw_specs) 

24218  93 
> snd 
94 
> (map o map) fst; 

24589  95 
in 
96 
AxClass.define_class (class, superclasses) [] 

97 
(name_atts ~~ axiomss) thy 

98 
end; 

24218  99 

100 
local 

101 

102 
fun gen_instance mk_prop add_thm after_qed insts thy = 

103 
let 

104 
fun after_qed' results = 

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

106 
in 

107 
thy 

108 
> ProofContext.init 

24589  109 
> Proof.theorem_i NONE after_qed' ((map (fn t => [(t, [])]) 
25536  110 
o mk_prop thy) insts) 
24218  111 
end; 
112 

113 
in 

114 

24589  115 
val instance_arity = 
24218  116 
gen_instance (Logic.mk_arities oo Sign.cert_arity) AxClass.add_arity; 
25502  117 
val instance_arity_cmd = 
118 
gen_instance (Logic.mk_arities oo Sign.read_arity) AxClass.add_arity I; 

24589  119 
val classrel = 
25536  120 
gen_instance (single oo (Logic.mk_classrel oo AxClass.cert_classrel)) AxClass.add_classrel I; 
24589  121 
val classrel_cmd = 
25536  122 
gen_instance (single oo (Logic.mk_classrel oo AxClass.read_classrel)) AxClass.add_classrel I; 
24218  123 

124 
end; (*local*) 

125 

126 

24589  127 
(** class data **) 
24218  128 

129 
datatype class_data = ClassData of { 

130 
consts: (string * string) list 

24836  131 
(*locale parameter ~> constant name*), 
25062  132 
base_sort: sort, 
25083  133 
inst: term option list 
134 
(*canonical interpretation*), 

25062  135 
morphism: morphism, 
136 
(*partial morphism of canonical interpretation*) 

25618  137 
assm_intro: thm option, 
138 
of_class: thm, 

139 
axiom: thm option, 

24657  140 
defs: thm list, 
25368
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

141 
operations: (string * (class * (typ * term))) list 
24657  142 
}; 
24218  143 

24657  144 
fun rep_class_data (ClassData d) = d; 
25618  145 
fun mk_class_data ((consts, base_sort, inst, morphism, assm_intro, of_class, axiom), 
25368
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

146 
(defs, operations)) = 
25062  147 
ClassData { consts = consts, base_sort = base_sort, inst = inst, 
25618  148 
morphism = morphism, assm_intro = assm_intro, of_class = of_class, axiom = axiom, 
149 
defs = defs, operations = operations }; 

150 
fun map_class_data f (ClassData { consts, base_sort, inst, morphism, 

151 
assm_intro, of_class, axiom, defs, operations }) = 

152 
mk_class_data (f ((consts, base_sort, inst, morphism, assm_intro, of_class, axiom), 

25368
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

153 
(defs, operations))); 
25038  154 
fun merge_class_data _ (ClassData { consts = consts, 
25618  155 
base_sort = base_sort, inst = inst, morphism = morphism, assm_intro = assm_intro, 
156 
of_class = of_class, axiom = axiom, defs = defs1, operations = operations1 }, 

157 
ClassData { consts = _, base_sort = _, inst = _, morphism = _, assm_intro = _, 

158 
of_class = _, axiom = _, defs = defs2, operations = operations2 }) = 

159 
mk_class_data ((consts, base_sort, inst, morphism, assm_intro, of_class, axiom), 

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

160 
(Thm.merge_thms (defs1, defs2), 
25368
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

161 
AList.merge (op =) (K true) (operations1, operations2))); 
24218  162 

163 
structure ClassData = TheoryDataFun 

164 
( 

25038  165 
type T = class_data Graph.T 
166 
val empty = Graph.empty; 

24218  167 
val copy = I; 
168 
val extend = I; 

25038  169 
fun merge _ = Graph.join merge_class_data; 
24218  170 
); 
171 

172 

173 
(* queries *) 

174 

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

24589  177 
fun the_class_data thy class = case lookup_class_data thy class 
25020  178 
of NONE => error ("Undeclared class " ^ quote class) 
24589  179 
 SOME data => data; 
24218  180 

25038  181 
val is_class = is_some oo lookup_class_data; 
182 

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

24218  184 

25002  185 
fun these_params thy = 
24218  186 
let 
187 
fun params class = 

188 
let 

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

189 
val const_typs = (#params o AxClass.get_info thy) class; 
24657  190 
val const_names = (#consts o the_class_data thy) class; 
24218  191 
in 
192 
(map o apsnd) (fn c => (c, (the o AList.lookup (op =) const_typs) c)) const_names 

193 
end; 

194 
in maps params o ancestry thy end; 

195 

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

25062  198 
fun morphism thy = #morphism o the_class_data thy; 
199 

25618  200 
fun these_assm_intros thy = 
201 
Graph.fold (fn (_, (data, _)) => fold (insert Thm.eq_thm) 

202 
((the_list o #assm_intro o rep_class_data) data)) (ClassData.get thy) []; 

24218  203 

24836  204 
fun these_operations thy = 
205 
maps (#operations o the_class_data thy) o ancestry thy; 

24657  206 

24218  207 
fun print_classes thy = 
208 
let 

24920  209 
val ctxt = ProofContext.init thy; 
24218  210 
val algebra = Sign.classes_of thy; 
211 
val arities = 

212 
Symtab.empty 

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

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

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

216 
val the_arities = these o Symtab.lookup arities; 

217 
fun mk_arity class tyco = 

218 
let 

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

24920  220 
in Syntax.pretty_arity ctxt (tyco, Ss, [class]) end; 
24218  221 
fun mk_param (c, ty) = Pretty.str (Sign.extern_const thy c ^ " :: " 
24920  222 
^ setmp show_sorts false (Syntax.string_of_typ ctxt o Type.strip_sorts) ty); 
24218  223 
fun mk_entry class = (Pretty.block o Pretty.fbreaks o map_filter I) [ 
25062  224 
(SOME o Pretty.str) ("class " ^ Sign.extern_class thy class ^ ":"), 
24218  225 
(SOME o Pretty.block) [Pretty.str "supersort: ", 
24920  226 
(Syntax.pretty_sort ctxt o Sign.minimize_sort thy o Sign.super_classes thy) class], 
25062  227 
if is_class thy class then (SOME o Pretty.str) 
228 
("locale: " ^ Locale.extern thy class) else NONE, 

229 
((fn [] => NONE  ps => (SOME o Pretty.block o Pretty.fbreaks) 

230 
(Pretty.str "parameters:" :: ps)) o map mk_param 

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

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

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

235 
] 

236 
] 

237 
in 

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

24218  240 
end; 
241 

242 

243 
(* updaters *) 

244 

25618  245 
fun add_class_data ((class, superclasses), 
25683  246 
(params, base_sort, inst, phi, assm_intro, of_class, axiom)) thy = 
25002  247 
let 
25368
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

248 
val operations = map (fn (v_ty as (_, ty), (c, _)) => 
25683  249 
(c, (class, (ty, Free v_ty)))) params; 
25038  250 
val add_class = Graph.new_node (class, 
25683  251 
mk_class_data (((map o pairself) fst params, base_sort, 
25618  252 
map (SOME o Const) inst, phi, assm_intro, of_class, axiom), ([], operations))) 
25002  253 
#> fold (curry Graph.add_edge class) superclasses; 
25618  254 
in ClassData.map add_class thy end; 
24218  255 

25368
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

256 
fun register_operation class (c, (t, some_def)) thy = 
25062  257 
let 
25368
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

258 
val base_sort = (#base_sort o the_class_data thy) class; 
25239  259 
val prep_typ = map_atyps 
25368
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

260 
(fn TVar (vi as (v, _), sort) => if Name.aT = v 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

261 
then TFree (v, base_sort) else TVar (vi, sort)); 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

262 
val t' = map_types prep_typ t; 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

263 
val ty' = Term.fastype_of t'; 
25062  264 
in 
265 
thy 

266 
> (ClassData.map o Graph.map_node class o map_class_data o apsnd) 

25368
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

267 
(fn (defs, operations) => 
25096  268 
(fold cons (the_list some_def) defs, 
25368
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

269 
(c, (class, (ty', t'))) :: operations)) 
25062  270 
end; 
24218  271 

24589  272 

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

274 

25024  275 
val class_prefix = Logic.const_of_class o Sign.base_name; 
276 

25683  277 
fun calculate thy sups base_sort assm_axiom param_map class = 
25062  278 
let 
25683  279 
val subst_typ = map_atyps (fn TFree (v, sort) => 
280 
if v = Name.aT then TVar ((v, 0), [class]) else TVar ((v, 0), sort) 

281 
 ty => ty); 

282 
fun subst_aterm (t as Free (v, ty)) = (case AList.lookup (op =) param_map v 

25062  283 
of SOME (c, _) => Const (c, ty) 
284 
 NONE => t) 

285 
 subst_aterm t = t; 

286 
val subst_term = map_aterms subst_aterm #> map_types subst_typ; 

25683  287 
val matches = ([pairself (Thm.ctyp_of thy o TVar o pair (Name.aT, 0)) 
288 
(base_sort, [class])], map (fn (v, (c, ty)) => pairself (Thm.cterm_of thy) 

289 
(Var ((v, 0), map_atyps (fn _ => TVar ((Name.aT, 0), [class])) ty), 

290 
Const (c, map_atyps (fn _ => TVar ((Name.aT, 0), [class])) ty))) param_map); 

291 
val inst_thm = Thm.instantiate matches; 

292 
val (proto_assm_intro, locale_intro) = Locale.intros thy class 

293 
> pairself (try the_single); 

294 
val axiom_premises = map_filter (#axiom o the_class_data thy) sups 

295 
@ the_list assm_axiom; 

296 
val axiom = case locale_intro 

297 
of SOME proto_axiom => SOME ((inst_thm proto_axiom OF axiom_premises) > Drule.standard) 

298 
 NONE => assm_axiom; 

299 
val lift_axiom = case axiom of SOME axiom => 

300 
(fn thm => Thm.implies_elim (inst_thm thm) axiom) 

301 
 NONE => I; 

302 
val subst_thm = Drule.standard' #> inst_thm #> lift_axiom; 

303 
val morphism = Morphism.term_morphism subst_term 

304 
$> Morphism.typ_morphism subst_typ 

305 
$> Morphism.thm_morphism subst_thm; 

25062  306 

25683  307 
(*FIXME use more primitives here rather than OF, simplifify code*) 
25618  308 
fun VarA sort = TVar ((Name.aT, 0), sort); 
309 
fun FreeA sort = TFree (Name.aT, sort); 

310 
fun instantiate sort1 sort2 = 

311 
Thm.instantiate ([pairself (Thm.ctyp_of thy) (VarA sort1, FreeA sort2)], []) 

312 
val inst_ty = (map_atyps o K o VarA) base_sort; 

313 
val assm_intro = proto_assm_intro 

314 
> Option.map (Thm.instantiate ([], 

25683  315 
map (fn (v, (c, ty)) => pairself (Thm.cterm_of thy) 
25618  316 
(Var ((v, 0), inst_ty ty), Const (c, inst_ty ty))) param_map)) 
25668  317 
> Option.map (MetaSimplifier.rewrite_rule (these_defs thy sups)) 
318 
> Option.map Goal.close_result; 

25618  319 
val class_intro = (instantiate [] base_sort o #intro o AxClass.get_info thy) class; 
320 
val of_class_sups = if null sups 

321 
then Drule.sort_triv thy (FreeA base_sort, base_sort) 

322 
else map (Drule.implies_intr_hyps o #of_class o the_class_data thy) sups; 

25683  323 
val locale_dests = map Drule.standard' (Locale.dests thy class); 
25618  324 
fun mk_pred_triv () = (Thm.assume o Thm.cterm_of thy 
325 
o (map_types o map_atyps o K o FreeA) base_sort o Thm.prop_of o the) axiom; 

326 
val pred_trivs = case length locale_dests 

327 
of 0 => if is_none locale_intro then [] else [mk_pred_triv ()] 

328 
 n => replicate n (mk_pred_triv ()); 

25668  329 
val of_class = (class_intro OF of_class_sups OF locale_dests OF pred_trivs) 
330 
> Goal.close_result; 

25683  331 
in (morphism, assm_intro, of_class, axiom) end; 
24589  332 

333 
fun class_interpretation class facts defs thy = 

334 
let 

25038  335 
val params = these_params thy [class]; 
25083  336 
val inst = (#inst o the_class_data thy) class; 
25020  337 
val tac = ALLGOALS (ProofContext.fact_tac facts); 
25038  338 
val prfx = class_prefix class; 
24589  339 
in 
25038  340 
thy 
341 
> fold_map (get_remove_global_constraint o fst o snd) params 

25094
ba43514068fd
Interpretation equations may have name and/or attribute.
ballarin
parents:
25083
diff
changeset

342 
> prove_interpretation tac ((false, prfx), []) (Locale.Locale class) 
ba43514068fd
Interpretation equations may have name and/or attribute.
ballarin
parents:
25083
diff
changeset

343 
(inst, map (fn def => (("", []), def)) defs) 
25038  344 
> (fn cs => fold (Sign.add_const_constraint o apsnd SOME) cs) 
24589  345 
end; 
24218  346 

25618  347 
fun prove_subclass (sub, sup) thm thy = 
348 
let 

25683  349 
val of_class = (Drule.standard' o #of_class o the_class_data thy) sup; 
350 
val intro = Drule.standard' (of_class OF [Drule.standard' thm]); 

25618  351 
val classrel = intro OF (the_list o #axiom o the_class_data thy) sub; 
352 
in 

353 
thy 

354 
> AxClass.add_classrel classrel 

355 
> prove_interpretation_in (ALLGOALS (ProofContext.fact_tac [thm])) 

356 
I (sub, Locale.Locale sup) 

357 
> ClassData.map (Graph.add_edge (sub, sup)) 

358 
end; 

359 

24218  360 
fun intro_classes_tac facts st = 
361 
let 

362 
val thy = Thm.theory_of_thm st; 

363 
val classes = Sign.all_classes thy; 

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

25618  365 
val class_intros = map_filter (try (#intro o AxClass.get_info thy)) classes; 
366 
val assm_intros = these_assm_intros thy; 

24218  367 
in 
25618  368 
Method.intros_tac (class_trivs @ class_intros @ assm_intros) facts st 
24218  369 
end; 
370 

371 
fun default_intro_classes_tac [] = intro_classes_tac [] 

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

372 
 default_intro_classes_tac _ = no_tac; 
24218  373 

374 
fun default_tac rules ctxt facts = 

375 
HEADGOAL (Method.some_rule_tac rules ctxt facts) ORELSE 

376 
default_intro_classes_tac facts; 

377 

378 
val _ = Context.add_setup (Method.add_methods 

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

380 
"backchain introduction rules of classes"), 

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

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

383 

384 

24589  385 
(** classes and class target **) 
24218  386 

25002  387 
(* class context syntax *) 
24748  388 

25083  389 
structure ClassSyntax = ProofDataFun( 
390 
type T = { 

25368
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

391 
local_constraints: (string * typ) list, 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

392 
global_constraints: (string * typ) list, 
25083  393 
base_sort: sort, 
25368
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

394 
operations: (string * (typ * term)) list, 
25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset

395 
unchecks: (term * term) list, 
25083  396 
passed: bool 
25368
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

397 
}; 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

398 
fun init _ = { 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

399 
local_constraints = [], 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

400 
global_constraints = [], 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

401 
base_sort = [], 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

402 
operations = [], 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

403 
unchecks = [], 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

404 
passed = true 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

405 
};; 
25083  406 
); 
407 

25344
00c2179db769
synchronize_syntax: improved declare_const (still inactive);
wenzelm
parents:
25326
diff
changeset

408 
fun synchronize_syntax sups base_sort ctxt = 
24914
95cda5dd58d5
added proper subclass concept; improved class target
haftmann
parents:
24901
diff
changeset

409 
let 
25344
00c2179db769
synchronize_syntax: improved declare_const (still inactive);
wenzelm
parents:
25326
diff
changeset

410 
val thy = ProofContext.theory_of ctxt; 
25368
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

411 
fun subst_class_typ sort = map_atyps 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

412 
(fn TFree _ => TVar ((Name.aT, 0), sort)  ty' => ty'); 
25083  413 
val operations = these_operations thy sups; 
25368
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

414 
val local_constraints = 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

415 
(map o apsnd) (subst_class_typ base_sort o fst o snd) operations; 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

416 
val global_constraints = 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

417 
(map o apsnd) (fn (class, (ty, _)) => subst_class_typ [class] ty) operations; 
25318
c8352b38d47d
synchronize_syntax: declare operations within the local scope of fixes/consts
wenzelm
parents:
25311
diff
changeset

418 
fun declare_const (c, _) = 
c8352b38d47d
synchronize_syntax: declare operations within the local scope of fixes/consts
wenzelm
parents:
25311
diff
changeset

419 
let val b = Sign.base_name c 
25344
00c2179db769
synchronize_syntax: improved declare_const (still inactive);
wenzelm
parents:
25326
diff
changeset

420 
in Sign.intern_const thy b = c ? Variable.declare_const (b, c) end; 
25368
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

421 
val unchecks = map (fn (c, (_, (ty, t))) => (t, Const (c, ty))) operations; 
25083  422 
in 
423 
ctxt 

25368
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

424 
> fold declare_const local_constraints 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

425 
> fold (ProofContext.add_const_constraint o apsnd SOME) local_constraints 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

426 
> ClassSyntax.put { 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

427 
local_constraints = local_constraints, 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

428 
global_constraints = global_constraints, 
25083  429 
base_sort = base_sort, 
25368
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

430 
operations = (map o apsnd) snd operations, 
25195
62638dcafe38
fixed syntax; truned code structure; added primitive subclass interface with consideraton of syntax etc.
haftmann
parents:
25163
diff
changeset

431 
unchecks = unchecks, 
25083  432 
passed = false 
25368
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

433 
} 
25083  434 
end; 
435 

436 
fun refresh_syntax class ctxt = 

25002  437 
let 
438 
val thy = ProofContext.theory_of ctxt; 

25062  439 
val base_sort = (#base_sort o the_class_data thy) class; 
25344
00c2179db769
synchronize_syntax: improved declare_const (still inactive);
wenzelm
parents:
25326
diff
changeset

440 
in synchronize_syntax [class] base_sort ctxt end; 
24914
95cda5dd58d5
added proper subclass concept; improved class target
haftmann
parents:
24901
diff
changeset

441 

25368
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

442 
val mark_passed = ClassSyntax.map 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

443 
(fn { local_constraints, global_constraints, base_sort, operations, unchecks, passed } => 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

444 
{ local_constraints = local_constraints, global_constraints = global_constraints, 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

445 
base_sort = base_sort, operations = operations, unchecks = unchecks, passed = true }); 
25083  446 

447 
fun sort_term_check ts ctxt = 

24748  448 
let 
25368
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

449 
val { local_constraints, global_constraints, base_sort, operations, passed, ... } = 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

450 
ClassSyntax.get ctxt; 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

451 
fun check_improve (Const (c, ty)) = (case AList.lookup (op =) local_constraints c 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

452 
of SOME ty0 => (case try (Type.raw_match (ty0, ty)) Vartab.empty 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

453 
of SOME tyenv => (case Vartab.lookup tyenv (Name.aT, 0) 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

454 
of SOME (_, TVar (tvar as (vi, _))) => 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

455 
if TypeInfer.is_param vi then cons tvar else I 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

456 
 _ => I) 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

457 
 NONE => I) 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

458 
 NONE => I) 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

459 
 check_improve _ = I; 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

460 
val improvements = (fold o fold_aterms) check_improve ts []; 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

461 
val ts' = (map o map_types o map_atyps) (fn ty as TVar tvar => 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

462 
if member (op =) improvements tvar 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

463 
then TFree (Name.aT, base_sort) else ty  ty => ty) ts; 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

464 
fun check t0 = Envir.expand_term (fn Const (c, ty) => (case AList.lookup (op =) operations c 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

465 
of SOME (ty0, t) => 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

466 
if Type.typ_instance (ProofContext.tsig_of ctxt) (ty, ty0) 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

467 
then SOME (ty0, check t) else NONE 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

468 
 NONE => NONE) 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

469 
 _ => NONE) t0; 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

470 
val ts'' = map check ts'; 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

471 
in if eq_list (op aconv) (ts, ts'') andalso passed then NONE 
25083  472 
else 
473 
ctxt 

25368
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

474 
> fold (ProofContext.add_const_constraint o apsnd SOME) global_constraints 
25083  475 
> mark_passed 
25368
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

476 
> pair ts'' 
25083  477 
> SOME 
478 
end; 

24748  479 

25083  480 
fun sort_term_uncheck ts ctxt = 
25002  481 
let 
482 
val thy = ProofContext.theory_of ctxt; 

25368
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

483 
val unchecks = (#unchecks o ClassSyntax.get) ctxt; 
25462  484 
val ts' = map (Pattern.rewrite_term thy unchecks []) ts; 
25060  485 
in if eq_list (op aconv) (ts, ts') then NONE else SOME (ts', ctxt) end; 
25002  486 

25344
00c2179db769
synchronize_syntax: improved declare_const (still inactive);
wenzelm
parents:
25326
diff
changeset

487 
fun init_ctxt sups base_sort ctxt = 
25083  488 
ctxt 
489 
> Variable.declare_term 

490 
(Logic.mk_type (TFree (Name.aT, base_sort))) 

25344
00c2179db769
synchronize_syntax: improved declare_const (still inactive);
wenzelm
parents:
25326
diff
changeset

491 
> synchronize_syntax sups base_sort 
25083  492 
> Context.proof_map ( 
493 
Syntax.add_term_check 0 "class" sort_term_check 

25103  494 
#> Syntax.add_term_uncheck 0 "class" sort_term_uncheck) 
24901
d3cbf79769b9
added first version of userspace type system for class target
haftmann
parents:
24847
diff
changeset

495 

25311  496 
fun init class thy = 
497 
thy 

498 
> Locale.init class 

25344
00c2179db769
synchronize_syntax: improved declare_const (still inactive);
wenzelm
parents:
25326
diff
changeset

499 
> init_ctxt [class] ((#base_sort o the_class_data thy) class); 
24914
95cda5dd58d5
added proper subclass concept; improved class target
haftmann
parents:
24901
diff
changeset

500 

24748  501 

24589  502 
(* class definition *) 
24218  503 

504 
local 

505 

24748  506 
fun gen_class_spec prep_class prep_expr process_expr thy raw_supclasses raw_includes_elems = 
24218  507 
let 
24748  508 
val supclasses = map (prep_class thy) raw_supclasses; 
509 
val supsort = Sign.minimize_sort thy supclasses; 

25618  510 
val sups = filter (is_class thy) supsort; 
511 
val base_sort = if null sups then supsort else 

512 
(#base_sort o the_class_data thy o hd) sups; 

25038  513 
val suplocales = map Locale.Locale sups; 
24748  514 
val (raw_elems, includes) = fold_rev (fn Locale.Elem e => apfst (cons e) 
515 
 Locale.Expr i => apsnd (cons (prep_expr thy i))) raw_includes_elems ([], []); 

516 
val supexpr = Locale.Merge suplocales; 

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

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

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

24847  520 
(fn TFree (_, sort) => TFree (Name.aT, sort)) supparams); 
25683  521 
fun fork_syn (Element.Fixes xs) = 
522 
fold_map (fn (c, ty, syn) => cons (c, syn) #> pair (c, ty, NoSyn)) xs 

523 
#>> Element.Fixes 

524 
 fork_syn x = pair x; 

525 
fun fork_syntax elems = 

526 
let 

527 
val (elems', global_syntax) = fold_map fork_syn elems []; 

528 
in (if null includes (*FIXME*) then constrain :: elems' else elems', global_syntax) end; 

529 
val (elems, global_syntax) = 

530 
ProofContext.init thy 

531 
> Locale.cert_expr supexpr [constrain] 

532 
> snd 

533 
> init_ctxt sups base_sort 

534 
> process_expr Locale.empty raw_elems 

535 
> fst 

536 
> fork_syntax 

537 
in (((sups, supparams), (supsort, base_sort, mergeexpr)), (elems, global_syntax)) end; 

24748  538 

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

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

541 

25683  542 
fun adjungate_axclass bname class base_sort sups supsort supparams global_syntax other_consts thy = 
24968
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset

543 
let 
25683  544 
val supconsts = map fst supparams 
545 
> AList.make (the o AList.lookup (op =) (these_params thy sups)) 

546 
> (map o apsnd o apsnd o map_atyps o K o TFree) (Name.aT, [class]); 

547 
val all_params = map fst (Locale.parameters_of thy class); 

548 
fun add_const (v, raw_ty) thy = 

549 
let 

550 
val c = Sign.full_name thy v; 

551 
val ty = map_atyps (K (TFree (Name.aT, base_sort))) raw_ty; 

552 
val ty0 = Type.strip_sorts ty; 

553 
val ty' = map_atyps (K (TFree (Name.aT, [class]))) ty0; 

554 
val syn = (the_default NoSyn o AList.lookup (op =) global_syntax) v; 

555 
in 

556 
thy 

557 
> Sign.declare_const [] (v, ty0, syn) 

558 
> snd 

559 
> pair ((v, ty), (c, ty')) 

560 
end; 

561 
fun add_consts raw_params thy = 

562 
thy 

563 
> Sign.add_path (Logic.const_of_class bname) 

564 
> fold_map add_const raw_params 

565 
> Sign.restore_naming thy 

566 
> (fn params => pair (supconsts @ (map o apfst) fst params, params)); 

567 
fun globalize param_map = map_aterms 

568 
(fn Free (v, ty) => Const ((fst o the o AList.lookup (op =) param_map) v, ty) 

569 
 t => t); 

570 
val raw_pred = Locale.intros thy class 

571 
> fst 

572 
> map (Logic.unvarify o Logic.strip_imp_concl o Thm.prop_of); 

573 
fun get_axiom thy = case (#axioms o AxClass.get_info thy) class 

574 
of [] => NONE 

575 
 [thm] => SOME thm; 

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

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

577 
thy 
25683  578 
> add_consts ((snd o chop (length supparams)) all_params) 
579 
> (fn (param_map, params) => AxClass.define_class (bname, supsort) 

580 
(map (fst o snd) params @ other_consts) 

581 
[((bname ^ "_" ^ AxClass.axiomsN, []), map (globalize param_map) raw_pred)] 

582 
#> snd 

583 
#> `get_axiom 

584 
#> (fn assm_axiom => fold (Sign.add_const_constraint o apsnd SOME o snd) params 

585 
#> pair (param_map, params, assm_axiom))) 

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

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

587 

25002  588 
fun gen_class prep_spec prep_param bname 
24748  589 
raw_supclasses raw_includes_elems raw_other_consts thy = 
590 
let 

25038  591 
val class = Sign.full_name thy bname; 
25683  592 
val (((sups, supparams), (supsort, base_sort, mergeexpr)), (elems, global_syntax)) = 
24748  593 
prep_spec thy raw_supclasses raw_includes_elems; 
24968
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset

594 
val other_consts = map (tap (Sign.the_const_type thy) o prep_param thy) raw_other_consts; 
24218  595 
in 
596 
thy 

24748  597 
> Locale.add_locale_i (SOME "") bname mergeexpr elems 
25038  598 
> snd 
25311  599 
> ProofContext.theory_of 
25683  600 
> adjungate_axclass bname class base_sort sups supsort supparams global_syntax other_consts 
601 
> (fn (param_map, params, assm_axiom) => 

602 
`(fn thy => calculate thy sups base_sort assm_axiom param_map class) 

603 
#> (fn (morphism, assm_intro, assm_proj, axiom) => 

604 
add_class_data ((class, sups), (params, base_sort, 

605 
map snd param_map, morphism, assm_intro, assm_proj, axiom)) 

606 
#> class_interpretation class (the_list axiom) [])) 

25268  607 
> init class 
25038  608 
> pair class 
24218  609 
end; 
610 

25326  611 
fun read_const thy = #1 o Term.dest_Const o ProofContext.read_const (ProofContext.init thy); 
612 

24218  613 
in 
614 

25326  615 
val class_cmd = gen_class read_class_spec read_const; 
24748  616 
val class = gen_class check_class_spec (K I); 
24218  617 

618 
end; (*local*) 

619 

620 

25485  621 
(* class target *) 
24218  622 

25603  623 
fun declare class pos ((c, mx), dict) thy = 
24218  624 
let 
25024  625 
val prfx = class_prefix class; 
626 
val thy' = thy > Sign.add_path prfx; 

25062  627 
val phi = morphism thy' class; 
25024  628 

25062  629 
val c' = Sign.full_name thy' c; 
25239  630 
val dict' = Morphism.term phi dict; 
631 
val dict_def = map_types Logic.unvarifyT dict'; 

632 
val ty' = Term.fastype_of dict_def; 

25083  633 
val ty'' = Type.strip_sorts ty'; 
25239  634 
val def_eq = Logic.mk_equals (Const (c', ty'), dict_def); 
25618  635 
fun get_axiom thy = ((Thm.varifyT o Thm.symmetric o Thm.get_axiom_i thy) c', thy); 
24218  636 
in 
25024  637 
thy' 
25096  638 
> Sign.declare_const pos (c, ty'', mx) > snd 
25518  639 
> Thm.add_def false false (c, def_eq) 
25062  640 
>> Thm.symmetric 
25618  641 
>> get_axiom 
642 
> (fn (def, def') => class_interpretation class [def] [Thm.prop_of def] 

643 
#> register_operation class (c', (dict', SOME def'))) 

24218  644 
> Sign.restore_naming thy 
25083  645 
> Sign.add_const_constraint (c', SOME ty') 
24218  646 
end; 
647 

25603  648 
fun abbrev class prmode pos ((c, mx), rhs) thy = 
24836  649 
let 
25024  650 
val prfx = class_prefix class; 
25096  651 
val thy' = thy > Sign.add_path prfx; 
25062  652 
val phi = morphism thy class; 
653 

25096  654 
val c' = Sign.full_name thy' c; 
25146  655 
val rews = map (Logic.dest_equals o Thm.prop_of) (these_defs thy' [class]) 
656 
val rhs' = (Pattern.rewrite_term thy rews [] o Morphism.term phi) rhs; 

25239  657 
val ty' = Logic.unvarifyT (Term.fastype_of rhs'); 
24836  658 
in 
25096  659 
thy' 
25146  660 
> Sign.add_abbrev (#1 prmode) pos (c, map_types Type.strip_sorts rhs') > snd 
25096  661 
> Sign.add_const_constraint (c', SOME ty') 
25024  662 
> Sign.notation true prmode [(Const (c', ty'), mx)] 
25368
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

663 
> register_operation class (c', (rhs', NONE)) 
25096  664 
> Sign.restore_naming thy 
24836  665 
end; 
666 

25462  667 

668 
(** instantiation target **) 

669 

670 
(* bookkeeping *) 

671 

672 
datatype instantiation = Instantiation of { 

25536  673 
arities: string list * sort list * sort, 
25462  674 
params: ((string * string) * (string * typ)) list 
25603  675 
(*(instantiation parameter, type constructor), (local instantiation parameter, typ)*) 
25462  676 
} 
677 

678 
structure Instantiation = ProofDataFun 

679 
( 

680 
type T = instantiation 

25536  681 
fun init _ = Instantiation { arities = ([], [], []), params = [] }; 
25462  682 
); 
683 

25485  684 
fun mk_instantiation (arities, params) = 
685 
Instantiation { arities = arities, params = params }; 

25514  686 
fun get_instantiation lthy = case Instantiation.get (LocalTheory.target_of lthy) 
25485  687 
of Instantiation data => data; 
25514  688 
fun map_instantiation f = (LocalTheory.target o Instantiation.map) 
689 
(fn Instantiation { arities, params } => mk_instantiation (f (arities, params))); 

25462  690 

25514  691 
fun the_instantiation lthy = case get_instantiation lthy 
25536  692 
of { arities = ([], [], []), ... } => error "No instantiation target" 
25485  693 
 data => data; 
25462  694 

25485  695 
val instantiation_params = #params o get_instantiation; 
25462  696 

25514  697 
fun instantiation_param lthy v = instantiation_params lthy 
25462  698 
> find_first (fn (_, (v', _)) => v = v') 
699 
> Option.map (fst o fst); 

700 

25514  701 
fun confirm_declaration c = (map_instantiation o apsnd) 
25485  702 
(filter_out (fn (_, (c', _)) => c' = c)); 
703 

25462  704 

705 
(* syntax *) 

706 

25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25574
diff
changeset

707 
fun subst_param thy params = map_aterms (fn t as Const (c, ty) => 
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25574
diff
changeset

708 
(case AxClass.inst_tyco_of thy (c, ty) 
25536  709 
of SOME tyco => (case AList.lookup (op =) params (c, tyco) 
710 
of SOME v_ty => Free v_ty 

711 
 NONE => t) 

712 
 NONE => t) 

713 
 t => t); 

714 

25514  715 
fun inst_term_check ts lthy = 
25462  716 
let 
25514  717 
val params = instantiation_params lthy; 
718 
val tsig = ProofContext.tsig_of lthy; 

719 
val thy = ProofContext.theory_of lthy; 

25462  720 

25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25574
diff
changeset

721 
fun check_improve (Const (c, ty)) = (case AxClass.inst_tyco_of thy (c, ty) 
25462  722 
of SOME tyco => (case AList.lookup (op =) params (c, tyco) 
25502  723 
of SOME (_, ty') => perhaps (try (Type.typ_match tsig (ty, ty'))) 
25462  724 
 NONE => I) 
725 
 NONE => I) 

726 
 check_improve _ = I; 

727 
val improvement = (fold o fold_aterms) check_improve ts Vartab.empty; 

728 
val ts' = (map o map_types) (Envir.typ_subst_TVars improvement) ts; 

25536  729 
val ts'' = map (subst_param thy params) ts'; 
25514  730 
in if eq_list (op aconv) (ts, ts'') then NONE else SOME (ts'', lthy) end; 
25462  731 

25514  732 
fun inst_term_uncheck ts lthy = 
25462  733 
let 
25514  734 
val params = instantiation_params lthy; 
25462  735 
val ts' = (map o map_aterms) (fn t as Free (v, ty) => 
736 
(case get_first (fn ((c, _), (v', _)) => if v = v' then SOME c else NONE) params 

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

738 
 NONE => t) 

739 
 t => t) ts; 

25514  740 
in if eq_list (op aconv) (ts, ts') then NONE else SOME (ts', lthy) end; 
25462  741 

742 

743 
(* target *) 

744 

25485  745 
val sanatize_name = (*FIXME*) 
746 
let 

25574  747 
fun is_valid s = Symbol.is_ascii_letter s orelse Symbol.is_ascii_digit s 
748 
orelse s = "'" orelse s = "_"; 

25485  749 
val is_junk = not o is_valid andf Symbol.is_regular; 
750 
val junk = Scan.many is_junk; 

751 
val scan_valids = Symbol.scanner "Malformed input" 

752 
((junk  

753 
(Scan.optional (Scan.one Symbol.is_ascii_letter) "x" ^^ (Scan.many is_valid >> implode) 

754 
 junk)) 

755 
 Scan.repeat ((Scan.many1 is_valid >> implode)  junk) >> op ::); 

756 
in 

757 
explode #> scan_valids #> implode 

758 
end; 

759 

25536  760 
fun init_instantiation (tycos, sorts, sort) thy = 
25462  761 
let 
25536  762 
val _ = if null tycos then error "At least one arity must be given" else (); 
763 
val _ = map (the_class_data thy) sort; 

764 
val vs = map TFree (Name.names Name.context Name.aT sorts); 

25485  765 
fun type_name "*" = "prod" 
766 
 type_name "+" = "sum" 

767 
 type_name s = sanatize_name (NameSpace.base s); (*FIXME*) 

25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25574
diff
changeset

768 
fun get_param tyco (param, (c, ty)) = if can (AxClass.param_of_inst thy) (c, tyco) 
25603  769 
then NONE else SOME ((c, tyco), 
25536  770 
(param ^ "_" ^ type_name tyco, map_atyps (K (Type (tyco, vs))) ty)); 
771 
val params = map_product get_param tycos (these_params thy sort) > map_filter I; 

25485  772 
in 
773 
thy 

774 
> ProofContext.init 

25536  775 
> Instantiation.put (mk_instantiation ((tycos, sorts, sort), params)) 
776 
> fold (Variable.declare_term o Logic.mk_type) vs 

25574  777 
> fold (Variable.declare_names o Free o snd) params 
25536  778 
> fold (fn tyco => ProofContext.add_arity (tyco, sorts, sort)) tycos 
25485  779 
> Context.proof_map ( 
780 
Syntax.add_term_check 0 "instance" inst_term_check 

781 
#> Syntax.add_term_uncheck 0 "instance" inst_term_uncheck) 

782 
end; 

783 

784 
fun gen_instantiation_instance do_proof after_qed lthy = 

785 
let 

25536  786 
val (tycos, sorts, sort) = (#arities o the_instantiation) lthy; 
787 
val arities_proof = maps (fn tyco => Logic.mk_arities (tyco, sorts, sort)) tycos; 

25462  788 
fun after_qed' results = 
789 
LocalTheory.theory (fold (AxClass.add_arity o Thm.varifyT) results) 

790 
#> after_qed; 

791 
in 

792 
lthy 

793 
> do_proof after_qed' arities_proof 

794 
end; 

795 

25485  796 
val instantiation_instance = gen_instantiation_instance (fn after_qed => fn ts => 
25462  797 
Proof.theorem_i NONE (after_qed o map the_single) (map (fn t => [(t, [])]) ts)); 
798 

25485  799 
fun prove_instantiation_instance tac = gen_instantiation_instance (fn after_qed => 
25502  800 
fn ts => fn lthy => after_qed (map (fn t => Goal.prove lthy [] [] t 
801 
(fn {context, ...} => tac context)) ts) lthy) I; 

25462  802 

803 
fun conclude_instantiation lthy = 

804 
let 

25485  805 
val { arities, params } = the_instantiation lthy; 
25536  806 
val (tycos, sorts, sort) = arities; 
25462  807 
val thy = ProofContext.theory_of lthy; 
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25574
diff
changeset

808 
val _ = map (fn tyco => if Sign.of_sort thy 
25462  809 
(Type (tyco, map TFree (Name.names Name.context Name.aT sorts)), sort) 
810 
then () else error ("Missing instance proof for type " ^ quote (Sign.extern_type thy tyco))) 

25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25574
diff
changeset

811 
tycos; 
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25574
diff
changeset

812 
in lthy end; 
25462  813 

25603  814 
fun pretty_instantiation lthy = 
815 
let 

816 
val { arities, params } = the_instantiation lthy; 

817 
val (tycos, sorts, sort) = arities; 

818 
val thy = ProofContext.theory_of lthy; 

819 
fun pr_arity tyco = Syntax.pretty_arity lthy (tyco, sorts, sort); 

820 
fun pr_param ((c, _), (v, ty)) = 

821 
(Pretty.block o Pretty.breaks) [(Pretty.str o Sign.extern_const thy) c, Pretty.str "::", 

822 
Sign.pretty_typ thy ty, Pretty.str "as", Pretty.str v]; 

823 
in 

824 
(Pretty.block o Pretty.fbreaks) 

825 
(Pretty.str "instantiation" :: map pr_arity tycos @ map pr_param params) 

826 
end; 

827 

24218  828 
end; 
25683  829 