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