Mercurial > urweb

annotate src/core_util.sml @ 1072:9001966ae1c8

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Weakening-type coercions for SQL values
author Adam Chlipala <adamc@hcoop.net>
date Sun, 13 Dec 2009 13:00:55 -0500
parents dfe34fad749d
children b2311dfb3158
rev   line source
adamc@16 1 (* Copyright (c) 2008, Adam Chlipala
adamc@16 2 * All rights reserved.
adamc@16 3 *
adamc@16 4 * Redistribution and use in source and binary forms, with or without
adamc@16 5 * modification, are permitted provided that the following conditions are met:
adamc@16 6 *
adamc@16 7 * - Redistributions of source code must retain the above copyright notice,
adamc@16 8 * this list of conditions and the following disclaimer.
adamc@16 9 * - Redistributions in binary form must reproduce the above copyright notice,
adamc@16 10 * this list of conditions and the following disclaimer in the documentation
adamc@16 11 * and/or other materials provided with the distribution.
adamc@16 12 * - The names of contributors may not be used to endorse or promote products
adamc@16 13 * derived from this software without specific prior written permission.
adamc@16 14 *
adamc@16 15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
adamc@16 16 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
adamc@16 17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
adamc@16 18 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
adamc@16 19 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
adamc@16 20 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
adamc@16 21 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
adamc@16 22 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
adamc@16 23 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
adamc@16 24 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
adamc@16 25 * POSSIBILITY OF SUCH DAMAGE.
adamc@16 26 *)
adamc@16 27
adamc@16 28 structure CoreUtil :> CORE_UTIL = struct
adamc@16 29
adamc@16 30 open Core
adamc@16 31
adamc@16 32 structure S = Search
adamc@16 33
adamc@16 34 structure Kind = struct
adamc@16 35
adamc@193 36 open Order
adamc@193 37
adamc@193 38 fun compare ((k1, _), (k2, _)) =
adamc@193 39 case (k1, k2) of
adamc@193 40 (KType, KType) => EQUAL
adamc@193 41 | (KType, _) => LESS
adamc@193 42 | (_, KType) => GREATER
adamc@193 43
adamc@193 44 | (KArrow (d1, r1), KArrow (d2, r2)) => join (compare (d1, d2), fn () => compare (r1, r2))
adamc@193 45 | (KArrow _, _) => LESS
adamc@193 46 | (_, KArrow _) => GREATER
adamc@193 47
adamc@193 48 | (KName, KName) => EQUAL
adamc@193 49 | (KName, _) => LESS
adamc@193 50 | (_, KName) => GREATER
adamc@193 51
adamc@193 52 | (KRecord k1, KRecord k2) => compare (k1, k2)
adamc@193 53 | (KRecord _, _) => LESS
adamc@193 54 | (_, KRecord _) => GREATER
adamc@193 55
adamc@193 56 | (KUnit, KUnit) => EQUAL
adamc@214 57 | (KUnit, _) => LESS
adamc@214 58 | (_, KUnit) => GREATER
adamc@214 59
adamc@214 60 | (KTuple ks1, KTuple ks2) => joinL compare (ks1, ks2)
adamc@626 61 | (KTuple _, _) => LESS
adamc@626 62 | (_, KTuple _) => GREATER
adamc@193 63
adamc@626 64 | (KRel n1, KRel n2) => Int.compare (n1, n2)
adamc@626 65 | (KRel _, _) => LESS
adamc@626 66 | (_, KRel _) => GREATER
adamc@626 67
adamc@626 68 | (KFun (_, k1), KFun (_, k2)) => compare (k1, k2)
adamc@626 69
adamc@626 70 fun mapfoldB {kind = f, bind} =
adamc@16 71 let
adamc@626 72 fun mfk ctx k acc =
adamc@626 73 S.bindP (mfk' ctx k acc, f ctx)
adamc@16 74
adamc@626 75 and mfk' ctx (kAll as (k, loc)) =
adamc@16 76 case k of
adamc@16 77 KType => S.return2 kAll
adamc@16 78
adamc@16 79 | KArrow (k1, k2) =>
adamc@626 80 S.bind2 (mfk ctx k1,
adamc@16 81 fn k1' =>
adamc@626 82 S.map2 (mfk ctx k2,
adamc@16 83 fn k2' =>
adamc@16 84 (KArrow (k1', k2'), loc)))
adamc@16 85
adamc@16 86 | KName => S.return2 kAll
adamc@16 87
adamc@16 88 | KRecord k =>
adamc@626 89 S.map2 (mfk ctx k,
adamc@16 90 fn k' =>
adamc@16 91 (KRecord k', loc))
adamc@87 92
adamc@87 93 | KUnit => S.return2 kAll
adamc@214 94
adamc@214 95 | KTuple ks =>
adamc@626 96 S.map2 (ListUtil.mapfold (mfk ctx) ks,
adamc@214 97 fn ks' =>
adamc@214 98 (KTuple ks', loc))
adamc@626 99
adamc@626 100 | KRel _ => S.return2 kAll
adamc@626 101 | KFun (x, k) =>
adamc@626 102 S.map2 (mfk (bind (ctx, x)) k,
adamc@626 103 fn k' =>
adamc@626 104 (KFun (x, k'), loc))
adamc@16 105 in
adamc@16 106 mfk
adamc@16 107 end
adamc@16 108
adamc@626 109 fun mapfold fk =
adamc@626 110 mapfoldB {kind = fn () => fk,
adamc@626 111 bind = fn ((), _) => ()} ()
adamc@626 112
adamc@16 113 fun map f k =
adamc@16 114 case mapfold (fn k => fn () => S.Continue (f k, ())) k () of
adamc@626 115 S.Return () => raise Fail "CoreUtil.Kind.map"
adamc@16 116 | S.Continue (k, ()) => k
adamc@16 117
adamc@626 118 fun mapB {kind, bind} ctx k =
adamc@626 119 case mapfoldB {kind = fn ctx => fn k => fn () => S.Continue (kind ctx k, ()),
adamc@626 120 bind = bind} ctx k () of
adamc@626 121 S.Continue (k, ()) => k
adamc@626 122 | S.Return _ => raise Fail "CoreUtil.Kind.mapB: Impossible"
adamc@626 123
adamc@16 124 fun exists f k =
adamc@16 125 case mapfold (fn k => fn () =>
adamc@16 126 if f k then
adamc@16 127 S.Return ()
adamc@16 128 else
adamc@16 129 S.Continue (k, ())) k () of
adamc@16 130 S.Return _ => true
adamc@16 131 | S.Continue _ => false
adamc@16 132
adamc@16 133 end
adamc@16 134
adamc@16 135 structure Con = struct
adamc@16 136
adamc@193 137 open Order
adamc@193 138
adamc@193 139 fun compare ((c1, _), (c2, _)) =
adamc@193 140 case (c1, c2) of
adamc@193 141 (TFun (d1, r1), TFun (d2, r2)) => join (compare (d1, d2), fn () => compare (r1, r2))
adamc@193 142 | (TFun _, _) => LESS
adamc@193 143 | (_, TFun _) => GREATER
adamc@193 144
adamc@193 145 | (TCFun (x1, k1, r1), TCFun (x2, k2, r2)) =>
adamc@193 146 join (String.compare (x1, x2),
adamc@193 147 fn () => join (Kind.compare (k1, k2),
adamc@193 148 fn () => compare (r1, r2)))
adamc@193 149 | (TCFun _, _) => LESS
adamc@193 150 | (_, TCFun _) => GREATER
adamc@193 151
adamc@193 152 | (TRecord c1, TRecord c2) => compare (c1, c2)
adamc@193 153 | (TRecord _, _) => LESS
adamc@193 154 | (_, TRecord _) => GREATER
adamc@193 155
adamc@193 156 | (CRel n1, CRel n2) => Int.compare (n1, n2)
adamc@193 157 | (CRel _, _) => LESS
adamc@193 158 | (_, CRel _) => GREATER
adamc@193 159
adamc@193 160 | (CNamed n1, CNamed n2) => Int.compare (n1, n2)
adamc@193 161 | (CNamed _, _) => LESS
adamc@193 162 | (_, CNamed _) => GREATER
adamc@193 163
adamc@193 164 | (CFfi (m1, s1), CFfi (m2, s2)) => join (String.compare (m1, m2),
adamc@193 165 fn () => String.compare (s1, s2))
adamc@193 166 | (CFfi _, _) => LESS
adamc@193 167 | (_, CFfi _) => GREATER
adamc@193 168
adamc@193 169 | (CApp (f1, x1), CApp (f2, x2)) => join (compare (f1, f2),
adamc@193 170 fn () => compare (x1, x2))
adamc@193 171 | (CApp _, _) => LESS
adamc@193 172 | (_, CApp _) => GREATER
adamc@193 173
adamc@193 174 | (CAbs (x1, k1, b1), CAbs (x2, k2, b2)) =>
adamc@193 175 join (String.compare (x1, x2),
adamc@193 176 fn () => join (Kind.compare (k1, k2),
adamc@193 177 fn () => compare (b1, b2)))
adamc@193 178 | (CAbs _, _) => LESS
adamc@193 179 | (_, CAbs _) => GREATER
adamc@193 180
adamc@193 181 | (CName s1, CName s2) => String.compare (s1, s2)
adamc@193 182 | (CName _, _) => LESS
adamc@193 183 | (_, CName _) => GREATER
adamc@193 184
adamc@193 185 | (CRecord (k1, xvs1), CRecord (k2, xvs2)) =>
adamc@193 186 join (Kind.compare (k1, k2),
adamc@250 187 fn () =>
adamc@250 188 let
adamc@250 189 val sort = ListMergeSort.sort (fn ((x1, _), (x2, _)) =>
adamc@250 190 compare (x1, x2) = GREATER)
adamc@250 191 in
adamc@250 192 joinL (fn ((x1, v1), (x2, v2)) =>
adamc@250 193 join (compare (x1, x2),
adamc@250 194 fn () => compare (v1, v2))) (sort xvs1, sort xvs2)
adamc@250 195 end)
adamc@193 196 | (CRecord _, _) => LESS
adamc@193 197 | (_, CRecord _) => GREATER
adamc@193 198
adamc@193 199 | (CConcat (f1, s1), CConcat (f2, s2)) =>
adamc@193 200 join (compare (f1, f2),
adamc@193 201 fn () => compare (s1, s2))
adamc@193 202 | (CConcat _, _) => LESS
adamc@193 203 | (_, CConcat _) => GREATER
adamc@193 204
adamc@621 205 | (CMap (d1, r1), CMap (d2, r2)) =>
adamc@193 206 join (Kind.compare (d1, r2),
adamc@193 207 fn () => Kind.compare (r1, r2))
adamc@621 208 | (CMap _, _) => LESS
adamc@621 209 | (_, CMap _) => GREATER
adamc@193 210
adamc@193 211 | (CUnit, CUnit) => EQUAL
adamc@214 212 | (CUnit, _) => LESS
adamc@214 213 | (_, CUnit) => GREATER
adamc@214 214
adamc@214 215 | (CTuple cs1, CTuple cs2) => joinL compare (cs1, cs2)
adamc@214 216 | (CTuple _, _) => LESS
adamc@214 217 | (_, CTuple _) => GREATER
adamc@214 218
adamc@214 219 | (CProj (c1, n1), CProj (c2, n2)) => join (Int.compare (n1, n2),
adamc@214 220 fn () => compare (c1, c2))
adamc@626 221 | (CProj _, _) => LESS
adamc@626 222 | (_, CProj _) => GREATER
adamc@626 223
adamc@626 224 | (CKAbs (_, c1), CKAbs (_, c2)) => compare (c1, c2)
adamc@626 225 | (CKAbs _, _) => LESS
adamc@626 226 | (_, CKAbs _) => GREATER
adamc@626 227
adamc@626 228 | (CKApp (c1, k1), CKApp (c2, k2)) =>
adamc@626 229 join (compare (c1, c2),
adamc@626 230 fn () => Kind.compare (k1, k2))
adamc@626 231 | (CKApp _, _) => LESS
adamc@626 232 | (_, CKApp _) => GREATER
adamc@626 233
adamc@626 234 | (TKFun (_, c1), TKFun (_, c2)) => compare (c1, c2)
adamc@193 235
adamc@16 236 datatype binder =
adamc@626 237 RelK of string
adamc@626 238 | RelC of string * kind
adamc@626 239 | NamedC of string * int * kind * con option
adamc@16 240
adamc@16 241 fun mapfoldB {kind = fk, con = fc, bind} =
adamc@16 242 let
adamc@626 243 val mfk = Kind.mapfoldB {kind = fk, bind = fn (ctx, x) => bind (ctx, RelK x)}
adamc@16 244
adamc@16 245 fun mfc ctx c acc =
adamc@16 246 S.bindP (mfc' ctx c acc, fc ctx)
adamc@16 247
adamc@16 248 and mfc' ctx (cAll as (c, loc)) =
adamc@16 249 case c of
adamc@16 250 TFun (c1, c2) =>
adamc@16 251 S.bind2 (mfc ctx c1,
adamc@16 252 fn c1' =>
adamc@16 253 S.map2 (mfc ctx c2,
adamc@16 254 fn c2' =>
adamc@16 255 (TFun (c1', c2'), loc)))
adamc@16 256 | TCFun (x, k, c) =>
adamc@626 257 S.bind2 (mfk ctx k,
adamc@16 258 fn k' =>
adamc@626 259 S.map2 (mfc (bind (ctx, RelC (x, k))) c,
adamc@16 260 fn c' =>
adamc@16 261 (TCFun (x, k', c'), loc)))
adamc@16 262 | TRecord c =>
adamc@16 263 S.map2 (mfc ctx c,
adamc@16 264 fn c' =>
adamc@16 265 (TRecord c', loc))
adamc@16 266
adamc@16 267 | CRel _ => S.return2 cAll
adamc@16 268 | CNamed _ => S.return2 cAll
adamc@48 269 | CFfi _ => S.return2 cAll
adamc@16 270 | CApp (c1, c2) =>
adamc@16 271 S.bind2 (mfc ctx c1,
adamc@16 272 fn c1' =>
adamc@16 273 S.map2 (mfc ctx c2,
adamc@16 274 fn c2' =>
adamc@16 275 (CApp (c1', c2'), loc)))
adamc@16 276 | CAbs (x, k, c) =>
adamc@626 277 S.bind2 (mfk ctx k,
adamc@16 278 fn k' =>
adamc@626 279 S.map2 (mfc (bind (ctx, RelC (x, k))) c,
adamc@16 280 fn c' =>
adamc@16 281 (CAbs (x, k', c'), loc)))
adamc@16 282
adamc@16 283 | CName _ => S.return2 cAll
adamc@16 284
adamc@16 285 | CRecord (k, xcs) =>
adamc@626 286 S.bind2 (mfk ctx k,
adamc@16 287 fn k' =>
adamc@16 288 S.map2 (ListUtil.mapfold (fn (x, c) =>
adamc@16 289 S.bind2 (mfc ctx x,
adamc@16 290 fn x' =>
adamc@16 291 S.map2 (mfc ctx c,
adamc@16 292 fn c' =>
adamc@16 293 (x', c'))))
adamc@16 294 xcs,
adamc@16 295 fn xcs' =>
adamc@16 296 (CRecord (k', xcs'), loc)))
adamc@16 297 | CConcat (c1, c2) =>
adamc@16 298 S.bind2 (mfc ctx c1,
adamc@16 299 fn c1' =>
adamc@16 300 S.map2 (mfc ctx c2,
adamc@16 301 fn c2' =>
adamc@16 302 (CConcat (c1', c2'), loc)))
adamc@621 303 | CMap (k1, k2) =>
adamc@626 304 S.bind2 (mfk ctx k1,
adamc@69 305 fn k1' =>
adamc@626 306 S.map2 (mfk ctx k2,
adamc@69 307 fn k2' =>
adamc@621 308 (CMap (k1', k2'), loc)))
adamc@87 309
adamc@87 310 | CUnit => S.return2 cAll
adamc@214 311
adamc@214 312 | CTuple cs =>
adamc@214 313 S.map2 (ListUtil.mapfold (mfc ctx) cs,
adamc@214 314 fn cs' =>
adamc@214 315 (CTuple cs', loc))
adamc@214 316
adamc@214 317 | CProj (c, n) =>
adamc@214 318 S.map2 (mfc ctx c,
adamc@214 319 fn c' =>
adamc@214 320 (CProj (c', n), loc))
adamc@626 321
adamc@626 322 | CKAbs (x, c) =>
adamc@626 323 S.map2 (mfc (bind (ctx, RelK x)) c,
adamc@626 324 fn c' =>
adamc@626 325 (CKAbs (x, c'), loc))
adamc@626 326 | CKApp (c, k) =>
adamc@626 327 S.bind2 (mfc ctx c,
adamc@626 328 fn c' =>
adamc@626 329 S.map2 (mfk ctx k,
adamc@626 330 fn k' =>
adamc@626 331 (CKApp (c', k'), loc)))
adamc@626 332 | TKFun (x, c) =>
adamc@626 333 S.map2 (mfc (bind (ctx, RelK x)) c,
adamc@626 334 fn c' =>
adamc@626 335 (TKFun (x, c'), loc))
adamc@16 336 in
adamc@16 337 mfc
adamc@16 338 end
adamc@16 339
adamc@16 340 fun mapfold {kind = fk, con = fc} =
adamc@626 341 mapfoldB {kind = fn () => fk,
adamc@16 342 con = fn () => fc,
adamc@16 343 bind = fn ((), _) => ()} ()
adamc@16 344
adamc@16 345 fun map {kind, con} c =
adamc@16 346 case mapfold {kind = fn k => fn () => S.Continue (kind k, ()),
adamc@16 347 con = fn c => fn () => S.Continue (con c, ())} c () of
adamc@16 348 S.Return () => raise Fail "Core_util.Con.map"
adamc@16 349 | S.Continue (c, ()) => c
adamc@16 350
adamc@16 351 fun mapB {kind, con, bind} ctx c =
adamc@626 352 case mapfoldB {kind = fn ctx => fn k => fn () => S.Continue (kind ctx k, ()),
adamc@16 353 con = fn ctx => fn c => fn () => S.Continue (con ctx c, ()),
adamc@16 354 bind = bind} ctx c () of
adamc@16 355 S.Continue (c, ()) => c
adamc@20 356 | S.Return _ => raise Fail "CoreUtil.Con.mapB: Impossible"
adamc@16 357
adamc@23 358 fun fold {kind, con} s c =
adamc@23 359 case mapfold {kind = fn k => fn s => S.Continue (k, kind (k, s)),
adamc@23 360 con = fn c => fn s => S.Continue (c, con (c, s))} c s of
adamc@23 361 S.Continue (_, s) => s
adamc@23 362 | S.Return _ => raise Fail "CoreUtil.Con.fold: Impossible"
adamc@23 363
adamc@16 364 fun exists {kind, con} k =
adamc@16 365 case mapfold {kind = fn k => fn () =>
adamc@16 366 if kind k then
adamc@16 367 S.Return ()
adamc@16 368 else
adamc@16 369 S.Continue (k, ()),
adamc@16 370 con = fn c => fn () =>
adamc@16 371 if con c then
adamc@16 372 S.Return ()
adamc@16 373 else
adamc@16 374 S.Continue (c, ())} k () of
adamc@16 375 S.Return _ => true
adamc@16 376 | S.Continue _ => false
adamc@16 377
adamc@193 378 fun foldMap {kind, con} s c =
adamc@193 379 case mapfold {kind = fn k => fn s => S.Continue (kind (k, s)),
adamc@193 380 con = fn c => fn s => S.Continue (con (c, s))} c s of
adamc@193 381 S.Continue v => v
adamc@193 382 | S.Return _ => raise Fail "CoreUtil.Con.foldMap: Impossible"
adamc@193 383
adamc@16 384 end
adamc@16 385
adamc@16 386 structure Exp = struct
adamc@16 387
adamc@479 388 open Order
adamc@479 389
adamc@479 390 fun pcCompare (pc1, pc2) =
adamc@479 391 case (pc1, pc2) of
adamc@479 392 (PConVar n1, PConVar n2) => Int.compare (n1, n2)
adamc@479 393 | (PConVar _, _) => LESS
adamc@479 394 | (_, PConVar _) => GREATER
adamc@479 395
adamc@479 396 | (PConFfi {mod = m1, datatyp = d1, con = c1, ...},
adamc@479 397 PConFfi {mod = m2, datatyp = d2, con = c2, ...}) =>
adamc@479 398 join (String.compare (m1, m2),
adamc@479 399 fn () => join (String.compare (d1, d2),
adamc@479 400 fn () => String.compare (c1, c2)))
adamc@479 401
adamc@479 402 fun pCompare ((p1, _), (p2, _)) =
adamc@479 403 case (p1, p2) of
adamc@479 404 (PWild, PWild) => EQUAL
adamc@479 405 | (PWild, _) => LESS
adamc@479 406 | (_, PWild) => GREATER
adamc@479 407
adamc@479 408 | (PVar _, PVar _) => EQUAL
adamc@479 409 | (PVar _, _) => LESS
adamc@479 410 | (_, PVar _) => GREATER
adamc@479 411
adamc@479 412 | (PPrim p1, PPrim p2) => Prim.compare (p1, p2)
adamc@479 413 | (PPrim _, _) => LESS
adamc@479 414 | (_, PPrim _) => GREATER
adamc@479 415
adamc@479 416 | (PCon (_, pc1, _, po1), PCon (_, pc2, _, po2)) =>
adamc@479 417 join (pcCompare (pc1, pc2),
adamc@479 418 fn () => joinO pCompare (po1, po2))
adamc@479 419 | (PCon _, _) => LESS
adamc@479 420 | (_, PCon _) => GREATER
adamc@479 421
adamc@479 422 | (PRecord xps1, PRecord xps2) =>
adamc@479 423 joinL (fn ((x1, p1, _), (x2, p2, _)) =>
adamc@479 424 join (String.compare (x1, x2),
adamc@479 425 fn () => pCompare (p1, p2))) (xps1, xps2)
adamc@479 426
adamc@479 427 fun compare ((e1, _), (e2, _)) =
adamc@479 428 case (e1, e2) of
adamc@479 429 (EPrim p1, EPrim p2) => Prim.compare (p1, p2)
adamc@479 430 | (EPrim _, _) => LESS
adamc@479 431 | (_, EPrim _) => GREATER
adamc@479 432
adamc@479 433 | (ERel n1, ERel n2) => Int.compare (n1, n2)
adamc@479 434 | (ERel _, _) => LESS
adamc@479 435 | (_, ERel _) => GREATER
adamc@479 436
adamc@479 437 | (ENamed n1, ENamed n2) => Int.compare (n1, n2)
adamc@479 438 | (ENamed _, _) => LESS
adamc@479 439 | (_, ENamed _) => GREATER
adamc@479 440
adamc@479 441 | (ECon (_, pc1, _, eo1), ECon (_, pc2, _, eo2)) =>
adamc@479 442 join (pcCompare (pc1, pc2),
adamc@479 443 fn () => joinO compare (eo1, eo2))
adamc@479 444 | (ECon _, _) => LESS
adamc@479 445 | (_, ECon _) => GREATER
adamc@479 446
adamc@479 447 | (EFfi (f1, x1), EFfi (f2, x2)) =>
adamc@479 448 join (String.compare (f1, f2),
adamc@479 449 fn () => String.compare (x1, x2))
adamc@479 450 | (EFfi _, _) => LESS
adamc@479 451 | (_, EFfi _) => GREATER
adamc@479 452
adamc@479 453 | (EFfiApp (f1, x1, es1), EFfiApp (f2, x2, es2)) =>
adamc@479 454 join (String.compare (f1, f2),
adamc@479 455 fn () => join (String.compare (x1, x2),
adamc@479 456 fn () => joinL compare (es1, es2)))
adamc@479 457 | (EFfiApp _, _) => LESS
adamc@479 458 | (_, EFfiApp _) => GREATER
adamc@479 459
adamc@479 460 | (EApp (f1, x1), EApp (f2, x2)) =>
adamc@479 461 join (compare (f1, f2),
adamc@479 462 fn () => compare (x1, x2))
adamc@479 463 | (EApp _, _) => LESS
adamc@479 464 | (_, EApp _) => GREATER
adamc@479 465
adamc@479 466 | (EAbs (_, _, _, e1), EAbs (_, _, _, e2)) => compare (e1, e2)
adamc@479 467 | (EAbs _, _) => LESS
adamc@479 468 | (_, EAbs _) => GREATER
adamc@479 469
adamc@479 470 | (ECApp (f1, x1), ECApp (f2, x2)) =>
adamc@479 471 join (compare (f1, f2),
adamc@479 472 fn () => Con.compare (x1, x2))
adamc@479 473 | (ECApp _, _) => LESS
adamc@479 474 | (_, ECApp _) => GREATER
adamc@479 475
adamc@479 476 | (ECAbs (_, _, e1), ECAbs (_, _, e2)) => compare (e1, e2)
adamc@479 477 | (ECAbs _, _) => LESS
adamc@479 478 | (_, ECAbs _) => GREATER
adamc@479 479
adamc@479 480 | (ERecord xes1, ERecord xes2) =>
adamc@479 481 joinL (fn ((x1, e1, _), (x2, e2, _)) =>
adamc@479 482 join (Con.compare (x1, x2),
adamc@479 483 fn () => compare (e1, e2))) (xes1, xes2)
adamc@479 484 | (ERecord _, _) => LESS
adamc@479 485 | (_, ERecord _) => GREATER
adamc@479 486
adamc@479 487 | (EField (e1, c1, _), EField (e2, c2, _)) =>
adamc@479 488 join (compare (e1, e2),
adamc@479 489 fn () => Con.compare (c1, c2))
adamc@479 490 | (EField _, _) => LESS
adamc@479 491 | (_, EField _) => GREATER
adamc@479 492
adamc@479 493 | (EConcat (x1, _, y1, _), EConcat (x2, _, y2, _)) =>
adamc@479 494 join (compare (x1, x2),
adamc@479 495 fn () => compare (y1, y2))
adamc@479 496 | (EConcat _, _) => LESS
adamc@479 497 | (_, EConcat _) => GREATER
adamc@479 498
adamc@479 499 | (ECut (e1, c1, _), ECut (e2, c2, _)) =>
adamc@479 500 join (compare (e1, e2),
adamc@493 501 fn () => Con.compare (c1, c2))
adamc@479 502 | (ECut _, _) => LESS
adamc@479 503 | (_, ECut _) => GREATER
adamc@479 504
adamc@493 505 | (ECutMulti (e1, c1, _), ECutMulti (e2, c2, _)) =>
adamc@493 506 join (compare (e1, e2),
adamc@493 507 fn () => Con.compare (c1, c2))
adamc@493 508 | (ECutMulti _, _) => LESS
adamc@493 509 | (_, ECutMulti _) => GREATER
adamc@493 510
adamc@479 511 | (ECase (e1, pes1, _), ECase (e2, pes2, _)) =>
adamc@479 512 join (compare (e1, e2),
adamc@479 513 fn () => joinL (fn ((p1, e1), (p2, e2)) =>
adamc@479 514 join (pCompare (p1, p2),
adamc@479 515 fn () => compare (e1, e2))) (pes1, pes2))
adamc@479 516 | (ECase _, _) => LESS
adamc@479 517 | (_, ECase _) => GREATER
adamc@479 518
adamc@479 519 | (EWrite e1, EWrite e2) => compare (e1, e2)
adamc@479 520 | (EWrite _, _) => LESS
adamc@479 521 | (_, EWrite _) => GREATER
adamc@479 522
adamc@479 523 | (EClosure (n1, es1), EClosure (n2, es2)) =>
adamc@479 524 join (Int.compare (n1, n2),
adamc@479 525 fn () => joinL compare (es1, es2))
adamc@479 526 | (EClosure _, _) => LESS
adamc@479 527 | (_, EClosure _) => GREATER
adamc@479 528
adamc@479 529 | (ELet (_, _, x1, e1), ELet (_, _, x2, e2)) =>
adamc@479 530 join (compare (x1, x2),
adamc@479 531 fn () => compare (e1, e2))
adamc@607 532 | (ELet _, _) => LESS
adamc@607 533 | (_, ELet _) => GREATER
adamc@607 534
adamc@1020 535 | (EServerCall (n1, es1, _), EServerCall (n2, es2, _)) =>
adamc@607 536 join (Int.compare (n1, n2),
adamc@1020 537 fn () => joinL compare (es1, es2))
adamc@626 538 | (EServerCall _, _) => LESS
adamc@626 539 | (_, EServerCall _) => GREATER
adamc@626 540
adamc@626 541 | (EKAbs (_, e1), EKAbs (_, e2)) => compare (e1, e2)
adamc@626 542 | (EKAbs _, _) => LESS
adamc@626 543 | (_, EKAbs _) => GREATER
adamc@626 544
adamc@626 545 | (EKApp (e1, k1), EKApp (e2, k2)) =>
adamc@626 546 join (compare (e1, e2),
adamc@626 547 fn () => Kind.compare (k1, k2))
adamc@479 548
adamc@16 549 datatype binder =
adamc@626 550 RelK of string
adamc@626 551 | RelC of string * kind
adamc@20 552 | NamedC of string * int * kind * con option
adamc@16 553 | RelE of string * con
adamc@109 554 | NamedE of string * int * con * exp option * string
adamc@16 555
adamc@16 556 fun mapfoldB {kind = fk, con = fc, exp = fe, bind} =
adamc@16 557 let
adamc@626 558 val mfk = Kind.mapfoldB {kind = fk, bind = fn (ctx, x) => bind (ctx, RelK x)}
adamc@16 559
adamc@16 560 fun bind' (ctx, b) =
adamc@16 561 let
adamc@16 562 val b' = case b of
adamc@626 563 Con.RelK x => RelK x
adamc@626 564 | Con.RelC x => RelC x
adamc@626 565 | Con.NamedC x => NamedC x
adamc@16 566 in
adamc@16 567 bind (ctx, b')
adamc@16 568 end
adamc@16 569 val mfc = Con.mapfoldB {kind = fk, con = fc, bind = bind'}
adamc@16 570
adamc@16 571 fun mfe ctx e acc =
adamc@16 572 S.bindP (mfe' ctx e acc, fe ctx)
adamc@16 573
adamc@16 574 and mfe' ctx (eAll as (e, loc)) =
adamc@16 575 case e of
adamc@16 576 EPrim _ => S.return2 eAll
adamc@16 577 | ERel _ => S.return2 eAll
adamc@16 578 | ENamed _ => S.return2 eAll
adamc@192 579 | ECon (dk, pc, cs, NONE) =>
adamc@192 580 S.map2 (ListUtil.mapfold (mfc ctx) cs,
adamc@192 581 fn cs' =>
adamc@192 582 (ECon (dk, pc, cs', NONE), loc))
adamc@192 583 | ECon (dk, n, cs, SOME e) =>
adamc@192 584 S.bind2 (mfe ctx e,
adamc@192 585 fn e' =>
adamc@192 586 S.map2 (ListUtil.mapfold (mfc ctx) cs,
adamc@192 587 fn cs' =>
adamc@192 588 (ECon (dk, n, cs', SOME e'), loc)))
adamc@48 589 | EFfi _ => S.return2 eAll
adamc@48 590 | EFfiApp (m, x, es) =>
adamc@192 591 S.map2 (ListUtil.mapfold (mfe ctx) es,
adamc@48 592 fn es' =>
adamc@48 593 (EFfiApp (m, x, es'), loc))
adamc@16 594 | EApp (e1, e2) =>
adamc@16 595 S.bind2 (mfe ctx e1,
adamc@16 596 fn e1' =>
adamc@16 597 S.map2 (mfe ctx e2,
adamc@16 598 fn e2' =>
adamc@16 599 (EApp (e1', e2'), loc)))
adamc@26 600 | EAbs (x, dom, ran, e) =>
adamc@26 601 S.bind2 (mfc ctx dom,
adamc@26 602 fn dom' =>
adamc@26 603 S.bind2 (mfc ctx ran,
adamc@26 604 fn ran' =>
adamc@26 605 S.map2 (mfe (bind (ctx, RelE (x, dom'))) e,
adamc@26 606 fn e' =>
adamc@26 607 (EAbs (x, dom', ran', e'), loc))))
adamc@16 608
adamc@16 609 | ECApp (e, c) =>
adamc@16 610 S.bind2 (mfe ctx e,
adamc@16 611 fn e' =>
adamc@16 612 S.map2 (mfc ctx c,
adamc@16 613 fn c' =>
adamc@16 614 (ECApp (e', c'), loc)))
adamc@16 615 | ECAbs (x, k, e) =>
adamc@626 616 S.bind2 (mfk ctx k,
adamc@16 617 fn k' =>
adamc@16 618 S.map2 (mfe (bind (ctx, RelC (x, k))) e,
adamc@16 619 fn e' =>
adamc@16 620 (ECAbs (x, k', e'), loc)))
adamc@16 621
adamc@16 622 | ERecord xes =>
adamc@29 623 S.map2 (ListUtil.mapfold (fn (x, e, t) =>
adamc@16 624 S.bind2 (mfc ctx x,
adamc@16 625 fn x' =>
adamc@29 626 S.bind2 (mfe ctx e,
adamc@29 627 fn e' =>
adamc@29 628 S.map2 (mfc ctx t,
adamc@29 629 fn t' =>
adamc@29 630 (x', e', t')))))
adamc@16 631 xes,
adamc@16 632 fn xes' =>
adamc@16 633 (ERecord xes', loc))
adamc@16 634 | EField (e, c, {field, rest}) =>
adamc@16 635 S.bind2 (mfe ctx e,
adamc@16 636 fn e' =>
adamc@16 637 S.bind2 (mfc ctx c,
adamc@16 638 fn c' =>
adamc@16 639 S.bind2 (mfc ctx field,
adamc@16 640 fn field' =>
adamc@16 641 S.map2 (mfc ctx rest,
adamc@16 642 fn rest' =>
adamc@16 643 (EField (e', c', {field = field', rest = rest'}), loc)))))
adamc@445 644 | EConcat (e1, c1, e2, c2) =>
adamc@339 645 S.bind2 (mfe ctx e1,
adamc@339 646 fn e1' =>
adamc@445 647 S.bind2 (mfc ctx c1,
adamc@445 648 fn c1' =>
adamc@339 649 S.bind2 (mfe ctx e2,
adamc@339 650 fn e2' =>
adamc@445 651 S.map2 (mfc ctx c2,
adamc@445 652 fn c2' =>
adamc@445 653 (EConcat (e1', c1', e2', c2'),
adamc@445 654 loc)))))
adamc@149 655 | ECut (e, c, {field, rest}) =>
adamc@149 656 S.bind2 (mfe ctx e,
adamc@149 657 fn e' =>
adamc@149 658 S.bind2 (mfc ctx c,
adamc@149 659 fn c' =>
adamc@149 660 S.bind2 (mfc ctx field,
adamc@149 661 fn field' =>
adamc@149 662 S.map2 (mfc ctx rest,
adamc@149 663 fn rest' =>
adamc@149 664 (ECut (e', c', {field = field', rest = rest'}), loc)))))
adamc@493 665 | ECutMulti (e, c, {rest}) =>
adamc@493 666 S.bind2 (mfe ctx e,
adamc@493 667 fn e' =>
adamc@493 668 S.bind2 (mfc ctx c,
adamc@493 669 fn c' =>
adamc@493 670 S.map2 (mfc ctx rest,
adamc@493 671 fn rest' =>
adamc@493 672 (ECutMulti (e', c', {rest = rest'}), loc))))
adamc@102 673
adamc@182 674 | ECase (e, pes, {disc, result}) =>
adamc@177 675 S.bind2 (mfe ctx e,
adamc@177 676 fn e' =>
adamc@177 677 S.bind2 (ListUtil.mapfold (fn (p, e) =>
adamc@193 678 let
adamc@193 679 fun pb ((p, _), ctx) =
adamc@193 680 case p of
adamc@193 681 PWild => ctx
adamc@193 682 | PVar (x, t) => bind (ctx, RelE (x, t))
adamc@193 683 | PPrim _ => ctx
adamc@193 684 | PCon (_, _, _, NONE) => ctx
adamc@193 685 | PCon (_, _, _, SOME p) => pb (p, ctx)
adamc@193 686 | PRecord xps => foldl (fn ((_, p, _), ctx) =>
adamc@193 687 pb (p, ctx)) ctx xps
adamc@193 688 in
adamc@193 689 S.bind2 (mfp ctx p,
adamc@193 690 fn p' =>
adamc@193 691 S.map2 (mfe (pb (p', ctx)) e,
adamc@193 692 fn e' => (p', e')))
adamc@193 693 end) pes,
adamc@177 694 fn pes' =>
adamc@182 695 S.bind2 (mfc ctx disc,
adamc@182 696 fn disc' =>
adamc@182 697 S.map2 (mfc ctx result,
adamc@182 698 fn result' =>
adamc@182 699 (ECase (e', pes', {disc = disc', result = result'}), loc)))))
adamc@177 700
adamc@102 701 | EWrite e =>
adamc@102 702 S.map2 (mfe ctx e,
adamc@102 703 fn e' =>
adamc@102 704 (EWrite e', loc))
adamc@110 705
adamc@110 706 | EClosure (n, es) =>
adamc@110 707 S.map2 (ListUtil.mapfold (mfe ctx) es,
adamc@110 708 fn es' =>
adamc@110 709 (EClosure (n, es'), loc))
adamc@193 710
adamc@450 711 | ELet (x, t, e1, e2) =>
adamc@450 712 S.bind2 (mfc ctx t,
adamc@450 713 fn t' =>
adamc@450 714 S.bind2 (mfe ctx e1,
adamc@450 715 fn e1' =>
adamc@453 716 S.map2 (mfe (bind (ctx, RelE (x, t'))) e2,
adamc@450 717 fn e2' =>
adamc@450 718 (ELet (x, t', e1', e2'), loc))))
adamc@450 719
adamc@1020 720 | EServerCall (n, es, t) =>
adamc@607 721 S.bind2 (ListUtil.mapfold (mfe ctx) es,
adamc@607 722 fn es' =>
adamc@1020 723 S.map2 (mfc ctx t,
adamc@1020 724 fn t' =>
adamc@1020 725 (EServerCall (n, es', t'), loc)))
adamc@954 726
adamc@626 727 | EKAbs (x, e) =>
adamc@626 728 S.map2 (mfe (bind (ctx, RelK x)) e,
adamc@626 729 fn e' =>
adamc@626 730 (EKAbs (x, e'), loc))
adamc@626 731 | EKApp (e, k) =>
adamc@626 732 S.bind2 (mfe ctx e,
adamc@626 733 fn e' =>
adamc@626 734 S.map2 (mfk ctx k,
adamc@626 735 fn k' =>
adamc@626 736 (EKApp (e', k'), loc)))
adamc@607 737
adamc@193 738 and mfp ctx (pAll as (p, loc)) =
adamc@193 739 case p of
adamc@193 740 PWild => S.return2 pAll
adamc@193 741 | PVar (x, t) =>
adamc@193 742 S.map2 (mfc ctx t,
adamc@193 743 fn t' =>
adamc@193 744 (PVar (x, t'), loc))
adamc@193 745 | PPrim _ => S.return2 pAll
adamc@193 746 | PCon (dk, pc, args, po) =>
adamc@193 747 S.bind2 (mfpc ctx pc,
adamc@193 748 fn pc' =>
adamc@193 749 S.bind2 (ListUtil.mapfold (mfc ctx) args,
adamc@193 750 fn args' =>
adamc@193 751 S.map2 ((case po of
adamc@193 752 NONE => S.return2 NONE
adamc@193 753 | SOME p => S.map2 (mfp ctx p, SOME)),
adamc@193 754 fn po' =>
adamc@193 755 (PCon (dk, pc', args', po'), loc))))
adamc@193 756 | PRecord xps =>
adamc@193 757 S.map2 (ListUtil.mapfold (fn (x, p, c) =>
adamc@193 758 S.bind2 (mfp ctx p,
adamc@193 759 fn p' =>
adamc@193 760 S.map2 (mfc ctx c,
adamc@193 761 fn c' =>
adamc@193 762 (x, p', c')))) xps,
adamc@193 763 fn xps' =>
adamc@193 764 (PRecord xps', loc))
adamc@193 765
adamc@193 766 and mfpc ctx pc =
adamc@193 767 case pc of
adamc@193 768 PConVar _ => S.return2 pc
adamc@193 769 | PConFfi {mod = m, datatyp, params, con, arg, kind} =>
adamc@193 770 S.map2 ((case arg of
adamc@193 771 NONE => S.return2 NONE
adamc@796 772 | SOME c =>
adamc@796 773 let
adamc@796 774 val k = (KType, ErrorMsg.dummySpan)
adamc@796 775 val ctx' = foldl (fn (x, ctx) => bind (ctx, RelC (x, k))) ctx params
adamc@796 776 in
adamc@796 777 S.map2 (mfc ctx' c, SOME)
adamc@796 778 end),
adamc@193 779 fn arg' =>
adamc@193 780 PConFfi {mod = m, datatyp = datatyp, params = params,
adamc@193 781 con = con, arg = arg', kind = kind})
adamc@16 782 in
adamc@16 783 mfe
adamc@16 784 end
adamc@16 785
adamc@16 786 fun mapfold {kind = fk, con = fc, exp = fe} =
adamc@626 787 mapfoldB {kind = fn () => fk,
adamc@16 788 con = fn () => fc,
adamc@16 789 exp = fn () => fe,
adamc@16 790 bind = fn ((), _) => ()} ()
adamc@16 791
adamc@21 792 fun mapB {kind, con, exp, bind} ctx e =
adamc@626 793 case mapfoldB {kind = fn ctx => fn k => fn () => S.Continue (kind ctx k, ()),
adamc@21 794 con = fn ctx => fn c => fn () => S.Continue (con ctx c, ()),
adamc@21 795 exp = fn ctx => fn e => fn () => S.Continue (exp ctx e, ()),
adamc@21 796 bind = bind} ctx e () of
adamc@21 797 S.Continue (e, ()) => e
adamc@21 798 | S.Return _ => raise Fail "CoreUtil.Exp.mapB: Impossible"
adamc@21 799
adamc@16 800 fun map {kind, con, exp} e =
adamc@16 801 case mapfold {kind = fn k => fn () => S.Continue (kind k, ()),
adamc@16 802 con = fn c => fn () => S.Continue (con c, ()),
adamc@16 803 exp = fn e => fn () => S.Continue (exp e, ())} e () of
adamc@16 804 S.Return () => raise Fail "Core_util.Exp.map"
adamc@16 805 | S.Continue (e, ()) => e
adamc@16 806
adamc@23 807 fun fold {kind, con, exp} s e =
adamc@23 808 case mapfold {kind = fn k => fn s => S.Continue (k, kind (k, s)),
adamc@23 809 con = fn c => fn s => S.Continue (c, con (c, s)),
adamc@23 810 exp = fn e => fn s => S.Continue (e, exp (e, s))} e s of
adamc@23 811 S.Continue (_, s) => s
adamc@23 812 | S.Return _ => raise Fail "CoreUtil.Exp.fold: Impossible"
adamc@23 813
adamc@484 814 fun foldB {kind, con, exp, bind} ctx s e =
adamc@626 815 case mapfoldB {kind = fn ctx => fn k => fn s => S.Continue (k, kind (ctx, k, s)),
adamc@484 816 con = fn ctx => fn c => fn s => S.Continue (c, con (ctx, c, s)),
adamc@484 817 exp = fn ctx => fn e => fn s => S.Continue (e, exp (ctx, e, s)),
adamc@484 818 bind = bind} ctx e s of
adamc@484 819 S.Continue (_, s) => s
adamc@484 820 | S.Return _ => raise Fail "CoreUtil.Exp.foldB: Impossible"
adamc@484 821
adamc@16 822 fun exists {kind, con, exp} k =
adamc@16 823 case mapfold {kind = fn k => fn () =>
adamc@16 824 if kind k then
adamc@16 825 S.Return ()
adamc@16 826 else
adamc@16 827 S.Continue (k, ()),
adamc@16 828 con = fn c => fn () =>
adamc@16 829 if con c then
adamc@16 830 S.Return ()
adamc@16 831 else
adamc@16 832 S.Continue (c, ()),
adamc@16 833 exp = fn e => fn () =>
adamc@16 834 if exp e then
adamc@16 835 S.Return ()
adamc@16 836 else
adamc@16 837 S.Continue (e, ())} k () of
adamc@16 838 S.Return _ => true
adamc@16 839 | S.Continue _ => false
adamc@16 840
adamc@479 841 fun existsB {kind, con, exp, bind} ctx k =
adamc@626 842 case mapfoldB {kind = fn ctx => fn k => fn () =>
adamc@626 843 if kind (ctx, k) then
adamc@626 844 S.Return ()
adamc@626 845 else
adamc@626 846 S.Continue (k, ()),
adamc@479 847 con = fn ctx => fn c => fn () =>
adamc@479 848 if con (ctx, c) then
adamc@479 849 S.Return ()
adamc@479 850 else
adamc@479 851 S.Continue (c, ()),
adamc@479 852 exp = fn ctx => fn e => fn () =>
adamc@479 853 if exp (ctx, e) then
adamc@479 854 S.Return ()
adamc@479 855 else
adamc@479 856 S.Continue (e, ()),
adamc@479 857 bind = bind} ctx k () of
adamc@479 858 S.Return _ => true
adamc@479 859 | S.Continue _ => false
adamc@479 860
adamc@443 861 fun foldMap {kind, con, exp} s e =
adamc@443 862 case mapfold {kind = fn k => fn s => S.Continue (kind (k, s)),
adamc@443 863 con = fn c => fn s => S.Continue (con (c, s)),
adamc@443 864 exp = fn e => fn s => S.Continue (exp (e, s))} e s of
adamc@443 865 S.Continue v => v
adamc@443 866 | S.Return _ => raise Fail "CoreUtil.Exp.foldMap: Impossible"
adamc@443 867
adamc@488 868 fun foldMapB {kind, con, exp, bind} ctx s e =
adamc@626 869 case mapfoldB {kind = fn ctx => fn k => fn s => S.Continue (kind (ctx, k, s)),
adamc@488 870 con = fn ctx => fn c => fn s => S.Continue (con (ctx, c, s)),
adamc@488 871 exp = fn ctx => fn e => fn s => S.Continue (exp (ctx, e, s)),
adamc@488 872 bind = bind} ctx e s of
adamc@488 873 S.Continue v => v
adamc@488 874 | S.Return _ => raise Fail "CoreUtil.Exp.foldMapB: Impossible"
adamc@488 875
adamc@16 876 end
adamc@16 877
adamc@20 878 structure Decl = struct
adamc@20 879
adamc@20 880 datatype binder = datatype Exp.binder
adamc@20 881
adamc@20 882 fun mapfoldB {kind = fk, con = fc, exp = fe, decl = fd, bind} =
adamc@20 883 let
adamc@626 884 val mfk = Kind.mapfoldB {kind = fk, bind = fn (ctx, x) => bind (ctx, RelK x)}
adamc@20 885
adamc@20 886 fun bind' (ctx, b) =
adamc@20 887 let
adamc@20 888 val b' = case b of
adamc@626 889 Con.RelK x => RelK x
adamc@626 890 | Con.RelC x => RelC x
adamc@626 891 | Con.NamedC x => NamedC x
adamc@20 892 in
adamc@20 893 bind (ctx, b')
adamc@20 894 end
adamc@20 895 val mfc = Con.mapfoldB {kind = fk, con = fc, bind = bind'}
adamc@20 896
adamc@20 897 val mfe = Exp.mapfoldB {kind = fk, con = fc, exp = fe, bind = bind}
adamc@20 898
adamc@20 899 fun mfd ctx d acc =
adamc@20 900 S.bindP (mfd' ctx d acc, fd ctx)
adamc@20 901
adamc@20 902 and mfd' ctx (dAll as (d, loc)) =
adamc@20 903 case d of
adamc@20 904 DCon (x, n, k, c) =>
adamc@626 905 S.bind2 (mfk ctx k,
adamc@20 906 fn k' =>
adamc@20 907 S.map2 (mfc ctx c,
adamc@20 908 fn c' =>
adamc@20 909 (DCon (x, n, k', c'), loc)))
adamc@807 910 | DDatatype dts =>
adamc@807 911 S.map2 (ListUtil.mapfold (fn (x, n, xs, xncs) =>
adamc@807 912 let
adamc@807 913 val k = (KType, loc)
adamc@807 914 val k' = foldl (fn (_, k') => (KArrow (k, k'), loc)) k xs
adamc@807 915 val ctx' = bind (ctx, NamedC (x, n, k', NONE))
adamc@807 916 in
adamc@807 917 S.map2 (ListUtil.mapfold (fn (x, n, c) =>
adamc@807 918 case c of
adamc@807 919 NONE => S.return2 (x, n, c)
adamc@807 920 | SOME c =>
adamc@807 921 S.map2 (mfc ctx' c,
adamc@807 922 fn c' => (x, n, SOME c'))) xncs,
adamc@807 923 fn xncs' => (x, n, xs, xncs'))
adamc@807 924 end) dts,
adamc@807 925 fn dts' =>
adamc@807 926 (DDatatype dts', loc))
adamc@125 927 | DVal vi =>
adamc@125 928 S.map2 (mfvi ctx vi,
adamc@125 929 fn vi' =>
adamc@125 930 (DVal vi', loc))
adamc@125 931 | DValRec vis =>
adamc@127 932 let
adamc@127 933 val ctx = foldl (fn ((x, n, t, e, s), ctx) => bind (ctx, NamedE (x, n, t, NONE, s)))
adamc@127 934 ctx vis
adamc@127 935 in
adamc@127 936 S.map2 (ListUtil.mapfold (mfvi ctx) vis,
adamc@127 937 fn vis' =>
adamc@127 938 (DValRec vis', loc))
adamc@127 939 end
adamc@109 940 | DExport _ => S.return2 dAll
adamc@707 941 | DTable (x, n, c, s, pe, pc, ce, cc) =>
adamc@802 942 let
adamc@802 943 val loc = #2 ce
adamc@802 944 val ct = (CFfi ("Basis", "sql_table"), loc)
adamc@802 945 val ct = (CApp (ct, (CConcat (pc, cc), loc)), loc)
adamc@802 946 val ct = (CApp (ct, cc), loc)
adamc@802 947 val ctx' = bind (ctx, NamedE (x, n, ct, NONE, s))
adamc@802 948 in
adamc@802 949 S.bind2 (mfc ctx c,
adamc@802 950 fn c' =>
adamc@802 951 S.bind2 (mfe ctx' pe,
adamc@802 952 fn pe' =>
adamc@802 953 S.bind2 (mfc ctx pc,
adamc@802 954 fn pc' =>
adamc@802 955 S.bind2 (mfe ctx' ce,
adamc@802 956 fn ce' =>
adamc@802 957 S.map2 (mfc ctx cc,
adamc@802 958 fn cc' =>
adamc@802 959 (DTable (x, n, c', s, pe', pc', ce', cc'), loc))))))
adamc@802 960 end
adamc@338 961 | DSequence _ => S.return2 dAll
adamc@754 962 | DView (x, n, s, e, c) =>
adamc@754 963 S.bind2 (mfe ctx e,
adamc@754 964 fn e' =>
adamc@754 965 S.map2 (mfc ctx c,
adamc@754 966 fn c' =>
adamc@754 967 (DView (x, n, s, e', c'), loc)))
adamc@271 968 | DDatabase _ => S.return2 dAll
adamc@461 969 | DCookie (x, n, c, s) =>
adamc@461 970 S.map2 (mfc ctx c,
adamc@461 971 fn c' =>
adamc@461 972 (DCookie (x, n, c', s), loc))
adamc@720 973 | DStyle _ => S.return2 dAll
adamc@125 974
adamc@125 975 and mfvi ctx (x, n, t, e, s) =
adamc@125 976 S.bind2 (mfc ctx t,
adamc@125 977 fn t' =>
adamc@125 978 S.map2 (mfe ctx e,
adamc@125 979 fn e' =>
adamc@125 980 (x, n, t', e', s)))
adamc@20 981 in
adamc@20 982 mfd
adamc@20 983 end
adamc@20 984
adamc@23 985 fun mapfold {kind = fk, con = fc, exp = fe, decl = fd} =
adamc@626 986 mapfoldB {kind = fn () => fk,
adamc@23 987 con = fn () => fc,
adamc@23 988 exp = fn () => fe,
adamc@23 989 decl = fn () => fd,
adamc@23 990 bind = fn ((), _) => ()} ()
adamc@23 991
adamc@23 992 fun fold {kind, con, exp, decl} s d =
adamc@23 993 case mapfold {kind = fn k => fn s => S.Continue (k, kind (k, s)),
adamc@23 994 con = fn c => fn s => S.Continue (c, con (c, s)),
adamc@23 995 exp = fn e => fn s => S.Continue (e, exp (e, s)),
adamc@23 996 decl = fn d => fn s => S.Continue (d, decl (d, s))} d s of
adamc@23 997 S.Continue (_, s) => s
adamc@23 998 | S.Return _ => raise Fail "CoreUtil.Decl.fold: Impossible"
adamc@23 999
adamc@110 1000 fun foldMap {kind, con, exp, decl} s d =
adamc@110 1001 case mapfold {kind = fn k => fn s => S.Continue (kind (k, s)),
adamc@110 1002 con = fn c => fn s => S.Continue (con (c, s)),
adamc@110 1003 exp = fn e => fn s => S.Continue (exp (e, s)),
adamc@110 1004 decl = fn d => fn s => S.Continue (decl (d, s))} d s of
adamc@110 1005 S.Continue v => v
adamc@110 1006 | S.Return _ => raise Fail "CoreUtil.Decl.foldMap: Impossible"
adamc@110 1007
adamc@484 1008 fun foldMapB {kind, con, exp, decl, bind} ctx s d =
adamc@626 1009 case mapfoldB {kind = fn ctx => fn k => fn s => S.Continue (kind (ctx, k, s)),
adamc@484 1010 con = fn ctx => fn c => fn s => S.Continue (con (ctx, c, s)),
adamc@484 1011 exp = fn ctx => fn e => fn s => S.Continue (exp (ctx, e, s)),
adamc@484 1012 decl = fn ctx => fn d => fn s => S.Continue (decl (ctx, d, s)),
adamc@484 1013 bind = bind} ctx d s of
adamc@484 1014 S.Continue v => v
adamc@484 1015 | S.Return _ => raise Fail "CoreUtil.Decl.foldMapB: Impossible"
adamc@484 1016
adamc@522 1017 fun exists {kind, con, exp, decl} d =
adamc@522 1018 case mapfold {kind = fn k => fn () =>
adamc@522 1019 if kind k then
adamc@522 1020 S.Return ()
adamc@522 1021 else
adamc@522 1022 S.Continue (k, ()),
adamc@522 1023 con = fn c => fn () =>
adamc@522 1024 if con c then
adamc@522 1025 S.Return ()
adamc@522 1026 else
adamc@522 1027 S.Continue (c, ()),
adamc@522 1028 exp = fn e => fn () =>
adamc@522 1029 if exp e then
adamc@522 1030 S.Return ()
adamc@522 1031 else
adamc@522 1032 S.Continue (e, ()),
adamc@522 1033 decl = fn d => fn () =>
adamc@522 1034 if decl d then
adamc@522 1035 S.Return ()
adamc@522 1036 else
adamc@522 1037 S.Continue (d, ())} d () of
adamc@522 1038 S.Return _ => true
adamc@522 1039 | S.Continue _ => false
adamc@522 1040
adamc@16 1041 end
adamc@20 1042
adamc@20 1043 structure File = struct
adamc@20 1044
adamc@20 1045 datatype binder = datatype Exp.binder
adamc@20 1046
adamc@20 1047 fun mapfoldB (all as {bind, ...}) =
adamc@20 1048 let
adamc@20 1049 val mfd = Decl.mapfoldB all
adamc@20 1050
adamc@20 1051 fun mff ctx ds =
adamc@20 1052 case ds of
adamc@20 1053 nil => S.return2 nil
adamc@20 1054 | d :: ds' =>
adamc@20 1055 S.bind2 (mfd ctx d,
adamc@20 1056 fn d' =>
adamc@20 1057 let
adamc@100 1058 val ctx' =
adamc@20 1059 case #1 d' of
adamc@100 1060 DCon (x, n, k, c) => bind (ctx, NamedC (x, n, k, SOME c))
adamc@807 1061 | DDatatype dts =>
adamc@807 1062 foldl (fn ((x, n, xs, xncs), ctx) =>
adamc@807 1063 let
adamc@807 1064 val loc = #2 d'
adamc@807 1065 val k = (KType, loc)
adamc@807 1066 val k' = foldl (fn (_, k') => (KArrow (k, k'), loc)) k xs
adamc@192 1067
adamc@807 1068 val ctx = bind (ctx, NamedC (x, n, k', NONE))
adamc@807 1069 val t = (CNamed n, #2 d')
adamc@807 1070 val t = ListUtil.foldli (fn (i, _, t) =>
adamc@807 1071 (CApp (t, (CRel i, loc)), loc))
adamc@807 1072 t xs
adamc@807 1073 in
adamc@807 1074 foldl (fn ((x, n, to), ctx) =>
adamc@807 1075 let
adamc@807 1076 val t = case to of
adamc@807 1077 NONE => t
adamc@807 1078 | SOME t' => (TFun (t', t), #2 d')
adamc@807 1079 val t = foldr (fn (x, t) => (TCFun (x, k, t), loc))
adamc@807 1080 t xs
adamc@807 1081 in
adamc@807 1082 bind (ctx, NamedE (x, n, t, NONE, ""))
adamc@807 1083 end)
adamc@807 1084 ctx xncs
adamc@807 1085 end)
adamc@807 1086 ctx dts
adamc@109 1087 | DVal (x, n, t, e, s) => bind (ctx, NamedE (x, n, t, SOME e, s))
adamc@125 1088 | DValRec vis =>
adamc@127 1089 foldl (fn ((x, n, t, e, s), ctx) => bind (ctx, NamedE (x, n, t, NONE, s)))
adamc@125 1090 ctx vis
adamc@109 1091 | DExport _ => ctx
adamc@707 1092 | DTable (x, n, c, s, _, pc, _, cc) =>
adamc@247 1093 let
adamc@705 1094 val loc = #2 d'
adamc@705 1095 val ct = (CFfi ("Basis", "sql_table"), loc)
adamc@707 1096 val ct = (CApp (ct, (CConcat (pc, cc), loc)), loc)
adamc@705 1097 val ct = (CApp (ct, cc), loc)
adamc@338 1098 in
adamc@705 1099 bind (ctx, NamedE (x, n, ct, NONE, s))
adamc@338 1100 end
adamc@338 1101 | DSequence (x, n, s) =>
adamc@338 1102 let
adamc@338 1103 val t = (CFfi ("Basis", "sql_sequence"), #2 d')
adamc@247 1104 in
adamc@247 1105 bind (ctx, NamedE (x, n, t, NONE, s))
adamc@247 1106 end
adamc@754 1107 | DView (x, n, s, _, c) =>
adamc@754 1108 let
adamc@754 1109 val loc = #2 d'
adamc@754 1110 val ct = (CFfi ("Basis", "sql_view"), loc)
adamc@754 1111 val ct = (CApp (ct, c), loc)
adamc@754 1112 in
adamc@754 1113 bind (ctx, NamedE (x, n, ct, NONE, s))
adamc@754 1114 end
adamc@271 1115 | DDatabase _ => ctx
adamc@461 1116 | DCookie (x, n, c, s) =>
adamc@461 1117 let
adamc@461 1118 val t = (CApp ((CFfi ("Basis", "http_cookie"), #2 d'), c), #2 d')
adamc@461 1119 in
adamc@461 1120 bind (ctx, NamedE (x, n, t, NONE, s))
adamc@461 1121 end
adamc@720 1122 | DStyle (x, n, s) =>
adamc@718 1123 let
adamc@720 1124 val t = (CFfi ("Basis", "css_class"), #2 d')
adamc@718 1125 in
adamc@718 1126 bind (ctx, NamedE (x, n, t, NONE, s))
adamc@718 1127 end
adamc@20 1128 in
adamc@20 1129 S.map2 (mff ctx' ds',
adamc@20 1130 fn ds' =>
adamc@20 1131 d' :: ds')
adamc@20 1132 end)
adamc@20 1133 in
adamc@20 1134 mff
adamc@20 1135 end
adamc@20 1136
adamc@23 1137 fun mapfold {kind = fk, con = fc, exp = fe, decl = fd} =
adamc@626 1138 mapfoldB {kind = fn () => fk,
adamc@23 1139 con = fn () => fc,
adamc@23 1140 exp = fn () => fe,
adamc@23 1141 decl = fn () => fd,
adamc@23 1142 bind = fn ((), _) => ()} ()
adamc@23 1143
adamc@20 1144 fun mapB {kind, con, exp, decl, bind} ctx ds =
adamc@626 1145 case mapfoldB {kind = fn ctx => fn k => fn () => S.Continue (kind ctx k, ()),
adamc@20 1146 con = fn ctx => fn c => fn () => S.Continue (con ctx c, ()),
adamc@20 1147 exp = fn ctx => fn e => fn () => S.Continue (exp ctx e, ()),
adamc@20 1148 decl = fn ctx => fn d => fn () => S.Continue (decl ctx d, ()),
adamc@20 1149 bind = bind} ctx ds () of
adamc@20 1150 S.Continue (ds, ()) => ds
adamc@20 1151 | S.Return _ => raise Fail "CoreUtil.File.mapB: Impossible"
adamc@20 1152
adamc@482 1153 fun map {kind, con, exp, decl} ds =
adamc@626 1154 mapB {kind = fn () => kind,
adamc@482 1155 con = fn () => con,
adamc@482 1156 exp = fn () => exp,
adamc@482 1157 decl = fn () => decl,
adamc@482 1158 bind = fn _ => ()} () ds
adamc@482 1159
adamc@23 1160 fun fold {kind, con, exp, decl} s d =
adamc@23 1161 case mapfold {kind = fn k => fn s => S.Continue (k, kind (k, s)),
adamc@23 1162 con = fn c => fn s => S.Continue (c, con (c, s)),
adamc@23 1163 exp = fn e => fn s => S.Continue (e, exp (e, s)),
adamc@23 1164 decl = fn d => fn s => S.Continue (d, decl (d, s))} d s of
adamc@23 1165 S.Continue (_, s) => s
adamc@23 1166 | S.Return _ => raise Fail "CoreUtil.File.fold: Impossible"
adamc@23 1167
adamc@110 1168 fun foldMap {kind, con, exp, decl} s d =
adamc@110 1169 case mapfold {kind = fn k => fn s => S.Continue (kind (k, s)),
adamc@110 1170 con = fn c => fn s => S.Continue (con (c, s)),
adamc@110 1171 exp = fn e => fn s => S.Continue (exp (e, s)),
adamc@110 1172 decl = fn d => fn s => S.Continue (decl (d, s))} d s of
adamc@110 1173 S.Continue v => v
adamc@110 1174 | S.Return _ => raise Fail "CoreUtil.File.foldMap: Impossible"
adamc@110 1175
adamc@179 1176 val maxName = foldl (fn ((d, _) : decl, count) =>
adamc@179 1177 case d of
adamc@179 1178 DCon (_, n, _, _) => Int.max (n, count)
adamc@807 1179 | DDatatype dts => foldl (fn ((_, n, _, ns), count) =>
adamc@807 1180 foldl (fn ((_, n', _), m) => Int.max (n', m))
adamc@807 1181 (Int.max (n, count)) ns) count dts
adamc@179 1182 | DVal (_, n, _, _, _) => Int.max (n, count)
adamc@179 1183 | DValRec vis => foldl (fn ((_, n, _, _, _), count) => Int.max (n, count)) count vis
adamc@247 1184 | DExport _ => count
adamc@707 1185 | DTable (_, n, _, _, _, _, _, _) => Int.max (n, count)
adamc@338 1186 | DSequence (_, n, _) => Int.max (n, count)
adamc@754 1187 | DView (_, n, _, _, _) => Int.max (n, count)
adamc@461 1188 | DDatabase _ => count
adamc@718 1189 | DCookie (_, n, _, _) => Int.max (n, count)
adamc@720 1190 | DStyle (_, n, _) => Int.max (n, count)) 0
adamc@179 1191
adamc@20 1192 end
adamc@20 1193
adamc@20 1194 end