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
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
|
(* Copyright (c) 2008, Adam Chlipala
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* - Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* - Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* - The names of contributors may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*)
structure Corify :> CORIFY = struct
structure EM = ErrorMsg
structure L = Expl
structure L' = Core
structure IM = IntBinaryMap
structure SM = BinaryMapFn(struct
type ord_key = string
val compare = String.compare
end)
local
val count = ref 0
in
fun reset v = count := v
fun alloc () =
let
val r = !count
in
count := r + 1;
r
end
end
structure St : sig
type t
val empty : t
val enter : t -> t
val leave : t -> {outer : t, inner : t}
val ffi : string -> L'.con SM.map -> t
datatype core_con =
CNormal of int
| CFfi of string
val bindCon : t -> string -> int -> t * int
val lookupConById : t -> int -> int option
val lookupConByName : t -> string -> core_con
datatype core_val =
ENormal of int
| EFfi of string * L'.con
val bindVal : t -> string -> int -> t * int
val lookupValById : t -> int -> int option
val lookupValByName : t -> string -> core_val
val bindStr : t -> string -> int -> t -> t
val lookupStrById : t -> int -> t
val lookupStrByName : string * t -> t
val bindFunctor : t -> string -> int -> int -> L.str -> t
val lookupFunctorById : t -> int -> int * L.str
val lookupFunctorByName : string * t -> int * L.str
end = struct
datatype flattening =
FNormal of {cons : int SM.map,
vals : int SM.map,
strs : flattening SM.map,
funs : (int * L.str) SM.map}
| FFfi of {mod : string,
vals : L'.con SM.map}
type t = {
cons : int IM.map,
vals : int IM.map,
strs : flattening IM.map,
funs : (int * L.str) IM.map,
current : flattening,
nested : flattening list
}
val empty = {
cons = IM.empty,
vals = IM.empty,
strs = IM.empty,
funs = IM.empty,
current = FNormal { cons = SM.empty, vals = SM.empty, strs = SM.empty, funs = SM.empty },
nested = []
}
datatype core_con =
CNormal of int
| CFfi of string
datatype core_val =
ENormal of int
| EFfi of string * L'.con
fun bindCon {cons, vals, strs, funs, current, nested} s n =
let
val n' = alloc ()
val current =
case current of
FFfi _ => raise Fail "Binding inside FFfi"
| FNormal {cons, vals, strs, funs} =>
FNormal {cons = SM.insert (cons, s, n'),
vals = vals,
strs = strs,
funs = funs}
in
({cons = IM.insert (cons, n, n'),
vals = vals,
strs = strs,
funs = funs,
current = current,
nested = nested},
n')
end
fun lookupConById ({cons, ...} : t) n = IM.find (cons, n)
fun lookupConByName ({current, ...} : t) x =
case current of
FFfi {mod = m, ...} => CFfi m
| FNormal {cons, ...} =>
case SM.find (cons, x) of
NONE => raise Fail "Corify.St.lookupConByName"
| SOME n => CNormal n
fun bindVal {cons, vals, strs, funs, current, nested} s n =
let
val n' = alloc ()
val current =
case current of
FFfi _ => raise Fail "Binding inside FFfi"
| FNormal {cons, vals, strs, funs} =>
FNormal {cons = cons,
vals = SM.insert (vals, s, n'),
strs = strs,
funs = funs}
in
({cons = cons,
vals = IM.insert (vals, n, n'),
strs = strs,
funs = funs,
current = current,
nested = nested},
n')
end
fun lookupValById ({vals, ...} : t) n = IM.find (vals, n)
fun lookupValByName ({current, ...} : t) x =
case current of
FFfi {mod = m, vals, ...} =>
(case SM.find (vals, x) of
NONE => raise Fail "Corify.St.lookupValByName: no type for FFI val"
| SOME t => EFfi (m, t))
| FNormal {vals, ...} =>
case SM.find (vals, x) of
NONE => raise Fail "Corify.St.lookupValByName"
| SOME n => ENormal n
fun enter {cons, vals, strs, funs, current, nested} =
{cons = cons,
vals = vals,
strs = strs,
funs = funs,
current = FNormal {cons = SM.empty,
vals = SM.empty,
strs = SM.empty,
funs = SM.empty},
nested = current :: nested}
fun dummy f = {cons = IM.empty,
vals = IM.empty,
strs = IM.empty,
funs = IM.empty,
current = f,
nested = []}
fun leave {cons, vals, strs, funs, current, nested = m1 :: rest} =
{outer = {cons = cons,
vals = vals,
strs = strs,
funs = funs,
current = m1,
nested = rest},
inner = dummy current}
| leave _ = raise Fail "Corify.St.leave"
fun ffi m vals = dummy (FFfi {mod = m, vals = vals})
fun bindStr ({cons, vals, strs, funs,
current = FNormal {cons = mcons, vals = mvals, strs = mstrs, funs = mfuns}, nested} : t)
x n ({current = f, ...} : t) =
{cons = cons,
vals = vals,
strs = IM.insert (strs, n, f),
funs = funs,
current = FNormal {cons = mcons,
vals = mvals,
strs = SM.insert (mstrs, x, f),
funs = mfuns},
nested = nested}
| bindStr _ _ _ _ = raise Fail "Corify.St.bindStr"
fun lookupStrById ({strs, ...} : t) n =
case IM.find (strs, n) of
NONE => raise Fail "Corify.St.lookupStrById"
| SOME f => dummy f
fun lookupStrByName (m, {current = FNormal {strs, ...}, ...} : t) =
(case SM.find (strs, m) of
NONE => raise Fail "Corify.St.lookupStrByName"
| SOME f => dummy f)
| lookupStrByName _ = raise Fail "Corify.St.lookupStrByName"
fun bindFunctor ({cons, vals, strs, funs,
current = FNormal {cons = mcons, vals = mvals, strs = mstrs, funs = mfuns}, nested} : t)
x n na str =
{cons = cons,
vals = vals,
strs = strs,
funs = IM.insert (funs, n, (na, str)),
current = FNormal {cons = mcons,
vals = mvals,
strs = mstrs,
funs = SM.insert (mfuns, x, (na, str))},
nested = nested}
| bindFunctor _ _ _ _ _ = raise Fail "Corify.St.bindFunctor"
fun lookupFunctorById ({funs, ...} : t) n =
case IM.find (funs, n) of
NONE => raise Fail "Corify.St.lookupFunctorById"
| SOME v => v
fun lookupFunctorByName (m, {current = FNormal {funs, ...}, ...} : t) =
(case SM.find (funs, m) of
NONE => raise Fail "Corify.St.lookupFunctorByName"
| SOME v => v)
| lookupFunctorByName _ = raise Fail "Corify.St.lookupFunctorByName"
end
fun corifyKind (k, loc) =
case k of
L.KType => (L'.KType, loc)
| L.KArrow (k1, k2) => (L'.KArrow (corifyKind k1, corifyKind k2), loc)
| L.KName => (L'.KName, loc)
| L.KRecord k => (L'.KRecord (corifyKind k), loc)
fun corifyCon st (c, loc) =
case c of
L.TFun (t1, t2) => (L'.TFun (corifyCon st t1, corifyCon st t2), loc)
| L.TCFun (x, k, t) => (L'.TCFun (x, corifyKind k, corifyCon st t), loc)
| L.TRecord c => (L'.TRecord (corifyCon st c), loc)
| L.CRel n => (L'.CRel n, loc)
| L.CNamed n =>
(case St.lookupConById st n of
NONE => (L'.CNamed n, loc)
| SOME n => (L'.CNamed n, loc))
| L.CModProj (m, ms, x) =>
let
val st = St.lookupStrById st m
val st = foldl St.lookupStrByName st ms
in
case St.lookupConByName st x of
St.CNormal n => (L'.CNamed n, loc)
| St.CFfi m => (L'.CFfi (m, x), loc)
end
| L.CApp (c1, c2) => (L'.CApp (corifyCon st c1, corifyCon st c2), loc)
| L.CAbs (x, k, c) => (L'.CAbs (x, corifyKind k, corifyCon st c), loc)
| L.CName s => (L'.CName s, loc)
| L.CRecord (k, xcs) =>
(L'.CRecord (corifyKind k, map (fn (c1, c2) => (corifyCon st c1, corifyCon st c2)) xcs), loc)
| L.CConcat (c1, c2) => (L'.CConcat (corifyCon st c1, corifyCon st c2), loc)
| L.CFold (k1, k2) => (L'.CFold (corifyKind k1, corifyKind k2), loc)
fun corifyExp st (e, loc) =
case e of
L.EPrim p => (L'.EPrim p, loc)
| L.ERel n => (L'.ERel n, loc)
| L.ENamed n =>
(case St.lookupValById st n of
NONE => (L'.ENamed n, loc)
| SOME n => (L'.ENamed n, loc))
| L.EModProj (m, ms, x) =>
let
val st = St.lookupStrById st m
val st = foldl St.lookupStrByName st ms
in
case St.lookupValByName st x of
St.ENormal n => (L'.ENamed n, loc)
| St.EFfi (m, t) =>
case t of
(L'.TFun (dom as (L'.TRecord (L'.CRecord (_, []), _), _), ran), _) =>
(L'.EAbs ("arg", dom, ran, (L'.EFfiApp (m, x, []), loc)), loc)
| t as (L'.TFun _, _) =>
let
fun getArgs (all as (t, _), args) =
case t of
L'.TFun (dom, ran) => getArgs (ran, dom :: args)
| _ => (all, rev args)
val (result, args) = getArgs (t, [])
val (actuals, _) = foldr (fn (_, (actuals, n)) =>
((L'.ERel n, loc) :: actuals,
n + 1)) ([], 0) args
val app = (L'.EFfiApp (m, x, actuals), loc)
val (abs, _, _) = foldr (fn (t, (abs, ran, n)) =>
((L'.EAbs ("arg" ^ Int.toString n,
t,
ran,
abs), loc),
(L'.TFun (t, ran), loc),
n - 1)) (app, result, length args - 1) args
in
abs
end
| _ => (L'.EFfi (m, x), loc)
end
| L.EApp (e1, e2) => (L'.EApp (corifyExp st e1, corifyExp st e2), loc)
| L.EAbs (x, dom, ran, e1) => (L'.EAbs (x, corifyCon st dom, corifyCon st ran, corifyExp st e1), loc)
| L.ECApp (e1, c) => (L'.ECApp (corifyExp st e1, corifyCon st c), loc)
| L.ECAbs (x, k, e1) => (L'.ECAbs (x, corifyKind k, corifyExp st e1), loc)
| L.ERecord xes => (L'.ERecord (map (fn (c, e, t) => (corifyCon st c, corifyExp st e, corifyCon st t)) xes), loc)
| L.EField (e1, c, {field, rest}) => (L'.EField (corifyExp st e1, corifyCon st c,
{field = corifyCon st field, rest = corifyCon st rest}), loc)
| L.EFold k => (L'.EFold (corifyKind k), loc)
fun corifyDecl ((d, loc : EM.span), st) =
case d of
L.DCon (x, n, k, c) =>
let
val (st, n) = St.bindCon st x n
in
([(L'.DCon (x, n, corifyKind k, corifyCon st c), loc)], st)
end
| L.DVal (x, n, t, e) =>
let
val (st, n) = St.bindVal st x n
in
([(L'.DVal (x, n, corifyCon st t, corifyExp st e), loc)], st)
end
| L.DSgn _ => ([], st)
| L.DStr (x, n, _, (L.StrFun (_, na, _, _, str), _)) =>
([], St.bindFunctor st x n na str)
| L.DStr (x, n, _, str) =>
let
val (ds, {inner, outer}) = corifyStr (str, st)
val st = St.bindStr outer x n inner
in
(ds, st)
end
| L.DFfiStr (m, n, (sgn, _)) =>
(case sgn of
L.SgnConst sgis =>
let
val (ds, cmap, st) =
foldl (fn ((sgi, _), (ds, cmap, st)) =>
case sgi of
L.SgiConAbs (x, n, k) =>
let
val (st, n') = St.bindCon st x n
in
((L'.DCon (x, n', corifyKind k, (L'.CFfi (m, x), loc)), loc) :: ds,
cmap,
st)
end
| L.SgiCon (x, n, k, _) =>
let
val (st, n') = St.bindCon st x n
in
((L'.DCon (x, n', corifyKind k, (L'.CFfi (m, x), loc)), loc) :: ds,
cmap,
st)
end
| L.SgiVal (x, _, c) =>
(ds,
SM.insert (cmap, x, corifyCon st c),
st)
| _ => (ds, cmap, st)) ([], SM.empty, st) sgis
val st = St.bindStr st m n (St.ffi m cmap)
in
(rev ds, st)
end
| _ => raise Fail "Non-const signature for FFI structure")
and corifyStr ((str, _), st) =
case str of
L.StrConst ds =>
let
val st = St.enter st
val (ds, st) = ListUtil.foldlMapConcat corifyDecl st ds
in
(ds, St.leave st)
end
| L.StrVar n => ([], {inner = St.lookupStrById st n, outer = st})
| L.StrProj (str, x) =>
let
val (ds, {inner, outer}) = corifyStr (str, st)
in
(ds, {inner = St.lookupStrByName (x, inner), outer = outer})
end
| L.StrFun _ => raise Fail "Corify of nested functor definition"
| L.StrApp (str1, str2) =>
let
fun unwind' (str, _) =
case str of
L.StrVar n => St.lookupStrById st n
| L.StrProj (str, x) => St.lookupStrByName (x, unwind' str)
| _ => raise Fail "Corify of fancy functor application [1]"
fun unwind (str, _) =
case str of
L.StrVar n => St.lookupFunctorById st n
| L.StrProj (str, x) => St.lookupFunctorByName (x, unwind' str)
| _ => raise Fail "Corify of fancy functor application [2]"
val (na, body) = unwind str1
val (ds1, {inner, outer}) = corifyStr (str2, st)
val (ds2, sts) = corifyStr (body, St.bindStr outer "ARG" na inner)
in
(ds1 @ ds2, sts)
end
fun maxName ds = foldl (fn ((d, _), n) =>
case d of
L.DCon (_, n', _, _) => Int.max (n, n')
| L.DVal (_, n', _ , _) => Int.max (n, n')
| L.DSgn (_, n', _) => Int.max (n, n')
| L.DStr (_, n', _, str) => Int.max (n, Int.max (n', maxNameStr str))
| L.DFfiStr (_, n', _) => Int.max (n, n'))
0 ds
and maxNameStr (str, _) =
case str of
L.StrConst ds => maxName ds
| L.StrVar n => n
| L.StrProj (str, _) => maxNameStr str
| L.StrFun (_, _, _, _, str) => maxNameStr str
| L.StrApp (str1, str2) => Int.max (maxNameStr str1, maxNameStr str2)
fun corify ds =
let
val () = reset (maxName ds + 1)
val (ds, _) = ListUtil.foldlMapConcat corifyDecl St.empty ds
in
ds
end
end
|