Mercurial > urweb

annotate src/elaborate.sml @ 833:9a1026e2b3f5

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