author  haftmann 
Wed, 27 Feb 2008 21:41:05 +0100  
changeset 26167  ccc9007a7164 
parent 25999  f8bcd311d501 
child 26238  c30bb8182da2 
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*) 
25864  33 
val init_instantiation: string list * (string * 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*), 

25711  135 
morphism: theory > thm list > morphism, 
25062  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 

25711  198 
fun partial_morphism thy class = #morphism (the_class_data thy class) thy []; 
199 
fun morphism thy class = #morphism (the_class_data thy class) thy (these_defs thy [class]); 

25062  200 

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

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

24218  204 

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

24657  207 

24218  208 
fun print_classes thy = 
209 
let 

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

213 
Symtab.empty 

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

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

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

217 
val the_arities = these o Symtab.lookup arities; 

218 
fun mk_arity class tyco = 

219 
let 

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

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

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

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

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

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

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

236 
] 

237 
] 

238 
in 

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

24218  241 
end; 
242 

243 

244 
(* updaters *) 

245 

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

249 
val operations = map (fn (v_ty as (_, ty), (c, _)) => 
25683  250 
(c, (class, (ty, Free v_ty)))) params; 
25038  251 
val add_class = Graph.new_node (class, 
25683  252 
mk_class_data (((map o pairself) fst params, base_sort, 
25618  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 

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

283 
 ty => ty); 

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

25062  285 
of SOME (c, _) => Const (c, ty) 
286 
 NONE => t) 

287 
 subst_aterm t = t; 

25711  288 
fun instantiate thy sort = Thm.instantiate ([pairself (Thm.ctyp_of thy o TVar o pair (Name.aT, 0)) 
289 
(base_sort, sort)], map (fn (v, (c, ty)) => pairself (Thm.cterm_of thy) 

290 
(Var ((v, 0), map_atyps (fn _ => TVar ((Name.aT, 0), sort)) ty), 

291 
Const (c, map_atyps (fn _ => TVar ((Name.aT, 0), sort)) ty))) param_map); 

292 
val instantiate_base_sort = instantiate thy base_sort; 

293 
val instantiate_class = instantiate thy [class]; 

25683  294 
val (proto_assm_intro, locale_intro) = Locale.intros thy class 
295 
> pairself (try the_single); 

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

297 
@ the_list assm_axiom; 

25711  298 
val axiom = locale_intro 
299 
> Option.map (Drule.standard o (fn thm => thm OF axiom_premises) o instantiate_class) 

300 
> (fn x as SOME _ => x  NONE => assm_axiom); 

301 
val lift_axiom = case axiom 

302 
of SOME axiom => (fn thm => Thm.implies_elim thm axiom) 

25683  303 
 NONE => I; 
25062  304 

25711  305 
(*dynamic parts of morphism*) 
306 
fun rew_term thy defs = Pattern.rewrite_term thy 

307 
(map (Logic.dest_equals o Thm.prop_of) defs) []; 

308 
fun subst_term thy defs = map_aterms subst_aterm #> rew_term thy defs 

309 
#> map_types subst_typ; 

310 
fun subst_thm defs = Drule.standard' #> instantiate_class #> lift_axiom 

311 
#> MetaSimplifier.rewrite_rule defs; 

312 
fun morphism thy defs = 

313 
Morphism.typ_morphism subst_typ 

314 
$> Morphism.term_morphism (subst_term thy defs) 

315 
$> Morphism.thm_morphism (subst_thm defs); 

316 

317 
(*class rules*) 

318 
val defs = these_defs thy sups; 

25618  319 
val assm_intro = proto_assm_intro 
25711  320 
> Option.map instantiate_base_sort 
321 
> Option.map (MetaSimplifier.rewrite_rule defs) 

25668  322 
> Option.map Goal.close_result; 
25711  323 
val fixate = Thm.instantiate 
324 
(map (pairself (Thm.ctyp_of thy)) [(TVar ((Name.aT, 0), []), TFree (Name.aT, base_sort)), 

325 
(TVar ((Name.aT, 0), base_sort), TFree (Name.aT, base_sort))], []) 

326 
val class_intro = (fixate o #intro o AxClass.get_info thy) class; 

25618  327 
val of_class_sups = if null sups 
25711  328 
then map (fixate o Thm.class_triv thy) base_sort 
329 
else map (fixate o #of_class o the_class_data thy) sups; 

25683  330 
val locale_dests = map Drule.standard' (Locale.dests thy class); 
25711  331 
val num_trivs = case length locale_dests 
332 
of 0 => if is_none axiom then 0 else 1 

333 
 n => n; 

334 
val pred_trivs = if num_trivs = 0 then [] 

335 
else the axiom 

336 
> Thm.prop_of 

337 
> (map_types o map_atyps o K) (TFree (Name.aT, base_sort)) 

338 
> (Thm.assume o Thm.cterm_of thy) 

339 
> replicate num_trivs; 

25668  340 
val of_class = (class_intro OF of_class_sups OF locale_dests OF pred_trivs) 
25711  341 
> Drule.standard' 
25668  342 
> Goal.close_result; 
25711  343 
in (morphism, axiom, assm_intro, of_class) end; 
24589  344 

345 
fun class_interpretation class facts defs thy = 

346 
let 

25038  347 
val params = these_params thy [class]; 
25083  348 
val inst = (#inst o the_class_data thy) class; 
25020  349 
val tac = ALLGOALS (ProofContext.fact_tac facts); 
25038  350 
val prfx = class_prefix class; 
24589  351 
in 
25038  352 
thy 
353 
> 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

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

355 
(inst, map (fn def => (("", []), def)) defs) 
25038  356 
> (fn cs => fold (Sign.add_const_constraint o apsnd SOME) cs) 
24589  357 
end; 
24218  358 

25618  359 
fun prove_subclass (sub, sup) thm thy = 
360 
let 

25711  361 
val of_class = (#of_class o the_class_data thy) sup; 
25683  362 
val intro = Drule.standard' (of_class OF [Drule.standard' thm]); 
25618  363 
val classrel = intro OF (the_list o #axiom o the_class_data thy) sub; 
364 
in 

365 
thy 

366 
> AxClass.add_classrel classrel 

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

368 
I (sub, Locale.Locale sup) 

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

370 
end; 

371 

24218  372 
fun intro_classes_tac facts st = 
373 
let 

374 
val thy = Thm.theory_of_thm st; 

375 
val classes = Sign.all_classes thy; 

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

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

24218  379 
in 
25618  380 
Method.intros_tac (class_trivs @ class_intros @ assm_intros) facts st 
24218  381 
end; 
382 

383 
fun default_intro_classes_tac [] = intro_classes_tac [] 

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

384 
 default_intro_classes_tac _ = no_tac; 
24218  385 

386 
fun default_tac rules ctxt facts = 

387 
HEADGOAL (Method.some_rule_tac rules ctxt facts) ORELSE 

388 
default_intro_classes_tac facts; 

389 

390 
val _ = Context.add_setup (Method.add_methods 

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

392 
"backchain introduction rules of classes"), 

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

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

395 

396 

24589  397 
(** classes and class target **) 
24218  398 

25002  399 
(* class context syntax *) 
24748  400 

25083  401 
structure ClassSyntax = ProofDataFun( 
402 
type T = { 

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

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

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

406 
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

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

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

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

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

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

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

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

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

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

417 
};; 
25083  418 
); 
419 

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

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

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

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

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

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

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

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

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

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

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

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

432 
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

433 
val unchecks = map (fn (c, (_, (ty, t))) => (t, Const (c, ty))) operations; 
25083  434 
in 
435 
ctxt 

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

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

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

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

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

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

442 
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

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

445 
} 
25083  446 
end; 
447 

448 
fun refresh_syntax class ctxt = 

25002  449 
let 
450 
val thy = ProofContext.theory_of ctxt; 

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

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

453 

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

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

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

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

457 
base_sort = base_sort, operations = operations, unchecks = unchecks, passed = true }); 
25083  458 

459 
fun sort_term_check ts ctxt = 

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

461 
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

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

463 
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

464 
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

465 
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

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

467 
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

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

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

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

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

472 
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

473 
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

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

475 
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

476 
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

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

478 
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

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

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

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

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

483 
in if eq_list (op aconv) (ts, ts'') andalso passed then NONE 
25083  484 
else 
485 
ctxt 

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

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

488 
> pair ts'' 
25083  489 
> SOME 
490 
end; 

24748  491 

25083  492 
fun sort_term_uncheck ts ctxt = 
25002  493 
let 
494 
val thy = ProofContext.theory_of ctxt; 

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

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

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

499 
fun init_ctxt sups base_sort ctxt = 
25083  500 
ctxt 
501 
> Variable.declare_term 

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

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

503 
> synchronize_syntax sups base_sort 
25083  504 
> Context.proof_map ( 
505 
Syntax.add_term_check 0 "class" sort_term_check 

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

507 

25311  508 
fun init class thy = 
509 
thy 

510 
> Locale.init class 

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

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

512 

24748  513 

24589  514 
(* class definition *) 
24218  515 

516 
local 

517 

24748  518 
fun gen_class_spec prep_class prep_expr process_expr thy raw_supclasses raw_includes_elems = 
24218  519 
let 
24748  520 
val supclasses = map (prep_class thy) raw_supclasses; 
521 
val supsort = Sign.minimize_sort thy supclasses; 

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

26167  524 
foldr1 (Sorts.inter_sort (Sign.classes_of thy)) 
525 
(map (#base_sort o the_class_data thy) sups); 

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

529 
val supexpr = Locale.Merge suplocales; 

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

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

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

26167  533 
(K (TFree (Name.aT, base_sort))) supparams); 
25683  534 
fun fork_syn (Element.Fixes xs) = 
535 
fold_map (fn (c, ty, syn) => cons (c, syn) #> pair (c, ty, NoSyn)) xs 

536 
#>> Element.Fixes 

537 
 fork_syn x = pair x; 

538 
fun fork_syntax elems = 

539 
let 

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

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

542 
val (elems, global_syntax) = 

543 
ProofContext.init thy 

544 
> Locale.cert_expr supexpr [constrain] 

545 
> snd 

546 
> init_ctxt sups base_sort 

547 
> process_expr Locale.empty raw_elems 

548 
> fst 

549 
> fork_syntax 

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

24748  551 

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

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

554 

25683  555 
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

556 
let 
25683  557 
val supconsts = map fst supparams 
558 
> AList.make (the o AList.lookup (op =) (these_params thy sups)) 

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

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

561 
fun add_const (v, raw_ty) thy = 

562 
let 

563 
val c = Sign.full_name thy v; 

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

565 
val ty0 = Type.strip_sorts ty; 

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

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

568 
in 

569 
thy 

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

571 
> snd 

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

573 
end; 

574 
fun add_consts raw_params thy = 

575 
thy 

576 
> Sign.add_path (Logic.const_of_class bname) 

577 
> fold_map add_const raw_params 

578 
> Sign.restore_naming thy 

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

580 
fun globalize param_map = map_aterms 

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

582 
 t => t); 

583 
val raw_pred = Locale.intros thy class 

584 
> fst 

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

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

587 
of [] => NONE 

588 
 [thm] => SOME thm; 

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

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

590 
thy 
25683  591 
> add_consts ((snd o chop (length supparams)) all_params) 
592 
> (fn (param_map, params) => AxClass.define_class (bname, supsort) 

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

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

595 
#> snd 

596 
#> `get_axiom 

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

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

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

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

600 

25002  601 
fun gen_class prep_spec prep_param bname 
24748  602 
raw_supclasses raw_includes_elems raw_other_consts thy = 
603 
let 

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

607 
val other_consts = map (tap (Sign.the_const_type thy) o prep_param thy) raw_other_consts; 
24218  608 
in 
609 
thy 

24748  610 
> Locale.add_locale_i (SOME "") bname mergeexpr elems 
25038  611 
> snd 
25311  612 
> ProofContext.theory_of 
25683  613 
> adjungate_axclass bname class base_sort sups supsort supparams global_syntax other_consts 
614 
> (fn (param_map, params, assm_axiom) => 

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

25711  616 
#> (fn (morphism, axiom, assm_intro, of_class) => 
25683  617 
add_class_data ((class, sups), (params, base_sort, 
25711  618 
map snd param_map, morphism, axiom, assm_intro, of_class)) 
25683  619 
#> class_interpretation class (the_list axiom) [])) 
25268  620 
> init class 
25038  621 
> pair class 
24218  622 
end; 
623 

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

24218  626 
in 
627 

25326  628 
val class_cmd = gen_class read_class_spec read_const; 
24748  629 
val class = gen_class check_class_spec (K I); 
24218  630 

631 
end; (*local*) 

632 

633 

25485  634 
(* class target *) 
24218  635 

25603  636 
fun declare class pos ((c, mx), dict) thy = 
24218  637 
let 
25024  638 
val prfx = class_prefix class; 
639 
val thy' = thy > Sign.add_path prfx; 

25711  640 
val phi = partial_morphism thy' class; 
25024  641 

25062  642 
val c' = Sign.full_name thy' c; 
25239  643 
val dict' = Morphism.term phi dict; 
644 
val dict_def = map_types Logic.unvarifyT dict'; 

645 
val ty' = Term.fastype_of dict_def; 

25083  646 
val ty'' = Type.strip_sorts ty'; 
25239  647 
val def_eq = Logic.mk_equals (Const (c', ty'), dict_def); 
25618  648 
fun get_axiom thy = ((Thm.varifyT o Thm.symmetric o Thm.get_axiom_i thy) c', thy); 
24218  649 
in 
25024  650 
thy' 
25096  651 
> Sign.declare_const pos (c, ty'', mx) > snd 
25518  652 
> Thm.add_def false false (c, def_eq) 
25062  653 
>> Thm.symmetric 
25618  654 
>> get_axiom 
655 
> (fn (def, def') => class_interpretation class [def] [Thm.prop_of def] 

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

24218  657 
> Sign.restore_naming thy 
25083  658 
> Sign.add_const_constraint (c', SOME ty') 
24218  659 
end; 
660 

25603  661 
fun abbrev class prmode pos ((c, mx), rhs) thy = 
24836  662 
let 
25024  663 
val prfx = class_prefix class; 
25096  664 
val thy' = thy > Sign.add_path prfx; 
25062  665 
val phi = morphism thy class; 
666 

25096  667 
val c' = Sign.full_name thy' c; 
25711  668 
val rhs' = Morphism.term phi rhs; 
25239  669 
val ty' = Logic.unvarifyT (Term.fastype_of rhs'); 
24836  670 
in 
25096  671 
thy' 
25146  672 
> Sign.add_abbrev (#1 prmode) pos (c, map_types Type.strip_sorts rhs') > snd 
25096  673 
> Sign.add_const_constraint (c', SOME ty') 
25024  674 
> 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

675 
> register_operation class (c', (rhs', NONE)) 
25096  676 
> Sign.restore_naming thy 
24836  677 
end; 
678 

25462  679 

680 
(** instantiation target **) 

681 

682 
(* bookkeeping *) 

683 

684 
datatype instantiation = Instantiation of { 

25864  685 
arities: string list * (string * sort) list * sort, 
25462  686 
params: ((string * string) * (string * typ)) list 
25603  687 
(*(instantiation parameter, type constructor), (local instantiation parameter, typ)*) 
25462  688 
} 
689 

690 
structure Instantiation = ProofDataFun 

691 
( 

692 
type T = instantiation 

25536  693 
fun init _ = Instantiation { arities = ([], [], []), params = [] }; 
25462  694 
); 
695 

25485  696 
fun mk_instantiation (arities, params) = 
697 
Instantiation { arities = arities, params = params }; 

25514  698 
fun get_instantiation lthy = case Instantiation.get (LocalTheory.target_of lthy) 
25485  699 
of Instantiation data => data; 
25514  700 
fun map_instantiation f = (LocalTheory.target o Instantiation.map) 
701 
(fn Instantiation { arities, params } => mk_instantiation (f (arities, params))); 

25462  702 

25514  703 
fun the_instantiation lthy = case get_instantiation lthy 
25536  704 
of { arities = ([], [], []), ... } => error "No instantiation target" 
25485  705 
 data => data; 
25462  706 

25485  707 
val instantiation_params = #params o get_instantiation; 
25462  708 

25514  709 
fun instantiation_param lthy v = instantiation_params lthy 
25462  710 
> find_first (fn (_, (v', _)) => v = v') 
711 
> Option.map (fst o fst); 

712 

25514  713 
fun confirm_declaration c = (map_instantiation o apsnd) 
25485  714 
(filter_out (fn (_, (c', _)) => c' = c)); 
715 

25462  716 

717 
(* syntax *) 

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; 

25711  731 
val subst_param = map_aterms (fn t as Const (c, ty) => 
732 
(case AxClass.inst_tyco_of thy (c, ty) 

733 
of SOME tyco => (case AList.lookup (op =) params (c, tyco) 

734 
of SOME v_ty => Free v_ty 

735 
 NONE => t) 

736 
 NONE => t) 

737 
 t => t); 

738 

25462  739 
val improvement = (fold o fold_aterms) check_improve ts Vartab.empty; 
740 
val ts' = (map o map_types) (Envir.typ_subst_TVars improvement) ts; 

25711  741 
val ts'' = map subst_param ts'; 
25514  742 
in if eq_list (op aconv) (ts, ts'') then NONE else SOME (ts'', lthy) end; 
25462  743 

25514  744 
fun inst_term_uncheck ts lthy = 
25462  745 
let 
25514  746 
val params = instantiation_params lthy; 
25462  747 
val ts' = (map o map_aterms) (fn t as Free (v, ty) => 
748 
(case get_first (fn ((c, _), (v', _)) => if v = v' then SOME c else NONE) params 

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

750 
 NONE => t) 

751 
 t => t) ts; 

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

754 

755 
(* target *) 

756 

25485  757 
val sanatize_name = (*FIXME*) 
758 
let 

25574  759 
fun is_valid s = Symbol.is_ascii_letter s orelse Symbol.is_ascii_digit s 
760 
orelse s = "'" orelse s = "_"; 

25485  761 
val is_junk = not o is_valid andf Symbol.is_regular; 
762 
val junk = Scan.many is_junk; 

763 
val scan_valids = Symbol.scanner "Malformed input" 

764 
((junk  

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

766 
 junk)) 

25999  767 
::: Scan.repeat ((Scan.many1 is_valid >> implode)  junk)); 
25485  768 
in 
769 
explode #> scan_valids #> implode 

770 
end; 

771 

25864  772 
fun init_instantiation (tycos, vs, sort) thy = 
25462  773 
let 
25536  774 
val _ = if null tycos then error "At least one arity must be given" else (); 
775 
val _ = map (the_class_data thy) sort; 

25485  776 
fun type_name "*" = "prod" 
777 
 type_name "+" = "sum" 

778 
 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

779 
fun get_param tyco (param, (c, ty)) = if can (AxClass.param_of_inst thy) (c, tyco) 
25603  780 
then NONE else SOME ((c, tyco), 
25864  781 
(param ^ "_" ^ type_name tyco, map_atyps (K (Type (tyco, map TFree vs))) ty)); 
25536  782 
val params = map_product get_param tycos (these_params thy sort) > map_filter I; 
25485  783 
in 
784 
thy 

785 
> ProofContext.init 

25864  786 
> Instantiation.put (mk_instantiation ((tycos, vs, sort), params)) 
787 
> fold (Variable.declare_term o Logic.mk_type o TFree) vs 

25574  788 
> fold (Variable.declare_names o Free o snd) params 
25864  789 
> fold (fn tyco => ProofContext.add_arity (tyco, map snd vs, sort)) tycos 
25485  790 
> Context.proof_map ( 
791 
Syntax.add_term_check 0 "instance" inst_term_check 

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

793 
end; 

794 

795 
fun gen_instantiation_instance do_proof after_qed lthy = 

796 
let 

25864  797 
val (tycos, vs, sort) = (#arities o the_instantiation) lthy; 
798 
val arities_proof = maps (fn tyco => Logic.mk_arities (tyco, map snd vs, sort)) tycos; 

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

801 
#> after_qed; 

802 
in 

803 
lthy 

804 
> do_proof after_qed' arities_proof 

805 
end; 

806 

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

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

25462  813 

814 
fun conclude_instantiation lthy = 

815 
let 

25485  816 
val { arities, params } = the_instantiation lthy; 
25864  817 
val (tycos, vs, sort) = arities; 
25462  818 
val thy = ProofContext.theory_of lthy; 
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25574
diff
changeset

819 
val _ = map (fn tyco => if Sign.of_sort thy 
25864  820 
(Type (tyco, map TFree vs), sort) 
25462  821 
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

822 
tycos; 
25770  823 
(*this checkpoint should move to AxClass as soon as "attach" has disappeared*) 
824 
val _ = case map (fst o snd) params 

825 
of [] => () 

826 
 cs => Output.legacy_feature 

25829  827 
("Missing specifications for overloaded parameters " ^ commas_quote cs) 
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25574
diff
changeset

828 
in lthy end; 
25462  829 

25603  830 
fun pretty_instantiation lthy = 
831 
let 

832 
val { arities, params } = the_instantiation lthy; 

25864  833 
val (tycos, vs, sort) = arities; 
25603  834 
val thy = ProofContext.theory_of lthy; 
25864  835 
fun pr_arity tyco = Syntax.pretty_arity lthy (tyco, map snd vs, sort); 
25603  836 
fun pr_param ((c, _), (v, ty)) = 
25864  837 
(Pretty.block o Pretty.breaks) [Pretty.str v, Pretty.str "==", 
838 
(Pretty.str o Sign.extern_const thy) c, Pretty.str "::", Sign.pretty_typ thy ty]; 

25603  839 
in 
840 
(Pretty.block o Pretty.fbreaks) 

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

842 
end; 

843 

24218  844 
end; 
25683  845 