Mercurial > urweb

annotate src/elaborate.sml @ 1582:dfb38a333816

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