Mercurial > urweb

annotate src/elaborate.sml @ 754:8688e01ae469

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