Mercurial > urweb

annotate src/elaborate.sml @ 827:497c7dbcc695

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Fix variable adjustment bug in fn/case alternation
author Adam Chlipala <adamc@hcoop.net>
date Thu, 28 May 2009 13:47:05 -0400
parents 7f871c03e3a1
children d07980bf1444
rev   line source
adamc@412 1 (* Copyright (c) 2008, Adam Chlipala
adamc@445 2 * All rights reserved.
adamc@445 3 *
adamc@445 4 * Redistribution and use in source and binary forms, with or without
adamc@445 5 * modification, are permitted provided that the following conditions are met:
adamc@445 6 *
adamc@445 7 * - Redistributions of source code must retain the above copyright notice,
adamc@445 8 * this list of conditions and the following disclaimer.
adamc@445 9 * - Redistributions in binary form must reproduce the above copyright notice,
adamc@445 10 * this list of conditions and the following disclaimer in the documentation
adamc@445 11 * and/or other materials provided with the distribution.
adamc@445 12 * - The names of contributors may not be used to endorse or promote products
adamc@445 13 * derived from this software without specific prior written permission.
adamc@445 14 *
adamc@445 15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
adamc@445 16 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
adamc@445 17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
adamc@445 18 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
adamc@445 19 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
adamc@445 20 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
adamc@445 21 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
adamc@445 22 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
adamc@445 23 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
adamc@445 24 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
adamc@445 25 * POSSIBILITY OF SUCH DAMAGE.
adamc@445 26 *)
adamc@403 27
adamc@403 28 structure Elaborate :> ELABORATE = struct
adamc@403 29
adamc@403 30 structure P = Prim
adamc@403 31 structure L = Source
adamc@403 32 structure L' = Elab
adamc@403 33 structure E = ElabEnv
adamc@403 34 structure U = ElabUtil
adamc@403 35 structure D = Disjoint
adamc@403 36
adamc@403 37 open Print
adamc@403 38 open ElabPrint
adamc@403 39 open ElabErr
adamc@403 40
adamc@819 41 structure IS = IntBinarySet
adamc@403 42 structure IM = IntBinaryMap
adamc@403 43
adamc@403 44 structure SK = struct
adamc@403 45 type ord_key = string
adamc@403 46 val compare = String.compare
adamc@403 47 end
adamc@403 48
adamc@403 49 structure SS = BinarySetFn(SK)
adamc@403 50 structure SM = BinaryMapFn(SK)
adamc@403 51
adamc@403 52 val basis_r = ref 0
adamc@633 53 val top_r = ref 0
adamc@403 54
adamc@403 55 fun elabExplicitness e =
adamc@403 56 case e of
adamc@403 57 L.Explicit => L'.Explicit
adamc@403 58 | L.Implicit => L'.Implicit
adamc@403 59
adamc@403 60 fun occursKind r =
adamc@403 61 U.Kind.exists (fn L'.KUnif (_, _, r') => r = r'
adamc@403 62 | _ => false)
adamc@403 63
adamc@403 64 exception KUnify' of kunify_error
adamc@403 65
adamc@623 66 fun unifyKinds' env (k1All as (k1, _)) (k2All as (k2, _)) =
adamc@403 67 let
adamc@403 68 fun err f = raise KUnify' (f (k1All, k2All))
adamc@403 69 in
adamc@403 70 case (k1, k2) of
adamc@403 71 (L'.KType, L'.KType) => ()
adamc@403 72 | (L'.KUnit, L'.KUnit) => ()
adamc@403 73
adamc@403 74 | (L'.KArrow (d1, r1), L'.KArrow (d2, r2)) =>
adamc@623 75 (unifyKinds' env d1 d2;
adamc@623 76 unifyKinds' env r1 r2)
adamc@403 77 | (L'.KName, L'.KName) => ()
adamc@623 78 | (L'.KRecord k1, L'.KRecord k2) => unifyKinds' env k1 k2
adamc@403 79 | (L'.KTuple ks1, L'.KTuple ks2) =>
adamc@623 80 ((ListPair.appEq (fn (k1, k2) => unifyKinds' env k1 k2) (ks1, ks2))
adamc@403 81 handle ListPair.UnequalLengths => err KIncompatible)
adamc@403 82
adamc@623 83 | (L'.KRel n1, L'.KRel n2) =>
adamc@623 84 if n1 = n2 then
adamc@623 85 ()
adamc@623 86 else
adamc@623 87 err KIncompatible
adamc@623 88 | (L'.KFun (x, k1), L'.KFun (_, k2)) =>
adamc@623 89 unifyKinds' (E.pushKRel env x) k1 k2
adamc@623 90
adamc@403 91 | (L'.KError, _) => ()
adamc@403 92 | (_, L'.KError) => ()
adamc@403 93
adamc@623 94 | (L'.KUnif (_, _, ref (SOME k1All)), _) => unifyKinds' env k1All k2All
adamc@623 95 | (_, L'.KUnif (_, _, ref (SOME k2All))) => unifyKinds' env k1All k2All
adamc@403 96
adamc@403 97 | (L'.KUnif (_, _, r1), L'.KUnif (_, _, r2)) =>
adamc@403 98 if r1 = r2 then
adamc@403 99 ()
adamc@403 100 else
adamc@403 101 r1 := SOME k2All
adamc@403 102
adamc@403 103 | (L'.KUnif (_, _, r), _) =>
adamc@403 104 if occursKind r k2All then
adamc@403 105 err KOccursCheckFailed
adamc@403 106 else
adamc@403 107 r := SOME k2All
adamc@403 108 | (_, L'.KUnif (_, _, r)) =>
adamc@403 109 if occursKind r k1All then
adamc@403 110 err KOccursCheckFailed
adamc@403 111 else
adamc@403 112 r := SOME k1All
adamc@403 113
adamc@403 114 | _ => err KIncompatible
adamc@403 115 end
adamc@403 116
adamc@403 117 exception KUnify of L'.kind * L'.kind * kunify_error
adamc@403 118
adamc@623 119 fun unifyKinds env k1 k2 =
adamc@623 120 unifyKinds' env k1 k2
adamc@403 121 handle KUnify' err => raise KUnify (k1, k2, err)
adamc@403 122
adamc@403 123 fun checkKind env c k1 k2 =
adamc@623 124 unifyKinds env k1 k2
adamc@403 125 handle KUnify (k1, k2, err) =>
adamc@403 126 conError env (WrongKind (c, k1, k2, err))
adamc@403 127
adamc@403 128 val dummy = ErrorMsg.dummySpan
adamc@403 129
adamc@403 130 val ktype = (L'.KType, dummy)
adamc@403 131 val kname = (L'.KName, dummy)
adamc@403 132 val ktype_record = (L'.KRecord ktype, dummy)
adamc@403 133
adamc@403 134 val cerror = (L'.CError, dummy)
adamc@403 135 val kerror = (L'.KError, dummy)
adamc@403 136 val eerror = (L'.EError, dummy)
adamc@403 137 val sgnerror = (L'.SgnError, dummy)
adamc@403 138 val strerror = (L'.StrError, dummy)
adamc@403 139
adamc@403 140 val int = ref cerror
adamc@403 141 val float = ref cerror
adamc@403 142 val string = ref cerror
adamc@821 143 val char = ref cerror
adamc@403 144 val table = ref cerror
adamc@403 145
adamc@403 146 local
adamc@403 147 val count = ref 0
adamc@403 148 in
adamc@403 149
adamc@403 150 fun resetKunif () = count := 0
adamc@403 151
adamc@403 152 fun kunif loc =
adamc@403 153 let
adamc@403 154 val n = !count
adamc@403 155 val s = if n <= 26 then
adamc@403 156 str (chr (ord #"A" + n))
adamc@403 157 else
adamc@403 158 "U" ^ Int.toString (n - 26)
adamc@403 159 in
adamc@403 160 count := n + 1;
adamc@403 161 (L'.KUnif (loc, s, ref NONE), dummy)
adamc@403 162 end
adamc@403 163
adamc@403 164 end
adamc@403 165
adamc@403 166 local
adamc@403 167 val count = ref 0
adamc@403 168 in
adamc@403 169
adamc@403 170 fun resetCunif () = count := 0
adamc@403 171
adamc@403 172 fun cunif (loc, k) =
adamc@403 173 let
adamc@403 174 val n = !count
adamc@712 175 val s = if n < 26 then
adamc@403 176 str (chr (ord #"A" + n))
adamc@403 177 else
adamc@403 178 "U" ^ Int.toString (n - 26)
adamc@403 179 in
adamc@403 180 count := n + 1;
adamc@403 181 (L'.CUnif (loc, k, s, ref NONE), dummy)
adamc@403 182 end
adamc@403 183
adamc@403 184 end
adamc@403 185
adamc@623 186 fun elabKind env (k, loc) =
adamc@403 187 case k of
adamc@403 188 L.KType => (L'.KType, loc)
adamc@623 189 | L.KArrow (k1, k2) => (L'.KArrow (elabKind env k1, elabKind env k2), loc)
adamc@403 190 | L.KName => (L'.KName, loc)
adamc@623 191 | L.KRecord k => (L'.KRecord (elabKind env k), loc)
adamc@403 192 | L.KUnit => (L'.KUnit, loc)
adamc@623 193 | L.KTuple ks => (L'.KTuple (map (elabKind env) ks), loc)
adamc@403 194 | L.KWild => kunif loc
adamc@403 195
adamc@623 196 | L.KVar s => (case E.lookupK env s of
adamc@623 197 NONE =>
adamc@623 198 (kindError env (UnboundKind (loc, s));
adamc@623 199 kerror)
adamc@623 200 | SOME n => (L'.KRel n, loc))
adamc@623 201 | L.KFun (x, k) => (L'.KFun (x, elabKind (E.pushKRel env x) k), loc)
adamc@623 202
adamc@621 203 fun mapKind (dom, ran, loc)=
adamc@621 204 (L'.KArrow ((L'.KArrow (dom, ran), loc),
adamc@621 205 (L'.KArrow ((L'.KRecord dom, loc),
adamc@621 206 (L'.KRecord ran, loc)), loc)), loc)
adamc@403 207
adamc@403 208 fun hnormKind (kAll as (k, _)) =
adamc@403 209 case k of
adamc@403 210 L'.KUnif (_, _, ref (SOME k)) => hnormKind k
adamc@403 211 | _ => kAll
adamc@403 212
adamc@623 213 open ElabOps
adamc@623 214
adamc@623 215 fun elabConHead (c as (_, loc)) k =
adamc@623 216 let
adamc@623 217 fun unravel (k, c) =
adamc@623 218 case hnormKind k of
adamc@623 219 (L'.KFun (x, k'), _) =>
adamc@623 220 let
adamc@623 221 val u = kunif loc
adamc@623 222
adamc@623 223 val k'' = subKindInKind (0, u) k'
adamc@623 224 in
adamc@623 225 unravel (k'', (L'.CKApp (c, u), loc))
adamc@623 226 end
adamc@623 227 | _ => (c, k)
adamc@623 228 in
adamc@623 229 unravel (k, c)
adamc@623 230 end
adamc@623 231
adamc@403 232 fun elabCon (env, denv) (c, loc) =
adamc@403 233 case c of
adamc@403 234 L.CAnnot (c, k) =>
adamc@403 235 let
adamc@623 236 val k' = elabKind env k
adamc@403 237 val (c', ck, gs) = elabCon (env, denv) c
adamc@403 238 in
adamc@403 239 checkKind env c' ck k';
adamc@403 240 (c', k', gs)
adamc@403 241 end
adamc@403 242
adamc@403 243 | L.TFun (t1, t2) =>
adamc@403 244 let
adamc@403 245 val (t1', k1, gs1) = elabCon (env, denv) t1
adamc@403 246 val (t2', k2, gs2) = elabCon (env, denv) t2
adamc@403 247 in
adamc@403 248 checkKind env t1' k1 ktype;
adamc@403 249 checkKind env t2' k2 ktype;
adamc@403 250 ((L'.TFun (t1', t2'), loc), ktype, gs1 @ gs2)
adamc@403 251 end
adamc@403 252 | L.TCFun (e, x, k, t) =>
adamc@403 253 let
adamc@403 254 val e' = elabExplicitness e
adamc@623 255 val k' = elabKind env k
adamc@403 256 val env' = E.pushCRel env x k'
adamc@403 257 val (t', tk, gs) = elabCon (env', D.enter denv) t
adamc@403 258 in
adamc@403 259 checkKind env t' tk ktype;
adamc@403 260 ((L'.TCFun (e', x, k', t'), loc), ktype, gs)
adamc@403 261 end
adamc@623 262 | L.TKFun (x, t) =>
adamc@623 263 let
adamc@623 264 val env' = E.pushKRel env x
adamc@623 265 val (t', tk, gs) = elabCon (env', denv) t
adamc@623 266 in
adamc@623 267 checkKind env t' tk ktype;
adamc@623 268 ((L'.TKFun (x, t'), loc), ktype, gs)
adamc@623 269 end
adamc@628 270 | L.TDisjoint (c1, c2, c) =>
adamc@403 271 let
adamc@403 272 val (c1', k1, gs1) = elabCon (env, denv) c1
adamc@403 273 val (c2', k2, gs2) = elabCon (env, denv) c2
adamc@403 274
adamc@403 275 val ku1 = kunif loc
adamc@403 276 val ku2 = kunif loc
adamc@403 277
adamc@628 278 val denv' = D.assert env denv (c1', c2')
adamc@403 279 val (c', k, gs4) = elabCon (env, denv') c
adamc@403 280 in
adamc@403 281 checkKind env c1' k1 (L'.KRecord ku1, loc);
adamc@403 282 checkKind env c2' k2 (L'.KRecord ku2, loc);
adamc@403 283
adamc@628 284 ((L'.TDisjoint (c1', c2', c'), loc), k, gs1 @ gs2 @ gs4)
adamc@403 285 end
adamc@403 286 | L.TRecord c =>
adamc@403 287 let
adamc@403 288 val (c', ck, gs) = elabCon (env, denv) c
adamc@403 289 val k = (L'.KRecord ktype, loc)
adamc@403 290 in
adamc@403 291 checkKind env c' ck k;
adamc@403 292 ((L'.TRecord c', loc), ktype, gs)
adamc@403 293 end
adamc@403 294
adamc@403 295 | L.CVar ([], s) =>
adamc@403 296 (case E.lookupC env s of
adamc@403 297 E.NotBound =>
adamc@403 298 (conError env (UnboundCon (loc, s));
adamc@403 299 (cerror, kerror, []))
adamc@403 300 | E.Rel (n, k) =>
adamc@623 301 let
adamc@623 302 val (c, k) = elabConHead (L'.CRel n, loc) k
adamc@623 303 in
adamc@623 304 (c, k, [])
adamc@623 305 end
adamc@403 306 | E.Named (n, k) =>
adamc@623 307 let
adamc@623 308 val (c, k) = elabConHead (L'.CNamed n, loc) k
adamc@623 309 in
adamc@623 310 (c, k, [])
adamc@623 311 end)
adamc@403 312 | L.CVar (m1 :: ms, s) =>
adamc@403 313 (case E.lookupStr env m1 of
adamc@403 314 NONE => (conError env (UnboundStrInCon (loc, m1));
adamc@403 315 (cerror, kerror, []))
adamc@403 316 | SOME (n, sgn) =>
adamc@403 317 let
adamc@403 318 val (str, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@403 319 case E.projectStr env {sgn = sgn, str = str, field = m} of
adamc@403 320 NONE => (conError env (UnboundStrInCon (loc, m));
adamc@403 321 (strerror, sgnerror))
adamc@403 322 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@403 323 ((L'.StrVar n, loc), sgn) ms
adamc@403 324
adamc@403 325 val k = case E.projectCon env {sgn = sgn, str = str, field = s} of
adamc@403 326 NONE => (conError env (UnboundCon (loc, s));
adamc@403 327 kerror)
adamc@403 328 | SOME (k, _) => k
adamc@403 329 in
adamc@403 330 ((L'.CModProj (n, ms, s), loc), k, [])
adamc@403 331 end)
adamc@403 332
adamc@403 333 | L.CApp (c1, c2) =>
adamc@403 334 let
adamc@403 335 val (c1', k1, gs1) = elabCon (env, denv) c1
adamc@403 336 val (c2', k2, gs2) = elabCon (env, denv) c2
adamc@403 337 val dom = kunif loc
adamc@403 338 val ran = kunif loc
adamc@403 339 in
adamc@403 340 checkKind env c1' k1 (L'.KArrow (dom, ran), loc);
adamc@403 341 checkKind env c2' k2 dom;
adamc@403 342 ((L'.CApp (c1', c2'), loc), ran, gs1 @ gs2)
adamc@403 343 end
adamc@403 344 | L.CAbs (x, ko, t) =>
adamc@403 345 let
adamc@403 346 val k' = case ko of
adamc@403 347 NONE => kunif loc
adamc@623 348 | SOME k => elabKind env k
adamc@403 349 val env' = E.pushCRel env x k'
adamc@403 350 val (t', tk, gs) = elabCon (env', D.enter denv) t
adamc@403 351 in
adamc@403 352 ((L'.CAbs (x, k', t'), loc),
adamc@403 353 (L'.KArrow (k', tk), loc),
adamc@403 354 gs)
adamc@403 355 end
adamc@623 356 | L.CKAbs (x, t) =>
adamc@623 357 let
adamc@623 358 val env' = E.pushKRel env x
adamc@623 359 val (t', tk, gs) = elabCon (env', denv) t
adamc@623 360 in
adamc@623 361 ((L'.CKAbs (x, t'), loc),
adamc@623 362 (L'.KFun (x, tk), loc),
adamc@623 363 gs)
adamc@623 364 end
adamc@403 365
adamc@403 366 | L.CName s =>
adamc@403 367 ((L'.CName s, loc), kname, [])
adamc@403 368
adamc@403 369 | L.CRecord xcs =>
adamc@403 370 let
adamc@403 371 val k = kunif loc
adamc@403 372
adamc@403 373 val (xcs', gs) = ListUtil.foldlMap (fn ((x, c), gs) =>
adamc@403 374 let
adamc@403 375 val (x', xk, gs1) = elabCon (env, denv) x
adamc@403 376 val (c', ck, gs2) = elabCon (env, denv) c
adamc@403 377 in
adamc@403 378 checkKind env x' xk kname;
adamc@403 379 checkKind env c' ck k;
adamc@403 380 ((x', c'), gs1 @ gs2 @ gs)
adamc@403 381 end) [] xcs
adamc@403 382
adamc@403 383 val rc = (L'.CRecord (k, xcs'), loc)
adamc@403 384 (* Add duplicate field checking later. *)
adamc@403 385
adamc@403 386 fun prove (xcs, ds) =
adamc@403 387 case xcs of
adamc@403 388 [] => ds
adamc@403 389 | xc :: rest =>
adamc@403 390 let
adamc@403 391 val r1 = (L'.CRecord (k, [xc]), loc)
adamc@403 392 val ds = foldl (fn (xc', ds) =>
adamc@403 393 let
adamc@403 394 val r2 = (L'.CRecord (k, [xc']), loc)
adamc@403 395 in
adamc@403 396 D.prove env denv (r1, r2, loc) @ ds
adamc@403 397 end)
adamc@403 398 ds rest
adamc@403 399 in
adamc@403 400 prove (rest, ds)
adamc@403 401 end
adamc@403 402 in
adamc@403 403 (rc, (L'.KRecord k, loc), prove (xcs', gs))
adamc@403 404 end
adamc@403 405 | L.CConcat (c1, c2) =>
adamc@403 406 let
adamc@403 407 val (c1', k1, gs1) = elabCon (env, denv) c1
adamc@403 408 val (c2', k2, gs2) = elabCon (env, denv) c2
adamc@403 409 val ku = kunif loc
adamc@403 410 val k = (L'.KRecord ku, loc)
adamc@403 411 in
adamc@403 412 checkKind env c1' k1 k;
adamc@403 413 checkKind env c2' k2 k;
adamc@403 414 ((L'.CConcat (c1', c2'), loc), k,
adamc@403 415 D.prove env denv (c1', c2', loc) @ gs1 @ gs2)
adamc@403 416 end
adamc@621 417 | L.CMap =>
adamc@403 418 let
adamc@403 419 val dom = kunif loc
adamc@403 420 val ran = kunif loc
adamc@403 421 in
adamc@621 422 ((L'.CMap (dom, ran), loc),
adamc@621 423 mapKind (dom, ran, loc),
adamc@403 424 [])
adamc@403 425 end
adamc@403 426
adamc@403 427 | L.CUnit => ((L'.CUnit, loc), (L'.KUnit, loc), [])
adamc@403 428
adamc@403 429 | L.CTuple cs =>
adamc@403 430 let
adamc@403 431 val (cs', ks, gs) = foldl (fn (c, (cs', ks, gs)) =>
adamc@403 432 let
adamc@403 433 val (c', k, gs') = elabCon (env, denv) c
adamc@403 434 in
adamc@403 435 (c' :: cs', k :: ks, gs' @ gs)
adamc@403 436 end) ([], [], []) cs
adamc@403 437 in
adamc@403 438 ((L'.CTuple (rev cs'), loc), (L'.KTuple (rev ks), loc), gs)
adamc@403 439 end
adamc@403 440 | L.CProj (c, n) =>
adamc@403 441 let
adamc@403 442 val (c', k, gs) = elabCon (env, denv) c
adamc@403 443 in
adamc@403 444 case hnormKind k of
adamc@403 445 (L'.KTuple ks, _) =>
adamc@403 446 if n <= 0 orelse n > length ks then
adamc@403 447 (conError env (ProjBounds (c', n));
adamc@83 448 (cerror, kerror, []))
adamc@403 449 else
adamc@403 450 ((L'.CProj (c', n), loc), List.nth (ks, n - 1), gs)
adamc@403 451 | k => (conError env (ProjMismatch (c', k));
adamc@403 452 (cerror, kerror, []))
adamc@403 453 end
adamc@403 454
adamc@403 455 | L.CWild k =>
adamc@403 456 let
adamc@623 457 val k' = elabKind env k
adamc@403 458 in
adamc@403 459 (cunif (loc, k'), k', [])
adamc@403 460 end
adamc@403 461
adamc@403 462 fun kunifsRemain k =
adamc@403 463 case k of
adamc@403 464 L'.KUnif (_, _, ref NONE) => true
adamc@403 465 | _ => false
adamc@403 466 fun cunifsRemain c =
adamc@403 467 case c of
adamc@710 468 L'.CUnif (loc, _, _, ref NONE) => SOME loc
adamc@403 469 | _ => NONE
adamc@403 470
adamc@403 471 val kunifsInDecl = U.Decl.exists {kind = kunifsRemain,
adamc@403 472 con = fn _ => false,
adamc@403 473 exp = fn _ => false,
adamc@403 474 sgn_item = fn _ => false,
adamc@403 475 sgn = fn _ => false,
adamc@403 476 str = fn _ => false,
adamc@403 477 decl = fn _ => false}
adamc@403 478
adamc@403 479 val cunifsInDecl = U.Decl.search {kind = fn _ => NONE,
adamc@403 480 con = cunifsRemain,
adamc@403 481 exp = fn _ => NONE,
adamc@403 482 sgn_item = fn _ => NONE,
adamc@403 483 sgn = fn _ => NONE,
adamc@403 484 str = fn _ => NONE,
adamc@403 485 decl = fn _ => NONE}
adamc@403 486
adamc@403 487 fun occursCon r =
adamc@403 488 U.Con.exists {kind = fn _ => false,
adamc@403 489 con = fn L'.CUnif (_, _, _, r') => r = r'
adamc@403 490 | _ => false}
adamc@403 491
adamc@403 492 exception CUnify' of cunify_error
adamc@403 493
adamc@403 494 exception SynUnif = E.SynUnif
adamc@403 495
adamc@403 496 type record_summary = {
adamc@403 497 fields : (L'.con * L'.con) list,
adamc@403 498 unifs : (L'.con * L'.con option ref) list,
adamc@403 499 others : L'.con list
adamc@403 500 }
adamc@403 501
adamc@403 502 fun summaryToCon {fields, unifs, others} =
adamc@403 503 let
adamc@403 504 val c = (L'.CRecord (ktype, []), dummy)
adamc@403 505 val c = List.foldr (fn (c', c) => (L'.CConcat (c', c), dummy)) c others
adamc@403 506 val c = List.foldr (fn ((c', _), c) => (L'.CConcat (c', c), dummy)) c unifs
adamc@403 507 in
adamc@403 508 (L'.CConcat ((L'.CRecord (ktype, fields), dummy), c), dummy)
adamc@403 509 end
adamc@403 510
adamc@403 511 fun p_summary env s = p_con env (summaryToCon s)
adamc@403 512
adamc@403 513 exception CUnify of L'.con * L'.con * cunify_error
adamc@403 514
adamc@403 515 fun kindof env (c, loc) =
adamc@403 516 case c of
adamc@403 517 L'.TFun _ => ktype
adamc@403 518 | L'.TCFun _ => ktype
adamc@403 519 | L'.TRecord _ => ktype
adamc@628 520 | L'.TDisjoint _ => ktype
adamc@403 521
adamc@403 522 | L'.CRel xn => #2 (E.lookupCRel env xn)
adamc@403 523 | L'.CNamed xn => #2 (E.lookupCNamed env xn)
adamc@403 524 | L'.CModProj (n, ms, x) =>
adamc@403 525 let
adamc@403 526 val (_, sgn) = E.lookupStrNamed env n
adamc@403 527 val (str, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@403 528 case E.projectStr env {sgn = sgn, str = str, field = m} of
adamc@403 529 NONE => raise Fail "kindof: Unknown substructure"
adamc@403 530 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@403 531 ((L'.StrVar n, loc), sgn) ms
adamc@403 532 in
adamc@403 533 case E.projectCon env {sgn = sgn, str = str, field = x} of
adamc@403 534 NONE => raise Fail "kindof: Unknown con in structure"
adamc@403 535 | SOME (k, _) => k
adamc@403 536 end
adamc@403 537
adamc@403 538 | L'.CApp (c, _) =>
adamc@403 539 (case hnormKind (kindof env c) of
adamc@403 540 (L'.KArrow (_, k), _) => k
adamc@403 541 | (L'.KError, _) => kerror
adamc@413 542 | k => raise CUnify' (CKindof (k, c, "arrow")))
adamc@403 543 | L'.CAbs (x, k, c) => (L'.KArrow (k, kindof (E.pushCRel env x k) c), loc)
adamc@628 544
adamc@403 545
adamc@403 546 | L'.CName _ => kname
adamc@403 547
adamc@403 548 | L'.CRecord (k, _) => (L'.KRecord k, loc)
adamc@403 549 | L'.CConcat (c, _) => kindof env c
adamc@621 550 | L'.CMap (dom, ran) => mapKind (dom, ran, loc)
adamc@403 551
adamc@403 552 | L'.CUnit => (L'.KUnit, loc)
adamc@403 553
adamc@403 554 | L'.CTuple cs => (L'.KTuple (map (kindof env) cs), loc)
adamc@403 555 | L'.CProj (c, n) =>
adamc@403 556 (case hnormKind (kindof env c) of
adamc@403 557 (L'.KTuple ks, _) => List.nth (ks, n - 1)
adamc@413 558 | k => raise CUnify' (CKindof (k, c, "tuple")))
adamc@403 559
adamc@403 560 | L'.CError => kerror
adamc@403 561 | L'.CUnif (_, k, _, _) => k
adamc@403 562
adamc@623 563 | L'.CKAbs (x, c) => (L'.KFun (x, kindof (E.pushKRel env x) c), loc)
adamc@623 564 | L'.CKApp (c, k) =>
adamc@623 565 (case hnormKind (kindof env c) of
adamc@623 566 (L'.KFun (_, k'), _) => subKindInKind (0, k) k'
adamc@623 567 | k => raise CUnify' (CKindof (k, c, "kapp")))
adamc@623 568 | L'.TKFun _ => ktype
adamc@403 569
adamc@621 570 exception GuessFailure
adamc@403 571
adamc@513 572 fun isUnitCon env (c, loc) =
adamc@513 573 case c of
adamc@513 574 L'.TFun _ => false
adamc@513 575 | L'.TCFun _ => false
adamc@513 576 | L'.TRecord _ => false
adamc@628 577 | L'.TDisjoint _ => false
adamc@513 578
adamc@513 579 | L'.CRel xn => #1 (#2 (E.lookupCRel env xn)) = L'.KUnit
adamc@513 580 | L'.CNamed xn => #1 (#2 (E.lookupCNamed env xn)) = L'.KUnit
adamc@518 581 | L'.CModProj (n, ms, x) => false
adamc@518 582 (*let
adamc@513 583 val (_, sgn) = E.lookupStrNamed env n
adamc@513 584 val (str, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@513 585 case E.projectStr env {sgn = sgn, str = str, field = m} of
adamc@513 586 NONE => raise Fail "kindof: Unknown substructure"
adamc@513 587 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@513 588 ((L'.StrVar n, loc), sgn) ms
adamc@513 589 in
adamc@513 590 case E.projectCon env {sgn = sgn, str = str, field = x} of
adamc@513 591 NONE => raise Fail "kindof: Unknown con in structure"
adamc@513 592 | SOME ((k, _), _) => k = L'.KUnit
adamc@518 593 end*)
adamc@518 594
adamc@518 595 | L'.CApp (c, _) => false
adamc@518 596 (*(case hnormKind (kindof env c) of
adamc@513 597 (L'.KArrow (_, k), _) => #1 k = L'.KUnit
adamc@513 598 | (L'.KError, _) => false
adamc@518 599 | k => raise CUnify' (CKindof (k, c, "arrow")))*)
adamc@513 600 | L'.CAbs _ => false
adamc@513 601
adamc@513 602 | L'.CName _ => false
adamc@513 603
adamc@513 604 | L'.CRecord _ => false
adamc@513 605 | L'.CConcat _ => false
adamc@621 606 | L'.CMap _ => false
adamc@513 607
adamc@513 608 | L'.CUnit => true
adamc@513 609
adamc@513 610 | L'.CTuple _ => false
adamc@518 611 | L'.CProj (c, n) => false
adamc@518 612 (*(case hnormKind (kindof env c) of
adamc@513 613 (L'.KTuple ks, _) => #1 (List.nth (ks, n - 1)) = L'.KUnit
adamc@518 614 | k => raise CUnify' (CKindof (k, c, "tuple")))*)
adamc@513 615
adamc@513 616 | L'.CError => false
adamc@513 617 | L'.CUnif (_, k, _, _) => #1 k = L'.KUnit
adamc@513 618
adamc@623 619 | L'.CKAbs _ => false
adamc@623 620 | L'.CKApp _ => false
adamc@623 621 | L'.TKFun _ => false
adamc@623 622
adamc@709 623 val recdCounter = ref 0
adamc@709 624
adamc@713 625 val mayDelay = ref false
adamc@777 626 val delayedUnifs = ref ([] : (ErrorMsg.span * E.env * L'.kind * record_summary * record_summary) list)
adamc@777 627
adamc@777 628 fun unifyRecordCons env (loc, c1, c2) =
adamc@403 629 let
adamc@403 630 fun rkindof c =
adamc@403 631 case hnormKind (kindof env c) of
adamc@403 632 (L'.KRecord k, _) => k
adamc@403 633 | (L'.KError, _) => kerror
adamc@753 634 | (L'.KUnif (_, _, r), _) =>
adamc@753 635 let
adamc@753 636 val k = kunif (#2 c)
adamc@753 637 in
adamc@753 638 r := SOME (L'.KRecord k, #2 c);
adamc@753 639 k
adamc@753 640 end
adamc@413 641 | k => raise CUnify' (CKindof (k, c, "record"))
adamc@403 642
adamc@403 643 val k1 = rkindof c1
adamc@403 644 val k2 = rkindof c2
adamc@403 645
adamc@628 646 val r1 = recordSummary env c1
adamc@628 647 val r2 = recordSummary env c2
adamc@403 648 in
adamc@623 649 unifyKinds env k1 k2;
adamc@777 650 unifySummaries env (loc, k1, r1, r2)
adamc@403 651 end
adamc@403 652
adamc@777 653 and normalizeRecordSummary env (r : record_summary) =
adamc@777 654 recordSummary env (summaryToCon r)
adamc@777 655
adamc@628 656 and recordSummary env c =
adamc@403 657 let
adamc@628 658 val c = hnormCon env c
adamc@628 659
adamc@628 660 val sum =
adamc@403 661 case c of
adamc@628 662 (L'.CRecord (_, xcs), _) => {fields = xcs, unifs = [], others = []}
adamc@403 663 | (L'.CConcat (c1, c2), _) =>
adamc@403 664 let
adamc@628 665 val s1 = recordSummary env c1
adamc@628 666 val s2 = recordSummary env c2
adamc@403 667 in
adamc@628 668 {fields = #fields s1 @ #fields s2,
adamc@628 669 unifs = #unifs s1 @ #unifs s2,
adamc@628 670 others = #others s1 @ #others s2}
adamc@403 671 end
adamc@628 672 | (L'.CUnif (_, _, _, ref (SOME c)), _) => recordSummary env c
adamc@628 673 | c' as (L'.CUnif (_, _, _, r), _) => {fields = [], unifs = [(c', r)], others = []}
adamc@628 674 | c' => {fields = [], unifs = [], others = [c']}
adamc@403 675 in
adamc@628 676 sum
adamc@403 677 end
adamc@403 678
adamc@628 679 and consEq env (c1, c2) =
adamc@777 680 let
adamc@777 681 val mayDelay' = !mayDelay
adamc@777 682 in
adamc@777 683 (mayDelay := false;
adamc@777 684 unifyCons env c1 c2;
adamc@777 685 mayDelay := mayDelay';
adamc@777 686 true)
adamc@777 687 handle CUnify _ => (mayDelay := mayDelay'; false)
adamc@777 688 end
adamc@403 689
adamc@403 690 and consNeq env (c1, c2) =
adamc@628 691 case (#1 (hnormCon env c1), #1 (hnormCon env c2)) of
adamc@403 692 (L'.CName x1, L'.CName x2) => x1 <> x2
adamc@403 693 | _ => false
adamc@403 694
adamc@777 695 and unifySummaries env (loc, k, s1 : record_summary, s2 : record_summary) =
adamc@403 696 let
adamc@403 697 val loc = #2 k
adamc@777 698 val pdescs = [("#1", p_summary env s1),
adamc@777 699 ("#2", p_summary env s2)]
adamc@403 700 (*val () = eprefaces "Summaries" [("#1", p_summary env s1),
adamc@403 701 ("#2", p_summary env s2)]*)
adamc@403 702
adamc@403 703 fun eatMatching p (ls1, ls2) =
adamc@403 704 let
adamc@403 705 fun em (ls1, ls2, passed1) =
adamc@403 706 case ls1 of
adamc@403 707 [] => (rev passed1, ls2)
adamc@403 708 | h1 :: t1 =>
adamc@403 709 let
adamc@403 710 fun search (ls2', passed2) =
adamc@403 711 case ls2' of
adamc@403 712 [] => em (t1, ls2, h1 :: passed1)
adamc@403 713 | h2 :: t2 =>
adamc@403 714 if p (h1, h2) then
adamc@403 715 em (t1, List.revAppend (passed2, t2), passed1)
adamc@403 716 else
adamc@403 717 search (t2, h2 :: passed2)
adamc@403 718 in
adamc@403 719 search (ls2, [])
adamc@403 720 end
adamc@403 721 in
adamc@403 722 em (ls1, ls2, [])
adamc@403 723 end
adamc@403 724
adamc@403 725 val (fs1, fs2) = eatMatching (fn ((x1, c1), (x2, c2)) =>
adamc@403 726 not (consNeq env (x1, x2))
adamc@628 727 andalso consEq env (c1, c2)
adamc@628 728 andalso consEq env (x1, x2))
adamc@403 729 (#fields s1, #fields s2)
adamc@403 730 (*val () = eprefaces "Summaries2" [("#1", p_summary env {fields = fs1, unifs = #unifs s1, others = #others s1}),
adamc@403 731 ("#2", p_summary env {fields = fs2, unifs = #unifs s2, others = #others s2})]*)
adamc@646 732
adamc@403 733 val (unifs1, unifs2) = eatMatching (fn ((_, r1), (_, r2)) => r1 = r2) (#unifs s1, #unifs s2)
adamc@646 734
adamc@628 735 val (others1, others2) = eatMatching (consEq env) (#others s1, #others s2)
adamc@403 736 (*val () = eprefaces "Summaries3" [("#1", p_summary env {fields = fs1, unifs = unifs1, others = others1}),
adamc@403 737 ("#2", p_summary env {fields = fs2, unifs = unifs2, others = others2})]*)
adamc@403 738
adamc@709 739 fun unsummarize {fields, unifs, others} =
adamc@709 740 let
adamc@709 741 val c = (L'.CRecord (k, fields), loc)
adamc@709 742
adamc@709 743 val c = foldl (fn ((c1, _), c2) => (L'.CConcat (c1, c2), loc))
adamc@709 744 c unifs
adamc@709 745 in
adamc@709 746 foldl (fn (c1, c2) => (L'.CConcat (c1, c2), loc))
adamc@709 747 c others
adamc@709 748 end
adamc@709 749
adamc@710 750 val empties = ([], [], [], [], [], [])
adamc@710 751
adamc@709 752 val (unifs1, fs1, others1, unifs2, fs2, others2) =
adamc@709 753 case (unifs1, fs1, others1, unifs2, fs2, others2) of
adamc@709 754 orig as ([(_, r)], [], [], _, _, _) =>
adamc@709 755 let
adamc@709 756 val c = unsummarize {fields = fs2, others = others2, unifs = unifs2}
adamc@709 757 in
adamc@709 758 if occursCon r c then
adamc@709 759 orig
adamc@709 760 else
adamc@709 761 (r := SOME c;
adamc@710 762 empties)
adamc@709 763 end
adamc@709 764 | orig as (_, _, _, [(_, r)], [], []) =>
adamc@709 765 let
adamc@709 766 val c = unsummarize {fields = fs1, others = others1, unifs = unifs1}
adamc@709 767 in
adamc@709 768 if occursCon r c then
adamc@709 769 orig
adamc@709 770 else
adamc@709 771 (r := SOME c;
adamc@710 772 empties)
adamc@709 773 end
adamc@710 774 | orig as ([(_, r1 as ref NONE)], _, [], [(_, r2 as ref NONE)], _, []) =>
adamc@710 775 if List.all (fn (x1, _) => List.all (fn (x2, _) => consNeq env (x1, x2)) fs2) fs1 then
adamc@710 776 let
adamc@710 777 val kr = (L'.KRecord k, dummy)
adamc@710 778 val u = cunif (loc, kr)
adamc@710 779 in
adamc@710 780 r1 := SOME (L'.CConcat ((L'.CRecord (k, fs2), loc), u), loc);
adamc@710 781 r2 := SOME (L'.CConcat ((L'.CRecord (k, fs1), loc), u), loc);
adamc@710 782 empties
adamc@710 783 end
adamc@710 784 else
adamc@710 785 orig
adamc@709 786 | orig => orig
adamc@709 787
adamc@403 788 (*val () = eprefaces "Summaries4" [("#1", p_summary env {fields = fs1, unifs = unifs1, others = others1}),
adamc@777 789 ("#2", p_summary env {fields = fs2, unifs = unifs2, others = others2})]*)
adamc@403 790
adamc@753 791 fun isGuessable (other, fs, unifs) =
adamc@753 792 let
adamc@753 793 val c = (L'.CRecord (k, fs), loc)
adamc@753 794 val c = foldl (fn ((c', _), c) => (L'.CConcat (c', c), loc)) c unifs
adamc@753 795 in
adamc@753 796 (guessMap env (other, c, GuessFailure);
adamc@753 797 true)
adamc@753 798 handle GuessFailure => false
adamc@753 799 end
adamc@403 800
adamc@754 801 val (fs1, fs2, others1, others2, unifs1, unifs2) =
adamc@753 802 case (fs1, fs2, others1, others2, unifs1, unifs2) of
adamc@753 803 ([], _, [other1], [], [], _) =>
adamc@753 804 if isGuessable (other1, fs2, unifs2) then
adamc@754 805 ([], [], [], [], [], [])
adamc@403 806 else
adamc@754 807 (fs1, fs2, others1, others2, unifs1, unifs2)
adamc@753 808 | (_, [], [], [other2], _, []) =>
adamc@777 809 if isGuessable (other2, fs1, unifs1) then
adamc@777 810 ([], [], [], [], [], [])
adamc@777 811 else
adamc@777 812 (fs1, fs2, others1, others2, unifs1, unifs2)
adamc@754 813 | _ => (fs1, fs2, others1, others2, unifs1, unifs2)
adamc@403 814
adamc@403 815 (*val () = eprefaces "Summaries5" [("#1", p_summary env {fields = fs1, unifs = unifs1, others = others1}),
adamc@646 816 ("#2", p_summary env {fields = fs2, unifs = unifs2, others = others2})]*)
adamc@403 817
adamc@403 818 val empty = (L'.CRecord (k, []), dummy)
adamc@713 819 fun failure () = raise CUnify' (CRecordFailure (unsummarize s1, unsummarize s2))
adamc@709 820 in
adamc@777 821 (case (unifs1, fs1, others1, unifs2, fs2, others2) of
adamc@777 822 (_, [], [], [], [], []) =>
adamc@777 823 app (fn (_, r) => r := SOME empty) unifs1
adamc@777 824 | ([], [], [], _, [], []) =>
adamc@777 825 app (fn (_, r) => r := SOME empty) unifs2
adamc@777 826 | _ =>
adamc@777 827 if !mayDelay then
adamc@777 828 delayedUnifs := (loc, env, k, s1, s2) :: !delayedUnifs
adamc@777 829 else
adamc@777 830 failure ())
adamc@777 831
adamc@777 832 (*before eprefaces "Summaries'" [("#1", p_summary env (normalizeRecordSummary env s1)),
adamc@777 833 ("#2", p_summary env (normalizeRecordSummary env s2))]*)
adamc@403 834 end
adamc@403 835
adamc@628 836 and guessMap env (c1, c2, ex) =
adamc@403 837 let
adamc@403 838 val loc = #2 c1
adamc@403 839
adamc@621 840 fun unfold (dom, ran, f, r, c) =
adamc@403 841 let
adamc@621 842 fun unfold (r, c) =
adamc@754 843 case #1 (hnormCon env c) of
adamc@628 844 L'.CRecord (_, []) => unifyCons env r (L'.CRecord (dom, []), loc)
adamc@628 845 | L'.CRecord (_, [(x, v)]) =>
adamc@628 846 let
adamc@628 847 val v' = case dom of
adamc@628 848 (L'.KUnit, _) => (L'.CUnit, loc)
adamc@628 849 | _ => cunif (loc, dom)
adamc@628 850 in
adamc@628 851 unifyCons env v (L'.CApp (f, v'), loc);
adamc@628 852 unifyCons env r (L'.CRecord (dom, [(x, v')]), loc)
adamc@628 853 end
adamc@628 854 | L'.CRecord (_, (x, v) :: rest) =>
adamc@628 855 let
adamc@628 856 val r1 = cunif (loc, (L'.KRecord dom, loc))
adamc@628 857 val r2 = cunif (loc, (L'.KRecord dom, loc))
adamc@628 858 in
adamc@628 859 unfold (r1, (L'.CRecord (ran, [(x, v)]), loc));
adamc@628 860 unfold (r2, (L'.CRecord (ran, rest), loc));
adamc@628 861 unifyCons env r (L'.CConcat (r1, r2), loc)
adamc@628 862 end
adamc@628 863 | L'.CConcat (c1', c2') =>
adamc@628 864 let
adamc@628 865 val r1 = cunif (loc, (L'.KRecord dom, loc))
adamc@628 866 val r2 = cunif (loc, (L'.KRecord dom, loc))
adamc@628 867 in
adamc@628 868 unfold (r1, c1');
adamc@628 869 unfold (r2, c2');
adamc@628 870 unifyCons env r (L'.CConcat (r1, r2), loc)
adamc@628 871 end
adamc@754 872 | L'.CUnif (_, _, _, ur) =>
adamc@777 873 ur := SOME (L'.CApp ((L'.CApp ((L'.CMap (dom, ran), loc), f), loc), r), loc)
adamc@628 874 | _ => raise ex
adamc@403 875 in
adamc@621 876 unfold (r, c)
adamc@403 877 end
adamc@632 878 handle _ => raise ex
adamc@403 879 in
adamc@403 880 case (#1 c1, #1 c2) of
adamc@621 881 (L'.CApp ((L'.CApp ((L'.CMap (dom, ran), _), f), _), r), _) =>
adamc@621 882 unfold (dom, ran, f, r, c2)
adamc@621 883 | (_, L'.CApp ((L'.CApp ((L'.CMap (dom, ran), _), f), _), r)) =>
adamc@621 884 unfold (dom, ran, f, r, c1)
adamc@403 885 | _ => raise ex
adamc@403 886 end
adamc@403 887
adamc@628 888 and unifyCons' env c1 c2 =
adamc@628 889 if isUnitCon env c1 andalso isUnitCon env c2 then
adamc@628 890 ()
adamc@628 891 else
adamc@403 892 let
adamc@628 893 (*val befor = Time.now ()
adamc@628 894 val old1 = c1
adamc@628 895 val old2 = c2*)
adamc@628 896 val c1 = hnormCon env c1
adamc@628 897 val c2 = hnormCon env c2
adamc@403 898 in
adamc@628 899 unifyCons'' env c1 c2
adamc@628 900 handle ex => guessMap env (c1, c2, ex)
adamc@403 901 end
adamc@628 902
adamc@628 903 and unifyCons'' env (c1All as (c1, loc)) (c2All as (c2, _)) =
adamc@403 904 let
adamc@403 905 fun err f = raise CUnify' (f (c1All, c2All))
adamc@403 906
adamc@706 907 fun projSpecial1 (c1, n1, onFail) =
adamc@403 908 let
adamc@632 909 fun trySnd () =
adamc@632 910 case #1 (hnormCon env c2All) of
adamc@632 911 L'.CProj (c2, n2) =>
adamc@632 912 let
adamc@632 913 fun tryNormal () =
adamc@632 914 if n1 = n2 then
adamc@632 915 unifyCons' env c1 c2
adamc@632 916 else
adamc@706 917 onFail ()
adamc@632 918 in
adamc@632 919 case #1 (hnormCon env c2) of
adamc@632 920 L'.CUnif (_, k, _, r) =>
adamc@632 921 (case #1 (hnormKind k) of
adamc@632 922 L'.KTuple ks =>
adamc@632 923 let
adamc@632 924 val loc = #2 c2
adamc@632 925 val us = map (fn k => cunif (loc, k)) ks
adamc@632 926 in
adamc@632 927 r := SOME (L'.CTuple us, loc);
adamc@632 928 unifyCons' env c1All (List.nth (us, n2 - 1))
adamc@632 929 end
adamc@632 930 | _ => tryNormal ())
adamc@632 931 | _ => tryNormal ()
adamc@632 932 end
adamc@706 933 | _ => onFail ()
adamc@403 934 in
adamc@632 935 case #1 (hnormCon env c1) of
adamc@632 936 L'.CUnif (_, k, _, r) =>
adamc@632 937 (case #1 (hnormKind k) of
adamc@632 938 L'.KTuple ks =>
adamc@632 939 let
adamc@632 940 val loc = #2 c1
adamc@632 941 val us = map (fn k => cunif (loc, k)) ks
adamc@632 942 in
adamc@632 943 r := SOME (L'.CTuple us, loc);
adamc@632 944 unifyCons' env (List.nth (us, n1 - 1)) c2All
adamc@632 945 end
adamc@632 946 | _ => trySnd ())
adamc@632 947 | _ => trySnd ()
adamc@403 948 end
adamc@632 949
adamc@706 950 fun projSpecial2 (c2, n2, onFail) =
adamc@706 951 case #1 (hnormCon env c2) of
adamc@706 952 L'.CUnif (_, k, _, r) =>
adamc@706 953 (case #1 (hnormKind k) of
adamc@706 954 L'.KTuple ks =>
adamc@706 955 let
adamc@706 956 val loc = #2 c2
adamc@706 957 val us = map (fn k => cunif (loc, k)) ks
adamc@706 958 in
adamc@706 959 r := SOME (L'.CTuple us, loc);
adamc@706 960 unifyCons' env c1All (List.nth (us, n2 - 1))
adamc@706 961 end
adamc@706 962 | _ => onFail ())
adamc@706 963 | _ => onFail ()
adamc@706 964
adamc@777 965 fun isRecord' () = unifyRecordCons env (loc, c1All, c2All)
adamc@706 966
adamc@706 967 fun isRecord () =
adamc@706 968 case (c1, c2) of
adamc@706 969 (L'.CProj (c1, n1), _) => projSpecial1 (c1, n1, isRecord')
adamc@706 970 | (_, L'.CProj (c2, n2)) => projSpecial2 (c2, n2, isRecord')
adamc@706 971 | _ => isRecord' ()
adamc@706 972 in
adamc@706 973 (*eprefaces "unifyCons''" [("c1All", p_con env c1All),
adamc@706 974 ("c2All", p_con env c2All)];*)
adamc@706 975
adamc@706 976 case (c1, c2) of
adamc@706 977 (L'.CError, _) => ()
adamc@706 978 | (_, L'.CError) => ()
adamc@403 979
adamc@705 980 | (L'.CRecord _, _) => isRecord ()
adamc@705 981 | (_, L'.CRecord _) => isRecord ()
adamc@705 982 | (L'.CConcat _, _) => isRecord ()
adamc@705 983 | (_, L'.CConcat _) => isRecord ()
adamc@705 984
adamc@705 985 | (L'.CUnif (_, k1, _, r1), L'.CUnif (_, k2, _, r2)) =>
adamc@705 986 if r1 = r2 then
adamc@705 987 ()
adamc@705 988 else
adamc@705 989 (unifyKinds env k1 k2;
adamc@705 990 r1 := SOME c2All)
adamc@705 991
adamc@705 992 | (L'.CUnif (_, _, _, r), _) =>
adamc@705 993 if occursCon r c2All then
adamc@705 994 err COccursCheckFailed
adamc@705 995 else
adamc@705 996 r := SOME c2All
adamc@705 997 | (_, L'.CUnif (_, _, _, r)) =>
adamc@705 998 if occursCon r c1All then
adamc@705 999 err COccursCheckFailed
adamc@705 1000 else
adamc@705 1001 r := SOME c1All
adamc@705 1002
adamc@705 1003 | (L'.CUnit, L'.CUnit) => ()
adamc@705 1004
adamc@705 1005 | (L'.TFun (d1, r1), L'.TFun (d2, r2)) =>
adamc@705 1006 (unifyCons' env d1 d2;
adamc@705 1007 unifyCons' env r1 r2)
adamc@705 1008 | (L'.TCFun (expl1, x1, d1, r1), L'.TCFun (expl2, _, d2, r2)) =>
adamc@705 1009 if expl1 <> expl2 then
adamc@705 1010 err CExplicitness
adamc@705 1011 else
adamc@705 1012 (unifyKinds env d1 d2;
adamc@705 1013 let
adamc@705 1014 (*val befor = Time.now ()*)
adamc@705 1015 val env' = E.pushCRel env x1 d1
adamc@705 1016 in
adamc@705 1017 (*TextIO.print ("E.pushCRel: "
adamc@705 1018 ^ LargeReal.toString (Time.toReal (Time.- (Time.now (), befor)))
adamc@705 1019 ^ "\n");*)
adamc@705 1020 unifyCons' env' r1 r2
adamc@705 1021 end)
adamc@705 1022 | (L'.TRecord r1, L'.TRecord r2) => unifyCons' env r1 r2
adamc@705 1023 | (L'.TDisjoint (c1, d1, e1), L'.TDisjoint (c2, d2, e2)) =>
adamc@705 1024 (unifyCons' env c1 c2;
adamc@705 1025 unifyCons' env d1 d2;
adamc@705 1026 unifyCons' env e1 e2)
adamc@705 1027
adamc@705 1028 | (L'.CRel n1, L'.CRel n2) =>
adamc@705 1029 if n1 = n2 then
adamc@705 1030 ()
adamc@705 1031 else
adamc@705 1032 err CIncompatible
adamc@705 1033 | (L'.CNamed n1, L'.CNamed n2) =>
adamc@705 1034 if n1 = n2 then
adamc@705 1035 ()
adamc@705 1036 else
adamc@705 1037 err CIncompatible
adamc@705 1038
adamc@705 1039 | (L'.CApp (d1, r1), L'.CApp (d2, r2)) =>
adamc@705 1040 (unifyCons' env d1 d2;
adamc@705 1041 unifyCons' env r1 r2)
adamc@705 1042 | (L'.CAbs (x1, k1, c1), L'.CAbs (_, k2, c2)) =>
adamc@705 1043 (unifyKinds env k1 k2;
adamc@705 1044 unifyCons' (E.pushCRel env x1 k1) c1 c2)
adamc@705 1045
adamc@705 1046 | (L'.CName n1, L'.CName n2) =>
adamc@705 1047 if n1 = n2 then
adamc@705 1048 ()
adamc@705 1049 else
adamc@705 1050 err CIncompatible
adamc@705 1051
adamc@705 1052 | (L'.CModProj (n1, ms1, x1), L'.CModProj (n2, ms2, x2)) =>
adamc@705 1053 if n1 = n2 andalso ms1 = ms2 andalso x1 = x2 then
adamc@705 1054 ()
adamc@705 1055 else
adamc@705 1056 err CIncompatible
adamc@705 1057
adamc@705 1058 | (L'.CTuple cs1, L'.CTuple cs2) =>
adamc@705 1059 ((ListPair.appEq (fn (c1, c2) => unifyCons' env c1 c2) (cs1, cs2))
adamc@705 1060 handle ListPair.UnequalLengths => err CIncompatible)
adamc@705 1061
adamc@706 1062 | (L'.CProj (c1, n1), _) => projSpecial1 (c1, n1, fn () => err CIncompatible)
adamc@706 1063 | (_, L'.CProj (c2, n2)) => projSpecial2 (c2, n2, fn () => err CIncompatible)
adamc@706 1064
adamc@623 1065 | (L'.CMap (dom1, ran1), L'.CMap (dom2, ran2)) =>
adamc@623 1066 (unifyKinds env dom1 dom2;
adamc@628 1067 unifyKinds env ran1 ran2)
adamc@623 1068
adamc@623 1069 | (L'.CKAbs (x, c1), L'.CKAbs (_, c2)) =>
adamc@628 1070 unifyCons' (E.pushKRel env x) c1 c2
adamc@623 1071 | (L'.CKApp (c1, k1), L'.CKApp (c2, k2)) =>
adamc@623 1072 (unifyKinds env k1 k2;
adamc@628 1073 unifyCons' env c1 c2)
adamc@623 1074 | (L'.TKFun (x, c1), L'.TKFun (_, c2)) =>
adamc@628 1075 unifyCons' (E.pushKRel env x) c1 c2
adamc@628 1076
adamc@403 1077 | _ => err CIncompatible
adamc@403 1078 end
adamc@403 1079
adamc@628 1080 and unifyCons env c1 c2 =
adamc@628 1081 unifyCons' env c1 c2
adamc@403 1082 handle CUnify' err => raise CUnify (c1, c2, err)
adamc@403 1083 | KUnify args => raise CUnify (c1, c2, CKind args)
adamc@403 1084
adamc@628 1085 fun checkCon env e c1 c2 =
adamc@628 1086 unifyCons env c1 c2
adamc@403 1087 handle CUnify (c1, c2, err) =>
adamc@628 1088 expError env (Unify (e, c1, c2, err))
adamc@628 1089
adamc@628 1090 fun checkPatCon env p c1 c2 =
adamc@628 1091 unifyCons env c1 c2
adamc@403 1092 handle CUnify (c1, c2, err) =>
adamc@628 1093 expError env (PatUnify (p, c1, c2, err))
adamc@71 1094
adamc@403 1095 fun primType env p =
adamc@403 1096 case p of
adamc@403 1097 P.Int _ => !int
adamc@403 1098 | P.Float _ => !float
adamc@403 1099 | P.String _ => !string
adamc@821 1100 | P.Char _ => !char
adamc@623 1101
adamc@403 1102 datatype constraint =
adamc@403 1103 Disjoint of D.goal
adamc@403 1104 | TypeClass of E.env * L'.con * L'.exp option ref * ErrorMsg.span
adamc@403 1105
adamc@403 1106 val enD = map Disjoint
adamc@403 1107
adamc@634 1108 fun isClassOrFolder env cl =
adamc@634 1109 E.isClass env cl
adamc@634 1110 orelse case hnormCon env cl of
adamc@634 1111 (L'.CKApp (cl, _), _) =>
adamc@634 1112 (case hnormCon env cl of
adamc@634 1113 (L'.CModProj (top_n, [], "folder"), _) => top_n = !top_r
adamc@634 1114 | _ => false)
adamc@634 1115 | _ => false
adamc@634 1116
adamc@629 1117 fun elabHead (env, denv) infer (e as (_, loc)) t =
adamc@403 1118 let
adamc@403 1119 fun unravel (t, e) =
adamc@628 1120 case hnormCon env t of
adamc@628 1121 (L'.TKFun (x, t'), _) =>
adamc@628 1122 let
adamc@628 1123 val u = kunif loc
adamc@628 1124
adamc@628 1125 val t'' = subKindInCon (0, u) t'
adamc@628 1126 in
adamc@628 1127 unravel (t'', (L'.EKApp (e, u), loc))
adamc@628 1128 end
adamc@628 1129 | (L'.TCFun (L'.Implicit, x, k, t'), _) =>
adamc@628 1130 let
adamc@628 1131 val u = cunif (loc, k)
adamc@628 1132
adamc@628 1133 val t'' = subConInCon (0, u) t'
adamc@628 1134 in
adamc@628 1135 unravel (t'', (L'.ECApp (e, u), loc))
adamc@628 1136 end
adamc@633 1137 | (L'.TFun (dom, ran), _) =>
adamc@628 1138 let
adamc@633 1139 fun default () = (e, t, [])
adamc@750 1140
adamc@750 1141 fun isInstance () =
adamc@750 1142 if infer <> L.TypesOnly then
adamc@750 1143 let
adamc@750 1144 val r = ref NONE
adamc@750 1145 val (e, t, gs) = unravel (ran, (L'.EApp (e, (L'.EUnif r, loc)), loc))
adamc@750 1146 in
adamc@750 1147 (e, t, TypeClass (env, dom, r, loc) :: gs)
adamc@750 1148 end
adamc@750 1149 else
adamc@750 1150 default ()
adamc@750 1151
adamc@750 1152 fun hasInstance c =
adamc@753 1153 case hnormCon env c of
adamc@753 1154 (L'.TRecord c, _) => U.Con.exists {kind = fn _ => false,
adamc@753 1155 con = fn c =>
adamc@753 1156 E.isClass env (hnormCon env (c, loc))} c
adamc@753 1157 | c =>
adamc@750 1158 let
adamc@753 1159 fun findHead c =
adamc@753 1160 case #1 c of
adamc@753 1161 L'.CApp (f, _) => findHead f
adamc@753 1162 | _ => c
adamc@753 1163
adamc@753 1164 val cl = hnormCon env (findHead c)
adamc@750 1165 in
adamc@750 1166 isClassOrFolder env cl
adamc@750 1167 end
adamc@628 1168 in
adamc@750 1169 if hasInstance dom then
adamc@750 1170 isInstance ()
adamc@750 1171 else
adamc@750 1172 default ()
adamc@628 1173 end
adamc@629 1174 | (L'.TDisjoint (r1, r2, t'), loc) =>
adamc@629 1175 if infer <> L.TypesOnly then
adamc@629 1176 let
adamc@792 1177 val gs = D.prove env denv (r1, r2, #2 e)
adamc@629 1178 val (e, t, gs') = unravel (t', e)
adamc@629 1179 in
adamc@629 1180 (e, t, enD gs @ gs')
adamc@629 1181 end
adamc@629 1182 else
adamc@629 1183 (e, t, [])
adamc@628 1184 | t => (e, t, [])
adamc@704 1185 in
adamc@704 1186 case infer of
adamc@704 1187 L.DontInfer => (e, t, [])
adamc@704 1188 | _ => unravel (t, e)
adamc@704 1189 end
adamc@15 1190
adamc@628 1191 fun elabPat (pAll as (p, loc), (env, bound)) =
adamc@171 1192 let
adamc@171 1193 val perror = (L'.PWild, loc)
adamc@171 1194 val terror = (L'.CError, loc)
adamc@171 1195 val pterror = (perror, terror)
adamc@171 1196 val rerror = (pterror, (env, bound))
adamc@171 1197
adamc@191 1198 fun pcon (pc, po, xs, to, dn, dk) =
adamc@188 1199 case (po, to) of
adamc@188 1200 (NONE, SOME _) => (expError env (PatHasNoArg loc);
adamc@188 1201 rerror)
adamc@188 1202 | (SOME _, NONE) => (expError env (PatHasArg loc);
adamc@188 1203 rerror)
adamc@191 1204 | (NONE, NONE) =>
adamc@191 1205 let
adamc@191 1206 val k = (L'.KType, loc)
adamc@191 1207 val unifs = map (fn _ => cunif (loc, k)) xs
adamc@191 1208 val dn = foldl (fn (u, dn) => (L'.CApp (dn, u), loc)) dn unifs
adamc@191 1209 in
adamc@191 1210 (((L'.PCon (dk, pc, unifs, NONE), loc), dn),
adamc@191 1211 (env, bound))
adamc@191 1212 end
adamc@188 1213 | (SOME p, SOME t) =>
adamc@188 1214 let
adamc@628 1215 val ((p', pt), (env, bound)) = elabPat (p, (env, bound))
adamc@191 1216
adamc@191 1217 val k = (L'.KType, loc)
adamc@191 1218 val unifs = map (fn _ => cunif (loc, k)) xs
adamc@194 1219 val nxs = length unifs - 1
adamc@194 1220 val t = ListUtil.foldli (fn (i, u, t) => subConInCon (nxs - i, u) t) t unifs
adamc@191 1221 val dn = foldl (fn (u, dn) => (L'.CApp (dn, u), loc)) dn unifs
adamc@188 1222 in
adamc@628 1223 ignore (checkPatCon env p' pt t);
adamc@191 1224 (((L'.PCon (dk, pc, unifs, SOME p'), loc), dn),
adamc@188 1225 (env, bound))
adamc@188 1226 end
adamc@171 1227 in
adamc@171 1228 case p of
adamc@171 1229 L.PWild => (((L'.PWild, loc), cunif (loc, (L'.KType, loc))),
adamc@171 1230 (env, bound))
adamc@171 1231 | L.PVar x =>
adamc@171 1232 let
adamc@171 1233 val t = if SS.member (bound, x) then
adamc@171 1234 (expError env (DuplicatePatternVariable (loc, x));
adamc@171 1235 terror)
adamc@171 1236 else
adamc@171 1237 cunif (loc, (L'.KType, loc))
adamc@171 1238 in
adamc@182 1239 (((L'.PVar (x, t), loc), t),
adamc@171 1240 (E.pushERel env x t, SS.add (bound, x)))
adamc@171 1241 end
adamc@173 1242 | L.PPrim p => (((L'.PPrim p, loc), primType env p),
adamc@173 1243 (env, bound))
adamc@171 1244 | L.PCon ([], x, po) =>
adamc@171 1245 (case E.lookupConstructor env x of
adamc@174 1246 NONE => (expError env (UnboundConstructor (loc, [], x));
adamc@171 1247 rerror)
adamc@191 1248 | SOME (dk, n, xs, to, dn) => pcon (L'.PConVar n, po, xs, to, (L'.CNamed dn, loc), dk))
adamc@174 1249 | L.PCon (m1 :: ms, x, po) =>
adamc@174 1250 (case E.lookupStr env m1 of
adamc@174 1251 NONE => (expError env (UnboundStrInExp (loc, m1));
adamc@174 1252 rerror)
adamc@174 1253 | SOME (n, sgn) =>
adamc@174 1254 let
adamc@174 1255 val (str, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@174 1256 case E.projectStr env {sgn = sgn, str = str, field = m} of
adamc@182 1257 NONE => raise Fail "elabPat: Unknown substructure"
adamc@174 1258 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@174 1259 ((L'.StrVar n, loc), sgn) ms
adamc@174 1260 in
adamc@174 1261 case E.projectConstructor env {str = str, sgn = sgn, field = x} of
adamc@174 1262 NONE => (expError env (UnboundConstructor (loc, m1 :: ms, x));
adamc@174 1263 rerror)
adamc@191 1264 | SOME (dk, _, xs, to, dn) => pcon (L'.PConProj (n, ms, x), po, xs, to, dn, dk)
adamc@174 1265 end)
adamc@174 1266
adamc@175 1267 | L.PRecord (xps, flex) =>
adamc@175 1268 let
adamc@175 1269 val (xpts, (env, bound, _)) =
adamc@175 1270 ListUtil.foldlMap (fn ((x, p), (env, bound, fbound)) =>
adamc@175 1271 let
adamc@628 1272 val ((p', t), (env, bound)) = elabPat (p, (env, bound))
adamc@175 1273 in
adamc@175 1274 if SS.member (fbound, x) then
adamc@175 1275 expError env (DuplicatePatField (loc, x))
adamc@175 1276 else
adamc@175 1277 ();
adamc@175 1278 ((x, p', t), (env, bound, SS.add (fbound, x)))
adamc@175 1279 end)
adamc@175 1280 (env, bound, SS.empty) xps
adamc@175 1281
adamc@175 1282 val k = (L'.KType, loc)
adamc@175 1283 val c = (L'.CRecord (k, map (fn (x, _, t) => ((L'.CName x, loc), t)) xpts), loc)
adamc@176 1284 val c =
adamc@175 1285 if flex then
adamc@176 1286 (L'.CConcat (c, cunif (loc, (L'.KRecord k, loc))), loc)
adamc@175 1287 else
adamc@176 1288 c
adamc@175 1289 in
adamc@182 1290 (((L'.PRecord xpts, loc),
adamc@175 1291 (L'.TRecord c, loc)),
adamc@175 1292 (env, bound))
adamc@175 1293 end
adamc@822 1294
adamc@822 1295 | L.PAnnot (p, t) =>
adamc@822 1296 let
adamc@822 1297 val ((p', pt), (env, bound)) = elabPat (p, (env, bound))
adamc@822 1298 val (t', k, _) = elabCon (env, D.empty) t
adamc@822 1299 in
adamc@822 1300 checkPatCon env p' pt t';
adamc@822 1301 ((p', t'), (env, bound))
adamc@822 1302 end
adamc@171 1303 end
adamc@171 1304
adamc@819 1305 (* This exhaustiveness checking follows Luc Maranget's paper "Warnings for pattern matching." *)
adamc@819 1306 fun exhaustive (env, t, ps, loc) =
adamc@819 1307 let
adamc@819 1308 fun fail n = raise Fail ("Elaborate.exhaustive: Impossible " ^ Int.toString n)
adamc@819 1309
adamc@819 1310 fun patConNum pc =
adamc@819 1311 case pc of
adamc@819 1312 L'.PConVar n => n
adamc@819 1313 | L'.PConProj (m1, ms, x) =>
adamc@819 1314 let
adamc@819 1315 val (str, sgn) = E.chaseMpath env (m1, ms)
adamc@819 1316 in
adamc@819 1317 case E.projectConstructor env {str = str, sgn = sgn, field = x} of
adamc@819 1318 NONE => raise Fail "exhaustive: Can't project datatype"
adamc@819 1319 | SOME (_, n, _, _, _) => n
adamc@819 1320 end
adamc@819 1321
adamc@819 1322 fun nameOfNum (t, n) =
adamc@819 1323 case t of
adamc@819 1324 L'.CModProj (m1, ms, x) =>
adamc@819 1325 let
adamc@819 1326 val (str, sgn) = E.chaseMpath env (m1, ms)
adamc@819 1327 in
adamc@819 1328 case E.projectDatatype env {str = str, sgn = sgn, field = x} of
adamc@819 1329 NONE => raise Fail "exhaustive: Can't project datatype"
adamc@819 1330 | SOME (_, cons) =>
adamc@819 1331 case ListUtil.search (fn (name, n', _) =>
adamc@819 1332 if n' = n then
adamc@819 1333 SOME name
adamc@819 1334 else
adamc@819 1335 NONE) cons of
adamc@819 1336 NONE => fail 9
adamc@819 1337 | SOME name => L'.PConProj (m1, ms, name)
adamc@819 1338 end
adamc@819 1339 | _ => L'.PConVar n
adamc@819 1340
adamc@819 1341 fun S (args, c, P) =
adamc@819 1342 List.mapPartial
adamc@819 1343 (fn [] => fail 1
adamc@819 1344 | p1 :: ps =>
adamc@819 1345 let
adamc@819 1346 val loc = #2 p1
adamc@819 1347
adamc@819 1348 fun wild () =
adamc@819 1349 SOME (map (fn _ => (L'.PWild, loc)) args @ ps)
adamc@819 1350 in
adamc@819 1351 case #1 p1 of
adamc@819 1352 L'.PPrim _ => NONE
adamc@819 1353 | L'.PCon (_, c', _, NONE) =>
adamc@819 1354 if patConNum c' = c then
adamc@819 1355 SOME ps
adamc@819 1356 else
adamc@819 1357 NONE
adamc@819 1358 | L'.PCon (_, c', _, SOME p) =>
adamc@819 1359 if patConNum c' = c then
adamc@819 1360 SOME (p :: ps)
adamc@819 1361 else
adamc@819 1362 NONE
adamc@819 1363 | L'.PRecord xpts =>
adamc@819 1364 SOME (map (fn x =>
adamc@819 1365 case ListUtil.search (fn (x', p, _) =>
adamc@819 1366 if x = x' then
adamc@819 1367 SOME p
adamc@819 1368 else
adamc@819 1369 NONE) xpts of
adamc@819 1370 NONE => (L'.PWild, loc)
adamc@819 1371 | SOME p => p) args @ ps)
adamc@819 1372 | L'.PWild => wild ()
adamc@819 1373 | L'.PVar _ => wild ()
adamc@819 1374 end)
adamc@819 1375 P
adamc@819 1376
adamc@819 1377 fun D P =
adamc@819 1378 List.mapPartial
adamc@819 1379 (fn [] => fail 2
adamc@819 1380 | (p1, _) :: ps =>
adamc@819 1381 case p1 of
adamc@819 1382 L'.PWild => SOME ps
adamc@819 1383 | L'.PVar _ => SOME ps
adamc@819 1384 | L'.PPrim _ => NONE
adamc@819 1385 | L'.PCon _ => NONE
adamc@819 1386 | L'.PRecord _ => NONE)
adamc@819 1387 P
adamc@819 1388
adamc@819 1389 fun I (P, q) =
adamc@819 1390 (*(prefaces "I" [("P", p_list (fn P' => box [PD.string "[", p_list (p_pat env) P', PD.string "]"]) P),
adamc@819 1391 ("q", p_list (p_con env) q)];*)
adamc@819 1392 case q of
adamc@819 1393 [] => (case P of
adamc@819 1394 [] => SOME []
adamc@819 1395 | _ => NONE)
adamc@819 1396 | q1 :: qs =>
adamc@819 1397 let
adamc@819 1398 val loc = #2 q1
adamc@819 1399
adamc@819 1400 fun unapp (t, acc) =
adamc@819 1401 case t of
adamc@819 1402 L'.CApp ((t, _), arg) => unapp (t, arg :: acc)
adamc@819 1403 | _ => (t, rev acc)
adamc@819 1404
adamc@819 1405 val (t1, args) = unapp (#1 (hnormCon env q1), [])
adamc@819 1406 fun doSub t = foldl (fn (arg, t) => subConInCon (0, arg) t) t args
adamc@819 1407
adamc@819 1408 fun dtype (dtO, names) =
adamc@819 1409 let
adamc@819 1410 val nameSet = IS.addList (IS.empty, names)
adamc@819 1411 val nameSet = foldl (fn (ps, nameSet) =>
adamc@819 1412 case ps of
adamc@819 1413 [] => fail 4
adamc@819 1414 | (L'.PCon (_, pc, _, _), _) :: _ =>
adamc@819 1415 (IS.delete (nameSet, patConNum pc)
adamc@819 1416 handle NotFound => nameSet)
adamc@819 1417 | _ => nameSet)
adamc@819 1418 nameSet P
adamc@819 1419 in
adamc@819 1420 nameSet
adamc@819 1421 end
adamc@819 1422
adamc@819 1423 fun default () = (NONE, IS.singleton 0, [])
adamc@819 1424
adamc@819 1425 val (dtO, unused, cons) =
adamc@819 1426 case t1 of
adamc@819 1427 L'.CNamed n =>
adamc@819 1428 let
adamc@819 1429 val dt = E.lookupDatatype env n
adamc@819 1430 val cons = E.constructors dt
adamc@819 1431 in
adamc@819 1432 (SOME dt,
adamc@819 1433 dtype (SOME dt, map #2 cons),
adamc@819 1434 map (fn (_, n, co) =>
adamc@819 1435 (n,
adamc@819 1436 case co of
adamc@819 1437 NONE => []
adamc@819 1438 | SOME t => [("", doSub t)])) cons)
adamc@819 1439 end
adamc@819 1440 | L'.CModProj (m1, ms, x) =>
adamc@819 1441 let
adamc@819 1442 val (str, sgn) = E.chaseMpath env (m1, ms)
adamc@819 1443 in
adamc@819 1444 case E.projectDatatype env {str = str, sgn = sgn, field = x} of
adamc@819 1445 NONE => default ()
adamc@819 1446 | SOME (_, cons) =>
adamc@819 1447 (NONE,
adamc@819 1448 dtype (NONE, map #2 cons),
adamc@819 1449 map (fn (s, _, co) =>
adamc@819 1450 (patConNum (L'.PConProj (m1, ms, s)),
adamc@819 1451 case co of
adamc@819 1452 NONE => []
adamc@819 1453 | SOME t => [("", doSub t)])) cons)
adamc@819 1454 end
adamc@819 1455 | L'.TRecord (L'.CRecord (_, xts), _) =>
adamc@819 1456 let
adamc@819 1457 val xts = map (fn ((L'.CName x, _), co) => SOME (x, co)
adamc@819 1458 | _ => NONE) xts
adamc@819 1459 in
adamc@819 1460 if List.all Option.isSome xts then
adamc@819 1461 let
adamc@819 1462 val xts = List.mapPartial (fn x => x) xts
adamc@819 1463 val xts = ListMergeSort.sort (fn ((x1, _), (x2, _)) =>
adamc@819 1464 String.compare (x1, x2) = GREATER) xts
adamc@819 1465 in
adamc@819 1466 (NONE, IS.empty, [(0, xts)])
adamc@819 1467 end
adamc@819 1468 else
adamc@819 1469 default ()
adamc@819 1470 end
adamc@819 1471 | _ => default ()
adamc@819 1472 in
adamc@819 1473 if IS.isEmpty unused then
adamc@819 1474 let
adamc@819 1475 fun recurse cons =
adamc@819 1476 case cons of
adamc@819 1477 [] => NONE
adamc@819 1478 | (name, args) :: cons =>
adamc@819 1479 case I (S (map #1 args, name, P),
adamc@819 1480 map #2 args @ qs) of
adamc@819 1481 NONE => recurse cons
adamc@819 1482 | SOME ps =>
adamc@819 1483 let
adamc@819 1484 val nargs = length args
adamc@819 1485 val argPs = List.take (ps, nargs)
adamc@819 1486 val restPs = List.drop (ps, nargs)
adamc@819 1487
adamc@819 1488 val p = case name of
adamc@819 1489 0 => L'.PRecord (ListPair.map
adamc@819 1490 (fn ((name, t), p) => (name, p, t))
adamc@819 1491 (args, argPs))
adamc@819 1492 | _ => L'.PCon (L'.Default, nameOfNum (t1, name), [],
adamc@819 1493 case argPs of
adamc@819 1494 [] => NONE
adamc@819 1495 | [p] => SOME p
adamc@819 1496 | _ => fail 3)
adamc@819 1497 in
adamc@819 1498 SOME ((p, loc) :: restPs)
adamc@819 1499 end
adamc@819 1500 in
adamc@819 1501 recurse cons
adamc@819 1502 end
adamc@819 1503 else
adamc@819 1504 case I (D P, qs) of
adamc@819 1505 NONE => NONE
adamc@819 1506 | SOME ps =>
adamc@819 1507 let
adamc@819 1508 val p = case cons of
adamc@819 1509 [] => L'.PWild
adamc@819 1510 | (0, _) :: _ => L'.PWild
adamc@819 1511 | _ =>
adamc@819 1512 case IS.find (fn _ => true) unused of
adamc@819 1513 NONE => fail 6
adamc@819 1514 | SOME name =>
adamc@819 1515 case ListUtil.search (fn (name', args) =>
adamc@819 1516 if name = name' then
adamc@819 1517 SOME (name', args)
adamc@819 1518 else
adamc@819 1519 NONE) cons of
adamc@819 1520 SOME (n, []) =>
adamc@819 1521 L'.PCon (L'.Default, nameOfNum (t1, n), [], NONE)
adamc@819 1522 | SOME (n, [_]) =>
adamc@819 1523 L'.PCon (L'.Default, nameOfNum (t1, n), [], SOME (L'.PWild, loc))
adamc@819 1524 | _ => fail 7
adamc@819 1525 in
adamc@819 1526 SOME ((p, loc) :: ps)
adamc@819 1527 end
adamc@819 1528 end
adamc@819 1529 in
adamc@819 1530 case I (map (fn x => [x]) ps, [t]) of
adamc@819 1531 NONE => NONE
adamc@819 1532 | SOME [p] => SOME p
adamc@819 1533 | _ => fail 7
adamc@819 1534 end
adamc@819 1535
adamc@819 1536 (*datatype coverage =
adamc@172 1537 Wild
adamc@173 1538 | None
adamc@172 1539 | Datatype of coverage IM.map
adamc@175 1540 | Record of coverage SM.map list
adamc@172 1541
adamc@243 1542 fun c2s c =
adamc@243 1543 case c of
adamc@243 1544 Wild => "Wild"
adamc@243 1545 | None => "None"
adamc@243 1546 | Datatype _ => "Datatype"
adamc@243 1547 | Record _ => "Record"
adamc@243 1548
adamc@629 1549 fun exhaustive (env, t, ps, loc) =
adamc@172 1550 let
adamc@402 1551 fun depth (p, _) =
adamc@402 1552 case p of
adamc@402 1553 L'.PWild => 0
adamc@402 1554 | L'.PVar _ => 0
adamc@402 1555 | L'.PPrim _ => 0
adamc@402 1556 | L'.PCon (_, _, _, NONE) => 1
adamc@402 1557 | L'.PCon (_, _, _, SOME p) => 1 + depth p
adamc@402 1558 | L'.PRecord xps => foldl (fn ((_, p, _), n) => Int.max (depth p, n)) 0 xps
adamc@402 1559
adamc@402 1560 val depth = 1 + foldl (fn (p, n) => Int.max (depth p, n)) 0 ps
adamc@402 1561
adamc@172 1562 fun pcCoverage pc =
adamc@172 1563 case pc of
adamc@172 1564 L'.PConVar n => n
adamc@174 1565 | L'.PConProj (m1, ms, x) =>
adamc@174 1566 let
adamc@174 1567 val (str, sgn) = E.chaseMpath env (m1, ms)
adamc@174 1568 in
adamc@174 1569 case E.projectConstructor env {str = str, sgn = sgn, field = x} of
adamc@174 1570 NONE => raise Fail "exhaustive: Can't project constructor"
adamc@191 1571 | SOME (_, n, _, _, _) => n
adamc@174 1572 end
adamc@172 1573
adamc@172 1574 fun coverage (p, _) =
adamc@172 1575 case p of
adamc@172 1576 L'.PWild => Wild
adamc@172 1577 | L'.PVar _ => Wild
adamc@173 1578 | L'.PPrim _ => None
adamc@191 1579 | L'.PCon (_, pc, _, NONE) => Datatype (IM.insert (IM.empty, pcCoverage pc, Wild))
adamc@191 1580 | L'.PCon (_, pc, _, SOME p) => Datatype (IM.insert (IM.empty, pcCoverage pc, coverage p))
adamc@182 1581 | L'.PRecord xps => Record [foldl (fn ((x, p, _), fmap) =>
adamc@182 1582 SM.insert (fmap, x, coverage p)) SM.empty xps]
adamc@176 1583
adamc@172 1584 fun merge (c1, c2) =
adamc@172 1585 case (c1, c2) of
adamc@173 1586 (None, _) => c2
adamc@173 1587 | (_, None) => c1
adamc@173 1588
adamc@173 1589 | (Wild, _) => Wild
adamc@172 1590 | (_, Wild) => Wild
adamc@172 1591
adamc@172 1592 | (Datatype cm1, Datatype cm2) => Datatype (IM.unionWith merge (cm1, cm2))
adamc@172 1593
adamc@175 1594 | (Record fm1, Record fm2) => Record (fm1 @ fm2)
adamc@175 1595
adamc@175 1596 | _ => None
adamc@175 1597
adamc@172 1598 fun combinedCoverage ps =
adamc@172 1599 case ps of
adamc@172 1600 [] => raise Fail "Empty pattern list for coverage checking"
adamc@172 1601 | [p] => coverage p
adamc@172 1602 | p :: ps => merge (coverage p, combinedCoverage ps)
adamc@172 1603
adamc@402 1604 fun enumerateCases depth t =
adamc@819 1605 (TextIO.print "enum'\n"; if depth <= 0 then
adamc@402 1606 [Wild]
adamc@402 1607 else
adamc@402 1608 let
adamc@819 1609 val dtype =
adamc@402 1610 ListUtil.mapConcat (fn (_, n, to) =>
adamc@402 1611 case to of
adamc@402 1612 NONE => [Datatype (IM.insert (IM.empty, n, Wild))]
adamc@402 1613 | SOME t => map (fn c => Datatype (IM.insert (IM.empty, n, c)))
adamc@819 1614 (enumerateCases (depth-1) t))
adamc@402 1615 in
adamc@628 1616 case #1 (hnormCon env t) of
adamc@402 1617 L'.CNamed n =>
adamc@402 1618 (let
adamc@402 1619 val dt = E.lookupDatatype env n
adamc@402 1620 val cons = E.constructors dt
adamc@175 1621 in
adamc@402 1622 dtype cons
adamc@402 1623 end handle E.UnboundNamed _ => [Wild])
adamc@402 1624 | L'.TRecord c =>
adamc@628 1625 (case #1 (hnormCon env c) of
adamc@402 1626 L'.CRecord (_, xts) =>
adamc@402 1627 let
adamc@628 1628 val xts = map (fn (x, t) => (hnormCon env x, t)) xts
adamc@402 1629
adamc@402 1630 fun exponentiate fs =
adamc@402 1631 case fs of
adamc@402 1632 [] => [SM.empty]
adamc@402 1633 | ((L'.CName x, _), t) :: rest =>
adamc@402 1634 let
adamc@402 1635 val this = enumerateCases depth t
adamc@402 1636 val rest = exponentiate rest
adamc@402 1637 in
adamc@819 1638 TextIO.print ("Before (" ^ Int.toString (length this)
adamc@819 1639 ^ ", " ^ Int.toString (length rest) ^ ")\n");
adamc@402 1640 ListUtil.mapConcat (fn fmap =>
adamc@402 1641 map (fn c => SM.insert (fmap, x, c)) this) rest
adamc@819 1642 before TextIO.print "After\n"
adamc@402 1643 end
adamc@402 1644 | _ => raise Fail "exponentiate: Not CName"
adamc@402 1645 in
adamc@402 1646 if List.exists (fn ((L'.CName _, _), _) => false
adamc@402 1647 | (c, _) => true) xts then
adamc@402 1648 [Wild]
adamc@402 1649 else
adamc@402 1650 map (fn ls => Record [ls]) (exponentiate xts)
adamc@402 1651 end
adamc@402 1652 | _ => [Wild])
adamc@402 1653 | _ => [Wild]
adamc@819 1654 end before TextIO.print "/enum'\n")
adamc@175 1655
adamc@175 1656 fun coverageImp (c1, c2) =
adamc@243 1657 let
adamc@243 1658 val r =
adamc@243 1659 case (c1, c2) of
adamc@243 1660 (Wild, _) => true
adamc@243 1661
adamc@243 1662 | (Datatype cmap1, Datatype cmap2) =>
adamc@243 1663 List.all (fn (n, c2) =>
adamc@243 1664 case IM.find (cmap1, n) of
adamc@243 1665 NONE => false
adamc@243 1666 | SOME c1 => coverageImp (c1, c2)) (IM.listItemsi cmap2)
adamc@243 1667 | (Datatype cmap1, Wild) =>
adamc@243 1668 List.all (fn (n, c1) => coverageImp (c1, Wild)) (IM.listItemsi cmap1)
adamc@243 1669
adamc@243 1670 | (Record fmaps1, Record fmaps2) =>
adamc@243 1671 List.all (fn fmap2 =>
adamc@243 1672 List.exists (fn fmap1 =>
adamc@243 1673 List.all (fn (x, c2) =>
adamc@243 1674 case SM.find (fmap1, x) of
adamc@243 1675 NONE => true
adamc@243 1676 | SOME c1 => coverageImp (c1, c2))
adamc@243 1677 (SM.listItemsi fmap2))
adamc@243 1678 fmaps1) fmaps2
adamc@243 1679
adamc@243 1680 | (Record fmaps1, Wild) =>
adamc@243 1681 List.exists (fn fmap1 =>
adamc@243 1682 List.all (fn (x, c1) => coverageImp (c1, Wild))
adamc@243 1683 (SM.listItemsi fmap1)) fmaps1
adamc@243 1684
adamc@243 1685 | _ => false
adamc@243 1686 in
adamc@243 1687 (*TextIO.print ("coverageImp(" ^ c2s c1 ^ ", " ^ c2s c2 ^ ") = " ^ Bool.toString r ^ "\n");*)
adamc@243 1688 r
adamc@243 1689 end
adamc@175 1690
adamc@172 1691 fun isTotal (c, t) =
adamc@172 1692 case c of
adamc@628 1693 None => false
adamc@628 1694 | Wild => true
adamc@172 1695 | Datatype cm =>
adamc@172 1696 let
adamc@628 1697 val (t, _) = hnormCon env t
adamc@628 1698
adamc@628 1699 val dtype =
adamc@628 1700 List.all (fn (_, n, to) =>
adamc@628 1701 case IM.find (cm, n) of
adamc@628 1702 NONE => false
adamc@628 1703 | SOME c' =>
adamc@628 1704 case to of
adamc@628 1705 NONE => true
adamc@628 1706 | SOME t' => isTotal (c', t'))
adamc@191 1707
adamc@191 1708 fun unapp t =
adamc@191 1709 case t of
adamc@191 1710 L'.CApp ((t, _), _) => unapp t
adamc@191 1711 | _ => t
adamc@172 1712 in
adamc@191 1713 case unapp t of
adamc@172 1714 L'.CNamed n =>
adamc@172 1715 let
adamc@172 1716 val dt = E.lookupDatatype env n
adamc@172 1717 val cons = E.constructors dt
adamc@172 1718 in
adamc@174 1719 dtype cons
adamc@174 1720 end
adamc@174 1721 | L'.CModProj (m1, ms, x) =>
adamc@174 1722 let
adamc@174 1723 val (str, sgn) = E.chaseMpath env (m1, ms)
adamc@174 1724 in
adamc@174 1725 case E.projectDatatype env {str = str, sgn = sgn, field = x} of
adamc@174 1726 NONE => raise Fail "isTotal: Can't project datatype"
adamc@191 1727 | SOME (_, cons) => dtype cons
adamc@172 1728 end
adamc@628 1729 | L'.CError => true
adamc@341 1730 | c =>
adamc@629 1731 (prefaces "Not a datatype" [("loc", PD.string (ErrorMsg.spanToString loc)),
adamc@629 1732 ("c", p_con env (c, ErrorMsg.dummySpan))];
adamc@341 1733 raise Fail "isTotal: Not a datatype")
adamc@172 1734 end
adamc@819 1735 | Record _ => List.all (fn c2 => coverageImp (c, c2))
adamc@819 1736 (TextIO.print "enum\n"; enumerateCases depth t before TextIO.print "/enum\n")
adamc@172 1737 in
adamc@172 1738 isTotal (combinedCoverage ps, t)
adamc@819 1739 end*)
adamc@172 1740
adamc@217 1741 fun unmodCon env (c, loc) =
adamc@217 1742 case c of
adamc@217 1743 L'.CNamed n =>
adamc@217 1744 (case E.lookupCNamed env n of
adamc@217 1745 (_, _, SOME (c as (L'.CModProj _, _))) => unmodCon env c
adamc@217 1746 | _ => (c, loc))
adamc@217 1747 | L'.CModProj (m1, ms, x) =>
adamc@217 1748 let
adamc@217 1749 val (str, sgn) = E.chaseMpath env (m1, ms)
adamc@217 1750 in
adamc@217 1751 case E.projectCon env {str = str, sgn = sgn, field = x} of
adamc@217 1752 NONE => raise Fail "unmodCon: Can't projectCon"
adamc@217 1753 | SOME (_, SOME (c as (L'.CModProj _, _))) => unmodCon env c
adamc@217 1754 | _ => (c, loc)
adamc@217 1755 end
adamc@217 1756 | _ => (c, loc)
adamc@217 1757
adamc@721 1758 fun normClassKey env c =
adamc@467 1759 let
adamc@721 1760 val c = hnormCon env c
adamc@467 1761 in
adamc@467 1762 case #1 c of
adamc@467 1763 L'.CApp (c1, c2) =>
adamc@467 1764 let
adamc@721 1765 val c1 = normClassKey env c1
adamc@721 1766 val c2 = normClassKey env c2
adamc@467 1767 in
adamc@467 1768 (L'.CApp (c1, c2), #2 c)
adamc@467 1769 end
adamc@721 1770 | L'.CRecord (k, xcs) => (L'.CRecord (k, map (fn (x, c) => (normClassKey env x,
adamc@721 1771 normClassKey env c)) xcs), #2 c)
adamc@721 1772 | _ => unmodCon env c
adamc@467 1773 end
adamc@467 1774
adamc@467 1775 fun normClassConstraint env (c, loc) =
adamc@217 1776 case c of
adamc@217 1777 L'.CApp (f, x) =>
adamc@217 1778 let
adamc@721 1779 val f = normClassKey env f
adamc@467 1780 val x = normClassKey env x
adamc@217 1781 in
adamc@467 1782 (L'.CApp (f, x), loc)
adamc@217 1783 end
adamc@674 1784 | L'.TFun (c1, c2) =>
adamc@674 1785 let
adamc@674 1786 val c1 = normClassConstraint env c1
adamc@674 1787 val c2 = normClassConstraint env c2
adamc@674 1788 in
adamc@674 1789 (L'.TFun (c1, c2), loc)
adamc@674 1790 end
adamc@674 1791 | L'.TCFun (expl, x, k, c1) => (L'.TCFun (expl, x, k, normClassConstraint env c1), loc)
adamc@467 1792 | L'.CUnif (_, _, _, ref (SOME c)) => normClassConstraint env c
adamc@721 1793 | _ => unmodCon env (c, loc)
adamc@216 1794
adamc@92 1795 fun elabExp (env, denv) (eAll as (e, loc)) =
adamc@91 1796 let
adamc@280 1797 (*val () = eprefaces "elabExp" [("eAll", SourcePrint.p_exp eAll)];*)
adamc@514 1798 (*val befor = Time.now ()*)
adamc@280 1799
adamc@280 1800 val r = case e of
adamc@91 1801 L.EAnnot (e, t) =>
adamc@91 1802 let
adamc@91 1803 val (e', et, gs1) = elabExp (env, denv) e
adamc@91 1804 val (t', _, gs2) = elabCon (env, denv) t
adamc@91 1805 in
adamc@628 1806 checkCon env e' et t';
adamc@628 1807 (e', t', gs1 @ enD gs2)
adamc@91 1808 end
adamc@34 1809
adamc@91 1810 | L.EPrim p => ((L'.EPrim p, loc), primType env p, [])
adamc@403 1811 | L.EVar ([], s, infer) =>
adamc@91 1812 (case E.lookupE env s of
adamc@91 1813 E.NotBound =>
adamc@91 1814 (expError env (UnboundExp (loc, s));
adamc@91 1815 (eerror, cerror, []))
adamc@629 1816 | E.Rel (n, t) => elabHead (env, denv) infer (L'.ERel n, loc) t
adamc@629 1817 | E.Named (n, t) => elabHead (env, denv) infer (L'.ENamed n, loc) t)
adamc@403 1818 | L.EVar (m1 :: ms, s, infer) =>
adamc@91 1819 (case E.lookupStr env m1 of
adamc@91 1820 NONE => (expError env (UnboundStrInExp (loc, m1));
adamc@91 1821 (eerror, cerror, []))
adamc@91 1822 | SOME (n, sgn) =>
adamc@91 1823 let
adamc@91 1824 val (str, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@91 1825 case E.projectStr env {sgn = sgn, str = str, field = m} of
adamc@91 1826 NONE => (conError env (UnboundStrInCon (loc, m));
adamc@91 1827 (strerror, sgnerror))
adamc@91 1828 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@91 1829 ((L'.StrVar n, loc), sgn) ms
adamc@10 1830
adamc@91 1831 val t = case E.projectVal env {sgn = sgn, str = str, field = s} of
adamc@91 1832 NONE => (expError env (UnboundExp (loc, s));
adamc@91 1833 cerror)
adamc@91 1834 | SOME t => t
adamc@91 1835 in
adamc@629 1836 elabHead (env, denv) infer (L'.EModProj (n, ms, s), loc) t
adamc@91 1837 end)
adamc@86 1838
adamc@349 1839 | L.EWild =>
adamc@210 1840 let
adamc@349 1841 val r = ref NONE
adamc@349 1842 val c = cunif (loc, (L'.KType, loc))
adamc@210 1843 in
adamc@349 1844 ((L'.EUnif r, loc), c, [TypeClass (env, c, r, loc)])
adamc@210 1845 end
adamc@210 1846
adamc@91 1847 | L.EApp (e1, e2) =>
adamc@91 1848 let
adamc@91 1849 val (e1', t1, gs1) = elabExp (env, denv) e1
adamc@403 1850 val (e2', t2, gs2) = elabExp (env, denv) e2
adamc@71 1851
adamc@91 1852 val dom = cunif (loc, ktype)
adamc@91 1853 val ran = cunif (loc, ktype)
adamc@91 1854 val t = (L'.TFun (dom, ran), dummy)
adamc@91 1855 in
adamc@628 1856 checkCon env e1' t1 t;
adamc@628 1857 checkCon env e2' t2 dom;
adamc@628 1858 ((L'.EApp (e1', e2'), loc), ran, gs1 @ gs2)
adamc@91 1859 end
adamc@91 1860 | L.EAbs (x, to, e) =>
adamc@91 1861 let
adamc@91 1862 val (t', gs1) = case to of
adamc@91 1863 NONE => (cunif (loc, ktype), [])
adamc@91 1864 | SOME t =>
adamc@91 1865 let
adamc@91 1866 val (t', tk, gs) = elabCon (env, denv) t
adamc@91 1867 in
adamc@91 1868 checkKind env t' tk ktype;
adamc@91 1869 (t', gs)
adamc@91 1870 end
adamc@467 1871 val dom = normClassConstraint env t'
adamc@467 1872 val (e', et, gs2) = elabExp (E.pushERel env x dom, denv) e
adamc@91 1873 in
adamc@91 1874 ((L'.EAbs (x, t', et, e'), loc),
adamc@91 1875 (L'.TFun (t', et), loc),
adamc@467 1876 enD gs1 @ gs2)
adamc@91 1877 end
adamc@91 1878 | L.ECApp (e, c) =>
adamc@91 1879 let
adamc@91 1880 val (e', et, gs1) = elabExp (env, denv) e
adamc@328 1881 val oldEt = et
adamc@403 1882 val (c', ck, gs2) = elabCon (env, denv) c
adamc@628 1883 val (et', _) = hnormCon env et
adamc@91 1884 in
adamc@91 1885 case et' of
adamc@91 1886 L'.CError => (eerror, cerror, [])
adamc@328 1887 | L'.TCFun (_, x, k, eb) =>
adamc@91 1888 let
adamc@91 1889 val () = checkKind env c' ck k
adamc@91 1890 val eb' = subConInCon (0, c') eb
adamc@339 1891 handle SynUnif => (expError env (Unif ("substitution", loc, eb));
adamc@91 1892 cerror)
adamc@91 1893 in
adamc@328 1894 (*prefaces "Elab ECApp" [("e", SourcePrint.p_exp eAll),
adamc@328 1895 ("et", p_con env oldEt),
adamc@328 1896 ("x", PD.string x),
adamc@328 1897 ("eb", p_con (E.pushCRel env x k) eb),
adamc@328 1898 ("c", p_con env c'),
adamc@328 1899 ("eb'", p_con env eb')];*)
adamc@628 1900 ((L'.ECApp (e', c'), loc), eb', gs1 @ enD gs2)
adamc@91 1901 end
adamc@91 1902
adamc@91 1903 | _ =>
adamc@91 1904 (expError env (WrongForm ("constructor function", e', et));
adamc@91 1905 (eerror, cerror, []))
adamc@91 1906 end
adamc@91 1907 | L.ECAbs (expl, x, k, e) =>
adamc@91 1908 let
adamc@91 1909 val expl' = elabExplicitness expl
adamc@623 1910 val k' = elabKind env k
adamc@328 1911
adamc@328 1912 val env' = E.pushCRel env x k'
adamc@328 1913 val (e', et, gs) = elabExp (env', D.enter denv) e
adamc@91 1914 in
adamc@91 1915 ((L'.ECAbs (expl', x, k', e'), loc),
adamc@91 1916 (L'.TCFun (expl', x, k', et), loc),
adamc@91 1917 gs)
adamc@91 1918 end
adamc@623 1919 | L.EKAbs (x, e) =>
adamc@623 1920 let
adamc@623 1921 val env' = E.pushKRel env x
adamc@623 1922 val (e', et, gs) = elabExp (env', denv) e
adamc@623 1923 in
adamc@623 1924 ((L'.EKAbs (x, e'), loc),
adamc@623 1925 (L'.TKFun (x, et), loc),
adamc@623 1926 gs)
adamc@623 1927 end
adamc@91 1928
adamc@91 1929 | L.EDisjoint (c1, c2, e) =>
adamc@91 1930 let
adamc@91 1931 val (c1', k1, gs1) = elabCon (env, denv) c1
adamc@91 1932 val (c2', k2, gs2) = elabCon (env, denv) c2
adamc@91 1933
adamc@91 1934 val ku1 = kunif loc
adamc@91 1935 val ku2 = kunif loc
adamc@91 1936
adamc@628 1937 val denv' = D.assert env denv (c1', c2')
adamc@628 1938 val (e', t, gs3) = elabExp (env, denv') e
adamc@91 1939 in
adamc@91 1940 checkKind env c1' k1 (L'.KRecord ku1, loc);
adamc@91 1941 checkKind env c2' k2 (L'.KRecord ku2, loc);
adamc@91 1942
adamc@628 1943 (e', (L'.TDisjoint (c1', c2', t), loc), enD gs1 @ enD gs2 @ gs3)
adamc@91 1944 end
adamc@629 1945 | L.EDisjointApp e =>
adamc@629 1946 let
adamc@629 1947 val (e', t, gs1) = elabExp (env, denv) e
adamc@629 1948
adamc@629 1949 val k1 = kunif loc
adamc@629 1950 val c1 = cunif (loc, (L'.KRecord k1, loc))
adamc@629 1951 val k2 = kunif loc
adamc@629 1952 val c2 = cunif (loc, (L'.KRecord k2, loc))
adamc@629 1953 val t' = cunif (loc, ktype)
adamc@629 1954 val () = checkCon env e' t (L'.TDisjoint (c1, c2, t'), loc)
adamc@629 1955 val gs2 = D.prove env denv (c1, c2, loc)
adamc@629 1956 in
adamc@629 1957 (e', t', enD gs2 @ gs1)
adamc@629 1958 end
adamc@91 1959
adamc@91 1960 | L.ERecord xes =>
adamc@91 1961 let
adamc@91 1962 val (xes', gs) = ListUtil.foldlMap (fn ((x, e), gs) =>
adamc@91 1963 let
adamc@91 1964 val (x', xk, gs1) = elabCon (env, denv) x
adamc@91 1965 val (e', et, gs2) = elabExp (env, denv) e
adamc@91 1966 in
adamc@91 1967 checkKind env x' xk kname;
adamc@228 1968 ((x', e', et), enD gs1 @ gs2 @ gs)
adamc@91 1969 end)
adamc@91 1970 [] xes
adamc@91 1971
adamc@91 1972 val k = (L'.KType, loc)
adamc@91 1973
adamc@91 1974 fun prove (xets, gs) =
adamc@91 1975 case xets of
adamc@91 1976 [] => gs
adamc@91 1977 | (x, _, t) :: rest =>
adamc@91 1978 let
adamc@91 1979 val xc = (x, t)
adamc@91 1980 val r1 = (L'.CRecord (k, [xc]), loc)
adamc@91 1981 val gs = foldl (fn ((x', _, t'), gs) =>
adamc@91 1982 let
adamc@91 1983 val xc' = (x', t')
adamc@91 1984 val r2 = (L'.CRecord (k, [xc']), loc)
adamc@91 1985 in
adamc@91 1986 D.prove env denv (r1, r2, loc) @ gs
adamc@91 1987 end)
adamc@91 1988 gs rest
adamc@91 1989 in
adamc@91 1990 prove (rest, gs)
adamc@91 1991 end
adamc@228 1992
adamc@228 1993 val gsD = List.mapPartial (fn Disjoint d => SOME d | _ => NONE) gs
adamc@228 1994 val gsO = List.filter (fn Disjoint _ => false | _ => true) gs
adamc@91 1995 in
adamc@255 1996 (*TextIO.print ("|gsO| = " ^ Int.toString (length gsO) ^ "\n");*)
adamc@91 1997 ((L'.ERecord xes', loc),
adamc@91 1998 (L'.TRecord (L'.CRecord (ktype, map (fn (x', _, et) => (x', et)) xes'), loc), loc),
adamc@228 1999 enD (prove (xes', gsD)) @ gsO)
adamc@91 2000 end
adamc@91 2001
adamc@91 2002 | L.EField (e, c) =>
adamc@91 2003 let
adamc@91 2004 val (e', et, gs1) = elabExp (env, denv) e
adamc@91 2005 val (c', ck, gs2) = elabCon (env, denv) c
adamc@91 2006
adamc@91 2007 val ft = cunif (loc, ktype)
adamc@91 2008 val rest = cunif (loc, ktype_record)
adamc@91 2009 val first = (L'.CRecord (ktype, [(c', ft)]), loc)
adamc@629 2010 val () = checkCon env e' et
adamc@629 2011 (L'.TRecord (L'.CConcat (first, rest), loc), loc);
adamc@628 2012 val gs3 = D.prove env denv (first, rest, loc)
adamc@91 2013 in
adamc@628 2014 ((L'.EField (e', c', {field = ft, rest = rest}), loc), ft, gs1 @ enD gs2 @ enD gs3)
adamc@91 2015 end
adamc@91 2016
adamc@445 2017 | L.EConcat (e1, e2) =>
adamc@339 2018 let
adamc@339 2019 val (e1', e1t, gs1) = elabExp (env, denv) e1
adamc@445 2020 val (e2', e2t, gs2) = elabExp (env, denv) e2
adamc@445 2021
adamc@445 2022 val r1 = cunif (loc, ktype_record)
adamc@445 2023 val r2 = cunif (loc, ktype_record)
adamc@445 2024
adamc@629 2025 val () = checkCon env e1' e1t (L'.TRecord r1, loc)
adamc@629 2026 val () = checkCon env e2' e2t (L'.TRecord r2, loc)
adamc@629 2027
adamc@628 2028 val gs3 = D.prove env denv (r1, r2, loc)
adamc@339 2029 in
adamc@445 2030 ((L'.EConcat (e1', r1, e2', r2), loc),
adamc@445 2031 (L'.TRecord ((L'.CConcat (r1, r2), loc)), loc),
adamc@628 2032 gs1 @ gs2 @ enD gs3)
adamc@339 2033 end
adamc@149 2034 | L.ECut (e, c) =>
adamc@149 2035 let
adamc@149 2036 val (e', et, gs1) = elabExp (env, denv) e
adamc@149 2037 val (c', ck, gs2) = elabCon (env, denv) c
adamc@149 2038
adamc@149 2039 val ft = cunif (loc, ktype)
adamc@149 2040 val rest = cunif (loc, ktype_record)
adamc@149 2041 val first = (L'.CRecord (ktype, [(c', ft)]), loc)
adamc@629 2042
adamc@629 2043 val () = checkCon env e' et
adamc@629 2044 (L'.TRecord (L'.CConcat (first, rest), loc), loc)
adamc@149 2045
adamc@628 2046 val gs3 = D.prove env denv (first, rest, loc)
adamc@149 2047 in
adamc@228 2048 ((L'.ECut (e', c', {field = ft, rest = rest}), loc), (L'.TRecord rest, loc),
adamc@628 2049 gs1 @ enD gs2 @ enD gs3)
adamc@149 2050 end
adamc@493 2051 | L.ECutMulti (e, c) =>
adamc@493 2052 let
adamc@493 2053 val (e', et, gs1) = elabExp (env, denv) e
adamc@493 2054 val (c', ck, gs2) = elabCon (env, denv) c
adamc@493 2055
adamc@493 2056 val rest = cunif (loc, ktype_record)
adamc@629 2057
adamc@629 2058 val () = checkCon env e' et
adamc@629 2059 (L'.TRecord (L'.CConcat (c', rest), loc), loc)
adamc@493 2060
adamc@628 2061 val gs3 = D.prove env denv (c', rest, loc)
adamc@493 2062 in
adamc@493 2063 ((L'.ECutMulti (e', c', {rest = rest}), loc), (L'.TRecord rest, loc),
adamc@628 2064 gs1 @ enD gs2 @ enD gs3)
adamc@493 2065 end
adamc@149 2066
adamc@171 2067 | L.ECase (e, pes) =>
adamc@171 2068 let
adamc@171 2069 val (e', et, gs1) = elabExp (env, denv) e
adamc@171 2070 val result = cunif (loc, (L'.KType, loc))
adamc@171 2071 val (pes', gs) = ListUtil.foldlMap
adamc@171 2072 (fn ((p, e), gs) =>
adamc@171 2073 let
adamc@628 2074 val ((p', pt), (env, _)) = elabPat (p, (env, SS.empty))
adamc@628 2075
adamc@629 2076 val (e', et', gs1) = elabExp (env, denv) e
adamc@171 2077 in
adamc@628 2078 checkPatCon env p' pt et;
adamc@629 2079 checkCon env e' et' result;
adamc@628 2080 ((p', e'), gs1 @ gs)
adamc@171 2081 end)
adamc@171 2082 gs1 pes
adamc@171 2083 in
adamc@819 2084 case exhaustive (env, et, map #1 pes', loc) of
adamc@819 2085 NONE => ()
adamc@819 2086 | SOME p => expError env (Inexhaustive (loc, p));
adamc@172 2087
adamc@628 2088 ((L'.ECase (e', pes', {disc = et, result = result}), loc), result, gs)
adamc@171 2089 end
adamc@447 2090
adamc@447 2091 | L.ELet (eds, e) =>
adamc@447 2092 let
adamc@447 2093 val (eds, (env, gs1)) = ListUtil.foldlMap (elabEdecl denv) (env, []) eds
adamc@447 2094 val (e, t, gs2) = elabExp (env, denv) e
adamc@447 2095 in
adamc@825 2096 ((L'.ELet (eds, e, t), loc), t, gs1 @ gs2)
adamc@447 2097 end
adamc@280 2098 in
adamc@819 2099 (*prefaces "/elabExp" [("e", SourcePrint.p_exp eAll)];*)
adamc@280 2100 r
adamc@91 2101 end
adamc@31 2102
adamc@628 2103 and elabEdecl denv (dAll as (d, loc), (env, gs)) =
adamc@447 2104 let
adamc@447 2105 val r =
adamc@447 2106 case d of
adamc@825 2107 L.EDVal (p, e) =>
adamc@447 2108 let
adamc@825 2109 val ((p', pt), (env', _)) = elabPat (p, (env, SS.empty))
adamc@825 2110 val (e', et, gs1) = elabExp (env, denv) e
adamc@825 2111
adamc@825 2112 val () = checkCon env e' et pt
adamc@825 2113
adamc@825 2114 val pt = normClassConstraint env pt
adamc@447 2115 in
adamc@825 2116 ((L'.EDVal (p', pt, e'), loc), (env', gs1 @ gs))
adamc@447 2117 end
adamc@447 2118 | L.EDValRec vis =>
adamc@447 2119 let
adamc@447 2120 fun allowable (e, _) =
adamc@447 2121 case e of
adamc@447 2122 L.EAbs _ => true
adamc@447 2123 | L.ECAbs (_, _, _, e) => allowable e
adamc@623 2124 | L.EKAbs (_, e) => allowable e
adamc@447 2125 | L.EDisjoint (_, _, e) => allowable e
adamc@447 2126 | _ => false
adamc@447 2127
adamc@447 2128 val (vis, gs) = ListUtil.foldlMap
adamc@447 2129 (fn ((x, co, e), gs) =>
adamc@447 2130 let
adamc@447 2131 val (c', _, gs1) = case co of
adamc@447 2132 NONE => (cunif (loc, ktype), ktype, [])
adamc@447 2133 | SOME c => elabCon (env, denv) c
adamc@447 2134 in
adamc@447 2135 ((x, c', e), enD gs1 @ gs)
adamc@447 2136 end) gs vis
adamc@447 2137
adamc@447 2138 val env = foldl (fn ((x, c', _), env) => E.pushERel env x c') env vis
adamc@447 2139
adamc@447 2140 val (vis, gs) = ListUtil.foldlMap (fn ((x, c', e), gs) =>
adamc@447 2141 let
adamc@447 2142 val (e', et, gs1) = elabExp (env, denv) e
adamc@447 2143 in
adamc@628 2144 checkCon env e' et c';
adamc@447 2145 if allowable e then
adamc@447 2146 ()
adamc@447 2147 else
adamc@447 2148 expError env (IllegalRec (x, e'));
adamc@628 2149 ((x, c', e'), gs1 @ gs)
adamc@447 2150 end) gs vis
adamc@447 2151 in
adamc@447 2152 ((L'.EDValRec vis, loc), (env, gs))
adamc@447 2153 end
adamc@447 2154 in
adamc@447 2155 r
adamc@447 2156 end
adamc@447 2157
adamc@42 2158 val hnormSgn = E.hnormSgn
adamc@31 2159
adamc@210 2160 fun tableOf () = (L'.CModProj (!basis_r, [], "sql_table"), ErrorMsg.dummySpan)
adamc@338 2161 fun sequenceOf () = (L'.CModProj (!basis_r, [], "sql_sequence"), ErrorMsg.dummySpan)
adamc@754 2162 fun viewOf () = (L'.CModProj (!basis_r, [], "sql_view"), ErrorMsg.dummySpan)
adamc@754 2163 fun queryOf () = (L'.CModProj (!basis_r, [], "sql_query"), ErrorMsg.dummySpan)
adamc@459 2164 fun cookieOf () = (L'.CModProj (!basis_r, [], "http_cookie"), ErrorMsg.dummySpan)
adamc@718 2165 fun styleOf () = (L'.CModProj (!basis_r, [], "css_class"), ErrorMsg.dummySpan)
adamc@205 2166
adamc@469 2167 fun dopenConstraints (loc, env, denv) {str, strs} =
adamc@469 2168 case E.lookupStr env str of
adamc@469 2169 NONE => (strError env (UnboundStr (loc, str));
adamc@469 2170 denv)
adamc@469 2171 | SOME (n, sgn) =>
adamc@469 2172 let
adamc@469 2173 val (st, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@469 2174 case E.projectStr env {str = str, sgn = sgn, field = m} of
adamc@469 2175 NONE => (strError env (UnboundStr (loc, m));
adamc@469 2176 (strerror, sgnerror))
adamc@469 2177 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@469 2178 ((L'.StrVar n, loc), sgn) strs
adamc@469 2179
adamc@469 2180 val cso = E.projectConstraints env {sgn = sgn, str = st}
adamc@469 2181 in
adamc@628 2182 case cso of
adamc@628 2183 NONE => (strError env (UnboundStr (loc, str));
adamc@628 2184 denv)
adamc@628 2185 | SOME cs => foldl (fn ((c1, c2), denv) =>
adamc@628 2186 D.assert env denv (c1, c2)) denv cs
adamc@469 2187 end
adamc@469 2188
adamc@88 2189 fun elabSgn_item ((sgi, loc), (env, denv, gs)) =
adamc@76 2190 case sgi of
adamc@76 2191 L.SgiConAbs (x, k) =>
adamc@76 2192 let
adamc@623 2193 val k' = elabKind env k
adamc@31 2194
adamc@76 2195 val (env', n) = E.pushCNamed env x k' NONE
adamc@76 2196 in
adamc@88 2197 ([(L'.SgiConAbs (x, n, k'), loc)], (env', denv, gs))
adamc@76 2198 end
adamc@31 2199
adamc@76 2200 | L.SgiCon (x, ko, c) =>
adamc@76 2201 let
adamc@76 2202 val k' = case ko of
adamc@76 2203 NONE => kunif loc
adamc@623 2204 | SOME k => elabKind env k
adamc@31 2205
adamc@83 2206 val (c', ck, gs') = elabCon (env, denv) c
adamc@76 2207 val (env', n) = E.pushCNamed env x k' (SOME c')
adamc@76 2208 in
adamc@76 2209 checkKind env c' ck k';
adamc@31 2210
adamc@88 2211 ([(L'.SgiCon (x, n, k', c'), loc)], (env', denv, gs' @ gs))
adamc@76 2212 end
adamc@31 2213
adamc@805 2214 | L.SgiDatatype dts =>
adamc@157 2215 let
adamc@157 2216 val k = (L'.KType, loc)
adamc@805 2217
adamc@805 2218 val (dts, env) = ListUtil.foldlMap (fn ((x, xs, xcs), env) =>
adamc@805 2219 let
adamc@805 2220 val k' = foldl (fn (_, k') => (L'.KArrow (k, k'), loc)) k xs
adamc@805 2221 val (env, n) = E.pushCNamed env x k' NONE
adamc@805 2222 in
adamc@805 2223 ((x, n, xs, xcs), env)
adamc@805 2224 end)
adamc@805 2225 env dts
adamc@805 2226
adamc@805 2227 val (dts, env) = ListUtil.foldlMap
adamc@805 2228 (fn ((x, n, xs, xcs), env) =>
adamc@805 2229 let
adamc@805 2230 val t = (L'.CNamed n, loc)
adamc@805 2231 val nxs = length xs - 1
adamc@805 2232 val t = ListUtil.foldli (fn (i, _, t) =>
adamc@805 2233 (L'.CApp (t, (L'.CRel (nxs - i), loc)), loc)) t xs
adamc@805 2234
adamc@805 2235 val (env', denv') = foldl (fn (x, (env', denv')) =>
adamc@805 2236 (E.pushCRel env' x k,
adamc@805 2237 D.enter denv')) (env, denv) xs
adamc@805 2238
adamc@805 2239 val (xcs, (used, env, gs)) =
adamc@805 2240 ListUtil.foldlMap
adamc@805 2241 (fn ((x, to), (used, env, gs)) =>
adamc@805 2242 let
adamc@805 2243 val (to, t, gs') = case to of
adamc@805 2244 NONE => (NONE, t, gs)
adamc@805 2245 | SOME t' =>
adamc@805 2246 let
adamc@805 2247 val (t', tk, gs') =
adamc@805 2248 elabCon (env', denv') t'
adamc@805 2249 in
adamc@805 2250 checkKind env' t' tk k;
adamc@805 2251 (SOME t',
adamc@805 2252 (L'.TFun (t', t), loc),
adamc@805 2253 gs' @ gs)
adamc@805 2254 end
adamc@805 2255 val t = foldl (fn (x, t) => (L'.TCFun (L'.Implicit, x, k, t), loc))
adamc@805 2256 t xs
adamc@805 2257
adamc@805 2258 val (env, n') = E.pushENamed env x t
adamc@805 2259 in
adamc@805 2260 if SS.member (used, x) then
adamc@805 2261 strError env (DuplicateConstructor (x, loc))
adamc@805 2262 else
adamc@805 2263 ();
adamc@805 2264 ((x, n', to), (SS.add (used, x), env, gs'))
adamc@805 2265 end)
adamc@805 2266 (SS.empty, env, []) xcs
adamc@805 2267 in
adamc@805 2268 ((x, n, xs, xcs), E.pushDatatype env n xs xcs)
adamc@805 2269 end)
adamc@805 2270 env dts
adamc@157 2271 in
adamc@805 2272 ([(L'.SgiDatatype dts, loc)], (env, denv, gs))
adamc@157 2273 end
adamc@156 2274
adamc@158 2275 | L.SgiDatatypeImp (_, [], _) => raise Fail "Empty SgiDatatypeImp"
adamc@158 2276
adamc@158 2277 | L.SgiDatatypeImp (x, m1 :: ms, s) =>
adamc@158 2278 (case E.lookupStr env m1 of
adamc@158 2279 NONE => (strError env (UnboundStr (loc, m1));
adamc@158 2280 ([], (env, denv, gs)))
adamc@158 2281 | SOME (n, sgn) =>
adamc@158 2282 let
adamc@158 2283 val (str, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@158 2284 case E.projectStr env {sgn = sgn, str = str, field = m} of
adamc@158 2285 NONE => (conError env (UnboundStrInCon (loc, m));
adamc@158 2286 (strerror, sgnerror))
adamc@158 2287 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@158 2288 ((L'.StrVar n, loc), sgn) ms
adamc@158 2289 in
adamc@628 2290 case hnormCon env (L'.CModProj (n, ms, s), loc) of
adamc@628 2291 (L'.CModProj (n, ms, s), _) =>
adamc@161 2292 (case E.projectDatatype env {sgn = sgn, str = str, field = s} of
adamc@161 2293 NONE => (conError env (UnboundDatatype (loc, s));
adamc@628 2294 ([], (env, denv, [])))
adamc@191 2295 | SOME (xs, xncs) =>
adamc@161 2296 let
adamc@161 2297 val k = (L'.KType, loc)
adamc@191 2298 val k' = foldl (fn (_, k') => (L'.KArrow (k, k'), loc)) k xs
adamc@191 2299
adamc@161 2300 val t = (L'.CModProj (n, ms, s), loc)
adamc@191 2301 val (env, n') = E.pushCNamed env x k' (SOME t)
adamc@191 2302 val env = E.pushDatatype env n' xs xncs
adamc@158 2303
adamc@161 2304 val t = (L'.CNamed n', loc)
adamc@161 2305 val env = foldl (fn ((x, n, to), env) =>
adamc@161 2306 let
adamc@161 2307 val t = case to of
adamc@161 2308 NONE => t
adamc@161 2309 | SOME t' => (L'.TFun (t', t), loc)
adamc@191 2310
adamc@191 2311 val t = foldr (fn (x, t) =>
adamc@191 2312 (L'.TCFun (L'.Implicit, x, k, t), loc))
adamc@191 2313 t xs
adamc@161 2314 in
adamc@161 2315 E.pushENamedAs env x n t
adamc@161 2316 end) env xncs
adamc@161 2317 in
adamc@628 2318 ([(L'.SgiDatatypeImp (x, n', n, ms, s, xs, xncs), loc)], (env, denv, []))
adamc@161 2319 end)
adamc@161 2320 | _ => (strError env (NotDatatype loc);
adamc@161 2321 ([], (env, denv, [])))
adamc@158 2322 end)
adamc@156 2323
adamc@76 2324 | L.SgiVal (x, c) =>
adamc@76 2325 let
adamc@83 2326 val (c', ck, gs') = elabCon (env, denv) c
adamc@31 2327
adamc@721 2328 val old = c'
adamc@711 2329 val c' = normClassConstraint env c'
adamc@76 2330 val (env', n) = E.pushENamed env x c'
adamc@76 2331 in
adamc@623 2332 (unifyKinds env ck ktype
adamc@706 2333 handle KUnify ue => strError env (NotType (loc, ck, ue)));
adamc@31 2334
adamc@467 2335 ([(L'.SgiVal (x, n, c'), loc)], (env', denv, gs' @ gs))
adamc@76 2336 end
adamc@31 2337
adamc@707 2338 | L.SgiTable (x, c, pe, ce) =>
adamc@706 2339 let
adamc@706 2340 val cstK = (L'.KRecord (L'.KRecord (L'.KUnit, loc), loc), loc)
adamc@706 2341 val x' = x ^ "_hidden_constraints"
adamc@706 2342 val (env', hidden_n) = E.pushCNamed env x' cstK NONE
adamc@706 2343 val hidden = (L'.CNamed hidden_n, loc)
adamc@706 2344
adamc@706 2345 val (c', ck, gs') = elabCon (env, denv) c
adamc@707 2346 val pkey = cunif (loc, cstK)
adamc@706 2347 val visible = cunif (loc, cstK)
adamc@706 2348 val uniques = (L'.CConcat (visible, hidden), loc)
adamc@706 2349
adamc@706 2350 val ct = tableOf ()
adamc@706 2351 val ct = (L'.CApp (ct, c'), loc)
adamc@707 2352 val ct = (L'.CApp (ct, (L'.CConcat (pkey, uniques), loc)), loc)
adamc@707 2353
adamc@707 2354 val (pe', pet, gs'') = elabExp (env', denv) pe
adamc@707 2355 val gs'' = List.mapPartial (fn Disjoint x => SOME x
adamc@707 2356 | _ => NONE) gs''
adamc@707 2357
adamc@707 2358 val pst = (L'.CModProj (!basis_r, [], "primary_key"), loc)
adamc@707 2359 val pst = (L'.CApp (pst, c'), loc)
adamc@707 2360 val pst = (L'.CApp (pst, pkey), loc)
adamc@706 2361
adamc@706 2362 val (env', n) = E.pushENamed env' x ct
adamc@706 2363
adamc@707 2364 val (ce', cet, gs''') = elabExp (env', denv) ce
adamc@707 2365 val gs''' = List.mapPartial (fn Disjoint x => SOME x
adamc@707 2366 | _ => NONE) gs'''
adamc@706 2367
adamc@706 2368 val cst = (L'.CModProj (!basis_r, [], "sql_constraints"), loc)
adamc@706 2369 val cst = (L'.CApp (cst, c'), loc)
adamc@706 2370 val cst = (L'.CApp (cst, visible), loc)
adamc@706 2371 in
adamc@706 2372 checkKind env c' ck (L'.KRecord (L'.KType, loc), loc);
adamc@707 2373 checkCon env' pe' pet pst;
adamc@707 2374 checkCon env' ce' cet cst;
adamc@706 2375
adamc@706 2376 ([(L'.SgiConAbs (x', hidden_n, cstK), loc),
adamc@707 2377 (L'.SgiVal (x, n, ct), loc)], (env', denv, gs''' @ gs'' @ gs' @ gs))
adamc@706 2378 end
adamc@706 2379
adamc@76 2380 | L.SgiStr (x, sgn) =>
adamc@76 2381 let
adamc@83 2382 val (sgn', gs') = elabSgn (env, denv) sgn
adamc@76 2383 val (env', n) = E.pushStrNamed env x sgn'
adamc@76 2384 in
adamc@88 2385 ([(L'.SgiStr (x, n, sgn'), loc)], (env', denv, gs' @ gs))
adamc@76 2386 end
adamc@31 2387
adamc@76 2388 | L.SgiSgn (x, sgn) =>
adamc@76 2389 let
adamc@83 2390 val (sgn', gs') = elabSgn (env, denv) sgn
adamc@76 2391 val (env', n) = E.pushSgnNamed env x sgn'
adamc@76 2392 in
adamc@88 2393 ([(L'.SgiSgn (x, n, sgn'), loc)], (env', denv, gs' @ gs))
adamc@76 2394 end
adamc@31 2395
adamc@76 2396 | L.SgiInclude sgn =>
adamc@76 2397 let
adamc@83 2398 val (sgn', gs') = elabSgn (env, denv) sgn
adamc@76 2399 in
adamc@76 2400 case #1 (hnormSgn env sgn') of
adamc@76 2401 L'.SgnConst sgis =>
adamc@88 2402 (sgis, (foldl (fn (sgi, env) => E.sgiBinds env sgi) env sgis, denv, gs' @ gs))
adamc@76 2403 | _ => (sgnError env (NotIncludable sgn');
adamc@88 2404 ([], (env, denv, [])))
adamc@88 2405 end
adamc@88 2406
adamc@88 2407 | L.SgiConstraint (c1, c2) =>
adamc@88 2408 let
adamc@88 2409 val (c1', k1, gs1) = elabCon (env, denv) c1
adamc@88 2410 val (c2', k2, gs2) = elabCon (env, denv) c2
adamc@88 2411
adamc@628 2412 val denv = D.assert env denv (c1', c2')
adamc@88 2413 in
adamc@88 2414 checkKind env c1' k1 (L'.KRecord (kunif loc), loc);
adamc@88 2415 checkKind env c2' k2 (L'.KRecord (kunif loc), loc);
adamc@88 2416
adamc@628 2417 ([(L'.SgiConstraint (c1', c2'), loc)], (env, denv, gs1 @ gs2))
adamc@76 2418 end
adamc@31 2419
adamc@563 2420 | L.SgiClassAbs (x, k) =>
adamc@211 2421 let
adamc@623 2422 val k = elabKind env k
adamc@711 2423 val (env, n) = E.pushCNamed env x k NONE
adamc@211 2424 val env = E.pushClass env n
adamc@211 2425 in
adamc@563 2426 ([(L'.SgiClassAbs (x, n, k), loc)], (env, denv, []))
adamc@211 2427 end
adamc@211 2428
adamc@563 2429 | L.SgiClass (x, k, c) =>
adamc@211 2430 let
adamc@623 2431 val k = elabKind env k
adamc@211 2432 val (c', ck, gs) = elabCon (env, denv) c
adamc@711 2433 val (env, n) = E.pushCNamed env x k (SOME c')
adamc@211 2434 val env = E.pushClass env n
adamc@211 2435 in
adamc@711 2436 checkKind env c' ck k;
adamc@563 2437 ([(L'.SgiClass (x, n, k, c'), loc)], (env, denv, []))
adamc@211 2438 end
adamc@211 2439
adamc@83 2440 and elabSgn (env, denv) (sgn, loc) =
adamc@31 2441 case sgn of
adamc@31 2442 L.SgnConst sgis =>
adamc@31 2443 let
adamc@88 2444 val (sgis', (_, _, gs)) = ListUtil.foldlMapConcat elabSgn_item (env, denv, []) sgis
adamc@62 2445
adamc@62 2446 val _ = foldl (fn ((sgi, loc), (cons, vals, sgns, strs)) =>
adamc@62 2447 case sgi of
adamc@62 2448 L'.SgiConAbs (x, _, _) =>
adamc@62 2449 (if SS.member (cons, x) then
adamc@62 2450 sgnError env (DuplicateCon (loc, x))
adamc@62 2451 else
adamc@62 2452 ();
adamc@62 2453 (SS.add (cons, x), vals, sgns, strs))
adamc@62 2454 | L'.SgiCon (x, _, _, _) =>
adamc@62 2455 (if SS.member (cons, x) then
adamc@62 2456 sgnError env (DuplicateCon (loc, x))
adamc@62 2457 else
adamc@62 2458 ();
adamc@62 2459 (SS.add (cons, x), vals, sgns, strs))
adamc@805 2460 | L'.SgiDatatype dts =>
adamc@156 2461 let
adamc@805 2462 val (cons, vals) =
adamc@805 2463 let
adamc@805 2464 fun doOne ((x, _, _, xncs), (cons, vals)) =
adamc@805 2465 let
adamc@805 2466 val vals = foldl (fn ((x, _, _), vals) =>
adamc@805 2467 (if SS.member (vals, x) then
adamc@805 2468 sgnError env (DuplicateVal (loc, x))
adamc@805 2469 else
adamc@805 2470 ();
adamc@805 2471 SS.add (vals, x)))
adamc@805 2472 vals xncs
adamc@805 2473 in
adamc@805 2474 if SS.member (cons, x) then
adamc@805 2475 sgnError env (DuplicateCon (loc, x))
adamc@805 2476 else
adamc@805 2477 ();
adamc@805 2478 (SS.add (cons, x), vals)
adamc@805 2479 end
adamc@805 2480 in
adamc@805 2481 foldl doOne (cons, vals) dts
adamc@805 2482 end
adamc@156 2483 in
adamc@805 2484 (cons, vals, sgns, strs)
adamc@156 2485 end
adamc@191 2486 | L'.SgiDatatypeImp (x, _, _, _, _, _, _) =>
adamc@156 2487 (if SS.member (cons, x) then
adamc@156 2488 sgnError env (DuplicateCon (loc, x))
adamc@156 2489 else
adamc@156 2490 ();
adamc@156 2491 (SS.add (cons, x), vals, sgns, strs))
adamc@62 2492 | L'.SgiVal (x, _, _) =>
adamc@62 2493 (if SS.member (vals, x) then
adamc@62 2494 sgnError env (DuplicateVal (loc, x))
adamc@62 2495 else
adamc@62 2496 ();
adamc@62 2497 (cons, SS.add (vals, x), sgns, strs))
adamc@62 2498 | L'.SgiSgn (x, _, _) =>
adamc@62 2499 (if SS.member (sgns, x) then
adamc@62 2500 sgnError env (DuplicateSgn (loc, x))
adamc@62 2501 else
adamc@62 2502 ();
adamc@62 2503 (cons, vals, SS.add (sgns, x), strs))
adamc@62 2504 | L'.SgiStr (x, _, _) =>
adamc@62 2505 (if SS.member (strs, x) then
adamc@62 2506 sgnError env (DuplicateStr (loc, x))
adamc@62 2507 else
adamc@62 2508 ();
adamc@88 2509 (cons, vals, sgns, SS.add (strs, x)))
adamc@203 2510 | L'.SgiConstraint _ => (cons, vals, sgns, strs)
adamc@563 2511 | L'.SgiClassAbs (x, _, _) =>
adamc@211 2512 (if SS.member (cons, x) then
adamc@211 2513 sgnError env (DuplicateCon (loc, x))
adamc@211 2514 else
adamc@211 2515 ();
adamc@211 2516 (SS.add (cons, x), vals, sgns, strs))
adamc@563 2517 | L'.SgiClass (x, _, _, _) =>
adamc@211 2518 (if SS.member (cons, x) then
adamc@211 2519 sgnError env (DuplicateCon (loc, x))
adamc@211 2520 else
adamc@211 2521 ();
adamc@460 2522 (SS.add (cons, x), vals, sgns, strs)))
adamc@62 2523 (SS.empty, SS.empty, SS.empty, SS.empty) sgis'
adamc@31 2524 in
adamc@83 2525 ((L'.SgnConst sgis', loc), gs)
adamc@31 2526 end
adamc@31 2527 | L.SgnVar x =>
adamc@31 2528 (case E.lookupSgn env x of
adamc@31 2529 NONE =>
adamc@31 2530 (sgnError env (UnboundSgn (loc, x));
adamc@83 2531 ((L'.SgnError, loc), []))
adamc@83 2532 | SOME (n, sgis) => ((L'.SgnVar n, loc), []))
adamc@41 2533 | L.SgnFun (m, dom, ran) =>
adamc@41 2534 let
adamc@83 2535 val (dom', gs1) = elabSgn (env, denv) dom
adamc@41 2536 val (env', n) = E.pushStrNamed env m dom'
adamc@469 2537 val denv' = dopenConstraints (loc, env', denv) {str = m, strs = []}
adamc@469 2538 val (ran', gs2) = elabSgn (env', denv') ran
adamc@41 2539 in
adamc@83 2540 ((L'.SgnFun (m, n, dom', ran'), loc), gs1 @ gs2)
adamc@41 2541 end
adamc@42 2542 | L.SgnWhere (sgn, x, c) =>
adamc@42 2543 let
adamc@83 2544 val (sgn', ds1) = elabSgn (env, denv) sgn
adamc@83 2545 val (c', ck, ds2) = elabCon (env, denv) c
adamc@42 2546 in
adamc@42 2547 case #1 (hnormSgn env sgn') of
adamc@83 2548 L'.SgnError => (sgnerror, [])
adamc@42 2549 | L'.SgnConst sgis =>
adamc@75 2550 if List.exists (fn (L'.SgiConAbs (x', _, k), _) =>
adamc@75 2551 x' = x andalso
adamc@623 2552 (unifyKinds env k ck
adamc@75 2553 handle KUnify x => sgnError env (WhereWrongKind x);
adamc@42 2554 true)
adamc@42 2555 | _ => false) sgis then
adamc@83 2556 ((L'.SgnWhere (sgn', x, c'), loc), ds1 @ ds2)
adamc@42 2557 else
adamc@42 2558 (sgnError env (UnWhereable (sgn', x));
adamc@83 2559 (sgnerror, []))
adamc@42 2560 | _ => (sgnError env (UnWhereable (sgn', x));
adamc@83 2561 (sgnerror, []))
adamc@42 2562 end
adamc@59 2563 | L.SgnProj (m, ms, x) =>
adamc@59 2564 (case E.lookupStr env m of
adamc@59 2565 NONE => (strError env (UnboundStr (loc, m));
adamc@83 2566 (sgnerror, []))
adamc@59 2567 | SOME (n, sgn) =>
adamc@59 2568 let
adamc@59 2569 val (str, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@59 2570 case E.projectStr env {sgn = sgn, str = str, field = m} of
adamc@59 2571 NONE => (strError env (UnboundStr (loc, m));
adamc@59 2572 (strerror, sgnerror))
adamc@59 2573 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@59 2574 ((L'.StrVar n, loc), sgn) ms
adamc@59 2575 in
adamc@59 2576 case E.projectSgn env {sgn = sgn, str = str, field = x} of
adamc@59 2577 NONE => (sgnError env (UnboundSgn (loc, x));
adamc@83 2578 (sgnerror, []))
adamc@83 2579 | SOME _ => ((L'.SgnProj (n, ms, x), loc), [])
adamc@59 2580 end)
adamc@59 2581
adamc@31 2582
adamc@706 2583 and selfify env {str, strs, sgn} =
adamc@66 2584 case #1 (hnormSgn env sgn) of
adamc@66 2585 L'.SgnError => sgn
adamc@66 2586 | L'.SgnVar _ => sgn
adamc@66 2587
adamc@66 2588 | L'.SgnConst sgis =>
adamc@805 2589 (L'.SgnConst (ListUtil.mapConcat (fn (L'.SgiConAbs (x, n, k), loc) =>
adamc@805 2590 [(L'.SgiCon (x, n, k, (L'.CModProj (str, strs, x), loc)), loc)]
adamc@805 2591 | (L'.SgiDatatype dts, loc) =>
adamc@805 2592 map (fn (x, n, xs, xncs) => (L'.SgiDatatypeImp (x, n, str, strs, x, xs, xncs), loc)) dts
adamc@563 2593 | (L'.SgiClassAbs (x, n, k), loc) =>
adamc@805 2594 [(L'.SgiClass (x, n, k, (L'.CModProj (str, strs, x), loc)), loc)]
adamc@66 2595 | (L'.SgiStr (x, n, sgn), loc) =>
adamc@805 2596 [(L'.SgiStr (x, n, selfify env {str = str, strs = strs @ [x], sgn = sgn}), loc)]
adamc@805 2597 | x => [x]) sgis), #2 sgn)
adamc@66 2598 | L'.SgnFun _ => sgn
adamc@66 2599 | L'.SgnWhere _ => sgn
adamc@66 2600 | L'.SgnProj (m, ms, x) =>
adamc@66 2601 case E.projectSgn env {str = foldl (fn (m, str) => (L'.StrProj (str, m), #2 sgn))
adamc@66 2602 (L'.StrVar m, #2 sgn) ms,
adamc@66 2603 sgn = #2 (E.lookupStrNamed env m),
adamc@66 2604 field = x} of
adamc@66 2605 NONE => raise Fail "Elaborate.selfify: projectSgn returns NONE"
adamc@66 2606 | SOME sgn => selfify env {str = str, strs = strs, sgn = sgn}
adamc@66 2607
adamc@706 2608 and selfifyAt env {str, sgn} =
adamc@66 2609 let
adamc@66 2610 fun self (str, _) =
adamc@66 2611 case str of
adamc@66 2612 L'.StrVar x => SOME (x, [])
adamc@66 2613 | L'.StrProj (str, x) =>
adamc@66 2614 (case self str of
adamc@66 2615 NONE => NONE
adamc@66 2616 | SOME (m, ms) => SOME (m, ms @ [x]))
adamc@66 2617 | _ => NONE
adamc@66 2618 in
adamc@66 2619 case self str of
adamc@66 2620 NONE => sgn
adamc@66 2621 | SOME (str, strs) => selfify env {sgn = sgn, str = str, strs = strs}
adamc@66 2622 end
adamc@66 2623
adamc@706 2624 and dopen env {str, strs, sgn} =
adamc@66 2625 let
adamc@66 2626 val m = foldl (fn (m, str) => (L'.StrProj (str, m), #2 sgn))
adamc@66 2627 (L'.StrVar str, #2 sgn) strs
adamc@66 2628 in
adamc@66 2629 case #1 (hnormSgn env sgn) of
adamc@66 2630 L'.SgnConst sgis =>
adamc@805 2631 ListUtil.foldlMapConcat
adamc@805 2632 (fn ((sgi, loc), env') =>
adamc@805 2633 let
adamc@805 2634 val d =
adamc@805 2635 case sgi of
adamc@805 2636 L'.SgiConAbs (x, n, k) =>
adamc@805 2637 let
adamc@805 2638 val c = (L'.CModProj (str, strs, x), loc)
adamc@805 2639 in
adamc@805 2640 [(L'.DCon (x, n, k, c), loc)]
adamc@805 2641 end
adamc@805 2642 | L'.SgiCon (x, n, k, c) =>
adamc@805 2643 [(L'.DCon (x, n, k, (L'.CModProj (str, strs, x), loc)), loc)]
adamc@805 2644 | L'.SgiDatatype dts =>
adamc@805 2645 map (fn (x, n, xs, xncs) => (L'.DDatatypeImp (x, n, str, strs, x, xs, xncs), loc)) dts
adamc@805 2646 | L'.SgiDatatypeImp (x, n, m1, ms, x', xs, xncs) =>
adamc@805 2647 [(L'.DDatatypeImp (x, n, m1, ms, x', xs, xncs), loc)]
adamc@805 2648 | L'.SgiVal (x, n, t) =>
adamc@805 2649 [(L'.DVal (x, n, t, (L'.EModProj (str, strs, x), loc)), loc)]
adamc@805 2650 | L'.SgiStr (x, n, sgn) =>
adamc@805 2651 [(L'.DStr (x, n, sgn, (L'.StrProj (m, x), loc)), loc)]
adamc@805 2652 | L'.SgiSgn (x, n, sgn) =>
adamc@805 2653 [(L'.DSgn (x, n, (L'.SgnProj (str, strs, x), loc)), loc)]
adamc@805 2654 | L'.SgiConstraint (c1, c2) =>
adamc@805 2655 [(L'.DConstraint (c1, c2), loc)]
adamc@805 2656 | L'.SgiClassAbs (x, n, k) =>
adamc@805 2657 let
adamc@805 2658 val c = (L'.CModProj (str, strs, x), loc)
adamc@805 2659 in
adamc@805 2660 [(L'.DCon (x, n, k, c), loc)]
adamc@805 2661 end
adamc@805 2662 | L'.SgiClass (x, n, k, _) =>
adamc@805 2663 let
adamc@805 2664 val c = (L'.CModProj (str, strs, x), loc)
adamc@805 2665 in
adamc@805 2666 [(L'.DCon (x, n, k, c), loc)]
adamc@805 2667 end
adamc@805 2668 in
adamc@805 2669 (d, foldl (fn (d, env') => E.declBinds env' d) env' d)
adamc@805 2670 end)
adamc@805 2671 env sgis
adamc@66 2672 | _ => (strError env (UnOpenable sgn);
adamc@628 2673 ([], env))
adamc@66 2674 end
adamc@66 2675
adamc@706 2676 and sgiOfDecl (d, loc) =
adamc@31 2677 case d of
adamc@123 2678 L'.DCon (x, n, k, c) => [(L'.SgiCon (x, n, k, c), loc)]
adamc@156 2679 | L'.DDatatype x => [(L'.SgiDatatype x, loc)]
adamc@156 2680 | L'.DDatatypeImp x => [(L'.SgiDatatypeImp x, loc)]
adamc@123 2681 | L'.DVal (x, n, t, _) => [(L'.SgiVal (x, n, t), loc)]
adamc@123 2682 | L'.DValRec vis => map (fn (x, n, t, _) => (L'.SgiVal (x, n, t), loc)) vis
adamc@123 2683 | L'.DSgn (x, n, sgn) => [(L'.SgiSgn (x, n, sgn), loc)]
adamc@123 2684 | L'.DStr (x, n, sgn, _) => [(L'.SgiStr (x, n, sgn), loc)]
adamc@123 2685 | L'.DFfiStr (x, n, sgn) => [(L'.SgiStr (x, n, sgn), loc)]
adamc@123 2686 | L'.DConstraint cs => [(L'.SgiConstraint cs, loc)]
adamc@123 2687 | L'.DExport _ => []
adamc@707 2688 | L'.DTable (tn, x, n, c, _, pc, _, cc) =>
adamc@707 2689 [(L'.SgiVal (x, n, (L'.CApp ((L'.CApp (tableOf (), c), loc),
adamc@707 2690 (L'.CConcat (pc, cc), loc)), loc)), loc)]
adamc@460 2691 | L'.DSequence (tn, x, n) => [(L'.SgiVal (x, n, sequenceOf ()), loc)]
adamc@754 2692 | L'.DView (tn, x, n, _, c) =>
adamc@754 2693 [(L'.SgiVal (x, n, (L'.CApp (viewOf (), c), loc)), loc)]
adamc@563 2694 | L'.DClass (x, n, k, c) => [(L'.SgiClass (x, n, k, c), loc)]
adamc@271 2695 | L'.DDatabase _ => []
adamc@460 2696 | L'.DCookie (tn, x, n, c) => [(L'.SgiVal (x, n, (L'.CApp (cookieOf (), c), loc)), loc)]
adamc@720 2697 | L'.DStyle (tn, x, n) => [(L'.SgiVal (x, n, styleOf ()), loc)]
adamc@88 2698
adamc@706 2699 and subSgn env sgn1 (sgn2 as (_, loc2)) =
adamc@469 2700 ((*prefaces "subSgn" [("sgn1", p_sgn env sgn1),
adamc@469 2701 ("sgn2", p_sgn env sgn2)];*)
adamc@35 2702 case (#1 (hnormSgn env sgn1), #1 (hnormSgn env sgn2)) of
adamc@31 2703 (L'.SgnError, _) => ()
adamc@31 2704 | (_, L'.SgnError) => ()
adamc@31 2705
adamc@31 2706 | (L'.SgnConst sgis1, L'.SgnConst sgis2) =>
adamc@31 2707 let
adamc@362 2708 (*val () = prefaces "subSgn" [("sgn1", p_sgn env sgn1),
adamc@362 2709 ("sgn2", p_sgn env sgn2),
adamc@362 2710 ("sgis1", p_sgn env (L'.SgnConst sgis1, loc2)),
adamc@362 2711 ("sgis2", p_sgn env (L'.SgnConst sgis2, loc2))]*)
adamc@362 2712
adamc@628 2713 fun folder (sgi2All as (sgi, loc), env) =
adamc@31 2714 let
adamc@362 2715 (*val () = prefaces "folder" [("sgis1", p_sgn env (L'.SgnConst sgis1, loc2))]*)
adamc@362 2716
adamc@805 2717 fun seek' f p =
adamc@31 2718 let
adamc@628 2719 fun seek env ls =
adamc@31 2720 case ls of
adamc@805 2721 [] => f env
adamc@31 2722 | h :: t =>
adamc@469 2723 case p (env, h) of
adamc@469 2724 NONE =>
adamc@469 2725 let
adamc@469 2726 val env = case #1 h of
adamc@469 2727 L'.SgiCon (x, n, k, c) =>
adamc@471 2728 if E.checkENamed env n then
adamc@471 2729 env
adamc@471 2730 else
adamc@471 2731 E.pushCNamedAs env x n k (SOME c)
adamc@469 2732 | L'.SgiConAbs (x, n, k) =>
adamc@471 2733 if E.checkENamed env n then
adamc@471 2734 env
adamc@471 2735 else
adamc@471 2736 E.pushCNamedAs env x n k NONE
adamc@469 2737 | _ => env
adamc@469 2738 in
adamc@628 2739 seek (E.sgiBinds env h) t
adamc@469 2740 end
adamc@88 2741 | SOME envs => envs
adamc@31 2742 in
adamc@628 2743 seek env sgis1
adamc@31 2744 end
adamc@805 2745
adamc@805 2746 val seek = seek' (fn env => (sgnError env (UnmatchedSgi sgi2All);
adamc@805 2747 env))
adamc@31 2748 in
adamc@31 2749 case sgi of
adamc@31 2750 L'.SgiConAbs (x, n2, k2) =>
adamc@469 2751 seek (fn (env, sgi1All as (sgi1, _)) =>
adamc@31 2752 let
adamc@41 2753 fun found (x', n1, k1, co1) =
adamc@41 2754 if x = x' then
adamc@41 2755 let
adamc@623 2756 val () = unifyKinds env k1 k2
adamc@41 2757 handle KUnify (k1, k2, err) =>
adamc@41 2758 sgnError env (SgiWrongKind (sgi1All, k1, sgi2All, k2, err))
adamc@41 2759 val env = E.pushCNamedAs env x n1 k1 co1
adamc@41 2760 in
adamc@41 2761 SOME (if n1 = n2 then
adamc@41 2762 env
adamc@41 2763 else
adamc@628 2764 E.pushCNamedAs env x n2 k2 (SOME (L'.CNamed n1, loc2)))
adamc@41 2765 end
adamc@41 2766 else
adamc@41 2767 NONE
adamc@31 2768 in
adamc@31 2769 case sgi1 of
adamc@41 2770 L'.SgiConAbs (x', n1, k1) => found (x', n1, k1, NONE)
adamc@41 2771 | L'.SgiCon (x', n1, k1, c1) => found (x', n1, k1, SOME c1)
adamc@805 2772 | L'.SgiDatatype dts =>
adamc@191 2773 let
adamc@191 2774 val k = (L'.KType, loc)
adamc@805 2775
adamc@805 2776 fun search dts =
adamc@805 2777 case dts of
adamc@805 2778 [] => NONE
adamc@805 2779 | (x', n1, xs, _) :: dts =>
adamc@805 2780 let
adamc@805 2781 val k' = foldl (fn (_, k') => (L'.KArrow (k, k'), loc)) k xs
adamc@805 2782 in
adamc@805 2783 case found (x', n1, k', NONE) of
adamc@805 2784 NONE => search dts
adamc@805 2785 | x => x
adamc@805 2786 end
adamc@191 2787 in
adamc@805 2788 search dts
adamc@191 2789 end
adamc@191 2790 | L'.SgiDatatypeImp (x', n1, m1, ms, s, xs, _) =>
adamc@191 2791 let
adamc@191 2792 val k = (L'.KType, loc)
adamc@191 2793 val k' = foldl (fn (_, k') => (L'.KArrow (k, k'), loc)) k xs
adamc@191 2794 in
adamc@191 2795 found (x', n1, k', SOME (L'.CModProj (m1, ms, s), loc))
adamc@191 2796 end
adamc@711 2797 | L'.SgiClassAbs (x', n1, k) => found (x', n1, k, NONE)
adamc@711 2798 | L'.SgiClass (x', n1, k, c) => found (x', n1, k, SOME c)
adamc@31 2799 | _ => NONE
adamc@31 2800 end)
adamc@31 2801
adamc@31 2802 | L'.SgiCon (x, n2, k2, c2) =>
adamc@469 2803 seek (fn (env, sgi1All as (sgi1, _)) =>
adamc@211 2804 let
adamc@211 2805 fun found (x', n1, k1, c1) =
adamc@211 2806 if x = x' then
adamc@211 2807 let
adamc@327 2808 fun good () =
adamc@327 2809 let
adamc@327 2810 val env = E.pushCNamedAs env x n2 k2 (SOME c2)
adamc@327 2811 val env = if n1 = n2 then
adamc@327 2812 env
adamc@327 2813 else
adamc@327 2814 E.pushCNamedAs env x n1 k1 (SOME c1)
adamc@327 2815 in
adamc@628 2816 SOME env
adamc@327 2817 end
adamc@211 2818 in
adamc@628 2819 (unifyCons env c1 c2;
adamc@628 2820 good ())
adamc@211 2821 handle CUnify (c1, c2, err) =>
adamc@211 2822 (sgnError env (SgiWrongCon (sgi1All, c1, sgi2All, c2, err));
adamc@211 2823 good ())
adamc@211 2824 end
adamc@211 2825 else
adamc@211 2826 NONE
adamc@211 2827 in
adamc@211 2828 case sgi1 of
adamc@211 2829 L'.SgiCon (x', n1, k1, c1) => found (x', n1, k1, c1)
adamc@711 2830 | L'.SgiClass (x', n1, k1, c1) => found (x', n1, k1, c1)
adamc@211 2831 | _ => NONE
adamc@211 2832 end)
adamc@31 2833
adamc@805 2834 | L'.SgiDatatype dts2 =>
adamc@805 2835 let
adamc@805 2836 fun found' (sgi1All, (x1, n1, xs1, xncs1), (x2, n2, xs2, xncs2), env) =
adamc@805 2837 if x1 <> x2 then
adamc@805 2838 NONE
adamc@805 2839 else
adamc@805 2840 let
adamc@805 2841 fun mismatched ue =
adamc@805 2842 (sgnError env (SgiMismatchedDatatypes (sgi1All, sgi2All, ue));
adamc@805 2843 SOME env)
adamc@805 2844
adamc@805 2845 val k = (L'.KType, loc)
adamc@805 2846 val k' = foldl (fn (_, k') => (L'.KArrow (k, k'), loc)) k xs1
adamc@805 2847
adamc@805 2848 fun good () =
adamc@805 2849 let
adamc@805 2850 val env = E.sgiBinds env sgi1All
adamc@805 2851 val env = if n1 = n2 then
adamc@805 2852 env
adamc@805 2853 else
adamc@805 2854 E.pushCNamedAs env x1 n2 k'
adamc@805 2855 (SOME (L'.CNamed n1, loc))
adamc@805 2856 in
adamc@805 2857 SOME env
adamc@805 2858 end
adamc@805 2859
adamc@805 2860 val env = E.pushCNamedAs env x1 n1 k' NONE
adamc@805 2861 val env = if n1 = n2 then
adamc@805 2862 env
adamc@805 2863 else
adamc@805 2864 E.pushCNamedAs env x1 n2 k' (SOME (L'.CNamed n1, loc))
adamc@805 2865 val env = foldl (fn (x, env) => E.pushCRel env x k) env xs1
adamc@805 2866 fun xncBad ((x1, _, t1), (x2, _, t2)) =
adamc@805 2867 String.compare (x1, x2) <> EQUAL
adamc@805 2868 orelse case (t1, t2) of
adamc@805 2869 (NONE, NONE) => false
adamc@805 2870 | (SOME t1, SOME t2) =>
adamc@805 2871 (unifyCons env t1 t2; false)
adamc@805 2872 | _ => true
adamc@805 2873 in
adamc@805 2874 (if xs1 <> xs2
adamc@805 2875 orelse length xncs1 <> length xncs2
adamc@805 2876 orelse ListPair.exists xncBad (xncs1, xncs2) then
adamc@805 2877 mismatched NONE
adamc@160 2878 else
adamc@805 2879 good ())
adamc@805 2880 handle CUnify ue => mismatched (SOME ue)
adamc@805 2881 end
adamc@805 2882 in
adamc@805 2883 seek'
adamc@805 2884 (fn _ =>
adamc@805 2885 let
adamc@805 2886 fun seekOne (dt2, env) =
adamc@805 2887 seek (fn (env, sgi1All as (sgi1, _)) =>
adamc@805 2888 case sgi1 of
adamc@805 2889 L'.SgiDatatypeImp (x', n1, _, _, _, xs, xncs1) =>
adamc@805 2890 found' (sgi1All, (x', n1, xs, xncs1), dt2, env)
adamc@805 2891 | _ => NONE)
adamc@805 2892
adamc@805 2893 fun seekAll (dts, env) =
adamc@805 2894 case dts of
adamc@805 2895 [] => env
adamc@805 2896 | dt :: dts => seekAll (dts, seekOne (dt, env))
adamc@805 2897 in
adamc@805 2898 seekAll (dts2, env)
adamc@805 2899 end)
adamc@805 2900 (fn (env, sgi1All as (sgi1, _)) =>
adamc@805 2901 let
adamc@805 2902 fun found dts1 =
adamc@805 2903 let
adamc@805 2904 fun iter (dts1, dts2, env) =
adamc@805 2905 case (dts1, dts2) of
adamc@805 2906 ([], []) => SOME env
adamc@805 2907 | (dt1 :: dts1, dt2 :: dts2) =>
adamc@805 2908 (case found' (sgi1All, dt1, dt2, env) of
adamc@805 2909 NONE => NONE
adamc@805 2910 | SOME env => iter (dts1, dts2, env))
adamc@805 2911 | _ => NONE
adamc@805 2912 in
adamc@805 2913 iter (dts1, dts2, env)
adamc@805 2914 end
adamc@805 2915 in
adamc@805 2916 case sgi1 of
adamc@805 2917 L'.SgiDatatype dts1 => found dts1
adamc@805 2918 | _ => NONE
adamc@805 2919 end)
adamc@805 2920 end
adamc@156 2921
adamc@191 2922 | L'.SgiDatatypeImp (x, n2, m12, ms2, s2, xs, _) =>
adamc@469 2923 seek (fn (env, sgi1All as (sgi1, _)) =>
adamc@158 2924 case sgi1 of
adamc@191 2925 L'.SgiDatatypeImp (x', n1, m11, ms1, s1, _, _) =>
adamc@158 2926 if x = x' then
adamc@158 2927 let
adamc@158 2928 val k = (L'.KType, loc)
adamc@191 2929 val k' = foldl (fn (_, k') => (L'.KArrow (k, k'), loc)) k xs
adamc@158 2930 val t1 = (L'.CModProj (m11, ms1, s1), loc)
adamc@158 2931 val t2 = (L'.CModProj (m12, ms2, s2), loc)
adamc@158 2932
adamc@158 2933 fun good () =
adamc@158 2934 let
adamc@191 2935 val env = E.pushCNamedAs env x n1 k' (SOME t1)
adamc@191 2936 val env = E.pushCNamedAs env x n2 k' (SOME t2)
adamc@158 2937 in
adamc@628 2938 SOME env
adamc@158 2939 end
adamc@158 2940 in
adamc@628 2941 (unifyCons env t1 t2;
adamc@628 2942 good ())
adamc@158 2943 handle CUnify (c1, c2, err) =>
adamc@158 2944 (sgnError env (SgiWrongCon (sgi1All, c1, sgi2All, c2, err));
adamc@158 2945 good ())
adamc@158 2946 end
adamc@158 2947 else
adamc@158 2948 NONE
adamc@158 2949
adamc@158 2950 | _ => NONE)
adamc@156 2951
adamc@32 2952 | L'.SgiVal (x, n2, c2) =>
adamc@469 2953 seek (fn (env, sgi1All as (sgi1, _)) =>
adamc@32 2954 case sgi1 of
adamc@41 2955 L'.SgiVal (x', n1, c1) =>
adamc@41 2956 if x = x' then
adamc@628 2957 (unifyCons env c1 c2;
adamc@628 2958 SOME env)
adamc@86 2959 handle CUnify (c1, c2, err) =>
adamc@86 2960 (sgnError env (SgiWrongCon (sgi1All, c1, sgi2All, c2, err));
adamc@628 2961 SOME env)
adamc@41 2962 else
adamc@41 2963 NONE
adamc@32 2964 | _ => NONE)
adamc@32 2965
adamc@33 2966 | L'.SgiStr (x, n2, sgn2) =>
adamc@469 2967 seek (fn (env, sgi1All as (sgi1, _)) =>
adamc@33 2968 case sgi1 of
adamc@41 2969 L'.SgiStr (x', n1, sgn1) =>
adamc@41 2970 if x = x' then
adamc@66 2971 let
adamc@628 2972 val () = subSgn env sgn1 sgn2
adamc@66 2973 val env = E.pushStrNamedAs env x n1 sgn1
adamc@66 2974 val env = if n1 = n2 then
adamc@66 2975 env
adamc@66 2976 else
adamc@66 2977 E.pushStrNamedAs env x n2
adamc@66 2978 (selfifyAt env {str = (L'.StrVar n1, #2 sgn2),
adamc@66 2979 sgn = sgn2})
adamc@66 2980 in
adamc@628 2981 SOME env
adamc@66 2982 end
adamc@41 2983 else
adamc@41 2984 NONE
adamc@33 2985 | _ => NONE)
adamc@59 2986
adamc@59 2987 | L'.SgiSgn (x, n2, sgn2) =>
adamc@469 2988 seek (fn (env, sgi1All as (sgi1, _)) =>
adamc@59 2989 case sgi1 of
adamc@59 2990 L'.SgiSgn (x', n1, sgn1) =>
adamc@59 2991 if x = x' then
adamc@65 2992 let
adamc@628 2993 val () = subSgn env sgn1 sgn2
adamc@628 2994 val () = subSgn env sgn2 sgn1
adamc@65 2995
adamc@65 2996 val env = E.pushSgnNamedAs env x n2 sgn2
adamc@65 2997 val env = if n1 = n2 then
adamc@65 2998 env
adamc@65 2999 else
adamc@65 3000 E.pushSgnNamedAs env x n1 sgn2
adamc@65 3001 in
adamc@628 3002 SOME env
adamc@65 3003 end
adamc@59 3004 else
adamc@59 3005 NONE
adamc@59 3006 | _ => NONE)
adamc@88 3007
adamc@88 3008 | L'.SgiConstraint (c2, d2) =>
adamc@469 3009 seek (fn (env, sgi1All as (sgi1, _)) =>
adamc@88 3010 case sgi1 of
adamc@88 3011 L'.SgiConstraint (c1, d1) =>
adamc@628 3012 if consEq env (c1, c2) andalso consEq env (d1, d2) then
adamc@628 3013 SOME env
adamc@88 3014 else
adamc@88 3015 NONE
adamc@88 3016 | _ => NONE)
adamc@203 3017
adamc@563 3018 | L'.SgiClassAbs (x, n2, k2) =>
adamc@469 3019 seek (fn (env, sgi1All as (sgi1, _)) =>
adamc@211 3020 let
adamc@563 3021 fun found (x', n1, k1, co) =
adamc@211 3022 if x = x' then
adamc@211 3023 let
adamc@623 3024 val () = unifyKinds env k1 k2
adamc@563 3025 handle KUnify (k1, k2, err) =>
adamc@563 3026 sgnError env (SgiWrongKind (sgi1All, k1, sgi2All, k2, err))
adamc@563 3027
adamc@711 3028 val env = E.pushCNamedAs env x n1 k1 co
adamc@211 3029 in
adamc@211 3030 SOME (if n1 = n2 then
adamc@211 3031 env
adamc@211 3032 else
adamc@711 3033 E.pushCNamedAs env x n2 k1 (SOME (L'.CNamed n1, loc2)))
adamc@211 3034 end
adamc@211 3035 else
adamc@211 3036 NONE
adamc@211 3037 in
adamc@211 3038 case sgi1 of
adamc@563 3039 L'.SgiClassAbs (x', n1, k1) => found (x', n1, k1, NONE)
adamc@563 3040 | L'.SgiClass (x', n1, k1, c) => found (x', n1, k1, SOME c)
adamc@211 3041 | _ => NONE
adamc@211 3042 end)
adamc@563 3043 | L'.SgiClass (x, n2, k2, c2) =>
adamc@469 3044 seek (fn (env, sgi1All as (sgi1, _)) =>
adamc@211 3045 let
adamc@563 3046 fun found (x', n1, k1, c1) =
adamc@211 3047 if x = x' then
adamc@211 3048 let
adamc@623 3049 val () = unifyKinds env k1 k2
adamc@563 3050 handle KUnify (k1, k2, err) =>
adamc@563 3051 sgnError env (SgiWrongKind (sgi1All, k1, sgi2All, k2, err))
adamc@563 3052
adamc@218 3053 fun good () =
adamc@218 3054 let
adamc@711 3055 val env = E.pushCNamedAs env x n2 k2 (SOME c2)
adamc@218 3056 val env = if n1 = n2 then
adamc@218 3057 env
adamc@218 3058 else
adamc@711 3059 E.pushCNamedAs env x n1 k2 (SOME c1)
adamc@218 3060 in
adamc@628 3061 SOME env
adamc@218 3062 end
adamc@211 3063 in
adamc@628 3064 (unifyCons env c1 c2;
adamc@628 3065 good ())
adamc@211 3066 handle CUnify (c1, c2, err) =>
adamc@211 3067 (sgnError env (SgiWrongCon (sgi1All, c1, sgi2All, c2, err));
adamc@211 3068 good ())
adamc@211 3069 end
adamc@211 3070 else
adamc@211 3071 NONE
adamc@211 3072 in
adamc@211 3073 case sgi1 of
adamc@563 3074 L'.SgiClass (x', n1, k1, c1) => found (x', n1, k1, c1)
adamc@211 3075 | _ => NONE
adamc@211 3076 end)
adamc@31 3077 end
adamc@31 3078 in
adamc@628 3079 ignore (foldl folder env sgis2)
adamc@31 3080 end
adamc@31 3081
adamc@41 3082 | (L'.SgnFun (m1, n1, dom1, ran1), L'.SgnFun (m2, n2, dom2, ran2)) =>
adamc@43 3083 let
adamc@480 3084 val ran2 =
adamc@43 3085 if n1 = n2 then
adamc@480 3086 ran2
adamc@43 3087 else
adamc@480 3088 subStrInSgn (n2, n1) ran2
adamc@43 3089 in
adamc@628 3090 subSgn env dom2 dom1;
adamc@628 3091 subSgn (E.pushStrNamedAs env m1 n1 dom2) ran1 ran2
adamc@43 3092 end
adamc@41 3093
adamc@469 3094 | _ => sgnError env (SgnWrongForm (sgn1, sgn2)))
adamc@41 3095
adamc@61 3096
adamc@706 3097 and positive self =
adamc@312 3098 let
adamc@312 3099 open L
adamc@312 3100
adamc@312 3101 fun none (c, _) =
adamc@312 3102 case c of
adamc@312 3103 CAnnot (c, _) => none c
adamc@312 3104
adamc@312 3105 | TFun (c1, c2) => none c1 andalso none c2
adamc@312 3106 | TCFun (_, _, _, c) => none c
adamc@312 3107 | TRecord c => none c
adamc@312 3108
adamc@312 3109 | CVar ([], x) => x <> self
adamc@312 3110 | CVar _ => true
adamc@312 3111 | CApp (c1, c2) => none c1 andalso none c2
adamc@312 3112 | CAbs _ => false
adamc@628 3113 | TDisjoint (c1, c2, c3) => none c1 andalso none c2 andalso none c3
adamc@312 3114
adamc@623 3115 | CKAbs _ => false
adamc@623 3116 | TKFun _ => false
adamc@623 3117
adamc@312 3118 | CName _ => true
adamc@312 3119
adamc@312 3120 | CRecord xcs => List.all (fn (c1, c2) => none c1 andalso none c2) xcs
adamc@312 3121 | CConcat (c1, c2) => none c1 andalso none c2
adamc@621 3122 | CMap => true
adamc@312 3123
adamc@312 3124 | CUnit => true
adamc@312 3125
adamc@312 3126 | CTuple cs => List.all none cs
adamc@312 3127 | CProj (c, _) => none c
adamc@312 3128
adamc@312 3129 | CWild _ => false
adamc@312 3130
adamc@312 3131 fun pos (c, _) =
adamc@312 3132 case c of
adamc@312 3133 CAnnot (c, _) => pos c
adamc@312 3134
adamc@312 3135 | TFun (c1, c2) => none c1 andalso pos c2
adamc@312 3136 | TCFun (_, _, _, c) => pos c
adamc@312 3137 | TRecord c => pos c
adamc@312 3138
adamc@312 3139 | CVar _ => true
adamc@312 3140 | CApp (c1, c2) => pos c1 andalso none c2
adamc@312 3141 | CAbs _ => false
adamc@628 3142 | TDisjoint (c1, c2, c3) => none c1 andalso none c2 andalso none c3
adamc@312 3143
adamc@623 3144 | CKAbs _ => false
adamc@623 3145 | TKFun _ => false
adamc@623 3146
adamc@312 3147 | CName _ => true
adamc@312 3148
adamc@312 3149 | CRecord xcs => List.all (fn (c1, c2) => none c1 andalso pos c2) xcs
adamc@312 3150 | CConcat (c1, c2) => pos c1 andalso pos c2
adamc@621 3151 | CMap => true
adamc@312 3152
adamc@312 3153 | CUnit => true
adamc@312 3154
adamc@312 3155 | CTuple cs => List.all pos cs
adamc@312 3156 | CProj (c, _) => pos c
adamc@312 3157
adamc@312 3158 | CWild _ => false
adamc@312 3159 in
adamc@312 3160 pos
adamc@312 3161 end
adamc@312 3162
adamc@706 3163 and wildifyStr env (str, sgn) =
adamc@325 3164 case #1 (hnormSgn env sgn) of
adamc@325 3165 L'.SgnConst sgis =>
adamc@325 3166 (case #1 str of
adamc@325 3167 L.StrConst ds =>
adamc@325 3168 let
adamc@493 3169 fun decompileKind (k, loc) =
adamc@493 3170 case k of
adamc@493 3171 L'.KType => SOME (L.KType, loc)
adamc@493 3172 | L'.KArrow (k1, k2) =>
adamc@493 3173 (case (decompileKind k1, decompileKind k2) of
adamc@493 3174 (SOME k1, SOME k2) => SOME (L.KArrow (k1, k2), loc)
adamc@493 3175 | _ => NONE)
adamc@493 3176 | L'.KName => SOME (L.KName, loc)
adamc@493 3177 | L'.KRecord k =>
adamc@493 3178 (case decompileKind k of
adamc@493 3179 SOME k => SOME (L.KRecord k, loc)
adamc@493 3180 | _ => NONE)
adamc@493 3181 | L'.KUnit => SOME (L.KUnit, loc)
adamc@493 3182 | L'.KTuple ks =>
adamc@493 3183 let
adamc@493 3184 val ks' = List.mapPartial decompileKind ks
adamc@493 3185 in
adamc@493 3186 if length ks' = length ks then
adamc@493 3187 SOME (L.KTuple ks', loc)
adamc@493 3188 else
adamc@493 3189 NONE
adamc@493 3190 end
adamc@493 3191
adamc@493 3192 | L'.KError => NONE
adamc@493 3193 | L'.KUnif (_, _, ref (SOME k)) => decompileKind k
adamc@493 3194 | L'.KUnif _ => NONE
adamc@493 3195
adamc@623 3196 | L'.KRel _ => NONE
adamc@623 3197 | L'.KFun _ => NONE
adamc@623 3198
adamc@325 3199 fun decompileCon env (c, loc) =
adamc@325 3200 case c of
adamc@325 3201 L'.CRel i =>
adamc@325 3202 let
adamc@325 3203 val (s, _) = E.lookupCRel env i
adamc@325 3204 in
adamc@325 3205 SOME (L.CVar ([], s), loc)
adamc@325 3206 end
adamc@325 3207 | L'.CNamed i =>
adamc@325 3208 let
adamc@325 3209 val (s, _, _) = E.lookupCNamed env i
adamc@325 3210 in
adamc@325 3211 SOME (L.CVar ([], s), loc)
adamc@325 3212 end
adamc@325 3213 | L'.CModProj (m1, ms, x) =>
adamc@325 3214 let
adamc@325 3215 val (s, _) = E.lookupStrNamed env m1
adamc@325 3216 in
adamc@325 3217 SOME (L.CVar (s :: ms, x), loc)
adamc@325 3218 end
adamc@325 3219 | L'.CName s => SOME (L.CName s, loc)
adamc@325 3220 | L'.CRecord (_, xcs) =>
adamc@325 3221 let
adamc@325 3222 fun fields xcs =
adamc@325 3223 case xcs of
adamc@325 3224 [] => SOME []
adamc@325 3225 | (x, t) :: xcs =>
adamc@325 3226 case (decompileCon env x, decompileCon env t, fields xcs) of
adamc@325 3227 (SOME x, SOME t, SOME xcs) => SOME ((x, t) :: xcs)
adamc@325 3228 | _ => NONE
adamc@325 3229 in
adamc@325 3230 Option.map (fn xcs => (L.CRecord xcs, loc))
adamc@325 3231 (fields xcs)
adamc@325 3232 end
adamc@325 3233 | L'.CConcat (c1, c2) =>
adamc@325 3234 (case (decompileCon env c1, decompileCon env c2) of
adamc@325 3235 (SOME c1, SOME c2) => SOME (L.CConcat (c1, c2), loc)
adamc@325 3236 | _ => NONE)
adamc@325 3237 | L'.CUnit => SOME (L.CUnit, loc)
adamc@325 3238
adamc@325 3239 | _ => NONE
adamc@325 3240
adamc@469 3241 val (neededC, constraints, neededV, _) =
adamc@469 3242 foldl (fn ((sgi, loc), (neededC, constraints, neededV, env')) =>
adamc@325 3243 let
adamc@469 3244 val (needed, constraints, neededV) =
adamc@325 3245 case sgi of
adamc@493 3246 L'.SgiConAbs (x, _, k) => (SM.insert (neededC, x, k), constraints, neededV)
adamc@469 3247 | L'.SgiConstraint cs => (neededC, (env', cs, loc) :: constraints, neededV)
adamc@469 3248
adamc@469 3249 | L'.SgiVal (x, _, t) =>
adamc@469 3250 let
adamc@469 3251 fun default () = (neededC, constraints, neededV)
adamc@469 3252
adamc@469 3253 val t = normClassConstraint env' t
adamc@469 3254 in
adamc@469 3255 case #1 t of
adamc@469 3256 L'.CApp (f, _) =>
adamc@634 3257 if isClassOrFolder env' f then
adamc@469 3258 (neededC, constraints, SS.add (neededV, x))
adamc@469 3259 else
adamc@469 3260 default ()
adamc@469 3261 | _ => default ()
adamc@469 3262 end
adamc@469 3263
adamc@469 3264 | _ => (neededC, constraints, neededV)
adamc@325 3265 in
adamc@469 3266 (needed, constraints, neededV, E.sgiBinds env' (sgi, loc))
adamc@325 3267 end)
adamc@493 3268 (SM.empty, [], SS.empty, env) sgis
adamc@325 3269
adamc@634 3270 val (neededC, neededV) =
adamc@634 3271 foldl (fn ((d, _), needed as (neededC, neededV)) =>
adamc@634 3272 case d of
adamc@634 3273 L.DCon (x, _, _) => ((#1 (SM.remove (neededC, x)), neededV)
adamc@634 3274 handle NotFound =>
adamc@634 3275 needed)
adamc@634 3276 | L.DClass (x, _, _) => ((#1 (SM.remove (neededC, x)), neededV)
adamc@634 3277 handle NotFound => needed)
adamc@634 3278 | L.DVal (x, _, _) => ((neededC, SS.delete (neededV, x))
adamc@634 3279 handle NotFound => needed)
adamc@634 3280 | L.DOpen _ => (SM.empty, SS.empty)
adamc@634 3281 | _ => needed)
adamc@634 3282 (neededC, neededV) ds
adamc@469 3283
adamc@469 3284 val ds' = List.mapPartial (fn (env', (c1, c2), loc) =>
adamc@325 3285 case (decompileCon env' c1, decompileCon env' c2) of
adamc@325 3286 (SOME c1, SOME c2) =>
adamc@325 3287 SOME (L.DConstraint (c1, c2), loc)
adamc@325 3288 | _ => NONE) constraints
adamc@469 3289
adamc@469 3290 val ds' =
adamc@469 3291 case SS.listItems neededV of
adamc@469 3292 [] => ds'
adamc@469 3293 | xs =>
adamc@469 3294 let
adamc@469 3295 val ewild = (L.EWild, #2 str)
adamc@469 3296 val ds'' = map (fn x => (L.DVal (x, NONE, ewild), #2 str)) xs
adamc@469 3297 in
adamc@469 3298 ds'' @ ds'
adamc@469 3299 end
adamc@469 3300
adamc@469 3301 val ds' =
adamc@493 3302 case SM.listItemsi neededC of
adamc@469 3303 [] => ds'
adamc@469 3304 | xs =>
adamc@469 3305 let
adamc@493 3306 val ds'' = map (fn (x, k) =>
adamc@493 3307 let
adamc@493 3308 val k =
adamc@493 3309 case decompileKind k of
adamc@493 3310 NONE => (L.KWild, #2 str)
adamc@493 3311 | SOME k => k
adamc@493 3312 val cwild = (L.CWild k, #2 str)
adamc@493 3313 in
adamc@493 3314 (L.DCon (x, NONE, cwild), #2 str)
adamc@493 3315 end) xs
adamc@469 3316 in
adamc@469 3317 ds'' @ ds'
adamc@469 3318 end
adamc@325 3319 in
adamc@469 3320 (L.StrConst (ds @ ds'), #2 str)
adamc@325 3321 end
adamc@325 3322 | _ => str)
adamc@325 3323 | _ => str
adamc@325 3324
adamc@706 3325 and elabDecl (dAll as (d, loc), (env, denv, gs)) =
adamc@255 3326 let
adamc@255 3327 (*val () = preface ("elabDecl", SourcePrint.p_decl (d, loc))*)
adamc@514 3328 (*val befor = Time.now ()*)
adamc@255 3329
adamc@255 3330 val r =
adamc@255 3331 case d of
adamc@255 3332 L.DCon (x, ko, c) =>
adamc@255 3333 let
adamc@255 3334 val k' = case ko of
adamc@255 3335 NONE => kunif loc
adamc@623 3336 | SOME k => elabKind env k
adamc@255 3337
adamc@255 3338 val (c', ck, gs') = elabCon (env, denv) c
adamc@255 3339 val (env', n) = E.pushCNamed env x k' (SOME c')
adamc@255 3340 in
adamc@255 3341 checkKind env c' ck k';
adamc@255 3342
adamc@255 3343 ([(L'.DCon (x, n, k', c'), loc)], (env', denv, enD gs' @ gs))
adamc@255 3344 end
adamc@805 3345 | L.DDatatype dts =>
adamc@255 3346 let
adamc@255 3347 val k = (L'.KType, loc)
adamc@805 3348
adamc@805 3349 val (dts, env) = ListUtil.foldlMap
adamc@805 3350 (fn ((x, xs, xcs), env) =>
adamc@805 3351 let
adamc@805 3352 val k' = foldl (fn (_, k') => (L'.KArrow (k, k'), loc)) k xs
adamc@805 3353 val (env, n) = E.pushCNamed env x k' NONE
adamc@805 3354 in
adamc@805 3355 ((x, n, xs, xcs), env)
adamc@805 3356 end)
adamc@805 3357 env dts
adamc@805 3358
adamc@805 3359 val (dts, (env, gs')) = ListUtil.foldlMap
adamc@805 3360 (fn ((x, n, xs, xcs), (env, gs')) =>
adamc@805 3361 let
adamc@805 3362 val t = (L'.CNamed n, loc)
adamc@805 3363 val nxs = length xs - 1
adamc@805 3364 val t = ListUtil.foldli
adamc@805 3365 (fn (i, _, t) =>
adamc@805 3366 (L'.CApp (t, (L'.CRel (nxs - i), loc)), loc)) t xs
adamc@805 3367
adamc@805 3368 val (env', denv') = foldl (fn (x, (env', denv')) =>
adamc@805 3369 (E.pushCRel env' x k,
adamc@805 3370 D.enter denv')) (env, denv) xs
adamc@805 3371
adamc@805 3372 val (xcs, (used, env, gs')) =
adamc@805 3373 ListUtil.foldlMap
adamc@805 3374 (fn ((x, to), (used, env, gs)) =>
adamc@805 3375 let
adamc@805 3376 val (to, t, gs') = case to of
adamc@805 3377 NONE => (NONE, t, gs)
adamc@805 3378 | SOME t' =>
adamc@805 3379 let
adamc@805 3380 val (t', tk, gs') = elabCon (env', denv') t'
adamc@805 3381 in
adamc@805 3382 checkKind env' t' tk k;
adamc@805 3383 (SOME t', (L'.TFun (t', t), loc), enD gs' @ gs)
adamc@805 3384 end
adamc@805 3385 val t = foldr (fn (x, t) => (L'.TCFun (L'.Implicit, x, k, t), loc)) t xs
adamc@805 3386
adamc@805 3387 val (env, n') = E.pushENamed env x t
adamc@805 3388 in
adamc@805 3389 if SS.member (used, x) then
adamc@805 3390 strError env (DuplicateConstructor (x, loc))
adamc@805 3391 else
adamc@805 3392 ();
adamc@805 3393 ((x, n', to), (SS.add (used, x), env, gs'))
adamc@805 3394 end)
adamc@805 3395 (SS.empty, env, gs') xcs
adamc@805 3396 in
adamc@805 3397 ((x, n, xs, xcs), (E.pushDatatype env n xs xcs, gs'))
adamc@805 3398 end)
adamc@805 3399 (env, []) dts
adamc@255 3400 in
adamc@805 3401 ([(L'.DDatatype dts, loc)], (env, denv, gs' @ gs))
adamc@255 3402 end
adamc@255 3403
adamc@255 3404 | L.DDatatypeImp (_, [], _) => raise Fail "Empty DDatatypeImp"
adamc@255 3405
adamc@255 3406 | L.DDatatypeImp (x, m1 :: ms, s) =>
adamc@255 3407 (case E.lookupStr env m1 of
adamc@255 3408 NONE => (expError env (UnboundStrInExp (loc, m1));
adamc@255 3409 ([], (env, denv, gs)))
adamc@255 3410 | SOME (n, sgn) =>
adamc@255 3411 let
adamc@255 3412 val (str, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@255 3413 case E.projectStr env {sgn = sgn, str = str, field = m} of
adamc@255 3414 NONE => (conError env (UnboundStrInCon (loc, m));
adamc@255 3415 (strerror, sgnerror))
adamc@255 3416 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@255 3417 ((L'.StrVar n, loc), sgn) ms
adamc@255 3418 in
adamc@628 3419 case hnormCon env (L'.CModProj (n, ms, s), loc) of
adamc@628 3420 (L'.CModProj (n, ms, s), _) =>
adamc@255 3421 (case E.projectDatatype env {sgn = sgn, str = str, field = s} of
adamc@255 3422 NONE => (conError env (UnboundDatatype (loc, s));
adamc@255 3423 ([], (env, denv, gs)))
adamc@255 3424 | SOME (xs, xncs) =>
adamc@255 3425 let
adamc@255 3426 val k = (L'.KType, loc)
adamc@255 3427 val k' = foldl (fn (_, k') => (L'.KArrow (k, k'), loc)) k xs
adamc@255 3428 val t = (L'.CModProj (n, ms, s), loc)
adamc@255 3429 val (env, n') = E.pushCNamed env x k' (SOME t)
adamc@255 3430 val env = E.pushDatatype env n' xs xncs
adamc@255 3431
adamc@255 3432 val t = (L'.CNamed n', loc)
adamc@255 3433 val env = foldl (fn ((x, n, to), env) =>
adamc@255 3434 let
adamc@255 3435 val t = case to of
adamc@255 3436 NONE => t
adamc@255 3437 | SOME t' => (L'.TFun (t', t), loc)
adamc@255 3438
adamc@255 3439 val t = foldr (fn (x, t) =>
adamc@255 3440 (L'.TCFun (L'.Implicit, x, k, t), loc))
adamc@255 3441 t xs
adamc@255 3442 in
adamc@255 3443 E.pushENamedAs env x n t
adamc@255 3444 end) env xncs
adamc@255 3445 in
adamc@628 3446 ([(L'.DDatatypeImp (x, n', n, ms, s, xs, xncs), loc)], (env, denv, gs))
adamc@255 3447 end)
adamc@255 3448 | _ => (strError env (NotDatatype loc);
adamc@255 3449 ([], (env, denv, [])))
adamc@255 3450 end)
adamc@255 3451
adamc@255 3452 | L.DVal (x, co, e) =>
adamc@255 3453 let
adamc@255 3454 val (c', _, gs1) = case co of
adamc@255 3455 NONE => (cunif (loc, ktype), ktype, [])
adamc@255 3456 | SOME c => elabCon (env, denv) c
adamc@255 3457
adamc@255 3458 val (e', et, gs2) = elabExp (env, denv) e
adamc@629 3459
adamc@629 3460 val () = checkCon env e' et c'
adamc@629 3461
adamc@674 3462 val c' = normClassConstraint env c'
adamc@255 3463 val (env', n) = E.pushENamed env x c'
adamc@255 3464 in
adamc@255 3465 (*prefaces "DVal" [("x", Print.PD.string x),
adamc@362 3466 ("c'", p_con env c')];*)
adamc@628 3467 ([(L'.DVal (x, n, c', e'), loc)], (env', denv, enD gs1 @ gs2 @ gs))
adamc@255 3468 end
adamc@255 3469 | L.DValRec vis =>
adamc@255 3470 let
adamc@255 3471 fun allowable (e, _) =
adamc@255 3472 case e of
adamc@255 3473 L.EAbs _ => true
adamc@255 3474 | L.ECAbs (_, _, _, e) => allowable e
adamc@623 3475 | L.EKAbs (_, e) => allowable e
adamc@255 3476 | L.EDisjoint (_, _, e) => allowable e
adamc@255 3477 | _ => false
adamc@255 3478
adamc@255 3479 val (vis, gs) = ListUtil.foldlMap
adamc@255 3480 (fn ((x, co, e), gs) =>
adamc@255 3481 let
adamc@255 3482 val (c', _, gs1) = case co of
adamc@255 3483 NONE => (cunif (loc, ktype), ktype, [])
adamc@255 3484 | SOME c => elabCon (env, denv) c
adamc@674 3485 val c' = normClassConstraint env c'
adamc@255 3486 in
adamc@255 3487 ((x, c', e), enD gs1 @ gs)
adamc@280 3488 end) gs vis
adamc@255 3489
adamc@255 3490 val (vis, env) = ListUtil.foldlMap (fn ((x, c', e), env) =>
adamc@255 3491 let
adamc@255 3492 val (env, n) = E.pushENamed env x c'
adamc@255 3493 in
adamc@255 3494 ((x, n, c', e), env)
adamc@255 3495 end) env vis
adamc@255 3496
adamc@255 3497 val (vis, gs) = ListUtil.foldlMap (fn ((x, n, c', e), gs) =>
adamc@255 3498 let
adamc@255 3499 val (e', et, gs1) = elabExp (env, denv) e
adamc@255 3500 in
adamc@628 3501 checkCon env e' et c';
adamc@255 3502 if allowable e then
adamc@255 3503 ()
adamc@255 3504 else
adamc@255 3505 expError env (IllegalRec (x, e'));
adamc@628 3506 ((x, n, c', e'), gs1 @ gs)
adamc@255 3507 end) gs vis
adamc@255 3508 in
adamc@255 3509 ([(L'.DValRec vis, loc)], (env, denv, gs))
adamc@255 3510 end
adamc@255 3511
adamc@255 3512 | L.DSgn (x, sgn) =>
adamc@255 3513 let
adamc@255 3514 val (sgn', gs') = elabSgn (env, denv) sgn
adamc@255 3515 val (env', n) = E.pushSgnNamed env x sgn'
adamc@255 3516 in
adamc@255 3517 ([(L'.DSgn (x, n, sgn'), loc)], (env', denv, enD gs' @ gs))
adamc@255 3518 end
adamc@255 3519
adamc@255 3520 | L.DStr (x, sgno, str) =>
adamc@255 3521 let
adamc@255 3522 val () = if x = "Basis" then
adamc@255 3523 raise Fail "Not allowed to redefine structure 'Basis'"
adamc@255 3524 else
adamc@255 3525 ()
adamc@255 3526
adamc@255 3527 val formal = Option.map (elabSgn (env, denv)) sgno
adamc@255 3528
adamc@255 3529 val (str', sgn', gs') =
adamc@255 3530 case formal of
adamc@255 3531 NONE =>
adamc@255 3532 let
adamc@255 3533 val (str', actual, gs') = elabStr (env, denv) str
adamc@255 3534 in
adamc@255 3535 (str', selfifyAt env {str = str', sgn = actual}, gs')
adamc@255 3536 end
adamc@255 3537 | SOME (formal, gs1) =>
adamc@255 3538 let
adamc@325 3539 val str = wildifyStr env (str, formal)
adamc@255 3540 val (str', actual, gs2) = elabStr (env, denv) str
adamc@255 3541 in
adamc@628 3542 subSgn env (selfifyAt env {str = str', sgn = actual}) formal;
adamc@255 3543 (str', formal, enD gs1 @ gs2)
adamc@255 3544 end
adamc@255 3545
adamc@255 3546 val (env', n) = E.pushStrNamed env x sgn'
adamc@255 3547 in
adamc@255 3548 case #1 (hnormSgn env sgn') of
adamc@255 3549 L'.SgnFun _ =>
adamc@255 3550 (case #1 str' of
adamc@255 3551 L'.StrFun _ => ()
adamc@255 3552 | _ => strError env (FunctorRebind loc))
adamc@255 3553 | _ => ();
adamc@255 3554
adamc@255 3555 ([(L'.DStr (x, n, sgn', str'), loc)], (env', denv, gs' @ gs))
adamc@255 3556 end
adamc@255 3557
adamc@255 3558 | L.DFfiStr (x, sgn) =>
adamc@255 3559 let
adamc@255 3560 val (sgn', gs') = elabSgn (env, denv) sgn
adamc@255 3561
adamc@255 3562 val (env', n) = E.pushStrNamed env x sgn'
adamc@255 3563 in
adamc@255 3564 ([(L'.DFfiStr (x, n, sgn'), loc)], (env', denv, enD gs' @ gs))
adamc@255 3565 end
adamc@255 3566
adamc@255 3567 | L.DOpen (m, ms) =>
adamc@255 3568 (case E.lookupStr env m of
adamc@255 3569 NONE => (strError env (UnboundStr (loc, m));
adamc@255 3570 ([], (env, denv, gs)))
adamc@255 3571 | SOME (n, sgn) =>
adamc@255 3572 let
adamc@255 3573 val (_, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@255 3574 case E.projectStr env {str = str, sgn = sgn, field = m} of
adamc@255 3575 NONE => (strError env (UnboundStr (loc, m));
adamc@255 3576 (strerror, sgnerror))
adamc@255 3577 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@255 3578 ((L'.StrVar n, loc), sgn) ms
adamc@255 3579
adamc@628 3580 val (ds, env') = dopen env {str = n, strs = ms, sgn = sgn}
adamc@628 3581 val denv' = dopenConstraints (loc, env', denv) {str = m, strs = ms}
adamc@255 3582 in
adamc@255 3583 (ds, (env', denv', gs))
adamc@255 3584 end)
adamc@255 3585
adamc@255 3586 | L.DConstraint (c1, c2) =>
adamc@255 3587 let
adamc@255 3588 val (c1', k1, gs1) = elabCon (env, denv) c1
adamc@255 3589 val (c2', k2, gs2) = elabCon (env, denv) c2
adamc@255 3590 val gs3 = D.prove env denv (c1', c2', loc)
adamc@255 3591
adamc@628 3592 val denv' = D.assert env denv (c1', c2')
adamc@255 3593 in
adamc@255 3594 checkKind env c1' k1 (L'.KRecord (kunif loc), loc);
adamc@255 3595 checkKind env c2' k2 (L'.KRecord (kunif loc), loc);
adamc@255 3596
adamc@628 3597 ([(L'.DConstraint (c1', c2'), loc)], (env, denv', enD gs1 @ enD gs2 @ enD gs3 @ gs))
adamc@255 3598 end
adamc@255 3599
adamc@255 3600 | L.DOpenConstraints (m, ms) =>
adamc@255 3601 let
adamc@255 3602 val denv = dopenConstraints (loc, env, denv) {str = m, strs = ms}
adamc@255 3603 in
adamc@255 3604 ([], (env, denv, gs))
adamc@255 3605 end
adamc@255 3606
adamc@255 3607 | L.DExport str =>
adamc@255 3608 let
adamc@255 3609 val (str', sgn, gs') = elabStr (env, denv) str
adamc@255 3610
adamc@255 3611 val sgn =
adamc@255 3612 case #1 (hnormSgn env sgn) of
adamc@255 3613 L'.SgnConst sgis =>
adamc@255 3614 let
adamc@255 3615 fun doOne (all as (sgi, _), env) =
adamc@255 3616 (case sgi of
adamc@255 3617 L'.SgiVal (x, n, t) =>
adamc@325 3618 let
adamc@325 3619 fun doPage (makeRes, ran) =
adamc@628 3620 case hnormCon env ran of
adamc@628 3621 (L'.CApp (tf, arg), _) =>
adamc@628 3622 (case (hnormCon env tf, hnormCon env arg) of
adamc@628 3623 ((L'.CModProj (basis, [], "transaction"), _),
adamc@720 3624 (L'.CApp (tf, arg3), _)) =>
adamc@325 3625 (case (basis = !basis_r,
adamc@720 3626 hnormCon env tf, hnormCon env arg3) of
adamc@325 3627 (true,
adamc@720 3628 (L'.CApp (tf, arg2), _),
adamc@628 3629 ((L'.CRecord (_, []), _))) =>
adamc@720 3630 (case (hnormCon env tf) of
adamc@720 3631 (L'.CApp (tf, arg1), _) =>
adamc@720 3632 (case (hnormCon env tf,
adamc@720 3633 hnormCon env arg1,
adamc@720 3634 hnormCon env arg2) of
adamc@720 3635 (tf, arg1,
adamc@720 3636 (L'.CRecord (_, []), _)) =>
adamc@720 3637 let
adamc@720 3638 val t = (L'.CApp (tf, arg1), loc)
adamc@720 3639 val t = (L'.CApp (t, arg2), loc)
adamc@720 3640 val t = (L'.CApp (t, arg3), loc)
adamc@720 3641 val t = (L'.CApp (
adamc@720 3642 (L'.CModProj
adamc@720 3643 (basis, [], "transaction"), loc),
adamc@325 3644 t), loc)
adamc@720 3645 in
adamc@720 3646 (L'.SgiVal (x, n, makeRes t), loc)
adamc@720 3647 end
adamc@325 3648 | _ => all)
adamc@325 3649 | _ => all)
adamc@325 3650 | _ => all)
adamc@325 3651 | _ => all)
adamc@325 3652 | _ => all
adamc@325 3653 in
adamc@628 3654 case hnormCon env t of
adamc@628 3655 (L'.TFun (dom, ran), _) =>
adamc@628 3656 (case hnormCon env dom of
adamc@628 3657 (L'.TRecord domR, _) =>
adamc@325 3658 doPage (fn t => (L'.TFun ((L'.TRecord domR,
adamc@325 3659 loc),
adamc@325 3660 t), loc), ran)
adamc@325 3661 | _ => all)
adamc@325 3662 | _ => doPage (fn t => t, t)
adamc@325 3663 end
adamc@255 3664 | _ => all,
adamc@255 3665 E.sgiBinds env all)
adamc@255 3666 in
adamc@255 3667 (L'.SgnConst (#1 (ListUtil.foldlMap doOne env sgis)), loc)
adamc@255 3668 end
adamc@255 3669 | _ => sgn
adamc@255 3670 in
adamc@255 3671 ([(L'.DExport (E.newNamed (), sgn, str'), loc)], (env, denv, gs' @ gs))
adamc@255 3672 end
adamc@255 3673
adamc@707 3674 | L.DTable (x, c, pe, ce) =>
adamc@255 3675 let
adamc@707 3676 val cstK = (L'.KRecord (L'.KRecord (L'.KUnit, loc), loc), loc)
adamc@707 3677
adamc@255 3678 val (c', k, gs') = elabCon (env, denv) c
adamc@707 3679 val pkey = cunif (loc, cstK)
adamc@707 3680 val uniques = cunif (loc, cstK)
adamc@705 3681
adamc@705 3682 val ct = tableOf ()
adamc@705 3683 val ct = (L'.CApp (ct, c'), loc)
adamc@707 3684 val ct = (L'.CApp (ct, (L'.CConcat (pkey, uniques), loc)), loc)
adamc@705 3685
adamc@705 3686 val (env, n) = E.pushENamed env x ct
adamc@707 3687 val (pe', pet, gs'') = elabExp (env, denv) pe
adamc@707 3688 val (ce', cet, gs''') = elabExp (env, denv) ce
adamc@707 3689
adamc@707 3690 val pst = (L'.CModProj (!basis_r, [], "primary_key"), loc)
adamc@707 3691 val pst = (L'.CApp (pst, c'), loc)
adamc@707 3692 val pst = (L'.CApp (pst, pkey), loc)
adamc@704 3693
adamc@704 3694 val cst = (L'.CModProj (!basis_r, [], "sql_constraints"), loc)
adamc@704 3695 val cst = (L'.CApp (cst, c'), loc)
adamc@705 3696 val cst = (L'.CApp (cst, uniques), loc)
adamc@255 3697 in
adamc@255 3698 checkKind env c' k (L'.KRecord (L'.KType, loc), loc);
adamc@707 3699 checkCon env pe' pet pst;
adamc@707 3700 checkCon env ce' cet cst;
adamc@707 3701 ([(L'.DTable (!basis_r, x, n, c', pe', pkey, ce', uniques), loc)],
adamc@707 3702 (env, denv, gs''' @ gs'' @ enD gs' @ gs))
adamc@255 3703 end
adamc@338 3704 | L.DSequence x =>
adamc@338 3705 let
adamc@338 3706 val (env, n) = E.pushENamed env x (sequenceOf ())
adamc@338 3707 in
adamc@338 3708 ([(L'.DSequence (!basis_r, x, n), loc)], (env, denv, gs))
adamc@338 3709 end
adamc@754 3710 | L.DView (x, e) =>
adamc@754 3711 let
adamc@754 3712 val (e', t, gs') = elabExp (env, denv) e
adamc@754 3713
adamc@754 3714 val k = (L'.KRecord (L'.KType, loc), loc)
adamc@754 3715 val fs = cunif (loc, k)
adamc@754 3716 val ts = cunif (loc, (L'.KRecord k, loc))
adamc@754 3717 val tf = (L'.CApp ((L'.CMap (k, k), loc),
adamc@754 3718 (L'.CAbs ("_", k, (L'.CRecord ((L'.KType, loc), []), loc)), loc)), loc)
adamc@754 3719 val ts = (L'.CApp (tf, ts), loc)
adamc@754 3720
adamc@754 3721 val cv = viewOf ()
adamc@754 3722 val cv = (L'.CApp (cv, fs), loc)
adamc@754 3723 val (env', n) = E.pushENamed env x cv
adamc@754 3724
adamc@754 3725 val ct = queryOf ()
adamc@754 3726 val ct = (L'.CApp (ct, ts), loc)
adamc@754 3727 val ct = (L'.CApp (ct, fs), loc)
adamc@754 3728 in
adamc@754 3729 checkCon env e' t ct;
adamc@754 3730 ([(L'.DView (!basis_r, x, n, e', fs), loc)],
adamc@754 3731 (env', denv, gs' @ gs))
adamc@754 3732 end
adamc@255 3733
adamc@563 3734 | L.DClass (x, k, c) =>
adamc@255 3735 let
adamc@623 3736 val k = elabKind env k
adamc@280 3737 val (c', ck, gs') = elabCon (env, denv) c
adamc@711 3738 val (env, n) = E.pushCNamed env x k (SOME c')
adamc@255 3739 val env = E.pushClass env n
adamc@255 3740 in
adamc@711 3741 checkKind env c' ck k;
adamc@563 3742 ([(L'.DClass (x, n, k, c'), loc)], (env, denv, enD gs' @ gs))
adamc@255 3743 end
adamc@271 3744
adamc@280 3745 | L.DDatabase s => ([(L'.DDatabase s, loc)], (env, denv, gs))
adamc@280 3746
adamc@459 3747 | L.DCookie (x, c) =>
adamc@459 3748 let
adamc@459 3749 val (c', k, gs') = elabCon (env, denv) c
adamc@459 3750 val (env, n) = E.pushENamed env x (L'.CApp (cookieOf (), c'), loc)
adamc@459 3751 in
adamc@459 3752 checkKind env c' k (L'.KType, loc);
adamc@459 3753 ([(L'.DCookie (!basis_r, x, n, c'), loc)], (env, denv, enD gs' @ gs))
adamc@459 3754 end
adamc@720 3755 | L.DStyle x =>
adamc@718 3756 let
adamc@720 3757 val (env, n) = E.pushENamed env x (styleOf ())
adamc@718 3758 in
adamc@720 3759 ([(L'.DStyle (!basis_r, x, n), loc)], (env, denv, gs))
adamc@718 3760 end
adamc@459 3761
adamc@280 3762 (*val tcs = List.filter (fn TypeClass _ => true | _ => false) (#3 (#2 r))*)
adamc@255 3763 in
adamc@280 3764 (*prefaces "elabDecl" [("e", SourcePrint.p_decl dAll),
adamc@514 3765 ("t", PD.string (LargeReal.toString (Time.toReal
adamc@514 3766 (Time.- (Time.now (), befor)))))];*)
adamc@280 3767
adamc@255 3768 r
adamc@255 3769 end
adamc@211 3770
adamc@83 3771 and elabStr (env, denv) (str, loc) =
adamc@31 3772 case str of
adamc@31 3773 L.StrConst ds =>
adamc@31 3774 let
adamc@88 3775 val (ds', (_, _, gs)) = ListUtil.foldlMapConcat elabDecl (env, denv, []) ds
adamc@123 3776 val sgis = ListUtil.mapConcat sgiOfDecl ds'
adamc@63 3777
adamc@63 3778 val (sgis, _, _, _, _) =
adamc@64 3779 foldr (fn ((sgi, loc), (sgis, cons, vals, sgns, strs)) =>
adamc@63 3780 case sgi of
adamc@64 3781 L'.SgiConAbs (x, n, k) =>
adamc@64 3782 let
adamc@64 3783 val (cons, x) =
adamc@64 3784 if SS.member (cons, x) then
adamc@64 3785 (cons, "?" ^ x)
adamc@64 3786 else
adamc@64 3787 (SS.add (cons, x), x)
adamc@64 3788 in
adamc@64 3789 ((L'.SgiConAbs (x, n, k), loc) :: sgis, cons, vals, sgns, strs)
adamc@64 3790 end
adamc@64 3791 | L'.SgiCon (x, n, k, c) =>
adamc@64 3792 let
adamc@64 3793 val (cons, x) =
adamc@64 3794 if SS.member (cons, x) then
adamc@64 3795 (cons, "?" ^ x)
adamc@64 3796 else
adamc@64 3797 (SS.add (cons, x), x)
adamc@64 3798 in
adamc@64 3799 ((L'.SgiCon (x, n, k, c), loc) :: sgis, cons, vals, sgns, strs)
adamc@64 3800 end
adamc@805 3801 | L'.SgiDatatype dts =>
adamc@156 3802 let
adamc@805 3803 fun doOne ((x, n, xs, xncs), (cons, vals)) =
adamc@805 3804 let
adamc@805 3805 val (cons, x) =
adamc@805 3806 if SS.member (cons, x) then
adamc@805 3807 (cons, "?" ^ x)
adamc@156 3808 else
adamc@805 3809 (SS.add (cons, x), x)
adamc@805 3810
adamc@805 3811 val (xncs, vals) =
adamc@805 3812 ListUtil.foldlMap
adamc@805 3813 (fn ((x, n, t), vals) =>
adamc@805 3814 if SS.member (vals, x) then
adamc@805 3815 (("?" ^ x, n, t), vals)
adamc@805 3816 else
adamc@805 3817 ((x, n, t), SS.add (vals, x)))
adamc@805 3818 vals xncs
adamc@805 3819 in
adamc@805 3820 ((x, n, xs, xncs), (cons, vals))
adamc@805 3821 end
adamc@805 3822
adamc@805 3823 val (dts, (cons, vals)) = ListUtil.foldlMap doOne (cons, vals) dts
adamc@156 3824 in
adamc@805 3825 ((L'.SgiDatatype dts, loc) :: sgis, cons, vals, sgns, strs)
adamc@156 3826 end
adamc@191 3827 | L'.SgiDatatypeImp (x, n, m1, ms, x', xs, xncs) =>
adamc@156 3828 let
adamc@156 3829 val (cons, x) =
adamc@156 3830 if SS.member (cons, x) then
adamc@156 3831 (cons, "?" ^ x)
adamc@156 3832 else
adamc@156 3833 (SS.add (cons, x), x)
adamc@156 3834 in
adamc@191 3835 ((L'.SgiDatatypeImp (x, n, m1, ms, x', xs, xncs), loc) :: sgis, cons, vals, sgns, strs)
adamc@156 3836 end
adamc@64 3837 | L'.SgiVal (x, n, c) =>
adamc@64 3838 let
adamc@64 3839 val (vals, x) =
adamc@64 3840 if SS.member (vals, x) then
adamc@64 3841 (vals, "?" ^ x)
adamc@64 3842 else
adamc@64 3843 (SS.add (vals, x), x)
adamc@64 3844 in
adamc@64 3845 ((L'.SgiVal (x, n, c), loc) :: sgis, cons, vals, sgns, strs)
adamc@64 3846 end
adamc@64 3847 | L'.SgiSgn (x, n, sgn) =>
adamc@64 3848 let
adamc@64 3849 val (sgns, x) =
adamc@64 3850 if SS.member (sgns, x) then
adamc@64 3851 (sgns, "?" ^ x)
adamc@64 3852 else
adamc@64 3853 (SS.add (sgns, x), x)
adamc@64 3854 in
adamc@64 3855 ((L'.SgiSgn (x, n, sgn), loc) :: sgis, cons, vals, sgns, strs)
adamc@64 3856 end
adamc@64 3857
adamc@64 3858 | L'.SgiStr (x, n, sgn) =>
adamc@64 3859 let
adamc@64 3860 val (strs, x) =
adamc@64 3861 if SS.member (strs, x) then
adamc@64 3862 (strs, "?" ^ x)
adamc@64 3863 else
adamc@64 3864 (SS.add (strs, x), x)
adamc@64 3865 in
adamc@64 3866 ((L'.SgiStr (x, n, sgn), loc) :: sgis, cons, vals, sgns, strs)
adamc@88 3867 end
adamc@203 3868 | L'.SgiConstraint _ => ((sgi, loc) :: sgis, cons, vals, sgns, strs)
adamc@563 3869 | L'.SgiClassAbs (x, n, k) =>
adamc@211 3870 let
adamc@211 3871 val (cons, x) =
adamc@211 3872 if SS.member (cons, x) then
adamc@211 3873 (cons, "?" ^ x)
adamc@211 3874 else
adamc@211 3875 (SS.add (cons, x), x)
adamc@211 3876 in
adamc@563 3877 ((L'.SgiClassAbs (x, n, k), loc) :: sgis, cons, vals, sgns, strs)
adamc@211 3878 end
adamc@563 3879 | L'.SgiClass (x, n, k, c) =>
adamc@211 3880 let
adamc@211 3881 val (cons, x) =
adamc@211 3882 if SS.member (cons, x) then
adamc@211 3883 (cons, "?" ^ x)
adamc@211 3884 else
adamc@211 3885 (SS.add (cons, x), x)
adamc@211 3886 in
adamc@563 3887 ((L'.SgiClass (x, n, k, c), loc) :: sgis, cons, vals, sgns, strs)
adamc@203 3888 end)
adamc@64 3889
adamc@63 3890 ([], SS.empty, SS.empty, SS.empty, SS.empty) sgis
adamc@31 3891 in
adamc@83 3892 ((L'.StrConst ds', loc), (L'.SgnConst sgis, loc), gs)
adamc@31 3893 end
adamc@31 3894 | L.StrVar x =>
adamc@31 3895 (case E.lookupStr env x of
adamc@31 3896 NONE =>
adamc@31 3897 (strError env (UnboundStr (loc, x));
adamc@83 3898 (strerror, sgnerror, []))
adamc@83 3899 | SOME (n, sgn) => ((L'.StrVar n, loc), sgn, []))
adamc@34 3900 | L.StrProj (str, x) =>
adamc@34 3901 let
adamc@83 3902 val (str', sgn, gs) = elabStr (env, denv) str
adamc@34 3903 in
adamc@34 3904 case E.projectStr env {str = str', sgn = sgn, field = x} of
adamc@34 3905 NONE => (strError env (UnboundStr (loc, x));
adamc@83 3906 (strerror, sgnerror, []))
adamc@83 3907 | SOME sgn => ((L'.StrProj (str', x), loc), sgn, gs)
adamc@34 3908 end
adamc@41 3909 | L.StrFun (m, dom, ranO, str) =>
adamc@41 3910 let
adamc@83 3911 val (dom', gs1) = elabSgn (env, denv) dom
adamc@41 3912 val (env', n) = E.pushStrNamed env m dom'
adamc@83 3913 val (str', actual, gs2) = elabStr (env', denv) str
adamc@41 3914
adamc@83 3915 val (formal, gs3) =
adamc@41 3916 case ranO of
adamc@83 3917 NONE => (actual, [])
adamc@41 3918 | SOME ran =>
adamc@41 3919 let
adamc@83 3920 val (ran', gs) = elabSgn (env', denv) ran
adamc@41 3921 in
adamc@628 3922 subSgn env' actual ran';
adamc@83 3923 (ran', gs)
adamc@41 3924 end
adamc@41 3925 in
adamc@41 3926 ((L'.StrFun (m, n, dom', formal, str'), loc),
adamc@83 3927 (L'.SgnFun (m, n, dom', formal), loc),
adamc@228 3928 enD gs1 @ gs2 @ enD gs3)
adamc@41 3929 end
adamc@44 3930 | L.StrApp (str1, str2) =>
adamc@44 3931 let
adamc@83 3932 val (str1', sgn1, gs1) = elabStr (env, denv) str1
adamc@325 3933 val str2 =
adamc@325 3934 case sgn1 of
adamc@325 3935 (L'.SgnFun (_, _, dom, _), _) =>
adamc@325 3936 wildifyStr env (str2, dom)
adamc@325 3937 | _ => str2
adamc@83 3938 val (str2', sgn2, gs2) = elabStr (env, denv) str2
adamc@44 3939 in
adamc@44 3940 case #1 (hnormSgn env sgn1) of
adamc@83 3941 L'.SgnError => (strerror, sgnerror, [])
adamc@44 3942 | L'.SgnFun (m, n, dom, ran) =>
adamc@628 3943 (subSgn env sgn2 dom;
adamc@44 3944 case #1 (hnormSgn env ran) of
adamc@83 3945 L'.SgnError => (strerror, sgnerror, [])
adamc@44 3946 | L'.SgnConst sgis =>
adamc@44 3947 ((L'.StrApp (str1', str2'), loc),
adamc@83 3948 (L'.SgnConst ((L'.SgiStr (m, n, selfifyAt env {str = str2', sgn = sgn2}), loc) :: sgis), loc),
adamc@83 3949 gs1 @ gs2)
adamc@44 3950 | _ => raise Fail "Unable to hnormSgn in functor application")
adamc@44 3951 | _ => (strError env (NotFunctor sgn1);
adamc@83 3952 (strerror, sgnerror, []))
adamc@44 3953 end
adamc@31 3954
adamc@325 3955 fun elabFile basis topStr topSgn env file =
adamc@56 3956 let
adamc@713 3957 val () = mayDelay := true
adamc@713 3958 val () = delayedUnifs := []
adamc@713 3959
adamc@83 3960 val (sgn, gs) = elabSgn (env, D.empty) (L.SgnConst basis, ErrorMsg.dummySpan)
adamc@83 3961 val () = case gs of
adamc@83 3962 [] => ()
adamc@207 3963 | _ => (app (fn (_, env, _, c1, c2) =>
adamc@207 3964 prefaces "Unresolved"
adamc@207 3965 [("c1", p_con env c1),
adamc@207 3966 ("c2", p_con env c2)]) gs;
adamc@207 3967 raise Fail "Unresolved disjointness constraints in Basis")
adamc@83 3968
adamc@56 3969 val (env', basis_n) = E.pushStrNamed env "Basis" sgn
adamc@210 3970 val () = basis_r := basis_n
adamc@56 3971
adamc@628 3972 val (ds, env') = dopen env' {str = basis_n, strs = [], sgn = sgn}
adamc@56 3973
adamc@56 3974 fun discoverC r x =
adamc@56 3975 case E.lookupC env' x of
adamc@56 3976 E.NotBound => raise Fail ("Constructor " ^ x ^ " unbound in Basis")
adamc@56 3977 | E.Rel _ => raise Fail ("Constructor " ^ x ^ " bound relatively in Basis")
adamc@56 3978 | E.Named (n, (_, loc)) => r := (L'.CNamed n, loc)
adamc@56 3979
adamc@56 3980 val () = discoverC int "int"
adamc@56 3981 val () = discoverC float "float"
adamc@56 3982 val () = discoverC string "string"
adamc@821 3983 val () = discoverC char "char"
adamc@203 3984 val () = discoverC table "sql_table"
adamc@56 3985
adamc@325 3986 val (topSgn, gs) = elabSgn (env', D.empty) (L.SgnConst topSgn, ErrorMsg.dummySpan)
adamc@325 3987 val () = case gs of
adamc@325 3988 [] => ()
adamc@325 3989 | _ => raise Fail "Unresolved disjointness constraints in top.urs"
adamc@325 3990 val (topStr, topSgn', gs) = elabStr (env', D.empty) (L.StrConst topStr, ErrorMsg.dummySpan)
adamc@325 3991 val () = case gs of
adamc@325 3992 [] => ()
adamc@329 3993 | _ => app (fn Disjoint (loc, env, denv, c1, c2) =>
adamc@329 3994 (case D.prove env denv (c1, c2, loc) of
adamc@329 3995 [] => ()
adamc@329 3996 | _ =>
adamc@329 3997 (prefaces "Unresolved constraint in top.ur"
adamc@329 3998 [("loc", PD.string (ErrorMsg.spanToString loc)),
adamc@329 3999 ("c1", p_con env c1),
adamc@720 4000 ("c2", p_con env c2)];
adamc@478 4001 raise Fail "Unresolved constraint in top.ur"))
adamc@564 4002 | TypeClass (env, c, r, loc) =>
adamc@564 4003 let
adamc@564 4004 val c = normClassKey env c
adamc@564 4005 in
adamc@753 4006 case E.resolveClass (hnormCon env) (consEq env) env c of
adamc@564 4007 SOME e => r := SOME e
adamc@564 4008 | NONE => expError env (Unresolvable (loc, c))
adamc@634 4009 end) gs
adamc@564 4010
adamc@720 4011 val () = subSgn env' topSgn' topSgn
adamc@720 4012
adamc@325 4013 val (env', top_n) = E.pushStrNamed env' "Top" topSgn
adamc@633 4014 val () = top_r := top_n
adamc@325 4015
adamc@628 4016 val (ds', env') = dopen env' {str = top_n, strs = [], sgn = topSgn}
adamc@325 4017
adamc@713 4018 val checks = ref ([] : (unit -> unit) list)
adamc@713 4019
adamc@83 4020 fun elabDecl' (d, (env, gs)) =
adamc@76 4021 let
adamc@76 4022 val () = resetKunif ()
adamc@76 4023 val () = resetCunif ()
adamc@88 4024 val (ds, (env, _, gs)) = elabDecl (d, (env, D.empty, gs))
adamc@76 4025 in
adamc@713 4026 checks :=
adamc@713 4027 (fn () =>
adamc@713 4028 (if List.exists kunifsInDecl ds then
adamc@713 4029 declError env (KunifsRemain ds)
adamc@713 4030 else
adamc@713 4031 ();
adamc@713 4032
adamc@713 4033 case ListUtil.search cunifsInDecl ds of
adamc@713 4034 NONE => ()
adamc@713 4035 | SOME loc =>
adamc@713 4036 declError env (CunifsRemain ds)))
adamc@713 4037 :: !checks;
adamc@76 4038
adamc@83 4039 (ds, (env, gs))
adamc@76 4040 end
adamc@76 4041
adamc@83 4042 val (file, (_, gs)) = ListUtil.foldlMapConcat elabDecl' (env', []) file
adamc@753 4043
adamc@777 4044 fun oneSummaryRound () =
adamc@777 4045 if ErrorMsg.anyErrors () then
adamc@777 4046 ()
adamc@777 4047 else
adamc@777 4048 let
adamc@777 4049 val delayed = !delayedUnifs
adamc@777 4050 in
adamc@777 4051 delayedUnifs := [];
adamc@777 4052 app (fn (loc, env, k, s1, s2) =>
adamc@777 4053 unifySummaries env (loc, k, normalizeRecordSummary env s1, normalizeRecordSummary env s2))
adamc@777 4054 delayed
adamc@777 4055 end
adamc@56 4056 in
adamc@777 4057 oneSummaryRound ();
adamc@753 4058
adamc@753 4059 if ErrorMsg.anyErrors () then
adamc@753 4060 ()
adamc@753 4061 else
adamc@753 4062 let
adamc@753 4063 fun solver gs =
adamc@753 4064 let
adamc@753 4065 val (gs, solved) =
adamc@753 4066 ListUtil.foldlMapPartial
adamc@753 4067 (fn (g, solved) =>
adamc@753 4068 case g of
adamc@753 4069 Disjoint (loc, env, denv, c1, c2) =>
adamc@753 4070 (case D.prove env denv (c1, c2, loc) of
adamc@753 4071 [] => (NONE, true)
adamc@753 4072 | _ => (SOME g, solved))
adamc@753 4073 | TypeClass (env, c, r, loc) =>
adamc@753 4074 let
adamc@753 4075 fun default () = (SOME g, solved)
adamc@753 4076
adamc@753 4077 val c = normClassKey env c
adamc@753 4078 in
adamc@753 4079 case E.resolveClass (hnormCon env) (consEq env) env c of
adamc@753 4080 SOME e => (r := SOME e;
adamc@753 4081 (NONE, true))
adamc@753 4082 | NONE =>
adamc@753 4083 case #1 (hnormCon env c) of
adamc@753 4084 L'.CApp (f, x) =>
adamc@753 4085 (case (#1 (hnormCon env f), #1 (hnormCon env x)) of
adamc@753 4086 (L'.CKApp (f, _), L'.CRecord (k, xcs)) =>
adamc@753 4087 (case #1 (hnormCon env f) of
adamc@753 4088 L'.CModProj (top_n', [], "folder") =>
adamc@753 4089 if top_n' = top_n then
adamc@753 4090 let
adamc@753 4091 val e = (L'.EModProj (top_n, ["Folder"], "nil"), loc)
adamc@753 4092 val e = (L'.EKApp (e, k), loc)
adamc@753 4093
adamc@753 4094 val (folder, _) = foldr (fn ((x, c), (folder, xcs)) =>
adamc@753 4095 let
adamc@753 4096 val e = (L'.EModProj (top_n, ["Folder"],
adamc@753 4097 "cons"), loc)
adamc@753 4098 val e = (L'.EKApp (e, k), loc)
adamc@753 4099 val e = (L'.ECApp (e,
adamc@753 4100 (L'.CRecord (k, xcs),
adamc@753 4101 loc)), loc)
adamc@753 4102 val e = (L'.ECApp (e, x), loc)
adamc@753 4103 val e = (L'.ECApp (e, c), loc)
adamc@753 4104 val e = (L'.EApp (e, folder), loc)
adamc@753 4105 in
adamc@753 4106 (e, (x, c) :: xcs)
adamc@753 4107 end)
adamc@753 4108 (e, []) xcs
adamc@753 4109 in
adamc@753 4110 (r := SOME folder;
adamc@753 4111 (NONE, true))
adamc@753 4112 end
adamc@753 4113 else
adamc@753 4114 default ()
adamc@753 4115 | _ => default ())
adamc@753 4116 | _ => default ())
adamc@753 4117 | _ => default ()
adamc@753 4118 end)
adamc@753 4119 false gs
adamc@753 4120 in
adamc@753 4121 case (gs, solved) of
adamc@753 4122 ([], _) => ()
adamc@777 4123 | (_, true) => (oneSummaryRound (); solver gs)
adamc@753 4124 | _ =>
adamc@753 4125 app (fn Disjoint (loc, env, denv, c1, c2) =>
adamc@753 4126 ((ErrorMsg.errorAt loc "Couldn't prove field name disjointness";
adamc@753 4127 eprefaces' [("Con 1", p_con env c1),
adamc@753 4128 ("Con 2", p_con env c2),
adamc@753 4129 ("Hnormed 1", p_con env (ElabOps.hnormCon env c1)),
adamc@753 4130 ("Hnormed 2", p_con env (ElabOps.hnormCon env c2))]))
adamc@753 4131 | TypeClass (env, c, r, loc) =>
adamc@753 4132 expError env (Unresolvable (loc, c)))
adamc@753 4133 gs
adamc@753 4134 end
adamc@753 4135 in
adamc@753 4136 solver gs
adamc@753 4137 end;
adamc@753 4138
adamc@713 4139 mayDelay := false;
adamc@713 4140
adamc@777 4141 if ErrorMsg.anyErrors () then
adamc@777 4142 ()
adamc@777 4143 else
adamc@777 4144 (app (fn (loc, env, k, s1, s2) =>
adamc@777 4145 unifySummaries env (loc, k, normalizeRecordSummary env s1, normalizeRecordSummary env s2)
adamc@777 4146 handle CUnify' err => (ErrorMsg.errorAt loc "Error in final record unification";
adamc@777 4147 cunifyError env err))
adamc@777 4148 (!delayedUnifs);
adamc@777 4149 delayedUnifs := []);
adamc@713 4150
adamc@713 4151 if ErrorMsg.anyErrors () then
adamc@713 4152 ()
adamc@713 4153 else
adamc@750 4154 app (fn f => f ()) (!checks);
adamc@750 4155
adamc@799 4156 (*preface ("file", p_file env' file);*)
adamc@799 4157
adamc@325 4158 (L'.DFfiStr ("Basis", basis_n, sgn), ErrorMsg.dummySpan)
adamc@325 4159 :: ds
adamc@325 4160 @ (L'.DStr ("Top", top_n, topSgn, topStr), ErrorMsg.dummySpan)
adamc@325 4161 :: ds' @ file
adamc@56 4162 end
adamc@2 4163
adamc@2 4164 end