author | haftmann |
Wed, 29 Oct 2008 11:33:40 +0100 | |
changeset 28708 | a1a436f09ec6 |
parent 28706 | 3fef773ae6b1 |
child 28724 | 4656aacba2bc |
permissions | -rw-r--r-- |
24219 | 1 |
(* Title: Tools/code/code_thingol.ML |
2 |
ID: $Id$ |
|
3 |
Author: Florian Haftmann, TU Muenchen |
|
4 |
||
5 |
Intermediate language ("Thin-gol") representing executable code. |
|
24918 | 6 |
Representation and translation. |
24219 | 7 |
*) |
8 |
||
9 |
infix 8 `%%; |
|
10 |
infix 4 `$; |
|
11 |
infix 4 `$$; |
|
12 |
infixr 3 `|->; |
|
13 |
infixr 3 `|-->; |
|
14 |
||
15 |
signature BASIC_CODE_THINGOL = |
|
16 |
sig |
|
17 |
type vname = string; |
|
18 |
datatype dict = |
|
19 |
DictConst of string * dict list list |
|
20 |
| DictVar of string list * (vname * (int * int)); |
|
21 |
datatype itype = |
|
22 |
`%% of string * itype list |
|
23 |
| ITyVar of vname; |
|
24591 | 24 |
type const = string * (dict list list * itype list (*types of arguments*)) |
24219 | 25 |
datatype iterm = |
24591 | 26 |
IConst of const |
24219 | 27 |
| IVar of vname |
28 |
| `$ of iterm * iterm |
|
29 |
| `|-> of (vname * itype) * iterm |
|
30 |
| ICase of ((iterm * itype) * (iterm * iterm) list) * iterm; |
|
31 |
(*((term, type), [(selector pattern, body term )]), primitive term)*) |
|
32 |
val `$$ : iterm * iterm list -> iterm; |
|
33 |
val `|--> : (vname * itype) list * iterm -> iterm; |
|
34 |
type typscheme = (vname * sort) list * itype; |
|
35 |
end; |
|
36 |
||
37 |
signature CODE_THINGOL = |
|
38 |
sig |
|
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
39 |
include BASIC_CODE_THINGOL |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
40 |
val unfoldl: ('a -> ('a * 'b) option) -> 'a -> 'a * 'b list |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
41 |
val unfoldr: ('a -> ('b * 'a) option) -> 'a -> 'b list * 'a |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
42 |
val unfold_fun: itype -> itype list * itype |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
43 |
val unfold_app: iterm -> iterm * iterm list |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
44 |
val split_abs: iterm -> (((vname * iterm option) * itype) * iterm) option |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
45 |
val unfold_abs: iterm -> ((vname * iterm option) * itype) list * iterm |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
46 |
val split_let: iterm -> (((iterm * itype) * iterm) * iterm) option |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
47 |
val unfold_let: iterm -> ((iterm * itype) * iterm) list * iterm |
24219 | 48 |
val unfold_const_app: iterm -> |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
49 |
((string * (dict list list * itype list)) * iterm list) option |
24219 | 50 |
val collapse_let: ((vname * itype) * iterm) * iterm |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
51 |
-> (iterm * itype) * (iterm * iterm) list |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
52 |
val eta_expand: int -> (string * (dict list list * itype list)) * iterm list -> iterm |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
53 |
val contains_dictvar: iterm -> bool |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
54 |
val locally_monomorphic: iterm -> bool |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
55 |
val fold_constnames: (string -> 'a -> 'a) -> iterm -> 'a -> 'a |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
56 |
val fold_varnames: (string -> 'a -> 'a) -> iterm -> 'a -> 'a |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
57 |
val fold_unbound_varnames: (string -> 'a -> 'a) -> iterm -> 'a -> 'a |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
58 |
|
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
59 |
type naming |
28706 | 60 |
val empty_naming: naming |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
61 |
val lookup_class: naming -> class -> string option |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
62 |
val lookup_classrel: naming -> class * class -> string option |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
63 |
val lookup_tyco: naming -> string -> string option |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
64 |
val lookup_instance: naming -> class * string -> string option |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
65 |
val lookup_const: naming -> string -> string option |
24219 | 66 |
|
24918 | 67 |
datatype stmt = |
27024 | 68 |
NoStmt |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
69 |
| Fun of string * (typscheme * ((iterm list * iterm) * (thm * bool)) list) |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
70 |
| Datatype of string * ((vname * sort) list * (string * itype list) list) |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
71 |
| Datatypecons of string * string |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
72 |
| Class of class * (vname * ((class * string) list * (string * itype) list)) |
24219 | 73 |
| Classrel of class * class |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
74 |
| Classparam of string * class |
24219 | 75 |
| Classinst of (class * (string * (vname * sort) list)) |
76 |
* ((class * (string * (string * dict list list))) list |
|
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
77 |
* ((string * const) * (thm * bool)) list) |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
78 |
type program = stmt Graph.T |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
79 |
val empty_funs: program -> string list |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
80 |
val map_terms_bottom_up: (iterm -> iterm) -> iterm -> iterm |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
81 |
val map_terms_stmt: (iterm -> iterm) -> stmt -> stmt |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
82 |
val is_cons: program -> string -> bool |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
83 |
val contr_classparam_typs: program -> string -> itype option list |
24219 | 84 |
|
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
85 |
val consts_program: theory -> string list -> string list * (naming * program) |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
86 |
val cached_program: theory -> naming * program |
27103 | 87 |
val eval_conv: theory |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
88 |
-> (term -> term * (naming -> program -> typscheme * iterm -> string list -> thm)) |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
89 |
-> cterm -> thm |
27103 | 90 |
val eval_term: theory |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
91 |
-> (term -> term * (naming -> program -> typscheme * iterm -> string list -> 'a)) |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
92 |
-> term -> 'a |
24219 | 93 |
end; |
94 |
||
28054 | 95 |
structure Code_Thingol: CODE_THINGOL = |
24219 | 96 |
struct |
97 |
||
98 |
(** auxiliary **) |
|
99 |
||
100 |
fun unfoldl dest x = |
|
101 |
case dest x |
|
102 |
of NONE => (x, []) |
|
103 |
| SOME (x1, x2) => |
|
104 |
let val (x', xs') = unfoldl dest x1 in (x', xs' @ [x2]) end; |
|
105 |
||
106 |
fun unfoldr dest x = |
|
107 |
case dest x |
|
108 |
of NONE => ([], x) |
|
109 |
| SOME (x1, x2) => |
|
110 |
let val (xs', x') = unfoldr dest x2 in (x1::xs', x') end; |
|
111 |
||
112 |
||
28369 | 113 |
(** language core - types, patterns, expressions **) |
24219 | 114 |
|
115 |
type vname = string; |
|
116 |
||
117 |
datatype dict = |
|
118 |
DictConst of string * dict list list |
|
119 |
| DictVar of string list * (vname * (int * int)); |
|
120 |
||
121 |
datatype itype = |
|
122 |
`%% of string * itype list |
|
123 |
| ITyVar of vname; |
|
124 |
||
24591 | 125 |
type const = string * (dict list list * itype list (*types of arguments*)) |
126 |
||
24219 | 127 |
datatype iterm = |
24591 | 128 |
IConst of const |
24219 | 129 |
| IVar of vname |
130 |
| `$ of iterm * iterm |
|
131 |
| `|-> of (vname * itype) * iterm |
|
132 |
| ICase of ((iterm * itype) * (iterm * iterm) list) * iterm; |
|
133 |
(*see also signature*) |
|
134 |
||
135 |
(* |
|
136 |
variable naming conventions |
|
137 |
||
138 |
bare names: |
|
139 |
variable names v |
|
140 |
class names class |
|
141 |
type constructor names tyco |
|
142 |
datatype names dtco |
|
24837 | 143 |
const names (general) c (const) |
24219 | 144 |
constructor names co |
24837 | 145 |
class parameter names classparam |
24219 | 146 |
arbitrary name s |
147 |
||
24837 | 148 |
v, c, co, classparam also annotated with types etc. |
24219 | 149 |
|
150 |
constructs: |
|
151 |
sort sort |
|
152 |
type parameters vs |
|
153 |
type ty |
|
154 |
type schemes tysm |
|
155 |
term t |
|
156 |
(term as pattern) p |
|
157 |
instance (class, tyco) inst |
|
158 |
*) |
|
159 |
||
160 |
val op `$$ = Library.foldl (op `$); |
|
161 |
val op `|--> = Library.foldr (op `|->); |
|
162 |
||
163 |
val unfold_app = unfoldl |
|
164 |
(fn op `$ t => SOME t |
|
165 |
| _ => NONE); |
|
166 |
||
167 |
val split_abs = |
|
168 |
(fn (v, ty) `|-> (t as ICase (((IVar w, _), [(p, t')]), _)) => |
|
169 |
if v = w then SOME (((v, SOME p), ty), t') else SOME (((v, NONE), ty), t) |
|
170 |
| (v, ty) `|-> t => SOME (((v, NONE), ty), t) |
|
171 |
| _ => NONE); |
|
172 |
||
173 |
val unfold_abs = unfoldr split_abs; |
|
174 |
||
175 |
val split_let = |
|
176 |
(fn ICase (((td, ty), [(p, t)]), _) => SOME (((p, ty), td), t) |
|
177 |
| _ => NONE); |
|
178 |
||
179 |
val unfold_let = unfoldr split_let; |
|
180 |
||
181 |
fun unfold_const_app t = |
|
182 |
case unfold_app t |
|
183 |
of (IConst c, ts) => SOME (c, ts) |
|
184 |
| _ => NONE; |
|
185 |
||
186 |
fun fold_aiterms f (t as IConst _) = f t |
|
187 |
| fold_aiterms f (t as IVar _) = f t |
|
188 |
| fold_aiterms f (t1 `$ t2) = fold_aiterms f t1 #> fold_aiterms f t2 |
|
189 |
| fold_aiterms f (t as _ `|-> t') = f t #> fold_aiterms f t' |
|
190 |
| fold_aiterms f (ICase (_, t)) = fold_aiterms f t; |
|
191 |
||
192 |
fun fold_constnames f = |
|
193 |
let |
|
194 |
fun add (IConst (c, _)) = f c |
|
195 |
| add _ = I; |
|
196 |
in fold_aiterms add end; |
|
197 |
||
198 |
fun fold_varnames f = |
|
199 |
let |
|
200 |
fun add (IVar v) = f v |
|
201 |
| add ((v, _) `|-> _) = f v |
|
202 |
| add _ = I; |
|
203 |
in fold_aiterms add end; |
|
204 |
||
205 |
fun fold_unbound_varnames f = |
|
206 |
let |
|
207 |
fun add _ (IConst _) = I |
|
208 |
| add vs (IVar v) = if not (member (op =) vs v) then f v else I |
|
209 |
| add vs (t1 `$ t2) = add vs t1 #> add vs t2 |
|
210 |
| add vs ((v, _) `|-> t) = add (insert (op =) v vs) t |
|
211 |
| add vs (ICase (_, t)) = add vs t; |
|
212 |
in add [] end; |
|
213 |
||
214 |
fun collapse_let (((v, ty), se), be as ICase (((IVar w, _), ds), _)) = |
|
215 |
let |
|
216 |
fun exists_v t = fold_unbound_varnames (fn w => fn b => |
|
217 |
b orelse v = w) t false; |
|
218 |
in if v = w andalso forall (fn (t1, t2) => |
|
219 |
exists_v t1 orelse not (exists_v t2)) ds |
|
220 |
then ((se, ty), ds) |
|
221 |
else ((se, ty), [(IVar v, be)]) |
|
222 |
end |
|
223 |
| collapse_let (((v, ty), se), be) = |
|
224 |
((se, ty), [(IVar v, be)]) |
|
225 |
||
27711 | 226 |
fun eta_expand k (c as (_, (_, tys)), ts) = |
24219 | 227 |
let |
228 |
val j = length ts; |
|
229 |
val l = k - j; |
|
230 |
val ctxt = (fold o fold_varnames) Name.declare ts Name.context; |
|
231 |
val vs_tys = Name.names ctxt "a" ((curry Library.take l o curry Library.drop j) tys); |
|
232 |
in vs_tys `|--> IConst c `$$ ts @ map (fn (v, _) => IVar v) vs_tys end; |
|
233 |
||
24662
f79f6061525c
more precise treatment of free dictionary parameters for evaluation
haftmann
parents:
24591
diff
changeset
|
234 |
fun contains_dictvar t = |
f79f6061525c
more precise treatment of free dictionary parameters for evaluation
haftmann
parents:
24591
diff
changeset
|
235 |
let |
f79f6061525c
more precise treatment of free dictionary parameters for evaluation
haftmann
parents:
24591
diff
changeset
|
236 |
fun contains (DictConst (_, dss)) = (fold o fold) contains dss |
f79f6061525c
more precise treatment of free dictionary parameters for evaluation
haftmann
parents:
24591
diff
changeset
|
237 |
| contains (DictVar _) = K true; |
f79f6061525c
more precise treatment of free dictionary parameters for evaluation
haftmann
parents:
24591
diff
changeset
|
238 |
in |
f79f6061525c
more precise treatment of free dictionary parameters for evaluation
haftmann
parents:
24591
diff
changeset
|
239 |
fold_aiterms |
f79f6061525c
more precise treatment of free dictionary parameters for evaluation
haftmann
parents:
24591
diff
changeset
|
240 |
(fn IConst (_, (dss, _)) => (fold o fold) contains dss | _ => I) t false |
f79f6061525c
more precise treatment of free dictionary parameters for evaluation
haftmann
parents:
24591
diff
changeset
|
241 |
end; |
f79f6061525c
more precise treatment of free dictionary parameters for evaluation
haftmann
parents:
24591
diff
changeset
|
242 |
|
25621 | 243 |
fun locally_monomorphic (IConst _) = false |
244 |
| locally_monomorphic (IVar _) = true |
|
245 |
| locally_monomorphic (t `$ _) = locally_monomorphic t |
|
246 |
| locally_monomorphic (_ `|-> t) = locally_monomorphic t |
|
247 |
| locally_monomorphic (ICase ((_, ds), _)) = exists (locally_monomorphic o snd) ds; |
|
248 |
||
249 |
||
28688 | 250 |
(** namings **) |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
251 |
|
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
252 |
(* policies *) |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
253 |
|
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
254 |
local |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
255 |
fun thyname_of thy f x = the (AList.lookup (op =) (f x) Markup.theory_nameN); |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
256 |
fun thyname_of_class thy = |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
257 |
thyname_of thy (ProofContext.query_class (ProofContext.init thy)); |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
258 |
fun thyname_of_tyco thy = |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
259 |
thyname_of thy (Type.the_tags (Sign.tsig_of thy)); |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
260 |
fun thyname_of_instance thy inst = case AxClass.arity_property thy inst Markup.theory_nameN |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
261 |
of [] => error ("no such instance: " ^ quote (snd inst ^ " :: " ^ fst inst)) |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
262 |
| thyname :: _ => thyname; |
28706 | 263 |
fun thyname_of_const thy c = case AxClass.class_of_param thy c |
264 |
of SOME class => thyname_of_class thy class |
|
265 |
| NONE => (case Code.get_datatype_of_constr thy c |
|
266 |
of SOME dtco => thyname_of_tyco thy dtco |
|
267 |
| NONE => thyname_of thy (Consts.the_tags (Sign.consts_of thy)) c); |
|
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
268 |
fun namify thy get_basename get_thyname name = |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
269 |
let |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
270 |
val prefix = get_thyname thy name; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
271 |
val base = (Code_Name.purify_base true o get_basename) name; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
272 |
in NameSpace.append prefix base end; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
273 |
in |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
274 |
|
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
275 |
fun namify_class thy = namify thy NameSpace.base thyname_of_class; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
276 |
fun namify_classrel thy = namify thy (fn (class1, class2) => |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
277 |
NameSpace.base class2 ^ "_" ^ NameSpace.base class1) (fn thy => thyname_of_class thy o fst); |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
278 |
(*order fits nicely with composed projections*) |
28688 | 279 |
fun namify_tyco thy "fun" = "Pure.fun" |
280 |
| namify_tyco thy tyco = namify thy NameSpace.base thyname_of_tyco tyco; |
|
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
281 |
fun namify_instance thy = namify thy (fn (class, tyco) => |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
282 |
NameSpace.base class ^ "_" ^ NameSpace.base tyco) thyname_of_instance; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
283 |
fun namify_const thy = namify thy NameSpace.base thyname_of_const; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
284 |
|
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
285 |
end; (* local *) |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
286 |
|
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
287 |
|
28688 | 288 |
(* data *) |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
289 |
|
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
290 |
structure StringPairTab = Code_Name.StringPairTab; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
291 |
|
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
292 |
datatype naming = Naming of { |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
293 |
class: class Symtab.table * Name.context, |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
294 |
classrel: string StringPairTab.table * Name.context, |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
295 |
tyco: string Symtab.table * Name.context, |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
296 |
instance: string StringPairTab.table * Name.context, |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
297 |
const: string Symtab.table * Name.context |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
298 |
} |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
299 |
|
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
300 |
fun dest_Naming (Naming naming) = naming; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
301 |
|
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
302 |
val empty_naming = Naming { |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
303 |
class = (Symtab.empty, Name.context), |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
304 |
classrel = (StringPairTab.empty, Name.context), |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
305 |
tyco = (Symtab.empty, Name.context), |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
306 |
instance = (StringPairTab.empty, Name.context), |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
307 |
const = (Symtab.empty, Name.context) |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
308 |
}; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
309 |
|
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
310 |
local |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
311 |
fun mk_naming (class, classrel, tyco, instance, const) = |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
312 |
Naming { class = class, classrel = classrel, |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
313 |
tyco = tyco, instance = instance, const = const }; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
314 |
fun map_naming f (Naming { class, classrel, tyco, instance, const }) = |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
315 |
mk_naming (f (class, classrel, tyco, instance, const)); |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
316 |
in |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
317 |
fun map_class f = map_naming |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
318 |
(fn (class, classrel, tyco, inst, const) => |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
319 |
(f class, classrel, tyco, inst, const)); |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
320 |
fun map_classrel f = map_naming |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
321 |
(fn (class, classrel, tyco, inst, const) => |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
322 |
(class, f classrel, tyco, inst, const)); |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
323 |
fun map_tyco f = map_naming |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
324 |
(fn (class, classrel, tyco, inst, const) => |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
325 |
(class, classrel, f tyco, inst, const)); |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
326 |
fun map_instance f = map_naming |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
327 |
(fn (class, classrel, tyco, inst, const) => |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
328 |
(class, classrel, tyco, f inst, const)); |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
329 |
fun map_const f = map_naming |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
330 |
(fn (class, classrel, tyco, inst, const) => |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
331 |
(class, classrel, tyco, inst, f const)); |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
332 |
end; (*local*) |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
333 |
|
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
334 |
fun add_variant update (thing, name) (tab, used) = |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
335 |
let |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
336 |
val (name', used') = yield_singleton Name.variants name used; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
337 |
val tab' = update (thing, name') tab; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
338 |
in (tab', used') end; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
339 |
|
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
340 |
fun declare thy mapp lookup update namify thing = |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
341 |
mapp (add_variant update (thing, namify thy thing)) |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
342 |
#> `(fn naming => the (lookup naming thing)); |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
343 |
|
28688 | 344 |
|
345 |
(* lookup and declare *) |
|
346 |
||
347 |
local |
|
348 |
||
349 |
val suffix_class = "class"; |
|
350 |
val suffix_classrel = "classrel" |
|
351 |
val suffix_tyco = "tyco"; |
|
352 |
val suffix_instance = "inst"; |
|
353 |
val suffix_const = "const"; |
|
354 |
||
355 |
fun add_suffix nsp NONE = NONE |
|
356 |
| add_suffix nsp (SOME name) = SOME (NameSpace.append name nsp); |
|
357 |
||
358 |
in |
|
359 |
||
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
360 |
val lookup_class = add_suffix suffix_class |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
361 |
oo Symtab.lookup o fst o #class o dest_Naming; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
362 |
val lookup_classrel = add_suffix suffix_classrel |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
363 |
oo StringPairTab.lookup o fst o #classrel o dest_Naming; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
364 |
val lookup_tyco = add_suffix suffix_tyco |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
365 |
oo Symtab.lookup o fst o #tyco o dest_Naming; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
366 |
val lookup_instance = add_suffix suffix_instance |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
367 |
oo StringPairTab.lookup o fst o #instance o dest_Naming; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
368 |
val lookup_const = add_suffix suffix_const |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
369 |
oo Symtab.lookup o fst o #const o dest_Naming; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
370 |
|
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
371 |
fun declare_class thy = declare thy map_class |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
372 |
lookup_class Symtab.update_new namify_class; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
373 |
fun declare_classrel thy = declare thy map_classrel |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
374 |
lookup_classrel StringPairTab.update_new namify_classrel; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
375 |
fun declare_tyco thy = declare thy map_tyco |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
376 |
lookup_tyco Symtab.update_new namify_tyco; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
377 |
fun declare_instance thy = declare thy map_instance |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
378 |
lookup_instance StringPairTab.update_new namify_instance; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
379 |
fun declare_const thy = declare thy map_const |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
380 |
lookup_const Symtab.update_new namify_const; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
381 |
|
28688 | 382 |
val unfold_fun = unfoldr |
383 |
(fn "Pure.fun.tyco" `%% [ty1, ty2] => SOME (ty1, ty2) |
|
384 |
| _ => NONE); (*depends on suffix_tyco and namify_tyco!*) |
|
385 |
||
386 |
end; (* local *) |
|
387 |
||
24219 | 388 |
|
27103 | 389 |
(** statements, abstract programs **) |
24219 | 390 |
|
391 |
type typscheme = (vname * sort) list * itype; |
|
24918 | 392 |
datatype stmt = |
27024 | 393 |
NoStmt |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
394 |
| Fun of string * (typscheme * ((iterm list * iterm) * (thm * bool)) list) |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
395 |
| Datatype of string * ((vname * sort) list * (string * itype list) list) |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
396 |
| Datatypecons of string * string |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
397 |
| Class of class * (vname * ((class * string) list * (string * itype) list)) |
24219 | 398 |
| Classrel of class * class |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
399 |
| Classparam of string * class |
24219 | 400 |
| Classinst of (class * (string * (vname * sort) list)) |
401 |
* ((class * (string * (string * dict list list))) list |
|
28350 | 402 |
* ((string * const) * (thm * bool)) list); |
24219 | 403 |
|
27103 | 404 |
type program = stmt Graph.T; |
24219 | 405 |
|
27103 | 406 |
fun empty_funs program = |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
407 |
Graph.fold (fn (name, (Fun (c, (_, [])), _)) => cons c |
27103 | 408 |
| _ => I) program []; |
24219 | 409 |
|
27711 | 410 |
fun map_terms_bottom_up f (t as IConst _) = f t |
411 |
| map_terms_bottom_up f (t as IVar _) = f t |
|
412 |
| map_terms_bottom_up f (t1 `$ t2) = f |
|
413 |
(map_terms_bottom_up f t1 `$ map_terms_bottom_up f t2) |
|
414 |
| map_terms_bottom_up f ((v, ty) `|-> t) = f |
|
415 |
((v, ty) `|-> map_terms_bottom_up f t) |
|
416 |
| map_terms_bottom_up f (ICase (((t, ty), ps), t0)) = f |
|
417 |
(ICase (((map_terms_bottom_up f t, ty), (map o pairself) |
|
418 |
(map_terms_bottom_up f) ps), map_terms_bottom_up f t0)); |
|
419 |
||
420 |
fun map_terms_stmt f NoStmt = NoStmt |
|
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
421 |
| map_terms_stmt f (Fun (c, (tysm, eqs))) = Fun (c, (tysm, (map o apfst) |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
422 |
(fn (ts, t) => (map f ts, f t)) eqs)) |
27711 | 423 |
| map_terms_stmt f (stmt as Datatype _) = stmt |
424 |
| map_terms_stmt f (stmt as Datatypecons _) = stmt |
|
425 |
| map_terms_stmt f (stmt as Class _) = stmt |
|
426 |
| map_terms_stmt f (stmt as Classrel _) = stmt |
|
427 |
| map_terms_stmt f (stmt as Classparam _) = stmt |
|
428 |
| map_terms_stmt f (Classinst (arity, (superarities, classparms))) = |
|
429 |
Classinst (arity, (superarities, (map o apfst o apsnd) (fn const => |
|
430 |
case f (IConst const) of IConst const' => const') classparms)); |
|
431 |
||
27103 | 432 |
fun is_cons program name = case Graph.get_node program name |
24219 | 433 |
of Datatypecons _ => true |
434 |
| _ => false; |
|
435 |
||
27103 | 436 |
fun contr_classparam_typs program name = case Graph.get_node program name |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
437 |
of Classparam (_, class) => let |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
438 |
val Class (_, (_, (_, params))) = Graph.get_node program class; |
25621 | 439 |
val SOME ty = AList.lookup (op =) params name; |
440 |
val (tys, res_ty) = unfold_fun ty; |
|
441 |
fun no_tyvar (_ `%% tys) = forall no_tyvar tys |
|
442 |
| no_tyvar (ITyVar _) = false; |
|
443 |
in if no_tyvar res_ty |
|
444 |
then map (fn ty => if no_tyvar ty then NONE else SOME ty) tys |
|
445 |
else [] |
|
446 |
end |
|
447 |
| _ => []; |
|
448 |
||
24219 | 449 |
|
27103 | 450 |
(** translation kernel **) |
24219 | 451 |
|
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
452 |
fun ensure_stmt lookup declare generate thing (dep, (naming, program)) = |
24219 | 453 |
let |
28706 | 454 |
fun add_dep name = case dep of NONE => I |
455 |
| SOME dep => Graph.add_edge (dep, name); |
|
456 |
val (name, naming') = case lookup naming thing |
|
457 |
of SOME name => (name, naming) |
|
458 |
| NONE => declare thing naming; |
|
459 |
in case try (Graph.get_node program) name |
|
460 |
of SOME stmt => program |
|
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
461 |
|> add_dep name |
28706 | 462 |
|> pair naming' |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
463 |
|> pair dep |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
464 |
|> pair name |
28706 | 465 |
| NONE => program |
466 |
|> Graph.default_node (name, NoStmt) |
|
467 |
|> add_dep name |
|
468 |
|> pair naming' |
|
469 |
|> curry generate (SOME name) |
|
470 |
||> snd |
|
471 |
|-> (fn stmt => (apsnd o Graph.map_node name) (K stmt)) |
|
472 |
|> pair dep |
|
473 |
|> pair name |
|
24219 | 474 |
end; |
475 |
||
26972 | 476 |
fun not_wellsorted thy thm ty sort e = |
477 |
let |
|
478 |
val err_class = Sorts.class_error (Syntax.pp_global thy) e; |
|
479 |
val err_thm = case thm |
|
480 |
of SOME thm => "\n(in defining equation " ^ Display.string_of_thm thm ^ ")" | NONE => ""; |
|
481 |
val err_typ = "Type " ^ Syntax.string_of_typ_global thy ty ^ " not of sort " |
|
482 |
^ Syntax.string_of_sort_global thy sort; |
|
483 |
in error ("Wellsortedness error" ^ err_thm ^ ":\n" ^ err_typ ^ "\n" ^ err_class) end; |
|
484 |
||
485 |
fun ensure_class thy (algbr as (_, algebra)) funcgr class = |
|
24918 | 486 |
let |
487 |
val superclasses = (Sorts.certify_sort algebra o Sorts.super_classes algebra) class; |
|
24969 | 488 |
val cs = #params (AxClass.get_info thy class); |
24918 | 489 |
val stmt_class = |
490 |
fold_map (fn superclass => ensure_class thy algbr funcgr superclass |
|
491 |
##>> ensure_classrel thy algbr funcgr (class, superclass)) superclasses |
|
492 |
##>> fold_map (fn (c, ty) => ensure_const thy algbr funcgr c |
|
28688 | 493 |
##>> translate_typ thy algbr funcgr ty) cs |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
494 |
#>> (fn info => Class (class, (unprefix "'" Name.aT, info))) |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
495 |
in ensure_stmt lookup_class (declare_class thy) stmt_class class end |
24918 | 496 |
and ensure_classrel thy algbr funcgr (subclass, superclass) = |
497 |
let |
|
498 |
val stmt_classrel = |
|
499 |
ensure_class thy algbr funcgr subclass |
|
500 |
##>> ensure_class thy algbr funcgr superclass |
|
501 |
#>> Classrel; |
|
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
502 |
in ensure_stmt lookup_classrel (declare_classrel thy) stmt_classrel (subclass, superclass) end |
28688 | 503 |
and ensure_tyco thy algbr funcgr tyco = |
504 |
let |
|
505 |
val stmt_datatype = |
|
24918 | 506 |
let |
28688 | 507 |
val (vs, cos) = Code.get_datatype thy tyco; |
508 |
in |
|
509 |
fold_map (translate_tyvar_sort thy algbr funcgr) vs |
|
510 |
##>> fold_map (fn (c, tys) => |
|
511 |
ensure_const thy algbr funcgr c |
|
512 |
##>> fold_map (translate_typ thy algbr funcgr) tys) cos |
|
513 |
#>> (fn info => Datatype (tyco, info)) |
|
514 |
end; |
|
515 |
in ensure_stmt lookup_tyco (declare_tyco thy) stmt_datatype tyco end |
|
516 |
and translate_tyvar_sort thy (algbr as (proj_sort, _)) funcgr (v, sort) = |
|
24918 | 517 |
fold_map (ensure_class thy algbr funcgr) (proj_sort sort) |
518 |
#>> (fn sort => (unprefix "'" v, sort)) |
|
28688 | 519 |
and translate_typ thy algbr funcgr (TFree v_sort) = |
520 |
translate_tyvar_sort thy algbr funcgr v_sort |
|
24918 | 521 |
#>> (fn (v, sort) => ITyVar v) |
28688 | 522 |
| translate_typ thy algbr funcgr (Type (tyco, tys)) = |
24918 | 523 |
ensure_tyco thy algbr funcgr tyco |
28688 | 524 |
##>> fold_map (translate_typ thy algbr funcgr) tys |
24918 | 525 |
#>> (fn (tyco, tys) => tyco `%% tys) |
28688 | 526 |
and translate_dicts thy (algbr as (proj_sort, algebra)) funcgr thm (ty, sort) = |
24918 | 527 |
let |
26939
1035c89b4c02
moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents:
26011
diff
changeset
|
528 |
val pp = Syntax.pp_global thy; |
24918 | 529 |
datatype typarg = |
530 |
Global of (class * string) * typarg list list |
|
531 |
| Local of (class * class) list * (string * (int * sort)); |
|
532 |
fun class_relation (Global ((_, tyco), yss), _) class = |
|
533 |
Global ((class, tyco), yss) |
|
534 |
| class_relation (Local (classrels, v), subclass) superclass = |
|
535 |
Local ((subclass, superclass) :: classrels, v); |
|
536 |
fun type_constructor tyco yss class = |
|
537 |
Global ((class, tyco), (map o map) fst yss); |
|
538 |
fun type_variable (TFree (v, sort)) = |
|
539 |
let |
|
540 |
val sort' = proj_sort sort; |
|
541 |
in map_index (fn (n, class) => (Local ([], (v, (n, sort'))), class)) sort' end; |
|
542 |
val typargs = Sorts.of_sort_derivation pp algebra |
|
543 |
{class_relation = class_relation, type_constructor = type_constructor, |
|
26972 | 544 |
type_variable = type_variable} (ty, proj_sort sort) |
545 |
handle Sorts.CLASS_ERROR e => not_wellsorted thy thm ty sort e; |
|
24918 | 546 |
fun mk_dict (Global (inst, yss)) = |
547 |
ensure_inst thy algbr funcgr inst |
|
548 |
##>> (fold_map o fold_map) mk_dict yss |
|
549 |
#>> (fn (inst, dss) => DictConst (inst, dss)) |
|
550 |
| mk_dict (Local (classrels, (v, (k, sort)))) = |
|
551 |
fold_map (ensure_classrel thy algbr funcgr) classrels |
|
552 |
#>> (fn classrels => DictVar (classrels, (unprefix "'" v, (k, length sort)))) |
|
27422 | 553 |
in fold_map mk_dict typargs end |
28688 | 554 |
and translate_eq thy algbr funcgr (thm, linear) = |
24918 | 555 |
let |
556 |
val (args, rhs) = (apfst (snd o strip_comb) o Logic.dest_equals |
|
557 |
o Logic.unvarify o prop_of) thm; |
|
558 |
in |
|
28688 | 559 |
fold_map (translate_term thy algbr funcgr (SOME thm)) args |
560 |
##>> translate_term thy algbr funcgr (SOME thm) rhs |
|
28350 | 561 |
#>> rpair (thm, linear) |
24918 | 562 |
end |
26972 | 563 |
and ensure_inst thy (algbr as (_, algebra)) funcgr (class, tyco) = |
24918 | 564 |
let |
565 |
val superclasses = (Sorts.certify_sort algebra o Sorts.super_classes algebra) class; |
|
24969 | 566 |
val classparams = these (try (#params o AxClass.get_info thy) class); |
24918 | 567 |
val vs = Name.names Name.context "'a" (Sorts.mg_domain algebra tyco [class]); |
568 |
val sorts' = Sorts.mg_domain (Sign.classes_of thy) tyco [class]; |
|
569 |
val vs' = map2 (fn (v, sort1) => fn sort2 => (v, |
|
570 |
Sorts.inter_sort (Sign.classes_of thy) (sort1, sort2))) vs sorts'; |
|
571 |
val arity_typ = Type (tyco, map TFree vs); |
|
572 |
val arity_typ' = Type (tyco, map (fn (v, sort) => TVar ((v, 0), sort)) vs'); |
|
28688 | 573 |
fun translate_superarity superclass = |
24918 | 574 |
ensure_class thy algbr funcgr superclass |
575 |
##>> ensure_classrel thy algbr funcgr (class, superclass) |
|
28688 | 576 |
##>> translate_dicts thy algbr funcgr NONE (arity_typ, [superclass]) |
24918 | 577 |
#>> (fn ((superclass, classrel), [DictConst (inst, dss)]) => |
578 |
(superclass, (classrel, (inst, dss)))); |
|
28688 | 579 |
fun translate_classparam_inst (c, ty) = |
24918 | 580 |
let |
581 |
val c_inst = Const (c, map_type_tfree (K arity_typ') ty); |
|
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25485
diff
changeset
|
582 |
val thm = AxClass.unoverload_conv thy (Thm.cterm_of thy c_inst); |
24918 | 583 |
val c_ty = (apsnd Logic.unvarifyT o dest_Const o snd |
584 |
o Logic.dest_equals o Thm.prop_of) thm; |
|
585 |
in |
|
586 |
ensure_const thy algbr funcgr c |
|
28688 | 587 |
##>> translate_const thy algbr funcgr (SOME thm) c_ty |
28350 | 588 |
#>> (fn (c, IConst c_inst) => ((c, c_inst), (thm, true))) |
24918 | 589 |
end; |
590 |
val stmt_inst = |
|
591 |
ensure_class thy algbr funcgr class |
|
592 |
##>> ensure_tyco thy algbr funcgr tyco |
|
28688 | 593 |
##>> fold_map (translate_tyvar_sort thy algbr funcgr) vs |
594 |
##>> fold_map translate_superarity superclasses |
|
595 |
##>> fold_map translate_classparam_inst classparams |
|
24918 | 596 |
#>> (fn ((((class, tyco), arity), superarities), classparams) => |
597 |
Classinst ((class, (tyco, arity)), (superarities, classparams))); |
|
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
598 |
in ensure_stmt lookup_instance (declare_instance thy) stmt_inst (class, tyco) end |
26972 | 599 |
and ensure_const thy algbr funcgr c = |
24918 | 600 |
let |
601 |
fun stmt_datatypecons tyco = |
|
602 |
ensure_tyco thy algbr funcgr tyco |
|
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
603 |
#>> (fn tyco => Datatypecons (c, tyco)); |
24918 | 604 |
fun stmt_classparam class = |
605 |
ensure_class thy algbr funcgr class |
|
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
606 |
#>> (fn class => Classparam (c, class)); |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
607 |
fun stmt_fun ((vs, raw_ty), raw_thms) = |
24918 | 608 |
let |
26972 | 609 |
val ty = Logic.unvarifyT raw_ty; |
24918 | 610 |
val thms = if (null o Term.typ_tfrees) ty orelse (null o fst o strip_type) ty |
611 |
then raw_thms |
|
28423 | 612 |
else (map o apfst) (Code_Unit.expand_eta thy 1) raw_thms; |
24918 | 613 |
in |
28688 | 614 |
fold_map (translate_tyvar_sort thy algbr funcgr) vs |
615 |
##>> translate_typ thy algbr funcgr ty |
|
616 |
##>> fold_map (translate_eq thy algbr funcgr) thms |
|
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
617 |
#>> (fn info => Fun (c, info)) |
24918 | 618 |
end; |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
619 |
val stmt_const = case Code.get_datatype_of_constr thy c |
24918 | 620 |
of SOME tyco => stmt_datatypecons tyco |
621 |
| NONE => (case AxClass.class_of_param thy c |
|
622 |
of SOME class => stmt_classparam class |
|
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
623 |
| NONE => stmt_fun (Code_Funcgr.typ funcgr c, Code_Funcgr.eqns funcgr c)) |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
624 |
in ensure_stmt lookup_const (declare_const thy) stmt_const c end |
28688 | 625 |
and translate_term thy algbr funcgr thm (Const (c, ty)) = |
626 |
translate_app thy algbr funcgr thm ((c, ty), []) |
|
627 |
| translate_term thy algbr funcgr thm (Free (v, _)) = |
|
24918 | 628 |
pair (IVar v) |
28688 | 629 |
| translate_term thy algbr funcgr thm (Abs (abs as (_, ty, _))) = |
24918 | 630 |
let |
631 |
val (v, t) = Syntax.variant_abs abs; |
|
632 |
in |
|
28688 | 633 |
translate_typ thy algbr funcgr ty |
634 |
##>> translate_term thy algbr funcgr thm t |
|
24918 | 635 |
#>> (fn (ty, t) => (v, ty) `|-> t) |
636 |
end |
|
28688 | 637 |
| translate_term thy algbr funcgr thm (t as _ $ _) = |
24918 | 638 |
case strip_comb t |
639 |
of (Const (c, ty), ts) => |
|
28688 | 640 |
translate_app thy algbr funcgr thm ((c, ty), ts) |
24918 | 641 |
| (t', ts) => |
28688 | 642 |
translate_term thy algbr funcgr thm t' |
643 |
##>> fold_map (translate_term thy algbr funcgr thm) ts |
|
24918 | 644 |
#>> (fn (t, ts) => t `$$ ts) |
28688 | 645 |
and translate_const thy algbr funcgr thm (c, ty) = |
26972 | 646 |
let |
647 |
val tys = Sign.const_typargs thy (c, ty); |
|
28054 | 648 |
val sorts = (map snd o fst o Code_Funcgr.typ funcgr) c; |
26972 | 649 |
val tys_args = (fst o Term.strip_type) ty; |
650 |
in |
|
651 |
ensure_const thy algbr funcgr c |
|
28688 | 652 |
##>> fold_map (translate_dicts thy algbr funcgr thm) (tys ~~ sorts) |
653 |
##>> fold_map (translate_typ thy algbr funcgr) tys_args |
|
26972 | 654 |
#>> (fn ((c, iss), tys) => IConst (c, (iss, tys))) |
655 |
end |
|
28688 | 656 |
and translate_app_default thy algbr funcgr thm (c_ty, ts) = |
657 |
translate_const thy algbr funcgr thm c_ty |
|
658 |
##>> fold_map (translate_term thy algbr funcgr thm) ts |
|
24918 | 659 |
#>> (fn (t, ts) => t `$$ ts) |
28688 | 660 |
and translate_case thy algbr funcgr thm n cases (app as ((c, ty), ts)) = |
24918 | 661 |
let |
662 |
val (tys, _) = |
|
663 |
(chop (1 + (if null cases then 1 else length cases)) o fst o strip_type) ty; |
|
664 |
val dt = nth ts n; |
|
665 |
val dty = nth tys n; |
|
666 |
fun is_undefined (Const (c, _)) = Code.is_undefined thy c |
|
667 |
| is_undefined _ = false; |
|
668 |
fun mk_case (co, n) t = |
|
669 |
let |
|
28708
a1a436f09ec6
explicit check for pattern discipline before code translation
haftmann
parents:
28706
diff
changeset
|
670 |
val _ = if (is_some o Code.get_datatype_of_constr thy) co then () |
a1a436f09ec6
explicit check for pattern discipline before code translation
haftmann
parents:
28706
diff
changeset
|
671 |
else error ("Non-constructor " ^ quote co |
a1a436f09ec6
explicit check for pattern discipline before code translation
haftmann
parents:
28706
diff
changeset
|
672 |
^ " encountered in case pattern" |
a1a436f09ec6
explicit check for pattern discipline before code translation
haftmann
parents:
28706
diff
changeset
|
673 |
^ (case thm of NONE => "" |
a1a436f09ec6
explicit check for pattern discipline before code translation
haftmann
parents:
28706
diff
changeset
|
674 |
| SOME thm => ", in equation\n" ^ Display.string_of_thm thm)) |
24918 | 675 |
val (vs, body) = Term.strip_abs_eta n t; |
676 |
val selector = list_comb (Const (co, map snd vs ---> dty), map Free vs); |
|
677 |
in if is_undefined body then NONE else SOME (selector, body) end; |
|
678 |
fun mk_ds [] = |
|
679 |
let |
|
680 |
val ([v_ty], body) = Term.strip_abs_eta 1 (the_single (nth_drop n ts)) |
|
681 |
in [(Free v_ty, body)] end |
|
682 |
| mk_ds cases = map_filter (uncurry mk_case) |
|
28054 | 683 |
(AList.make (Code_Unit.no_args thy) cases ~~ nth_drop n ts); |
24918 | 684 |
in |
28688 | 685 |
translate_term thy algbr funcgr thm dt |
686 |
##>> translate_typ thy algbr funcgr dty |
|
687 |
##>> fold_map (fn (pat, body) => translate_term thy algbr funcgr thm pat |
|
688 |
##>> translate_term thy algbr funcgr thm body) (mk_ds cases) |
|
689 |
##>> translate_app_default thy algbr funcgr thm app |
|
24918 | 690 |
#>> (fn (((dt, dty), ds), t0) => ICase (((dt, dty), ds), t0)) |
691 |
end |
|
28688 | 692 |
and translate_app thy algbr funcgr thm ((c, ty), ts) = case Code.get_case_data thy c |
24918 | 693 |
of SOME (n, cases) => let val i = 1 + (if null cases then 1 else length cases) in |
694 |
if length ts < i then |
|
695 |
let |
|
696 |
val k = length ts; |
|
697 |
val tys = (curry Library.take (i - k) o curry Library.drop k o fst o strip_type) ty; |
|
698 |
val ctxt = (fold o fold_aterms) |
|
699 |
(fn Free (v, _) => Name.declare v | _ => I) ts Name.context; |
|
700 |
val vs = Name.names ctxt "a" tys; |
|
701 |
in |
|
28688 | 702 |
fold_map (translate_typ thy algbr funcgr) tys |
703 |
##>> translate_case thy algbr funcgr thm n cases ((c, ty), ts @ map Free vs) |
|
24918 | 704 |
#>> (fn (tys, t) => map2 (fn (v, _) => pair v) vs tys `|--> t) |
705 |
end |
|
706 |
else if length ts > i then |
|
28688 | 707 |
translate_case thy algbr funcgr thm n cases ((c, ty), Library.take (i, ts)) |
708 |
##>> fold_map (translate_term thy algbr funcgr thm) (Library.drop (i, ts)) |
|
24918 | 709 |
#>> (fn (t, ts) => t `$$ ts) |
710 |
else |
|
28688 | 711 |
translate_case thy algbr funcgr thm n cases ((c, ty), ts) |
24918 | 712 |
end |
28688 | 713 |
| NONE => translate_app_default thy algbr funcgr thm ((c, ty), ts); |
24918 | 714 |
|
25969 | 715 |
|
27103 | 716 |
(** generated programs **) |
717 |
||
718 |
(* store *) |
|
719 |
||
720 |
structure Program = CodeDataFun |
|
721 |
( |
|
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
722 |
type T = naming * program; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
723 |
val empty = (empty_naming, Graph.empty); |
28706 | 724 |
fun purge thy cs (naming, program) = |
27609 | 725 |
let |
28706 | 726 |
val names_delete = cs |
727 |
|> map_filter (lookup_const naming) |
|
728 |
|> filter (can (Graph.get_node program)) |
|
729 |
|> Graph.all_preds program; |
|
730 |
val program' = Graph.del_nodes names_delete program; |
|
731 |
in (naming, program') end; |
|
27103 | 732 |
); |
733 |
||
734 |
val cached_program = Program.get; |
|
25969 | 735 |
|
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
736 |
fun generate thy funcgr f name = |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
737 |
Program.change_yield thy (fn naming_program => (NONE, naming_program) |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
738 |
|> f thy (Code.operational_algebra thy) funcgr name |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
739 |
|-> (fn name => fn (_, naming_program) => (name, naming_program))); |
27103 | 740 |
|
741 |
||
742 |
(* program generation *) |
|
743 |
||
744 |
fun consts_program thy cs = |
|
745 |
let |
|
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
746 |
fun project_consts cs (naming, program) = |
27103 | 747 |
let |
748 |
val cs_all = Graph.all_succs program cs; |
|
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
749 |
in (cs, (naming, Graph.subgraph (member (op =) cs_all) program)) end; |
27103 | 750 |
fun generate_consts thy algebra funcgr = |
751 |
fold_map (ensure_const thy algebra funcgr); |
|
752 |
in |
|
28054 | 753 |
generate thy (Code_Funcgr.make thy cs) generate_consts cs |
27103 | 754 |
|-> project_consts |
755 |
end; |
|
756 |
||
757 |
||
758 |
(* value evaluation *) |
|
25969 | 759 |
|
24918 | 760 |
fun ensure_value thy algbr funcgr t = |
761 |
let |
|
762 |
val ty = fastype_of t; |
|
763 |
val vs = fold_term_types (K (fold_atyps (insert (eq_fst op =) |
|
764 |
o dest_TFree))) t []; |
|
765 |
val stmt_value = |
|
28688 | 766 |
fold_map (translate_tyvar_sort thy algbr funcgr) vs |
767 |
##>> translate_typ thy algbr funcgr ty |
|
768 |
##>> translate_term thy algbr funcgr NONE t |
|
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
769 |
#>> (fn ((vs, ty), t) => Fun |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
770 |
(Term.dummy_patternN, ((vs, ty), [(([], t), (Drule.dummy_thm, true))]))); |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
771 |
fun term_value (dep, (naming, program1)) = |
25969 | 772 |
let |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
773 |
val Fun (_, ((vs, ty), [(([], t), _)])) = |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
774 |
Graph.get_node program1 Term.dummy_patternN; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
775 |
val deps = Graph.imm_succs program1 Term.dummy_patternN; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
776 |
val program2 = Graph.del_nodes [Term.dummy_patternN] program1; |
27103 | 777 |
val deps_all = Graph.all_succs program2 deps; |
778 |
val program3 = Graph.subgraph (member (op =) deps_all) program2; |
|
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
779 |
in (((naming, program3), (((vs, ty), t), deps)), (dep, (naming, program2))) end; |
26011 | 780 |
in |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
781 |
ensure_stmt ((K o K) NONE) pair stmt_value Term.dummy_patternN |
26011 | 782 |
#> snd |
783 |
#> term_value |
|
784 |
end; |
|
24219 | 785 |
|
27103 | 786 |
fun eval eval_kind thy evaluator = |
787 |
let |
|
788 |
fun evaluator'' evaluator''' funcgr t = |
|
789 |
let |
|
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
790 |
val (((naming, program), (vs_ty_t, deps)), _) = generate thy funcgr ensure_value t; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
791 |
in evaluator''' naming program vs_ty_t deps end; |
27103 | 792 |
fun evaluator' t = |
793 |
let |
|
794 |
val (t', evaluator''') = evaluator t; |
|
795 |
in (t', evaluator'' evaluator''') end; |
|
796 |
in eval_kind thy evaluator' end |
|
797 |
||
28054 | 798 |
fun eval_conv thy = eval Code_Funcgr.eval_conv thy; |
799 |
fun eval_term thy = eval Code_Funcgr.eval_term thy; |
|
27103 | 800 |
|
24219 | 801 |
end; (*struct*) |
802 |
||
803 |
||
28054 | 804 |
structure Basic_Code_Thingol: BASIC_CODE_THINGOL = Code_Thingol; |