haftmann@37743
|
1 |
(* Title: Tools/Code/code_thingol.ML
|
haftmann@24219
|
2 |
Author: Florian Haftmann, TU Muenchen
|
haftmann@24219
|
3 |
|
haftmann@24219
|
4 |
Intermediate language ("Thin-gol") representing executable code.
|
haftmann@24918
|
5 |
Representation and translation.
|
haftmann@24219
|
6 |
*)
|
haftmann@24219
|
7 |
|
haftmann@24219
|
8 |
infix 8 `%%;
|
haftmann@24219
|
9 |
infix 4 `$;
|
haftmann@24219
|
10 |
infix 4 `$$;
|
haftmann@31724
|
11 |
infixr 3 `|=>;
|
haftmann@31724
|
12 |
infixr 3 `|==>;
|
haftmann@24219
|
13 |
|
haftmann@24219
|
14 |
signature BASIC_CODE_THINGOL =
|
haftmann@24219
|
15 |
sig
|
haftmann@24219
|
16 |
type vname = string;
|
haftmann@24219
|
17 |
datatype dict =
|
haftmann@24219
|
18 |
DictConst of string * dict list list
|
haftmann@24219
|
19 |
| DictVar of string list * (vname * (int * int));
|
haftmann@24219
|
20 |
datatype itype =
|
haftmann@24219
|
21 |
`%% of string * itype list
|
haftmann@24219
|
22 |
| ITyVar of vname;
|
haftmann@31049
|
23 |
type const = string * ((itype list * dict list list) * itype list (*types of arguments*))
|
haftmann@24219
|
24 |
datatype iterm =
|
haftmann@24591
|
25 |
IConst of const
|
haftmann@31889
|
26 |
| IVar of vname option
|
haftmann@24219
|
27 |
| `$ of iterm * iterm
|
haftmann@31888
|
28 |
| `|=> of (vname option * itype) * iterm
|
haftmann@24219
|
29 |
| ICase of ((iterm * itype) * (iterm * iterm) list) * iterm;
|
haftmann@24219
|
30 |
(*((term, type), [(selector pattern, body term )]), primitive term)*)
|
haftmann@24219
|
31 |
val `$$ : iterm * iterm list -> iterm;
|
haftmann@31888
|
32 |
val `|==> : (vname option * itype) list * iterm -> iterm;
|
haftmann@24219
|
33 |
type typscheme = (vname * sort) list * itype;
|
haftmann@24219
|
34 |
end;
|
haftmann@24219
|
35 |
|
haftmann@24219
|
36 |
signature CODE_THINGOL =
|
haftmann@24219
|
37 |
sig
|
haftmann@28663
|
38 |
include BASIC_CODE_THINGOL
|
haftmann@34084
|
39 |
val fun_tyco: string
|
haftmann@28663
|
40 |
val unfoldl: ('a -> ('a * 'b) option) -> 'a -> 'a * 'b list
|
haftmann@28663
|
41 |
val unfoldr: ('a -> ('b * 'a) option) -> 'a -> 'b list * 'a
|
haftmann@28663
|
42 |
val unfold_fun: itype -> itype list * itype
|
haftmann@37640
|
43 |
val unfold_fun_n: int -> itype -> itype list * itype
|
haftmann@28663
|
44 |
val unfold_app: iterm -> iterm * iterm list
|
haftmann@31888
|
45 |
val unfold_abs: iterm -> (vname option * itype) list * iterm
|
haftmann@28663
|
46 |
val split_let: iterm -> (((iterm * itype) * iterm) * iterm) option
|
haftmann@28663
|
47 |
val unfold_let: iterm -> ((iterm * itype) * iterm) list * iterm
|
haftmann@31889
|
48 |
val split_pat_abs: iterm -> ((iterm * itype) * iterm) option
|
haftmann@31889
|
49 |
val unfold_pat_abs: iterm -> (iterm * itype) list * iterm
|
haftmann@31049
|
50 |
val unfold_const_app: iterm -> (const * iterm list) option
|
haftmann@32909
|
51 |
val is_IVar: iterm -> bool
|
haftmann@31049
|
52 |
val eta_expand: int -> const * iterm list -> iterm
|
haftmann@28663
|
53 |
val contains_dictvar: iterm -> bool
|
haftmann@28663
|
54 |
val locally_monomorphic: iterm -> bool
|
haftmann@31934
|
55 |
val add_constnames: iterm -> string list -> string list
|
haftmann@32917
|
56 |
val add_tyconames: iterm -> string list -> string list
|
haftmann@28663
|
57 |
val fold_varnames: (string -> 'a -> 'a) -> iterm -> 'a -> 'a
|
haftmann@28663
|
58 |
|
haftmann@28663
|
59 |
type naming
|
haftmann@28706
|
60 |
val empty_naming: naming
|
haftmann@28663
|
61 |
val lookup_class: naming -> class -> string option
|
haftmann@28663
|
62 |
val lookup_classrel: naming -> class * class -> string option
|
haftmann@28663
|
63 |
val lookup_tyco: naming -> string -> string option
|
haftmann@28663
|
64 |
val lookup_instance: naming -> class * string -> string option
|
haftmann@28663
|
65 |
val lookup_const: naming -> string -> string option
|
haftmann@31054
|
66 |
val ensure_declared_const: theory -> string -> naming -> string * naming
|
haftmann@24219
|
67 |
|
haftmann@24918
|
68 |
datatype stmt =
|
haftmann@27024
|
69 |
NoStmt
|
haftmann@37412
|
70 |
| Fun of string * ((typscheme * ((iterm list * iterm) * (thm option * bool)) list) * thm option)
|
haftmann@37423
|
71 |
| Datatype of string * ((vname * sort) list *
|
haftmann@37423
|
72 |
((string * vname list (*type argument wrt. canonical order*)) * itype list) list)
|
haftmann@28663
|
73 |
| Datatypecons of string * string
|
haftmann@37422
|
74 |
| Class of class * (vname * ((class * string) list * (string * itype) list))
|
haftmann@24219
|
75 |
| Classrel of class * class
|
haftmann@28663
|
76 |
| Classparam of string * class
|
haftmann@37423
|
77 |
| Classinst of (class * (string * (vname * sort) list) (*class and arity*))
|
haftmann@37420
|
78 |
* ((class * (string * (string * dict list list))) list (*super instances*)
|
haftmann@37423
|
79 |
* (((string * const) * (thm * bool)) list (*class parameter instances*)
|
haftmann@37423
|
80 |
* ((string * const) * (thm * bool)) list (*super class parameter instances*)))
|
haftmann@28663
|
81 |
type program = stmt Graph.T
|
haftmann@28663
|
82 |
val empty_funs: program -> string list
|
haftmann@28663
|
83 |
val map_terms_bottom_up: (iterm -> iterm) -> iterm -> iterm
|
haftmann@28663
|
84 |
val map_terms_stmt: (iterm -> iterm) -> stmt -> stmt
|
haftmann@28663
|
85 |
val is_cons: program -> string -> bool
|
haftmann@37415
|
86 |
val is_case: stmt -> bool
|
haftmann@28663
|
87 |
val contr_classparam_typs: program -> string -> itype option list
|
haftmann@32895
|
88 |
val labelled_name: theory -> program -> string -> string
|
haftmann@32895
|
89 |
val group_stmts: theory -> program
|
haftmann@32895
|
90 |
-> ((string * stmt) list * (string * stmt) list
|
haftmann@32895
|
91 |
* ((string * stmt) list * (string * stmt) list)) list
|
haftmann@24219
|
92 |
|
haftmann@31036
|
93 |
val read_const_exprs: theory -> string list -> string list * string list
|
haftmann@36272
|
94 |
val consts_program: theory -> bool -> string list -> string list * (naming * program)
|
haftmann@38908
|
95 |
val dynamic_eval_conv: theory
|
haftmann@38911
|
96 |
-> (naming -> program -> ((string * sort) list * typscheme) * iterm -> string list -> conv)
|
haftmann@38911
|
97 |
-> conv
|
haftmann@38908
|
98 |
val dynamic_eval_value: theory -> ((term -> term) -> 'a -> 'a)
|
haftmann@31063
|
99 |
-> (naming -> program -> ((string * sort) list * typscheme) * iterm -> string list -> 'a)
|
haftmann@28663
|
100 |
-> term -> 'a
|
haftmann@38911
|
101 |
val static_eval_conv: theory -> string list
|
haftmann@38911
|
102 |
-> (naming -> program -> ((string * sort) list * typscheme) * iterm -> string list -> conv)
|
haftmann@38911
|
103 |
-> conv
|
haftmann@38911
|
104 |
val static_eval_conv_simple: theory -> string list
|
haftmann@38911
|
105 |
-> (program -> conv) -> conv
|
haftmann@24219
|
106 |
end;
|
haftmann@24219
|
107 |
|
haftmann@28054
|
108 |
structure Code_Thingol: CODE_THINGOL =
|
haftmann@24219
|
109 |
struct
|
haftmann@24219
|
110 |
|
haftmann@24219
|
111 |
(** auxiliary **)
|
haftmann@24219
|
112 |
|
haftmann@24219
|
113 |
fun unfoldl dest x =
|
haftmann@24219
|
114 |
case dest x
|
haftmann@24219
|
115 |
of NONE => (x, [])
|
haftmann@24219
|
116 |
| SOME (x1, x2) =>
|
haftmann@24219
|
117 |
let val (x', xs') = unfoldl dest x1 in (x', xs' @ [x2]) end;
|
haftmann@24219
|
118 |
|
haftmann@24219
|
119 |
fun unfoldr dest x =
|
haftmann@24219
|
120 |
case dest x
|
haftmann@24219
|
121 |
of NONE => ([], x)
|
haftmann@24219
|
122 |
| SOME (x1, x2) =>
|
haftmann@24219
|
123 |
let val (xs', x') = unfoldr dest x2 in (x1::xs', x') end;
|
haftmann@24219
|
124 |
|
haftmann@24219
|
125 |
|
haftmann@29899
|
126 |
(** language core - types, terms **)
|
haftmann@24219
|
127 |
|
haftmann@24219
|
128 |
type vname = string;
|
haftmann@24219
|
129 |
|
haftmann@24219
|
130 |
datatype dict =
|
haftmann@24219
|
131 |
DictConst of string * dict list list
|
haftmann@24219
|
132 |
| DictVar of string list * (vname * (int * int));
|
haftmann@24219
|
133 |
|
haftmann@24219
|
134 |
datatype itype =
|
haftmann@24219
|
135 |
`%% of string * itype list
|
haftmann@24219
|
136 |
| ITyVar of vname;
|
haftmann@24219
|
137 |
|
haftmann@31049
|
138 |
type const = string * ((itype list * dict list list) * itype list (*types of arguments*))
|
haftmann@24591
|
139 |
|
haftmann@24219
|
140 |
datatype iterm =
|
haftmann@24591
|
141 |
IConst of const
|
haftmann@31889
|
142 |
| IVar of vname option
|
haftmann@24219
|
143 |
| `$ of iterm * iterm
|
haftmann@31888
|
144 |
| `|=> of (vname option * itype) * iterm
|
haftmann@24219
|
145 |
| ICase of ((iterm * itype) * (iterm * iterm) list) * iterm;
|
haftmann@24219
|
146 |
(*see also signature*)
|
haftmann@24219
|
147 |
|
haftmann@32909
|
148 |
fun is_IVar (IVar _) = true
|
haftmann@32909
|
149 |
| is_IVar _ = false;
|
haftmann@32909
|
150 |
|
haftmann@24219
|
151 |
val op `$$ = Library.foldl (op `$);
|
haftmann@31724
|
152 |
val op `|==> = Library.foldr (op `|=>);
|
haftmann@24219
|
153 |
|
haftmann@24219
|
154 |
val unfold_app = unfoldl
|
haftmann@24219
|
155 |
(fn op `$ t => SOME t
|
haftmann@24219
|
156 |
| _ => NONE);
|
haftmann@24219
|
157 |
|
haftmann@31873
|
158 |
val unfold_abs = unfoldr
|
haftmann@31873
|
159 |
(fn op `|=> t => SOME t
|
haftmann@24219
|
160 |
| _ => NONE);
|
haftmann@24219
|
161 |
|
haftmann@24219
|
162 |
val split_let =
|
haftmann@24219
|
163 |
(fn ICase (((td, ty), [(p, t)]), _) => SOME (((p, ty), td), t)
|
haftmann@24219
|
164 |
| _ => NONE);
|
haftmann@24219
|
165 |
|
haftmann@24219
|
166 |
val unfold_let = unfoldr split_let;
|
haftmann@24219
|
167 |
|
haftmann@24219
|
168 |
fun unfold_const_app t =
|
haftmann@24219
|
169 |
case unfold_app t
|
haftmann@24219
|
170 |
of (IConst c, ts) => SOME (c, ts)
|
haftmann@24219
|
171 |
| _ => NONE;
|
haftmann@24219
|
172 |
|
haftmann@32917
|
173 |
fun fold_constexprs f =
|
haftmann@32917
|
174 |
let
|
haftmann@32917
|
175 |
fun fold' (IConst c) = f c
|
haftmann@32917
|
176 |
| fold' (IVar _) = I
|
haftmann@32917
|
177 |
| fold' (t1 `$ t2) = fold' t1 #> fold' t2
|
haftmann@32917
|
178 |
| fold' (_ `|=> t) = fold' t
|
haftmann@32917
|
179 |
| fold' (ICase (((t, _), ds), _)) = fold' t
|
haftmann@32917
|
180 |
#> fold (fn (pat, body) => fold' pat #> fold' body) ds
|
haftmann@32917
|
181 |
in fold' end;
|
haftmann@32917
|
182 |
|
haftmann@32917
|
183 |
val add_constnames = fold_constexprs (fn (c, _) => insert (op =) c);
|
haftmann@32917
|
184 |
|
haftmann@32917
|
185 |
fun add_tycos (tyco `%% tys) = insert (op =) tyco #> fold add_tycos tys
|
haftmann@32917
|
186 |
| add_tycos (ITyVar _) = I;
|
haftmann@32917
|
187 |
|
haftmann@32917
|
188 |
val add_tyconames = fold_constexprs (fn (_, ((tys, _), _)) => fold add_tycos tys);
|
haftmann@24219
|
189 |
|
haftmann@24219
|
190 |
fun fold_varnames f =
|
haftmann@24219
|
191 |
let
|
haftmann@31934
|
192 |
fun fold_aux add f =
|
haftmann@31934
|
193 |
let
|
haftmann@31934
|
194 |
fun fold_term _ (IConst _) = I
|
haftmann@31934
|
195 |
| fold_term vs (IVar (SOME v)) = if member (op =) vs v then I else f v
|
haftmann@31934
|
196 |
| fold_term _ (IVar NONE) = I
|
haftmann@31934
|
197 |
| fold_term vs (t1 `$ t2) = fold_term vs t1 #> fold_term vs t2
|
haftmann@31934
|
198 |
| fold_term vs ((SOME v, _) `|=> t) = fold_term (insert (op =) v vs) t
|
haftmann@31934
|
199 |
| fold_term vs ((NONE, _) `|=> t) = fold_term vs t
|
haftmann@31934
|
200 |
| fold_term vs (ICase (((t, _), ds), _)) = fold_term vs t #> fold (fold_case vs) ds
|
haftmann@31934
|
201 |
and fold_case vs (p, t) = fold_term (add p vs) t;
|
haftmann@31934
|
202 |
in fold_term [] end;
|
haftmann@31934
|
203 |
fun add t = fold_aux add (insert (op =)) t;
|
haftmann@31934
|
204 |
in fold_aux add f end;
|
haftmann@24219
|
205 |
|
haftmann@31934
|
206 |
fun exists_var t v = fold_varnames (fn w => fn b => v = w orelse b) t false;
|
haftmann@31873
|
207 |
|
haftmann@31889
|
208 |
fun split_pat_abs ((NONE, ty) `|=> t) = SOME ((IVar NONE, ty), t)
|
haftmann@31888
|
209 |
| split_pat_abs ((SOME v, ty) `|=> t) = SOME (case t
|
haftmann@31889
|
210 |
of ICase (((IVar (SOME w), _), [(p, t')]), _) =>
|
haftmann@31888
|
211 |
if v = w andalso (exists_var p v orelse not (exists_var t' v))
|
haftmann@31889
|
212 |
then ((p, ty), t')
|
haftmann@31889
|
213 |
else ((IVar (SOME v), ty), t)
|
haftmann@31889
|
214 |
| _ => ((IVar (SOME v), ty), t))
|
haftmann@31888
|
215 |
| split_pat_abs _ = NONE;
|
haftmann@31873
|
216 |
|
haftmann@31873
|
217 |
val unfold_pat_abs = unfoldr split_pat_abs;
|
haftmann@24219
|
218 |
|
haftmann@31890
|
219 |
fun unfold_abs_eta [] t = ([], t)
|
haftmann@31890
|
220 |
| unfold_abs_eta (_ :: tys) (v_ty `|=> t) =
|
haftmann@31890
|
221 |
let
|
haftmann@31890
|
222 |
val (vs_tys, t') = unfold_abs_eta tys t;
|
haftmann@31890
|
223 |
in (v_ty :: vs_tys, t') end
|
haftmann@31892
|
224 |
| unfold_abs_eta tys t =
|
haftmann@31890
|
225 |
let
|
haftmann@31890
|
226 |
val ctxt = fold_varnames Name.declare t Name.context;
|
haftmann@31890
|
227 |
val vs_tys = (map o apfst) SOME (Name.names ctxt "a" tys);
|
haftmann@31890
|
228 |
in (vs_tys, t `$$ map (IVar o fst) vs_tys) end;
|
haftmann@31890
|
229 |
|
haftmann@37841
|
230 |
fun eta_expand k (c as (name, (_, tys)), ts) =
|
haftmann@24219
|
231 |
let
|
haftmann@24219
|
232 |
val j = length ts;
|
haftmann@24219
|
233 |
val l = k - j;
|
haftmann@37841
|
234 |
val _ = if l > length tys
|
haftmann@37841
|
235 |
then error ("Impossible eta-expansion for constant " ^ quote name) else ();
|
haftmann@24219
|
236 |
val ctxt = (fold o fold_varnames) Name.declare ts Name.context;
|
haftmann@31889
|
237 |
val vs_tys = (map o apfst) SOME
|
haftmann@33956
|
238 |
(Name.names ctxt "a" ((take l o drop j) tys));
|
haftmann@31889
|
239 |
in vs_tys `|==> IConst c `$$ ts @ map (IVar o fst) vs_tys end;
|
haftmann@24219
|
240 |
|
haftmann@24662
|
241 |
fun contains_dictvar t =
|
haftmann@24662
|
242 |
let
|
haftmann@31934
|
243 |
fun cont_dict (DictConst (_, dss)) = (exists o exists) cont_dict dss
|
haftmann@31934
|
244 |
| cont_dict (DictVar _) = true;
|
haftmann@31934
|
245 |
fun cont_term (IConst (_, ((_, dss), _))) = (exists o exists) cont_dict dss
|
haftmann@31934
|
246 |
| cont_term (IVar _) = false
|
haftmann@31934
|
247 |
| cont_term (t1 `$ t2) = cont_term t1 orelse cont_term t2
|
haftmann@31934
|
248 |
| cont_term (_ `|=> t) = cont_term t
|
haftmann@31934
|
249 |
| cont_term (ICase (_, t)) = cont_term t;
|
haftmann@31934
|
250 |
in cont_term t end;
|
haftmann@24662
|
251 |
|
haftmann@25621
|
252 |
fun locally_monomorphic (IConst _) = false
|
haftmann@25621
|
253 |
| locally_monomorphic (IVar _) = true
|
haftmann@25621
|
254 |
| locally_monomorphic (t `$ _) = locally_monomorphic t
|
haftmann@31724
|
255 |
| locally_monomorphic (_ `|=> t) = locally_monomorphic t
|
haftmann@25621
|
256 |
| locally_monomorphic (ICase ((_, ds), _)) = exists (locally_monomorphic o snd) ds;
|
haftmann@25621
|
257 |
|
haftmann@25621
|
258 |
|
haftmann@28688
|
259 |
(** namings **)
|
haftmann@28663
|
260 |
|
haftmann@28663
|
261 |
(* policies *)
|
haftmann@28663
|
262 |
|
haftmann@28663
|
263 |
local
|
wenzelm@33172
|
264 |
fun thyname_of_class thy = #theory_name o Name_Space.the_entry (Sign.class_space thy);
|
wenzelm@33172
|
265 |
fun thyname_of_instance thy inst = case AxClass.thynames_of_arity thy inst
|
wenzelm@33172
|
266 |
of [] => error ("No such instance: " ^ quote (snd inst ^ " :: " ^ fst inst))
|
haftmann@28663
|
267 |
| thyname :: _ => thyname;
|
haftmann@28706
|
268 |
fun thyname_of_const thy c = case AxClass.class_of_param thy c
|
haftmann@28706
|
269 |
of SOME class => thyname_of_class thy class
|
haftmann@35299
|
270 |
| NONE => (case Code.get_type_of_constr_or_abstr thy c
|
haftmann@35226
|
271 |
of SOME (tyco, _) => Codegen.thyname_of_type thy tyco
|
wenzelm@33172
|
272 |
| NONE => Codegen.thyname_of_const thy c);
|
haftmann@33409
|
273 |
fun purify_base "==>" = "follows"
|
haftmann@31036
|
274 |
| purify_base "op =" = "eq"
|
haftmann@31036
|
275 |
| purify_base s = Name.desymbolize false s;
|
haftmann@28663
|
276 |
fun namify thy get_basename get_thyname name =
|
haftmann@28663
|
277 |
let
|
haftmann@28663
|
278 |
val prefix = get_thyname thy name;
|
haftmann@31036
|
279 |
val base = (purify_base o get_basename) name;
|
wenzelm@30364
|
280 |
in Long_Name.append prefix base end;
|
haftmann@28663
|
281 |
in
|
haftmann@28663
|
282 |
|
wenzelm@30364
|
283 |
fun namify_class thy = namify thy Long_Name.base_name thyname_of_class;
|
haftmann@37359
|
284 |
fun namify_classrel thy = namify thy (fn (sub_class, super_class) =>
|
haftmann@37406
|
285 |
Long_Name.base_name super_class ^ "_" ^ Long_Name.base_name sub_class)
|
wenzelm@33172
|
286 |
(fn thy => thyname_of_class thy o fst);
|
haftmann@28663
|
287 |
(*order fits nicely with composed projections*)
|
haftmann@28688
|
288 |
fun namify_tyco thy "fun" = "Pure.fun"
|
wenzelm@33172
|
289 |
| namify_tyco thy tyco = namify thy Long_Name.base_name Codegen.thyname_of_type tyco;
|
haftmann@28663
|
290 |
fun namify_instance thy = namify thy (fn (class, tyco) =>
|
wenzelm@30364
|
291 |
Long_Name.base_name class ^ "_" ^ Long_Name.base_name tyco) thyname_of_instance;
|
wenzelm@30364
|
292 |
fun namify_const thy = namify thy Long_Name.base_name thyname_of_const;
|
haftmann@28663
|
293 |
|
haftmann@28663
|
294 |
end; (* local *)
|
haftmann@28663
|
295 |
|
haftmann@28663
|
296 |
|
haftmann@28688
|
297 |
(* data *)
|
haftmann@28663
|
298 |
|
haftmann@28663
|
299 |
datatype naming = Naming of {
|
haftmann@28663
|
300 |
class: class Symtab.table * Name.context,
|
haftmann@30636
|
301 |
classrel: string Symreltab.table * Name.context,
|
haftmann@28663
|
302 |
tyco: string Symtab.table * Name.context,
|
haftmann@30636
|
303 |
instance: string Symreltab.table * Name.context,
|
haftmann@28663
|
304 |
const: string Symtab.table * Name.context
|
haftmann@28663
|
305 |
}
|
haftmann@28663
|
306 |
|
haftmann@28663
|
307 |
fun dest_Naming (Naming naming) = naming;
|
haftmann@28663
|
308 |
|
haftmann@28663
|
309 |
val empty_naming = Naming {
|
haftmann@28663
|
310 |
class = (Symtab.empty, Name.context),
|
haftmann@30636
|
311 |
classrel = (Symreltab.empty, Name.context),
|
haftmann@28663
|
312 |
tyco = (Symtab.empty, Name.context),
|
haftmann@30636
|
313 |
instance = (Symreltab.empty, Name.context),
|
haftmann@28663
|
314 |
const = (Symtab.empty, Name.context)
|
haftmann@28663
|
315 |
};
|
haftmann@28663
|
316 |
|
haftmann@28663
|
317 |
local
|
haftmann@28663
|
318 |
fun mk_naming (class, classrel, tyco, instance, const) =
|
haftmann@28663
|
319 |
Naming { class = class, classrel = classrel,
|
haftmann@28663
|
320 |
tyco = tyco, instance = instance, const = const };
|
haftmann@28663
|
321 |
fun map_naming f (Naming { class, classrel, tyco, instance, const }) =
|
haftmann@28663
|
322 |
mk_naming (f (class, classrel, tyco, instance, const));
|
haftmann@28663
|
323 |
in
|
haftmann@28663
|
324 |
fun map_class f = map_naming
|
haftmann@28663
|
325 |
(fn (class, classrel, tyco, inst, const) =>
|
haftmann@28663
|
326 |
(f class, classrel, tyco, inst, const));
|
haftmann@28663
|
327 |
fun map_classrel f = map_naming
|
haftmann@28663
|
328 |
(fn (class, classrel, tyco, inst, const) =>
|
haftmann@28663
|
329 |
(class, f classrel, tyco, inst, const));
|
haftmann@28663
|
330 |
fun map_tyco f = map_naming
|
haftmann@28663
|
331 |
(fn (class, classrel, tyco, inst, const) =>
|
haftmann@28663
|
332 |
(class, classrel, f tyco, inst, const));
|
haftmann@28663
|
333 |
fun map_instance f = map_naming
|
haftmann@28663
|
334 |
(fn (class, classrel, tyco, inst, const) =>
|
haftmann@28663
|
335 |
(class, classrel, tyco, f inst, const));
|
haftmann@28663
|
336 |
fun map_const f = map_naming
|
haftmann@28663
|
337 |
(fn (class, classrel, tyco, inst, const) =>
|
haftmann@28663
|
338 |
(class, classrel, tyco, inst, f const));
|
haftmann@28663
|
339 |
end; (*local*)
|
haftmann@28663
|
340 |
|
haftmann@28663
|
341 |
fun add_variant update (thing, name) (tab, used) =
|
haftmann@28663
|
342 |
let
|
haftmann@28663
|
343 |
val (name', used') = yield_singleton Name.variants name used;
|
haftmann@28663
|
344 |
val tab' = update (thing, name') tab;
|
haftmann@28663
|
345 |
in (tab', used') end;
|
haftmann@28663
|
346 |
|
haftmann@28663
|
347 |
fun declare thy mapp lookup update namify thing =
|
haftmann@28663
|
348 |
mapp (add_variant update (thing, namify thy thing))
|
haftmann@28663
|
349 |
#> `(fn naming => the (lookup naming thing));
|
haftmann@28663
|
350 |
|
haftmann@28688
|
351 |
|
haftmann@28688
|
352 |
(* lookup and declare *)
|
haftmann@28688
|
353 |
|
haftmann@28688
|
354 |
local
|
haftmann@28688
|
355 |
|
haftmann@28688
|
356 |
val suffix_class = "class";
|
haftmann@28688
|
357 |
val suffix_classrel = "classrel"
|
haftmann@28688
|
358 |
val suffix_tyco = "tyco";
|
haftmann@28688
|
359 |
val suffix_instance = "inst";
|
haftmann@28688
|
360 |
val suffix_const = "const";
|
haftmann@28688
|
361 |
|
haftmann@28688
|
362 |
fun add_suffix nsp NONE = NONE
|
wenzelm@30364
|
363 |
| add_suffix nsp (SOME name) = SOME (Long_Name.append name nsp);
|
haftmann@28688
|
364 |
|
haftmann@28688
|
365 |
in
|
haftmann@28688
|
366 |
|
haftmann@28663
|
367 |
val lookup_class = add_suffix suffix_class
|
haftmann@28663
|
368 |
oo Symtab.lookup o fst o #class o dest_Naming;
|
haftmann@28663
|
369 |
val lookup_classrel = add_suffix suffix_classrel
|
haftmann@30636
|
370 |
oo Symreltab.lookup o fst o #classrel o dest_Naming;
|
haftmann@28663
|
371 |
val lookup_tyco = add_suffix suffix_tyco
|
haftmann@28663
|
372 |
oo Symtab.lookup o fst o #tyco o dest_Naming;
|
haftmann@28663
|
373 |
val lookup_instance = add_suffix suffix_instance
|
haftmann@30636
|
374 |
oo Symreltab.lookup o fst o #instance o dest_Naming;
|
haftmann@28663
|
375 |
val lookup_const = add_suffix suffix_const
|
haftmann@28663
|
376 |
oo Symtab.lookup o fst o #const o dest_Naming;
|
haftmann@28663
|
377 |
|
haftmann@28663
|
378 |
fun declare_class thy = declare thy map_class
|
haftmann@28663
|
379 |
lookup_class Symtab.update_new namify_class;
|
haftmann@28663
|
380 |
fun declare_classrel thy = declare thy map_classrel
|
haftmann@30636
|
381 |
lookup_classrel Symreltab.update_new namify_classrel;
|
haftmann@28663
|
382 |
fun declare_tyco thy = declare thy map_tyco
|
haftmann@28663
|
383 |
lookup_tyco Symtab.update_new namify_tyco;
|
haftmann@28663
|
384 |
fun declare_instance thy = declare thy map_instance
|
haftmann@30636
|
385 |
lookup_instance Symreltab.update_new namify_instance;
|
haftmann@28663
|
386 |
fun declare_const thy = declare thy map_const
|
haftmann@28663
|
387 |
lookup_const Symtab.update_new namify_const;
|
haftmann@28663
|
388 |
|
haftmann@31054
|
389 |
fun ensure_declared_const thy const naming =
|
haftmann@31054
|
390 |
case lookup_const naming const
|
haftmann@31054
|
391 |
of SOME const' => (const', naming)
|
haftmann@31054
|
392 |
| NONE => declare_const thy const naming;
|
haftmann@31054
|
393 |
|
haftmann@37359
|
394 |
val fun_tyco = Long_Name.append (namify_tyco Pure.thy "fun") suffix_tyco
|
haftmann@37359
|
395 |
(*depends on add_suffix*);
|
haftmann@34084
|
396 |
|
haftmann@28688
|
397 |
val unfold_fun = unfoldr
|
haftmann@34084
|
398 |
(fn tyco `%% [ty1, ty2] => if tyco = fun_tyco then SOME (ty1, ty2) else NONE
|
haftmann@37359
|
399 |
| _ => NONE);
|
haftmann@28688
|
400 |
|
haftmann@37640
|
401 |
fun unfold_fun_n n ty =
|
haftmann@37640
|
402 |
let
|
haftmann@37640
|
403 |
val (tys1, ty1) = unfold_fun ty;
|
haftmann@37640
|
404 |
val (tys3, tys2) = chop n tys1;
|
haftmann@37640
|
405 |
val ty3 = Library.foldr (fn (ty1, ty2) => fun_tyco `%% [ty1, ty2]) (tys2, ty1);
|
haftmann@37640
|
406 |
in (tys3, ty3) end;
|
haftmann@37640
|
407 |
|
haftmann@28688
|
408 |
end; (* local *)
|
haftmann@28688
|
409 |
|
haftmann@24219
|
410 |
|
haftmann@27103
|
411 |
(** statements, abstract programs **)
|
haftmann@24219
|
412 |
|
haftmann@24219
|
413 |
type typscheme = (vname * sort) list * itype;
|
haftmann@37422
|
414 |
datatype stmt =
|
haftmann@27024
|
415 |
NoStmt
|
haftmann@37412
|
416 |
| Fun of string * ((typscheme * ((iterm list * iterm) * (thm option * bool)) list) * thm option)
|
haftmann@37423
|
417 |
| Datatype of string * ((vname * sort) list * ((string * vname list) * itype list) list)
|
haftmann@28663
|
418 |
| Datatypecons of string * string
|
haftmann@37422
|
419 |
| Class of class * (vname * ((class * string) list * (string * itype) list))
|
haftmann@24219
|
420 |
| Classrel of class * class
|
haftmann@28663
|
421 |
| Classparam of string * class
|
haftmann@24219
|
422 |
| Classinst of (class * (string * (vname * sort) list))
|
haftmann@37420
|
423 |
* ((class * (string * (string * dict list list))) list
|
haftmann@37423
|
424 |
* (((string * const) * (thm * bool)) list
|
haftmann@37423
|
425 |
* ((string * const) * (thm * bool)) list))
|
haftmann@37423
|
426 |
(*see also signature*);
|
haftmann@24219
|
427 |
|
haftmann@27103
|
428 |
type program = stmt Graph.T;
|
haftmann@24219
|
429 |
|
haftmann@27103
|
430 |
fun empty_funs program =
|
haftmann@37412
|
431 |
Graph.fold (fn (name, (Fun (c, ((_, []), _)), _)) => cons c
|
haftmann@27103
|
432 |
| _ => I) program [];
|
haftmann@24219
|
433 |
|
haftmann@27711
|
434 |
fun map_terms_bottom_up f (t as IConst _) = f t
|
haftmann@27711
|
435 |
| map_terms_bottom_up f (t as IVar _) = f t
|
haftmann@27711
|
436 |
| map_terms_bottom_up f (t1 `$ t2) = f
|
haftmann@27711
|
437 |
(map_terms_bottom_up f t1 `$ map_terms_bottom_up f t2)
|
haftmann@31724
|
438 |
| map_terms_bottom_up f ((v, ty) `|=> t) = f
|
haftmann@31724
|
439 |
((v, ty) `|=> map_terms_bottom_up f t)
|
haftmann@27711
|
440 |
| map_terms_bottom_up f (ICase (((t, ty), ps), t0)) = f
|
haftmann@27711
|
441 |
(ICase (((map_terms_bottom_up f t, ty), (map o pairself)
|
haftmann@27711
|
442 |
(map_terms_bottom_up f) ps), map_terms_bottom_up f t0));
|
haftmann@27711
|
443 |
|
haftmann@37423
|
444 |
fun map_classparam_instances_as_term f =
|
haftmann@37423
|
445 |
(map o apfst o apsnd) (fn const => case f (IConst const) of IConst const' => const')
|
haftmann@37423
|
446 |
|
haftmann@27711
|
447 |
fun map_terms_stmt f NoStmt = NoStmt
|
haftmann@37412
|
448 |
| map_terms_stmt f (Fun (c, ((tysm, eqs), case_cong))) = Fun (c, ((tysm, (map o apfst)
|
haftmann@37412
|
449 |
(fn (ts, t) => (map f ts, f t)) eqs), case_cong))
|
haftmann@27711
|
450 |
| map_terms_stmt f (stmt as Datatype _) = stmt
|
haftmann@27711
|
451 |
| map_terms_stmt f (stmt as Datatypecons _) = stmt
|
haftmann@27711
|
452 |
| map_terms_stmt f (stmt as Class _) = stmt
|
haftmann@27711
|
453 |
| map_terms_stmt f (stmt as Classrel _) = stmt
|
haftmann@27711
|
454 |
| map_terms_stmt f (stmt as Classparam _) = stmt
|
haftmann@37423
|
455 |
| map_terms_stmt f (Classinst (arity, (super_instances, classparam_instances))) =
|
haftmann@37423
|
456 |
Classinst (arity, (super_instances, (pairself o map_classparam_instances_as_term) f classparam_instances));
|
haftmann@27711
|
457 |
|
haftmann@27103
|
458 |
fun is_cons program name = case Graph.get_node program name
|
haftmann@24219
|
459 |
of Datatypecons _ => true
|
haftmann@24219
|
460 |
| _ => false;
|
haftmann@24219
|
461 |
|
haftmann@37415
|
462 |
fun is_case (Fun (_, (_, SOME _))) = true
|
haftmann@37415
|
463 |
| is_case _ = false;
|
haftmann@37415
|
464 |
|
haftmann@27103
|
465 |
fun contr_classparam_typs program name = case Graph.get_node program name
|
haftmann@28663
|
466 |
of Classparam (_, class) => let
|
haftmann@28663
|
467 |
val Class (_, (_, (_, params))) = Graph.get_node program class;
|
haftmann@25621
|
468 |
val SOME ty = AList.lookup (op =) params name;
|
haftmann@25621
|
469 |
val (tys, res_ty) = unfold_fun ty;
|
haftmann@25621
|
470 |
fun no_tyvar (_ `%% tys) = forall no_tyvar tys
|
haftmann@25621
|
471 |
| no_tyvar (ITyVar _) = false;
|
haftmann@25621
|
472 |
in if no_tyvar res_ty
|
haftmann@25621
|
473 |
then map (fn ty => if no_tyvar ty then NONE else SOME ty) tys
|
haftmann@25621
|
474 |
else []
|
haftmann@25621
|
475 |
end
|
haftmann@25621
|
476 |
| _ => [];
|
haftmann@25621
|
477 |
|
haftmann@32895
|
478 |
fun labelled_name thy program name = case Graph.get_node program name
|
haftmann@32895
|
479 |
of Fun (c, _) => quote (Code.string_of_const thy c)
|
haftmann@32895
|
480 |
| Datatype (tyco, _) => "type " ^ quote (Sign.extern_type thy tyco)
|
haftmann@32895
|
481 |
| Datatypecons (c, _) => quote (Code.string_of_const thy c)
|
haftmann@32895
|
482 |
| Class (class, _) => "class " ^ quote (Sign.extern_class thy class)
|
haftmann@32895
|
483 |
| Classrel (sub, super) => let
|
haftmann@32895
|
484 |
val Class (sub, _) = Graph.get_node program sub
|
haftmann@32895
|
485 |
val Class (super, _) = Graph.get_node program super
|
haftmann@32895
|
486 |
in quote (Sign.extern_class thy sub ^ " < " ^ Sign.extern_class thy super) end
|
haftmann@32895
|
487 |
| Classparam (c, _) => quote (Code.string_of_const thy c)
|
haftmann@32895
|
488 |
| Classinst ((class, (tyco, _)), _) => let
|
haftmann@32895
|
489 |
val Class (class, _) = Graph.get_node program class
|
haftmann@32895
|
490 |
val Datatype (tyco, _) = Graph.get_node program tyco
|
haftmann@32895
|
491 |
in quote (Sign.extern_type thy tyco ^ " :: " ^ Sign.extern_class thy class) end
|
haftmann@32895
|
492 |
|
haftmann@37415
|
493 |
fun linear_stmts program =
|
haftmann@37415
|
494 |
rev (Graph.strong_conn program)
|
haftmann@37415
|
495 |
|> map (AList.make (Graph.get_node program));
|
haftmann@37415
|
496 |
|
haftmann@32895
|
497 |
fun group_stmts thy program =
|
haftmann@32895
|
498 |
let
|
haftmann@32895
|
499 |
fun is_fun (_, Fun _) = true | is_fun _ = false;
|
haftmann@32895
|
500 |
fun is_datatypecons (_, Datatypecons _) = true | is_datatypecons _ = false;
|
haftmann@32895
|
501 |
fun is_datatype (_, Datatype _) = true | is_datatype _ = false;
|
haftmann@32895
|
502 |
fun is_class (_, Class _) = true | is_class _ = false;
|
haftmann@32895
|
503 |
fun is_classrel (_, Classrel _) = true | is_classrel _ = false;
|
haftmann@32895
|
504 |
fun is_classparam (_, Classparam _) = true | is_classparam _ = false;
|
haftmann@32895
|
505 |
fun is_classinst (_, Classinst _) = true | is_classinst _ = false;
|
haftmann@32895
|
506 |
fun group stmts =
|
haftmann@32895
|
507 |
if forall (is_datatypecons orf is_datatype) stmts
|
haftmann@32895
|
508 |
then (filter is_datatype stmts, [], ([], []))
|
haftmann@32895
|
509 |
else if forall (is_class orf is_classrel orf is_classparam) stmts
|
haftmann@32895
|
510 |
then ([], filter is_class stmts, ([], []))
|
haftmann@32895
|
511 |
else if forall (is_fun orf is_classinst) stmts
|
haftmann@32895
|
512 |
then ([], [], List.partition is_fun stmts)
|
haftmann@32895
|
513 |
else error ("Illegal mutual dependencies: " ^
|
haftmann@32895
|
514 |
(commas o map (labelled_name thy program o fst)) stmts)
|
haftmann@32895
|
515 |
in
|
haftmann@37415
|
516 |
linear_stmts program
|
haftmann@32895
|
517 |
|> map group
|
haftmann@32895
|
518 |
end;
|
haftmann@32895
|
519 |
|
haftmann@24219
|
520 |
|
haftmann@27103
|
521 |
(** translation kernel **)
|
haftmann@24219
|
522 |
|
haftmann@28724
|
523 |
(* generic mechanisms *)
|
haftmann@28724
|
524 |
|
haftmann@28663
|
525 |
fun ensure_stmt lookup declare generate thing (dep, (naming, program)) =
|
haftmann@24219
|
526 |
let
|
haftmann@28706
|
527 |
fun add_dep name = case dep of NONE => I
|
haftmann@28706
|
528 |
| SOME dep => Graph.add_edge (dep, name);
|
haftmann@28706
|
529 |
val (name, naming') = case lookup naming thing
|
haftmann@28706
|
530 |
of SOME name => (name, naming)
|
haftmann@28706
|
531 |
| NONE => declare thing naming;
|
haftmann@28706
|
532 |
in case try (Graph.get_node program) name
|
haftmann@28706
|
533 |
of SOME stmt => program
|
haftmann@28663
|
534 |
|> add_dep name
|
haftmann@28706
|
535 |
|> pair naming'
|
haftmann@28663
|
536 |
|> pair dep
|
haftmann@28663
|
537 |
|> pair name
|
haftmann@28706
|
538 |
| NONE => program
|
haftmann@28706
|
539 |
|> Graph.default_node (name, NoStmt)
|
haftmann@28706
|
540 |
|> add_dep name
|
haftmann@28706
|
541 |
|> pair naming'
|
haftmann@28706
|
542 |
|> curry generate (SOME name)
|
haftmann@28706
|
543 |
||> snd
|
haftmann@28706
|
544 |
|-> (fn stmt => (apsnd o Graph.map_node name) (K stmt))
|
haftmann@28706
|
545 |
|> pair dep
|
haftmann@28706
|
546 |
|> pair name
|
haftmann@24219
|
547 |
end;
|
haftmann@24219
|
548 |
|
haftmann@36272
|
549 |
exception PERMISSIVE of unit;
|
haftmann@36272
|
550 |
|
haftmann@37689
|
551 |
fun translation_error thy permissive some_thm msg sub_msg =
|
haftmann@36272
|
552 |
if permissive
|
haftmann@36272
|
553 |
then raise PERMISSIVE ()
|
haftmann@36272
|
554 |
else let
|
haftmann@35226
|
555 |
val err_thm = case some_thm
|
haftmann@36272
|
556 |
of SOME thm => "\n(in code equation " ^ Display.string_of_thm_global thy thm ^ ")"
|
haftmann@36272
|
557 |
| NONE => "";
|
haftmann@37689
|
558 |
in error (msg ^ err_thm ^ ":\n" ^ sub_msg) end;
|
haftmann@37689
|
559 |
|
haftmann@37689
|
560 |
fun not_wellsorted thy permissive some_thm ty sort e =
|
haftmann@37689
|
561 |
let
|
haftmann@37689
|
562 |
val err_class = Sorts.class_error (Syntax.pp_global thy) e;
|
haftmann@37689
|
563 |
val err_typ = "Type " ^ Syntax.string_of_typ_global thy ty ^ " not of sort "
|
haftmann@37689
|
564 |
^ Syntax.string_of_sort_global thy sort;
|
haftmann@37689
|
565 |
in translation_error thy permissive some_thm "Wellsortedness error" (err_typ ^ "\n" ^ err_class) end;
|
haftmann@26972
|
566 |
|
haftmann@28724
|
567 |
|
haftmann@28724
|
568 |
(* translation *)
|
haftmann@28724
|
569 |
|
haftmann@36272
|
570 |
fun ensure_tyco thy algbr eqngr permissive tyco =
|
haftmann@30932
|
571 |
let
|
haftmann@36272
|
572 |
val (vs, cos) = Code.get_type thy tyco;
|
haftmann@30932
|
573 |
val stmt_datatype =
|
haftmann@36272
|
574 |
fold_map (translate_tyvar_sort thy algbr eqngr permissive) vs
|
haftmann@37423
|
575 |
##>> fold_map (fn ((c, vs), tys) =>
|
haftmann@36272
|
576 |
ensure_const thy algbr eqngr permissive c
|
haftmann@37423
|
577 |
##>> pair (map (unprefix "'") vs)
|
haftmann@36272
|
578 |
##>> fold_map (translate_typ thy algbr eqngr permissive) tys) cos
|
haftmann@36272
|
579 |
#>> (fn info => Datatype (tyco, info));
|
haftmann@30932
|
580 |
in ensure_stmt lookup_tyco (declare_tyco thy) stmt_datatype tyco end
|
haftmann@36272
|
581 |
and ensure_const thy algbr eqngr permissive c =
|
haftmann@30932
|
582 |
let
|
haftmann@30932
|
583 |
fun stmt_datatypecons tyco =
|
haftmann@36272
|
584 |
ensure_tyco thy algbr eqngr permissive tyco
|
haftmann@30932
|
585 |
#>> (fn tyco => Datatypecons (c, tyco));
|
haftmann@30932
|
586 |
fun stmt_classparam class =
|
haftmann@36272
|
587 |
ensure_class thy algbr eqngr permissive class
|
haftmann@30932
|
588 |
#>> (fn class => Classparam (c, class));
|
haftmann@34891
|
589 |
fun stmt_fun cert =
|
haftmann@32872
|
590 |
let
|
haftmann@35226
|
591 |
val ((vs, ty), eqns) = Code.equations_of_cert thy cert;
|
haftmann@37415
|
592 |
val some_case_cong = Code.get_case_cong thy c;
|
haftmann@32872
|
593 |
in
|
haftmann@36272
|
594 |
fold_map (translate_tyvar_sort thy algbr eqngr permissive) vs
|
haftmann@36272
|
595 |
##>> translate_typ thy algbr eqngr permissive ty
|
haftmann@37415
|
596 |
##>> translate_eqns thy algbr eqngr permissive eqns
|
haftmann@37415
|
597 |
#>> (fn info => Fun (c, (info, some_case_cong)))
|
haftmann@32872
|
598 |
end;
|
haftmann@35299
|
599 |
val stmt_const = case Code.get_type_of_constr_or_abstr thy c
|
haftmann@35226
|
600 |
of SOME (tyco, _) => stmt_datatypecons tyco
|
haftmann@30932
|
601 |
| NONE => (case AxClass.class_of_param thy c
|
haftmann@30932
|
602 |
of SOME class => stmt_classparam class
|
haftmann@34891
|
603 |
| NONE => stmt_fun (Code_Preproc.cert eqngr c))
|
haftmann@30932
|
604 |
in ensure_stmt lookup_const (declare_const thy) stmt_const c end
|
haftmann@36272
|
605 |
and ensure_class thy (algbr as (_, algebra)) eqngr permissive class =
|
haftmann@24918
|
606 |
let
|
haftmann@37359
|
607 |
val super_classes = (Sorts.minimize_sort algebra o Sorts.super_classes algebra) class;
|
wenzelm@24969
|
608 |
val cs = #params (AxClass.get_info thy class);
|
haftmann@24918
|
609 |
val stmt_class =
|
haftmann@37359
|
610 |
fold_map (fn super_class => ensure_class thy algbr eqngr permissive super_class
|
haftmann@37359
|
611 |
##>> ensure_classrel thy algbr eqngr permissive (class, super_class)) super_classes
|
haftmann@36272
|
612 |
##>> fold_map (fn (c, ty) => ensure_const thy algbr eqngr permissive c
|
haftmann@36272
|
613 |
##>> translate_typ thy algbr eqngr permissive ty) cs
|
haftmann@28663
|
614 |
#>> (fn info => Class (class, (unprefix "'" Name.aT, info)))
|
haftmann@28663
|
615 |
in ensure_stmt lookup_class (declare_class thy) stmt_class class end
|
haftmann@37359
|
616 |
and ensure_classrel thy algbr eqngr permissive (sub_class, super_class) =
|
haftmann@24918
|
617 |
let
|
haftmann@24918
|
618 |
val stmt_classrel =
|
haftmann@37359
|
619 |
ensure_class thy algbr eqngr permissive sub_class
|
haftmann@37359
|
620 |
##>> ensure_class thy algbr eqngr permissive super_class
|
haftmann@24918
|
621 |
#>> Classrel;
|
haftmann@37359
|
622 |
in ensure_stmt lookup_classrel (declare_classrel thy) stmt_classrel (sub_class, super_class) end
|
haftmann@36272
|
623 |
and ensure_inst thy (algbr as (_, algebra)) eqngr permissive (class, tyco) =
|
haftmann@24918
|
624 |
let
|
haftmann@37359
|
625 |
val super_classes = (Sorts.minimize_sort algebra o Sorts.super_classes algebra) class;
|
haftmann@37423
|
626 |
val these_classparams = these o try (#params o AxClass.get_info thy);
|
haftmann@37423
|
627 |
val classparams = these_classparams class;
|
haftmann@37423
|
628 |
val further_classparams = maps these_classparams
|
haftmann@37423
|
629 |
((Sorts.complete_sort algebra o Sorts.super_classes algebra) class);
|
haftmann@24918
|
630 |
val vs = Name.names Name.context "'a" (Sorts.mg_domain algebra tyco [class]);
|
haftmann@24918
|
631 |
val sorts' = Sorts.mg_domain (Sign.classes_of thy) tyco [class];
|
haftmann@24918
|
632 |
val vs' = map2 (fn (v, sort1) => fn sort2 => (v,
|
haftmann@24918
|
633 |
Sorts.inter_sort (Sign.classes_of thy) (sort1, sort2))) vs sorts';
|
haftmann@24918
|
634 |
val arity_typ = Type (tyco, map TFree vs);
|
haftmann@24918
|
635 |
val arity_typ' = Type (tyco, map (fn (v, sort) => TVar ((v, 0), sort)) vs');
|
haftmann@37359
|
636 |
fun translate_super_instance super_class =
|
haftmann@37359
|
637 |
ensure_class thy algbr eqngr permissive super_class
|
haftmann@37359
|
638 |
##>> ensure_classrel thy algbr eqngr permissive (class, super_class)
|
haftmann@37359
|
639 |
##>> translate_dicts thy algbr eqngr permissive NONE (arity_typ, [super_class])
|
haftmann@37359
|
640 |
#>> (fn ((super_class, classrel), [DictConst (inst, dss)]) =>
|
haftmann@37359
|
641 |
(super_class, (classrel, (inst, dss))));
|
haftmann@37359
|
642 |
fun translate_classparam_instance (c, ty) =
|
haftmann@24918
|
643 |
let
|
haftmann@37359
|
644 |
val raw_const = Const (c, map_type_tfree (K arity_typ') ty);
|
haftmann@37359
|
645 |
val thm = AxClass.unoverload_conv thy (Thm.cterm_of thy raw_const);
|
haftmann@37359
|
646 |
val const = (apsnd Logic.unvarifyT_global o dest_Const o snd
|
haftmann@24918
|
647 |
o Logic.dest_equals o Thm.prop_of) thm;
|
haftmann@24918
|
648 |
in
|
haftmann@36272
|
649 |
ensure_const thy algbr eqngr permissive c
|
haftmann@37359
|
650 |
##>> translate_const thy algbr eqngr permissive (SOME thm) (const, NONE)
|
haftmann@37359
|
651 |
#>> (fn (c, IConst const') => ((c, const'), (thm, true)))
|
haftmann@24918
|
652 |
end;
|
haftmann@24918
|
653 |
val stmt_inst =
|
haftmann@36272
|
654 |
ensure_class thy algbr eqngr permissive class
|
haftmann@36272
|
655 |
##>> ensure_tyco thy algbr eqngr permissive tyco
|
haftmann@36272
|
656 |
##>> fold_map (translate_tyvar_sort thy algbr eqngr permissive) vs
|
haftmann@37359
|
657 |
##>> fold_map translate_super_instance super_classes
|
haftmann@37359
|
658 |
##>> fold_map translate_classparam_instance classparams
|
haftmann@37423
|
659 |
##>> fold_map translate_classparam_instance further_classparams
|
haftmann@37423
|
660 |
#>> (fn (((((class, tyco), arity_args), super_instances),
|
haftmann@37423
|
661 |
classparam_instances), further_classparam_instances) =>
|
haftmann@37423
|
662 |
Classinst ((class, (tyco, arity_args)), (super_instances,
|
haftmann@37423
|
663 |
(classparam_instances, further_classparam_instances))));
|
haftmann@28663
|
664 |
in ensure_stmt lookup_instance (declare_instance thy) stmt_inst (class, tyco) end
|
haftmann@36272
|
665 |
and translate_typ thy algbr eqngr permissive (TFree (v, _)) =
|
haftmann@30932
|
666 |
pair (ITyVar (unprefix "'" v))
|
haftmann@36272
|
667 |
| translate_typ thy algbr eqngr permissive (Type (tyco, tys)) =
|
haftmann@36272
|
668 |
ensure_tyco thy algbr eqngr permissive tyco
|
haftmann@36272
|
669 |
##>> fold_map (translate_typ thy algbr eqngr permissive) tys
|
haftmann@30932
|
670 |
#>> (fn (tyco, tys) => tyco `%% tys)
|
haftmann@36272
|
671 |
and translate_term thy algbr eqngr permissive some_thm (Const (c, ty), some_abs) =
|
haftmann@36272
|
672 |
translate_app thy algbr eqngr permissive some_thm (((c, ty), []), some_abs)
|
haftmann@36272
|
673 |
| translate_term thy algbr eqngr permissive some_thm (Free (v, _), some_abs) =
|
haftmann@31889
|
674 |
pair (IVar (SOME v))
|
haftmann@36272
|
675 |
| translate_term thy algbr eqngr permissive some_thm (Abs (v, ty, t), some_abs) =
|
haftmann@24918
|
676 |
let
|
haftmann@32270
|
677 |
val (v', t') = Syntax.variant_abs (Name.desymbolize false v, ty, t);
|
haftmann@32270
|
678 |
val v'' = if member (op =) (Term.add_free_names t' []) v'
|
haftmann@32270
|
679 |
then SOME v' else NONE
|
haftmann@24918
|
680 |
in
|
haftmann@36272
|
681 |
translate_typ thy algbr eqngr permissive ty
|
haftmann@36272
|
682 |
##>> translate_term thy algbr eqngr permissive some_thm (t', some_abs)
|
haftmann@32270
|
683 |
#>> (fn (ty, t) => (v'', ty) `|=> t)
|
haftmann@24918
|
684 |
end
|
haftmann@36272
|
685 |
| translate_term thy algbr eqngr permissive some_thm (t as _ $ _, some_abs) =
|
haftmann@24918
|
686 |
case strip_comb t
|
haftmann@24918
|
687 |
of (Const (c, ty), ts) =>
|
haftmann@36272
|
688 |
translate_app thy algbr eqngr permissive some_thm (((c, ty), ts), some_abs)
|
haftmann@24918
|
689 |
| (t', ts) =>
|
haftmann@36272
|
690 |
translate_term thy algbr eqngr permissive some_thm (t', some_abs)
|
haftmann@36272
|
691 |
##>> fold_map (translate_term thy algbr eqngr permissive some_thm o rpair NONE) ts
|
haftmann@24918
|
692 |
#>> (fn (t, ts) => t `$$ ts)
|
haftmann@36272
|
693 |
and translate_eqn thy algbr eqngr permissive ((args, (rhs, some_abs)), (some_thm, proper)) =
|
haftmann@36272
|
694 |
fold_map (translate_term thy algbr eqngr permissive some_thm) args
|
haftmann@36272
|
695 |
##>> translate_term thy algbr eqngr permissive some_thm (rhs, some_abs)
|
haftmann@35226
|
696 |
#>> rpair (some_thm, proper)
|
haftmann@37415
|
697 |
and translate_eqns thy algbr eqngr permissive eqns prgrm =
|
haftmann@37415
|
698 |
prgrm |> fold_map (translate_eqn thy algbr eqngr permissive) eqns
|
haftmann@37415
|
699 |
handle PERMISSIVE () => ([], prgrm)
|
haftmann@36272
|
700 |
and translate_const thy algbr eqngr permissive some_thm ((c, ty), some_abs) =
|
haftmann@30932
|
701 |
let
|
haftmann@37689
|
702 |
val _ = if (case some_abs of NONE => true | SOME abs => not (c = abs))
|
haftmann@35226
|
703 |
andalso Code.is_abstr thy c
|
haftmann@37689
|
704 |
then translation_error thy permissive some_thm
|
haftmann@37689
|
705 |
"Abstraction violation" ("constant " ^ Code.string_of_const thy c)
|
haftmann@37689
|
706 |
else ()
|
haftmann@37423
|
707 |
val arg_typs = Sign.const_typargs thy (c, ty);
|
haftmann@32873
|
708 |
val sorts = Code_Preproc.sortargs eqngr c;
|
haftmann@37423
|
709 |
val function_typs = (fst o Term.strip_type) ty;
|
haftmann@26972
|
710 |
in
|
haftmann@37689
|
711 |
ensure_const thy algbr eqngr permissive c
|
haftmann@37423
|
712 |
##>> fold_map (translate_typ thy algbr eqngr permissive) arg_typs
|
haftmann@37423
|
713 |
##>> fold_map (translate_dicts thy algbr eqngr permissive some_thm) (arg_typs ~~ sorts)
|
haftmann@37423
|
714 |
##>> fold_map (translate_typ thy algbr eqngr permissive) function_typs
|
haftmann@37423
|
715 |
#>> (fn (((c, arg_typs), dss), function_typs) => IConst (c, ((arg_typs, dss), function_typs)))
|
haftmann@26972
|
716 |
end
|
haftmann@36272
|
717 |
and translate_app_const thy algbr eqngr permissive some_thm ((c_ty, ts), some_abs) =
|
haftmann@36272
|
718 |
translate_const thy algbr eqngr permissive some_thm (c_ty, some_abs)
|
haftmann@36272
|
719 |
##>> fold_map (translate_term thy algbr eqngr permissive some_thm o rpair NONE) ts
|
haftmann@24918
|
720 |
#>> (fn (t, ts) => t `$$ ts)
|
haftmann@36272
|
721 |
and translate_case thy algbr eqngr permissive some_thm (num_args, (t_pos, case_pats)) (c_ty, ts) =
|
haftmann@24918
|
722 |
let
|
haftmann@31892
|
723 |
fun arg_types num_args ty = (fst o chop num_args o fst o strip_type) ty;
|
haftmann@31892
|
724 |
val tys = arg_types num_args (snd c_ty);
|
haftmann@29889
|
725 |
val ty = nth tys t_pos;
|
haftmann@31957
|
726 |
fun mk_constr c t = let val n = Code.args_number thy c
|
haftmann@31957
|
727 |
in ((c, arg_types n (fastype_of t) ---> ty), n) end;
|
haftmann@31892
|
728 |
val constrs = if null case_pats then []
|
haftmann@31892
|
729 |
else map2 mk_constr case_pats (nth_drop t_pos ts);
|
haftmann@31892
|
730 |
fun casify naming constrs ty ts =
|
haftmann@24918
|
731 |
let
|
haftmann@31934
|
732 |
val undefineds = map_filter (lookup_const naming) (Code.undefineds thy);
|
haftmann@31934
|
733 |
fun collapse_clause vs_map ts body =
|
haftmann@31934
|
734 |
let
|
haftmann@31934
|
735 |
in case body
|
haftmann@31934
|
736 |
of IConst (c, _) => if member (op =) undefineds c
|
haftmann@31934
|
737 |
then []
|
haftmann@31934
|
738 |
else [(ts, body)]
|
haftmann@31934
|
739 |
| ICase (((IVar (SOME v), _), subclauses), _) =>
|
haftmann@31934
|
740 |
if forall (fn (pat', body') => exists_var pat' v
|
haftmann@31934
|
741 |
orelse not (exists_var body' v)) subclauses
|
haftmann@31934
|
742 |
then case AList.lookup (op =) vs_map v
|
haftmann@31934
|
743 |
of SOME i => maps (fn (pat', body') =>
|
haftmann@31934
|
744 |
collapse_clause (AList.delete (op =) v vs_map)
|
haftmann@31934
|
745 |
(nth_map i (K pat') ts) body') subclauses
|
haftmann@31934
|
746 |
| NONE => [(ts, body)]
|
haftmann@31934
|
747 |
else [(ts, body)]
|
haftmann@31934
|
748 |
| _ => [(ts, body)]
|
haftmann@31934
|
749 |
end;
|
haftmann@31934
|
750 |
fun mk_clause mk tys t =
|
haftmann@31934
|
751 |
let
|
haftmann@31934
|
752 |
val (vs, body) = unfold_abs_eta tys t;
|
haftmann@31934
|
753 |
val vs_map = fold_index (fn (i, (SOME v, _)) => cons (v, i) | _ => I) vs [];
|
haftmann@31934
|
754 |
val ts = map (IVar o fst) vs;
|
haftmann@31934
|
755 |
in map mk (collapse_clause vs_map ts body) end;
|
haftmann@31892
|
756 |
val t = nth ts t_pos;
|
haftmann@31892
|
757 |
val ts_clause = nth_drop t_pos ts;
|
haftmann@31934
|
758 |
val clauses = if null case_pats
|
haftmann@31934
|
759 |
then mk_clause (fn ([t], body) => (t, body)) [ty] (the_single ts_clause)
|
haftmann@31934
|
760 |
else maps (fn ((constr as IConst (_, (_, tys)), n), t) =>
|
haftmann@33956
|
761 |
mk_clause (fn (ts, body) => (constr `$$ ts, body)) (take n tys) t)
|
haftmann@31934
|
762 |
(constrs ~~ ts_clause);
|
haftmann@31892
|
763 |
in ((t, ty), clauses) end;
|
haftmann@24918
|
764 |
in
|
haftmann@36272
|
765 |
translate_const thy algbr eqngr permissive some_thm (c_ty, NONE)
|
haftmann@36272
|
766 |
##>> fold_map (fn (constr, n) => translate_const thy algbr eqngr permissive some_thm (constr, NONE)
|
haftmann@36272
|
767 |
#>> rpair n) constrs
|
haftmann@36272
|
768 |
##>> translate_typ thy algbr eqngr permissive ty
|
haftmann@36272
|
769 |
##>> fold_map (translate_term thy algbr eqngr permissive some_thm o rpair NONE) ts
|
haftmann@31892
|
770 |
#-> (fn (((t, constrs), ty), ts) =>
|
haftmann@31892
|
771 |
`(fn (_, (naming, _)) => ICase (casify naming constrs ty ts, t `$$ ts)))
|
haftmann@24918
|
772 |
end
|
haftmann@36272
|
773 |
and translate_app_case thy algbr eqngr permissive some_thm (case_scheme as (num_args, _)) ((c, ty), ts) =
|
haftmann@29910
|
774 |
if length ts < num_args then
|
haftmann@29910
|
775 |
let
|
haftmann@29910
|
776 |
val k = length ts;
|
haftmann@33956
|
777 |
val tys = (take (num_args - k) o drop k o fst o strip_type) ty;
|
haftmann@29910
|
778 |
val ctxt = (fold o fold_aterms) Term.declare_term_frees ts Name.context;
|
haftmann@29910
|
779 |
val vs = Name.names ctxt "a" tys;
|
haftmann@29910
|
780 |
in
|
haftmann@36272
|
781 |
fold_map (translate_typ thy algbr eqngr permissive) tys
|
haftmann@36272
|
782 |
##>> translate_case thy algbr eqngr permissive some_thm case_scheme ((c, ty), ts @ map Free vs)
|
haftmann@31888
|
783 |
#>> (fn (tys, t) => map2 (fn (v, _) => pair (SOME v)) vs tys `|==> t)
|
haftmann@29910
|
784 |
end
|
haftmann@29910
|
785 |
else if length ts > num_args then
|
haftmann@36272
|
786 |
translate_case thy algbr eqngr permissive some_thm case_scheme ((c, ty), take num_args ts)
|
haftmann@36272
|
787 |
##>> fold_map (translate_term thy algbr eqngr permissive some_thm o rpair NONE) (drop num_args ts)
|
haftmann@29910
|
788 |
#>> (fn (t, ts) => t `$$ ts)
|
haftmann@29910
|
789 |
else
|
haftmann@36272
|
790 |
translate_case thy algbr eqngr permissive some_thm case_scheme ((c, ty), ts)
|
haftmann@36272
|
791 |
and translate_app thy algbr eqngr permissive some_thm (c_ty_ts as ((c, _), _), some_abs) =
|
haftmann@29910
|
792 |
case Code.get_case_scheme thy c
|
haftmann@36272
|
793 |
of SOME case_scheme => translate_app_case thy algbr eqngr permissive some_thm case_scheme c_ty_ts
|
haftmann@36272
|
794 |
| NONE => translate_app_const thy algbr eqngr permissive some_thm (c_ty_ts, some_abs)
|
haftmann@36272
|
795 |
and translate_tyvar_sort thy (algbr as (proj_sort, _)) eqngr permissive (v, sort) =
|
haftmann@36272
|
796 |
fold_map (ensure_class thy algbr eqngr permissive) (proj_sort sort)
|
haftmann@30932
|
797 |
#>> (fn sort => (unprefix "'" v, sort))
|
haftmann@36272
|
798 |
and translate_dicts thy (algbr as (proj_sort, algebra)) eqngr permissive some_thm (ty, sort) =
|
haftmann@30932
|
799 |
let
|
haftmann@30932
|
800 |
datatype typarg =
|
haftmann@30932
|
801 |
Global of (class * string) * typarg list list
|
haftmann@30932
|
802 |
| Local of (class * class) list * (string * (int * sort));
|
haftmann@30932
|
803 |
fun class_relation (Global ((_, tyco), yss), _) class =
|
haftmann@30932
|
804 |
Global ((class, tyco), yss)
|
haftmann@37359
|
805 |
| class_relation (Local (classrels, v), sub_class) super_class =
|
haftmann@37359
|
806 |
Local ((sub_class, super_class) :: classrels, v);
|
wenzelm@36102
|
807 |
fun type_constructor (tyco, _) yss class =
|
haftmann@30932
|
808 |
Global ((class, tyco), (map o map) fst yss);
|
haftmann@30932
|
809 |
fun type_variable (TFree (v, sort)) =
|
haftmann@30932
|
810 |
let
|
haftmann@30932
|
811 |
val sort' = proj_sort sort;
|
haftmann@30932
|
812 |
in map_index (fn (n, class) => (Local ([], (v, (n, sort'))), class)) sort' end;
|
haftmann@37689
|
813 |
val typargs = Sorts.of_sort_derivation algebra
|
wenzelm@36102
|
814 |
{class_relation = K (Sorts.classrel_derivation algebra class_relation),
|
wenzelm@35972
|
815 |
type_constructor = type_constructor,
|
haftmann@37689
|
816 |
type_variable = type_variable} (ty, proj_sort sort)
|
haftmann@37689
|
817 |
handle Sorts.CLASS_ERROR e => not_wellsorted thy permissive some_thm ty sort e;
|
haftmann@30932
|
818 |
fun mk_dict (Global (inst, yss)) =
|
haftmann@36272
|
819 |
ensure_inst thy algbr eqngr permissive inst
|
haftmann@30932
|
820 |
##>> (fold_map o fold_map) mk_dict yss
|
haftmann@30932
|
821 |
#>> (fn (inst, dss) => DictConst (inst, dss))
|
haftmann@31962
|
822 |
| mk_dict (Local (classrels, (v, (n, sort)))) =
|
haftmann@36272
|
823 |
fold_map (ensure_classrel thy algbr eqngr permissive) classrels
|
haftmann@31962
|
824 |
#>> (fn classrels => DictVar (classrels, (unprefix "'" v, (n, length sort))))
|
haftmann@37689
|
825 |
in fold_map mk_dict typargs end;
|
haftmann@24918
|
826 |
|
haftmann@25969
|
827 |
|
haftmann@27103
|
828 |
(* store *)
|
haftmann@27103
|
829 |
|
haftmann@34160
|
830 |
structure Program = Code_Data
|
haftmann@27103
|
831 |
(
|
haftmann@28663
|
832 |
type T = naming * program;
|
haftmann@28663
|
833 |
val empty = (empty_naming, Graph.empty);
|
haftmann@27103
|
834 |
);
|
haftmann@27103
|
835 |
|
haftmann@36272
|
836 |
fun cache_generation thy (algebra, eqngr) f name =
|
haftmann@34246
|
837 |
Program.change_yield thy (fn naming_program => (NONE, naming_program)
|
haftmann@32873
|
838 |
|> f thy algebra eqngr name
|
haftmann@28663
|
839 |
|-> (fn name => fn (_, naming_program) => (name, naming_program)));
|
haftmann@27103
|
840 |
|
haftmann@36272
|
841 |
fun transient_generation thy (algebra, eqngr) f name =
|
haftmann@36272
|
842 |
(NONE, (empty_naming, Graph.empty))
|
haftmann@36272
|
843 |
|> f thy algebra eqngr name
|
haftmann@36272
|
844 |
|-> (fn name => fn (_, naming_program) => (name, naming_program));
|
haftmann@36272
|
845 |
|
haftmann@27103
|
846 |
|
haftmann@27103
|
847 |
(* program generation *)
|
haftmann@27103
|
848 |
|
haftmann@36272
|
849 |
fun consts_program thy permissive cs =
|
haftmann@27103
|
850 |
let
|
haftmann@38911
|
851 |
fun project_consts cs (naming, program) = (*FIXME only necessary for cache_generation*)
|
haftmann@27103
|
852 |
let
|
haftmann@27103
|
853 |
val cs_all = Graph.all_succs program cs;
|
haftmann@28663
|
854 |
in (cs, (naming, Graph.subgraph (member (op =) cs_all) program)) end;
|
haftmann@32873
|
855 |
fun generate_consts thy algebra eqngr =
|
haftmann@36272
|
856 |
fold_map (ensure_const thy algebra eqngr permissive);
|
haftmann@36272
|
857 |
val invoke_generation = if permissive
|
haftmann@36272
|
858 |
then transient_generation else cache_generation
|
haftmann@27103
|
859 |
in
|
haftmann@31125
|
860 |
invoke_generation thy (Code_Preproc.obtain thy cs []) generate_consts cs
|
haftmann@27103
|
861 |
|-> project_consts
|
haftmann@27103
|
862 |
end;
|
haftmann@27103
|
863 |
|
haftmann@27103
|
864 |
|
haftmann@27103
|
865 |
(* value evaluation *)
|
haftmann@25969
|
866 |
|
haftmann@32873
|
867 |
fun ensure_value thy algbr eqngr t =
|
haftmann@24918
|
868 |
let
|
haftmann@24918
|
869 |
val ty = fastype_of t;
|
haftmann@24918
|
870 |
val vs = fold_term_types (K (fold_atyps (insert (eq_fst op =)
|
haftmann@24918
|
871 |
o dest_TFree))) t [];
|
haftmann@24918
|
872 |
val stmt_value =
|
haftmann@36272
|
873 |
fold_map (translate_tyvar_sort thy algbr eqngr false) vs
|
haftmann@36272
|
874 |
##>> translate_typ thy algbr eqngr false ty
|
haftmann@36272
|
875 |
##>> translate_term thy algbr eqngr false NONE (Code.subst_signatures thy t, NONE)
|
haftmann@28663
|
876 |
#>> (fn ((vs, ty), t) => Fun
|
haftmann@37412
|
877 |
(Term.dummy_patternN, (((vs, ty), [(([], t), (NONE, true))]), NONE)));
|
haftmann@31063
|
878 |
fun term_value (dep, (naming, program1)) =
|
haftmann@26011
|
879 |
let
|
haftmann@37412
|
880 |
val Fun (_, ((vs_ty, [(([], t), _)]), _)) =
|
haftmann@28663
|
881 |
Graph.get_node program1 Term.dummy_patternN;
|
haftmann@28663
|
882 |
val deps = Graph.imm_succs program1 Term.dummy_patternN;
|
haftmann@28663
|
883 |
val program2 = Graph.del_nodes [Term.dummy_patternN] program1;
|
haftmann@27103
|
884 |
val deps_all = Graph.all_succs program2 deps;
|
haftmann@27103
|
885 |
val program3 = Graph.subgraph (member (op =) deps_all) program2;
|
haftmann@31063
|
886 |
in (((naming, program3), ((vs_ty, t), deps)), (dep, (naming, program2))) end;
|
haftmann@24918
|
887 |
in
|
haftmann@28663
|
888 |
ensure_stmt ((K o K) NONE) pair stmt_value Term.dummy_patternN
|
haftmann@26011
|
889 |
#> snd
|
haftmann@31063
|
890 |
#> term_value
|
haftmann@24918
|
891 |
end;
|
haftmann@24918
|
892 |
|
haftmann@32873
|
893 |
fun base_evaluator thy evaluator algebra eqngr vs t =
|
haftmann@27103
|
894 |
let
|
haftmann@31063
|
895 |
val (((naming, program), (((vs', ty'), t'), deps)), _) =
|
haftmann@36272
|
896 |
cache_generation thy (algebra, eqngr) ensure_value t;
|
haftmann@30947
|
897 |
val vs'' = map (fn (v, _) => (v, (the o AList.lookup (op =) vs o prefix "'") v)) vs';
|
haftmann@31063
|
898 |
in evaluator naming program ((vs'', (vs', ty')), t') deps end;
|
haftmann@27103
|
899 |
|
haftmann@38908
|
900 |
fun dynamic_eval_conv thy = Code_Preproc.dynamic_eval_conv thy o base_evaluator thy;
|
haftmann@38908
|
901 |
fun dynamic_eval_value thy postproc = Code_Preproc.dynamic_eval_value thy postproc o base_evaluator thy;
|
haftmann@30942
|
902 |
|
haftmann@38911
|
903 |
fun static_eval_conv thy consts conv =
|
haftmann@38911
|
904 |
Code_Preproc.static_eval_conv thy consts (base_evaluator thy conv); (*FIXME avoid re-generation*)
|
haftmann@38911
|
905 |
|
haftmann@38911
|
906 |
fun static_eval_conv_simple thy consts conv =
|
haftmann@38911
|
907 |
Code_Preproc.static_eval_conv thy consts (fn algebra => fn eqngr => fn _ => fn _ => fn ct =>
|
haftmann@38911
|
908 |
conv ((NONE, (empty_naming, Graph.empty)) (*FIXME provide abstraction for this kind of invocation*)
|
haftmann@38911
|
909 |
|> fold_map (ensure_const thy algebra eqngr false) consts
|
haftmann@38911
|
910 |
|> (snd o snd o snd)) ct);
|
haftmann@38911
|
911 |
|
haftmann@30942
|
912 |
|
haftmann@30942
|
913 |
(** diagnostic commands **)
|
haftmann@30942
|
914 |
|
haftmann@31036
|
915 |
fun read_const_exprs thy =
|
haftmann@31036
|
916 |
let
|
haftmann@36272
|
917 |
fun consts_of thy' = Symtab.fold (fn (c, (_, NONE)) => cons c | _ => I)
|
haftmann@36272
|
918 |
((snd o #constants o Consts.dest o #consts o Sign.rep_sg) thy') [];
|
haftmann@36272
|
919 |
fun belongs_here thy' c = forall
|
haftmann@36272
|
920 |
(fn thy'' => not (Sign.declared_const thy'' c)) (Theory.parents_of thy');
|
haftmann@36272
|
921 |
fun consts_of_select thy' = filter (belongs_here thy') (consts_of thy');
|
haftmann@36272
|
922 |
fun read_const_expr "*" = ([], consts_of thy)
|
haftmann@31036
|
923 |
| read_const_expr s = if String.isSuffix ".*" s
|
wenzelm@38139
|
924 |
then ([], consts_of_select (Context.this_theory thy (unsuffix ".*" s)))
|
haftmann@31156
|
925 |
else ([Code.read_const thy s], []);
|
haftmann@31036
|
926 |
in pairself flat o split_list o map read_const_expr end;
|
haftmann@31036
|
927 |
|
haftmann@30942
|
928 |
fun code_depgr thy consts =
|
haftmann@30942
|
929 |
let
|
haftmann@31125
|
930 |
val (_, eqngr) = Code_Preproc.obtain thy consts [];
|
haftmann@34160
|
931 |
val all_consts = Graph.all_succs eqngr consts;
|
haftmann@34891
|
932 |
in Graph.subgraph (member (op =) all_consts) eqngr end;
|
haftmann@30942
|
933 |
|
haftmann@31125
|
934 |
fun code_thms thy = Pretty.writeln o Code_Preproc.pretty thy o code_depgr thy;
|
haftmann@30942
|
935 |
|
haftmann@30942
|
936 |
fun code_deps thy consts =
|
haftmann@30942
|
937 |
let
|
haftmann@30942
|
938 |
val eqngr = code_depgr thy consts;
|
haftmann@30942
|
939 |
val constss = Graph.strong_conn eqngr;
|
haftmann@30942
|
940 |
val mapping = Symtab.empty |> fold (fn consts => fold (fn const =>
|
haftmann@30942
|
941 |
Symtab.update (const, consts)) consts) constss;
|
haftmann@30942
|
942 |
fun succs consts = consts
|
haftmann@30942
|
943 |
|> maps (Graph.imm_succs eqngr)
|
haftmann@30942
|
944 |
|> subtract (op =) consts
|
haftmann@30942
|
945 |
|> map (the o Symtab.lookup mapping)
|
haftmann@30942
|
946 |
|> distinct (op =);
|
haftmann@30942
|
947 |
val conn = [] |> fold (fn consts => cons (consts, succs consts)) constss;
|
haftmann@31156
|
948 |
fun namify consts = map (Code.string_of_const thy) consts
|
haftmann@30942
|
949 |
|> commas;
|
haftmann@30942
|
950 |
val prgr = map (fn (consts, constss) =>
|
haftmann@30942
|
951 |
{ name = namify consts, ID = namify consts, dir = "", unfold = true,
|
haftmann@30942
|
952 |
path = "", parents = map namify constss }) conn;
|
haftmann@30942
|
953 |
in Present.display_graph prgr end;
|
haftmann@30942
|
954 |
|
haftmann@30942
|
955 |
local
|
haftmann@30942
|
956 |
|
haftmann@31036
|
957 |
fun code_thms_cmd thy = code_thms thy o op @ o read_const_exprs thy;
|
haftmann@31036
|
958 |
fun code_deps_cmd thy = code_deps thy o op @ o read_const_exprs thy;
|
haftmann@30942
|
959 |
|
haftmann@30942
|
960 |
in
|
haftmann@30942
|
961 |
|
haftmann@30942
|
962 |
val _ =
|
wenzelm@36970
|
963 |
Outer_Syntax.improper_command "code_thms" "print system of code equations for code" Keyword.diag
|
wenzelm@36970
|
964 |
(Scan.repeat1 Parse.term_group
|
haftmann@30942
|
965 |
>> (fn cs => Toplevel.no_timing o Toplevel.unknown_theory
|
haftmann@30942
|
966 |
o Toplevel.keep ((fn thy => code_thms_cmd thy cs) o Toplevel.theory_of)));
|
haftmann@30942
|
967 |
|
haftmann@30942
|
968 |
val _ =
|
wenzelm@36970
|
969 |
Outer_Syntax.improper_command "code_deps" "visualize dependencies of code equations for code"
|
wenzelm@36970
|
970 |
Keyword.diag
|
wenzelm@36970
|
971 |
(Scan.repeat1 Parse.term_group
|
haftmann@30942
|
972 |
>> (fn cs => Toplevel.no_timing o Toplevel.unknown_theory
|
haftmann@30942
|
973 |
o Toplevel.keep ((fn thy => code_deps_cmd thy cs) o Toplevel.theory_of)));
|
haftmann@30942
|
974 |
|
haftmann@30942
|
975 |
end;
|
haftmann@27103
|
976 |
|
haftmann@24219
|
977 |
end; (*struct*)
|
haftmann@24219
|
978 |
|
haftmann@24219
|
979 |
|
haftmann@28054
|
980 |
structure Basic_Code_Thingol: BASIC_CODE_THINGOL = Code_Thingol;
|