1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
|
structure MonoFooify :> MONO_FOOIFY = struct
open Mono
datatype foo_kind =
Attr
| Url
val nextPvar = ref 0
val pvarDefs = ref ([] : (string * int * (string * int * typ option) list) list)
structure Fm = struct
type vr = string * int * typ * exp * string
structure IM = IntBinaryMap
structure M = BinaryMapFn(struct
type ord_key = foo_kind
fun compare x =
case x of
(Attr, Attr) => EQUAL
| (Attr, _) => LESS
| (_, Attr) => GREATER
| (Url, Url) => EQUAL
end)
structure TM = BinaryMapFn(struct
type ord_key = typ
val compare = MonoUtil.Typ.compare
end)
type t = {
count : int,
map : int IM.map M.map,
listMap : int TM.map M.map,
decls : vr list
}
fun empty count = {
count = count,
map = M.empty,
listMap = M.empty,
decls = []
}
fun chooseNext count =
let
val n = !nextPvar
in
if count < n then
(count, count+1)
else
(nextPvar := n + 1;
(n, n+1))
end
fun enter ({count, map, listMap, ...} : t) = {count = count, map = map, listMap = listMap, decls = []}
fun freshName {count, map, listMap, decls} =
let
val (next, count) = chooseNext count
in
(next, {count = count , map = map, listMap = listMap, decls = decls})
end
fun decls ({decls, ...} : t) =
case decls of
[] => []
| _ => [(DValRec decls, ErrorMsg.dummySpan)]
fun lookup (t as {count, map, listMap, decls}) k n thunk =
let
val im = Option.getOpt (M.find (map, k), IM.empty)
in
case IM.find (im, n) of
NONE =>
let
val n' = count
val (d, {count, map, listMap, decls}) =
thunk count {count = count + 1,
map = M.insert (map, k, IM.insert (im, n, n')),
listMap = listMap,
decls = decls}
in
({count = count,
map = map,
listMap = listMap,
decls = d :: decls}, n')
end
| SOME n' => (t, n')
end
fun lookupList (t as {count, map, listMap, decls}) k tp thunk =
let
val tm = Option.getOpt (M.find (listMap, k), TM.empty)
in
case TM.find (tm, tp) of
NONE =>
let
val n' = count
val (d, {count, map, listMap, decls}) =
thunk count {count = count + 1,
map = map,
listMap = M.insert (listMap, k, TM.insert (tm, tp, n')),
decls = decls}
in
({count = count,
map = map,
listMap = listMap,
decls = d :: decls}, n')
end
| SOME n' => (t, n')
end
end
fun fk2s fk =
case fk of
Attr => "attr"
| Url => "url"
fun capitalize s =
if s = "" then
s
else
str (Char.toUpper (String.sub (s, 0))) ^ String.extract (s, 1, NONE)
structure E = ErrorMsg
exception TypeMismatch of Fm.t * E.span
exception CantPass of Fm.t * typ
exception DontKnow of Fm.t * typ
val dummyExp = (EPrim (Prim.Int 0), E.dummySpan)
fun fooifyExpWithExceptions fk lookupENamed lookupDatatype =
let
fun fooify fm (e, tAll as (t, loc)) =
case #1 e of
EClosure (fnam, [(ERecord [], _)]) =>
let
val (_, s) = lookupENamed fnam
in
((EPrim (Prim.String (Prim.Normal, Settings.getUrlPrefix () ^ s)), loc), fm)
end
| EClosure (fnam, args) =>
let
val (ft, s) = lookupENamed fnam
fun attrify (args, ft, e, fm) =
case (args, ft) of
([], _) => (e, fm)
| (arg :: args, (TFun (t, ft), _)) =>
let
val (arg', fm) = fooify fm (arg, t)
in
attrify (args, ft,
(EStrcat (e,
(EStrcat ((EPrim (Prim.String (Prim.Normal, "/")), loc),
arg'), loc)), loc),
fm)
end
| _ => raise TypeMismatch (fm, loc)
in
attrify (args, ft, (EPrim (Prim.String (Prim.Normal, Settings.getUrlPrefix () ^ s)), loc), fm)
end
| _ =>
case t of
TFfi ("Basis", "unit") => ((EPrim (Prim.String (Prim.Normal, "_")), loc), fm)
| TFfi (m, x) => (if Settings.mayClientToServer (m, x)
then ((EFfiApp (m, fk2s fk ^ "ify" ^ capitalize x, [(e, tAll)]), loc), fm)
else raise CantPass (fm, tAll))
| TRecord [] => ((EPrim (Prim.String (Prim.Normal, "_")), loc), fm)
| TRecord ((x, t) :: xts) =>
let
val (se, fm) = fooify fm ((EField (e, x), loc), t)
in
foldl (fn ((x, t), (se, fm)) =>
let
val (se', fm) = fooify fm ((EField (e, x), loc), t)
in
((EStrcat (se,
(EStrcat ((EPrim (Prim.String (Prim.Normal, "/")), loc),
se'), loc)), loc),
fm)
end) (se, fm) xts
end
| TDatatype (i, ref (dk, _)) =>
let
fun makeDecl n fm =
let
val (x, xncs) =
case ListUtil.search (fn (x, i', xncs) =>
if i' = i then
SOME (x, xncs)
else
NONE) (!pvarDefs) of
NONE => lookupDatatype i
| SOME v => v
val (branches, fm) =
ListUtil.foldlMap
(fn ((x, n, to), fm) =>
case to of
NONE =>
(((PCon (dk, PConVar n, NONE), loc),
(EPrim (Prim.String (Prim.Normal, x)), loc)),
fm)
| SOME t =>
let
val (arg, fm) = fooify fm ((ERel 0, loc), t)
in
(((PCon (dk, PConVar n, SOME (PVar ("a", t), loc)), loc),
(EStrcat ((EPrim (Prim.String (Prim.Normal, x ^ "/")), loc),
arg), loc)),
fm)
end)
fm xncs
val dom = tAll
val ran = (TFfi ("Basis", "string"), loc)
in
((fk2s fk ^ "ify_" ^ x,
n,
(TFun (dom, ran), loc),
(EAbs ("x",
dom,
ran,
(ECase ((ERel 0, loc),
branches,
{disc = dom,
result = ran}), loc)), loc),
""),
fm)
end
val (fm, n) = Fm.lookup fm fk i makeDecl
in
((EApp ((ENamed n, loc), e), loc), fm)
end
| TOption t =>
let
val (body, fm) = fooify fm ((ERel 0, loc), t)
in
((ECase (e,
[((PNone t, loc),
(EPrim (Prim.String (Prim.Normal, "None")), loc)),
((PSome (t, (PVar ("x", t), loc)), loc),
(EStrcat ((EPrim (Prim.String (Prim.Normal, "Some/")), loc),
body), loc))],
{disc = tAll,
result = (TFfi ("Basis", "string"), loc)}), loc),
fm)
end
| TList t =>
let
fun makeDecl n fm =
let
val rt = (TRecord [("1", t), ("2", (TList t, loc))], loc)
val (arg, fm) = fooify fm ((ERel 0, loc), rt)
val branches = [((PNone rt, loc),
(EPrim (Prim.String (Prim.Normal, "Nil")), loc)),
((PSome (rt, (PVar ("a", rt), loc)), loc),
(EStrcat ((EPrim (Prim.String (Prim.Normal, "Cons/")), loc),
arg), loc))]
val dom = tAll
val ran = (TFfi ("Basis", "string"), loc)
in
((fk2s fk ^ "ify_list",
n,
(TFun (dom, ran), loc),
(EAbs ("x",
dom,
ran,
(ECase ((ERel 0, loc),
branches,
{disc = dom,
result = ran}), loc)), loc),
""),
fm)
end
val (fm, n) = Fm.lookupList fm fk t makeDecl
in
((EApp ((ENamed n, loc), e), loc), fm)
end
| _ => raise DontKnow (fm, tAll)
in
fooify
end
fun fooifyExp fk lookupENamed lookupDatatype fm exp =
fooifyExpWithExceptions fk lookupENamed lookupDatatype fm exp
handle TypeMismatch (fm, loc) =>
(E.errorAt loc "Type mismatch encoding attribute";
(dummyExp, fm))
| CantPass (fm, typ as (_, loc)) =>
(E.errorAt loc "MonoFooify: can't pass type from client to server";
Print.eprefaces' [("Type", MonoPrint.p_typ MonoEnv.empty typ)];
(dummyExp, fm))
| DontKnow (fm, typ as (_, loc)) =>
(E.errorAt loc "Don't know how to encode attribute/URL type";
Print.eprefaces' [("Type", MonoPrint.p_typ MonoEnv.empty typ)];
(dummyExp, fm))
(* Has to be set at the end of [Monoize]. *)
val canonicalFm = ref (Fm.empty 0 : Fm.t)
fun urlify env expTyp =
let
val (exp, fm) =
fooifyExpWithExceptions
Url
(fn n =>
let
val (_, t, _, s) = MonoEnv.lookupENamed env n
in
(t, s)
end)
(fn n => MonoEnv.lookupDatatype env n)
(!canonicalFm)
expTyp
in
canonicalFm := fm;
SOME exp
end
handle TypeMismatch _ => NONE
| CantPass _ => NONE
| DontKnow _ => NONE
fun getNewFmDecls () =
let
val fm = !canonicalFm
in
canonicalFm := Fm.enter fm;
Fm.decls fm
end
end
|
