author | haftmann |
Mon, 06 Jan 2014 09:31:19 +0100 | |
changeset 54932 | 409de8cf33b2 |
parent 54931 | 88cf06038e37 |
child 55147 | bce3dbc11f95 |
permissions | -rw-r--r-- |
37744 | 1 |
(* Title: Tools/Code/code_thingol.ML |
24219 | 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 = |
|
41782 | 18 |
Dict of string list * plain_dict |
41118
b290841cd3b0
separated dictionary weakning into separate type
haftmann
parents:
41100
diff
changeset
|
19 |
and plain_dict = |
b290841cd3b0
separated dictionary weakning into separate type
haftmann
parents:
41100
diff
changeset
|
20 |
Dict_Const of string * dict list list |
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
21 |
| Dict_Var of vname * (int * int); |
24219 | 22 |
datatype itype = |
23 |
`%% of string * itype list |
|
24 |
| ITyVar of vname; |
|
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
25 |
type const = { name: string, typargs: itype list, dicts: dict list list, |
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
26 |
dom: itype list, range: itype, annotate: bool }; |
24219 | 27 |
datatype iterm = |
24591 | 28 |
IConst of const |
31889 | 29 |
| IVar of vname option |
24219 | 30 |
| `$ of iterm * iterm |
31888 | 31 |
| `|=> of (vname option * itype) * iterm |
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
32 |
| ICase of { term: iterm, typ: itype, clauses: (iterm * iterm) list, primitive: iterm }; |
24219 | 33 |
val `$$ : iterm * iterm list -> iterm; |
31888 | 34 |
val `|==> : (vname option * itype) list * iterm -> iterm; |
24219 | 35 |
type typscheme = (vname * sort) list * itype; |
36 |
end; |
|
37 |
||
38 |
signature CODE_THINGOL = |
|
39 |
sig |
|
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
40 |
include BASIC_CODE_THINGOL |
34084 | 41 |
val fun_tyco: string |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
42 |
val unfoldl: ('a -> ('a * 'b) option) -> 'a -> 'a * 'b list |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
43 |
val unfoldr: ('a -> ('b * 'a) option) -> 'a -> 'b list * 'a |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
44 |
val unfold_fun: itype -> itype list * itype |
37640 | 45 |
val unfold_fun_n: int -> itype -> itype list * itype |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
46 |
val unfold_app: iterm -> iterm * iterm list |
31888 | 47 |
val unfold_abs: iterm -> (vname option * itype) list * iterm |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
48 |
val split_let: iterm -> (((iterm * itype) * iterm) * iterm) option |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
49 |
val unfold_let: iterm -> ((iterm * itype) * iterm) list * iterm |
31889 | 50 |
val split_pat_abs: iterm -> ((iterm * itype) * iterm) option |
51 |
val unfold_pat_abs: iterm -> (iterm * itype) list * iterm |
|
31049 | 52 |
val unfold_const_app: iterm -> (const * iterm list) option |
32909 | 53 |
val is_IVar: iterm -> bool |
41782 | 54 |
val is_IAbs: iterm -> bool |
31049 | 55 |
val eta_expand: int -> const * iterm list -> iterm |
41100
6c0940392fb4
dictionary constants must permit explicit weakening of classes;
haftmann
parents:
40844
diff
changeset
|
56 |
val contains_dict_var: iterm -> bool |
31935
3896169e6ff9
cleaned up fundamental iml term functions; nested patterns
haftmann
parents:
31892
diff
changeset
|
57 |
val add_constnames: iterm -> string list -> string list |
32917 | 58 |
val add_tyconames: iterm -> string list -> string list |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
59 |
val fold_varnames: (string -> 'a -> 'a) -> iterm -> 'a -> 'a |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
60 |
|
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
61 |
type naming |
28706 | 62 |
val empty_naming: naming |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
63 |
val lookup_class: naming -> class -> string option |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
64 |
val lookup_classrel: naming -> class * class -> string option |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
65 |
val lookup_tyco: naming -> string -> string option |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
66 |
val lookup_instance: naming -> class * string -> string option |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
67 |
val lookup_const: naming -> string -> string option |
31054 | 68 |
val ensure_declared_const: theory -> string -> naming -> string * naming |
24219 | 69 |
|
24918 | 70 |
datatype stmt = |
54889
4121d64fde90
explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents:
52801
diff
changeset
|
71 |
NoStmt of string |
37437 | 72 |
| Fun of string * ((typscheme * ((iterm list * iterm) * (thm option * bool)) list) * thm option) |
48003
1d11af40b106
dropped sort constraints on datatype specifications
haftmann
parents:
47576
diff
changeset
|
73 |
| Datatype of string * (vname list * |
37448
3bd4b3809bee
explicit type variable arguments for constructors
haftmann
parents:
37447
diff
changeset
|
74 |
((string * vname list (*type argument wrt. canonical order*)) * itype list) list) |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
75 |
| Datatypecons of string * string |
37447
ad3e04f289b6
transitive superclasses were also only a misunderstanding
haftmann
parents:
37446
diff
changeset
|
76 |
| Class of class * (vname * ((class * string) list * (string * itype) list)) |
24219 | 77 |
| Classrel of class * class |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
78 |
| Classparam of string * class |
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
79 |
| Classinst of { class: string, tyco: string, vs: (vname * sort) list, |
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
80 |
superinsts: (class * (string * (string * dict list list))) list, |
52519
598addf65209
explicit hint for domain of class parameters in instance statements
haftmann
parents:
52161
diff
changeset
|
81 |
inst_params: ((string * (const * int)) * (thm * bool)) list, |
598addf65209
explicit hint for domain of class parameters in instance statements
haftmann
parents:
52161
diff
changeset
|
82 |
superinst_params: ((string * (const * int)) * (thm * bool)) list }; |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
83 |
type program = stmt Graph.T |
54889
4121d64fde90
explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents:
52801
diff
changeset
|
84 |
val unimplemented: program -> string list |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
85 |
val map_terms_bottom_up: (iterm -> iterm) -> iterm -> iterm |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
86 |
val map_terms_stmt: (iterm -> iterm) -> stmt -> stmt |
50625 | 87 |
val is_constr: program -> string -> bool |
37440
a5d44161ba2a
maintain cong rules for case combinators; more precise permissiveness
haftmann
parents:
37437
diff
changeset
|
88 |
val is_case: stmt -> bool |
52138
e21426f244aa
bookkeeping and input syntax for exact specification of names of symbols in generated code
haftmann
parents:
51685
diff
changeset
|
89 |
val symbol_of: program -> string -> Code_Symbol.symbol; |
32895 | 90 |
val group_stmts: theory -> program |
91 |
-> ((string * stmt) list * (string * stmt) list |
|
92 |
* ((string * stmt) list * (string * stmt) list)) list |
|
24219 | 93 |
|
31036 | 94 |
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
|
95 |
val consts_program: theory -> bool -> string list -> string list * (naming * program) |
41184 | 96 |
val dynamic_conv: theory -> (naming -> program |
39487
80b2cf3b0779
proper closures for static evaluation; no need for FIXMEs any longer
haftmann
parents:
39475
diff
changeset
|
97 |
-> ((string * sort) list * typscheme) * iterm -> string list -> conv) |
38672
f1f64375f662
preliminary versions of static_eval_conv(_simple)
haftmann
parents:
38669
diff
changeset
|
98 |
-> conv |
41184 | 99 |
val dynamic_value: theory -> ((term -> term) -> 'a -> 'a) -> (naming -> program |
39487
80b2cf3b0779
proper closures for static evaluation; no need for FIXMEs any longer
haftmann
parents:
39475
diff
changeset
|
100 |
-> ((string * sort) list * typscheme) * iterm -> string list -> 'a) |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
101 |
-> term -> 'a |
41346 | 102 |
val static_conv: theory -> string list -> (naming -> program -> string list |
103 |
-> ((string * sort) list * typscheme) * iterm -> string list -> conv) |
|
38672
f1f64375f662
preliminary versions of static_eval_conv(_simple)
haftmann
parents:
38669
diff
changeset
|
104 |
-> conv |
41184 | 105 |
val static_conv_simple: theory -> string list |
41346 | 106 |
-> (program -> (string * sort) list -> term -> conv) -> conv |
41184 | 107 |
val static_value: theory -> ((term -> term) -> 'a -> 'a) -> string list -> |
41346 | 108 |
(naming -> program -> string list |
109 |
-> ((string * sort) list * typscheme) * iterm -> string list -> 'a) |
|
39475 | 110 |
-> term -> 'a |
24219 | 111 |
end; |
112 |
||
28054 | 113 |
structure Code_Thingol: CODE_THINGOL = |
24219 | 114 |
struct |
115 |
||
116 |
(** auxiliary **) |
|
117 |
||
118 |
fun unfoldl dest x = |
|
119 |
case dest x |
|
120 |
of NONE => (x, []) |
|
121 |
| SOME (x1, x2) => |
|
122 |
let val (x', xs') = unfoldl dest x1 in (x', xs' @ [x2]) end; |
|
123 |
||
124 |
fun unfoldr dest x = |
|
125 |
case dest x |
|
126 |
of NONE => ([], x) |
|
127 |
| SOME (x1, x2) => |
|
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
128 |
let val (xs', x') = unfoldr dest x2 in (x1 :: xs', x') end; |
24219 | 129 |
|
130 |
||
29962
bd4dc7fa742d
tuned comments, stripped ID, deleted superfluous code
haftmann
parents:
29952
diff
changeset
|
131 |
(** language core - types, terms **) |
24219 | 132 |
|
133 |
type vname = string; |
|
134 |
||
135 |
datatype dict = |
|
41782 | 136 |
Dict of string list * plain_dict |
41118
b290841cd3b0
separated dictionary weakning into separate type
haftmann
parents:
41100
diff
changeset
|
137 |
and plain_dict = |
b290841cd3b0
separated dictionary weakning into separate type
haftmann
parents:
41100
diff
changeset
|
138 |
Dict_Const of string * dict list list |
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
139 |
| Dict_Var of vname * (int * int); |
24219 | 140 |
|
141 |
datatype itype = |
|
142 |
`%% of string * itype list |
|
143 |
| ITyVar of vname; |
|
144 |
||
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
145 |
type const = { name: string, typargs: itype list, dicts: dict list list, |
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
146 |
dom: itype list, range: itype, annotate: bool }; |
24591 | 147 |
|
24219 | 148 |
datatype iterm = |
24591 | 149 |
IConst of const |
31889 | 150 |
| IVar of vname option |
24219 | 151 |
| `$ of iterm * iterm |
31888 | 152 |
| `|=> of (vname option * itype) * iterm |
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
153 |
| ICase of { term: iterm, typ: itype, clauses: (iterm * iterm) list, primitive: iterm }; |
24219 | 154 |
(*see also signature*) |
155 |
||
32909 | 156 |
fun is_IVar (IVar _) = true |
157 |
| is_IVar _ = false; |
|
158 |
||
41782 | 159 |
fun is_IAbs (_ `|=> _) = true |
160 |
| is_IAbs _ = false; |
|
161 |
||
24219 | 162 |
val op `$$ = Library.foldl (op `$); |
31724 | 163 |
val op `|==> = Library.foldr (op `|=>); |
24219 | 164 |
|
165 |
val unfold_app = unfoldl |
|
166 |
(fn op `$ t => SOME t |
|
167 |
| _ => NONE); |
|
168 |
||
31874 | 169 |
val unfold_abs = unfoldr |
170 |
(fn op `|=> t => SOME t |
|
24219 | 171 |
| _ => NONE); |
172 |
||
173 |
val split_let = |
|
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
174 |
(fn ICase { term = t, typ = ty, clauses = [(p, body)], ... } => SOME (((p, ty), t), body) |
24219 | 175 |
| _ => NONE); |
176 |
||
177 |
val unfold_let = unfoldr split_let; |
|
178 |
||
179 |
fun unfold_const_app t = |
|
180 |
case unfold_app t |
|
181 |
of (IConst c, ts) => SOME (c, ts) |
|
182 |
| _ => NONE; |
|
183 |
||
32917 | 184 |
fun fold_constexprs f = |
185 |
let |
|
186 |
fun fold' (IConst c) = f c |
|
187 |
| fold' (IVar _) = I |
|
188 |
| fold' (t1 `$ t2) = fold' t1 #> fold' t2 |
|
189 |
| fold' (_ `|=> t) = fold' t |
|
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
190 |
| fold' (ICase { term = t, clauses = clauses, ... }) = fold' t |
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
191 |
#> fold (fn (p, body) => fold' p #> fold' body) clauses |
32917 | 192 |
in fold' end; |
193 |
||
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
194 |
val add_constnames = fold_constexprs (fn { name = c, ... } => insert (op =) c); |
32917 | 195 |
|
196 |
fun add_tycos (tyco `%% tys) = insert (op =) tyco #> fold add_tycos tys |
|
197 |
| add_tycos (ITyVar _) = I; |
|
198 |
||
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
199 |
val add_tyconames = fold_constexprs (fn { typargs = tys, ... } => fold add_tycos tys); |
24219 | 200 |
|
201 |
fun fold_varnames f = |
|
202 |
let |
|
31935
3896169e6ff9
cleaned up fundamental iml term functions; nested patterns
haftmann
parents:
31892
diff
changeset
|
203 |
fun fold_aux add f = |
3896169e6ff9
cleaned up fundamental iml term functions; nested patterns
haftmann
parents:
31892
diff
changeset
|
204 |
let |
3896169e6ff9
cleaned up fundamental iml term functions; nested patterns
haftmann
parents:
31892
diff
changeset
|
205 |
fun fold_term _ (IConst _) = I |
3896169e6ff9
cleaned up fundamental iml term functions; nested patterns
haftmann
parents:
31892
diff
changeset
|
206 |
| 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
|
207 |
| fold_term _ (IVar NONE) = I |
3896169e6ff9
cleaned up fundamental iml term functions; nested patterns
haftmann
parents:
31892
diff
changeset
|
208 |
| 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
|
209 |
| 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
|
210 |
| fold_term vs ((NONE, _) `|=> t) = fold_term vs t |
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
211 |
| fold_term vs (ICase { term = t, clauses = clauses, ... }) = fold_term vs t #> fold (fold_case vs) clauses |
31935
3896169e6ff9
cleaned up fundamental iml term functions; nested patterns
haftmann
parents:
31892
diff
changeset
|
212 |
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
|
213 |
in fold_term [] end; |
3896169e6ff9
cleaned up fundamental iml term functions; nested patterns
haftmann
parents:
31892
diff
changeset
|
214 |
fun add t = fold_aux add (insert (op =)) t; |
3896169e6ff9
cleaned up fundamental iml term functions; nested patterns
haftmann
parents:
31892
diff
changeset
|
215 |
in fold_aux add f end; |
24219 | 216 |
|
31935
3896169e6ff9
cleaned up fundamental iml term functions; nested patterns
haftmann
parents:
31892
diff
changeset
|
217 |
fun exists_var t v = fold_varnames (fn w => fn b => v = w orelse b) t false; |
31874 | 218 |
|
31889 | 219 |
fun split_pat_abs ((NONE, ty) `|=> t) = SOME ((IVar NONE, ty), t) |
31888 | 220 |
| split_pat_abs ((SOME v, ty) `|=> t) = SOME (case t |
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
221 |
of ICase { term = IVar (SOME w), clauses = [(p, body)], ... } => |
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
222 |
if v = w andalso (exists_var p v orelse not (exists_var body v)) |
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
223 |
then ((p, ty), body) |
31889 | 224 |
else ((IVar (SOME v), ty), t) |
225 |
| _ => ((IVar (SOME v), ty), t)) |
|
31888 | 226 |
| split_pat_abs _ = NONE; |
31874 | 227 |
|
228 |
val unfold_pat_abs = unfoldr split_pat_abs; |
|
24219 | 229 |
|
31890
e943b039f0ac
an intermediate step towards a refined translation of cases
haftmann
parents:
31889
diff
changeset
|
230 |
fun unfold_abs_eta [] t = ([], t) |
e943b039f0ac
an intermediate step towards a refined translation of cases
haftmann
parents:
31889
diff
changeset
|
231 |
| unfold_abs_eta (_ :: tys) (v_ty `|=> t) = |
e943b039f0ac
an intermediate step towards a refined translation of cases
haftmann
parents:
31889
diff
changeset
|
232 |
let |
e943b039f0ac
an intermediate step towards a refined translation of cases
haftmann
parents:
31889
diff
changeset
|
233 |
val (vs_tys, t') = unfold_abs_eta tys t; |
e943b039f0ac
an intermediate step towards a refined translation of cases
haftmann
parents:
31889
diff
changeset
|
234 |
in (v_ty :: vs_tys, t') end |
31892 | 235 |
| unfold_abs_eta tys t = |
31890
e943b039f0ac
an intermediate step towards a refined translation of cases
haftmann
parents:
31889
diff
changeset
|
236 |
let |
e943b039f0ac
an intermediate step towards a refined translation of cases
haftmann
parents:
31889
diff
changeset
|
237 |
val ctxt = fold_varnames Name.declare t Name.context; |
43329
84472e198515
tuned signature: Name.invent and Name.invent_names;
wenzelm
parents:
43326
diff
changeset
|
238 |
val vs_tys = (map o apfst) SOME (Name.invent_names ctxt "a" tys); |
31890
e943b039f0ac
an intermediate step towards a refined translation of cases
haftmann
parents:
31889
diff
changeset
|
239 |
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
|
240 |
|
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
241 |
fun eta_expand k (const as { name = c, dom = tys, ... }, ts) = |
24219 | 242 |
let |
243 |
val j = length ts; |
|
244 |
val l = k - j; |
|
37841 | 245 |
val _ = if l > length tys |
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
246 |
then error ("Impossible eta-expansion for constant " ^ quote c) else (); |
24219 | 247 |
val ctxt = (fold o fold_varnames) Name.declare ts Name.context; |
31889 | 248 |
val vs_tys = (map o apfst) SOME |
43329
84472e198515
tuned signature: Name.invent and Name.invent_names;
wenzelm
parents:
43326
diff
changeset
|
249 |
(Name.invent_names ctxt "a" ((take l o drop j) tys)); |
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
250 |
in vs_tys `|==> IConst const `$$ ts @ map (IVar o fst) vs_tys end; |
24219 | 251 |
|
41100
6c0940392fb4
dictionary constants must permit explicit weakening of classes;
haftmann
parents:
40844
diff
changeset
|
252 |
fun contains_dict_var t = |
24662
f79f6061525c
more precise treatment of free dictionary parameters for evaluation
haftmann
parents:
24591
diff
changeset
|
253 |
let |
41118
b290841cd3b0
separated dictionary weakning into separate type
haftmann
parents:
41100
diff
changeset
|
254 |
fun cont_dict (Dict (_, d)) = cont_plain_dict d |
b290841cd3b0
separated dictionary weakning into separate type
haftmann
parents:
41100
diff
changeset
|
255 |
and cont_plain_dict (Dict_Const (_, dss)) = (exists o exists) cont_dict dss |
b290841cd3b0
separated dictionary weakning into separate type
haftmann
parents:
41100
diff
changeset
|
256 |
| cont_plain_dict (Dict_Var _) = true; |
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
257 |
fun cont_term (IConst { dicts = dss, ... }) = (exists o exists) cont_dict dss |
31935
3896169e6ff9
cleaned up fundamental iml term functions; nested patterns
haftmann
parents:
31892
diff
changeset
|
258 |
| cont_term (IVar _) = false |
3896169e6ff9
cleaned up fundamental iml term functions; nested patterns
haftmann
parents:
31892
diff
changeset
|
259 |
| 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
|
260 |
| cont_term (_ `|=> t) = cont_term t |
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
261 |
| cont_term (ICase { primitive = t, ... }) = cont_term t; |
31935
3896169e6ff9
cleaned up fundamental iml term functions; nested patterns
haftmann
parents:
31892
diff
changeset
|
262 |
in cont_term t end; |
25621 | 263 |
|
264 |
||
28688 | 265 |
(** namings **) |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
266 |
|
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
267 |
(* policies *) |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
268 |
|
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
269 |
local |
45188
35870ec62ec7
removing dependency of the generic code generator to old code generator functions thyname_of_type and thyname_of_const
bulwahn
parents:
45128
diff
changeset
|
270 |
fun thyname_of_type thy = #theory_name o Name_Space.the_entry (Sign.type_space thy); |
33172 | 271 |
fun thyname_of_class thy = #theory_name o Name_Space.the_entry (Sign.class_space thy); |
54931
88cf06038e37
uniform orientation of instances as (type constructor, type class)
haftmann
parents:
54889
diff
changeset
|
272 |
fun thyname_of_instance thy inst = case Axclass.thynames_of_arity thy (swap inst) |
33172 | 273 |
of [] => error ("No such instance: " ^ quote (snd inst ^ " :: " ^ fst inst)) |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
274 |
| thyname :: _ => thyname; |
51685
385ef6706252
more standard module name Axclass (according to file name);
wenzelm
parents:
51658
diff
changeset
|
275 |
fun thyname_of_const thy c = case Axclass.class_of_param thy c |
28706 | 276 |
of SOME class => thyname_of_class thy class |
35299
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
277 |
| NONE => (case Code.get_type_of_constr_or_abstr thy c |
45188
35870ec62ec7
removing dependency of the generic code generator to old code generator functions thyname_of_type and thyname_of_const
bulwahn
parents:
45128
diff
changeset
|
278 |
of SOME (tyco, _) => thyname_of_type thy tyco |
47574 | 279 |
| NONE => #theory_name (Name_Space.the_entry (Sign.const_space thy) c)); |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
280 |
fun namify thy get_basename get_thyname name = |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
281 |
let |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
282 |
val prefix = get_thyname thy name; |
54932
409de8cf33b2
special treatment of ==> and == solely as constants
haftmann
parents:
54931
diff
changeset
|
283 |
val base = (Name.desymbolize false o get_basename) name; |
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30280
diff
changeset
|
284 |
in Long_Name.append prefix base end; |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
285 |
in |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
286 |
|
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30280
diff
changeset
|
287 |
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
|
288 |
fun namify_classrel thy = namify thy (fn (sub_class, super_class) => |
37431 | 289 |
Long_Name.base_name super_class ^ "_" ^ Long_Name.base_name sub_class) |
33172 | 290 |
(fn thy => thyname_of_class thy o fst); |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
291 |
(*order fits nicely with composed projections*) |
28688 | 292 |
fun namify_tyco thy "fun" = "Pure.fun" |
45188
35870ec62ec7
removing dependency of the generic code generator to old code generator functions thyname_of_type and thyname_of_const
bulwahn
parents:
45128
diff
changeset
|
293 |
| namify_tyco thy tyco = namify thy Long_Name.base_name thyname_of_type tyco; |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
294 |
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
|
295 |
Long_Name.base_name class ^ "_" ^ Long_Name.base_name tyco) thyname_of_instance; |
54932
409de8cf33b2
special treatment of ==> and == solely as constants
haftmann
parents:
54931
diff
changeset
|
296 |
fun namify_const thy "==>" = "Pure.follows" |
409de8cf33b2
special treatment of ==> and == solely as constants
haftmann
parents:
54931
diff
changeset
|
297 |
| namify_const thy "==" = "Pure.meta_eq" |
409de8cf33b2
special treatment of ==> and == solely as constants
haftmann
parents:
54931
diff
changeset
|
298 |
| namify_const thy c = namify thy Long_Name.base_name thyname_of_const c; |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
299 |
|
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
300 |
end; (* local *) |
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 |
|
28688 | 303 |
(* data *) |
28663
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 |
datatype naming = Naming of { |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
306 |
class: class Symtab.table * Name.context, |
30648
17365ef082f3
clarified relationship of modules Code_Name and Code_Printer
haftmann
parents:
30364
diff
changeset
|
307 |
classrel: string Symreltab.table * Name.context, |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
308 |
tyco: string Symtab.table * Name.context, |
30648
17365ef082f3
clarified relationship of modules Code_Name and Code_Printer
haftmann
parents:
30364
diff
changeset
|
309 |
instance: string Symreltab.table * Name.context, |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
310 |
const: string Symtab.table * 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 |
fun dest_Naming (Naming naming) = naming; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
314 |
|
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
315 |
val empty_naming = Naming { |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
316 |
class = (Symtab.empty, Name.context), |
30648
17365ef082f3
clarified relationship of modules Code_Name and Code_Printer
haftmann
parents:
30364
diff
changeset
|
317 |
classrel = (Symreltab.empty, Name.context), |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
318 |
tyco = (Symtab.empty, Name.context), |
30648
17365ef082f3
clarified relationship of modules Code_Name and Code_Printer
haftmann
parents:
30364
diff
changeset
|
319 |
instance = (Symreltab.empty, Name.context), |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
320 |
const = (Symtab.empty, Name.context) |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
321 |
}; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
322 |
|
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
323 |
local |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
324 |
fun mk_naming (class, classrel, tyco, instance, const) = |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
325 |
Naming { class = class, classrel = classrel, |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
326 |
tyco = tyco, instance = instance, const = const }; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
327 |
fun map_naming f (Naming { class, classrel, tyco, instance, const }) = |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
328 |
mk_naming (f (class, classrel, tyco, instance, const)); |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
329 |
in |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
330 |
fun map_class f = map_naming |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
331 |
(fn (class, classrel, tyco, inst, const) => |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
332 |
(f class, classrel, tyco, inst, const)); |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
333 |
fun map_classrel f = map_naming |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
334 |
(fn (class, classrel, tyco, inst, const) => |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
335 |
(class, f classrel, tyco, inst, const)); |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
336 |
fun map_tyco f = map_naming |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
337 |
(fn (class, classrel, tyco, inst, const) => |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
338 |
(class, classrel, f tyco, inst, const)); |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
339 |
fun map_instance f = map_naming |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
340 |
(fn (class, classrel, tyco, inst, const) => |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
341 |
(class, classrel, tyco, f inst, const)); |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
342 |
fun map_const f = map_naming |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
343 |
(fn (class, classrel, tyco, inst, const) => |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
344 |
(class, classrel, tyco, inst, f const)); |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
345 |
end; (*local*) |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
346 |
|
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
347 |
fun add_variant update (thing, name) (tab, used) = |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
348 |
let |
43326
47cf4bc789aa
simplified Name.variant -- discontinued builtin fold_map;
wenzelm
parents:
43048
diff
changeset
|
349 |
val (name', used') = Name.variant name used; |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
350 |
val tab' = update (thing, name') tab; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
351 |
in (tab', used') end; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
352 |
|
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
353 |
fun declare thy mapp lookup update namify thing = |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
354 |
mapp (add_variant update (thing, namify thy thing)) |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
355 |
#> `(fn naming => the (lookup naming thing)); |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
356 |
|
28688 | 357 |
|
358 |
(* lookup and declare *) |
|
359 |
||
360 |
local |
|
361 |
||
362 |
val suffix_class = "class"; |
|
363 |
val suffix_classrel = "classrel" |
|
364 |
val suffix_tyco = "tyco"; |
|
365 |
val suffix_instance = "inst"; |
|
366 |
val suffix_const = "const"; |
|
367 |
||
368 |
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
|
369 |
| add_suffix nsp (SOME name) = SOME (Long_Name.append name nsp); |
28688 | 370 |
|
371 |
in |
|
372 |
||
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
373 |
val lookup_class = add_suffix suffix_class |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
374 |
oo Symtab.lookup o fst o #class o dest_Naming; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
375 |
val lookup_classrel = add_suffix suffix_classrel |
30648
17365ef082f3
clarified relationship of modules Code_Name and Code_Printer
haftmann
parents:
30364
diff
changeset
|
376 |
oo Symreltab.lookup o fst o #classrel o dest_Naming; |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
377 |
val lookup_tyco = add_suffix suffix_tyco |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
378 |
oo Symtab.lookup o fst o #tyco o dest_Naming; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
379 |
val lookup_instance = add_suffix suffix_instance |
30648
17365ef082f3
clarified relationship of modules Code_Name and Code_Printer
haftmann
parents:
30364
diff
changeset
|
380 |
oo Symreltab.lookup o fst o #instance o dest_Naming; |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
381 |
val lookup_const = add_suffix suffix_const |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
382 |
oo Symtab.lookup o fst o #const o dest_Naming; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
383 |
|
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
384 |
fun declare_class thy = declare thy map_class |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
385 |
lookup_class Symtab.update_new namify_class; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
386 |
fun declare_classrel thy = declare thy map_classrel |
30648
17365ef082f3
clarified relationship of modules Code_Name and Code_Printer
haftmann
parents:
30364
diff
changeset
|
387 |
lookup_classrel Symreltab.update_new namify_classrel; |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
388 |
fun declare_tyco thy = declare thy map_tyco |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
389 |
lookup_tyco Symtab.update_new namify_tyco; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
390 |
fun declare_instance thy = declare thy map_instance |
30648
17365ef082f3
clarified relationship of modules Code_Name and Code_Printer
haftmann
parents:
30364
diff
changeset
|
391 |
lookup_instance Symreltab.update_new namify_instance; |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
392 |
fun declare_const thy = declare thy map_const |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
393 |
lookup_const Symtab.update_new namify_const; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
394 |
|
31054 | 395 |
fun ensure_declared_const thy const naming = |
396 |
case lookup_const naming const |
|
397 |
of SOME const' => (const', naming) |
|
398 |
| NONE => declare_const thy const naming; |
|
399 |
||
37384
5aba26803073
more consistent naming aroud type classes and instances
haftmann
parents:
37216
diff
changeset
|
400 |
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
|
401 |
(*depends on add_suffix*); |
34084 | 402 |
|
28688 | 403 |
val unfold_fun = unfoldr |
34084 | 404 |
(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
|
405 |
| _ => NONE); |
28688 | 406 |
|
37640 | 407 |
fun unfold_fun_n n ty = |
408 |
let |
|
409 |
val (tys1, ty1) = unfold_fun ty; |
|
410 |
val (tys3, tys2) = chop n tys1; |
|
411 |
val ty3 = Library.foldr (fn (ty1, ty2) => fun_tyco `%% [ty1, ty2]) (tys2, ty1); |
|
412 |
in (tys3, ty3) end; |
|
413 |
||
28688 | 414 |
end; (* local *) |
415 |
||
24219 | 416 |
|
27103 | 417 |
(** statements, abstract programs **) |
24219 | 418 |
|
419 |
type typscheme = (vname * sort) list * itype; |
|
37447
ad3e04f289b6
transitive superclasses were also only a misunderstanding
haftmann
parents:
37446
diff
changeset
|
420 |
datatype stmt = |
54889
4121d64fde90
explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents:
52801
diff
changeset
|
421 |
NoStmt of string |
37437 | 422 |
| Fun of string * ((typscheme * ((iterm list * iterm) * (thm option * bool)) list) * thm option) |
48003
1d11af40b106
dropped sort constraints on datatype specifications
haftmann
parents:
47576
diff
changeset
|
423 |
| Datatype of string * (vname list * ((string * vname list) * itype list) list) |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
424 |
| Datatypecons of string * string |
37447
ad3e04f289b6
transitive superclasses were also only a misunderstanding
haftmann
parents:
37446
diff
changeset
|
425 |
| Class of class * (vname * ((class * string) list * (string * itype) list)) |
24219 | 426 |
| Classrel of class * class |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
427 |
| Classparam of string * class |
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
428 |
| Classinst of { class: string, tyco: string, vs: (vname * sort) list, |
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
429 |
superinsts: (class * (string * (string * dict list list))) list, |
52519
598addf65209
explicit hint for domain of class parameters in instance statements
haftmann
parents:
52161
diff
changeset
|
430 |
inst_params: ((string * (const * int)) * (thm * bool)) list, |
598addf65209
explicit hint for domain of class parameters in instance statements
haftmann
parents:
52161
diff
changeset
|
431 |
superinst_params: ((string * (const * int)) * (thm * bool)) list }; |
24219 | 432 |
|
27103 | 433 |
type program = stmt Graph.T; |
24219 | 434 |
|
54889
4121d64fde90
explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents:
52801
diff
changeset
|
435 |
fun unimplemented program = |
4121d64fde90
explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents:
52801
diff
changeset
|
436 |
Graph.fold (fn (_, (NoStmt c, _)) => cons c | _ => I) program []; |
24219 | 437 |
|
27711 | 438 |
fun map_terms_bottom_up f (t as IConst _) = f t |
439 |
| map_terms_bottom_up f (t as IVar _) = f t |
|
440 |
| map_terms_bottom_up f (t1 `$ t2) = f |
|
441 |
(map_terms_bottom_up f t1 `$ map_terms_bottom_up f t2) |
|
31724 | 442 |
| map_terms_bottom_up f ((v, ty) `|=> t) = f |
443 |
((v, ty) `|=> map_terms_bottom_up f t) |
|
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
444 |
| map_terms_bottom_up f (ICase { term = t, typ = ty, clauses = clauses, primitive = t0 }) = f |
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
445 |
(ICase { term = map_terms_bottom_up f t, typ = ty, |
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
446 |
clauses = (map o pairself) (map_terms_bottom_up f) clauses, |
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
447 |
primitive = map_terms_bottom_up f t0 }); |
27711 | 448 |
|
37448
3bd4b3809bee
explicit type variable arguments for constructors
haftmann
parents:
37447
diff
changeset
|
449 |
fun map_classparam_instances_as_term f = |
52519
598addf65209
explicit hint for domain of class parameters in instance statements
haftmann
parents:
52161
diff
changeset
|
450 |
(map o apfst o apsnd o apfst) (fn const => case f (IConst const) of IConst const' => const') |
37448
3bd4b3809bee
explicit type variable arguments for constructors
haftmann
parents:
37447
diff
changeset
|
451 |
|
54889
4121d64fde90
explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents:
52801
diff
changeset
|
452 |
fun map_terms_stmt f (NoStmt c) = (NoStmt c) |
37437 | 453 |
| map_terms_stmt f (Fun (c, ((tysm, eqs), case_cong))) = Fun (c, ((tysm, (map o apfst) |
454 |
(fn (ts, t) => (map f ts, f t)) eqs), case_cong)) |
|
27711 | 455 |
| map_terms_stmt f (stmt as Datatype _) = stmt |
456 |
| map_terms_stmt f (stmt as Datatypecons _) = stmt |
|
457 |
| map_terms_stmt f (stmt as Class _) = stmt |
|
458 |
| map_terms_stmt f (stmt as Classrel _) = stmt |
|
459 |
| map_terms_stmt f (stmt as Classparam _) = stmt |
|
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
460 |
| map_terms_stmt f (Classinst { class, tyco, vs, superinsts, |
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
461 |
inst_params, superinst_params }) = |
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
462 |
Classinst { class = class, tyco = tyco, vs = vs, superinsts = superinsts, |
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
463 |
inst_params = map_classparam_instances_as_term f inst_params, |
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
464 |
superinst_params = map_classparam_instances_as_term f superinst_params }; |
27711 | 465 |
|
50625 | 466 |
fun is_constr program name = case Graph.get_node program name |
24219 | 467 |
of Datatypecons _ => true |
468 |
| _ => false; |
|
469 |
||
37440
a5d44161ba2a
maintain cong rules for case combinators; more precise permissiveness
haftmann
parents:
37437
diff
changeset
|
470 |
fun is_case (Fun (_, (_, SOME _))) = true |
a5d44161ba2a
maintain cong rules for case combinators; more precise permissiveness
haftmann
parents:
37437
diff
changeset
|
471 |
| is_case _ = false; |
a5d44161ba2a
maintain cong rules for case combinators; more precise permissiveness
haftmann
parents:
37437
diff
changeset
|
472 |
|
52138
e21426f244aa
bookkeeping and input syntax for exact specification of names of symbols in generated code
haftmann
parents:
51685
diff
changeset
|
473 |
fun symbol_of program name = |
e21426f244aa
bookkeeping and input syntax for exact specification of names of symbols in generated code
haftmann
parents:
51685
diff
changeset
|
474 |
case try (Graph.get_node program) name of |
e21426f244aa
bookkeeping and input syntax for exact specification of names of symbols in generated code
haftmann
parents:
51685
diff
changeset
|
475 |
NONE => Code_Symbol.Module "(unknown)" |
e21426f244aa
bookkeeping and input syntax for exact specification of names of symbols in generated code
haftmann
parents:
51685
diff
changeset
|
476 |
(*FIXME: need to be liberal due to ad-hoc introduction of value for evaluation*) |
e21426f244aa
bookkeeping and input syntax for exact specification of names of symbols in generated code
haftmann
parents:
51685
diff
changeset
|
477 |
| SOME stmt => case stmt of |
e21426f244aa
bookkeeping and input syntax for exact specification of names of symbols in generated code
haftmann
parents:
51685
diff
changeset
|
478 |
Fun (c, _) => Code_Symbol.Constant c |
e21426f244aa
bookkeeping and input syntax for exact specification of names of symbols in generated code
haftmann
parents:
51685
diff
changeset
|
479 |
| Datatype (tyco, _) => Code_Symbol.Type_Constructor tyco |
e21426f244aa
bookkeeping and input syntax for exact specification of names of symbols in generated code
haftmann
parents:
51685
diff
changeset
|
480 |
| Datatypecons (c, _) => Code_Symbol.Constant c |
e21426f244aa
bookkeeping and input syntax for exact specification of names of symbols in generated code
haftmann
parents:
51685
diff
changeset
|
481 |
| Class (class, _) => Code_Symbol.Type_Class class |
e21426f244aa
bookkeeping and input syntax for exact specification of names of symbols in generated code
haftmann
parents:
51685
diff
changeset
|
482 |
| Classrel (sub, super) => |
e21426f244aa
bookkeeping and input syntax for exact specification of names of symbols in generated code
haftmann
parents:
51685
diff
changeset
|
483 |
let |
e21426f244aa
bookkeeping and input syntax for exact specification of names of symbols in generated code
haftmann
parents:
51685
diff
changeset
|
484 |
val Class (sub, _) = Graph.get_node program sub; |
e21426f244aa
bookkeeping and input syntax for exact specification of names of symbols in generated code
haftmann
parents:
51685
diff
changeset
|
485 |
val Class (super, _) = Graph.get_node program super; |
e21426f244aa
bookkeeping and input syntax for exact specification of names of symbols in generated code
haftmann
parents:
51685
diff
changeset
|
486 |
in |
e21426f244aa
bookkeeping and input syntax for exact specification of names of symbols in generated code
haftmann
parents:
51685
diff
changeset
|
487 |
Code_Symbol.Class_Relation (sub, super) |
e21426f244aa
bookkeeping and input syntax for exact specification of names of symbols in generated code
haftmann
parents:
51685
diff
changeset
|
488 |
end |
e21426f244aa
bookkeeping and input syntax for exact specification of names of symbols in generated code
haftmann
parents:
51685
diff
changeset
|
489 |
| Classparam (c, _) => Code_Symbol.Constant c |
e21426f244aa
bookkeeping and input syntax for exact specification of names of symbols in generated code
haftmann
parents:
51685
diff
changeset
|
490 |
| Classinst { class, tyco, ... } => |
e21426f244aa
bookkeeping and input syntax for exact specification of names of symbols in generated code
haftmann
parents:
51685
diff
changeset
|
491 |
let |
e21426f244aa
bookkeeping and input syntax for exact specification of names of symbols in generated code
haftmann
parents:
51685
diff
changeset
|
492 |
val Class (class, _) = Graph.get_node program class; |
e21426f244aa
bookkeeping and input syntax for exact specification of names of symbols in generated code
haftmann
parents:
51685
diff
changeset
|
493 |
val Datatype (tyco, _) = Graph.get_node program tyco; |
e21426f244aa
bookkeeping and input syntax for exact specification of names of symbols in generated code
haftmann
parents:
51685
diff
changeset
|
494 |
in |
e21426f244aa
bookkeeping and input syntax for exact specification of names of symbols in generated code
haftmann
parents:
51685
diff
changeset
|
495 |
Code_Symbol.Class_Instance (tyco, class) |
e21426f244aa
bookkeeping and input syntax for exact specification of names of symbols in generated code
haftmann
parents:
51685
diff
changeset
|
496 |
end; |
32895 | 497 |
|
37440
a5d44161ba2a
maintain cong rules for case combinators; more precise permissiveness
haftmann
parents:
37437
diff
changeset
|
498 |
fun linear_stmts program = |
a5d44161ba2a
maintain cong rules for case combinators; more precise permissiveness
haftmann
parents:
37437
diff
changeset
|
499 |
rev (Graph.strong_conn program) |
a5d44161ba2a
maintain cong rules for case combinators; more precise permissiveness
haftmann
parents:
37437
diff
changeset
|
500 |
|> map (AList.make (Graph.get_node program)); |
a5d44161ba2a
maintain cong rules for case combinators; more precise permissiveness
haftmann
parents:
37437
diff
changeset
|
501 |
|
32895 | 502 |
fun group_stmts thy program = |
503 |
let |
|
504 |
fun is_fun (_, Fun _) = true | is_fun _ = false; |
|
505 |
fun is_datatypecons (_, Datatypecons _) = true | is_datatypecons _ = false; |
|
506 |
fun is_datatype (_, Datatype _) = true | is_datatype _ = false; |
|
507 |
fun is_class (_, Class _) = true | is_class _ = false; |
|
508 |
fun is_classrel (_, Classrel _) = true | is_classrel _ = false; |
|
509 |
fun is_classparam (_, Classparam _) = true | is_classparam _ = false; |
|
510 |
fun is_classinst (_, Classinst _) = true | is_classinst _ = false; |
|
511 |
fun group stmts = |
|
512 |
if forall (is_datatypecons orf is_datatype) stmts |
|
513 |
then (filter is_datatype stmts, [], ([], [])) |
|
514 |
else if forall (is_class orf is_classrel orf is_classparam) stmts |
|
515 |
then ([], filter is_class stmts, ([], [])) |
|
516 |
else if forall (is_fun orf is_classinst) stmts |
|
517 |
then ([], [], List.partition is_fun stmts) |
|
52138
e21426f244aa
bookkeeping and input syntax for exact specification of names of symbols in generated code
haftmann
parents:
51685
diff
changeset
|
518 |
else error ("Illegal mutual dependencies: " ^ (commas |
e21426f244aa
bookkeeping and input syntax for exact specification of names of symbols in generated code
haftmann
parents:
51685
diff
changeset
|
519 |
o map (Code_Symbol.quote_symbol (Proof_Context.init_global thy) |
e21426f244aa
bookkeeping and input syntax for exact specification of names of symbols in generated code
haftmann
parents:
51685
diff
changeset
|
520 |
o symbol_of program o fst)) stmts); |
32895 | 521 |
in |
37440
a5d44161ba2a
maintain cong rules for case combinators; more precise permissiveness
haftmann
parents:
37437
diff
changeset
|
522 |
linear_stmts program |
32895 | 523 |
|> map group |
524 |
end; |
|
525 |
||
24219 | 526 |
|
27103 | 527 |
(** translation kernel **) |
24219 | 528 |
|
28724 | 529 |
(* generic mechanisms *) |
530 |
||
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
531 |
fun ensure_stmt lookup declare generate thing (dep, (naming, program)) = |
24219 | 532 |
let |
28706 | 533 |
fun add_dep name = case dep of NONE => I |
534 |
| SOME dep => Graph.add_edge (dep, name); |
|
535 |
val (name, naming') = case lookup naming thing |
|
536 |
of SOME name => (name, naming) |
|
537 |
| NONE => declare thing naming; |
|
47576 | 538 |
in |
539 |
if can (Graph.get_node program) name |
|
540 |
then |
|
541 |
program |
|
542 |
|> add_dep name |
|
543 |
|> pair naming' |
|
544 |
|> pair dep |
|
545 |
|> pair name |
|
546 |
else |
|
547 |
program |
|
54889
4121d64fde90
explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents:
52801
diff
changeset
|
548 |
|> Graph.default_node (name, NoStmt "") |
47576 | 549 |
|> add_dep name |
550 |
|> pair naming' |
|
551 |
|> curry generate (SOME name) |
|
552 |
||> snd |
|
553 |
|-> (fn stmt => (apsnd o Graph.map_node name) (K stmt)) |
|
554 |
|> pair dep |
|
555 |
|> pair name |
|
24219 | 556 |
end; |
557 |
||
36272
4d358c582ffb
optionally ignore errors during translation of equations; tuned representation of abstraction points
haftmann
parents:
36210
diff
changeset
|
558 |
exception PERMISSIVE of unit; |
4d358c582ffb
optionally ignore errors during translation of equations; tuned representation of abstraction points
haftmann
parents:
36210
diff
changeset
|
559 |
|
37698 | 560 |
fun translation_error thy permissive some_thm msg sub_msg = |
36272
4d358c582ffb
optionally ignore errors during translation of equations; tuned representation of abstraction points
haftmann
parents:
36210
diff
changeset
|
561 |
if permissive |
4d358c582ffb
optionally ignore errors during translation of equations; tuned representation of abstraction points
haftmann
parents:
36210
diff
changeset
|
562 |
then raise PERMISSIVE () |
42385
b46b47775cbe
simplified Sorts.class_error: plain Proof.context;
wenzelm
parents:
42383
diff
changeset
|
563 |
else |
b46b47775cbe
simplified Sorts.class_error: plain Proof.context;
wenzelm
parents:
42383
diff
changeset
|
564 |
let |
b46b47775cbe
simplified Sorts.class_error: plain Proof.context;
wenzelm
parents:
42383
diff
changeset
|
565 |
val err_thm = |
b46b47775cbe
simplified Sorts.class_error: plain Proof.context;
wenzelm
parents:
42383
diff
changeset
|
566 |
(case some_thm of |
b46b47775cbe
simplified Sorts.class_error: plain Proof.context;
wenzelm
parents:
42383
diff
changeset
|
567 |
SOME thm => "\n(in code equation " ^ Display.string_of_thm_global thy thm ^ ")" |
b46b47775cbe
simplified Sorts.class_error: plain Proof.context;
wenzelm
parents:
42383
diff
changeset
|
568 |
| NONE => ""); |
b46b47775cbe
simplified Sorts.class_error: plain Proof.context;
wenzelm
parents:
42383
diff
changeset
|
569 |
in error (msg ^ err_thm ^ ":\n" ^ sub_msg) end; |
37698 | 570 |
|
48074 | 571 |
fun maybe_permissive f prgrm = |
572 |
f prgrm |>> SOME handle PERMISSIVE () => (NONE, prgrm); |
|
573 |
||
37698 | 574 |
fun not_wellsorted thy permissive some_thm ty sort e = |
575 |
let |
|
47005
421760a1efe7
maintain generic context naming in structure Name_Space (NB: empty = default_naming, init = local_naming);
wenzelm
parents:
46961
diff
changeset
|
576 |
val err_class = Sorts.class_error (Context.pretty_global thy) e; |
42385
b46b47775cbe
simplified Sorts.class_error: plain Proof.context;
wenzelm
parents:
42383
diff
changeset
|
577 |
val err_typ = |
47005
421760a1efe7
maintain generic context naming in structure Name_Space (NB: empty = default_naming, init = local_naming);
wenzelm
parents:
46961
diff
changeset
|
578 |
"Type " ^ Syntax.string_of_typ_global thy ty ^ " not of sort " ^ |
42385
b46b47775cbe
simplified Sorts.class_error: plain Proof.context;
wenzelm
parents:
42383
diff
changeset
|
579 |
Syntax.string_of_sort_global thy sort; |
b46b47775cbe
simplified Sorts.class_error: plain Proof.context;
wenzelm
parents:
42383
diff
changeset
|
580 |
in |
b46b47775cbe
simplified Sorts.class_error: plain Proof.context;
wenzelm
parents:
42383
diff
changeset
|
581 |
translation_error thy permissive some_thm "Wellsortedness error" |
b46b47775cbe
simplified Sorts.class_error: plain Proof.context;
wenzelm
parents:
42383
diff
changeset
|
582 |
(err_typ ^ "\n" ^ err_class) |
b46b47775cbe
simplified Sorts.class_error: plain Proof.context;
wenzelm
parents:
42383
diff
changeset
|
583 |
end; |
26972 | 584 |
|
48074 | 585 |
fun undefineds thy (dep, (naming, program)) = |
586 |
(map_filter (lookup_const naming) (Code.undefineds thy), |
|
587 |
(dep, (naming, program))); |
|
588 |
||
47555 | 589 |
|
44790
c13fdf710a40
adding type inference for disambiguation annotations in code equation
bulwahn
parents:
44789
diff
changeset
|
590 |
(* inference of type annotations for disambiguation with type classes *) |
c13fdf710a40
adding type inference for disambiguation annotations in code equation
bulwahn
parents:
44789
diff
changeset
|
591 |
|
45000
0febe2089425
adding abstraction layer; more precise function names
bulwahn
parents:
44999
diff
changeset
|
592 |
fun mk_tagged_type (true, T) = Type ("", [T]) |
47555 | 593 |
| mk_tagged_type (false, T) = T; |
45000
0febe2089425
adding abstraction layer; more precise function names
bulwahn
parents:
44999
diff
changeset
|
594 |
|
44998
f12ef61ea76e
determining the fastype of a case-pattern but ignoring dummy type constructors that were added as markers for type annotations
bulwahn
parents:
44997
diff
changeset
|
595 |
fun dest_tagged_type (Type ("", [T])) = (true, T) |
47555 | 596 |
| dest_tagged_type T = (false, T); |
44998
f12ef61ea76e
determining the fastype of a case-pattern but ignoring dummy type constructors that were added as markers for type annotations
bulwahn
parents:
44997
diff
changeset
|
597 |
|
47555 | 598 |
val untag_term = map_types (snd o dest_tagged_type); |
44998
f12ef61ea76e
determining the fastype of a case-pattern but ignoring dummy type constructors that were added as markers for type annotations
bulwahn
parents:
44997
diff
changeset
|
599 |
|
45000
0febe2089425
adding abstraction layer; more precise function names
bulwahn
parents:
44999
diff
changeset
|
600 |
fun tag_term (proj_sort, _) eqngr = |
44997 | 601 |
let |
47555 | 602 |
val has_sort_constraints = exists (not o null) o map proj_sort o Code_Preproc.sortargs eqngr; |
47576 | 603 |
fun tag (Const (_, T')) (Const (c, T)) = |
45000
0febe2089425
adding abstraction layer; more precise function names
bulwahn
parents:
44999
diff
changeset
|
604 |
Const (c, |
0febe2089425
adding abstraction layer; more precise function names
bulwahn
parents:
44999
diff
changeset
|
605 |
mk_tagged_type (not (null (Term.add_tvarsT T' [])) andalso has_sort_constraints c, T)) |
0febe2089425
adding abstraction layer; more precise function names
bulwahn
parents:
44999
diff
changeset
|
606 |
| tag (t1 $ u1) (t $ u) = tag t1 t $ tag u1 u |
0febe2089425
adding abstraction layer; more precise function names
bulwahn
parents:
44999
diff
changeset
|
607 |
| tag (Abs (_, _, t1)) (Abs (x, T, t)) = Abs (x, T, tag t1 t) |
0febe2089425
adding abstraction layer; more precise function names
bulwahn
parents:
44999
diff
changeset
|
608 |
| tag (Free _) (t as Free _) = t |
0febe2089425
adding abstraction layer; more precise function names
bulwahn
parents:
44999
diff
changeset
|
609 |
| tag (Var _) (t as Var _) = t |
47555 | 610 |
| tag (Bound _) (t as Bound _) = t; |
44997 | 611 |
in |
45000
0febe2089425
adding abstraction layer; more precise function names
bulwahn
parents:
44999
diff
changeset
|
612 |
tag |
44997 | 613 |
end |
44790
c13fdf710a40
adding type inference for disambiguation annotations in code equation
bulwahn
parents:
44789
diff
changeset
|
614 |
|
44997 | 615 |
fun annotate thy algbr eqngr (c, ty) args rhs = |
44790
c13fdf710a40
adding type inference for disambiguation annotations in code equation
bulwahn
parents:
44789
diff
changeset
|
616 |
let |
45128
5af3a3203a76
discontinued obsolete alias structure ProofContext;
wenzelm
parents:
45009
diff
changeset
|
617 |
val ctxt = Proof_Context.init_global thy |> Config.put Type_Infer_Context.const_sorts false |
44790
c13fdf710a40
adding type inference for disambiguation annotations in code equation
bulwahn
parents:
44789
diff
changeset
|
618 |
val erase = map_types (fn _ => Type_Infer.anyT []) |
c13fdf710a40
adding type inference for disambiguation annotations in code equation
bulwahn
parents:
44789
diff
changeset
|
619 |
val reinfer = singleton (Type_Infer_Context.infer_types ctxt) |
44996
410eea28b0f7
also adding type annotations for the dynamic invocation
bulwahn
parents:
44855
diff
changeset
|
620 |
val lhs = list_comb (Const (c, ty), map (map_types Type.strip_sorts o fst) args) |
410eea28b0f7
also adding type annotations for the dynamic invocation
bulwahn
parents:
44855
diff
changeset
|
621 |
val reinferred_rhs = snd (Logic.dest_equals (reinfer (Logic.mk_equals (lhs, erase rhs)))) |
44790
c13fdf710a40
adding type inference for disambiguation annotations in code equation
bulwahn
parents:
44789
diff
changeset
|
622 |
in |
45000
0febe2089425
adding abstraction layer; more precise function names
bulwahn
parents:
44999
diff
changeset
|
623 |
tag_term algbr eqngr reinferred_rhs rhs |
44996
410eea28b0f7
also adding type annotations for the dynamic invocation
bulwahn
parents:
44855
diff
changeset
|
624 |
end |
410eea28b0f7
also adding type annotations for the dynamic invocation
bulwahn
parents:
44855
diff
changeset
|
625 |
|
44997 | 626 |
fun annotate_eqns thy algbr eqngr (c, ty) eqns = |
627 |
map (apfst (fn (args, (rhs, some_abs)) => (args, |
|
628 |
(annotate thy algbr eqngr (c, ty) args rhs, some_abs)))) eqns |
|
28724 | 629 |
|
47555 | 630 |
|
28724 | 631 |
(* translation *) |
632 |
||
36272
4d358c582ffb
optionally ignore errors during translation of equations; tuned representation of abstraction points
haftmann
parents:
36210
diff
changeset
|
633 |
fun ensure_tyco thy algbr eqngr permissive tyco = |
30932 | 634 |
let |
40726
16dcfedc4eb7
keep type variable arguments of datatype constructors in bookkeeping
haftmann
parents:
40711
diff
changeset
|
635 |
val ((vs, cos), _) = Code.get_type thy tyco; |
30932 | 636 |
val stmt_datatype = |
36272
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 |
48003
1d11af40b106
dropped sort constraints on datatype specifications
haftmann
parents:
47576
diff
changeset
|
638 |
#>> map fst |
40726
16dcfedc4eb7
keep type variable arguments of datatype constructors in bookkeeping
haftmann
parents:
40711
diff
changeset
|
639 |
##>> fold_map (fn (c, (vs, tys)) => |
36272
4d358c582ffb
optionally ignore errors during translation of equations; tuned representation of abstraction points
haftmann
parents:
36210
diff
changeset
|
640 |
ensure_const thy algbr eqngr permissive c |
40726
16dcfedc4eb7
keep type variable arguments of datatype constructors in bookkeeping
haftmann
parents:
40711
diff
changeset
|
641 |
##>> pair (map (unprefix "'" o fst) vs) |
36272
4d358c582ffb
optionally ignore errors during translation of equations; tuned representation of abstraction points
haftmann
parents:
36210
diff
changeset
|
642 |
##>> 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
|
643 |
#>> (fn info => Datatype (tyco, info)); |
30932 | 644 |
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
|
645 |
and ensure_const thy algbr eqngr permissive c = |
30932 | 646 |
let |
647 |
fun stmt_datatypecons tyco = |
|
36272
4d358c582ffb
optionally ignore errors during translation of equations; tuned representation of abstraction points
haftmann
parents:
36210
diff
changeset
|
648 |
ensure_tyco thy algbr eqngr permissive tyco |
30932 | 649 |
#>> (fn tyco => Datatypecons (c, tyco)); |
650 |
fun stmt_classparam class = |
|
36272
4d358c582ffb
optionally ignore errors during translation of equations; tuned representation of abstraction points
haftmann
parents:
36210
diff
changeset
|
651 |
ensure_class thy algbr eqngr permissive class |
30932 | 652 |
#>> (fn class => Classparam (c, class)); |
54889
4121d64fde90
explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents:
52801
diff
changeset
|
653 |
fun stmt_fun cert = case Code.equations_of_cert thy cert |
4121d64fde90
explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents:
52801
diff
changeset
|
654 |
of (_, NONE) => pair (NoStmt c) |
4121d64fde90
explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents:
52801
diff
changeset
|
655 |
| ((vs, ty), SOME eqns) => |
4121d64fde90
explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents:
52801
diff
changeset
|
656 |
let |
4121d64fde90
explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents:
52801
diff
changeset
|
657 |
val eqns' = annotate_eqns thy algbr eqngr (c, ty) eqns |
4121d64fde90
explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents:
52801
diff
changeset
|
658 |
val some_case_cong = Code.get_case_cong thy c; |
4121d64fde90
explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents:
52801
diff
changeset
|
659 |
in |
4121d64fde90
explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents:
52801
diff
changeset
|
660 |
fold_map (translate_tyvar_sort thy algbr eqngr permissive) vs |
4121d64fde90
explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents:
52801
diff
changeset
|
661 |
##>> translate_typ thy algbr eqngr permissive ty |
4121d64fde90
explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents:
52801
diff
changeset
|
662 |
##>> translate_eqns thy algbr eqngr permissive eqns' |
4121d64fde90
explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents:
52801
diff
changeset
|
663 |
#>> |
4121d64fde90
explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents:
52801
diff
changeset
|
664 |
(fn (_, NONE) => NoStmt c |
4121d64fde90
explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents:
52801
diff
changeset
|
665 |
| (tyscm, SOME eqns) => Fun (c, ((tyscm, eqns), some_case_cong))) |
4121d64fde90
explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents:
52801
diff
changeset
|
666 |
end; |
35299
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
667 |
val stmt_const = case Code.get_type_of_constr_or_abstr thy c |
35226 | 668 |
of SOME (tyco, _) => stmt_datatypecons tyco |
51685
385ef6706252
more standard module name Axclass (according to file name);
wenzelm
parents:
51658
diff
changeset
|
669 |
| NONE => (case Axclass.class_of_param thy c |
30932 | 670 |
of SOME class => stmt_classparam class |
34891
99b9a6290446
code certificates as integral part of code generation
haftmann
parents:
34251
diff
changeset
|
671 |
| NONE => stmt_fun (Code_Preproc.cert eqngr c)) |
30932 | 672 |
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
|
673 |
and ensure_class thy (algbr as (_, algebra)) eqngr permissive class = |
24918 | 674 |
let |
37384
5aba26803073
more consistent naming aroud type classes and instances
haftmann
parents:
37216
diff
changeset
|
675 |
val super_classes = (Sorts.minimize_sort algebra o Sorts.super_classes algebra) class; |
51685
385ef6706252
more standard module name Axclass (according to file name);
wenzelm
parents:
51658
diff
changeset
|
676 |
val cs = #params (Axclass.get_info thy class); |
24918 | 677 |
val stmt_class = |
37384
5aba26803073
more consistent naming aroud type classes and instances
haftmann
parents:
37216
diff
changeset
|
678 |
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
|
679 |
##>> 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
|
680 |
##>> 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
|
681 |
##>> translate_typ thy algbr eqngr permissive ty) cs |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
682 |
#>> (fn info => Class (class, (unprefix "'" Name.aT, info))) |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
683 |
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
|
684 |
and ensure_classrel thy algbr eqngr permissive (sub_class, super_class) = |
24918 | 685 |
let |
686 |
val stmt_classrel = |
|
37384
5aba26803073
more consistent naming aroud type classes and instances
haftmann
parents:
37216
diff
changeset
|
687 |
ensure_class thy algbr eqngr permissive sub_class |
5aba26803073
more consistent naming aroud type classes and instances
haftmann
parents:
37216
diff
changeset
|
688 |
##>> ensure_class thy algbr eqngr permissive super_class |
24918 | 689 |
#>> Classrel; |
37384
5aba26803073
more consistent naming aroud type classes and instances
haftmann
parents:
37216
diff
changeset
|
690 |
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
|
691 |
and ensure_inst thy (algbr as (_, algebra)) eqngr permissive (class, tyco) = |
24918 | 692 |
let |
37384
5aba26803073
more consistent naming aroud type classes and instances
haftmann
parents:
37216
diff
changeset
|
693 |
val super_classes = (Sorts.minimize_sort algebra o Sorts.super_classes algebra) class; |
51685
385ef6706252
more standard module name Axclass (according to file name);
wenzelm
parents:
51658
diff
changeset
|
694 |
val these_class_params = these o try (#params o Axclass.get_info thy); |
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
695 |
val class_params = these_class_params class; |
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
696 |
val superclass_params = maps these_class_params |
37448
3bd4b3809bee
explicit type variable arguments for constructors
haftmann
parents:
37447
diff
changeset
|
697 |
((Sorts.complete_sort algebra o Sorts.super_classes algebra) class); |
43329
84472e198515
tuned signature: Name.invent and Name.invent_names;
wenzelm
parents:
43326
diff
changeset
|
698 |
val vs = Name.invent_names Name.context "'a" (Sorts.mg_domain algebra tyco [class]); |
24918 | 699 |
val sorts' = Sorts.mg_domain (Sign.classes_of thy) tyco [class]; |
700 |
val vs' = map2 (fn (v, sort1) => fn sort2 => (v, |
|
701 |
Sorts.inter_sort (Sign.classes_of thy) (sort1, sort2))) vs sorts'; |
|
702 |
val arity_typ = Type (tyco, map TFree vs); |
|
703 |
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
|
704 |
fun translate_super_instance super_class = |
5aba26803073
more consistent naming aroud type classes and instances
haftmann
parents:
37216
diff
changeset
|
705 |
ensure_class thy algbr eqngr permissive super_class |
5aba26803073
more consistent naming aroud type classes and instances
haftmann
parents:
37216
diff
changeset
|
706 |
##>> ensure_classrel thy algbr eqngr permissive (class, super_class) |
5aba26803073
more consistent naming aroud type classes and instances
haftmann
parents:
37216
diff
changeset
|
707 |
##>> translate_dicts thy algbr eqngr permissive NONE (arity_typ, [super_class]) |
41118
b290841cd3b0
separated dictionary weakning into separate type
haftmann
parents:
41100
diff
changeset
|
708 |
#>> (fn ((super_class, classrel), [Dict ([], Dict_Const (inst, dss))]) => |
37384
5aba26803073
more consistent naming aroud type classes and instances
haftmann
parents:
37216
diff
changeset
|
709 |
(super_class, (classrel, (inst, dss)))); |
5aba26803073
more consistent naming aroud type classes and instances
haftmann
parents:
37216
diff
changeset
|
710 |
fun translate_classparam_instance (c, ty) = |
24918 | 711 |
let |
37384
5aba26803073
more consistent naming aroud type classes and instances
haftmann
parents:
37216
diff
changeset
|
712 |
val raw_const = Const (c, map_type_tfree (K arity_typ') ty); |
52519
598addf65209
explicit hint for domain of class parameters in instance statements
haftmann
parents:
52161
diff
changeset
|
713 |
val dom_length = length (fst (strip_type ty)) |
51685
385ef6706252
more standard module name Axclass (according to file name);
wenzelm
parents:
51658
diff
changeset
|
714 |
val thm = Axclass.unoverload_conv thy (Thm.cterm_of thy raw_const); |
37384
5aba26803073
more consistent naming aroud type classes and instances
haftmann
parents:
37216
diff
changeset
|
715 |
val const = (apsnd Logic.unvarifyT_global o dest_Const o snd |
24918 | 716 |
o Logic.dest_equals o Thm.prop_of) thm; |
717 |
in |
|
36272
4d358c582ffb
optionally ignore errors during translation of equations; tuned representation of abstraction points
haftmann
parents:
36210
diff
changeset
|
718 |
ensure_const thy algbr eqngr permissive c |
37384
5aba26803073
more consistent naming aroud type classes and instances
haftmann
parents:
37216
diff
changeset
|
719 |
##>> translate_const thy algbr eqngr permissive (SOME thm) (const, NONE) |
52519
598addf65209
explicit hint for domain of class parameters in instance statements
haftmann
parents:
52161
diff
changeset
|
720 |
#>> (fn (c, IConst const') => ((c, (const', dom_length)), (thm, true))) |
24918 | 721 |
end; |
722 |
val stmt_inst = |
|
36272
4d358c582ffb
optionally ignore errors during translation of equations; tuned representation of abstraction points
haftmann
parents:
36210
diff
changeset
|
723 |
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
|
724 |
##>> 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
|
725 |
##>> 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
|
726 |
##>> fold_map translate_super_instance super_classes |
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
727 |
##>> fold_map translate_classparam_instance class_params |
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
728 |
##>> fold_map translate_classparam_instance superclass_params |
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
729 |
#>> (fn (((((class, tyco), vs), superinsts), inst_params), superinst_params) => |
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
730 |
Classinst { class = class, tyco = tyco, vs = vs, |
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
731 |
superinsts = superinsts, inst_params = inst_params, superinst_params = superinst_params }); |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
732 |
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
|
733 |
and translate_typ thy algbr eqngr permissive (TFree (v, _)) = |
30932 | 734 |
pair (ITyVar (unprefix "'" v)) |
36272
4d358c582ffb
optionally ignore errors during translation of equations; tuned representation of abstraction points
haftmann
parents:
36210
diff
changeset
|
735 |
| 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
|
736 |
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
|
737 |
##>> fold_map (translate_typ thy algbr eqngr permissive) tys |
30932 | 738 |
#>> (fn (tyco, tys) => tyco `%% tys) |
36272
4d358c582ffb
optionally ignore errors during translation of equations; tuned representation of abstraction points
haftmann
parents:
36210
diff
changeset
|
739 |
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
|
740 |
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
|
741 |
| translate_term thy algbr eqngr permissive some_thm (Free (v, _), some_abs) = |
31889 | 742 |
pair (IVar (SOME v)) |
36272
4d358c582ffb
optionally ignore errors during translation of equations; tuned representation of abstraction points
haftmann
parents:
36210
diff
changeset
|
743 |
| translate_term thy algbr eqngr permissive some_thm (Abs (v, ty, t), some_abs) = |
24918 | 744 |
let |
42284 | 745 |
val (v', t') = Syntax_Trans.variant_abs (Name.desymbolize false v, ty, t); |
32273 | 746 |
val v'' = if member (op =) (Term.add_free_names t' []) v' |
747 |
then SOME v' else NONE |
|
24918 | 748 |
in |
36272
4d358c582ffb
optionally ignore errors during translation of equations; tuned representation of abstraction points
haftmann
parents:
36210
diff
changeset
|
749 |
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
|
750 |
##>> translate_term thy algbr eqngr permissive some_thm (t', some_abs) |
32273 | 751 |
#>> (fn (ty, t) => (v'', ty) `|=> t) |
24918 | 752 |
end |
36272
4d358c582ffb
optionally ignore errors during translation of equations; tuned representation of abstraction points
haftmann
parents:
36210
diff
changeset
|
753 |
| translate_term thy algbr eqngr permissive some_thm (t as _ $ _, some_abs) = |
24918 | 754 |
case strip_comb t |
755 |
of (Const (c, ty), ts) => |
|
36272
4d358c582ffb
optionally ignore errors during translation of equations; tuned representation of abstraction points
haftmann
parents:
36210
diff
changeset
|
756 |
translate_app thy algbr eqngr permissive some_thm (((c, ty), ts), some_abs) |
24918 | 757 |
| (t', ts) => |
36272
4d358c582ffb
optionally ignore errors during translation of equations; tuned representation of abstraction points
haftmann
parents:
36210
diff
changeset
|
758 |
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
|
759 |
##>> fold_map (translate_term thy algbr eqngr permissive some_thm o rpair NONE) ts |
24918 | 760 |
#>> (fn (t, ts) => t `$$ ts) |
36272
4d358c582ffb
optionally ignore errors during translation of equations; tuned representation of abstraction points
haftmann
parents:
36210
diff
changeset
|
761 |
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
|
762 |
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
|
763 |
##>> translate_term thy algbr eqngr permissive some_thm (rhs, some_abs) |
35226 | 764 |
#>> rpair (some_thm, proper) |
48074 | 765 |
and translate_eqns thy algbr eqngr permissive eqns = |
766 |
maybe_permissive (fold_map (translate_eqn thy algbr eqngr permissive) eqns) |
|
36272
4d358c582ffb
optionally ignore errors during translation of equations; tuned representation of abstraction points
haftmann
parents:
36210
diff
changeset
|
767 |
and translate_const thy algbr eqngr permissive some_thm ((c, ty), some_abs) = |
30932 | 768 |
let |
37698 | 769 |
val _ = if (case some_abs of NONE => true | SOME abs => not (c = abs)) |
35226 | 770 |
andalso Code.is_abstr thy c |
37698 | 771 |
then translation_error thy permissive some_thm |
772 |
"Abstraction violation" ("constant " ^ Code.string_of_const thy c) |
|
773 |
else () |
|
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
774 |
val (annotate, ty') = dest_tagged_type ty; |
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
775 |
val typargs = Sign.const_typargs thy (c, ty'); |
32873 | 776 |
val sorts = Code_Preproc.sortargs eqngr c; |
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
777 |
val (dom, range) = Term.strip_type ty'; |
26972 | 778 |
in |
37698 | 779 |
ensure_const thy algbr eqngr permissive c |
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
780 |
##>> fold_map (translate_typ thy algbr eqngr permissive) typargs |
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
781 |
##>> fold_map (translate_dicts thy algbr eqngr permissive some_thm) (typargs ~~ sorts) |
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
782 |
##>> fold_map (translate_typ thy algbr eqngr permissive) (range :: dom) |
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
783 |
#>> (fn (((c, typargs), dss), range :: dom) => |
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
784 |
IConst { name = c, typargs = typargs, dicts = dss, |
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
785 |
dom = dom, range = range, annotate = annotate }) |
26972 | 786 |
end |
36272
4d358c582ffb
optionally ignore errors during translation of equations; tuned representation of abstraction points
haftmann
parents:
36210
diff
changeset
|
787 |
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
|
788 |
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
|
789 |
##>> fold_map (translate_term thy algbr eqngr permissive some_thm o rpair NONE) ts |
24918 | 790 |
#>> (fn (t, ts) => t `$$ ts) |
36272
4d358c582ffb
optionally ignore errors during translation of equations; tuned representation of abstraction points
haftmann
parents:
36210
diff
changeset
|
791 |
and translate_case thy algbr eqngr permissive some_thm (num_args, (t_pos, case_pats)) (c_ty, ts) = |
24918 | 792 |
let |
40844 | 793 |
fun arg_types num_args ty = fst (chop num_args (binder_types ty)); |
31892 | 794 |
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
|
795 |
val ty = nth tys t_pos; |
47437
4625ee486ff6
generalise case certificates to allow ignored parameters
Andreas Lochbihler
parents:
47005
diff
changeset
|
796 |
fun mk_constr NONE t = NONE |
47555 | 797 |
| mk_constr (SOME c) t = |
798 |
let |
|
799 |
val n = Code.args_number thy c; |
|
800 |
in SOME ((c, arg_types n (fastype_of (untag_term t)) ---> ty), n) end; |
|
801 |
val constrs = |
|
802 |
if null case_pats then [] |
|
803 |
else map_filter I (map2 mk_constr case_pats (nth_drop t_pos ts)); |
|
48074 | 804 |
fun casify undefineds constrs ty t_app ts = |
24918 | 805 |
let |
31935
3896169e6ff9
cleaned up fundamental iml term functions; nested patterns
haftmann
parents:
31892
diff
changeset
|
806 |
fun collapse_clause vs_map ts body = |
48074 | 807 |
case body |
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
808 |
of IConst { name = c, ... } => if member (op =) undefineds c |
31935
3896169e6ff9
cleaned up fundamental iml term functions; nested patterns
haftmann
parents:
31892
diff
changeset
|
809 |
then [] |
3896169e6ff9
cleaned up fundamental iml term functions; nested patterns
haftmann
parents:
31892
diff
changeset
|
810 |
else [(ts, body)] |
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
811 |
| ICase { term = IVar (SOME v), clauses = clauses, ... } => |
31935
3896169e6ff9
cleaned up fundamental iml term functions; nested patterns
haftmann
parents:
31892
diff
changeset
|
812 |
if forall (fn (pat', body') => exists_var pat' v |
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
813 |
orelse not (exists_var body' v)) clauses |
31935
3896169e6ff9
cleaned up fundamental iml term functions; nested patterns
haftmann
parents:
31892
diff
changeset
|
814 |
then case AList.lookup (op =) vs_map v |
3896169e6ff9
cleaned up fundamental iml term functions; nested patterns
haftmann
parents:
31892
diff
changeset
|
815 |
of SOME i => maps (fn (pat', body') => |
3896169e6ff9
cleaned up fundamental iml term functions; nested patterns
haftmann
parents:
31892
diff
changeset
|
816 |
collapse_clause (AList.delete (op =) v vs_map) |
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
817 |
(nth_map i (K pat') ts) body') clauses |
31935
3896169e6ff9
cleaned up fundamental iml term functions; nested patterns
haftmann
parents:
31892
diff
changeset
|
818 |
| NONE => [(ts, body)] |
3896169e6ff9
cleaned up fundamental iml term functions; nested patterns
haftmann
parents:
31892
diff
changeset
|
819 |
else [(ts, body)] |
48074 | 820 |
| _ => [(ts, body)]; |
31935
3896169e6ff9
cleaned up fundamental iml term functions; nested patterns
haftmann
parents:
31892
diff
changeset
|
821 |
fun mk_clause mk tys t = |
3896169e6ff9
cleaned up fundamental iml term functions; nested patterns
haftmann
parents:
31892
diff
changeset
|
822 |
let |
3896169e6ff9
cleaned up fundamental iml term functions; nested patterns
haftmann
parents:
31892
diff
changeset
|
823 |
val (vs, body) = unfold_abs_eta tys t; |
3896169e6ff9
cleaned up fundamental iml term functions; nested patterns
haftmann
parents:
31892
diff
changeset
|
824 |
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
|
825 |
val ts = map (IVar o fst) vs; |
3896169e6ff9
cleaned up fundamental iml term functions; nested patterns
haftmann
parents:
31892
diff
changeset
|
826 |
in map mk (collapse_clause vs_map ts body) end; |
31892 | 827 |
val t = nth ts t_pos; |
828 |
val ts_clause = nth_drop t_pos ts; |
|
31935
3896169e6ff9
cleaned up fundamental iml term functions; nested patterns
haftmann
parents:
31892
diff
changeset
|
829 |
val clauses = if null case_pats |
3896169e6ff9
cleaned up fundamental iml term functions; nested patterns
haftmann
parents:
31892
diff
changeset
|
830 |
then mk_clause (fn ([t], body) => (t, body)) [ty] (the_single ts_clause) |
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
831 |
else maps (fn ((constr as IConst { dom = tys, ... }, n), t) => |
33957 | 832 |
mk_clause (fn (ts, body) => (constr `$$ ts, body)) (take n tys) t) |
47555 | 833 |
(constrs ~~ (map_filter (fn (NONE, _) => NONE | (SOME _, t) => SOME t) |
834 |
(case_pats ~~ ts_clause))); |
|
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
48003
diff
changeset
|
835 |
in ICase { term = t, typ = ty, clauses = clauses, primitive = t_app `$$ ts } end; |
24918 | 836 |
in |
36272
4d358c582ffb
optionally ignore errors during translation of equations; tuned representation of abstraction points
haftmann
parents:
36210
diff
changeset
|
837 |
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
|
838 |
##>> fold_map (fn (constr, n) => translate_const thy algbr eqngr permissive some_thm (constr, NONE) |
47555 | 839 |
#>> rpair n) constrs |
36272
4d358c582ffb
optionally ignore errors during translation of equations; tuned representation of abstraction points
haftmann
parents:
36210
diff
changeset
|
840 |
##>> 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
|
841 |
##>> fold_map (translate_term thy algbr eqngr permissive some_thm o rpair NONE) ts |
48074 | 842 |
##>> undefineds thy |
843 |
#>> (fn ((((t, constrs), ty), ts), undefineds) => |
|
844 |
casify undefineds constrs ty t ts) |
|
24918 | 845 |
end |
36272
4d358c582ffb
optionally ignore errors during translation of equations; tuned representation of abstraction points
haftmann
parents:
36210
diff
changeset
|
846 |
and translate_app_case thy algbr eqngr permissive some_thm (case_scheme as (num_args, _)) ((c, ty), ts) = |
29973 | 847 |
if length ts < num_args then |
848 |
let |
|
849 |
val k = length ts; |
|
33957 | 850 |
val tys = (take (num_args - k) o drop k o fst o strip_type) ty; |
29973 | 851 |
val ctxt = (fold o fold_aterms) Term.declare_term_frees ts Name.context; |
43329
84472e198515
tuned signature: Name.invent and Name.invent_names;
wenzelm
parents:
43326
diff
changeset
|
852 |
val vs = Name.invent_names ctxt "a" tys; |
29973 | 853 |
in |
36272
4d358c582ffb
optionally ignore errors during translation of equations; tuned representation of abstraction points
haftmann
parents:
36210
diff
changeset
|
854 |
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
|
855 |
##>> translate_case thy algbr eqngr permissive some_thm case_scheme ((c, ty), ts @ map Free vs) |
31888 | 856 |
#>> (fn (tys, t) => map2 (fn (v, _) => pair (SOME v)) vs tys `|==> t) |
29973 | 857 |
end |
858 |
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
|
859 |
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
|
860 |
##>> fold_map (translate_term thy algbr eqngr permissive some_thm o rpair NONE) (drop num_args ts) |
29973 | 861 |
#>> (fn (t, ts) => t `$$ ts) |
862 |
else |
|
36272
4d358c582ffb
optionally ignore errors during translation of equations; tuned representation of abstraction points
haftmann
parents:
36210
diff
changeset
|
863 |
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
|
864 |
and translate_app thy algbr eqngr permissive some_thm (c_ty_ts as ((c, _), _), some_abs) = |
29973 | 865 |
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
|
866 |
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
|
867 |
| 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
|
868 |
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
|
869 |
fold_map (ensure_class thy algbr eqngr permissive) (proj_sort sort) |
30932 | 870 |
#>> (fn sort => (unprefix "'" v, sort)) |
36272
4d358c582ffb
optionally ignore errors during translation of equations; tuned representation of abstraction points
haftmann
parents:
36210
diff
changeset
|
871 |
and translate_dicts thy (algbr as (proj_sort, algebra)) eqngr permissive some_thm (ty, sort) = |
30932 | 872 |
let |
41100
6c0940392fb4
dictionary constants must permit explicit weakening of classes;
haftmann
parents:
40844
diff
changeset
|
873 |
datatype typarg_witness = |
41118
b290841cd3b0
separated dictionary weakning into separate type
haftmann
parents:
41100
diff
changeset
|
874 |
Weakening of (class * class) list * plain_typarg_witness |
b290841cd3b0
separated dictionary weakning into separate type
haftmann
parents:
41100
diff
changeset
|
875 |
and plain_typarg_witness = |
b290841cd3b0
separated dictionary weakning into separate type
haftmann
parents:
41100
diff
changeset
|
876 |
Global of (class * string) * typarg_witness list list |
b290841cd3b0
separated dictionary weakning into separate type
haftmann
parents:
41100
diff
changeset
|
877 |
| Local of string * (int * sort); |
b290841cd3b0
separated dictionary weakning into separate type
haftmann
parents:
41100
diff
changeset
|
878 |
fun class_relation ((Weakening (classrels, x)), sub_class) super_class = |
b290841cd3b0
separated dictionary weakning into separate type
haftmann
parents:
41100
diff
changeset
|
879 |
Weakening ((sub_class, super_class) :: classrels, x); |
41100
6c0940392fb4
dictionary constants must permit explicit weakening of classes;
haftmann
parents:
40844
diff
changeset
|
880 |
fun type_constructor (tyco, _) dss class = |
41118
b290841cd3b0
separated dictionary weakning into separate type
haftmann
parents:
41100
diff
changeset
|
881 |
Weakening ([], Global ((class, tyco), (map o map) fst dss)); |
30932 | 882 |
fun type_variable (TFree (v, sort)) = |
883 |
let |
|
884 |
val sort' = proj_sort sort; |
|
41118
b290841cd3b0
separated dictionary weakning into separate type
haftmann
parents:
41100
diff
changeset
|
885 |
in map_index (fn (n, class) => (Weakening ([], Local (v, (n, sort'))), class)) sort' end; |
41100
6c0940392fb4
dictionary constants must permit explicit weakening of classes;
haftmann
parents:
40844
diff
changeset
|
886 |
val typarg_witnesses = 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
|
887 |
{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
|
888 |
type_constructor = type_constructor, |
37698 | 889 |
type_variable = type_variable} (ty, proj_sort sort) |
890 |
handle Sorts.CLASS_ERROR e => not_wellsorted thy permissive some_thm ty sort e; |
|
41118
b290841cd3b0
separated dictionary weakning into separate type
haftmann
parents:
41100
diff
changeset
|
891 |
fun mk_dict (Weakening (classrels, x)) = |
41100
6c0940392fb4
dictionary constants must permit explicit weakening of classes;
haftmann
parents:
40844
diff
changeset
|
892 |
fold_map (ensure_classrel thy algbr eqngr permissive) classrels |
41118
b290841cd3b0
separated dictionary weakning into separate type
haftmann
parents:
41100
diff
changeset
|
893 |
##>> mk_plain_dict x |
b290841cd3b0
separated dictionary weakning into separate type
haftmann
parents:
41100
diff
changeset
|
894 |
#>> Dict |
b290841cd3b0
separated dictionary weakning into separate type
haftmann
parents:
41100
diff
changeset
|
895 |
and mk_plain_dict (Global (inst, dss)) = |
b290841cd3b0
separated dictionary weakning into separate type
haftmann
parents:
41100
diff
changeset
|
896 |
ensure_inst thy algbr eqngr permissive inst |
41100
6c0940392fb4
dictionary constants must permit explicit weakening of classes;
haftmann
parents:
40844
diff
changeset
|
897 |
##>> (fold_map o fold_map) mk_dict dss |
41118
b290841cd3b0
separated dictionary weakning into separate type
haftmann
parents:
41100
diff
changeset
|
898 |
#>> (fn (inst, dss) => Dict_Const (inst, dss)) |
b290841cd3b0
separated dictionary weakning into separate type
haftmann
parents:
41100
diff
changeset
|
899 |
| mk_plain_dict (Local (v, (n, sort))) = |
b290841cd3b0
separated dictionary weakning into separate type
haftmann
parents:
41100
diff
changeset
|
900 |
pair (Dict_Var (unprefix "'" v, (n, length sort))) |
41100
6c0940392fb4
dictionary constants must permit explicit weakening of classes;
haftmann
parents:
40844
diff
changeset
|
901 |
in fold_map mk_dict typarg_witnesses end; |
24918 | 902 |
|
25969 | 903 |
|
27103 | 904 |
(* store *) |
905 |
||
34173
458ced35abb8
reduced code generator cache to the baremost minimum
haftmann
parents:
34084
diff
changeset
|
906 |
structure Program = Code_Data |
27103 | 907 |
( |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
908 |
type T = naming * program; |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
909 |
val empty = (empty_naming, Graph.empty); |
27103 | 910 |
); |
911 |
||
47571 | 912 |
fun invoke_generation ignore_cache thy (algebra, eqngr) generate thing = |
39397 | 913 |
Program.change_yield (if ignore_cache then NONE else SOME thy) |
914 |
(fn naming_program => (NONE, naming_program) |
|
47571 | 915 |
|> generate thy algebra eqngr thing |
916 |
|-> (fn thing => fn (_, naming_program) => (thing, naming_program))); |
|
36272
4d358c582ffb
optionally ignore errors during translation of equations; tuned representation of abstraction points
haftmann
parents:
36210
diff
changeset
|
917 |
|
27103 | 918 |
|
919 |
(* program generation *) |
|
920 |
||
39487
80b2cf3b0779
proper closures for static evaluation; no need for FIXMEs any longer
haftmann
parents:
39475
diff
changeset
|
921 |
fun consts_program thy permissive consts = |
27103 | 922 |
let |
39487
80b2cf3b0779
proper closures for static evaluation; no need for FIXMEs any longer
haftmann
parents:
39475
diff
changeset
|
923 |
fun project_consts consts (naming, program) = |
80b2cf3b0779
proper closures for static evaluation; no need for FIXMEs any longer
haftmann
parents:
39475
diff
changeset
|
924 |
if permissive then (consts, (naming, program)) |
46614
165886a4fe64
clarified Graph.restrict (formerly Graph.subgraph) based on public graph operations;
wenzelm
parents:
45987
diff
changeset
|
925 |
else (consts, (naming, Graph.restrict |
39487
80b2cf3b0779
proper closures for static evaluation; no need for FIXMEs any longer
haftmann
parents:
39475
diff
changeset
|
926 |
(member (op =) (Graph.all_succs program consts)) program)); |
32873 | 927 |
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
|
928 |
fold_map (ensure_const thy algebra eqngr permissive); |
27103 | 929 |
in |
39487
80b2cf3b0779
proper closures for static evaluation; no need for FIXMEs any longer
haftmann
parents:
39475
diff
changeset
|
930 |
invoke_generation permissive thy (Code_Preproc.obtain false thy consts []) |
80b2cf3b0779
proper closures for static evaluation; no need for FIXMEs any longer
haftmann
parents:
39475
diff
changeset
|
931 |
generate_consts consts |
27103 | 932 |
|-> project_consts |
933 |
end; |
|
934 |
||
935 |
||
936 |
(* value evaluation *) |
|
25969 | 937 |
|
32873 | 938 |
fun ensure_value thy algbr eqngr t = |
24918 | 939 |
let |
940 |
val ty = fastype_of t; |
|
941 |
val vs = fold_term_types (K (fold_atyps (insert (eq_fst op =) |
|
942 |
o dest_TFree))) t []; |
|
52161 | 943 |
val t' = annotate thy algbr eqngr (@{const_name dummy_pattern}, ty) [] t; |
24918 | 944 |
val stmt_value = |
36272
4d358c582ffb
optionally ignore errors during translation of equations; tuned representation of abstraction points
haftmann
parents:
36210
diff
changeset
|
945 |
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
|
946 |
##>> translate_typ thy algbr eqngr false ty |
44996
410eea28b0f7
also adding type annotations for the dynamic invocation
bulwahn
parents:
44855
diff
changeset
|
947 |
##>> translate_term thy algbr eqngr false NONE (t', NONE) |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
948 |
#>> (fn ((vs, ty), t) => Fun |
52161 | 949 |
(@{const_name dummy_pattern}, (((vs, ty), [(([], t), (NONE, true))]), NONE))); |
31063
88aaab83b6fc
dropped explicit suppport for frees in evaluation conversion stack
haftmann
parents:
31054
diff
changeset
|
950 |
fun term_value (dep, (naming, program1)) = |
25969 | 951 |
let |
37437 | 952 |
val Fun (_, ((vs_ty, [(([], t), _)]), _)) = |
52161 | 953 |
Graph.get_node program1 @{const_name dummy_pattern}; |
954 |
val deps = Graph.immediate_succs program1 @{const_name dummy_pattern}; |
|
955 |
val program2 = Graph.del_node @{const_name dummy_pattern} program1; |
|
27103 | 956 |
val deps_all = Graph.all_succs program2 deps; |
46614
165886a4fe64
clarified Graph.restrict (formerly Graph.subgraph) based on public graph operations;
wenzelm
parents:
45987
diff
changeset
|
957 |
val program3 = Graph.restrict (member (op =) deps_all) program2; |
31063
88aaab83b6fc
dropped explicit suppport for frees in evaluation conversion stack
haftmann
parents:
31054
diff
changeset
|
958 |
in (((naming, program3), ((vs_ty, t), deps)), (dep, (naming, program2))) end; |
26011 | 959 |
in |
52161 | 960 |
ensure_stmt ((K o K) NONE) pair stmt_value @{const_name dummy_pattern} |
26011 | 961 |
#> snd |
31063
88aaab83b6fc
dropped explicit suppport for frees in evaluation conversion stack
haftmann
parents:
31054
diff
changeset
|
962 |
#> term_value |
26011 | 963 |
end; |
24219 | 964 |
|
39487
80b2cf3b0779
proper closures for static evaluation; no need for FIXMEs any longer
haftmann
parents:
39475
diff
changeset
|
965 |
fun original_sorts vs = |
80b2cf3b0779
proper closures for static evaluation; no need for FIXMEs any longer
haftmann
parents:
39475
diff
changeset
|
966 |
map (fn (v, _) => (v, (the o AList.lookup (op =) vs o prefix "'") v)); |
80b2cf3b0779
proper closures for static evaluation; no need for FIXMEs any longer
haftmann
parents:
39475
diff
changeset
|
967 |
|
80b2cf3b0779
proper closures for static evaluation; no need for FIXMEs any longer
haftmann
parents:
39475
diff
changeset
|
968 |
fun dynamic_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
|
969 |
let |
31063
88aaab83b6fc
dropped explicit suppport for frees in evaluation conversion stack
haftmann
parents:
31054
diff
changeset
|
970 |
val (((naming, program), (((vs', ty'), t'), deps)), _) = |
39397 | 971 |
invoke_generation false thy (algebra, eqngr) ensure_value t; |
39487
80b2cf3b0779
proper closures for static evaluation; no need for FIXMEs any longer
haftmann
parents:
39475
diff
changeset
|
972 |
in evaluator naming program ((original_sorts vs vs', (vs', ty')), t') deps end; |
30942
1e246776f876
diagnostic commands now in code_thingol; tuned code of funny continuations
haftmann
parents:
30932
diff
changeset
|
973 |
|
41184 | 974 |
fun dynamic_conv thy evaluator = |
975 |
Code_Preproc.dynamic_conv thy (dynamic_evaluator thy evaluator); |
|
39475 | 976 |
|
41184 | 977 |
fun dynamic_value thy postproc evaluator = |
978 |
Code_Preproc.dynamic_value thy postproc (dynamic_evaluator thy evaluator); |
|
30942
1e246776f876
diagnostic commands now in code_thingol; tuned code of funny continuations
haftmann
parents:
30932
diff
changeset
|
979 |
|
41365 | 980 |
fun lift_evaluation thy evaluation' algebra eqngr naming program vs t = |
39487
80b2cf3b0779
proper closures for static evaluation; no need for FIXMEs any longer
haftmann
parents:
39475
diff
changeset
|
981 |
let |
47576 | 982 |
val (((_, _), (((vs', ty'), t'), deps)), _) = |
39487
80b2cf3b0779
proper closures for static evaluation; no need for FIXMEs any longer
haftmann
parents:
39475
diff
changeset
|
983 |
ensure_value thy algebra eqngr t (NONE, (naming, program)); |
41365 | 984 |
in evaluation' ((original_sorts vs vs', (vs', ty')), t') deps end; |
985 |
||
986 |
fun lift_evaluator thy evaluator' consts algebra eqngr = |
|
987 |
let |
|
988 |
fun generate_consts thy algebra eqngr = |
|
989 |
fold_map (ensure_const thy algebra eqngr false); |
|
990 |
val (consts', (naming, program)) = |
|
991 |
invoke_generation true thy (algebra, eqngr) generate_consts consts; |
|
992 |
val evaluation' = evaluator' naming program consts'; |
|
993 |
in lift_evaluation thy evaluation' algebra eqngr naming program end; |
|
994 |
||
995 |
fun lift_evaluator_simple thy evaluator' consts algebra eqngr = |
|
996 |
let |
|
997 |
fun generate_consts thy algebra eqngr = |
|
998 |
fold_map (ensure_const thy algebra eqngr false); |
|
47576 | 999 |
val (_, (_, program)) = |
41365 | 1000 |
invoke_generation true thy (algebra, eqngr) generate_consts consts; |
1001 |
in evaluator' program end; |
|
39487
80b2cf3b0779
proper closures for static evaluation; no need for FIXMEs any longer
haftmann
parents:
39475
diff
changeset
|
1002 |
|
41184 | 1003 |
fun static_conv thy consts conv = |
41365 | 1004 |
Code_Preproc.static_conv thy consts (lift_evaluator thy conv consts); |
38672
f1f64375f662
preliminary versions of static_eval_conv(_simple)
haftmann
parents:
38669
diff
changeset
|
1005 |
|
41184 | 1006 |
fun static_conv_simple thy consts conv = |
41365 | 1007 |
Code_Preproc.static_conv thy consts (lift_evaluator_simple thy conv consts); |
38672
f1f64375f662
preliminary versions of static_eval_conv(_simple)
haftmann
parents:
38669
diff
changeset
|
1008 |
|
41184 | 1009 |
fun static_value thy postproc consts evaluator = |
41365 | 1010 |
Code_Preproc.static_value thy postproc consts (lift_evaluator thy evaluator consts); |
39487
80b2cf3b0779
proper closures for static evaluation; no need for FIXMEs any longer
haftmann
parents:
39475
diff
changeset
|
1011 |
|
30942
1e246776f876
diagnostic commands now in code_thingol; tuned code of funny continuations
haftmann
parents:
30932
diff
changeset
|
1012 |
|
1e246776f876
diagnostic commands now in code_thingol; tuned code of funny continuations
haftmann
parents:
30932
diff
changeset
|
1013 |
(** diagnostic commands **) |
1e246776f876
diagnostic commands now in code_thingol; tuned code of funny continuations
haftmann
parents:
30932
diff
changeset
|
1014 |
|
31036 | 1015 |
fun read_const_exprs thy = |
1016 |
let |
|
36272
4d358c582ffb
optionally ignore errors during translation of equations; tuned representation of abstraction points
haftmann
parents:
36210
diff
changeset
|
1017 |
fun consts_of thy' = Symtab.fold (fn (c, (_, NONE)) => cons c | _ => I) |
47005
421760a1efe7
maintain generic context naming in structure Name_Space (NB: empty = default_naming, init = local_naming);
wenzelm
parents:
46961
diff
changeset
|
1018 |
((snd o #constants o Consts.dest o Sign.consts_of) thy') []; |
36272
4d358c582ffb
optionally ignore errors during translation of equations; tuned representation of abstraction points
haftmann
parents:
36210
diff
changeset
|
1019 |
fun belongs_here thy' c = forall |
4d358c582ffb
optionally ignore errors during translation of equations; tuned representation of abstraction points
haftmann
parents:
36210
diff
changeset
|
1020 |
(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
|
1021 |
fun consts_of_select thy' = filter (belongs_here thy') (consts_of thy'); |
52801 | 1022 |
|
1023 |
val ctxt = Proof_Context.init_global thy; |
|
1024 |
fun read_const_expr str = |
|
1025 |
(case Syntax.parse_token ctxt (K NONE) Markup.empty (SOME o Symbol_Pos.implode o #1) str of |
|
1026 |
SOME "_" => ([], consts_of thy) |
|
1027 |
| SOME s => |
|
1028 |
if String.isSuffix "._" s |
|
40711
81bc73585eec
globbing constant expressions use more idiomatic underscore rather than star
haftmann
parents:
39566
diff
changeset
|
1029 |
then ([], consts_of_select (Context.this_theory thy (unsuffix "._" s))) |
52801 | 1030 |
else ([Code.read_const thy str], []) |
1031 |
| NONE => ([Code.read_const thy str], [])); |
|
31036 | 1032 |
in pairself flat o split_list o map read_const_expr end; |
1033 |
||
30942
1e246776f876
diagnostic commands now in code_thingol; tuned code of funny continuations
haftmann
parents:
30932
diff
changeset
|
1034 |
fun code_depgr thy consts = |
1e246776f876
diagnostic commands now in code_thingol; tuned code of funny continuations
haftmann
parents:
30932
diff
changeset
|
1035 |
let |
39397 | 1036 |
val (_, eqngr) = Code_Preproc.obtain true thy consts []; |
34173
458ced35abb8
reduced code generator cache to the baremost minimum
haftmann
parents:
34084
diff
changeset
|
1037 |
val all_consts = Graph.all_succs eqngr consts; |
46614
165886a4fe64
clarified Graph.restrict (formerly Graph.subgraph) based on public graph operations;
wenzelm
parents:
45987
diff
changeset
|
1038 |
in Graph.restrict (member (op =) all_consts) eqngr end; |
30942
1e246776f876
diagnostic commands now in code_thingol; tuned code of funny continuations
haftmann
parents:
30932
diff
changeset
|
1039 |
|
31125
80218ee73167
transferred code generator preprocessor into separate module
haftmann
parents:
31088
diff
changeset
|
1040 |
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
|
1041 |
|
1e246776f876
diagnostic commands now in code_thingol; tuned code of funny continuations
haftmann
parents:
30932
diff
changeset
|
1042 |
fun code_deps thy consts = |
27103 | 1043 |
let |
30942
1e246776f876
diagnostic commands now in code_thingol; tuned code of funny continuations
haftmann
parents:
30932
diff
changeset
|
1044 |
val eqngr = code_depgr thy consts; |
1e246776f876
diagnostic commands now in code_thingol; tuned code of funny continuations
haftmann
parents:
30932
diff
changeset
|
1045 |
val constss = Graph.strong_conn eqngr; |
1e246776f876
diagnostic commands now in code_thingol; tuned code of funny continuations
haftmann
parents:
30932
diff
changeset
|
1046 |
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
|
1047 |
Symtab.update (const, consts)) consts) constss; |
1e246776f876
diagnostic commands now in code_thingol; tuned code of funny continuations
haftmann
parents:
30932
diff
changeset
|
1048 |
fun succs consts = consts |
44338
700008399ee5
refined Graph implementation: more abstract/scalable Graph.Keys instead of plain lists -- order of adjacency is now standardized wrt. Key.ord;
wenzelm
parents:
43329
diff
changeset
|
1049 |
|> maps (Graph.immediate_succs eqngr) |
30942
1e246776f876
diagnostic commands now in code_thingol; tuned code of funny continuations
haftmann
parents:
30932
diff
changeset
|
1050 |
|> subtract (op =) consts |
1e246776f876
diagnostic commands now in code_thingol; tuned code of funny continuations
haftmann
parents:
30932
diff
changeset
|
1051 |
|> map (the o Symtab.lookup mapping) |
1e246776f876
diagnostic commands now in code_thingol; tuned code of funny continuations
haftmann
parents:
30932
diff
changeset
|
1052 |
|> distinct (op =); |
1e246776f876
diagnostic commands now in code_thingol; tuned code of funny continuations
haftmann
parents:
30932
diff
changeset
|
1053 |
val conn = [] |> fold (fn consts => cons (consts, succs consts)) constss; |
31156 | 1054 |
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
|
1055 |
|> commas; |
1e246776f876
diagnostic commands now in code_thingol; tuned code of funny continuations
haftmann
parents:
30932
diff
changeset
|
1056 |
val prgr = map (fn (consts, constss) => |
1e246776f876
diagnostic commands now in code_thingol; tuned code of funny continuations
haftmann
parents:
30932
diff
changeset
|
1057 |
{ name = namify consts, ID = namify consts, dir = "", unfold = true, |
49561 | 1058 |
path = "", parents = map namify constss, content = [] }) conn; |
1059 |
in Graph_Display.display_graph prgr end; |
|
30942
1e246776f876
diagnostic commands now in code_thingol; tuned code of funny continuations
haftmann
parents:
30932
diff
changeset
|
1060 |
|
1e246776f876
diagnostic commands now in code_thingol; tuned code of funny continuations
haftmann
parents:
30932
diff
changeset
|
1061 |
local |
27103 | 1062 |
|
31036 | 1063 |
fun code_thms_cmd thy = code_thms thy o op @ o read_const_exprs thy; |
1064 |
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
|
1065 |
|
1e246776f876
diagnostic commands now in code_thingol; tuned code of funny continuations
haftmann
parents:
30932
diff
changeset
|
1066 |
in |
1e246776f876
diagnostic commands now in code_thingol; tuned code of funny continuations
haftmann
parents:
30932
diff
changeset
|
1067 |
|
1e246776f876
diagnostic commands now in code_thingol; tuned code of funny continuations
haftmann
parents:
30932
diff
changeset
|
1068 |
val _ = |
46961
5c6955f487e5
outer syntax command definitions based on formal command_spec derived from theory header declarations;
wenzelm
parents:
46665
diff
changeset
|
1069 |
Outer_Syntax.improper_command @{command_spec "code_thms"} |
5c6955f487e5
outer syntax command definitions based on formal command_spec derived from theory header declarations;
wenzelm
parents:
46665
diff
changeset
|
1070 |
"print system of code equations for code" |
52801 | 1071 |
(Scan.repeat1 Parse.term >> (fn cs => |
51658
21c10672633b
discontinued Toplevel.no_timing complication -- also recovers timing of diagnostic commands, e.g. 'find_theorems';
wenzelm
parents:
50625
diff
changeset
|
1072 |
Toplevel.unknown_theory o |
21c10672633b
discontinued Toplevel.no_timing complication -- also recovers timing of diagnostic commands, e.g. 'find_theorems';
wenzelm
parents:
50625
diff
changeset
|
1073 |
Toplevel.keep (fn state => code_thms_cmd (Toplevel.theory_of state) cs))); |
30942
1e246776f876
diagnostic commands now in code_thingol; tuned code of funny continuations
haftmann
parents:
30932
diff
changeset
|
1074 |
|
1e246776f876
diagnostic commands now in code_thingol; tuned code of funny continuations
haftmann
parents:
30932
diff
changeset
|
1075 |
val _ = |
46961
5c6955f487e5
outer syntax command definitions based on formal command_spec derived from theory header declarations;
wenzelm
parents:
46665
diff
changeset
|
1076 |
Outer_Syntax.improper_command @{command_spec "code_deps"} |
5c6955f487e5
outer syntax command definitions based on formal command_spec derived from theory header declarations;
wenzelm
parents:
46665
diff
changeset
|
1077 |
"visualize dependencies of code equations for code" |
52801 | 1078 |
(Scan.repeat1 Parse.term >> (fn cs => |
51658
21c10672633b
discontinued Toplevel.no_timing complication -- also recovers timing of diagnostic commands, e.g. 'find_theorems';
wenzelm
parents:
50625
diff
changeset
|
1079 |
Toplevel.unknown_theory o |
21c10672633b
discontinued Toplevel.no_timing complication -- also recovers timing of diagnostic commands, e.g. 'find_theorems';
wenzelm
parents:
50625
diff
changeset
|
1080 |
Toplevel.keep (fn state => code_deps_cmd (Toplevel.theory_of state) cs))); |
30942
1e246776f876
diagnostic commands now in code_thingol; tuned code of funny continuations
haftmann
parents:
30932
diff
changeset
|
1081 |
|
1e246776f876
diagnostic commands now in code_thingol; tuned code of funny continuations
haftmann
parents:
30932
diff
changeset
|
1082 |
end; |
27103 | 1083 |
|
24219 | 1084 |
end; (*struct*) |
1085 |
||
1086 |
||
28054 | 1087 |
structure Basic_Code_Thingol: BASIC_CODE_THINGOL = Code_Thingol; |