Mercurial > urweb

annotate src/elaborate.sml @ 1547:553a5cc3a4b5

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