Mercurial > urweb

annotate src/elaborate.sml @ 1326:d91f84599693

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