Mercurial > urweb

annotate src/elaborate.sml @ 750:059074c8d2fc

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