author | blanchet |
Wed, 04 Mar 2009 10:45:52 +0100 | |
changeset 30240 | 5b25fee0362c |
parent 29288 | 253bcf2a5854 |
child 30688 | 2d1d426e00e4 |
permissions | -rw-r--r-- |
24219 | 1 |
(* Title: Pure/Isar/code_unit.ML |
2 |
Author: Florian Haftmann, TU Muenchen |
|
3 |
||
24844
98c006a30218
certificates for code generator case expressions
haftmann
parents:
24707
diff
changeset
|
4 |
Basic notions of code generation. Auxiliary. |
24219 | 5 |
*) |
6 |
||
7 |
signature CODE_UNIT = |
|
8 |
sig |
|
24844
98c006a30218
certificates for code generator case expressions
haftmann
parents:
24707
diff
changeset
|
9 |
(*generic non-sense*) |
98c006a30218
certificates for code generator case expressions
haftmann
parents:
24707
diff
changeset
|
10 |
val bad_thm: string -> 'a |
28368 | 11 |
val error_thm: ('a -> 'b) -> 'a -> 'b |
12 |
val warning_thm: ('a -> 'b) -> 'a -> 'b option |
|
13 |
val try_thm: ('a -> 'b) -> 'a -> 'b option |
|
24844
98c006a30218
certificates for code generator case expressions
haftmann
parents:
24707
diff
changeset
|
14 |
|
98c006a30218
certificates for code generator case expressions
haftmann
parents:
24707
diff
changeset
|
15 |
(*typ instantiations*) |
26970 | 16 |
val typscheme: theory -> string * typ -> (string * sort) list * typ |
28423 | 17 |
val inst_thm: theory -> sort Vartab.table -> thm -> thm |
18 |
val constrain_thm: theory -> sort -> thm -> thm |
|
24844
98c006a30218
certificates for code generator case expressions
haftmann
parents:
24707
diff
changeset
|
19 |
|
26747
f32fa5f5bdd1
moved 'trivial classes' to foundation of code generator
haftmann
parents:
26618
diff
changeset
|
20 |
(*constant aliasses*) |
26354 | 21 |
val add_const_alias: thm -> theory -> theory |
28346
b8390cd56b8f
discontinued special treatment of op = vs. eq_class.eq
haftmann
parents:
28310
diff
changeset
|
22 |
val triv_classes: theory -> class list |
26747
f32fa5f5bdd1
moved 'trivial classes' to foundation of code generator
haftmann
parents:
26618
diff
changeset
|
23 |
val resubst_alias: theory -> string -> string |
f32fa5f5bdd1
moved 'trivial classes' to foundation of code generator
haftmann
parents:
26618
diff
changeset
|
24 |
|
f32fa5f5bdd1
moved 'trivial classes' to foundation of code generator
haftmann
parents:
26618
diff
changeset
|
25 |
(*constants*) |
24219 | 26 |
val string_of_typ: theory -> typ -> string |
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
27 |
val string_of_const: theory -> string -> string |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
28 |
val no_args: theory -> string -> int |
26112 | 29 |
val check_const: theory -> term -> string |
24219 | 30 |
val read_bare_const: theory -> string -> string * typ |
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
31 |
val read_const: theory -> string -> string |
24219 | 32 |
|
24844
98c006a30218
certificates for code generator case expressions
haftmann
parents:
24707
diff
changeset
|
33 |
(*constructor sets*) |
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
34 |
val constrset_of_consts: theory -> (string * typ) list |
24219 | 35 |
-> string * ((string * sort) list * (string * typ list) list) |
36 |
||
30240 | 37 |
(*code equations*) |
28423 | 38 |
val assert_eqn: theory -> thm -> thm |
39 |
val mk_eqn: theory -> thm -> thm * bool |
|
28708
a1a436f09ec6
explicit check for pattern discipline before code translation
haftmann
parents:
28704
diff
changeset
|
40 |
val assert_linear: (string -> bool) -> thm * bool -> thm * bool |
28423 | 41 |
val const_eqn: thm -> string |
42 |
val const_typ_eqn: thm -> string * typ |
|
43 |
val head_eqn: theory -> thm -> string * ((string * sort) list * typ) |
|
44 |
val expand_eta: theory -> int -> thm -> thm |
|
28368 | 45 |
val rewrite_eqn: simpset -> thm -> thm |
27582 | 46 |
val rewrite_head: thm list -> thm -> thm |
28423 | 47 |
val norm_args: theory -> thm list -> thm list |
48 |
val norm_varnames: theory -> (string -> string) -> (string -> string) -> thm list -> thm list |
|
24844
98c006a30218
certificates for code generator case expressions
haftmann
parents:
24707
diff
changeset
|
49 |
|
98c006a30218
certificates for code generator case expressions
haftmann
parents:
24707
diff
changeset
|
50 |
(*case certificates*) |
98c006a30218
certificates for code generator case expressions
haftmann
parents:
24707
diff
changeset
|
51 |
val case_cert: thm -> string * (int * string list) |
24219 | 52 |
end; |
53 |
||
28054 | 54 |
structure Code_Unit: CODE_UNIT = |
24219 | 55 |
struct |
56 |
||
57 |
||
58 |
(* auxiliary *) |
|
59 |
||
60 |
exception BAD_THM of string; |
|
61 |
fun bad_thm msg = raise BAD_THM msg; |
|
62 |
fun error_thm f thm = f thm handle BAD_THM msg => error msg; |
|
63 |
fun warning_thm f thm = SOME (f thm) handle BAD_THM msg |
|
64 |
=> (warning ("code generator: " ^ msg); NONE); |
|
24624
b8383b1bbae3
distinction between regular and default code theorems
haftmann
parents:
24423
diff
changeset
|
65 |
fun try_thm f thm = SOME (f thm) handle BAD_THM _ => NONE; |
24219 | 66 |
|
26939
1035c89b4c02
moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents:
26747
diff
changeset
|
67 |
fun string_of_typ thy = setmp show_sorts true (Syntax.string_of_typ_global thy); |
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25540
diff
changeset
|
68 |
fun string_of_const thy c = case AxClass.inst_of_param thy c |
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
69 |
of SOME (c, tyco) => Sign.extern_const thy c ^ " " ^ enclose "[" "]" (Sign.extern_type thy tyco) |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
70 |
| NONE => Sign.extern_const thy c; |
24219 | 71 |
|
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
72 |
fun no_args thy = length o fst o strip_type o Sign.the_const_type thy; |
24219 | 73 |
|
26354 | 74 |
|
75 |
(* utilities *) |
|
76 |
||
26970 | 77 |
fun typscheme thy (c, ty) = |
78 |
let |
|
30240 | 79 |
val ty' = Logic.unvarifyT ty; |
80 |
fun dest (TFree (v, sort)) = (v, sort) |
|
26970 | 81 |
| dest ty = error ("Illegal type parameter in type scheme: " ^ Syntax.string_of_typ_global thy ty); |
30240 | 82 |
val vs = map dest (Sign.const_typargs thy (c, ty')); |
83 |
in (vs, Type.strip_sorts ty') end; |
|
26970 | 84 |
|
28423 | 85 |
fun inst_thm thy tvars' thm = |
26354 | 86 |
let |
87 |
val tvars = (Term.add_tvars o Thm.prop_of) thm []; |
|
28310 | 88 |
val inter_sort = Sorts.inter_sort (Sign.classes_of thy); |
89 |
fun mk_inst (tvar as (v, sort)) = case Vartab.lookup tvars' v |
|
90 |
of SOME sort' => SOME (pairself (Thm.ctyp_of thy o TVar) |
|
91 |
(tvar, (v, inter_sort (sort, sort')))) |
|
26354 | 92 |
| NONE => NONE; |
93 |
val insts = map_filter mk_inst tvars; |
|
94 |
in Thm.instantiate (insts, []) thm end; |
|
95 |
||
28423 | 96 |
fun constrain_thm thy sort thm = |
26354 | 97 |
let |
98 |
val constrain = curry (Sorts.inter_sort (Sign.classes_of thy)) sort |
|
99 |
val tvars = (Term.add_tvars o Thm.prop_of) thm []; |
|
100 |
fun mk_inst (tvar as (v, sort)) = pairself (Thm.ctyp_of thy o TVar o pair v) |
|
101 |
(sort, constrain sort) |
|
102 |
val insts = map mk_inst tvars; |
|
103 |
in Thm.instantiate (insts, []) thm end; |
|
104 |
||
28423 | 105 |
fun expand_eta thy k thm = |
26354 | 106 |
let |
107 |
val (lhs, rhs) = (Logic.dest_equals o Thm.plain_prop_of) thm; |
|
108 |
val (head, args) = strip_comb lhs; |
|
109 |
val l = if k = ~1 |
|
110 |
then (length o fst o strip_abs) rhs |
|
111 |
else Int.max (0, k - length args); |
|
112 |
val used = Name.make_context (map (fst o fst) (Term.add_vars lhs [])); |
|
113 |
fun get_name _ 0 = pair [] |
|
114 |
| get_name (Abs (v, ty, t)) k = |
|
115 |
Name.variants [v] |
|
116 |
##>> get_name t (k - 1) |
|
117 |
#>> (fn ([v'], vs') => (v', ty) :: vs') |
|
118 |
| get_name t k = |
|
119 |
let |
|
120 |
val (tys, _) = (strip_type o fastype_of) t |
|
121 |
in case tys |
|
122 |
of [] => raise TERM ("expand_eta", [t]) |
|
123 |
| ty :: _ => |
|
124 |
Name.variants [""] |
|
125 |
#-> (fn [v] => get_name (t $ Var ((v, 0), ty)) (k - 1) |
|
126 |
#>> (fn vs' => (v, ty) :: vs')) |
|
127 |
end; |
|
128 |
val (vs, _) = get_name rhs l used; |
|
129 |
fun expand (v, ty) thm = Drule.fun_cong_rule thm |
|
130 |
(Thm.cterm_of thy (Var ((v, 0), ty))); |
|
131 |
in |
|
132 |
thm |
|
133 |
|> fold expand vs |
|
134 |
|> Conv.fconv_rule Drule.beta_eta_conversion |
|
135 |
end; |
|
136 |
||
28368 | 137 |
fun eqn_conv conv = |
26354 | 138 |
let |
139 |
fun lhs_conv ct = if can Thm.dest_comb ct |
|
140 |
then (Conv.combination_conv lhs_conv conv) ct |
|
141 |
else Conv.all_conv ct; |
|
142 |
in Conv.combination_conv (Conv.arg_conv lhs_conv) conv end; |
|
143 |
||
144 |
fun head_conv conv = |
|
145 |
let |
|
146 |
fun lhs_conv ct = if can Thm.dest_comb ct |
|
147 |
then (Conv.fun_conv lhs_conv) ct |
|
148 |
else conv ct; |
|
149 |
in Conv.fun_conv (Conv.arg_conv lhs_conv) end; |
|
150 |
||
28368 | 151 |
val rewrite_eqn = Conv.fconv_rule o eqn_conv o Simplifier.rewrite; |
26354 | 152 |
val rewrite_head = Conv.fconv_rule o head_conv o MetaSimplifier.rewrite false; |
153 |
||
28423 | 154 |
fun norm_args thy thms = |
26354 | 155 |
let |
156 |
val num_args_of = length o snd o strip_comb o fst o Logic.dest_equals; |
|
28310 | 157 |
val k = fold (curry Int.max o num_args_of o Thm.prop_of) thms 0; |
26354 | 158 |
in |
159 |
thms |
|
28423 | 160 |
|> map (expand_eta thy k) |
26354 | 161 |
|> map (Conv.fconv_rule Drule.beta_eta_conversion) |
162 |
end; |
|
163 |
||
28423 | 164 |
fun canonical_tvars thy purify_tvar thm = |
26354 | 165 |
let |
28423 | 166 |
val ctyp = Thm.ctyp_of thy; |
26354 | 167 |
fun tvars_subst_for thm = (fold_types o fold_atyps) |
168 |
(fn TVar (v_i as (v, _), sort) => let |
|
169 |
val v' = purify_tvar v |
|
170 |
in if v = v' then I |
|
171 |
else insert (op =) (v_i, (v', sort)) end |
|
172 |
| _ => I) (prop_of thm) []; |
|
173 |
fun mk_inst (v_i, (v', sort)) (maxidx, acc) = |
|
174 |
let |
|
175 |
val ty = TVar (v_i, sort) |
|
176 |
in |
|
177 |
(maxidx + 1, (ctyp ty, ctyp (TVar ((v', maxidx), sort))) :: acc) |
|
178 |
end; |
|
179 |
val maxidx = Thm.maxidx_of thm + 1; |
|
180 |
val (_, inst) = fold mk_inst (tvars_subst_for thm) (maxidx + 1, []); |
|
181 |
in Thm.instantiate (inst, []) thm end; |
|
182 |
||
28423 | 183 |
fun canonical_vars thy purify_var thm = |
26354 | 184 |
let |
28423 | 185 |
val cterm = Thm.cterm_of thy; |
26354 | 186 |
fun vars_subst_for thm = fold_aterms |
187 |
(fn Var (v_i as (v, _), ty) => let |
|
188 |
val v' = purify_var v |
|
189 |
in if v = v' then I |
|
190 |
else insert (op =) (v_i, (v', ty)) end |
|
191 |
| _ => I) (prop_of thm) []; |
|
192 |
fun mk_inst (v_i as (v, i), (v', ty)) (maxidx, acc) = |
|
193 |
let |
|
194 |
val t = Var (v_i, ty) |
|
195 |
in |
|
196 |
(maxidx + 1, (cterm t, cterm (Var ((v', maxidx), ty))) :: acc) |
|
197 |
end; |
|
198 |
val maxidx = Thm.maxidx_of thm + 1; |
|
199 |
val (_, inst) = fold mk_inst (vars_subst_for thm) (maxidx + 1, []); |
|
200 |
in Thm.instantiate ([], inst) thm end; |
|
201 |
||
202 |
fun canonical_absvars purify_var thm = |
|
203 |
let |
|
204 |
val t = Thm.plain_prop_of thm; |
|
205 |
val t' = Term.map_abs_vars purify_var t; |
|
206 |
in Thm.rename_boundvars t t' thm end; |
|
207 |
||
28423 | 208 |
fun norm_varnames thy purify_tvar purify_var thms = |
26354 | 209 |
let |
210 |
fun burrow_thms f [] = [] |
|
211 |
| burrow_thms f thms = |
|
212 |
thms |
|
213 |
|> Conjunction.intr_balanced |
|
214 |
|> f |
|
215 |
|> Conjunction.elim_balanced (length thms) |
|
216 |
in |
|
217 |
thms |
|
28423 | 218 |
|> burrow_thms (canonical_tvars thy purify_tvar) |
219 |
|> map (canonical_vars thy purify_var) |
|
26354 | 220 |
|> map (canonical_absvars purify_var) |
221 |
|> map Drule.zero_var_indexes |
|
222 |
end; |
|
223 |
||
28346
b8390cd56b8f
discontinued special treatment of op = vs. eq_class.eq
haftmann
parents:
28310
diff
changeset
|
224 |
|
26354 | 225 |
(* const aliasses *) |
226 |
||
227 |
structure ConstAlias = TheoryDataFun |
|
228 |
( |
|
26747
f32fa5f5bdd1
moved 'trivial classes' to foundation of code generator
haftmann
parents:
26618
diff
changeset
|
229 |
type T = ((string * string) * thm) list * class list; |
f32fa5f5bdd1
moved 'trivial classes' to foundation of code generator
haftmann
parents:
26618
diff
changeset
|
230 |
val empty = ([], []); |
26354 | 231 |
val copy = I; |
26618 | 232 |
val extend = I; |
29288 | 233 |
fun merge _ ((alias1, classes1), (alias2, classes2)) : T = |
26747
f32fa5f5bdd1
moved 'trivial classes' to foundation of code generator
haftmann
parents:
26618
diff
changeset
|
234 |
(Library.merge (eq_snd Thm.eq_thm_prop) (alias1, alias2), |
f32fa5f5bdd1
moved 'trivial classes' to foundation of code generator
haftmann
parents:
26618
diff
changeset
|
235 |
Library.merge (op =) (classes1, classes2)); |
26354 | 236 |
); |
237 |
||
28423 | 238 |
fun add_const_alias thm thy = |
26354 | 239 |
let |
28423 | 240 |
val lhs_rhs = case try Logic.dest_equals (Thm.prop_of thm) |
26354 | 241 |
of SOME lhs_rhs => lhs_rhs |
242 |
| _ => error ("Not an equation: " ^ Display.string_of_thm thm); |
|
243 |
val c_c' = case try (pairself (AxClass.unoverload_const thy o dest_Const)) lhs_rhs |
|
244 |
of SOME c_c' => c_c' |
|
245 |
| _ => error ("Not an equation with two constants: " ^ Display.string_of_thm thm); |
|
26747
f32fa5f5bdd1
moved 'trivial classes' to foundation of code generator
haftmann
parents:
26618
diff
changeset
|
246 |
val some_class = the_list (AxClass.class_of_param thy (snd c_c')); |
28423 | 247 |
in thy |> |
26747
f32fa5f5bdd1
moved 'trivial classes' to foundation of code generator
haftmann
parents:
26618
diff
changeset
|
248 |
ConstAlias.map (fn (alias, classes) => |
f32fa5f5bdd1
moved 'trivial classes' to foundation of code generator
haftmann
parents:
26618
diff
changeset
|
249 |
((c_c', thm) :: alias, fold (insert (op =)) some_class classes)) |
f32fa5f5bdd1
moved 'trivial classes' to foundation of code generator
haftmann
parents:
26618
diff
changeset
|
250 |
end; |
26354 | 251 |
|
26747
f32fa5f5bdd1
moved 'trivial classes' to foundation of code generator
haftmann
parents:
26618
diff
changeset
|
252 |
fun resubst_alias thy = |
f32fa5f5bdd1
moved 'trivial classes' to foundation of code generator
haftmann
parents:
26618
diff
changeset
|
253 |
let |
f32fa5f5bdd1
moved 'trivial classes' to foundation of code generator
haftmann
parents:
26618
diff
changeset
|
254 |
val alias = fst (ConstAlias.get thy); |
f32fa5f5bdd1
moved 'trivial classes' to foundation of code generator
haftmann
parents:
26618
diff
changeset
|
255 |
val subst_inst_param = Option.map fst o AxClass.inst_of_param thy; |
f32fa5f5bdd1
moved 'trivial classes' to foundation of code generator
haftmann
parents:
26618
diff
changeset
|
256 |
fun subst_alias c = |
f32fa5f5bdd1
moved 'trivial classes' to foundation of code generator
haftmann
parents:
26618
diff
changeset
|
257 |
get_first (fn ((c', c''), _) => if c = c'' then SOME c' else NONE) alias; |
f32fa5f5bdd1
moved 'trivial classes' to foundation of code generator
haftmann
parents:
26618
diff
changeset
|
258 |
in |
f32fa5f5bdd1
moved 'trivial classes' to foundation of code generator
haftmann
parents:
26618
diff
changeset
|
259 |
perhaps subst_inst_param |
f32fa5f5bdd1
moved 'trivial classes' to foundation of code generator
haftmann
parents:
26618
diff
changeset
|
260 |
#> perhaps subst_alias |
f32fa5f5bdd1
moved 'trivial classes' to foundation of code generator
haftmann
parents:
26618
diff
changeset
|
261 |
end; |
f32fa5f5bdd1
moved 'trivial classes' to foundation of code generator
haftmann
parents:
26618
diff
changeset
|
262 |
|
f32fa5f5bdd1
moved 'trivial classes' to foundation of code generator
haftmann
parents:
26618
diff
changeset
|
263 |
val triv_classes = snd o ConstAlias.get; |
f32fa5f5bdd1
moved 'trivial classes' to foundation of code generator
haftmann
parents:
26618
diff
changeset
|
264 |
|
28346
b8390cd56b8f
discontinued special treatment of op = vs. eq_class.eq
haftmann
parents:
28310
diff
changeset
|
265 |
|
26610 | 266 |
(* reading constants as terms *) |
24219 | 267 |
|
26112 | 268 |
fun check_bare_const thy t = case try dest_Const t |
269 |
of SOME c_ty => c_ty |
|
26939
1035c89b4c02
moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents:
26747
diff
changeset
|
270 |
| NONE => error ("Not a constant: " ^ Syntax.string_of_term_global thy t); |
26112 | 271 |
|
28346
b8390cd56b8f
discontinued special treatment of op = vs. eq_class.eq
haftmann
parents:
28310
diff
changeset
|
272 |
fun check_const thy = AxClass.unoverload_const thy o check_bare_const thy; |
26112 | 273 |
|
274 |
fun read_bare_const thy = check_bare_const thy o Syntax.read_term_global thy; |
|
24219 | 275 |
|
28346
b8390cd56b8f
discontinued special treatment of op = vs. eq_class.eq
haftmann
parents:
28310
diff
changeset
|
276 |
fun read_const thy = AxClass.unoverload_const thy o read_bare_const thy; |
24219 | 277 |
|
278 |
||
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
279 |
(* constructor sets *) |
24219 | 280 |
|
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
281 |
fun constrset_of_consts thy cs = |
24219 | 282 |
let |
28704
8703d17c5e68
assert that no class parameter is used as constructor
haftmann
parents:
28423
diff
changeset
|
283 |
val _ = map (fn (c, _) => if (is_some o AxClass.class_of_param thy) c |
8703d17c5e68
assert that no class parameter is used as constructor
haftmann
parents:
28423
diff
changeset
|
284 |
then error ("Is a class parameter: " ^ string_of_const thy c) else ()) cs; |
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
285 |
fun no_constr (c, ty) = error ("Not a datatype constructor: " ^ string_of_const thy c |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
286 |
^ " :: " ^ string_of_typ thy ty); |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
287 |
fun last_typ c_ty ty = |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
288 |
let |
29270
0eade173f77e
moved old add_type_XXX, add_term_XXX etc. to structure OldTerm;
wenzelm
parents:
28708
diff
changeset
|
289 |
val frees = OldTerm.typ_tfrees ty; |
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
290 |
val (tyco, vs) = ((apsnd o map) (dest_TFree) o dest_Type o snd o strip_type) ty |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
291 |
handle TYPE _ => no_constr c_ty |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
292 |
val _ = if has_duplicates (eq_fst (op =)) vs then no_constr c_ty else (); |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
293 |
val _ = if length frees <> length vs then no_constr c_ty else (); |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
294 |
in (tyco, vs) end; |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
295 |
fun ty_sorts (c, ty) = |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
296 |
let |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
297 |
val ty_decl = (Logic.unvarifyT o Sign.the_const_type thy) c; |
26970 | 298 |
val (tyco, _) = last_typ (c, ty) ty_decl; |
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
299 |
val (_, vs) = last_typ (c, ty) ty; |
28015 | 300 |
in ((tyco, map snd vs), (c, (map fst vs, ty))) end; |
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
301 |
fun add ((tyco', sorts'), c) ((tyco, sorts), cs) = |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
302 |
let |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
303 |
val _ = if tyco' <> tyco |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
304 |
then error "Different type constructors in constructor set" |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
305 |
else (); |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
306 |
val sorts'' = map2 (curry (Sorts.inter_sort (Sign.classes_of thy))) sorts' sorts |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
307 |
in ((tyco, sorts), c :: cs) end; |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
308 |
fun inst vs' (c, (vs, ty)) = |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
309 |
let |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
310 |
val the_v = the o AList.lookup (op =) (vs ~~ vs'); |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
311 |
val ty' = map_atyps (fn TFree (v, _) => TFree (the_v v)) ty; |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
312 |
in (c, (fst o strip_type) ty') end; |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
313 |
val c' :: cs' = map ty_sorts cs; |
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
314 |
val ((tyco, sorts), cs'') = fold add cs' (apsnd single c'); |
24848 | 315 |
val vs = Name.names Name.context Name.aT sorts; |
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24219
diff
changeset
|
316 |
val cs''' = map (inst vs) cs''; |
30240 | 317 |
in (tyco, (vs, rev cs''')) end; |
24219 | 318 |
|
319 |
||
30240 | 320 |
(* code equations *) |
24219 | 321 |
|
28423 | 322 |
fun assert_eqn thy thm = |
24219 | 323 |
let |
324 |
val (lhs, rhs) = (Logic.dest_equals o Thm.plain_prop_of) thm |
|
325 |
handle TERM _ => bad_thm ("Not an equation: " ^ Display.string_of_thm thm) |
|
326 |
| THM _ => bad_thm ("Not an equation: " ^ Display.string_of_thm thm); |
|
327 |
fun vars_of t = fold_aterms |
|
328 |
(fn Var (v, _) => insert (op =) v |
|
329 |
| Free _ => bad_thm ("Illegal free variable in rewrite theorem\n" |
|
330 |
^ Display.string_of_thm thm) |
|
331 |
| _ => I) t []; |
|
332 |
fun tvars_of t = fold_term_types |
|
333 |
(fn _ => fold_atyps (fn TVar (v, _) => insert (op =) v |
|
334 |
| TFree _ => bad_thm |
|
335 |
("Illegal free type variable in rewrite theorem\n" ^ Display.string_of_thm thm))) t []; |
|
336 |
val lhs_vs = vars_of lhs; |
|
337 |
val rhs_vs = vars_of rhs; |
|
338 |
val lhs_tvs = tvars_of lhs; |
|
339 |
val rhs_tvs = tvars_of lhs; |
|
340 |
val _ = if null (subtract (op =) lhs_vs rhs_vs) |
|
341 |
then () |
|
342 |
else bad_thm ("Free variables on right hand side of rewrite theorem\n" |
|
343 |
^ Display.string_of_thm thm); |
|
344 |
val _ = if null (subtract (op =) lhs_tvs rhs_tvs) |
|
345 |
then () |
|
346 |
else bad_thm ("Free type variables on right hand side of rewrite theorem\n" |
|
28423 | 347 |
^ Display.string_of_thm thm) val (head, args) = (strip_comb o fst o Logic.dest_equals o Thm.plain_prop_of) thm; |
348 |
val (c, ty) = case head of Const c_ty => c_ty | _ => |
|
24219 | 349 |
bad_thm ("Equation not headed by constant\n" ^ Display.string_of_thm thm); |
350 |
fun check _ (Abs _) = bad_thm |
|
351 |
("Abstraction on left hand side of equation\n" |
|
352 |
^ Display.string_of_thm thm) |
|
353 |
| check 0 (Var _) = () |
|
354 |
| check _ (Var _) = bad_thm |
|
30240 | 355 |
("Variable with application on left hand side of code equation\n" |
24219 | 356 |
^ Display.string_of_thm thm) |
357 |
| check n (t1 $ t2) = (check (n+1) t1; check 0 t2) |
|
358 |
| check n (Const (_, ty)) = if n <> (length o fst o strip_type) ty |
|
359 |
then bad_thm |
|
360 |
("Partially applied constant on left hand side of equation\n" |
|
361 |
^ Display.string_of_thm thm) |
|
362 |
else (); |
|
363 |
val _ = map (check 0) args; |
|
28423 | 364 |
val ty_decl = Sign.the_const_type thy c; |
365 |
val _ = if Sign.typ_equiv thy (Type.strip_sorts ty_decl, Type.strip_sorts ty) |
|
366 |
then () else bad_thm ("Type\n" ^ string_of_typ thy ty |
|
30240 | 367 |
^ "\nof code equation\n" |
28423 | 368 |
^ Display.string_of_thm thm |
369 |
^ "\nis incompatible with declared function type\n" |
|
370 |
^ string_of_typ thy ty_decl) |
|
371 |
in thm end; |
|
24219 | 372 |
|
28423 | 373 |
fun add_linear thm = |
24219 | 374 |
let |
28423 | 375 |
val (_, args) = (strip_comb o fst o Logic.dest_equals o Thm.plain_prop_of) thm; |
376 |
val linear = not (has_duplicates (op =) |
|
377 |
((fold o fold_aterms) (fn Var (v, _) => cons v | _ => I) args [])) |
|
378 |
in (thm, linear) end; |
|
379 |
||
28708
a1a436f09ec6
explicit check for pattern discipline before code translation
haftmann
parents:
28704
diff
changeset
|
380 |
fun assert_pat is_cons thm = |
a1a436f09ec6
explicit check for pattern discipline before code translation
haftmann
parents:
28704
diff
changeset
|
381 |
let |
a1a436f09ec6
explicit check for pattern discipline before code translation
haftmann
parents:
28704
diff
changeset
|
382 |
val args = (snd o strip_comb o fst o Logic.dest_equals o Thm.plain_prop_of) thm; |
a1a436f09ec6
explicit check for pattern discipline before code translation
haftmann
parents:
28704
diff
changeset
|
383 |
val _ = (map o map_aterms) (fn t as Const (c, _) => if is_cons c then t |
a1a436f09ec6
explicit check for pattern discipline before code translation
haftmann
parents:
28704
diff
changeset
|
384 |
else bad_thm ("Not a constructor on left hand side of equation: " |
a1a436f09ec6
explicit check for pattern discipline before code translation
haftmann
parents:
28704
diff
changeset
|
385 |
^ quote c ^ ",\n in equation\n" ^ Display.string_of_thm thm) |
a1a436f09ec6
explicit check for pattern discipline before code translation
haftmann
parents:
28704
diff
changeset
|
386 |
| t => t) args; |
a1a436f09ec6
explicit check for pattern discipline before code translation
haftmann
parents:
28704
diff
changeset
|
387 |
in thm end; |
a1a436f09ec6
explicit check for pattern discipline before code translation
haftmann
parents:
28704
diff
changeset
|
388 |
|
a1a436f09ec6
explicit check for pattern discipline before code translation
haftmann
parents:
28704
diff
changeset
|
389 |
fun assert_linear is_cons (thm, false) = (thm, false) |
a1a436f09ec6
explicit check for pattern discipline before code translation
haftmann
parents:
28704
diff
changeset
|
390 |
| assert_linear is_cons (thm, true) = if snd (add_linear (assert_pat is_cons thm)) then (thm, true) |
28423 | 391 |
else bad_thm |
30240 | 392 |
("Duplicate variables on left hand side of code equation:\n" |
28423 | 393 |
^ Display.string_of_thm thm); |
394 |
||
395 |
||
396 |
fun mk_eqn thy = add_linear o assert_eqn thy o AxClass.unoverload thy |
|
397 |
o LocalDefs.meta_rewrite_rule (ProofContext.init thy); |
|
398 |
||
399 |
val const_typ_eqn = dest_Const o fst o strip_comb o fst o Logic.dest_equals o Thm.plain_prop_of; |
|
400 |
val const_eqn = fst o const_typ_eqn; |
|
401 |
fun head_eqn thy thm = let val (c, ty) = const_typ_eqn thm in (c, typscheme thy (c, ty)) end; |
|
24219 | 402 |
|
403 |
||
24844
98c006a30218
certificates for code generator case expressions
haftmann
parents:
24707
diff
changeset
|
404 |
(* case cerificates *) |
98c006a30218
certificates for code generator case expressions
haftmann
parents:
24707
diff
changeset
|
405 |
|
24917 | 406 |
fun case_certificate thm = |
24844
98c006a30218
certificates for code generator case expressions
haftmann
parents:
24707
diff
changeset
|
407 |
let |
24917 | 408 |
val ((head, raw_case_expr), cases) = (apfst Logic.dest_equals |
409 |
o apsnd Logic.dest_conjunctions o Logic.dest_implies o Thm.prop_of) thm; |
|
24844
98c006a30218
certificates for code generator case expressions
haftmann
parents:
24707
diff
changeset
|
410 |
val _ = case head of Free _ => true |
98c006a30218
certificates for code generator case expressions
haftmann
parents:
24707
diff
changeset
|
411 |
| Var _ => true |
98c006a30218
certificates for code generator case expressions
haftmann
parents:
24707
diff
changeset
|
412 |
| _ => raise TERM ("case_cert", []); |
24917 | 413 |
val ([(case_var, _)], case_expr) = Term.strip_abs_eta 1 raw_case_expr; |
414 |
val (Const (case_const, _), raw_params) = strip_comb case_expr; |
|
415 |
val n = find_index (fn Free (v, _) => v = case_var | _ => false) raw_params; |
|
416 |
val _ = if n = ~1 then raise TERM ("case_cert", []) else (); |
|
417 |
val params = map (fst o dest_Var) (nth_drop n raw_params); |
|
418 |
fun dest_case t = |
|
24844
98c006a30218
certificates for code generator case expressions
haftmann
parents:
24707
diff
changeset
|
419 |
let |
98c006a30218
certificates for code generator case expressions
haftmann
parents:
24707
diff
changeset
|
420 |
val (head' $ t_co, rhs) = Logic.dest_equals t; |
98c006a30218
certificates for code generator case expressions
haftmann
parents:
24707
diff
changeset
|
421 |
val _ = if head' = head then () else raise TERM ("case_cert", []); |
98c006a30218
certificates for code generator case expressions
haftmann
parents:
24707
diff
changeset
|
422 |
val (Const (co, _), args) = strip_comb t_co; |
98c006a30218
certificates for code generator case expressions
haftmann
parents:
24707
diff
changeset
|
423 |
val (Var (param, _), args') = strip_comb rhs; |
98c006a30218
certificates for code generator case expressions
haftmann
parents:
24707
diff
changeset
|
424 |
val _ = if args' = args then () else raise TERM ("case_cert", []); |
98c006a30218
certificates for code generator case expressions
haftmann
parents:
24707
diff
changeset
|
425 |
in (param, co) end; |
24917 | 426 |
fun analyze_cases cases = |
24844
98c006a30218
certificates for code generator case expressions
haftmann
parents:
24707
diff
changeset
|
427 |
let |
24917 | 428 |
val co_list = fold (AList.update (op =) o dest_case) cases []; |
24844
98c006a30218
certificates for code generator case expressions
haftmann
parents:
24707
diff
changeset
|
429 |
in map (the o AList.lookup (op =) co_list) params end; |
98c006a30218
certificates for code generator case expressions
haftmann
parents:
24707
diff
changeset
|
430 |
fun analyze_let t = |
98c006a30218
certificates for code generator case expressions
haftmann
parents:
24707
diff
changeset
|
431 |
let |
98c006a30218
certificates for code generator case expressions
haftmann
parents:
24707
diff
changeset
|
432 |
val (head' $ arg, Var (param', _) $ arg') = Logic.dest_equals t; |
98c006a30218
certificates for code generator case expressions
haftmann
parents:
24707
diff
changeset
|
433 |
val _ = if head' = head then () else raise TERM ("case_cert", []); |
98c006a30218
certificates for code generator case expressions
haftmann
parents:
24707
diff
changeset
|
434 |
val _ = if arg' = arg then () else raise TERM ("case_cert", []); |
98c006a30218
certificates for code generator case expressions
haftmann
parents:
24707
diff
changeset
|
435 |
val _ = if [param'] = params then () else raise TERM ("case_cert", []); |
98c006a30218
certificates for code generator case expressions
haftmann
parents:
24707
diff
changeset
|
436 |
in [] end; |
24917 | 437 |
fun analyze (cases as [let_case]) = |
438 |
(analyze_cases cases handle Bind => analyze_let let_case) |
|
439 |
| analyze cases = analyze_cases cases; |
|
440 |
in (case_const, (n, analyze cases)) end; |
|
441 |
||
442 |
fun case_cert thm = case_certificate thm |
|
443 |
handle Bind => error "bad case certificate" |
|
28346
b8390cd56b8f
discontinued special treatment of op = vs. eq_class.eq
haftmann
parents:
28310
diff
changeset
|
444 |
| TERM _ => error "bad case certificate"; |
24844
98c006a30218
certificates for code generator case expressions
haftmann
parents:
24707
diff
changeset
|
445 |
|
24219 | 446 |
end; |