Mercurial > urweb

annotate src/elaborate.sml @ 792:d20d6afc1206

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