Mercurial > urweb

annotate src/elaborate.sml @ 1348:8a169fc0838b

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