Mercurial > urweb

annotate src/elaborate.sml @ 1589:fb0388f1180e

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