author  haftmann 
Thu, 13 Dec 2007 07:09:06 +0100  
changeset 25618  01f20279fea1 
parent 25603  4b7a58fc168c 
child 25668  a9ebfc170fbc 
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), 
246 
(cs, 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, _)) => 
f12613fda79d
proper implementation of check phase; nonqualified names for class operations
haftmann
parents:
25344
diff
changeset

249 
(c, (class, (ty, Free v_ty)))) cs; 
25002  250 
val cs = (map o pairself) fst cs; 
25038  251 
val add_class = Graph.new_node (class, 
25618  252 
mk_class_data ((cs, base_sort, 
253 
map (SOME o Const) inst, phi, assm_intro, of_class, axiom), ([], operations))) 

25002  254 
#> fold (curry Graph.add_edge class) superclasses; 
25618  255 
in ClassData.map add_class thy end; 
24218  256 

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

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

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

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

262 
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

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

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

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

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

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

24589  273 

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

275 

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

25062  278 
fun calculate_morphism class cs = 
279 
let 

280 
val subst_typ = Term.map_type_tfree (fn var as (v, sort) => 

281 
if v = Name.aT then TVar ((v, 0), [class]) else TVar ((v, 0), sort)); 

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

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; 

287 
in 

25209  288 
Morphism.term_morphism subst_term 
25062  289 
$> Morphism.typ_morphism subst_typ 
290 
end; 

291 

25618  292 
fun calculate_rules thy sups base_sort assm_axiom param_map class = 
24589  293 
let 
25618  294 
(*FIXME use more primitves here rather than OF, simplifify code*) 
295 
fun the_option [x] = SOME x 

296 
 the_option [] = NONE; 

297 
fun VarA sort = TVar ((Name.aT, 0), sort); 

298 
fun FreeA sort = TFree (Name.aT, sort); 

299 
fun instantiate sort1 sort2 = 

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

301 
val (proto_assm_intro, locale_intro) = pairself the_option (Locale.intros thy class); 

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

303 
val assm_intro = proto_assm_intro 

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

305 
map (fn ((v, _), (c, ty)) => pairself (Thm.cterm_of thy) 

306 
(Var ((v, 0), inst_ty ty), Const (c, inst_ty ty))) param_map)) 

307 
> Option.map (MetaSimplifier.rewrite_rule (these_defs thy sups)); 

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

309 
@ the_list assm_axiom; 

310 
val axiom = case locale_intro 

311 
of SOME proto_axiom => SOME 

312 
((instantiate base_sort [class] proto_axiom OF axiom_premises) > Drule.standard) 

313 
 NONE => assm_axiom; 

314 
val class_intro = (instantiate [] base_sort o #intro o AxClass.get_info thy) class; 

315 
val of_class_sups = if null sups 

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

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

318 
val locale_dests = map Drule.standard (Locale.dests thy class); 

319 
fun mk_pred_triv () = (Thm.assume o Thm.cterm_of thy 

320 
o (map_types o map_atyps o K o FreeA) base_sort o Thm.prop_of o the) axiom; 

321 
val pred_trivs = case length locale_dests 

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

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

324 
val of_class = class_intro OF of_class_sups OF locale_dests OF pred_trivs; 

325 
in (assm_intro, of_class, axiom) end; 

24589  326 

327 
fun class_interpretation class facts defs thy = 

328 
let 

25038  329 
val params = these_params thy [class]; 
25083  330 
val inst = (#inst o the_class_data thy) class; 
25020  331 
val tac = ALLGOALS (ProofContext.fact_tac facts); 
25038  332 
val prfx = class_prefix class; 
24589  333 
in 
25038  334 
thy 
335 
> 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

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

337 
(inst, map (fn def => (("", []), def)) defs) 
25038  338 
> (fn cs => fold (Sign.add_const_constraint o apsnd SOME) cs) 
24589  339 
end; 
24218  340 

25618  341 
fun prove_subclass (sub, sup) thm thy = 
342 
let 

343 
val of_class = (Drule.standard o #of_class o the_class_data thy) sup; 

344 
val intro = Drule.standard (of_class OF [Drule.standard thm]); 

345 
val classrel = intro OF (the_list o #axiom o the_class_data thy) sub; 

346 
in 

347 
thy 

348 
> AxClass.add_classrel classrel 

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

350 
I (sub, Locale.Locale sup) 

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

352 
end; 

353 

24218  354 
fun intro_classes_tac facts st = 
355 
let 

356 
val thy = Thm.theory_of_thm st; 

357 
val classes = Sign.all_classes thy; 

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

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

24218  361 
in 
25618  362 
Method.intros_tac (class_trivs @ class_intros @ assm_intros) facts st 
24218  363 
end; 
364 

365 
fun default_intro_classes_tac [] = intro_classes_tac [] 

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

366 
 default_intro_classes_tac _ = no_tac; 
24218  367 

368 
fun default_tac rules ctxt facts = 

369 
HEADGOAL (Method.some_rule_tac rules ctxt facts) ORELSE 

370 
default_intro_classes_tac facts; 

371 

372 
val _ = Context.add_setup (Method.add_methods 

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

374 
"backchain introduction rules of classes"), 

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

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

377 

378 

24589  379 
(** classes and class target **) 
24218  380 

25002  381 
(* class context syntax *) 
24748  382 

25083  383 
structure ClassSyntax = ProofDataFun( 
384 
type T = { 

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

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

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

388 
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

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

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

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

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

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

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

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

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

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

399 
};; 
25083  400 
); 
401 

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

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

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

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

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

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

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

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

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

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

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

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

414 
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

415 
val unchecks = map (fn (c, (_, (ty, t))) => (t, Const (c, ty))) operations; 
25083  416 
in 
417 
ctxt 

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

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

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

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

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

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

424 
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

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

427 
} 
25083  428 
end; 
429 

430 
fun refresh_syntax class ctxt = 

25002  431 
let 
432 
val thy = ProofContext.theory_of ctxt; 

25062  433 
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

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

435 

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

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

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

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

439 
base_sort = base_sort, operations = operations, unchecks = unchecks, passed = true }); 
25083  440 

441 
fun sort_term_check ts ctxt = 

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

443 
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

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

445 
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

446 
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

447 
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

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

449 
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

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

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

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

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

454 
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

455 
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

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

457 
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

458 
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

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

460 
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

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

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

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

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

465 
in if eq_list (op aconv) (ts, ts'') andalso passed then NONE 
25083  466 
else 
467 
ctxt 

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

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

470 
> pair ts'' 
25083  471 
> SOME 
472 
end; 

24748  473 

25083  474 
fun sort_term_uncheck ts ctxt = 
25002  475 
let 
476 
val thy = ProofContext.theory_of ctxt; 

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

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

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

481 
fun init_ctxt sups base_sort ctxt = 
25083  482 
ctxt 
483 
> Variable.declare_term 

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

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

485 
> synchronize_syntax sups base_sort 
25083  486 
> Context.proof_map ( 
487 
Syntax.add_term_check 0 "class" sort_term_check 

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

489 

25311  490 
fun init class thy = 
491 
thy 

492 
> Locale.init class 

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

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

494 

24748  495 

24589  496 
(* class definition *) 
24218  497 

498 
local 

499 

24748  500 
fun gen_class_spec prep_class prep_expr process_expr thy raw_supclasses raw_includes_elems = 
24218  501 
let 
24748  502 
val supclasses = map (prep_class thy) raw_supclasses; 
503 
val supsort = Sign.minimize_sort thy supclasses; 

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

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

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

510 
val supexpr = Locale.Merge suplocales; 

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

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

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

24847  516 
(fn TFree (_, sort) => TFree (Name.aT, sort)) supparams); 
24748  517 
in 
518 
ProofContext.init thy 

519 
> Locale.cert_expr supexpr [constrain] 

520 
> snd 

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

521 
> init_ctxt sups base_sort 
24748  522 
> process_expr Locale.empty raw_elems 
523 
> fst 

25062  524 
> (fn elems => ((((sups, supconsts), (supsort, base_sort, mergeexpr)), 
24748  525 
(*FIXME*) if null includes then constrain :: elems else elems))) 
526 
end; 

527 

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

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

530 

25618  531 
fun define_class_params name class superclasses consts dep_axiom other_consts thy = 
24968
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset

532 
let 
25083  533 
fun add_const ((c, ty), syn) = 
534 
Sign.declare_const [] (c, Type.strip_sorts ty, syn) #>> Term.dest_Const; 

25618  535 
val constrain_typs = (map o apsnd o Term.map_type_tfree) 
25002  536 
(fn (v, _) => TFree (v, [class])) 
25618  537 
fun the_option [x] = SOME x 
538 
 the_option [] = NONE; 

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

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

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

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

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

543 
> Sign.restore_naming thy 
25618  544 
> (fn cs => `(fn thy => dep_axiom thy cs) 
545 
#> (fn axiom => AxClass.define_class (name, superclasses) 

546 
(map fst cs @ other_consts) [axiom] 

547 
#> (fn _ => `(fn _ => constrain_typs cs) 

548 
#> (fn cs' => `(fn thy => (the_option o #axioms o AxClass.get_info thy) class) 

549 
#> (fn axiom => fold (Sign.add_const_constraint o apsnd SOME) cs' 

550 
#> pair (cs', axiom)))))) 

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

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

552 

25002  553 
fun gen_class prep_spec prep_param bname 
24748  554 
raw_supclasses raw_includes_elems raw_other_consts thy = 
555 
let 

25038  556 
val class = Sign.full_name thy bname; 
25062  557 
val (((sups, supconsts), (supsort, base_sort, mergeexpr)), elems_syn) = 
24748  558 
prep_spec thy raw_supclasses raw_includes_elems; 
24968
f9bafc868847
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset

559 
val other_consts = map (tap (Sign.the_const_type thy) o prep_param thy) raw_other_consts; 
25163  560 
fun mk_inst class cs = 
561 
(map o apsnd o Term.map_type_tfree) (fn (v, _) => TFree (v, [class])) cs; 

25062  562 
fun fork_syntax (Element.Fixes xs) = 
563 
fold_map (fn (c, ty, syn) => cons (c, syn) #> pair (c, ty, NoSyn)) xs 

564 
#>> Element.Fixes 

565 
 fork_syntax x = pair x; 

566 
val (elems, global_syn) = fold_map fork_syntax elems_syn []; 

25326  567 
fun globalize (c, ty) = 
25618  568 
((c, map_atyps (K (TFree (Name.aT, base_sort))) ty), 
25062  569 
(the_default NoSyn o AList.lookup (op =) global_syn) c); 
25038  570 
fun extract_params thy = 
24218  571 
let 
25062  572 
val params = map fst (Locale.parameters_of thy class); 
24218  573 
in 
25062  574 
(params, (map globalize o snd o chop (length supconsts)) params) 
24218  575 
end; 
25038  576 
fun extract_assumes params thy cs = 
24218  577 
let 
578 
val consts = supconsts @ (map (fst o fst) params ~~ cs); 

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

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

581 
 subst t = t; 

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

25024  583 
((Sign.base_name name, map (Attrib.attribute_i thy) atts), 
24589  584 
(map o map_aterms) subst ts); 
24218  585 
in 
25618  586 
Locale.intros thy class 
587 
> fst 

588 
> map (map_aterms subst o Logic.unvarify o Logic.strip_imp_concl o Thm.prop_of) 

589 
> pair (bname ^ "_" ^ AxClass.axiomsN, []) 

24218  590 
end; 
591 
in 

592 
thy 

24748  593 
> Locale.add_locale_i (SOME "") bname mergeexpr elems 
25038  594 
> snd 
25311  595 
> ProofContext.theory_of 
596 
> `extract_params 

597 
> (fn (all_params, params) => 

25618  598 
define_class_params bname class supsort params 
25038  599 
(extract_assumes params) other_consts 
25618  600 
#> (fn (consts, assm_axiom) => 
601 
`(fn thy => calculate_rules thy sups base_sort assm_axiom 

602 
(all_params ~~ map snd supconsts @ consts) class) 

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

25038  604 
add_class_data ((class, sups), 
25062  605 
(map fst params ~~ consts, base_sort, 
25163  606 
mk_inst class (map snd supconsts @ consts), 
25618  607 
calculate_morphism class (supconsts @ (map (fst o fst) params ~~ consts)), 
608 
assm_intro, assm_proj, axiom)) 

609 
#> class_interpretation class (the_list axiom) [] 

610 
))) 

25268  611 
> init class 
25038  612 
> pair class 
24218  613 
end; 
614 

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

24218  617 
in 
618 

25326  619 
val class_cmd = gen_class read_class_spec read_const; 
24748  620 
val class = gen_class check_class_spec (K I); 
24218  621 

622 
end; (*local*) 

623 

624 

25485  625 
(* class target *) 
24218  626 

25603  627 
fun declare class pos ((c, mx), dict) thy = 
24218  628 
let 
25024  629 
val prfx = class_prefix class; 
630 
val thy' = thy > Sign.add_path prfx; 

25062  631 
val phi = morphism thy' class; 
25024  632 

25062  633 
val c' = Sign.full_name thy' c; 
25239  634 
val dict' = Morphism.term phi dict; 
635 
val dict_def = map_types Logic.unvarifyT dict'; 

636 
val ty' = Term.fastype_of dict_def; 

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

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

24218  648 
> Sign.restore_naming thy 
25083  649 
> Sign.add_const_constraint (c', SOME ty') 
24218  650 
end; 
651 

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

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

25239  661 
val ty' = Logic.unvarifyT (Term.fastype_of rhs'); 
24836  662 
in 
25096  663 
thy' 
25146  664 
> Sign.add_abbrev (#1 prmode) pos (c, map_types Type.strip_sorts rhs') > snd 
25096  665 
> Sign.add_const_constraint (c', SOME ty') 
25024  666 
> 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

667 
> register_operation class (c', (rhs', NONE)) 
25096  668 
> Sign.restore_naming thy 
24836  669 
end; 
670 

25462  671 

672 
(** instantiation target **) 

673 

674 
(* bookkeeping *) 

675 

676 
datatype instantiation = Instantiation of { 

25536  677 
arities: string list * sort list * sort, 
25462  678 
params: ((string * string) * (string * typ)) list 
25603  679 
(*(instantiation parameter, type constructor), (local instantiation parameter, typ)*) 
25462  680 
} 
681 

682 
structure Instantiation = ProofDataFun 

683 
( 

684 
type T = instantiation 

25536  685 
fun init _ = Instantiation { arities = ([], [], []), params = [] }; 
25462  686 
); 
687 

25485  688 
fun mk_instantiation (arities, params) = 
689 
Instantiation { arities = arities, params = params }; 

25514  690 
fun get_instantiation lthy = case Instantiation.get (LocalTheory.target_of lthy) 
25485  691 
of Instantiation data => data; 
25514  692 
fun map_instantiation f = (LocalTheory.target o Instantiation.map) 
693 
(fn Instantiation { arities, params } => mk_instantiation (f (arities, params))); 

25462  694 

25514  695 
fun the_instantiation lthy = case get_instantiation lthy 
25536  696 
of { arities = ([], [], []), ... } => error "No instantiation target" 
25485  697 
 data => data; 
25462  698 

25485  699 
val instantiation_params = #params o get_instantiation; 
25462  700 

25514  701 
fun instantiation_param lthy v = instantiation_params lthy 
25462  702 
> find_first (fn (_, (v', _)) => v = v') 
703 
> Option.map (fst o fst); 

704 

25514  705 
fun confirm_declaration c = (map_instantiation o apsnd) 
25485  706 
(filter_out (fn (_, (c', _)) => c' = c)); 
707 

25462  708 

709 
(* syntax *) 

710 

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

711 
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

712 
(case AxClass.inst_tyco_of thy (c, ty) 
25536  713 
of SOME tyco => (case AList.lookup (op =) params (c, tyco) 
714 
of SOME v_ty => Free v_ty 

715 
 NONE => t) 

716 
 NONE => t) 

717 
 t => t); 

718 

25514  719 
fun inst_term_check ts lthy = 
25462  720 
let 
25514  721 
val params = instantiation_params lthy; 
722 
val tsig = ProofContext.tsig_of lthy; 

723 
val thy = ProofContext.theory_of lthy; 

25462  724 

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

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

730 
 check_improve _ = I; 

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

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

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

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

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

742 
 NONE => t) 

743 
 t => t) ts; 

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

746 

747 
(* target *) 

748 

25485  749 
val sanatize_name = (*FIXME*) 
750 
let 

25574  751 
fun is_valid s = Symbol.is_ascii_letter s orelse Symbol.is_ascii_digit s 
752 
orelse s = "'" orelse s = "_"; 

25485  753 
val is_junk = not o is_valid andf Symbol.is_regular; 
754 
val junk = Scan.many is_junk; 

755 
val scan_valids = Symbol.scanner "Malformed input" 

756 
((junk  

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

758 
 junk)) 

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

760 
in 

761 
explode #> scan_valids #> implode 

762 
end; 

763 

25536  764 
fun init_instantiation (tycos, sorts, sort) thy = 
25462  765 
let 
25536  766 
val _ = if null tycos then error "At least one arity must be given" else (); 
767 
val _ = map (the_class_data thy) sort; 

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

25485  769 
fun type_name "*" = "prod" 
770 
 type_name "+" = "sum" 

771 
 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

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

25485  776 
in 
777 
thy 

778 
> ProofContext.init 

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

25574  781 
> fold (Variable.declare_names o Free o snd) params 
25536  782 
> fold (fn tyco => ProofContext.add_arity (tyco, sorts, sort)) tycos 
25485  783 
> Context.proof_map ( 
784 
Syntax.add_term_check 0 "instance" inst_term_check 

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

786 
end; 

787 

788 
fun gen_instantiation_instance do_proof after_qed lthy = 

789 
let 

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

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

794 
#> after_qed; 

795 
in 

796 
lthy 

797 
> do_proof after_qed' arities_proof 

798 
end; 

799 

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

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

25462  806 

807 
fun conclude_instantiation lthy = 

808 
let 

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

812 
val _ = map (fn tyco => if Sign.of_sort thy 
25462  813 
(Type (tyco, map TFree (Name.names Name.context Name.aT sorts)), sort) 
814 
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

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

816 
in lthy end; 
25462  817 

25603  818 
fun pretty_instantiation lthy = 
819 
let 

820 
val { arities, params } = the_instantiation lthy; 

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

822 
val thy = ProofContext.theory_of lthy; 

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

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

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

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

827 
in 

828 
(Pretty.block o Pretty.fbreaks) 

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

830 
end; 

831 

24218  832 
end; 