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
494
495
496
497
498
499
500
501
502
503
504
505
|
(* 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 MonoUtil :> MONO_UTIL = struct
open Mono
structure S = Search
val dummyt = (TRecord [], ErrorMsg.dummySpan)
structure Typ = struct
open Order
fun compare ((t1, _), (t2, _)) =
case (t1, t2) of
(TFun (d1, r1), TFun (d2, r2)) =>
join (compare (d1, d2), fn () => compare (r1, r2))
| (TRecord xts1, TRecord xts2) =>
let
val xts1 = sortFields xts1
val xts2 = sortFields xts2
in
joinL compareFields (xts1, xts2)
end
| (TDatatype (n1, _), TDatatype (n2, _)) => Int.compare (n1, n2)
| (TFfi (m1, x1), TFfi (m2, x2)) => join (String.compare (m1, m2), fn () => String.compare (x1, x2))
| (TOption t1, TOption t2) => compare (t1, t2)
| (TFun _, _) => LESS
| (_, TFun _) => GREATER
| (TRecord _, _) => LESS
| (_, TRecord _) => GREATER
| (TDatatype _, _) => LESS
| (_, TDatatype _) => GREATER
| (TFfi _, _) => LESS
| (_, TFfi _) => GREATER
and compareFields ((x1, t1), (x2, t2)) =
join (String.compare (x1, x2),
fn () => compare (t1, t2))
and sortFields xts = ListMergeSort.sort (fn (x, y) => compareFields (x, y) = GREATER) xts
fun mapfold fc =
let
fun mft c acc =
S.bindP (mft' c acc, fc)
and mft' (cAll as (c, loc)) =
case c of
TFun (t1, t2) =>
S.bind2 (mft t1,
fn t1' =>
S.map2 (mft t2,
fn t2' =>
(TFun (t1', t2'), loc)))
| TRecord xts =>
S.map2 (ListUtil.mapfold (fn (x, t) =>
S.map2 (mft t,
fn t' =>
(x, t')))
xts,
fn xts' => (TRecord xts', loc))
| TDatatype _ => S.return2 cAll
| TFfi _ => S.return2 cAll
| TOption t =>
S.map2 (mft t,
fn t' =>
(TOption t, loc))
in
mft
end
fun map typ c =
case mapfold (fn c => fn () => S.Continue (typ c, ())) c () of
S.Return () => raise Fail "Mono_util.Typ.map"
| S.Continue (c, ()) => c
fun fold typ s c =
case mapfold (fn c => fn s => S.Continue (c, typ (c, s))) c s of
S.Continue (_, s) => s
| S.Return _ => raise Fail "MonoUtil.Typ.fold: Impossible"
fun exists typ k =
case mapfold (fn c => fn () =>
if typ c then
S.Return ()
else
S.Continue (c, ())) k () of
S.Return _ => true
| S.Continue _ => false
end
structure Exp = struct
datatype binder =
Datatype of string * int * (string * int * typ option) list
| RelE of string * typ
| NamedE of string * int * typ * exp option * string
fun mapfoldB {typ = fc, exp = fe, bind} =
let
val mft = Typ.mapfold fc
fun mfe ctx e acc =
S.bindP (mfe' ctx e acc, fe ctx)
and mfe' ctx (eAll as (e, loc)) =
case e of
EPrim _ => S.return2 eAll
| ERel _ => S.return2 eAll
| ENamed _ => S.return2 eAll
| ECon (_, _, NONE) => S.return2 eAll
| ECon (dk, n, SOME e) =>
S.map2 (mfe ctx e,
fn e' =>
(ECon (dk, n, SOME e'), loc))
| ENone t =>
S.map2 (mft t,
fn t' =>
(ENone t', loc))
| ESome (t, e) =>
S.bind2 (mft t,
fn t' =>
S.map2 (mfe ctx e,
fn e' =>
(ESome (t', e'), loc)))
| EFfi _ => S.return2 eAll
| EFfiApp (m, x, es) =>
S.map2 (ListUtil.mapfold (fn e => mfe ctx e) es,
fn es' =>
(EFfiApp (m, x, es'), loc))
| EApp (e1, e2) =>
S.bind2 (mfe ctx e1,
fn e1' =>
S.map2 (mfe ctx e2,
fn e2' =>
(EApp (e1', e2'), loc)))
| EAbs (x, dom, ran, e) =>
S.bind2 (mft dom,
fn dom' =>
S.bind2 (mft ran,
fn ran' =>
S.map2 (mfe (bind (ctx, RelE (x, dom'))) e,
fn e' =>
(EAbs (x, dom', ran', e'), loc))))
| EUnop (s, e) =>
S.map2 (mfe ctx e,
fn e' =>
(EUnop (s, e'), loc))
| EBinop (s, e1, e2) =>
S.bind2 (mfe ctx e1,
fn e1' =>
S.map2 (mfe ctx e2,
fn e2' =>
(EBinop (s, e1', e2'), loc)))
| ERecord xes =>
S.map2 (ListUtil.mapfold (fn (x, e, t) =>
S.bind2 (mfe ctx e,
fn e' =>
S.map2 (mft t,
fn t' =>
(x, e', t'))))
xes,
fn xes' =>
(ERecord xes', loc))
| EField (e, x) =>
S.map2 (mfe ctx e,
fn e' =>
(EField (e', x), loc))
| ECase (e, pes, {disc, result}) =>
S.bind2 (mfe ctx e,
fn e' =>
S.bind2 (ListUtil.mapfold (fn (p, e) =>
let
fun pb ((p, _), ctx) =
case p of
PWild => ctx
| PVar (x, t) => bind (ctx, RelE (x, t))
| PPrim _ => ctx
| PCon (_, _, NONE) => ctx
| PCon (_, _, SOME p) => pb (p, ctx)
| PRecord xps => foldl (fn ((_, p, _), ctx) =>
pb (p, ctx)) ctx xps
| PNone _ => ctx
| PSome (_, p) => pb (p, ctx)
in
S.map2 (mfe (pb (p, ctx)) e,
fn e' => (p, e'))
end) pes,
fn pes' =>
S.bind2 (mft disc,
fn disc' =>
S.map2 (mft result,
fn result' =>
(ECase (e', pes', {disc = disc', result = result'}), loc)))))
| EError (e, t) =>
S.bind2 (mfe ctx e,
fn e' =>
S.map2 (mft t,
fn t' =>
(EError (e', t'), loc)))
| EStrcat (e1, e2) =>
S.bind2 (mfe ctx e1,
fn e1' =>
S.map2 (mfe ctx e2,
fn e2' =>
(EStrcat (e1', e2'), loc)))
| EWrite e =>
S.map2 (mfe ctx e,
fn e' =>
(EWrite e', loc))
| ESeq (e1, e2) =>
S.bind2 (mfe ctx e1,
fn e1' =>
S.map2 (mfe ctx e2,
fn e2' =>
(ESeq (e1', e2'), loc)))
| ELet (x, t, e1, e2) =>
S.bind2 (mft t,
fn t' =>
S.bind2 (mfe ctx e1,
fn e1' =>
S.map2 (mfe (bind (ctx, RelE (x, t'))) e2,
fn e2' =>
(ELet (x, t', e1', e2'), loc))))
| EClosure (n, es) =>
S.map2 (ListUtil.mapfold (mfe ctx) es,
fn es' =>
(EClosure (n, es'), loc))
| EQuery {exps, tables, state, query, body, initial} =>
S.bind2 (ListUtil.mapfold (fn (x, t) =>
S.map2 (mft t,
fn t' => (x, t'))) exps,
fn exps' =>
S.bind2 (ListUtil.mapfold (fn (x, xts) =>
S.map2 (ListUtil.mapfold
(fn (x, t) =>
S.map2 (mft t,
fn t' => (x, t'))) xts,
fn xts' => (x, xts'))) tables,
fn tables' =>
S.bind2 (mft state,
fn state' =>
S.bind2 (mfe ctx query,
fn query' =>
S.bind2 (mfe (bind (bind (ctx, RelE ("r", dummyt)),
RelE ("acc", dummyt)))
body,
fn body' =>
S.map2 (mfe ctx initial,
fn initial' =>
(EQuery {exps = exps',
tables = tables',
state = state',
query = query',
body = body',
initial = initial'},
loc)))))))
| EDml e =>
S.map2 (mfe ctx e,
fn e' =>
(EDml e', loc))
| ENextval e =>
S.map2 (mfe ctx e,
fn e' =>
(ENextval e', loc))
| EUnurlify (e, t) =>
S.bind2 (mfe ctx e,
fn e' =>
S.map2 (mft t,
fn t' =>
(EUnurlify (e', t'), loc)))
in
mfe
end
fun mapfold {typ = fc, exp = fe} =
mapfoldB {typ = fc,
exp = fn () => fe,
bind = fn ((), _) => ()} ()
fun mapB {typ, exp, bind} ctx e =
case mapfoldB {typ = fn c => fn () => S.Continue (typ c, ()),
exp = fn ctx => fn e => fn () => S.Continue (exp ctx e, ()),
bind = bind} ctx e () of
S.Continue (e, ()) => e
| S.Return _ => raise Fail "MonoUtil.Exp.mapB: Impossible"
fun map {typ, exp} e =
case mapfold {typ = fn c => fn () => S.Continue (typ c, ()),
exp = fn e => fn () => S.Continue (exp e, ())} e () of
S.Return () => raise Fail "Mono_util.Exp.map"
| S.Continue (e, ()) => e
fun fold {typ, exp} s e =
case mapfold {typ = fn c => fn s => S.Continue (c, typ (c, s)),
exp = fn e => fn s => S.Continue (e, exp (e, s))} e s of
S.Continue (_, s) => s
| S.Return _ => raise Fail "MonoUtil.Exp.fold: Impossible"
fun exists {typ, exp} k =
case mapfold {typ = fn c => fn () =>
if typ c then
S.Return ()
else
S.Continue (c, ()),
exp = fn e => fn () =>
if exp e then
S.Return ()
else
S.Continue (e, ())} k () of
S.Return _ => true
| S.Continue _ => false
end
structure Decl = struct
datatype binder = datatype Exp.binder
fun mapfoldB {typ = fc, exp = fe, decl = fd, bind} =
let
val mft = Typ.mapfold fc
val mfe = Exp.mapfoldB {typ = fc, exp = fe, bind = bind}
fun mfd ctx d acc =
S.bindP (mfd' ctx d acc, fd ctx)
and mfd' ctx (dAll as (d, loc)) =
case d of
DDatatype (x, n, xncs) =>
S.map2 (ListUtil.mapfold (fn (x, n, c) =>
case c of
NONE => S.return2 (x, n, c)
| SOME c =>
S.map2 (mft c,
fn c' => (x, n, SOME c'))) xncs,
fn xncs' =>
(DDatatype (x, n, xncs'), loc))
| DVal vi =>
S.map2 (mfvi ctx vi,
fn vi' =>
(DVal vi', loc))
| DValRec vis =>
let
val ctx' = foldl (fn ((x, n, t, _, s), ctx') => bind (ctx', NamedE (x, n, t, NONE, s))) ctx vis
in
S.map2 (ListUtil.mapfold (mfvi ctx') vis,
fn vis' =>
(DValRec vis', loc))
end
| DExport (ek, s, n, ts) =>
S.map2 (ListUtil.mapfold mft ts,
fn ts' =>
(DExport (ek, s, n, ts'), loc))
| DTable _ => S.return2 dAll
| DSequence _ => S.return2 dAll
| DDatabase _ => S.return2 dAll
and mfvi ctx (x, n, t, e, s) =
S.bind2 (mft t,
fn t' =>
S.map2 (mfe ctx e,
fn e' =>
(x, n, t', e', s)))
in
mfd
end
fun mapfold {typ = fc, exp = fe, decl = fd} =
mapfoldB {typ = fc,
exp = fn () => fe,
decl = fn () => fd,
bind = fn ((), _) => ()} ()
fun fold {typ, exp, decl} s d =
case mapfold {typ = fn c => fn s => S.Continue (c, typ (c, s)),
exp = fn e => fn s => S.Continue (e, exp (e, s)),
decl = fn d => fn s => S.Continue (d, decl (d, s))} d s of
S.Continue (_, s) => s
| S.Return _ => raise Fail "MonoUtil.Decl.fold: Impossible"
end
structure File = struct
datatype binder = datatype Exp.binder
fun mapfoldB (all as {bind, ...}) =
let
val mfd = Decl.mapfoldB all
fun mff ctx ds =
case ds of
nil => S.return2 nil
| d :: ds' =>
S.bind2 (mfd ctx d,
fn d' =>
let
val ctx' =
case #1 d' of
DDatatype (x, n, xncs) =>
let
val ctx = bind (ctx, Datatype (x, n, xncs))
val t = (TDatatype (n, ref (ElabUtil.classifyDatatype xncs, xncs)), #2 d')
in
foldl (fn ((x, n, to), ctx) =>
let
val t = case to of
NONE => t
| SOME t' => (TFun (t', t), #2 d')
in
bind (ctx, NamedE (x, n, t, NONE, ""))
end)
ctx xncs
end
| DVal (x, n, t, e, s) => bind (ctx, NamedE (x, n, t, SOME e, s))
| DValRec vis => foldl (fn ((x, n, t, e, s), ctx) =>
bind (ctx, NamedE (x, n, t, NONE, s))) ctx vis
| DExport _ => ctx
| DTable _ => ctx
| DSequence _ => ctx
| DDatabase _ => ctx
in
S.map2 (mff ctx' ds',
fn ds' =>
d' :: ds')
end)
in
mff
end
fun mapfold {typ = fc, exp = fe, decl = fd} =
mapfoldB {typ = fc,
exp = fn () => fe,
decl = fn () => fd,
bind = fn ((), _) => ()} ()
fun mapB {typ, exp, decl, bind} ctx ds =
case mapfoldB {typ = fn c => fn () => S.Continue (typ c, ()),
exp = fn ctx => fn e => fn () => S.Continue (exp ctx e, ()),
decl = fn ctx => fn d => fn () => S.Continue (decl ctx d, ()),
bind = bind} ctx ds () of
S.Continue (ds, ()) => ds
| S.Return _ => raise Fail "MonoUtil.File.mapB: Impossible"
fun map {typ, exp, decl} e =
case mapfold {typ = fn c => fn () => S.Continue (typ c, ()),
exp = fn e => fn () => S.Continue (exp e, ()),
decl = fn d => fn () => S.Continue (decl d, ())} e () of
S.Return () => raise Fail "Mono_util.File.map"
| S.Continue (e, ()) => e
fun fold {typ, exp, decl} s d =
case mapfold {typ = fn c => fn s => S.Continue (c, typ (c, s)),
exp = fn e => fn s => S.Continue (e, exp (e, s)),
decl = fn d => fn s => S.Continue (d, decl (d, s))} d s of
S.Continue (_, s) => s
| S.Return _ => raise Fail "MonoUtil.File.fold: Impossible"
end
end
|
