Mercurial > urweb

annotate src/elaborate.sml @ 632:6c4643880df5

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Demos compile again, with manual folders
author Adam Chlipala <adamc@hcoop.net>
date Tue, 24 Feb 2009 15:12:13 -0500
parents e68de2a5506b
children 03ab853c8e4b
rev   line source
adamc@412 1 (* Copyright (c) 2008, Adam Chlipala
adamc@445 2 * All rights reserved.
adamc@445 3 *
adamc@445 4 * Redistribution and use in source and binary forms, with or without
adamc@445 5 * modification, are permitted provided that the following conditions are met:
adamc@445 6 *
adamc@445 7 * - Redistributions of source code must retain the above copyright notice,
adamc@445 8 * this list of conditions and the following disclaimer.
adamc@445 9 * - Redistributions in binary form must reproduce the above copyright notice,
adamc@445 10 * this list of conditions and the following disclaimer in the documentation
adamc@445 11 * and/or other materials provided with the distribution.
adamc@445 12 * - The names of contributors may not be used to endorse or promote products
adamc@445 13 * derived from this software without specific prior written permission.
adamc@445 14 *
adamc@445 15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
adamc@445 16 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
adamc@445 17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
adamc@445 18 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
adamc@445 19 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
adamc@445 20 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
adamc@445 21 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
adamc@445 22 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
adamc@445 23 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
adamc@445 24 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
adamc@445 25 * POSSIBILITY OF SUCH DAMAGE.
adamc@445 26 *)
adamc@403 27
adamc@403 28 structure Elaborate :> ELABORATE = struct
adamc@403 29
adamc@403 30 structure P = Prim
adamc@403 31 structure L = Source
adamc@403 32 structure L' = Elab
adamc@403 33 structure E = ElabEnv
adamc@403 34 structure U = ElabUtil
adamc@403 35 structure D = Disjoint
adamc@403 36
adamc@403 37 open Print
adamc@403 38 open ElabPrint
adamc@403 39 open ElabErr
adamc@403 40
adamc@403 41 structure IM = IntBinaryMap
adamc@403 42
adamc@403 43 structure SK = struct
adamc@403 44 type ord_key = string
adamc@403 45 val compare = String.compare
adamc@403 46 end
adamc@403 47
adamc@403 48 structure SS = BinarySetFn(SK)
adamc@403 49 structure SM = BinaryMapFn(SK)
adamc@403 50
adamc@403 51 val basis_r = ref 0
adamc@403 52
adamc@403 53 fun elabExplicitness e =
adamc@403 54 case e of
adamc@403 55 L.Explicit => L'.Explicit
adamc@403 56 | L.Implicit => L'.Implicit
adamc@403 57
adamc@403 58 fun occursKind r =
adamc@403 59 U.Kind.exists (fn L'.KUnif (_, _, r') => r = r'
adamc@403 60 | _ => false)
adamc@403 61
adamc@403 62 exception KUnify' of kunify_error
adamc@403 63
adamc@623 64 fun unifyKinds' env (k1All as (k1, _)) (k2All as (k2, _)) =
adamc@403 65 let
adamc@403 66 fun err f = raise KUnify' (f (k1All, k2All))
adamc@403 67 in
adamc@403 68 case (k1, k2) of
adamc@403 69 (L'.KType, L'.KType) => ()
adamc@403 70 | (L'.KUnit, L'.KUnit) => ()
adamc@403 71
adamc@403 72 | (L'.KArrow (d1, r1), L'.KArrow (d2, r2)) =>
adamc@623 73 (unifyKinds' env d1 d2;
adamc@623 74 unifyKinds' env r1 r2)
adamc@403 75 | (L'.KName, L'.KName) => ()
adamc@623 76 | (L'.KRecord k1, L'.KRecord k2) => unifyKinds' env k1 k2
adamc@403 77 | (L'.KTuple ks1, L'.KTuple ks2) =>
adamc@623 78 ((ListPair.appEq (fn (k1, k2) => unifyKinds' env k1 k2) (ks1, ks2))
adamc@403 79 handle ListPair.UnequalLengths => err KIncompatible)
adamc@403 80
adamc@623 81 | (L'.KRel n1, L'.KRel n2) =>
adamc@623 82 if n1 = n2 then
adamc@623 83 ()
adamc@623 84 else
adamc@623 85 err KIncompatible
adamc@623 86 | (L'.KFun (x, k1), L'.KFun (_, k2)) =>
adamc@623 87 unifyKinds' (E.pushKRel env x) k1 k2
adamc@623 88
adamc@403 89 | (L'.KError, _) => ()
adamc@403 90 | (_, L'.KError) => ()
adamc@403 91
adamc@623 92 | (L'.KUnif (_, _, ref (SOME k1All)), _) => unifyKinds' env k1All k2All
adamc@623 93 | (_, L'.KUnif (_, _, ref (SOME k2All))) => unifyKinds' env k1All k2All
adamc@403 94
adamc@403 95 | (L'.KUnif (_, _, r1), L'.KUnif (_, _, r2)) =>
adamc@403 96 if r1 = r2 then
adamc@403 97 ()
adamc@403 98 else
adamc@403 99 r1 := SOME k2All
adamc@403 100
adamc@403 101 | (L'.KUnif (_, _, r), _) =>
adamc@403 102 if occursKind r k2All then
adamc@403 103 err KOccursCheckFailed
adamc@403 104 else
adamc@403 105 r := SOME k2All
adamc@403 106 | (_, L'.KUnif (_, _, r)) =>
adamc@403 107 if occursKind r k1All then
adamc@403 108 err KOccursCheckFailed
adamc@403 109 else
adamc@403 110 r := SOME k1All
adamc@403 111
adamc@403 112 | _ => err KIncompatible
adamc@403 113 end
adamc@403 114
adamc@403 115 exception KUnify of L'.kind * L'.kind * kunify_error
adamc@403 116
adamc@623 117 fun unifyKinds env k1 k2 =
adamc@623 118 unifyKinds' env k1 k2
adamc@403 119 handle KUnify' err => raise KUnify (k1, k2, err)
adamc@403 120
adamc@403 121 fun checkKind env c k1 k2 =
adamc@623 122 unifyKinds env k1 k2
adamc@403 123 handle KUnify (k1, k2, err) =>
adamc@403 124 conError env (WrongKind (c, k1, k2, err))
adamc@403 125
adamc@403 126 val dummy = ErrorMsg.dummySpan
adamc@403 127
adamc@403 128 val ktype = (L'.KType, dummy)
adamc@403 129 val kname = (L'.KName, dummy)
adamc@403 130 val ktype_record = (L'.KRecord ktype, dummy)
adamc@403 131
adamc@403 132 val cerror = (L'.CError, dummy)
adamc@403 133 val kerror = (L'.KError, dummy)
adamc@403 134 val eerror = (L'.EError, dummy)
adamc@403 135 val sgnerror = (L'.SgnError, dummy)
adamc@403 136 val strerror = (L'.StrError, dummy)
adamc@403 137
adamc@403 138 val int = ref cerror
adamc@403 139 val float = ref cerror
adamc@403 140 val string = ref cerror
adamc@403 141 val table = ref cerror
adamc@403 142
adamc@403 143 local
adamc@403 144 val count = ref 0
adamc@403 145 in
adamc@403 146
adamc@403 147 fun resetKunif () = count := 0
adamc@403 148
adamc@403 149 fun kunif loc =
adamc@403 150 let
adamc@403 151 val n = !count
adamc@403 152 val s = if n <= 26 then
adamc@403 153 str (chr (ord #"A" + n))
adamc@403 154 else
adamc@403 155 "U" ^ Int.toString (n - 26)
adamc@403 156 in
adamc@403 157 count := n + 1;
adamc@403 158 (L'.KUnif (loc, s, ref NONE), dummy)
adamc@403 159 end
adamc@403 160
adamc@403 161 end
adamc@403 162
adamc@403 163 local
adamc@403 164 val count = ref 0
adamc@403 165 in
adamc@403 166
adamc@403 167 fun resetCunif () = count := 0
adamc@403 168
adamc@403 169 fun cunif (loc, k) =
adamc@403 170 let
adamc@403 171 val n = !count
adamc@403 172 val s = if n <= 26 then
adamc@403 173 str (chr (ord #"A" + n))
adamc@403 174 else
adamc@403 175 "U" ^ Int.toString (n - 26)
adamc@403 176 in
adamc@403 177 count := n + 1;
adamc@403 178 (L'.CUnif (loc, k, s, ref NONE), dummy)
adamc@403 179 end
adamc@403 180
adamc@403 181 end
adamc@403 182
adamc@623 183 fun elabKind env (k, loc) =
adamc@403 184 case k of
adamc@403 185 L.KType => (L'.KType, loc)
adamc@623 186 | L.KArrow (k1, k2) => (L'.KArrow (elabKind env k1, elabKind env k2), loc)
adamc@403 187 | L.KName => (L'.KName, loc)
adamc@623 188 | L.KRecord k => (L'.KRecord (elabKind env k), loc)
adamc@403 189 | L.KUnit => (L'.KUnit, loc)
adamc@623 190 | L.KTuple ks => (L'.KTuple (map (elabKind env) ks), loc)
adamc@403 191 | L.KWild => kunif loc
adamc@403 192
adamc@623 193 | L.KVar s => (case E.lookupK env s of
adamc@623 194 NONE =>
adamc@623 195 (kindError env (UnboundKind (loc, s));
adamc@623 196 kerror)
adamc@623 197 | SOME n => (L'.KRel n, loc))
adamc@623 198 | L.KFun (x, k) => (L'.KFun (x, elabKind (E.pushKRel env x) k), loc)
adamc@623 199
adamc@621 200 fun mapKind (dom, ran, loc)=
adamc@621 201 (L'.KArrow ((L'.KArrow (dom, ran), loc),
adamc@621 202 (L'.KArrow ((L'.KRecord dom, loc),
adamc@621 203 (L'.KRecord ran, loc)), loc)), loc)
adamc@403 204
adamc@403 205 fun hnormKind (kAll as (k, _)) =
adamc@403 206 case k of
adamc@403 207 L'.KUnif (_, _, ref (SOME k)) => hnormKind k
adamc@403 208 | _ => kAll
adamc@403 209
adamc@623 210 open ElabOps
adamc@623 211
adamc@623 212 fun elabConHead (c as (_, loc)) k =
adamc@623 213 let
adamc@623 214 fun unravel (k, c) =
adamc@623 215 case hnormKind k of
adamc@623 216 (L'.KFun (x, k'), _) =>
adamc@623 217 let
adamc@623 218 val u = kunif loc
adamc@623 219
adamc@623 220 val k'' = subKindInKind (0, u) k'
adamc@623 221 in
adamc@623 222 unravel (k'', (L'.CKApp (c, u), loc))
adamc@623 223 end
adamc@623 224 | _ => (c, k)
adamc@623 225 in
adamc@623 226 unravel (k, c)
adamc@623 227 end
adamc@623 228
adamc@403 229 fun elabCon (env, denv) (c, loc) =
adamc@403 230 case c of
adamc@403 231 L.CAnnot (c, k) =>
adamc@403 232 let
adamc@623 233 val k' = elabKind env k
adamc@403 234 val (c', ck, gs) = elabCon (env, denv) c
adamc@403 235 in
adamc@403 236 checkKind env c' ck k';
adamc@403 237 (c', k', gs)
adamc@403 238 end
adamc@403 239
adamc@403 240 | L.TFun (t1, t2) =>
adamc@403 241 let
adamc@403 242 val (t1', k1, gs1) = elabCon (env, denv) t1
adamc@403 243 val (t2', k2, gs2) = elabCon (env, denv) t2
adamc@403 244 in
adamc@403 245 checkKind env t1' k1 ktype;
adamc@403 246 checkKind env t2' k2 ktype;
adamc@403 247 ((L'.TFun (t1', t2'), loc), ktype, gs1 @ gs2)
adamc@403 248 end
adamc@403 249 | L.TCFun (e, x, k, t) =>
adamc@403 250 let
adamc@403 251 val e' = elabExplicitness e
adamc@623 252 val k' = elabKind env k
adamc@403 253 val env' = E.pushCRel env x k'
adamc@403 254 val (t', tk, gs) = elabCon (env', D.enter denv) t
adamc@403 255 in
adamc@403 256 checkKind env t' tk ktype;
adamc@403 257 ((L'.TCFun (e', x, k', t'), loc), ktype, gs)
adamc@403 258 end
adamc@623 259 | L.TKFun (x, t) =>
adamc@623 260 let
adamc@623 261 val env' = E.pushKRel env x
adamc@623 262 val (t', tk, gs) = elabCon (env', denv) t
adamc@623 263 in
adamc@623 264 checkKind env t' tk ktype;
adamc@623 265 ((L'.TKFun (x, t'), loc), ktype, gs)
adamc@623 266 end
adamc@628 267 | L.TDisjoint (c1, c2, c) =>
adamc@403 268 let
adamc@403 269 val (c1', k1, gs1) = elabCon (env, denv) c1
adamc@403 270 val (c2', k2, gs2) = elabCon (env, denv) c2
adamc@403 271
adamc@403 272 val ku1 = kunif loc
adamc@403 273 val ku2 = kunif loc
adamc@403 274
adamc@628 275 val denv' = D.assert env denv (c1', c2')
adamc@403 276 val (c', k, gs4) = elabCon (env, denv') c
adamc@403 277 in
adamc@403 278 checkKind env c1' k1 (L'.KRecord ku1, loc);
adamc@403 279 checkKind env c2' k2 (L'.KRecord ku2, loc);
adamc@403 280
adamc@628 281 ((L'.TDisjoint (c1', c2', c'), loc), k, gs1 @ gs2 @ gs4)
adamc@403 282 end
adamc@403 283 | L.TRecord c =>
adamc@403 284 let
adamc@403 285 val (c', ck, gs) = elabCon (env, denv) c
adamc@403 286 val k = (L'.KRecord ktype, loc)
adamc@403 287 in
adamc@403 288 checkKind env c' ck k;
adamc@403 289 ((L'.TRecord c', loc), ktype, gs)
adamc@403 290 end
adamc@403 291
adamc@403 292 | L.CVar ([], s) =>
adamc@403 293 (case E.lookupC env s of
adamc@403 294 E.NotBound =>
adamc@403 295 (conError env (UnboundCon (loc, s));
adamc@403 296 (cerror, kerror, []))
adamc@403 297 | E.Rel (n, k) =>
adamc@623 298 let
adamc@623 299 val (c, k) = elabConHead (L'.CRel n, loc) k
adamc@623 300 in
adamc@623 301 (c, k, [])
adamc@623 302 end
adamc@403 303 | E.Named (n, k) =>
adamc@623 304 let
adamc@623 305 val (c, k) = elabConHead (L'.CNamed n, loc) k
adamc@623 306 in
adamc@623 307 (c, k, [])
adamc@623 308 end)
adamc@403 309 | L.CVar (m1 :: ms, s) =>
adamc@403 310 (case E.lookupStr env m1 of
adamc@403 311 NONE => (conError env (UnboundStrInCon (loc, m1));
adamc@403 312 (cerror, kerror, []))
adamc@403 313 | SOME (n, sgn) =>
adamc@403 314 let
adamc@403 315 val (str, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@403 316 case E.projectStr env {sgn = sgn, str = str, field = m} of
adamc@403 317 NONE => (conError env (UnboundStrInCon (loc, m));
adamc@403 318 (strerror, sgnerror))
adamc@403 319 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@403 320 ((L'.StrVar n, loc), sgn) ms
adamc@403 321
adamc@403 322 val k = case E.projectCon env {sgn = sgn, str = str, field = s} of
adamc@403 323 NONE => (conError env (UnboundCon (loc, s));
adamc@403 324 kerror)
adamc@403 325 | SOME (k, _) => k
adamc@403 326 in
adamc@403 327 ((L'.CModProj (n, ms, s), loc), k, [])
adamc@403 328 end)
adamc@403 329
adamc@403 330 | L.CApp (c1, c2) =>
adamc@403 331 let
adamc@403 332 val (c1', k1, gs1) = elabCon (env, denv) c1
adamc@403 333 val (c2', k2, gs2) = elabCon (env, denv) c2
adamc@403 334 val dom = kunif loc
adamc@403 335 val ran = kunif loc
adamc@403 336 in
adamc@403 337 checkKind env c1' k1 (L'.KArrow (dom, ran), loc);
adamc@403 338 checkKind env c2' k2 dom;
adamc@403 339 ((L'.CApp (c1', c2'), loc), ran, gs1 @ gs2)
adamc@403 340 end
adamc@403 341 | L.CAbs (x, ko, t) =>
adamc@403 342 let
adamc@403 343 val k' = case ko of
adamc@403 344 NONE => kunif loc
adamc@623 345 | SOME k => elabKind env k
adamc@403 346 val env' = E.pushCRel env x k'
adamc@403 347 val (t', tk, gs) = elabCon (env', D.enter denv) t
adamc@403 348 in
adamc@403 349 ((L'.CAbs (x, k', t'), loc),
adamc@403 350 (L'.KArrow (k', tk), loc),
adamc@403 351 gs)
adamc@403 352 end
adamc@623 353 | L.CKAbs (x, t) =>
adamc@623 354 let
adamc@623 355 val env' = E.pushKRel env x
adamc@623 356 val (t', tk, gs) = elabCon (env', denv) t
adamc@623 357 in
adamc@623 358 ((L'.CKAbs (x, t'), loc),
adamc@623 359 (L'.KFun (x, tk), loc),
adamc@623 360 gs)
adamc@623 361 end
adamc@403 362
adamc@403 363 | L.CName s =>
adamc@403 364 ((L'.CName s, loc), kname, [])
adamc@403 365
adamc@403 366 | L.CRecord xcs =>
adamc@403 367 let
adamc@403 368 val k = kunif loc
adamc@403 369
adamc@403 370 val (xcs', gs) = ListUtil.foldlMap (fn ((x, c), gs) =>
adamc@403 371 let
adamc@403 372 val (x', xk, gs1) = elabCon (env, denv) x
adamc@403 373 val (c', ck, gs2) = elabCon (env, denv) c
adamc@403 374 in
adamc@403 375 checkKind env x' xk kname;
adamc@403 376 checkKind env c' ck k;
adamc@403 377 ((x', c'), gs1 @ gs2 @ gs)
adamc@403 378 end) [] xcs
adamc@403 379
adamc@403 380 val rc = (L'.CRecord (k, xcs'), loc)
adamc@403 381 (* Add duplicate field checking later. *)
adamc@403 382
adamc@403 383 fun prove (xcs, ds) =
adamc@403 384 case xcs of
adamc@403 385 [] => ds
adamc@403 386 | xc :: rest =>
adamc@403 387 let
adamc@403 388 val r1 = (L'.CRecord (k, [xc]), loc)
adamc@403 389 val ds = foldl (fn (xc', ds) =>
adamc@403 390 let
adamc@403 391 val r2 = (L'.CRecord (k, [xc']), loc)
adamc@403 392 in
adamc@403 393 D.prove env denv (r1, r2, loc) @ ds
adamc@403 394 end)
adamc@403 395 ds rest
adamc@403 396 in
adamc@403 397 prove (rest, ds)
adamc@403 398 end
adamc@403 399 in
adamc@403 400 (rc, (L'.KRecord k, loc), prove (xcs', gs))
adamc@403 401 end
adamc@403 402 | L.CConcat (c1, c2) =>
adamc@403 403 let
adamc@403 404 val (c1', k1, gs1) = elabCon (env, denv) c1
adamc@403 405 val (c2', k2, gs2) = elabCon (env, denv) c2
adamc@403 406 val ku = kunif loc
adamc@403 407 val k = (L'.KRecord ku, loc)
adamc@403 408 in
adamc@403 409 checkKind env c1' k1 k;
adamc@403 410 checkKind env c2' k2 k;
adamc@403 411 ((L'.CConcat (c1', c2'), loc), k,
adamc@403 412 D.prove env denv (c1', c2', loc) @ gs1 @ gs2)
adamc@403 413 end
adamc@621 414 | L.CMap =>
adamc@403 415 let
adamc@403 416 val dom = kunif loc
adamc@403 417 val ran = kunif loc
adamc@403 418 in
adamc@621 419 ((L'.CMap (dom, ran), loc),
adamc@621 420 mapKind (dom, ran, loc),
adamc@403 421 [])
adamc@403 422 end
adamc@403 423
adamc@403 424 | L.CUnit => ((L'.CUnit, loc), (L'.KUnit, loc), [])
adamc@403 425
adamc@403 426 | L.CTuple cs =>
adamc@403 427 let
adamc@403 428 val (cs', ks, gs) = foldl (fn (c, (cs', ks, gs)) =>
adamc@403 429 let
adamc@403 430 val (c', k, gs') = elabCon (env, denv) c
adamc@403 431 in
adamc@403 432 (c' :: cs', k :: ks, gs' @ gs)
adamc@403 433 end) ([], [], []) cs
adamc@403 434 in
adamc@403 435 ((L'.CTuple (rev cs'), loc), (L'.KTuple (rev ks), loc), gs)
adamc@403 436 end
adamc@403 437 | L.CProj (c, n) =>
adamc@403 438 let
adamc@403 439 val (c', k, gs) = elabCon (env, denv) c
adamc@403 440 in
adamc@403 441 case hnormKind k of
adamc@403 442 (L'.KTuple ks, _) =>
adamc@403 443 if n <= 0 orelse n > length ks then
adamc@403 444 (conError env (ProjBounds (c', n));
adamc@83 445 (cerror, kerror, []))
adamc@403 446 else
adamc@403 447 ((L'.CProj (c', n), loc), List.nth (ks, n - 1), gs)
adamc@403 448 | k => (conError env (ProjMismatch (c', k));
adamc@403 449 (cerror, kerror, []))
adamc@403 450 end
adamc@403 451
adamc@403 452 | L.CWild k =>
adamc@403 453 let
adamc@623 454 val k' = elabKind env k
adamc@403 455 in
adamc@403 456 (cunif (loc, k'), k', [])
adamc@403 457 end
adamc@403 458
adamc@403 459 fun kunifsRemain k =
adamc@403 460 case k of
adamc@403 461 L'.KUnif (_, _, ref NONE) => true
adamc@403 462 | _ => false
adamc@403 463 fun cunifsRemain c =
adamc@403 464 case c of
adamc@403 465 L'.CUnif (loc, _, _, ref NONE) => SOME loc
adamc@403 466 | _ => NONE
adamc@403 467
adamc@403 468 val kunifsInDecl = U.Decl.exists {kind = kunifsRemain,
adamc@403 469 con = fn _ => false,
adamc@403 470 exp = fn _ => false,
adamc@403 471 sgn_item = fn _ => false,
adamc@403 472 sgn = fn _ => false,
adamc@403 473 str = fn _ => false,
adamc@403 474 decl = fn _ => false}
adamc@403 475
adamc@403 476 val cunifsInDecl = U.Decl.search {kind = fn _ => NONE,
adamc@403 477 con = cunifsRemain,
adamc@403 478 exp = fn _ => NONE,
adamc@403 479 sgn_item = fn _ => NONE,
adamc@403 480 sgn = fn _ => NONE,
adamc@403 481 str = fn _ => NONE,
adamc@403 482 decl = fn _ => NONE}
adamc@403 483
adamc@403 484 fun occursCon r =
adamc@403 485 U.Con.exists {kind = fn _ => false,
adamc@403 486 con = fn L'.CUnif (_, _, _, r') => r = r'
adamc@403 487 | _ => false}
adamc@403 488
adamc@403 489 exception CUnify' of cunify_error
adamc@403 490
adamc@403 491 exception SynUnif = E.SynUnif
adamc@403 492
adamc@403 493 type record_summary = {
adamc@403 494 fields : (L'.con * L'.con) list,
adamc@403 495 unifs : (L'.con * L'.con option ref) list,
adamc@403 496 others : L'.con list
adamc@403 497 }
adamc@403 498
adamc@403 499 fun summaryToCon {fields, unifs, others} =
adamc@403 500 let
adamc@403 501 val c = (L'.CRecord (ktype, []), dummy)
adamc@403 502 val c = List.foldr (fn (c', c) => (L'.CConcat (c', c), dummy)) c others
adamc@403 503 val c = List.foldr (fn ((c', _), c) => (L'.CConcat (c', c), dummy)) c unifs
adamc@403 504 in
adamc@403 505 (L'.CConcat ((L'.CRecord (ktype, fields), dummy), c), dummy)
adamc@403 506 end
adamc@403 507
adamc@403 508 fun p_summary env s = p_con env (summaryToCon s)
adamc@403 509
adamc@403 510 exception CUnify of L'.con * L'.con * cunify_error
adamc@403 511
adamc@403 512 fun kindof env (c, loc) =
adamc@403 513 case c of
adamc@403 514 L'.TFun _ => ktype
adamc@403 515 | L'.TCFun _ => ktype
adamc@403 516 | L'.TRecord _ => ktype
adamc@628 517 | L'.TDisjoint _ => ktype
adamc@403 518
adamc@403 519 | L'.CRel xn => #2 (E.lookupCRel env xn)
adamc@403 520 | L'.CNamed xn => #2 (E.lookupCNamed env xn)
adamc@403 521 | L'.CModProj (n, ms, x) =>
adamc@403 522 let
adamc@403 523 val (_, sgn) = E.lookupStrNamed env n
adamc@403 524 val (str, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@403 525 case E.projectStr env {sgn = sgn, str = str, field = m} of
adamc@403 526 NONE => raise Fail "kindof: Unknown substructure"
adamc@403 527 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@403 528 ((L'.StrVar n, loc), sgn) ms
adamc@403 529 in
adamc@403 530 case E.projectCon env {sgn = sgn, str = str, field = x} of
adamc@403 531 NONE => raise Fail "kindof: Unknown con in structure"
adamc@403 532 | SOME (k, _) => k
adamc@403 533 end
adamc@403 534
adamc@403 535 | L'.CApp (c, _) =>
adamc@403 536 (case hnormKind (kindof env c) of
adamc@403 537 (L'.KArrow (_, k), _) => k
adamc@403 538 | (L'.KError, _) => kerror
adamc@413 539 | k => raise CUnify' (CKindof (k, c, "arrow")))
adamc@403 540 | L'.CAbs (x, k, c) => (L'.KArrow (k, kindof (E.pushCRel env x k) c), loc)
adamc@628 541
adamc@403 542
adamc@403 543 | L'.CName _ => kname
adamc@403 544
adamc@403 545 | L'.CRecord (k, _) => (L'.KRecord k, loc)
adamc@403 546 | L'.CConcat (c, _) => kindof env c
adamc@621 547 | L'.CMap (dom, ran) => mapKind (dom, ran, loc)
adamc@403 548
adamc@403 549 | L'.CUnit => (L'.KUnit, loc)
adamc@403 550
adamc@403 551 | L'.CTuple cs => (L'.KTuple (map (kindof env) cs), loc)
adamc@403 552 | L'.CProj (c, n) =>
adamc@403 553 (case hnormKind (kindof env c) of
adamc@403 554 (L'.KTuple ks, _) => List.nth (ks, n - 1)
adamc@413 555 | k => raise CUnify' (CKindof (k, c, "tuple")))
adamc@403 556
adamc@403 557 | L'.CError => kerror
adamc@403 558 | L'.CUnif (_, k, _, _) => k
adamc@403 559
adamc@623 560 | L'.CKAbs (x, c) => (L'.KFun (x, kindof (E.pushKRel env x) c), loc)
adamc@623 561 | L'.CKApp (c, k) =>
adamc@623 562 (case hnormKind (kindof env c) of
adamc@623 563 (L'.KFun (_, k'), _) => subKindInKind (0, k) k'
adamc@623 564 | k => raise CUnify' (CKindof (k, c, "kapp")))
adamc@623 565 | L'.TKFun _ => ktype
adamc@403 566
adamc@621 567 exception GuessFailure
adamc@403 568
adamc@513 569 fun isUnitCon env (c, loc) =
adamc@513 570 case c of
adamc@513 571 L'.TFun _ => false
adamc@513 572 | L'.TCFun _ => false
adamc@513 573 | L'.TRecord _ => false
adamc@628 574 | L'.TDisjoint _ => false
adamc@513 575
adamc@513 576 | L'.CRel xn => #1 (#2 (E.lookupCRel env xn)) = L'.KUnit
adamc@513 577 | L'.CNamed xn => #1 (#2 (E.lookupCNamed env xn)) = L'.KUnit
adamc@518 578 | L'.CModProj (n, ms, x) => false
adamc@518 579 (*let
adamc@513 580 val (_, sgn) = E.lookupStrNamed env n
adamc@513 581 val (str, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@513 582 case E.projectStr env {sgn = sgn, str = str, field = m} of
adamc@513 583 NONE => raise Fail "kindof: Unknown substructure"
adamc@513 584 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@513 585 ((L'.StrVar n, loc), sgn) ms
adamc@513 586 in
adamc@513 587 case E.projectCon env {sgn = sgn, str = str, field = x} of
adamc@513 588 NONE => raise Fail "kindof: Unknown con in structure"
adamc@513 589 | SOME ((k, _), _) => k = L'.KUnit
adamc@518 590 end*)
adamc@518 591
adamc@518 592 | L'.CApp (c, _) => false
adamc@518 593 (*(case hnormKind (kindof env c) of
adamc@513 594 (L'.KArrow (_, k), _) => #1 k = L'.KUnit
adamc@513 595 | (L'.KError, _) => false
adamc@518 596 | k => raise CUnify' (CKindof (k, c, "arrow")))*)
adamc@513 597 | L'.CAbs _ => false
adamc@513 598
adamc@513 599 | L'.CName _ => false
adamc@513 600
adamc@513 601 | L'.CRecord _ => false
adamc@513 602 | L'.CConcat _ => false
adamc@621 603 | L'.CMap _ => false
adamc@513 604
adamc@513 605 | L'.CUnit => true
adamc@513 606
adamc@513 607 | L'.CTuple _ => false
adamc@518 608 | L'.CProj (c, n) => false
adamc@518 609 (*(case hnormKind (kindof env c) of
adamc@513 610 (L'.KTuple ks, _) => #1 (List.nth (ks, n - 1)) = L'.KUnit
adamc@518 611 | k => raise CUnify' (CKindof (k, c, "tuple")))*)
adamc@513 612
adamc@513 613 | L'.CError => false
adamc@513 614 | L'.CUnif (_, k, _, _) => #1 k = L'.KUnit
adamc@513 615
adamc@623 616 | L'.CKAbs _ => false
adamc@623 617 | L'.CKApp _ => false
adamc@623 618 | L'.TKFun _ => false
adamc@623 619
adamc@628 620 fun unifyRecordCons env (c1, c2) =
adamc@403 621 let
adamc@403 622 fun rkindof c =
adamc@403 623 case hnormKind (kindof env c) of
adamc@403 624 (L'.KRecord k, _) => k
adamc@403 625 | (L'.KError, _) => kerror
adamc@413 626 | k => raise CUnify' (CKindof (k, c, "record"))
adamc@403 627
adamc@403 628 val k1 = rkindof c1
adamc@403 629 val k2 = rkindof c2
adamc@403 630
adamc@628 631 val r1 = recordSummary env c1
adamc@628 632 val r2 = recordSummary env c2
adamc@403 633 in
adamc@623 634 unifyKinds env k1 k2;
adamc@628 635 unifySummaries env (k1, r1, r2)
adamc@403 636 end
adamc@403 637
adamc@628 638 and recordSummary env c =
adamc@403 639 let
adamc@628 640 val c = hnormCon env c
adamc@628 641
adamc@628 642 val sum =
adamc@403 643 case c of
adamc@628 644 (L'.CRecord (_, xcs), _) => {fields = xcs, unifs = [], others = []}
adamc@403 645 | (L'.CConcat (c1, c2), _) =>
adamc@403 646 let
adamc@628 647 val s1 = recordSummary env c1
adamc@628 648 val s2 = recordSummary env c2
adamc@403 649 in
adamc@628 650 {fields = #fields s1 @ #fields s2,
adamc@628 651 unifs = #unifs s1 @ #unifs s2,
adamc@628 652 others = #others s1 @ #others s2}
adamc@403 653 end
adamc@628 654 | (L'.CUnif (_, _, _, ref (SOME c)), _) => recordSummary env c
adamc@628 655 | c' as (L'.CUnif (_, _, _, r), _) => {fields = [], unifs = [(c', r)], others = []}
adamc@628 656 | c' => {fields = [], unifs = [], others = [c']}
adamc@403 657 in
adamc@628 658 sum
adamc@403 659 end
adamc@403 660
adamc@628 661 and consEq env (c1, c2) =
adamc@628 662 (unifyCons env c1 c2;
adamc@628 663 true)
adamc@403 664 handle CUnify _ => false
adamc@403 665
adamc@403 666 and consNeq env (c1, c2) =
adamc@628 667 case (#1 (hnormCon env c1), #1 (hnormCon env c2)) of
adamc@403 668 (L'.CName x1, L'.CName x2) => x1 <> x2
adamc@403 669 | _ => false
adamc@403 670
adamc@628 671 and unifySummaries env (k, s1 : record_summary, s2 : record_summary) =
adamc@403 672 let
adamc@403 673 val loc = #2 k
adamc@403 674 (*val () = eprefaces "Summaries" [("#1", p_summary env s1),
adamc@403 675 ("#2", p_summary env s2)]*)
adamc@403 676
adamc@403 677 fun eatMatching p (ls1, ls2) =
adamc@403 678 let
adamc@403 679 fun em (ls1, ls2, passed1) =
adamc@403 680 case ls1 of
adamc@403 681 [] => (rev passed1, ls2)
adamc@403 682 | h1 :: t1 =>
adamc@403 683 let
adamc@403 684 fun search (ls2', passed2) =
adamc@403 685 case ls2' of
adamc@403 686 [] => em (t1, ls2, h1 :: passed1)
adamc@403 687 | h2 :: t2 =>
adamc@403 688 if p (h1, h2) then
adamc@403 689 em (t1, List.revAppend (passed2, t2), passed1)
adamc@403 690 else
adamc@403 691 search (t2, h2 :: passed2)
adamc@403 692 in
adamc@403 693 search (ls2, [])
adamc@403 694 end
adamc@403 695 in
adamc@403 696 em (ls1, ls2, [])
adamc@403 697 end
adamc@403 698
adamc@403 699 val (fs1, fs2) = eatMatching (fn ((x1, c1), (x2, c2)) =>
adamc@403 700 not (consNeq env (x1, x2))
adamc@628 701 andalso consEq env (c1, c2)
adamc@628 702 andalso consEq env (x1, x2))
adamc@403 703 (#fields s1, #fields s2)
adamc@403 704 (*val () = eprefaces "Summaries2" [("#1", p_summary env {fields = fs1, unifs = #unifs s1, others = #others s1}),
adamc@403 705 ("#2", p_summary env {fields = fs2, unifs = #unifs s2, others = #others s2})]*)
adamc@403 706 val (unifs1, unifs2) = eatMatching (fn ((_, r1), (_, r2)) => r1 = r2) (#unifs s1, #unifs s2)
adamc@628 707 val (others1, others2) = eatMatching (consEq env) (#others s1, #others s2)
adamc@403 708 (*val () = eprefaces "Summaries3" [("#1", p_summary env {fields = fs1, unifs = unifs1, others = others1}),
adamc@403 709 ("#2", p_summary env {fields = fs2, unifs = unifs2, others = others2})]*)
adamc@403 710
adamc@403 711 fun unifFields (fs, others, unifs) =
adamc@403 712 case (fs, others, unifs) of
adamc@403 713 ([], [], _) => ([], [], unifs)
adamc@403 714 | (_, _, []) => (fs, others, [])
adamc@403 715 | (_, _, (_, r) :: rest) =>
adamc@403 716 let
adamc@403 717 val r' = ref NONE
adamc@403 718 val kr = (L'.KRecord k, dummy)
adamc@403 719 val cr' = (L'.CUnif (dummy, kr, "recd", r'), dummy)
adamc@403 720
adamc@403 721 val prefix = case (fs, others) of
adamc@403 722 ([], other :: others) =>
adamc@403 723 List.foldl (fn (other, c) =>
adamc@403 724 (L'.CConcat (c, other), dummy))
adamc@403 725 other others
adamc@403 726 | (fs, []) =>
adamc@403 727 (L'.CRecord (k, fs), dummy)
adamc@403 728 | (fs, others) =>
adamc@403 729 List.foldl (fn (other, c) =>
adamc@403 730 (L'.CConcat (c, other), dummy))
adamc@403 731 (L'.CRecord (k, fs), dummy) others
adamc@403 732 in
adamc@403 733 r := SOME (L'.CConcat (prefix, cr'), dummy);
adamc@403 734 ([], [], (cr', r') :: rest)
adamc@403 735 end
adamc@403 736
adamc@403 737 val (fs1, others1, unifs2) = unifFields (fs1, others1, unifs2)
adamc@403 738 val (fs2, others2, unifs1) = unifFields (fs2, others2, unifs1)
adamc@403 739
adamc@403 740 (*val () = eprefaces "Summaries4" [("#1", p_summary env {fields = fs1, unifs = unifs1, others = others1}),
adamc@403 741 ("#2", p_summary env {fields = fs2, unifs = unifs2, others = others2})]*)
adamc@403 742
adamc@403 743 fun isGuessable (other, fs) =
adamc@628 744 (guessMap env (other, (L'.CRecord (k, fs), loc), GuessFailure);
adamc@628 745 true)
adamc@621 746 handle GuessFailure => false
adamc@403 747
adamc@403 748 val (fs1, fs2, others1, others2) =
adamc@403 749 case (fs1, fs2, others1, others2) of
adamc@403 750 ([], _, [other1], []) =>
adamc@403 751 if isGuessable (other1, fs2) then
adamc@403 752 ([], [], [], [])
adamc@403 753 else
adamc@403 754 (fs1, fs2, others1, others2)
adamc@403 755 | (_, [], [], [other2]) =>
adamc@403 756 if isGuessable (other2, fs1) then
adamc@403 757 ([], [], [], [])
adamc@403 758 else
adamc@403 759 (fs1, fs2, others1, others2)
adamc@403 760 | _ => (fs1, fs2, others1, others2)
adamc@403 761
adamc@403 762 (*val () = eprefaces "Summaries5" [("#1", p_summary env {fields = fs1, unifs = unifs1, others = others1}),
adamc@403 763 ("#2", p_summary env {fields = fs2, unifs = unifs2, others = others2})]*)
adamc@403 764
adamc@403 765 val clear = case (fs1, others1, fs2, others2) of
adamc@403 766 ([], [], [], []) => true
adamc@403 767 | _ => false
adamc@403 768 val empty = (L'.CRecord (k, []), dummy)
adamc@403 769
adamc@403 770 fun unsummarize {fields, unifs, others} =
adamc@403 771 let
adamc@403 772 val c = (L'.CRecord (k, fields), loc)
adamc@403 773
adamc@403 774 val c = foldl (fn ((c1, _), c2) => (L'.CConcat (c1, c2), loc))
adamc@403 775 c unifs
adamc@403 776 in
adamc@403 777 foldl (fn (c1, c2) => (L'.CConcat (c1, c2), loc))
adamc@403 778 c others
adamc@403 779 end
adamc@403 780
adamc@403 781 fun pairOffUnifs (unifs1, unifs2) =
adamc@403 782 case (unifs1, unifs2) of
adamc@403 783 ([], _) =>
adamc@403 784 if clear then
adamc@403 785 List.app (fn (_, r) => r := SOME empty) unifs2
adamc@403 786 else
adamc@403 787 raise CUnify' (CRecordFailure (unsummarize s1, unsummarize s2))
adamc@403 788 | (_, []) =>
adamc@403 789 if clear then
adamc@403 790 List.app (fn (_, r) => r := SOME empty) unifs1
adamc@403 791 else
adamc@403 792 raise CUnify' (CRecordFailure (unsummarize s1, unsummarize s2))
adamc@403 793 | ((c1, _) :: rest1, (_, r2) :: rest2) =>
adamc@403 794 (r2 := SOME c1;
adamc@403 795 pairOffUnifs (rest1, rest2))
adamc@403 796 in
adamc@403 797 pairOffUnifs (unifs1, unifs2)
adamc@403 798 (*before eprefaces "Summaries'" [("#1", p_summary env s1),
adamc@403 799 ("#2", p_summary env s2)]*)
adamc@403 800 end
adamc@403 801
adamc@628 802 and guessMap env (c1, c2, ex) =
adamc@403 803 let
adamc@403 804 val loc = #2 c1
adamc@403 805
adamc@621 806 fun unfold (dom, ran, f, r, c) =
adamc@403 807 let
adamc@621 808 fun unfold (r, c) =
adamc@628 809 case #1 c of
adamc@628 810 L'.CRecord (_, []) => unifyCons env r (L'.CRecord (dom, []), loc)
adamc@628 811 | L'.CRecord (_, [(x, v)]) =>
adamc@628 812 let
adamc@628 813 val v' = case dom of
adamc@628 814 (L'.KUnit, _) => (L'.CUnit, loc)
adamc@628 815 | _ => cunif (loc, dom)
adamc@628 816 in
adamc@628 817 unifyCons env v (L'.CApp (f, v'), loc);
adamc@628 818 unifyCons env r (L'.CRecord (dom, [(x, v')]), loc)
adamc@628 819 end
adamc@628 820 | L'.CRecord (_, (x, v) :: rest) =>
adamc@628 821 let
adamc@628 822 val r1 = cunif (loc, (L'.KRecord dom, loc))
adamc@628 823 val r2 = cunif (loc, (L'.KRecord dom, loc))
adamc@628 824 in
adamc@628 825 unfold (r1, (L'.CRecord (ran, [(x, v)]), loc));
adamc@628 826 unfold (r2, (L'.CRecord (ran, rest), loc));
adamc@628 827 unifyCons env r (L'.CConcat (r1, r2), loc)
adamc@628 828 end
adamc@628 829 | L'.CConcat (c1', c2') =>
adamc@628 830 let
adamc@628 831 val r1 = cunif (loc, (L'.KRecord dom, loc))
adamc@628 832 val r2 = cunif (loc, (L'.KRecord dom, loc))
adamc@628 833 in
adamc@628 834 unfold (r1, c1');
adamc@628 835 unfold (r2, c2');
adamc@628 836 unifyCons env r (L'.CConcat (r1, r2), loc)
adamc@628 837 end
adamc@628 838 | _ => raise ex
adamc@403 839 in
adamc@621 840 unfold (r, c)
adamc@403 841 end
adamc@632 842 handle _ => raise ex
adamc@403 843 in
adamc@403 844 case (#1 c1, #1 c2) of
adamc@621 845 (L'.CApp ((L'.CApp ((L'.CMap (dom, ran), _), f), _), r), _) =>
adamc@621 846 unfold (dom, ran, f, r, c2)
adamc@621 847 | (_, L'.CApp ((L'.CApp ((L'.CMap (dom, ran), _), f), _), r)) =>
adamc@621 848 unfold (dom, ran, f, r, c1)
adamc@403 849 | _ => raise ex
adamc@403 850 end
adamc@403 851
adamc@628 852 and unifyCons' env c1 c2 =
adamc@628 853 if isUnitCon env c1 andalso isUnitCon env c2 then
adamc@628 854 ()
adamc@628 855 else
adamc@403 856 let
adamc@628 857 (*val befor = Time.now ()
adamc@628 858 val old1 = c1
adamc@628 859 val old2 = c2*)
adamc@628 860 val c1 = hnormCon env c1
adamc@628 861 val c2 = hnormCon env c2
adamc@403 862 in
adamc@628 863 unifyCons'' env c1 c2
adamc@628 864 handle ex => guessMap env (c1, c2, ex)
adamc@403 865 end
adamc@628 866
adamc@628 867 and unifyCons'' env (c1All as (c1, loc)) (c2All as (c2, _)) =
adamc@403 868 let
adamc@403 869 fun err f = raise CUnify' (f (c1All, c2All))
adamc@403 870
adamc@628 871 fun isRecord () = unifyRecordCons env (c1All, c2All)
adamc@403 872 in
adamc@403 873 (*eprefaces "unifyCons''" [("c1All", p_con env c1All),
adamc@403 874 ("c2All", p_con env c2All)];*)
adamc@403 875
adamc@403 876 case (c1, c2) of
adamc@632 877 (L'.CError, _) => ()
adamc@632 878 | (_, L'.CError) => ()
adamc@632 879
adamc@632 880 | (L'.CUnif (_, k1, _, r1), L'.CUnif (_, k2, _, r2)) =>
adamc@632 881 if r1 = r2 then
adamc@632 882 ()
adamc@632 883 else
adamc@632 884 (unifyKinds env k1 k2;
adamc@632 885 r1 := SOME c2All)
adamc@632 886
adamc@632 887 | (L'.CUnif (_, _, _, r), _) =>
adamc@632 888 if occursCon r c2All then
adamc@632 889 err COccursCheckFailed
adamc@632 890 else
adamc@632 891 r := SOME c2All
adamc@632 892 | (_, L'.CUnif (_, _, _, r)) =>
adamc@632 893 if occursCon r c1All then
adamc@632 894 err COccursCheckFailed
adamc@632 895 else
adamc@632 896 r := SOME c1All
adamc@632 897
adamc@632 898 | (L'.CUnit, L'.CUnit) => ()
adamc@403 899
adamc@403 900 | (L'.TFun (d1, r1), L'.TFun (d2, r2)) =>
adamc@628 901 (unifyCons' env d1 d2;
adamc@628 902 unifyCons' env r1 r2)
adamc@403 903 | (L'.TCFun (expl1, x1, d1, r1), L'.TCFun (expl2, _, d2, r2)) =>
adamc@403 904 if expl1 <> expl2 then
adamc@403 905 err CExplicitness
adamc@403 906 else
adamc@623 907 (unifyKinds env d1 d2;
adamc@514 908 let
adamc@514 909 (*val befor = Time.now ()*)
adamc@514 910 val env' = E.pushCRel env x1 d1
adamc@514 911 in
adamc@514 912 (*TextIO.print ("E.pushCRel: "
adamc@514 913 ^ LargeReal.toString (Time.toReal (Time.- (Time.now (), befor)))
adamc@514 914 ^ "\n");*)
adamc@628 915 unifyCons' env' r1 r2
adamc@514 916 end)
adamc@628 917 | (L'.TRecord r1, L'.TRecord r2) => unifyCons' env r1 r2
adamc@628 918 | (L'.TDisjoint (c1, d1, e1), L'.TDisjoint (c2, d2, e2)) =>
adamc@628 919 (unifyCons' env c1 c2;
adamc@628 920 unifyCons' env d1 d2;
adamc@628 921 unifyCons' env e1 e2)
adamc@403 922
adamc@403 923 | (L'.CRel n1, L'.CRel n2) =>
adamc@403 924 if n1 = n2 then
adamc@628 925 ()
adamc@403 926 else
adamc@403 927 err CIncompatible
adamc@403 928 | (L'.CNamed n1, L'.CNamed n2) =>
adamc@403 929 if n1 = n2 then
adamc@628 930 ()
adamc@403 931 else
adamc@403 932 err CIncompatible
adamc@403 933
adamc@403 934 | (L'.CApp (d1, r1), L'.CApp (d2, r2)) =>
adamc@628 935 (unifyCons' env d1 d2;
adamc@628 936 unifyCons' env r1 r2)
adamc@403 937 | (L'.CAbs (x1, k1, c1), L'.CAbs (_, k2, c2)) =>
adamc@623 938 (unifyKinds env k1 k2;
adamc@628 939 unifyCons' (E.pushCRel env x1 k1) c1 c2)
adamc@403 940
adamc@403 941 | (L'.CName n1, L'.CName n2) =>
adamc@403 942 if n1 = n2 then
adamc@628 943 ()
adamc@403 944 else
adamc@403 945 err CIncompatible
adamc@403 946
adamc@403 947 | (L'.CModProj (n1, ms1, x1), L'.CModProj (n2, ms2, x2)) =>
adamc@403 948 if n1 = n2 andalso ms1 = ms2 andalso x1 = x2 then
adamc@628 949 ()
adamc@403 950 else
adamc@403 951 err CIncompatible
adamc@403 952
adamc@403 953 | (L'.CTuple cs1, L'.CTuple cs2) =>
adamc@628 954 ((ListPair.appEq (fn (c1, c2) => unifyCons' env c1 c2) (cs1, cs2))
adamc@403 955 handle ListPair.UnequalLengths => err CIncompatible)
adamc@403 956
adamc@632 957 | (L'.CProj (c1, n1), _) =>
adamc@403 958 let
adamc@632 959 fun trySnd () =
adamc@632 960 case #1 (hnormCon env c2All) of
adamc@632 961 L'.CProj (c2, n2) =>
adamc@632 962 let
adamc@632 963 fun tryNormal () =
adamc@632 964 if n1 = n2 then
adamc@632 965 unifyCons' env c1 c2
adamc@632 966 else
adamc@632 967 err CIncompatible
adamc@632 968 in
adamc@632 969 case #1 (hnormCon env c2) of
adamc@632 970 L'.CUnif (_, k, _, r) =>
adamc@632 971 (case #1 (hnormKind k) of
adamc@632 972 L'.KTuple ks =>
adamc@632 973 let
adamc@632 974 val loc = #2 c2
adamc@632 975 val us = map (fn k => cunif (loc, k)) ks
adamc@632 976 in
adamc@632 977 r := SOME (L'.CTuple us, loc);
adamc@632 978 unifyCons' env c1All (List.nth (us, n2 - 1))
adamc@632 979 end
adamc@632 980 | _ => tryNormal ())
adamc@632 981 | _ => tryNormal ()
adamc@632 982 end
adamc@632 983 | _ => err CIncompatible
adamc@403 984 in
adamc@632 985 case #1 (hnormCon env c1) of
adamc@632 986 L'.CUnif (_, k, _, r) =>
adamc@632 987 (case #1 (hnormKind k) of
adamc@632 988 L'.KTuple ks =>
adamc@632 989 let
adamc@632 990 val loc = #2 c1
adamc@632 991 val us = map (fn k => cunif (loc, k)) ks
adamc@632 992 in
adamc@632 993 r := SOME (L'.CTuple us, loc);
adamc@632 994 unifyCons' env (List.nth (us, n1 - 1)) c2All
adamc@632 995 end
adamc@632 996 | _ => trySnd ())
adamc@632 997 | _ => trySnd ()
adamc@403 998 end
adamc@632 999
adamc@632 1000 | (_, L'.CProj (c2, n2)) =>
adamc@632 1001 (case #1 (hnormCon env c2) of
adamc@632 1002 L'.CUnif (_, k, _, r) =>
adamc@632 1003 (case #1 (hnormKind k) of
adamc@632 1004 L'.KTuple ks =>
adamc@632 1005 let
adamc@632 1006 val loc = #2 c2
adamc@632 1007 val us = map (fn k => cunif (loc, k)) ks
adamc@632 1008 in
adamc@632 1009 r := SOME (L'.CTuple us, loc);
adamc@632 1010 unifyCons' env c1All (List.nth (us, n2 - 1))
adamc@632 1011 end
adamc@632 1012 | _ => err CIncompatible)
adamc@632 1013 | _ => err CIncompatible)
adamc@403 1014
adamc@623 1015 | (L'.CMap (dom1, ran1), L'.CMap (dom2, ran2)) =>
adamc@623 1016 (unifyKinds env dom1 dom2;
adamc@628 1017 unifyKinds env ran1 ran2)
adamc@623 1018
adamc@623 1019 | (L'.CKAbs (x, c1), L'.CKAbs (_, c2)) =>
adamc@628 1020 unifyCons' (E.pushKRel env x) c1 c2
adamc@623 1021 | (L'.CKApp (c1, k1), L'.CKApp (c2, k2)) =>
adamc@623 1022 (unifyKinds env k1 k2;
adamc@628 1023 unifyCons' env c1 c2)
adamc@623 1024 | (L'.TKFun (x, c1), L'.TKFun (_, c2)) =>
adamc@628 1025 unifyCons' (E.pushKRel env x) c1 c2
adamc@628 1026
adamc@403 1027 | (L'.CRecord _, _) => isRecord ()
adamc@403 1028 | (_, L'.CRecord _) => isRecord ()
adamc@403 1029 | (L'.CConcat _, _) => isRecord ()
adamc@403 1030 | (_, L'.CConcat _) => isRecord ()
adamc@403 1031
adamc@403 1032 | _ => err CIncompatible
adamc@403 1033 end
adamc@403 1034
adamc@628 1035 and unifyCons env c1 c2 =
adamc@628 1036 unifyCons' env c1 c2
adamc@403 1037 handle CUnify' err => raise CUnify (c1, c2, err)
adamc@403 1038 | KUnify args => raise CUnify (c1, c2, CKind args)
adamc@403 1039
adamc@628 1040 fun checkCon env e c1 c2 =
adamc@628 1041 unifyCons env c1 c2
adamc@403 1042 handle CUnify (c1, c2, err) =>
adamc@628 1043 expError env (Unify (e, c1, c2, err))
adamc@628 1044
adamc@628 1045 fun checkPatCon env p c1 c2 =
adamc@628 1046 unifyCons env c1 c2
adamc@403 1047 handle CUnify (c1, c2, err) =>
adamc@628 1048 expError env (PatUnify (p, c1, c2, err))
adamc@71 1049
adamc@403 1050 fun primType env p =
adamc@403 1051 case p of
adamc@403 1052 P.Int _ => !int
adamc@403 1053 | P.Float _ => !float
adamc@403 1054 | P.String _ => !string
adamc@623 1055
adamc@403 1056 datatype constraint =
adamc@403 1057 Disjoint of D.goal
adamc@403 1058 | TypeClass of E.env * L'.con * L'.exp option ref * ErrorMsg.span
adamc@403 1059
adamc@403 1060 val enD = map Disjoint
adamc@403 1061
adamc@629 1062 fun elabHead (env, denv) infer (e as (_, loc)) t =
adamc@403 1063 let
adamc@403 1064 fun unravel (t, e) =
adamc@628 1065 case hnormCon env t of
adamc@628 1066 (L'.TKFun (x, t'), _) =>
adamc@628 1067 let
adamc@628 1068 val u = kunif loc
adamc@628 1069
adamc@628 1070 val t'' = subKindInCon (0, u) t'
adamc@628 1071 in
adamc@628 1072 unravel (t'', (L'.EKApp (e, u), loc))
adamc@628 1073 end
adamc@628 1074 | (L'.TCFun (L'.Implicit, x, k, t'), _) =>
adamc@628 1075 let
adamc@628 1076 val u = cunif (loc, k)
adamc@628 1077
adamc@628 1078 val t'' = subConInCon (0, u) t'
adamc@628 1079 in
adamc@628 1080 unravel (t'', (L'.ECApp (e, u), loc))
adamc@628 1081 end
adamc@628 1082 | (L'.TFun (dom as (L'.CApp (cl, _), _), ran), _) =>
adamc@628 1083 let
adamc@628 1084 val cl = hnormCon env cl
adamc@628 1085 in
adamc@628 1086 if infer <> L.TypesOnly andalso E.isClass env cl then
adamc@628 1087 let
adamc@628 1088 val r = ref NONE
adamc@628 1089 val (e, t, gs) = unravel (ran, (L'.EApp (e, (L'.EUnif r, loc)), loc))
adamc@628 1090 in
adamc@628 1091 (e, t, TypeClass (env, dom, r, loc) :: gs)
adamc@628 1092 end
adamc@628 1093 else
adamc@628 1094 (e, t, [])
adamc@628 1095 end
adamc@629 1096 | (L'.TDisjoint (r1, r2, t'), loc) =>
adamc@629 1097 if infer <> L.TypesOnly then
adamc@629 1098 let
adamc@629 1099 val gs = D.prove env denv (r1, r2, loc)
adamc@629 1100 val (e, t, gs') = unravel (t', e)
adamc@629 1101 in
adamc@629 1102 (e, t, enD gs @ gs')
adamc@629 1103 end
adamc@629 1104 else
adamc@629 1105 (e, t, [])
adamc@628 1106 | t => (e, t, [])
adamc@15 1107 in
adamc@403 1108 case infer of
adamc@403 1109 L.DontInfer => (e, t, [])
adamc@403 1110 | _ => unravel (t, e)
adamc@15 1111 end
adamc@15 1112
adamc@628 1113 fun elabPat (pAll as (p, loc), (env, bound)) =
adamc@171 1114 let
adamc@171 1115 val perror = (L'.PWild, loc)
adamc@171 1116 val terror = (L'.CError, loc)
adamc@171 1117 val pterror = (perror, terror)
adamc@171 1118 val rerror = (pterror, (env, bound))
adamc@171 1119
adamc@191 1120 fun pcon (pc, po, xs, to, dn, dk) =
adamc@188 1121 case (po, to) of
adamc@188 1122 (NONE, SOME _) => (expError env (PatHasNoArg loc);
adamc@188 1123 rerror)
adamc@188 1124 | (SOME _, NONE) => (expError env (PatHasArg loc);
adamc@188 1125 rerror)
adamc@191 1126 | (NONE, NONE) =>
adamc@191 1127 let
adamc@191 1128 val k = (L'.KType, loc)
adamc@191 1129 val unifs = map (fn _ => cunif (loc, k)) xs
adamc@191 1130 val dn = foldl (fn (u, dn) => (L'.CApp (dn, u), loc)) dn unifs
adamc@191 1131 in
adamc@191 1132 (((L'.PCon (dk, pc, unifs, NONE), loc), dn),
adamc@191 1133 (env, bound))
adamc@191 1134 end
adamc@188 1135 | (SOME p, SOME t) =>
adamc@188 1136 let
adamc@628 1137 val ((p', pt), (env, bound)) = elabPat (p, (env, bound))
adamc@191 1138
adamc@191 1139 val k = (L'.KType, loc)
adamc@191 1140 val unifs = map (fn _ => cunif (loc, k)) xs
adamc@194 1141 val nxs = length unifs - 1
adamc@194 1142 val t = ListUtil.foldli (fn (i, u, t) => subConInCon (nxs - i, u) t) t unifs
adamc@191 1143 val dn = foldl (fn (u, dn) => (L'.CApp (dn, u), loc)) dn unifs
adamc@188 1144 in
adamc@628 1145 ignore (checkPatCon env p' pt t);
adamc@191 1146 (((L'.PCon (dk, pc, unifs, SOME p'), loc), dn),
adamc@188 1147 (env, bound))
adamc@188 1148 end
adamc@171 1149 in
adamc@171 1150 case p of
adamc@171 1151 L.PWild => (((L'.PWild, loc), cunif (loc, (L'.KType, loc))),
adamc@171 1152 (env, bound))
adamc@171 1153 | L.PVar x =>
adamc@171 1154 let
adamc@171 1155 val t = if SS.member (bound, x) then
adamc@171 1156 (expError env (DuplicatePatternVariable (loc, x));
adamc@171 1157 terror)
adamc@171 1158 else
adamc@171 1159 cunif (loc, (L'.KType, loc))
adamc@171 1160 in
adamc@182 1161 (((L'.PVar (x, t), loc), t),
adamc@171 1162 (E.pushERel env x t, SS.add (bound, x)))
adamc@171 1163 end
adamc@173 1164 | L.PPrim p => (((L'.PPrim p, loc), primType env p),
adamc@173 1165 (env, bound))
adamc@171 1166 | L.PCon ([], x, po) =>
adamc@171 1167 (case E.lookupConstructor env x of
adamc@174 1168 NONE => (expError env (UnboundConstructor (loc, [], x));
adamc@171 1169 rerror)
adamc@191 1170 | SOME (dk, n, xs, to, dn) => pcon (L'.PConVar n, po, xs, to, (L'.CNamed dn, loc), dk))
adamc@174 1171 | L.PCon (m1 :: ms, x, po) =>
adamc@174 1172 (case E.lookupStr env m1 of
adamc@174 1173 NONE => (expError env (UnboundStrInExp (loc, m1));
adamc@174 1174 rerror)
adamc@174 1175 | SOME (n, sgn) =>
adamc@174 1176 let
adamc@174 1177 val (str, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@174 1178 case E.projectStr env {sgn = sgn, str = str, field = m} of
adamc@182 1179 NONE => raise Fail "elabPat: Unknown substructure"
adamc@174 1180 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@174 1181 ((L'.StrVar n, loc), sgn) ms
adamc@174 1182 in
adamc@174 1183 case E.projectConstructor env {str = str, sgn = sgn, field = x} of
adamc@174 1184 NONE => (expError env (UnboundConstructor (loc, m1 :: ms, x));
adamc@174 1185 rerror)
adamc@191 1186 | SOME (dk, _, xs, to, dn) => pcon (L'.PConProj (n, ms, x), po, xs, to, dn, dk)
adamc@174 1187 end)
adamc@174 1188
adamc@175 1189 | L.PRecord (xps, flex) =>
adamc@175 1190 let
adamc@175 1191 val (xpts, (env, bound, _)) =
adamc@175 1192 ListUtil.foldlMap (fn ((x, p), (env, bound, fbound)) =>
adamc@175 1193 let
adamc@628 1194 val ((p', t), (env, bound)) = elabPat (p, (env, bound))
adamc@175 1195 in
adamc@175 1196 if SS.member (fbound, x) then
adamc@175 1197 expError env (DuplicatePatField (loc, x))
adamc@175 1198 else
adamc@175 1199 ();
adamc@175 1200 ((x, p', t), (env, bound, SS.add (fbound, x)))
adamc@175 1201 end)
adamc@175 1202 (env, bound, SS.empty) xps
adamc@175 1203
adamc@175 1204 val k = (L'.KType, loc)
adamc@175 1205 val c = (L'.CRecord (k, map (fn (x, _, t) => ((L'.CName x, loc), t)) xpts), loc)
adamc@176 1206 val c =
adamc@175 1207 if flex then
adamc@176 1208 (L'.CConcat (c, cunif (loc, (L'.KRecord k, loc))), loc)
adamc@175 1209 else
adamc@176 1210 c
adamc@175 1211 in
adamc@182 1212 (((L'.PRecord xpts, loc),
adamc@175 1213 (L'.TRecord c, loc)),
adamc@175 1214 (env, bound))
adamc@175 1215 end
adamc@175 1216
adamc@171 1217 end
adamc@171 1218
adamc@172 1219 datatype coverage =
adamc@172 1220 Wild
adamc@173 1221 | None
adamc@172 1222 | Datatype of coverage IM.map
adamc@175 1223 | Record of coverage SM.map list
adamc@172 1224
adamc@243 1225 fun c2s c =
adamc@243 1226 case c of
adamc@243 1227 Wild => "Wild"
adamc@243 1228 | None => "None"
adamc@243 1229 | Datatype _ => "Datatype"
adamc@243 1230 | Record _ => "Record"
adamc@243 1231
adamc@629 1232 fun exhaustive (env, t, ps, loc) =
adamc@172 1233 let
adamc@402 1234 fun depth (p, _) =
adamc@402 1235 case p of
adamc@402 1236 L'.PWild => 0
adamc@402 1237 | L'.PVar _ => 0
adamc@402 1238 | L'.PPrim _ => 0
adamc@402 1239 | L'.PCon (_, _, _, NONE) => 1
adamc@402 1240 | L'.PCon (_, _, _, SOME p) => 1 + depth p
adamc@402 1241 | L'.PRecord xps => foldl (fn ((_, p, _), n) => Int.max (depth p, n)) 0 xps
adamc@402 1242
adamc@402 1243 val depth = 1 + foldl (fn (p, n) => Int.max (depth p, n)) 0 ps
adamc@402 1244
adamc@172 1245 fun pcCoverage pc =
adamc@172 1246 case pc of
adamc@172 1247 L'.PConVar n => n
adamc@174 1248 | L'.PConProj (m1, ms, x) =>
adamc@174 1249 let
adamc@174 1250 val (str, sgn) = E.chaseMpath env (m1, ms)
adamc@174 1251 in
adamc@174 1252 case E.projectConstructor env {str = str, sgn = sgn, field = x} of
adamc@174 1253 NONE => raise Fail "exhaustive: Can't project constructor"
adamc@191 1254 | SOME (_, n, _, _, _) => n
adamc@174 1255 end
adamc@172 1256
adamc@172 1257 fun coverage (p, _) =
adamc@172 1258 case p of
adamc@172 1259 L'.PWild => Wild
adamc@172 1260 | L'.PVar _ => Wild
adamc@173 1261 | L'.PPrim _ => None
adamc@191 1262 | L'.PCon (_, pc, _, NONE) => Datatype (IM.insert (IM.empty, pcCoverage pc, Wild))
adamc@191 1263 | L'.PCon (_, pc, _, SOME p) => Datatype (IM.insert (IM.empty, pcCoverage pc, coverage p))
adamc@182 1264 | L'.PRecord xps => Record [foldl (fn ((x, p, _), fmap) =>
adamc@182 1265 SM.insert (fmap, x, coverage p)) SM.empty xps]
adamc@176 1266
adamc@172 1267 fun merge (c1, c2) =
adamc@172 1268 case (c1, c2) of
adamc@173 1269 (None, _) => c2
adamc@173 1270 | (_, None) => c1
adamc@173 1271
adamc@173 1272 | (Wild, _) => Wild
adamc@172 1273 | (_, Wild) => Wild
adamc@172 1274
adamc@172 1275 | (Datatype cm1, Datatype cm2) => Datatype (IM.unionWith merge (cm1, cm2))
adamc@172 1276
adamc@175 1277 | (Record fm1, Record fm2) => Record (fm1 @ fm2)
adamc@175 1278
adamc@175 1279 | _ => None
adamc@175 1280
adamc@172 1281 fun combinedCoverage ps =
adamc@172 1282 case ps of
adamc@172 1283 [] => raise Fail "Empty pattern list for coverage checking"
adamc@172 1284 | [p] => coverage p
adamc@172 1285 | p :: ps => merge (coverage p, combinedCoverage ps)
adamc@172 1286
adamc@402 1287 fun enumerateCases depth t =
adamc@402 1288 if depth = 0 then
adamc@402 1289 [Wild]
adamc@402 1290 else
adamc@402 1291 let
adamc@402 1292 fun dtype cons =
adamc@402 1293 ListUtil.mapConcat (fn (_, n, to) =>
adamc@402 1294 case to of
adamc@402 1295 NONE => [Datatype (IM.insert (IM.empty, n, Wild))]
adamc@402 1296 | SOME t => map (fn c => Datatype (IM.insert (IM.empty, n, c)))
adamc@402 1297 (enumerateCases (depth-1) t)) cons
adamc@402 1298 in
adamc@628 1299 case #1 (hnormCon env t) of
adamc@402 1300 L'.CNamed n =>
adamc@402 1301 (let
adamc@402 1302 val dt = E.lookupDatatype env n
adamc@402 1303 val cons = E.constructors dt
adamc@175 1304 in
adamc@402 1305 dtype cons
adamc@402 1306 end handle E.UnboundNamed _ => [Wild])
adamc@402 1307 | L'.TRecord c =>
adamc@628 1308 (case #1 (hnormCon env c) of
adamc@402 1309 L'.CRecord (_, xts) =>
adamc@402 1310 let
adamc@628 1311 val xts = map (fn (x, t) => (hnormCon env x, t)) xts
adamc@402 1312
adamc@402 1313 fun exponentiate fs =
adamc@402 1314 case fs of
adamc@402 1315 [] => [SM.empty]
adamc@402 1316 | ((L'.CName x, _), t) :: rest =>
adamc@402 1317 let
adamc@402 1318 val this = enumerateCases depth t
adamc@402 1319 val rest = exponentiate rest
adamc@402 1320 in
adamc@402 1321 ListUtil.mapConcat (fn fmap =>
adamc@402 1322 map (fn c => SM.insert (fmap, x, c)) this) rest
adamc@402 1323 end
adamc@402 1324 | _ => raise Fail "exponentiate: Not CName"
adamc@402 1325 in
adamc@402 1326 if List.exists (fn ((L'.CName _, _), _) => false
adamc@402 1327 | (c, _) => true) xts then
adamc@402 1328 [Wild]
adamc@402 1329 else
adamc@402 1330 map (fn ls => Record [ls]) (exponentiate xts)
adamc@402 1331 end
adamc@402 1332 | _ => [Wild])
adamc@402 1333 | _ => [Wild]
adamc@402 1334 end
adamc@175 1335
adamc@175 1336 fun coverageImp (c1, c2) =
adamc@243 1337 let
adamc@243 1338 val r =
adamc@243 1339 case (c1, c2) of
adamc@243 1340 (Wild, _) => true
adamc@243 1341
adamc@243 1342 | (Datatype cmap1, Datatype cmap2) =>
adamc@243 1343 List.all (fn (n, c2) =>
adamc@243 1344 case IM.find (cmap1, n) of
adamc@243 1345 NONE => false
adamc@243 1346 | SOME c1 => coverageImp (c1, c2)) (IM.listItemsi cmap2)
adamc@243 1347 | (Datatype cmap1, Wild) =>
adamc@243 1348 List.all (fn (n, c1) => coverageImp (c1, Wild)) (IM.listItemsi cmap1)
adamc@243 1349
adamc@243 1350 | (Record fmaps1, Record fmaps2) =>
adamc@243 1351 List.all (fn fmap2 =>
adamc@243 1352 List.exists (fn fmap1 =>
adamc@243 1353 List.all (fn (x, c2) =>
adamc@243 1354 case SM.find (fmap1, x) of
adamc@243 1355 NONE => true
adamc@243 1356 | SOME c1 => coverageImp (c1, c2))
adamc@243 1357 (SM.listItemsi fmap2))
adamc@243 1358 fmaps1) fmaps2
adamc@243 1359
adamc@243 1360 | (Record fmaps1, Wild) =>
adamc@243 1361 List.exists (fn fmap1 =>
adamc@243 1362 List.all (fn (x, c1) => coverageImp (c1, Wild))
adamc@243 1363 (SM.listItemsi fmap1)) fmaps1
adamc@243 1364
adamc@243 1365 | _ => false
adamc@243 1366 in
adamc@243 1367 (*TextIO.print ("coverageImp(" ^ c2s c1 ^ ", " ^ c2s c2 ^ ") = " ^ Bool.toString r ^ "\n");*)
adamc@243 1368 r
adamc@243 1369 end
adamc@175 1370
adamc@172 1371 fun isTotal (c, t) =
adamc@172 1372 case c of
adamc@628 1373 None => false
adamc@628 1374 | Wild => true
adamc@172 1375 | Datatype cm =>
adamc@172 1376 let
adamc@628 1377 val (t, _) = hnormCon env t
adamc@628 1378
adamc@628 1379 val dtype =
adamc@628 1380 List.all (fn (_, n, to) =>
adamc@628 1381 case IM.find (cm, n) of
adamc@628 1382 NONE => false
adamc@628 1383 | SOME c' =>
adamc@628 1384 case to of
adamc@628 1385 NONE => true
adamc@628 1386 | SOME t' => isTotal (c', t'))
adamc@191 1387
adamc@191 1388 fun unapp t =
adamc@191 1389 case t of
adamc@191 1390 L'.CApp ((t, _), _) => unapp t
adamc@191 1391 | _ => t
adamc@172 1392 in
adamc@191 1393 case unapp t of
adamc@172 1394 L'.CNamed n =>
adamc@172 1395 let
adamc@172 1396 val dt = E.lookupDatatype env n
adamc@172 1397 val cons = E.constructors dt
adamc@172 1398 in
adamc@174 1399 dtype cons
adamc@174 1400 end
adamc@174 1401 | L'.CModProj (m1, ms, x) =>
adamc@174 1402 let
adamc@174 1403 val (str, sgn) = E.chaseMpath env (m1, ms)
adamc@174 1404 in
adamc@174 1405 case E.projectDatatype env {str = str, sgn = sgn, field = x} of
adamc@174 1406 NONE => raise Fail "isTotal: Can't project datatype"
adamc@191 1407 | SOME (_, cons) => dtype cons
adamc@172 1408 end
adamc@628 1409 | L'.CError => true
adamc@341 1410 | c =>
adamc@629 1411 (prefaces "Not a datatype" [("loc", PD.string (ErrorMsg.spanToString loc)),
adamc@629 1412 ("c", p_con env (c, ErrorMsg.dummySpan))];
adamc@341 1413 raise Fail "isTotal: Not a datatype")
adamc@172 1414 end
adamc@628 1415 | Record _ => List.all (fn c2 => coverageImp (c, c2)) (enumerateCases depth t)
adamc@172 1416 in
adamc@172 1417 isTotal (combinedCoverage ps, t)
adamc@172 1418 end
adamc@172 1419
adamc@217 1420 fun unmodCon env (c, loc) =
adamc@217 1421 case c of
adamc@217 1422 L'.CNamed n =>
adamc@217 1423 (case E.lookupCNamed env n of
adamc@217 1424 (_, _, SOME (c as (L'.CModProj _, _))) => unmodCon env c
adamc@217 1425 | _ => (c, loc))
adamc@217 1426 | L'.CModProj (m1, ms, x) =>
adamc@217 1427 let
adamc@217 1428 val (str, sgn) = E.chaseMpath env (m1, ms)
adamc@217 1429 in
adamc@217 1430 case E.projectCon env {str = str, sgn = sgn, field = x} of
adamc@217 1431 NONE => raise Fail "unmodCon: Can't projectCon"
adamc@217 1432 | SOME (_, SOME (c as (L'.CModProj _, _))) => unmodCon env c
adamc@217 1433 | _ => (c, loc)
adamc@217 1434 end
adamc@217 1435 | _ => (c, loc)
adamc@217 1436
adamc@467 1437 fun normClassKey envs c =
adamc@467 1438 let
adamc@628 1439 val c = hnormCon envs c
adamc@467 1440 in
adamc@467 1441 case #1 c of
adamc@467 1442 L'.CApp (c1, c2) =>
adamc@467 1443 let
adamc@467 1444 val c1 = normClassKey envs c1
adamc@467 1445 val c2 = normClassKey envs c2
adamc@467 1446 in
adamc@467 1447 (L'.CApp (c1, c2), #2 c)
adamc@467 1448 end
adamc@467 1449 | _ => c
adamc@467 1450 end
adamc@467 1451
adamc@467 1452 fun normClassConstraint env (c, loc) =
adamc@217 1453 case c of
adamc@217 1454 L'.CApp (f, x) =>
adamc@217 1455 let
adamc@467 1456 val f = unmodCon env f
adamc@467 1457 val x = normClassKey env x
adamc@217 1458 in
adamc@467 1459 (L'.CApp (f, x), loc)
adamc@217 1460 end
adamc@467 1461 | L'.CUnif (_, _, _, ref (SOME c)) => normClassConstraint env c
adamc@467 1462 | _ => (c, loc)
adamc@216 1463
adamc@92 1464 fun elabExp (env, denv) (eAll as (e, loc)) =
adamc@91 1465 let
adamc@280 1466 (*val () = eprefaces "elabExp" [("eAll", SourcePrint.p_exp eAll)];*)
adamc@514 1467 (*val befor = Time.now ()*)
adamc@280 1468
adamc@280 1469 val r = case e of
adamc@91 1470 L.EAnnot (e, t) =>
adamc@91 1471 let
adamc@91 1472 val (e', et, gs1) = elabExp (env, denv) e
adamc@91 1473 val (t', _, gs2) = elabCon (env, denv) t
adamc@91 1474 in
adamc@628 1475 checkCon env e' et t';
adamc@628 1476 (e', t', gs1 @ enD gs2)
adamc@91 1477 end
adamc@34 1478
adamc@91 1479 | L.EPrim p => ((L'.EPrim p, loc), primType env p, [])
adamc@403 1480 | L.EVar ([], s, infer) =>
adamc@91 1481 (case E.lookupE env s of
adamc@91 1482 E.NotBound =>
adamc@91 1483 (expError env (UnboundExp (loc, s));
adamc@91 1484 (eerror, cerror, []))
adamc@629 1485 | E.Rel (n, t) => elabHead (env, denv) infer (L'.ERel n, loc) t
adamc@629 1486 | E.Named (n, t) => elabHead (env, denv) infer (L'.ENamed n, loc) t)
adamc@403 1487 | L.EVar (m1 :: ms, s, infer) =>
adamc@91 1488 (case E.lookupStr env m1 of
adamc@91 1489 NONE => (expError env (UnboundStrInExp (loc, m1));
adamc@91 1490 (eerror, cerror, []))
adamc@91 1491 | SOME (n, sgn) =>
adamc@91 1492 let
adamc@91 1493 val (str, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@91 1494 case E.projectStr env {sgn = sgn, str = str, field = m} of
adamc@91 1495 NONE => (conError env (UnboundStrInCon (loc, m));
adamc@91 1496 (strerror, sgnerror))
adamc@91 1497 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@91 1498 ((L'.StrVar n, loc), sgn) ms
adamc@10 1499
adamc@91 1500 val t = case E.projectVal env {sgn = sgn, str = str, field = s} of
adamc@91 1501 NONE => (expError env (UnboundExp (loc, s));
adamc@91 1502 cerror)
adamc@91 1503 | SOME t => t
adamc@91 1504 in
adamc@629 1505 elabHead (env, denv) infer (L'.EModProj (n, ms, s), loc) t
adamc@91 1506 end)
adamc@86 1507
adamc@349 1508 | L.EWild =>
adamc@210 1509 let
adamc@349 1510 val r = ref NONE
adamc@349 1511 val c = cunif (loc, (L'.KType, loc))
adamc@210 1512 in
adamc@349 1513 ((L'.EUnif r, loc), c, [TypeClass (env, c, r, loc)])
adamc@210 1514 end
adamc@210 1515
adamc@91 1516 | L.EApp (e1, e2) =>
adamc@91 1517 let
adamc@91 1518 val (e1', t1, gs1) = elabExp (env, denv) e1
adamc@403 1519 val (e2', t2, gs2) = elabExp (env, denv) e2
adamc@71 1520
adamc@91 1521 val dom = cunif (loc, ktype)
adamc@91 1522 val ran = cunif (loc, ktype)
adamc@91 1523 val t = (L'.TFun (dom, ran), dummy)
adamc@91 1524 in
adamc@628 1525 checkCon env e1' t1 t;
adamc@628 1526 checkCon env e2' t2 dom;
adamc@628 1527 ((L'.EApp (e1', e2'), loc), ran, gs1 @ gs2)
adamc@91 1528 end
adamc@91 1529 | L.EAbs (x, to, e) =>
adamc@91 1530 let
adamc@91 1531 val (t', gs1) = case to of
adamc@91 1532 NONE => (cunif (loc, ktype), [])
adamc@91 1533 | SOME t =>
adamc@91 1534 let
adamc@91 1535 val (t', tk, gs) = elabCon (env, denv) t
adamc@91 1536 in
adamc@91 1537 checkKind env t' tk ktype;
adamc@91 1538 (t', gs)
adamc@91 1539 end
adamc@467 1540 val dom = normClassConstraint env t'
adamc@467 1541 val (e', et, gs2) = elabExp (E.pushERel env x dom, denv) e
adamc@91 1542 in
adamc@91 1543 ((L'.EAbs (x, t', et, e'), loc),
adamc@91 1544 (L'.TFun (t', et), loc),
adamc@467 1545 enD gs1 @ gs2)
adamc@91 1546 end
adamc@91 1547 | L.ECApp (e, c) =>
adamc@91 1548 let
adamc@91 1549 val (e', et, gs1) = elabExp (env, denv) e
adamc@328 1550 val oldEt = et
adamc@403 1551 val (c', ck, gs2) = elabCon (env, denv) c
adamc@628 1552 val (et', _) = hnormCon env et
adamc@91 1553 in
adamc@91 1554 case et' of
adamc@91 1555 L'.CError => (eerror, cerror, [])
adamc@328 1556 | L'.TCFun (_, x, k, eb) =>
adamc@91 1557 let
adamc@91 1558 val () = checkKind env c' ck k
adamc@91 1559 val eb' = subConInCon (0, c') eb
adamc@339 1560 handle SynUnif => (expError env (Unif ("substitution", loc, eb));
adamc@91 1561 cerror)
adamc@91 1562 in
adamc@328 1563 (*prefaces "Elab ECApp" [("e", SourcePrint.p_exp eAll),
adamc@328 1564 ("et", p_con env oldEt),
adamc@328 1565 ("x", PD.string x),
adamc@328 1566 ("eb", p_con (E.pushCRel env x k) eb),
adamc@328 1567 ("c", p_con env c'),
adamc@328 1568 ("eb'", p_con env eb')];*)
adamc@628 1569 ((L'.ECApp (e', c'), loc), eb', gs1 @ enD gs2)
adamc@91 1570 end
adamc@91 1571
adamc@91 1572 | _ =>
adamc@91 1573 (expError env (WrongForm ("constructor function", e', et));
adamc@91 1574 (eerror, cerror, []))
adamc@91 1575 end
adamc@91 1576 | L.ECAbs (expl, x, k, e) =>
adamc@91 1577 let
adamc@91 1578 val expl' = elabExplicitness expl
adamc@623 1579 val k' = elabKind env k
adamc@328 1580
adamc@328 1581 val env' = E.pushCRel env x k'
adamc@328 1582 val (e', et, gs) = elabExp (env', D.enter denv) e
adamc@91 1583 in
adamc@91 1584 ((L'.ECAbs (expl', x, k', e'), loc),
adamc@91 1585 (L'.TCFun (expl', x, k', et), loc),
adamc@91 1586 gs)
adamc@91 1587 end
adamc@623 1588 | L.EKAbs (x, e) =>
adamc@623 1589 let
adamc@623 1590 val env' = E.pushKRel env x
adamc@623 1591 val (e', et, gs) = elabExp (env', denv) e
adamc@623 1592 in
adamc@623 1593 ((L'.EKAbs (x, e'), loc),
adamc@623 1594 (L'.TKFun (x, et), loc),
adamc@623 1595 gs)
adamc@623 1596 end
adamc@91 1597
adamc@91 1598 | L.EDisjoint (c1, c2, e) =>
adamc@91 1599 let
adamc@91 1600 val (c1', k1, gs1) = elabCon (env, denv) c1
adamc@91 1601 val (c2', k2, gs2) = elabCon (env, denv) c2
adamc@91 1602
adamc@91 1603 val ku1 = kunif loc
adamc@91 1604 val ku2 = kunif loc
adamc@91 1605
adamc@628 1606 val denv' = D.assert env denv (c1', c2')
adamc@628 1607 val (e', t, gs3) = elabExp (env, denv') e
adamc@91 1608 in
adamc@91 1609 checkKind env c1' k1 (L'.KRecord ku1, loc);
adamc@91 1610 checkKind env c2' k2 (L'.KRecord ku2, loc);
adamc@91 1611
adamc@628 1612 (e', (L'.TDisjoint (c1', c2', t), loc), enD gs1 @ enD gs2 @ gs3)
adamc@91 1613 end
adamc@629 1614 | L.EDisjointApp e =>
adamc@629 1615 let
adamc@629 1616 val (e', t, gs1) = elabExp (env, denv) e
adamc@629 1617
adamc@629 1618 val k1 = kunif loc
adamc@629 1619 val c1 = cunif (loc, (L'.KRecord k1, loc))
adamc@629 1620 val k2 = kunif loc
adamc@629 1621 val c2 = cunif (loc, (L'.KRecord k2, loc))
adamc@629 1622 val t' = cunif (loc, ktype)
adamc@629 1623 val () = checkCon env e' t (L'.TDisjoint (c1, c2, t'), loc)
adamc@629 1624 val gs2 = D.prove env denv (c1, c2, loc)
adamc@629 1625 in
adamc@629 1626 (e', t', enD gs2 @ gs1)
adamc@629 1627 end
adamc@91 1628
adamc@91 1629 | L.ERecord xes =>
adamc@91 1630 let
adamc@91 1631 val (xes', gs) = ListUtil.foldlMap (fn ((x, e), gs) =>
adamc@91 1632 let
adamc@91 1633 val (x', xk, gs1) = elabCon (env, denv) x
adamc@91 1634 val (e', et, gs2) = elabExp (env, denv) e
adamc@91 1635 in
adamc@91 1636 checkKind env x' xk kname;
adamc@228 1637 ((x', e', et), enD gs1 @ gs2 @ gs)
adamc@91 1638 end)
adamc@91 1639 [] xes
adamc@91 1640
adamc@91 1641 val k = (L'.KType, loc)
adamc@91 1642
adamc@91 1643 fun prove (xets, gs) =
adamc@91 1644 case xets of
adamc@91 1645 [] => gs
adamc@91 1646 | (x, _, t) :: rest =>
adamc@91 1647 let
adamc@91 1648 val xc = (x, t)
adamc@91 1649 val r1 = (L'.CRecord (k, [xc]), loc)
adamc@91 1650 val gs = foldl (fn ((x', _, t'), gs) =>
adamc@91 1651 let
adamc@91 1652 val xc' = (x', t')
adamc@91 1653 val r2 = (L'.CRecord (k, [xc']), loc)
adamc@91 1654 in
adamc@91 1655 D.prove env denv (r1, r2, loc) @ gs
adamc@91 1656 end)
adamc@91 1657 gs rest
adamc@91 1658 in
adamc@91 1659 prove (rest, gs)
adamc@91 1660 end
adamc@228 1661
adamc@228 1662 val gsD = List.mapPartial (fn Disjoint d => SOME d | _ => NONE) gs
adamc@228 1663 val gsO = List.filter (fn Disjoint _ => false | _ => true) gs
adamc@91 1664 in
adamc@255 1665 (*TextIO.print ("|gsO| = " ^ Int.toString (length gsO) ^ "\n");*)
adamc@91 1666 ((L'.ERecord xes', loc),
adamc@91 1667 (L'.TRecord (L'.CRecord (ktype, map (fn (x', _, et) => (x', et)) xes'), loc), loc),
adamc@228 1668 enD (prove (xes', gsD)) @ gsO)
adamc@91 1669 end
adamc@91 1670
adamc@91 1671 | L.EField (e, c) =>
adamc@91 1672 let
adamc@91 1673 val (e', et, gs1) = elabExp (env, denv) e
adamc@91 1674 val (c', ck, gs2) = elabCon (env, denv) c
adamc@91 1675
adamc@91 1676 val ft = cunif (loc, ktype)
adamc@91 1677 val rest = cunif (loc, ktype_record)
adamc@91 1678 val first = (L'.CRecord (ktype, [(c', ft)]), loc)
adamc@629 1679 val () = checkCon env e' et
adamc@629 1680 (L'.TRecord (L'.CConcat (first, rest), loc), loc);
adamc@628 1681 val gs3 = D.prove env denv (first, rest, loc)
adamc@91 1682 in
adamc@628 1683 ((L'.EField (e', c', {field = ft, rest = rest}), loc), ft, gs1 @ enD gs2 @ enD gs3)
adamc@91 1684 end
adamc@91 1685
adamc@445 1686 | L.EConcat (e1, e2) =>
adamc@339 1687 let
adamc@339 1688 val (e1', e1t, gs1) = elabExp (env, denv) e1
adamc@445 1689 val (e2', e2t, gs2) = elabExp (env, denv) e2
adamc@445 1690
adamc@445 1691 val r1 = cunif (loc, ktype_record)
adamc@445 1692 val r2 = cunif (loc, ktype_record)
adamc@445 1693
adamc@629 1694 val () = checkCon env e1' e1t (L'.TRecord r1, loc)
adamc@629 1695 val () = checkCon env e2' e2t (L'.TRecord r2, loc)
adamc@629 1696
adamc@628 1697 val gs3 = D.prove env denv (r1, r2, loc)
adamc@339 1698 in
adamc@445 1699 ((L'.EConcat (e1', r1, e2', r2), loc),
adamc@445 1700 (L'.TRecord ((L'.CConcat (r1, r2), loc)), loc),
adamc@628 1701 gs1 @ gs2 @ enD gs3)
adamc@339 1702 end
adamc@149 1703 | L.ECut (e, c) =>
adamc@149 1704 let
adamc@149 1705 val (e', et, gs1) = elabExp (env, denv) e
adamc@149 1706 val (c', ck, gs2) = elabCon (env, denv) c
adamc@149 1707
adamc@149 1708 val ft = cunif (loc, ktype)
adamc@149 1709 val rest = cunif (loc, ktype_record)
adamc@149 1710 val first = (L'.CRecord (ktype, [(c', ft)]), loc)
adamc@629 1711
adamc@629 1712 val () = checkCon env e' et
adamc@629 1713 (L'.TRecord (L'.CConcat (first, rest), loc), loc)
adamc@149 1714
adamc@628 1715 val gs3 = D.prove env denv (first, rest, loc)
adamc@149 1716 in
adamc@228 1717 ((L'.ECut (e', c', {field = ft, rest = rest}), loc), (L'.TRecord rest, loc),
adamc@628 1718 gs1 @ enD gs2 @ enD gs3)
adamc@149 1719 end
adamc@493 1720 | L.ECutMulti (e, c) =>
adamc@493 1721 let
adamc@493 1722 val (e', et, gs1) = elabExp (env, denv) e
adamc@493 1723 val (c', ck, gs2) = elabCon (env, denv) c
adamc@493 1724
adamc@493 1725 val rest = cunif (loc, ktype_record)
adamc@629 1726
adamc@629 1727 val () = checkCon env e' et
adamc@629 1728 (L'.TRecord (L'.CConcat (c', rest), loc), loc)
adamc@493 1729
adamc@628 1730 val gs3 = D.prove env denv (c', rest, loc)
adamc@493 1731 in
adamc@493 1732 ((L'.ECutMulti (e', c', {rest = rest}), loc), (L'.TRecord rest, loc),
adamc@628 1733 gs1 @ enD gs2 @ enD gs3)
adamc@493 1734 end
adamc@149 1735
adamc@171 1736 | L.ECase (e, pes) =>
adamc@171 1737 let
adamc@171 1738 val (e', et, gs1) = elabExp (env, denv) e
adamc@171 1739 val result = cunif (loc, (L'.KType, loc))
adamc@171 1740 val (pes', gs) = ListUtil.foldlMap
adamc@171 1741 (fn ((p, e), gs) =>
adamc@171 1742 let
adamc@628 1743 val ((p', pt), (env, _)) = elabPat (p, (env, SS.empty))
adamc@628 1744
adamc@629 1745 val (e', et', gs1) = elabExp (env, denv) e
adamc@171 1746 in
adamc@628 1747 checkPatCon env p' pt et;
adamc@629 1748 checkCon env e' et' result;
adamc@628 1749 ((p', e'), gs1 @ gs)
adamc@171 1750 end)
adamc@171 1751 gs1 pes
adamc@171 1752 in
adamc@629 1753 if exhaustive (env, et, map #1 pes', loc) then
adamc@172 1754 ()
adamc@172 1755 else
adamc@172 1756 expError env (Inexhaustive loc);
adamc@172 1757
adamc@628 1758 ((L'.ECase (e', pes', {disc = et, result = result}), loc), result, gs)
adamc@171 1759 end
adamc@447 1760
adamc@447 1761 | L.ELet (eds, e) =>
adamc@447 1762 let
adamc@447 1763 val (eds, (env, gs1)) = ListUtil.foldlMap (elabEdecl denv) (env, []) eds
adamc@447 1764 val (e, t, gs2) = elabExp (env, denv) e
adamc@447 1765 in
adamc@447 1766 ((L'.ELet (eds, e), loc), t, gs1 @ gs2)
adamc@447 1767 end
adamc@280 1768 in
adamc@513 1769 (*prefaces "elabExp" [("e", SourcePrint.p_exp eAll),
adamc@514 1770 ("t", PD.string (LargeReal.toString (Time.toReal (Time.- (Time.now (), befor)))))];*)
adamc@280 1771 r
adamc@91 1772 end
adamc@31 1773
adamc@628 1774 and elabEdecl denv (dAll as (d, loc), (env, gs)) =
adamc@447 1775 let
adamc@447 1776 val r =
adamc@447 1777 case d of
adamc@447 1778 L.EDVal (x, co, e) =>
adamc@447 1779 let
adamc@447 1780 val (c', _, gs1) = case co of
adamc@447 1781 NONE => (cunif (loc, ktype), ktype, [])
adamc@447 1782 | SOME c => elabCon (env, denv) c
adamc@447 1783
adamc@447 1784 val (e', et, gs2) = elabExp (env, denv) e
adamc@628 1785
adamc@629 1786 val () = checkCon env e' et c'
adamc@629 1787
adamc@467 1788 val c' = normClassConstraint env c'
adamc@447 1789 val env' = E.pushERel env x c'
adamc@447 1790 in
adamc@628 1791 ((L'.EDVal (x, c', e'), loc), (env', enD gs1 @ gs2 @ gs))
adamc@447 1792 end
adamc@447 1793 | L.EDValRec vis =>
adamc@447 1794 let
adamc@447 1795 fun allowable (e, _) =
adamc@447 1796 case e of
adamc@447 1797 L.EAbs _ => true
adamc@447 1798 | L.ECAbs (_, _, _, e) => allowable e
adamc@623 1799 | L.EKAbs (_, e) => allowable e
adamc@447 1800 | L.EDisjoint (_, _, e) => allowable e
adamc@447 1801 | _ => false
adamc@447 1802
adamc@447 1803 val (vis, gs) = ListUtil.foldlMap
adamc@447 1804 (fn ((x, co, e), gs) =>
adamc@447 1805 let
adamc@447 1806 val (c', _, gs1) = case co of
adamc@447 1807 NONE => (cunif (loc, ktype), ktype, [])
adamc@447 1808 | SOME c => elabCon (env, denv) c
adamc@447 1809 in
adamc@447 1810 ((x, c', e), enD gs1 @ gs)
adamc@447 1811 end) gs vis
adamc@447 1812
adamc@447 1813 val env = foldl (fn ((x, c', _), env) => E.pushERel env x c') env vis
adamc@447 1814
adamc@447 1815 val (vis, gs) = ListUtil.foldlMap (fn ((x, c', e), gs) =>
adamc@447 1816 let
adamc@447 1817 val (e', et, gs1) = elabExp (env, denv) e
adamc@447 1818 in
adamc@628 1819 checkCon env e' et c';
adamc@447 1820 if allowable e then
adamc@447 1821 ()
adamc@447 1822 else
adamc@447 1823 expError env (IllegalRec (x, e'));
adamc@628 1824 ((x, c', e'), gs1 @ gs)
adamc@447 1825 end) gs vis
adamc@447 1826 in
adamc@447 1827 ((L'.EDValRec vis, loc), (env, gs))
adamc@447 1828 end
adamc@447 1829 in
adamc@447 1830 r
adamc@447 1831 end
adamc@447 1832
adamc@42 1833 val hnormSgn = E.hnormSgn
adamc@31 1834
adamc@210 1835 fun tableOf () = (L'.CModProj (!basis_r, [], "sql_table"), ErrorMsg.dummySpan)
adamc@338 1836 fun sequenceOf () = (L'.CModProj (!basis_r, [], "sql_sequence"), ErrorMsg.dummySpan)
adamc@459 1837 fun cookieOf () = (L'.CModProj (!basis_r, [], "http_cookie"), ErrorMsg.dummySpan)
adamc@205 1838
adamc@469 1839 fun dopenConstraints (loc, env, denv) {str, strs} =
adamc@469 1840 case E.lookupStr env str of
adamc@469 1841 NONE => (strError env (UnboundStr (loc, str));
adamc@469 1842 denv)
adamc@469 1843 | SOME (n, sgn) =>
adamc@469 1844 let
adamc@469 1845 val (st, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@469 1846 case E.projectStr env {str = str, sgn = sgn, field = m} of
adamc@469 1847 NONE => (strError env (UnboundStr (loc, m));
adamc@469 1848 (strerror, sgnerror))
adamc@469 1849 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@469 1850 ((L'.StrVar n, loc), sgn) strs
adamc@469 1851
adamc@469 1852 val cso = E.projectConstraints env {sgn = sgn, str = st}
adamc@469 1853 in
adamc@628 1854 case cso of
adamc@628 1855 NONE => (strError env (UnboundStr (loc, str));
adamc@628 1856 denv)
adamc@628 1857 | SOME cs => foldl (fn ((c1, c2), denv) =>
adamc@628 1858 D.assert env denv (c1, c2)) denv cs
adamc@469 1859 end
adamc@469 1860
adamc@88 1861 fun elabSgn_item ((sgi, loc), (env, denv, gs)) =
adamc@76 1862 case sgi of
adamc@76 1863 L.SgiConAbs (x, k) =>
adamc@76 1864 let
adamc@623 1865 val k' = elabKind env k
adamc@31 1866
adamc@76 1867 val (env', n) = E.pushCNamed env x k' NONE
adamc@76 1868 in
adamc@88 1869 ([(L'.SgiConAbs (x, n, k'), loc)], (env', denv, gs))
adamc@76 1870 end
adamc@31 1871
adamc@76 1872 | L.SgiCon (x, ko, c) =>
adamc@76 1873 let
adamc@76 1874 val k' = case ko of
adamc@76 1875 NONE => kunif loc
adamc@623 1876 | SOME k => elabKind env k
adamc@31 1877
adamc@83 1878 val (c', ck, gs') = elabCon (env, denv) c
adamc@76 1879 val (env', n) = E.pushCNamed env x k' (SOME c')
adamc@76 1880 in
adamc@76 1881 checkKind env c' ck k';
adamc@31 1882
adamc@88 1883 ([(L'.SgiCon (x, n, k', c'), loc)], (env', denv, gs' @ gs))
adamc@76 1884 end
adamc@31 1885
adamc@191 1886 | L.SgiDatatype (x, xs, xcs) =>
adamc@157 1887 let
adamc@157 1888 val k = (L'.KType, loc)
adamc@191 1889 val k' = foldl (fn (_, k') => (L'.KArrow (k, k'), loc)) k xs
adamc@191 1890 val (env, n) = E.pushCNamed env x k' NONE
adamc@157 1891 val t = (L'.CNamed n, loc)
adamc@194 1892 val nxs = length xs - 1
adamc@194 1893 val t = ListUtil.foldli (fn (i, _, t) => (L'.CApp (t, (L'.CRel (nxs - i), loc)), loc)) t xs
adamc@157 1894
adamc@284 1895 val (env', denv') = foldl (fn (x, (env', denv')) =>
adamc@284 1896 (E.pushCRel env' x k,
adamc@284 1897 D.enter denv')) (env, denv) xs
adamc@284 1898
adamc@157 1899 val (xcs, (used, env, gs)) =
adamc@157 1900 ListUtil.foldlMap
adamc@157 1901 (fn ((x, to), (used, env, gs)) =>
adamc@157 1902 let
adamc@157 1903 val (to, t, gs') = case to of
adamc@157 1904 NONE => (NONE, t, gs)
adamc@157 1905 | SOME t' =>
adamc@157 1906 let
adamc@284 1907 val (t', tk, gs') = elabCon (env', denv') t'
adamc@157 1908 in
adamc@284 1909 checkKind env' t' tk k;
adamc@157 1910 (SOME t', (L'.TFun (t', t), loc), gs' @ gs)
adamc@157 1911 end
adamc@191 1912 val t = foldl (fn (x, t) => (L'.TCFun (L'.Implicit, x, k, t), loc)) t xs
adamc@157 1913
adamc@157 1914 val (env, n') = E.pushENamed env x t
adamc@157 1915 in
adamc@157 1916 if SS.member (used, x) then
adamc@157 1917 strError env (DuplicateConstructor (x, loc))
adamc@157 1918 else
adamc@157 1919 ();
adamc@157 1920 ((x, n', to), (SS.add (used, x), env, gs'))
adamc@157 1921 end)
adamc@157 1922 (SS.empty, env, []) xcs
adamc@191 1923
adamc@191 1924 val env = E.pushDatatype env n xs xcs
adamc@157 1925 in
adamc@191 1926 ([(L'.SgiDatatype (x, n, xs, xcs), loc)], (env, denv, gs))
adamc@157 1927 end
adamc@156 1928
adamc@158 1929 | L.SgiDatatypeImp (_, [], _) => raise Fail "Empty SgiDatatypeImp"
adamc@158 1930
adamc@158 1931 | L.SgiDatatypeImp (x, m1 :: ms, s) =>
adamc@158 1932 (case E.lookupStr env m1 of
adamc@158 1933 NONE => (strError env (UnboundStr (loc, m1));
adamc@158 1934 ([], (env, denv, gs)))
adamc@158 1935 | SOME (n, sgn) =>
adamc@158 1936 let
adamc@158 1937 val (str, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@158 1938 case E.projectStr env {sgn = sgn, str = str, field = m} of
adamc@158 1939 NONE => (conError env (UnboundStrInCon (loc, m));
adamc@158 1940 (strerror, sgnerror))
adamc@158 1941 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@158 1942 ((L'.StrVar n, loc), sgn) ms
adamc@158 1943 in
adamc@628 1944 case hnormCon env (L'.CModProj (n, ms, s), loc) of
adamc@628 1945 (L'.CModProj (n, ms, s), _) =>
adamc@161 1946 (case E.projectDatatype env {sgn = sgn, str = str, field = s} of
adamc@161 1947 NONE => (conError env (UnboundDatatype (loc, s));
adamc@628 1948 ([], (env, denv, [])))
adamc@191 1949 | SOME (xs, xncs) =>
adamc@161 1950 let
adamc@161 1951 val k = (L'.KType, loc)
adamc@191 1952 val k' = foldl (fn (_, k') => (L'.KArrow (k, k'), loc)) k xs
adamc@191 1953
adamc@161 1954 val t = (L'.CModProj (n, ms, s), loc)
adamc@191 1955 val (env, n') = E.pushCNamed env x k' (SOME t)
adamc@191 1956 val env = E.pushDatatype env n' xs xncs
adamc@158 1957
adamc@161 1958 val t = (L'.CNamed n', loc)
adamc@161 1959 val env = foldl (fn ((x, n, to), env) =>
adamc@161 1960 let
adamc@161 1961 val t = case to of
adamc@161 1962 NONE => t
adamc@161 1963 | SOME t' => (L'.TFun (t', t), loc)
adamc@191 1964
adamc@191 1965 val t = foldr (fn (x, t) =>
adamc@191 1966 (L'.TCFun (L'.Implicit, x, k, t), loc))
adamc@191 1967 t xs
adamc@161 1968 in
adamc@161 1969 E.pushENamedAs env x n t
adamc@161 1970 end) env xncs
adamc@161 1971 in
adamc@628 1972 ([(L'.SgiDatatypeImp (x, n', n, ms, s, xs, xncs), loc)], (env, denv, []))
adamc@161 1973 end)
adamc@161 1974 | _ => (strError env (NotDatatype loc);
adamc@161 1975 ([], (env, denv, [])))
adamc@158 1976 end)
adamc@156 1977
adamc@76 1978 | L.SgiVal (x, c) =>
adamc@76 1979 let
adamc@83 1980 val (c', ck, gs') = elabCon (env, denv) c
adamc@31 1981
adamc@76 1982 val (env', n) = E.pushENamed env x c'
adamc@467 1983 val c' = normClassConstraint env c'
adamc@76 1984 in
adamc@623 1985 (unifyKinds env ck ktype
adamc@76 1986 handle KUnify ue => strError env (NotType (ck, ue)));
adamc@31 1987
adamc@467 1988 ([(L'.SgiVal (x, n, c'), loc)], (env', denv, gs' @ gs))
adamc@76 1989 end
adamc@31 1990
adamc@76 1991 | L.SgiStr (x, sgn) =>
adamc@76 1992 let
adamc@83 1993 val (sgn', gs') = elabSgn (env, denv) sgn
adamc@76 1994 val (env', n) = E.pushStrNamed env x sgn'
adamc@76 1995 in
adamc@88 1996 ([(L'.SgiStr (x, n, sgn'), loc)], (env', denv, gs' @ gs))
adamc@76 1997 end
adamc@31 1998
adamc@76 1999 | L.SgiSgn (x, sgn) =>
adamc@76 2000 let
adamc@83 2001 val (sgn', gs') = elabSgn (env, denv) sgn
adamc@76 2002 val (env', n) = E.pushSgnNamed env x sgn'
adamc@76 2003 in
adamc@88 2004 ([(L'.SgiSgn (x, n, sgn'), loc)], (env', denv, gs' @ gs))
adamc@76 2005 end
adamc@31 2006
adamc@76 2007 | L.SgiInclude sgn =>
adamc@76 2008 let
adamc@83 2009 val (sgn', gs') = elabSgn (env, denv) sgn
adamc@76 2010 in
adamc@76 2011 case #1 (hnormSgn env sgn') of
adamc@76 2012 L'.SgnConst sgis =>
adamc@88 2013 (sgis, (foldl (fn (sgi, env) => E.sgiBinds env sgi) env sgis, denv, gs' @ gs))
adamc@76 2014 | _ => (sgnError env (NotIncludable sgn');
adamc@88 2015 ([], (env, denv, [])))
adamc@88 2016 end
adamc@88 2017
adamc@88 2018 | L.SgiConstraint (c1, c2) =>
adamc@88 2019 let
adamc@88 2020 val (c1', k1, gs1) = elabCon (env, denv) c1
adamc@88 2021 val (c2', k2, gs2) = elabCon (env, denv) c2
adamc@88 2022
adamc@628 2023 val denv = D.assert env denv (c1', c2')
adamc@88 2024 in
adamc@88 2025 checkKind env c1' k1 (L'.KRecord (kunif loc), loc);
adamc@88 2026 checkKind env c2' k2 (L'.KRecord (kunif loc), loc);
adamc@88 2027
adamc@628 2028 ([(L'.SgiConstraint (c1', c2'), loc)], (env, denv, gs1 @ gs2))
adamc@76 2029 end
adamc@31 2030
adamc@563 2031 | L.SgiClassAbs (x, k) =>
adamc@211 2032 let
adamc@623 2033 val k = elabKind env k
adamc@563 2034 val k' = (L'.KArrow (k, (L'.KType, loc)), loc)
adamc@563 2035 val (env, n) = E.pushCNamed env x k' NONE
adamc@211 2036 val env = E.pushClass env n
adamc@211 2037 in
adamc@563 2038 ([(L'.SgiClassAbs (x, n, k), loc)], (env, denv, []))
adamc@211 2039 end
adamc@211 2040
adamc@563 2041 | L.SgiClass (x, k, c) =>
adamc@211 2042 let
adamc@623 2043 val k = elabKind env k
adamc@563 2044 val k' = (L'.KArrow (k, (L'.KType, loc)), loc)
adamc@211 2045 val (c', ck, gs) = elabCon (env, denv) c
adamc@563 2046 val (env, n) = E.pushCNamed env x k' (SOME c')
adamc@211 2047 val env = E.pushClass env n
adamc@211 2048 in
adamc@563 2049 checkKind env c' ck k';
adamc@563 2050 ([(L'.SgiClass (x, n, k, c'), loc)], (env, denv, []))
adamc@211 2051 end
adamc@211 2052
adamc@83 2053 and elabSgn (env, denv) (sgn, loc) =
adamc@31 2054 case sgn of
adamc@31 2055 L.SgnConst sgis =>
adamc@31 2056 let
adamc@88 2057 val (sgis', (_, _, gs)) = ListUtil.foldlMapConcat elabSgn_item (env, denv, []) sgis
adamc@62 2058
adamc@62 2059 val _ = foldl (fn ((sgi, loc), (cons, vals, sgns, strs)) =>
adamc@62 2060 case sgi of
adamc@62 2061 L'.SgiConAbs (x, _, _) =>
adamc@62 2062 (if SS.member (cons, x) then
adamc@62 2063 sgnError env (DuplicateCon (loc, x))
adamc@62 2064 else
adamc@62 2065 ();
adamc@62 2066 (SS.add (cons, x), vals, sgns, strs))
adamc@62 2067 | L'.SgiCon (x, _, _, _) =>
adamc@62 2068 (if SS.member (cons, x) then
adamc@62 2069 sgnError env (DuplicateCon (loc, x))
adamc@62 2070 else
adamc@62 2071 ();
adamc@62 2072 (SS.add (cons, x), vals, sgns, strs))
adamc@191 2073 | L'.SgiDatatype (x, _, _, xncs) =>
adamc@156 2074 let
adamc@156 2075 val vals = foldl (fn ((x, _, _), vals) =>
adamc@156 2076 (if SS.member (vals, x) then
adamc@156 2077 sgnError env (DuplicateVal (loc, x))
adamc@156 2078 else
adamc@156 2079 ();
adamc@156 2080 SS.add (vals, x)))
adamc@156 2081 vals xncs
adamc@156 2082 in
adamc@156 2083 if SS.member (cons, x) then
adamc@156 2084 sgnError env (DuplicateCon (loc, x))
adamc@156 2085 else
adamc@156 2086 ();
adamc@156 2087 (SS.add (cons, x), vals, sgns, strs)
adamc@156 2088 end
adamc@191 2089 | L'.SgiDatatypeImp (x, _, _, _, _, _, _) =>
adamc@156 2090 (if SS.member (cons, x) then
adamc@156 2091 sgnError env (DuplicateCon (loc, x))
adamc@156 2092 else
adamc@156 2093 ();
adamc@156 2094 (SS.add (cons, x), vals, sgns, strs))
adamc@62 2095 | L'.SgiVal (x, _, _) =>
adamc@62 2096 (if SS.member (vals, x) then
adamc@62 2097 sgnError env (DuplicateVal (loc, x))
adamc@62 2098 else
adamc@62 2099 ();
adamc@62 2100 (cons, SS.add (vals, x), sgns, strs))
adamc@62 2101 | L'.SgiSgn (x, _, _) =>
adamc@62 2102 (if SS.member (sgns, x) then
adamc@62 2103 sgnError env (DuplicateSgn (loc, x))
adamc@62 2104 else
adamc@62 2105 ();
adamc@62 2106 (cons, vals, SS.add (sgns, x), strs))
adamc@62 2107 | L'.SgiStr (x, _, _) =>
adamc@62 2108 (if SS.member (strs, x) then
adamc@62 2109 sgnError env (DuplicateStr (loc, x))
adamc@62 2110 else
adamc@62 2111 ();
adamc@88 2112 (cons, vals, sgns, SS.add (strs, x)))
adamc@203 2113 | L'.SgiConstraint _ => (cons, vals, sgns, strs)
adamc@563 2114 | L'.SgiClassAbs (x, _, _) =>
adamc@211 2115 (if SS.member (cons, x) then
adamc@211 2116 sgnError env (DuplicateCon (loc, x))
adamc@211 2117 else
adamc@211 2118 ();
adamc@211 2119 (SS.add (cons, x), vals, sgns, strs))
adamc@563 2120 | L'.SgiClass (x, _, _, _) =>
adamc@211 2121 (if SS.member (cons, x) then
adamc@211 2122 sgnError env (DuplicateCon (loc, x))
adamc@211 2123 else
adamc@211 2124 ();
adamc@460 2125 (SS.add (cons, x), vals, sgns, strs)))
adamc@62 2126 (SS.empty, SS.empty, SS.empty, SS.empty) sgis'
adamc@31 2127 in
adamc@83 2128 ((L'.SgnConst sgis', loc), gs)
adamc@31 2129 end
adamc@31 2130 | L.SgnVar x =>
adamc@31 2131 (case E.lookupSgn env x of
adamc@31 2132 NONE =>
adamc@31 2133 (sgnError env (UnboundSgn (loc, x));
adamc@83 2134 ((L'.SgnError, loc), []))
adamc@83 2135 | SOME (n, sgis) => ((L'.SgnVar n, loc), []))
adamc@41 2136 | L.SgnFun (m, dom, ran) =>
adamc@41 2137 let
adamc@83 2138 val (dom', gs1) = elabSgn (env, denv) dom
adamc@41 2139 val (env', n) = E.pushStrNamed env m dom'
adamc@469 2140 val denv' = dopenConstraints (loc, env', denv) {str = m, strs = []}
adamc@469 2141 val (ran', gs2) = elabSgn (env', denv') ran
adamc@41 2142 in
adamc@83 2143 ((L'.SgnFun (m, n, dom', ran'), loc), gs1 @ gs2)
adamc@41 2144 end
adamc@42 2145 | L.SgnWhere (sgn, x, c) =>
adamc@42 2146 let
adamc@83 2147 val (sgn', ds1) = elabSgn (env, denv) sgn
adamc@83 2148 val (c', ck, ds2) = elabCon (env, denv) c
adamc@42 2149 in
adamc@42 2150 case #1 (hnormSgn env sgn') of
adamc@83 2151 L'.SgnError => (sgnerror, [])
adamc@42 2152 | L'.SgnConst sgis =>
adamc@75 2153 if List.exists (fn (L'.SgiConAbs (x', _, k), _) =>
adamc@75 2154 x' = x andalso
adamc@623 2155 (unifyKinds env k ck
adamc@75 2156 handle KUnify x => sgnError env (WhereWrongKind x);
adamc@42 2157 true)
adamc@42 2158 | _ => false) sgis then
adamc@83 2159 ((L'.SgnWhere (sgn', x, c'), loc), ds1 @ ds2)
adamc@42 2160 else
adamc@42 2161 (sgnError env (UnWhereable (sgn', x));
adamc@83 2162 (sgnerror, []))
adamc@42 2163 | _ => (sgnError env (UnWhereable (sgn', x));
adamc@83 2164 (sgnerror, []))
adamc@42 2165 end
adamc@59 2166 | L.SgnProj (m, ms, x) =>
adamc@59 2167 (case E.lookupStr env m of
adamc@59 2168 NONE => (strError env (UnboundStr (loc, m));
adamc@83 2169 (sgnerror, []))
adamc@59 2170 | SOME (n, sgn) =>
adamc@59 2171 let
adamc@59 2172 val (str, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@59 2173 case E.projectStr env {sgn = sgn, str = str, field = m} of
adamc@59 2174 NONE => (strError env (UnboundStr (loc, m));
adamc@59 2175 (strerror, sgnerror))
adamc@59 2176 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@59 2177 ((L'.StrVar n, loc), sgn) ms
adamc@59 2178 in
adamc@59 2179 case E.projectSgn env {sgn = sgn, str = str, field = x} of
adamc@59 2180 NONE => (sgnError env (UnboundSgn (loc, x));
adamc@83 2181 (sgnerror, []))
adamc@83 2182 | SOME _ => ((L'.SgnProj (n, ms, x), loc), [])
adamc@59 2183 end)
adamc@59 2184
adamc@31 2185
adamc@66 2186 fun selfify env {str, strs, sgn} =
adamc@66 2187 case #1 (hnormSgn env sgn) of
adamc@66 2188 L'.SgnError => sgn
adamc@66 2189 | L'.SgnVar _ => sgn
adamc@66 2190
adamc@66 2191 | L'.SgnConst sgis =>
adamc@66 2192 (L'.SgnConst (map (fn (L'.SgiConAbs (x, n, k), loc) =>
adamc@66 2193 (L'.SgiCon (x, n, k, (L'.CModProj (str, strs, x), loc)), loc)
adamc@191 2194 | (L'.SgiDatatype (x, n, xs, xncs), loc) =>
adamc@191 2195 (L'.SgiDatatypeImp (x, n, str, strs, x, xs, xncs), loc)
adamc@563 2196 | (L'.SgiClassAbs (x, n, k), loc) =>
adamc@563 2197 (L'.SgiClass (x, n, k, (L'.CModProj (str, strs, x), loc)), loc)
adamc@66 2198 | (L'.SgiStr (x, n, sgn), loc) =>
adamc@66 2199 (L'.SgiStr (x, n, selfify env {str = str, strs = strs @ [x], sgn = sgn}), loc)
adamc@66 2200 | x => x) sgis), #2 sgn)
adamc@66 2201 | L'.SgnFun _ => sgn
adamc@66 2202 | L'.SgnWhere _ => sgn
adamc@66 2203 | L'.SgnProj (m, ms, x) =>
adamc@66 2204 case E.projectSgn env {str = foldl (fn (m, str) => (L'.StrProj (str, m), #2 sgn))
adamc@66 2205 (L'.StrVar m, #2 sgn) ms,
adamc@66 2206 sgn = #2 (E.lookupStrNamed env m),
adamc@66 2207 field = x} of
adamc@66 2208 NONE => raise Fail "Elaborate.selfify: projectSgn returns NONE"
adamc@66 2209 | SOME sgn => selfify env {str = str, strs = strs, sgn = sgn}
adamc@66 2210
adamc@66 2211 fun selfifyAt env {str, sgn} =
adamc@66 2212 let
adamc@66 2213 fun self (str, _) =
adamc@66 2214 case str of
adamc@66 2215 L'.StrVar x => SOME (x, [])
adamc@66 2216 | L'.StrProj (str, x) =>
adamc@66 2217 (case self str of
adamc@66 2218 NONE => NONE
adamc@66 2219 | SOME (m, ms) => SOME (m, ms @ [x]))
adamc@66 2220 | _ => NONE
adamc@66 2221 in
adamc@66 2222 case self str of
adamc@66 2223 NONE => sgn
adamc@66 2224 | SOME (str, strs) => selfify env {sgn = sgn, str = str, strs = strs}
adamc@66 2225 end
adamc@66 2226
adamc@628 2227 fun dopen env {str, strs, sgn} =
adamc@66 2228 let
adamc@66 2229 val m = foldl (fn (m, str) => (L'.StrProj (str, m), #2 sgn))
adamc@66 2230 (L'.StrVar str, #2 sgn) strs
adamc@66 2231 in
adamc@66 2232 case #1 (hnormSgn env sgn) of
adamc@66 2233 L'.SgnConst sgis =>
adamc@628 2234 ListUtil.foldlMap (fn ((sgi, loc), env') =>
adamc@162 2235 let
adamc@162 2236 val d =
adamc@162 2237 case sgi of
adamc@162 2238 L'.SgiConAbs (x, n, k) =>
adamc@162 2239 let
adamc@162 2240 val c = (L'.CModProj (str, strs, x), loc)
adamc@162 2241 in
adamc@162 2242 (L'.DCon (x, n, k, c), loc)
adamc@162 2243 end
adamc@162 2244 | L'.SgiCon (x, n, k, c) =>
adamc@162 2245 (L'.DCon (x, n, k, (L'.CModProj (str, strs, x), loc)), loc)
adamc@191 2246 | L'.SgiDatatype (x, n, xs, xncs) =>
adamc@191 2247 (L'.DDatatypeImp (x, n, str, strs, x, xs, xncs), loc)
adamc@191 2248 | L'.SgiDatatypeImp (x, n, m1, ms, x', xs, xncs) =>
adamc@191 2249 (L'.DDatatypeImp (x, n, m1, ms, x', xs, xncs), loc)
adamc@162 2250 | L'.SgiVal (x, n, t) =>
adamc@162 2251 (L'.DVal (x, n, t, (L'.EModProj (str, strs, x), loc)), loc)
adamc@162 2252 | L'.SgiStr (x, n, sgn) =>
adamc@162 2253 (L'.DStr (x, n, sgn, (L'.StrProj (m, x), loc)), loc)
adamc@162 2254 | L'.SgiSgn (x, n, sgn) =>
adamc@162 2255 (L'.DSgn (x, n, (L'.SgnProj (str, strs, x), loc)), loc)
adamc@162 2256 | L'.SgiConstraint (c1, c2) =>
adamc@162 2257 (L'.DConstraint (c1, c2), loc)
adamc@563 2258 | L'.SgiClassAbs (x, n, k) =>
adamc@211 2259 let
adamc@563 2260 val k' = (L'.KArrow (k, (L'.KType, loc)), loc)
adamc@211 2261 val c = (L'.CModProj (str, strs, x), loc)
adamc@211 2262 in
adamc@563 2263 (L'.DCon (x, n, k', c), loc)
adamc@211 2264 end
adamc@563 2265 | L'.SgiClass (x, n, k, _) =>
adamc@211 2266 let
adamc@563 2267 val k' = (L'.KArrow (k, (L'.KType, loc)), loc)
adamc@211 2268 val c = (L'.CModProj (str, strs, x), loc)
adamc@211 2269 in
adamc@563 2270 (L'.DCon (x, n, k', c), loc)
adamc@211 2271 end
adamc@162 2272 in
adamc@628 2273 (d, E.declBinds env' d)
adamc@162 2274 end)
adamc@628 2275 env sgis
adamc@66 2276 | _ => (strError env (UnOpenable sgn);
adamc@628 2277 ([], env))
adamc@66 2278 end
adamc@66 2279
adamc@31 2280 fun sgiOfDecl (d, loc) =
adamc@31 2281 case d of
adamc@123 2282 L'.DCon (x, n, k, c) => [(L'.SgiCon (x, n, k, c), loc)]
adamc@156 2283 | L'.DDatatype x => [(L'.SgiDatatype x, loc)]
adamc@156 2284 | L'.DDatatypeImp x => [(L'.SgiDatatypeImp x, loc)]
adamc@123 2285 | L'.DVal (x, n, t, _) => [(L'.SgiVal (x, n, t), loc)]
adamc@123 2286 | L'.DValRec vis => map (fn (x, n, t, _) => (L'.SgiVal (x, n, t), loc)) vis
adamc@123 2287 | L'.DSgn (x, n, sgn) => [(L'.SgiSgn (x, n, sgn), loc)]
adamc@123 2288 | L'.DStr (x, n, sgn, _) => [(L'.SgiStr (x, n, sgn), loc)]
adamc@123 2289 | L'.DFfiStr (x, n, sgn) => [(L'.SgiStr (x, n, sgn), loc)]
adamc@123 2290 | L'.DConstraint cs => [(L'.SgiConstraint cs, loc)]
adamc@123 2291 | L'.DExport _ => []
adamc@460 2292 | L'.DTable (tn, x, n, c) => [(L'.SgiVal (x, n, (L'.CApp (tableOf (), c), loc)), loc)]
adamc@460 2293 | L'.DSequence (tn, x, n) => [(L'.SgiVal (x, n, sequenceOf ()), loc)]
adamc@563 2294 | L'.DClass (x, n, k, c) => [(L'.SgiClass (x, n, k, c), loc)]
adamc@271 2295 | L'.DDatabase _ => []
adamc@460 2296 | L'.DCookie (tn, x, n, c) => [(L'.SgiVal (x, n, (L'.CApp (cookieOf (), c), loc)), loc)]
adamc@88 2297
adamc@628 2298 fun subSgn env sgn1 (sgn2 as (_, loc2)) =
adamc@469 2299 ((*prefaces "subSgn" [("sgn1", p_sgn env sgn1),
adamc@469 2300 ("sgn2", p_sgn env sgn2)];*)
adamc@35 2301 case (#1 (hnormSgn env sgn1), #1 (hnormSgn env sgn2)) of
adamc@31 2302 (L'.SgnError, _) => ()
adamc@31 2303 | (_, L'.SgnError) => ()
adamc@31 2304
adamc@31 2305 | (L'.SgnConst sgis1, L'.SgnConst sgis2) =>
adamc@31 2306 let
adamc@362 2307 (*val () = prefaces "subSgn" [("sgn1", p_sgn env sgn1),
adamc@362 2308 ("sgn2", p_sgn env sgn2),
adamc@362 2309 ("sgis1", p_sgn env (L'.SgnConst sgis1, loc2)),
adamc@362 2310 ("sgis2", p_sgn env (L'.SgnConst sgis2, loc2))]*)
adamc@362 2311
adamc@628 2312 fun folder (sgi2All as (sgi, loc), env) =
adamc@31 2313 let
adamc@362 2314 (*val () = prefaces "folder" [("sgis1", p_sgn env (L'.SgnConst sgis1, loc2))]*)
adamc@362 2315
adamc@31 2316 fun seek p =
adamc@31 2317 let
adamc@628 2318 fun seek env ls =
adamc@31 2319 case ls of
adamc@31 2320 [] => (sgnError env (UnmatchedSgi sgi2All);
adamc@628 2321 env)
adamc@31 2322 | h :: t =>
adamc@469 2323 case p (env, h) of
adamc@469 2324 NONE =>
adamc@469 2325 let
adamc@469 2326 val env = case #1 h of
adamc@469 2327 L'.SgiCon (x, n, k, c) =>
adamc@471 2328 if E.checkENamed env n then
adamc@471 2329 env
adamc@471 2330 else
adamc@471 2331 E.pushCNamedAs env x n k (SOME c)
adamc@469 2332 | L'.SgiConAbs (x, n, k) =>
adamc@471 2333 if E.checkENamed env n then
adamc@471 2334 env
adamc@471 2335 else
adamc@471 2336 E.pushCNamedAs env x n k NONE
adamc@469 2337 | _ => env
adamc@469 2338 in
adamc@628 2339 seek (E.sgiBinds env h) t
adamc@469 2340 end
adamc@88 2341 | SOME envs => envs
adamc@31 2342 in
adamc@628 2343 seek env sgis1
adamc@31 2344 end
adamc@31 2345 in
adamc@31 2346 case sgi of
adamc@31 2347 L'.SgiConAbs (x, n2, k2) =>
adamc@469 2348 seek (fn (env, sgi1All as (sgi1, _)) =>
adamc@31 2349 let
adamc@41 2350 fun found (x', n1, k1, co1) =
adamc@41 2351 if x = x' then
adamc@41 2352 let
adamc@623 2353 val () = unifyKinds env k1 k2
adamc@41 2354 handle KUnify (k1, k2, err) =>
adamc@41 2355 sgnError env (SgiWrongKind (sgi1All, k1, sgi2All, k2, err))
adamc@41 2356 val env = E.pushCNamedAs env x n1 k1 co1
adamc@41 2357 in
adamc@41 2358 SOME (if n1 = n2 then
adamc@41 2359 env
adamc@41 2360 else
adamc@628 2361 E.pushCNamedAs env x n2 k2 (SOME (L'.CNamed n1, loc2)))
adamc@41 2362 end
adamc@41 2363 else
adamc@41 2364 NONE
adamc@31 2365 in
adamc@31 2366 case sgi1 of
adamc@41 2367 L'.SgiConAbs (x', n1, k1) => found (x', n1, k1, NONE)
adamc@41 2368 | L'.SgiCon (x', n1, k1, c1) => found (x', n1, k1, SOME c1)
adamc@191 2369 | L'.SgiDatatype (x', n1, xs, _) =>
adamc@191 2370 let
adamc@191 2371 val k = (L'.KType, loc)
adamc@191 2372 val k' = foldl (fn (_, k') => (L'.KArrow (k, k'), loc)) k xs
adamc@191 2373 in
adamc@191 2374 found (x', n1, k', NONE)
adamc@191 2375 end
adamc@191 2376 | L'.SgiDatatypeImp (x', n1, m1, ms, s, xs, _) =>
adamc@191 2377 let
adamc@191 2378 val k = (L'.KType, loc)
adamc@191 2379 val k' = foldl (fn (_, k') => (L'.KArrow (k, k'), loc)) k xs
adamc@191 2380 in
adamc@191 2381 found (x', n1, k', SOME (L'.CModProj (m1, ms, s), loc))
adamc@191 2382 end
adamc@563 2383 | L'.SgiClassAbs (x', n1, k) => found (x', n1,
adamc@563 2384 (L'.KArrow (k,
adamc@563 2385 (L'.KType, loc)), loc),
adamc@563 2386 NONE)
adamc@563 2387 | L'.SgiClass (x', n1, k, c) => found (x', n1,
adamc@563 2388 (L'.KArrow (k,
adamc@563 2389 (L'.KType, loc)), loc),
adamc@563 2390 SOME c)
adamc@31 2391 | _ => NONE
adamc@31 2392 end)
adamc@31 2393
adamc@31 2394 | L'.SgiCon (x, n2, k2, c2) =>
adamc@469 2395 seek (fn (env, sgi1All as (sgi1, _)) =>
adamc@211 2396 let
adamc@211 2397 fun found (x', n1, k1, c1) =
adamc@211 2398 if x = x' then
adamc@211 2399 let
adamc@327 2400 fun good () =
adamc@327 2401 let
adamc@327 2402 val env = E.pushCNamedAs env x n2 k2 (SOME c2)
adamc@327 2403 val env = if n1 = n2 then
adamc@327 2404 env
adamc@327 2405 else
adamc@327 2406 E.pushCNamedAs env x n1 k1 (SOME c1)
adamc@327 2407 in
adamc@628 2408 SOME env
adamc@327 2409 end
adamc@211 2410 in
adamc@628 2411 (unifyCons env c1 c2;
adamc@628 2412 good ())
adamc@211 2413 handle CUnify (c1, c2, err) =>
adamc@211 2414 (sgnError env (SgiWrongCon (sgi1All, c1, sgi2All, c2, err));
adamc@211 2415 good ())
adamc@211 2416 end
adamc@211 2417 else
adamc@211 2418 NONE
adamc@211 2419 in
adamc@211 2420 case sgi1 of
adamc@211 2421 L'.SgiCon (x', n1, k1, c1) => found (x', n1, k1, c1)
adamc@563 2422 | L'.SgiClass (x', n1, k1, c1) =>
adamc@563 2423 found (x', n1, (L'.KArrow (k1, (L'.KType, loc)), loc), c1)
adamc@211 2424 | _ => NONE
adamc@211 2425 end)
adamc@31 2426
adamc@191 2427 | L'.SgiDatatype (x, n2, xs2, xncs2) =>
adamc@469 2428 seek (fn (env, sgi1All as (sgi1, _)) =>
adamc@160 2429 let
adamc@191 2430 fun found (n1, xs1, xncs1) =
adamc@160 2431 let
adamc@160 2432 fun mismatched ue =
adamc@160 2433 (sgnError env (SgiMismatchedDatatypes (sgi1All, sgi2All, ue));
adamc@628 2434 SOME env)
adamc@156 2435
adamc@191 2436 val k = (L'.KType, loc)
adamc@191 2437 val k' = foldl (fn (_, k') => (L'.KArrow (k, k'), loc)) k xs1
adamc@191 2438
adamc@160 2439 fun good () =
adamc@160 2440 let
adamc@471 2441 val env = E.sgiBinds env sgi1All
adamc@160 2442 val env = if n1 = n2 then
adamc@160 2443 env
adamc@160 2444 else
adamc@471 2445 E.pushCNamedAs env x n2 k'
adamc@471 2446 (SOME (L'.CNamed n1, loc))
adamc@160 2447 in
adamc@628 2448 SOME env
adamc@160 2449 end
adamc@156 2450
adamc@397 2451 val env = E.pushCNamedAs env x n1 k' NONE
adamc@397 2452 val env = if n1 = n2 then
adamc@397 2453 env
adamc@397 2454 else
adamc@397 2455 E.pushCNamedAs env x n2 k' (SOME (L'.CNamed n1, loc))
adamc@191 2456 val env = foldl (fn (x, env) => E.pushCRel env x k) env xs1
adamc@160 2457 fun xncBad ((x1, _, t1), (x2, _, t2)) =
adamc@160 2458 String.compare (x1, x2) <> EQUAL
adamc@160 2459 orelse case (t1, t2) of
adamc@160 2460 (NONE, NONE) => false
adamc@160 2461 | (SOME t1, SOME t2) =>
adamc@628 2462 (unifyCons env t1 t2; false)
adamc@160 2463 | _ => true
adamc@160 2464 in
adamc@191 2465 (if xs1 <> xs2
adamc@191 2466 orelse length xncs1 <> length xncs2
adamc@160 2467 orelse ListPair.exists xncBad (xncs1, xncs2) then
adamc@160 2468 mismatched NONE
adamc@160 2469 else
adamc@160 2470 good ())
adamc@160 2471 handle CUnify ue => mismatched (SOME ue)
adamc@160 2472 end
adamc@160 2473 in
adamc@160 2474 case sgi1 of
adamc@191 2475 L'.SgiDatatype (x', n1, xs, xncs1) =>
adamc@160 2476 if x' = x then
adamc@191 2477 found (n1, xs, xncs1)
adamc@160 2478 else
adamc@160 2479 NONE
adamc@191 2480 | L'.SgiDatatypeImp (x', n1, _, _, _, xs, xncs1) =>
adamc@162 2481 if x' = x then
adamc@191 2482 found (n1, xs, xncs1)
adamc@162 2483 else
adamc@162 2484 NONE
adamc@160 2485 | _ => NONE
adamc@160 2486 end)
adamc@156 2487
adamc@191 2488 | L'.SgiDatatypeImp (x, n2, m12, ms2, s2, xs, _) =>
adamc@469 2489 seek (fn (env, sgi1All as (sgi1, _)) =>
adamc@158 2490 case sgi1 of
adamc@191 2491 L'.SgiDatatypeImp (x', n1, m11, ms1, s1, _, _) =>
adamc@158 2492 if x = x' then
adamc@158 2493 let
adamc@158 2494 val k = (L'.KType, loc)
adamc@191 2495 val k' = foldl (fn (_, k') => (L'.KArrow (k, k'), loc)) k xs
adamc@158 2496 val t1 = (L'.CModProj (m11, ms1, s1), loc)
adamc@158 2497 val t2 = (L'.CModProj (m12, ms2, s2), loc)
adamc@158 2498
adamc@158 2499 fun good () =
adamc@158 2500 let
adamc@191 2501 val env = E.pushCNamedAs env x n1 k' (SOME t1)
adamc@191 2502 val env = E.pushCNamedAs env x n2 k' (SOME t2)
adamc@158 2503 in
adamc@628 2504 SOME env
adamc@158 2505 end
adamc@158 2506 in
adamc@628 2507 (unifyCons env t1 t2;
adamc@628 2508 good ())
adamc@158 2509 handle CUnify (c1, c2, err) =>
adamc@158 2510 (sgnError env (SgiWrongCon (sgi1All, c1, sgi2All, c2, err));
adamc@158 2511 good ())
adamc@158 2512 end
adamc@158 2513 else
adamc@158 2514 NONE
adamc@158 2515
adamc@158 2516 | _ => NONE)
adamc@156 2517
adamc@32 2518 | L'.SgiVal (x, n2, c2) =>
adamc@469 2519 seek (fn (env, sgi1All as (sgi1, _)) =>
adamc@32 2520 case sgi1 of
adamc@41 2521 L'.SgiVal (x', n1, c1) =>
adamc@41 2522 if x = x' then
adamc@628 2523 (unifyCons env c1 c2;
adamc@628 2524 SOME env)
adamc@86 2525 handle CUnify (c1, c2, err) =>
adamc@86 2526 (sgnError env (SgiWrongCon (sgi1All, c1, sgi2All, c2, err));
adamc@628 2527 SOME env)
adamc@41 2528 else
adamc@41 2529 NONE
adamc@32 2530 | _ => NONE)
adamc@32 2531
adamc@33 2532 | L'.SgiStr (x, n2, sgn2) =>
adamc@469 2533 seek (fn (env, sgi1All as (sgi1, _)) =>
adamc@33 2534 case sgi1 of
adamc@41 2535 L'.SgiStr (x', n1, sgn1) =>
adamc@41 2536 if x = x' then
adamc@66 2537 let
adamc@628 2538 val () = subSgn env sgn1 sgn2
adamc@66 2539 val env = E.pushStrNamedAs env x n1 sgn1
adamc@66 2540 val env = if n1 = n2 then
adamc@66 2541 env
adamc@66 2542 else
adamc@66 2543 E.pushStrNamedAs env x n2
adamc@66 2544 (selfifyAt env {str = (L'.StrVar n1, #2 sgn2),
adamc@66 2545 sgn = sgn2})
adamc@66 2546 in
adamc@628 2547 SOME env
adamc@66 2548 end
adamc@41 2549 else
adamc@41 2550 NONE
adamc@33 2551 | _ => NONE)
adamc@59 2552
adamc@59 2553 | L'.SgiSgn (x, n2, sgn2) =>
adamc@469 2554 seek (fn (env, sgi1All as (sgi1, _)) =>
adamc@59 2555 case sgi1 of
adamc@59 2556 L'.SgiSgn (x', n1, sgn1) =>
adamc@59 2557 if x = x' then
adamc@65 2558 let
adamc@628 2559 val () = subSgn env sgn1 sgn2
adamc@628 2560 val () = subSgn env sgn2 sgn1
adamc@65 2561
adamc@65 2562 val env = E.pushSgnNamedAs env x n2 sgn2
adamc@65 2563 val env = if n1 = n2 then
adamc@65 2564 env
adamc@65 2565 else
adamc@65 2566 E.pushSgnNamedAs env x n1 sgn2
adamc@65 2567 in
adamc@628 2568 SOME env
adamc@65 2569 end
adamc@59 2570 else
adamc@59 2571 NONE
adamc@59 2572 | _ => NONE)
adamc@88 2573
adamc@88 2574 | L'.SgiConstraint (c2, d2) =>
adamc@469 2575 seek (fn (env, sgi1All as (sgi1, _)) =>
adamc@88 2576 case sgi1 of
adamc@88 2577 L'.SgiConstraint (c1, d1) =>
adamc@628 2578 if consEq env (c1, c2) andalso consEq env (d1, d2) then
adamc@628 2579 SOME env
adamc@88 2580 else
adamc@88 2581 NONE
adamc@88 2582 | _ => NONE)
adamc@203 2583
adamc@563 2584 | L'.SgiClassAbs (x, n2, k2) =>
adamc@469 2585 seek (fn (env, sgi1All as (sgi1, _)) =>
adamc@211 2586 let
adamc@563 2587 fun found (x', n1, k1, co) =
adamc@211 2588 if x = x' then
adamc@211 2589 let
adamc@623 2590 val () = unifyKinds env k1 k2
adamc@563 2591 handle KUnify (k1, k2, err) =>
adamc@563 2592 sgnError env (SgiWrongKind (sgi1All, k1, sgi2All, k2, err))
adamc@563 2593
adamc@563 2594 val k = (L'.KArrow (k1, (L'.KType, loc)), loc)
adamc@211 2595 val env = E.pushCNamedAs env x n1 k co
adamc@211 2596 in
adamc@211 2597 SOME (if n1 = n2 then
adamc@211 2598 env
adamc@211 2599 else
adamc@628 2600 E.pushCNamedAs env x n2 k (SOME (L'.CNamed n1, loc2)))
adamc@211 2601 end
adamc@211 2602 else
adamc@211 2603 NONE
adamc@211 2604 in
adamc@211 2605 case sgi1 of
adamc@563 2606 L'.SgiClassAbs (x', n1, k1) => found (x', n1, k1, NONE)
adamc@563 2607 | L'.SgiClass (x', n1, k1, c) => found (x', n1, k1, SOME c)
adamc@211 2608 | _ => NONE
adamc@211 2609 end)
adamc@563 2610 | L'.SgiClass (x, n2, k2, c2) =>
adamc@469 2611 seek (fn (env, sgi1All as (sgi1, _)) =>
adamc@211 2612 let
adamc@563 2613 val k = (L'.KArrow (k2, (L'.KType, loc)), loc)
adamc@563 2614
adamc@563 2615 fun found (x', n1, k1, c1) =
adamc@211 2616 if x = x' then
adamc@211 2617 let
adamc@623 2618 val () = unifyKinds env k1 k2
adamc@563 2619 handle KUnify (k1, k2, err) =>
adamc@563 2620 sgnError env (SgiWrongKind (sgi1All, k1, sgi2All, k2, err))
adamc@563 2621
adamc@218 2622 fun good () =
adamc@218 2623 let
adamc@218 2624 val env = E.pushCNamedAs env x n2 k (SOME c2)
adamc@218 2625 val env = if n1 = n2 then
adamc@218 2626 env
adamc@218 2627 else
adamc@218 2628 E.pushCNamedAs env x n1 k (SOME c1)
adamc@218 2629 in
adamc@628 2630 SOME env
adamc@218 2631 end
adamc@211 2632 in
adamc@628 2633 (unifyCons env c1 c2;
adamc@628 2634 good ())
adamc@211 2635 handle CUnify (c1, c2, err) =>
adamc@211 2636 (sgnError env (SgiWrongCon (sgi1All, c1, sgi2All, c2, err));
adamc@211 2637 good ())
adamc@211 2638 end
adamc@211 2639 else
adamc@211 2640 NONE
adamc@211 2641 in
adamc@211 2642 case sgi1 of
adamc@563 2643 L'.SgiClass (x', n1, k1, c1) => found (x', n1, k1, c1)
adamc@211 2644 | _ => NONE
adamc@211 2645 end)
adamc@31 2646 end
adamc@31 2647 in
adamc@628 2648 ignore (foldl folder env sgis2)
adamc@31 2649 end
adamc@31 2650
adamc@41 2651 | (L'.SgnFun (m1, n1, dom1, ran1), L'.SgnFun (m2, n2, dom2, ran2)) =>
adamc@43 2652 let
adamc@480 2653 val ran2 =
adamc@43 2654 if n1 = n2 then
adamc@480 2655 ran2
adamc@43 2656 else
adamc@480 2657 subStrInSgn (n2, n1) ran2
adamc@43 2658 in
adamc@628 2659 subSgn env dom2 dom1;
adamc@628 2660 subSgn (E.pushStrNamedAs env m1 n1 dom2) ran1 ran2
adamc@43 2661 end
adamc@41 2662
adamc@469 2663 | _ => sgnError env (SgnWrongForm (sgn1, sgn2)))
adamc@41 2664
adamc@61 2665
adamc@312 2666 fun positive self =
adamc@312 2667 let
adamc@312 2668 open L
adamc@312 2669
adamc@312 2670 fun none (c, _) =
adamc@312 2671 case c of
adamc@312 2672 CAnnot (c, _) => none c
adamc@312 2673
adamc@312 2674 | TFun (c1, c2) => none c1 andalso none c2
adamc@312 2675 | TCFun (_, _, _, c) => none c
adamc@312 2676 | TRecord c => none c
adamc@312 2677
adamc@312 2678 | CVar ([], x) => x <> self
adamc@312 2679 | CVar _ => true
adamc@312 2680 | CApp (c1, c2) => none c1 andalso none c2
adamc@312 2681 | CAbs _ => false
adamc@628 2682 | TDisjoint (c1, c2, c3) => none c1 andalso none c2 andalso none c3
adamc@312 2683
adamc@623 2684 | CKAbs _ => false
adamc@623 2685 | TKFun _ => false
adamc@623 2686
adamc@312 2687 | CName _ => true
adamc@312 2688
adamc@312 2689 | CRecord xcs => List.all (fn (c1, c2) => none c1 andalso none c2) xcs
adamc@312 2690 | CConcat (c1, c2) => none c1 andalso none c2
adamc@621 2691 | CMap => true
adamc@312 2692
adamc@312 2693 | CUnit => true
adamc@312 2694
adamc@312 2695 | CTuple cs => List.all none cs
adamc@312 2696 | CProj (c, _) => none c
adamc@312 2697
adamc@312 2698 | CWild _ => false
adamc@312 2699
adamc@312 2700 fun pos (c, _) =
adamc@312 2701 case c of
adamc@312 2702 CAnnot (c, _) => pos c
adamc@312 2703
adamc@312 2704 | TFun (c1, c2) => none c1 andalso pos c2
adamc@312 2705 | TCFun (_, _, _, c) => pos c
adamc@312 2706 | TRecord c => pos c
adamc@312 2707
adamc@312 2708 | CVar _ => true
adamc@312 2709 | CApp (c1, c2) => pos c1 andalso none c2
adamc@312 2710 | CAbs _ => false
adamc@628 2711 | TDisjoint (c1, c2, c3) => none c1 andalso none c2 andalso none c3
adamc@312 2712
adamc@623 2713 | CKAbs _ => false
adamc@623 2714 | TKFun _ => false
adamc@623 2715
adamc@312 2716 | CName _ => true
adamc@312 2717
adamc@312 2718 | CRecord xcs => List.all (fn (c1, c2) => none c1 andalso pos c2) xcs
adamc@312 2719 | CConcat (c1, c2) => pos c1 andalso pos c2
adamc@621 2720 | CMap => true
adamc@312 2721
adamc@312 2722 | CUnit => true
adamc@312 2723
adamc@312 2724 | CTuple cs => List.all pos cs
adamc@312 2725 | CProj (c, _) => pos c
adamc@312 2726
adamc@312 2727 | CWild _ => false
adamc@312 2728 in
adamc@312 2729 pos
adamc@312 2730 end
adamc@312 2731
adamc@325 2732 fun wildifyStr env (str, sgn) =
adamc@325 2733 case #1 (hnormSgn env sgn) of
adamc@325 2734 L'.SgnConst sgis =>
adamc@325 2735 (case #1 str of
adamc@325 2736 L.StrConst ds =>
adamc@325 2737 let
adamc@493 2738 fun decompileKind (k, loc) =
adamc@493 2739 case k of
adamc@493 2740 L'.KType => SOME (L.KType, loc)
adamc@493 2741 | L'.KArrow (k1, k2) =>
adamc@493 2742 (case (decompileKind k1, decompileKind k2) of
adamc@493 2743 (SOME k1, SOME k2) => SOME (L.KArrow (k1, k2), loc)
adamc@493 2744 | _ => NONE)
adamc@493 2745 | L'.KName => SOME (L.KName, loc)
adamc@493 2746 | L'.KRecord k =>
adamc@493 2747 (case decompileKind k of
adamc@493 2748 SOME k => SOME (L.KRecord k, loc)
adamc@493 2749 | _ => NONE)
adamc@493 2750 | L'.KUnit => SOME (L.KUnit, loc)
adamc@493 2751 | L'.KTuple ks =>
adamc@493 2752 let
adamc@493 2753 val ks' = List.mapPartial decompileKind ks
adamc@493 2754 in
adamc@493 2755 if length ks' = length ks then
adamc@493 2756 SOME (L.KTuple ks', loc)
adamc@493 2757 else
adamc@493 2758 NONE
adamc@493 2759 end
adamc@493 2760
adamc@493 2761 | L'.KError => NONE
adamc@493 2762 | L'.KUnif (_, _, ref (SOME k)) => decompileKind k
adamc@493 2763 | L'.KUnif _ => NONE
adamc@493 2764
adamc@623 2765 | L'.KRel _ => NONE
adamc@623 2766 | L'.KFun _ => NONE
adamc@623 2767
adamc@325 2768 fun decompileCon env (c, loc) =
adamc@325 2769 case c of
adamc@325 2770 L'.CRel i =>
adamc@325 2771 let
adamc@325 2772 val (s, _) = E.lookupCRel env i
adamc@325 2773 in
adamc@325 2774 SOME (L.CVar ([], s), loc)
adamc@325 2775 end
adamc@325 2776 | L'.CNamed i =>
adamc@325 2777 let
adamc@325 2778 val (s, _, _) = E.lookupCNamed env i
adamc@325 2779 in
adamc@325 2780 SOME (L.CVar ([], s), loc)
adamc@325 2781 end
adamc@325 2782 | L'.CModProj (m1, ms, x) =>
adamc@325 2783 let
adamc@325 2784 val (s, _) = E.lookupStrNamed env m1
adamc@325 2785 in
adamc@325 2786 SOME (L.CVar (s :: ms, x), loc)
adamc@325 2787 end
adamc@325 2788 | L'.CName s => SOME (L.CName s, loc)
adamc@325 2789 | L'.CRecord (_, xcs) =>
adamc@325 2790 let
adamc@325 2791 fun fields xcs =
adamc@325 2792 case xcs of
adamc@325 2793 [] => SOME []
adamc@325 2794 | (x, t) :: xcs =>
adamc@325 2795 case (decompileCon env x, decompileCon env t, fields xcs) of
adamc@325 2796 (SOME x, SOME t, SOME xcs) => SOME ((x, t) :: xcs)
adamc@325 2797 | _ => NONE
adamc@325 2798 in
adamc@325 2799 Option.map (fn xcs => (L.CRecord xcs, loc))
adamc@325 2800 (fields xcs)
adamc@325 2801 end
adamc@325 2802 | L'.CConcat (c1, c2) =>
adamc@325 2803 (case (decompileCon env c1, decompileCon env c2) of
adamc@325 2804 (SOME c1, SOME c2) => SOME (L.CConcat (c1, c2), loc)
adamc@325 2805 | _ => NONE)
adamc@325 2806 | L'.CUnit => SOME (L.CUnit, loc)
adamc@325 2807
adamc@325 2808 | _ => NONE
adamc@325 2809
adamc@469 2810 val (neededC, constraints, neededV, _) =
adamc@469 2811 foldl (fn ((sgi, loc), (neededC, constraints, neededV, env')) =>
adamc@325 2812 let
adamc@469 2813 val (needed, constraints, neededV) =
adamc@325 2814 case sgi of
adamc@493 2815 L'.SgiConAbs (x, _, k) => (SM.insert (neededC, x, k), constraints, neededV)
adamc@469 2816 | L'.SgiConstraint cs => (neededC, (env', cs, loc) :: constraints, neededV)
adamc@469 2817
adamc@469 2818 | L'.SgiVal (x, _, t) =>
adamc@469 2819 let
adamc@469 2820 fun default () = (neededC, constraints, neededV)
adamc@469 2821
adamc@469 2822 val t = normClassConstraint env' t
adamc@469 2823 in
adamc@469 2824 case #1 t of
adamc@469 2825 L'.CApp (f, _) =>
adamc@469 2826 if E.isClass env' f then
adamc@469 2827 (neededC, constraints, SS.add (neededV, x))
adamc@469 2828 else
adamc@469 2829 default ()
adamc@469 2830
adamc@469 2831 | _ => default ()
adamc@469 2832 end
adamc@469 2833
adamc@469 2834 | _ => (neededC, constraints, neededV)
adamc@325 2835 in
adamc@469 2836 (needed, constraints, neededV, E.sgiBinds env' (sgi, loc))
adamc@325 2837 end)
adamc@493 2838 (SM.empty, [], SS.empty, env) sgis
adamc@325 2839
adamc@469 2840 val (neededC, neededV) = foldl (fn ((d, _), needed as (neededC, neededV)) =>
adamc@469 2841 case d of
adamc@493 2842 L.DCon (x, _, _) => ((#1 (SM.remove (neededC, x)), neededV)
adamc@469 2843 handle NotFound =>
adamc@469 2844 needed)
adamc@563 2845 | L.DClass (x, _, _) => ((#1 (SM.remove (neededC, x)), neededV)
adamc@563 2846 handle NotFound => needed)
adamc@469 2847 | L.DVal (x, _, _) => ((neededC, SS.delete (neededV, x))
adamc@469 2848 handle NotFound => needed)
adamc@493 2849 | L.DOpen _ => (SM.empty, SS.empty)
adamc@469 2850 | _ => needed)
adamc@469 2851 (neededC, neededV) ds
adamc@469 2852
adamc@469 2853 val ds' = List.mapPartial (fn (env', (c1, c2), loc) =>
adamc@325 2854 case (decompileCon env' c1, decompileCon env' c2) of
adamc@325 2855 (SOME c1, SOME c2) =>
adamc@325 2856 SOME (L.DConstraint (c1, c2), loc)
adamc@325 2857 | _ => NONE) constraints
adamc@469 2858
adamc@469 2859 val ds' =
adamc@469 2860 case SS.listItems neededV of
adamc@469 2861 [] => ds'
adamc@469 2862 | xs =>
adamc@469 2863 let
adamc@469 2864 val ewild = (L.EWild, #2 str)
adamc@469 2865 val ds'' = map (fn x => (L.DVal (x, NONE, ewild), #2 str)) xs
adamc@469 2866 in
adamc@469 2867 ds'' @ ds'
adamc@469 2868 end
adamc@469 2869
adamc@469 2870 val ds' =
adamc@493 2871 case SM.listItemsi neededC of
adamc@469 2872 [] => ds'
adamc@469 2873 | xs =>
adamc@469 2874 let
adamc@493 2875 val ds'' = map (fn (x, k) =>
adamc@493 2876 let
adamc@493 2877 val k =
adamc@493 2878 case decompileKind k of
adamc@493 2879 NONE => (L.KWild, #2 str)
adamc@493 2880 | SOME k => k
adamc@493 2881 val cwild = (L.CWild k, #2 str)
adamc@493 2882 in
adamc@493 2883 (L.DCon (x, NONE, cwild), #2 str)
adamc@493 2884 end) xs
adamc@469 2885 in
adamc@469 2886 ds'' @ ds'
adamc@469 2887 end
adamc@325 2888 in
adamc@469 2889 (L.StrConst (ds @ ds'), #2 str)
adamc@325 2890 end
adamc@325 2891 | _ => str)
adamc@325 2892 | _ => str
adamc@325 2893
adamc@628 2894 fun elabDecl (dAll as (d, loc), (env, denv, gs)) =
adamc@255 2895 let
adamc@255 2896 (*val () = preface ("elabDecl", SourcePrint.p_decl (d, loc))*)
adamc@514 2897 (*val befor = Time.now ()*)
adamc@255 2898
adamc@255 2899 val r =
adamc@255 2900 case d of
adamc@255 2901 L.DCon (x, ko, c) =>
adamc@255 2902 let
adamc@255 2903 val k' = case ko of
adamc@255 2904 NONE => kunif loc
adamc@623 2905 | SOME k => elabKind env k
adamc@255 2906
adamc@255 2907 val (c', ck, gs') = elabCon (env, denv) c
adamc@255 2908 val (env', n) = E.pushCNamed env x k' (SOME c')
adamc@255 2909 in
adamc@255 2910 checkKind env c' ck k';
adamc@255 2911
adamc@255 2912 ([(L'.DCon (x, n, k', c'), loc)], (env', denv, enD gs' @ gs))
adamc@255 2913 end
adamc@255 2914 | L.DDatatype (x, xs, xcs) =>
adamc@255 2915 let
adamc@312 2916 val positive = List.all (fn (_, to) =>
adamc@312 2917 case to of
adamc@312 2918 NONE => true
adamc@312 2919 | SOME t => positive x t) xcs
adamc@312 2920
adamc@255 2921 val k = (L'.KType, loc)
adamc@255 2922 val k' = foldl (fn (_, k') => (L'.KArrow (k, k'), loc)) k xs
adamc@255 2923 val (env, n) = E.pushCNamed env x k' NONE
adamc@255 2924 val t = (L'.CNamed n, loc)
adamc@255 2925 val nxs = length xs - 1
adamc@255 2926 val t = ListUtil.foldli (fn (i, _, t) => (L'.CApp (t, (L'.CRel (nxs - i), loc)), loc)) t xs
adamc@255 2927
adamc@255 2928 val (env', denv') = foldl (fn (x, (env', denv')) =>
adamc@255 2929 (E.pushCRel env' x k,
adamc@255 2930 D.enter denv')) (env, denv) xs
adamc@255 2931
adamc@255 2932 val (xcs, (used, env, gs')) =
adamc@255 2933 ListUtil.foldlMap
adamc@255 2934 (fn ((x, to), (used, env, gs)) =>
adamc@255 2935 let
adamc@255 2936 val (to, t, gs') = case to of
adamc@255 2937 NONE => (NONE, t, gs)
adamc@255 2938 | SOME t' =>
adamc@255 2939 let
adamc@255 2940 val (t', tk, gs') = elabCon (env', denv') t'
adamc@255 2941 in
adamc@255 2942 checkKind env' t' tk k;
adamc@255 2943 (SOME t', (L'.TFun (t', t), loc), enD gs' @ gs)
adamc@255 2944 end
adamc@255 2945 val t = foldr (fn (x, t) => (L'.TCFun (L'.Implicit, x, k, t), loc)) t xs
adamc@255 2946
adamc@255 2947 val (env, n') = E.pushENamed env x t
adamc@255 2948 in
adamc@255 2949 if SS.member (used, x) then
adamc@255 2950 strError env (DuplicateConstructor (x, loc))
adamc@255 2951 else
adamc@255 2952 ();
adamc@255 2953 ((x, n', to), (SS.add (used, x), env, gs'))
adamc@255 2954 end)
adamc@255 2955 (SS.empty, env, []) xcs
adamc@255 2956
adamc@255 2957 val env = E.pushDatatype env n xs xcs
adamc@312 2958 val d' = (L'.DDatatype (x, n, xs, xcs), loc)
adamc@255 2959 in
adamc@601 2960 (*if positive then
adamc@312 2961 ()
adamc@312 2962 else
adamc@601 2963 declError env (Nonpositive d');*)
adamc@312 2964
adamc@312 2965 ([d'], (env, denv, gs' @ gs))
adamc@255 2966 end
adamc@255 2967
adamc@255 2968 | L.DDatatypeImp (_, [], _) => raise Fail "Empty DDatatypeImp"
adamc@255 2969
adamc@255 2970 | L.DDatatypeImp (x, m1 :: ms, s) =>
adamc@255 2971 (case E.lookupStr env m1 of
adamc@255 2972 NONE => (expError env (UnboundStrInExp (loc, m1));
adamc@255 2973 ([], (env, denv, gs)))
adamc@255 2974 | SOME (n, sgn) =>
adamc@255 2975 let
adamc@255 2976 val (str, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@255 2977 case E.projectStr env {sgn = sgn, str = str, field = m} of
adamc@255 2978 NONE => (conError env (UnboundStrInCon (loc, m));
adamc@255 2979 (strerror, sgnerror))
adamc@255 2980 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@255 2981 ((L'.StrVar n, loc), sgn) ms
adamc@255 2982 in
adamc@628 2983 case hnormCon env (L'.CModProj (n, ms, s), loc) of
adamc@628 2984 (L'.CModProj (n, ms, s), _) =>
adamc@255 2985 (case E.projectDatatype env {sgn = sgn, str = str, field = s} of
adamc@255 2986 NONE => (conError env (UnboundDatatype (loc, s));
adamc@255 2987 ([], (env, denv, gs)))
adamc@255 2988 | SOME (xs, xncs) =>
adamc@255 2989 let
adamc@255 2990 val k = (L'.KType, loc)
adamc@255 2991 val k' = foldl (fn (_, k') => (L'.KArrow (k, k'), loc)) k xs
adamc@255 2992 val t = (L'.CModProj (n, ms, s), loc)
adamc@255 2993 val (env, n') = E.pushCNamed env x k' (SOME t)
adamc@255 2994 val env = E.pushDatatype env n' xs xncs
adamc@255 2995
adamc@255 2996 val t = (L'.CNamed n', loc)
adamc@255 2997 val env = foldl (fn ((x, n, to), env) =>
adamc@255 2998 let
adamc@255 2999 val t = case to of
adamc@255 3000 NONE => t
adamc@255 3001 | SOME t' => (L'.TFun (t', t), loc)
adamc@255 3002
adamc@255 3003 val t = foldr (fn (x, t) =>
adamc@255 3004 (L'.TCFun (L'.Implicit, x, k, t), loc))
adamc@255 3005 t xs
adamc@255 3006 in
adamc@255 3007 E.pushENamedAs env x n t
adamc@255 3008 end) env xncs
adamc@255 3009 in
adamc@628 3010 ([(L'.DDatatypeImp (x, n', n, ms, s, xs, xncs), loc)], (env, denv, gs))
adamc@255 3011 end)
adamc@255 3012 | _ => (strError env (NotDatatype loc);
adamc@255 3013 ([], (env, denv, [])))
adamc@255 3014 end)
adamc@255 3015
adamc@255 3016 | L.DVal (x, co, e) =>
adamc@255 3017 let
adamc@255 3018 val (c', _, gs1) = case co of
adamc@255 3019 NONE => (cunif (loc, ktype), ktype, [])
adamc@255 3020 | SOME c => elabCon (env, denv) c
adamc@255 3021
adamc@255 3022 val (e', et, gs2) = elabExp (env, denv) e
adamc@629 3023
adamc@629 3024 val () = checkCon env e' et c'
adamc@629 3025
adamc@467 3026 val c = normClassConstraint env c'
adamc@255 3027 val (env', n) = E.pushENamed env x c'
adamc@255 3028 in
adamc@255 3029 (*prefaces "DVal" [("x", Print.PD.string x),
adamc@362 3030 ("c'", p_con env c')];*)
adamc@628 3031 ([(L'.DVal (x, n, c', e'), loc)], (env', denv, enD gs1 @ gs2 @ gs))
adamc@255 3032 end
adamc@255 3033 | L.DValRec vis =>
adamc@255 3034 let
adamc@255 3035 fun allowable (e, _) =
adamc@255 3036 case e of
adamc@255 3037 L.EAbs _ => true
adamc@255 3038 | L.ECAbs (_, _, _, e) => allowable e
adamc@623 3039 | L.EKAbs (_, e) => allowable e
adamc@255 3040 | L.EDisjoint (_, _, e) => allowable e
adamc@255 3041 | _ => false
adamc@255 3042
adamc@255 3043 val (vis, gs) = ListUtil.foldlMap
adamc@255 3044 (fn ((x, co, e), gs) =>
adamc@255 3045 let
adamc@255 3046 val (c', _, gs1) = case co of
adamc@255 3047 NONE => (cunif (loc, ktype), ktype, [])
adamc@255 3048 | SOME c => elabCon (env, denv) c
adamc@255 3049 in
adamc@255 3050 ((x, c', e), enD gs1 @ gs)
adamc@280 3051 end) gs vis
adamc@255 3052
adamc@255 3053 val (vis, env) = ListUtil.foldlMap (fn ((x, c', e), env) =>
adamc@255 3054 let
adamc@255 3055 val (env, n) = E.pushENamed env x c'
adamc@255 3056 in
adamc@255 3057 ((x, n, c', e), env)
adamc@255 3058 end) env vis
adamc@255 3059
adamc@255 3060 val (vis, gs) = ListUtil.foldlMap (fn ((x, n, c', e), gs) =>
adamc@255 3061 let
adamc@255 3062 val (e', et, gs1) = elabExp (env, denv) e
adamc@255 3063 in
adamc@628 3064 checkCon env e' et c';
adamc@255 3065 if allowable e then
adamc@255 3066 ()
adamc@255 3067 else
adamc@255 3068 expError env (IllegalRec (x, e'));
adamc@628 3069 ((x, n, c', e'), gs1 @ gs)
adamc@255 3070 end) gs vis
adamc@255 3071 in
adamc@255 3072 ([(L'.DValRec vis, loc)], (env, denv, gs))
adamc@255 3073 end
adamc@255 3074
adamc@255 3075 | L.DSgn (x, sgn) =>
adamc@255 3076 let
adamc@255 3077 val (sgn', gs') = elabSgn (env, denv) sgn
adamc@255 3078 val (env', n) = E.pushSgnNamed env x sgn'
adamc@255 3079 in
adamc@255 3080 ([(L'.DSgn (x, n, sgn'), loc)], (env', denv, enD gs' @ gs))
adamc@255 3081 end
adamc@255 3082
adamc@255 3083 | L.DStr (x, sgno, str) =>
adamc@255 3084 let
adamc@255 3085 val () = if x = "Basis" then
adamc@255 3086 raise Fail "Not allowed to redefine structure 'Basis'"
adamc@255 3087 else
adamc@255 3088 ()
adamc@255 3089
adamc@255 3090 val formal = Option.map (elabSgn (env, denv)) sgno
adamc@255 3091
adamc@255 3092 val (str', sgn', gs') =
adamc@255 3093 case formal of
adamc@255 3094 NONE =>
adamc@255 3095 let
adamc@255 3096 val (str', actual, gs') = elabStr (env, denv) str
adamc@255 3097 in
adamc@255 3098 (str', selfifyAt env {str = str', sgn = actual}, gs')
adamc@255 3099 end
adamc@255 3100 | SOME (formal, gs1) =>
adamc@255 3101 let
adamc@325 3102 val str = wildifyStr env (str, formal)
adamc@255 3103 val (str', actual, gs2) = elabStr (env, denv) str
adamc@255 3104 in
adamc@628 3105 subSgn env (selfifyAt env {str = str', sgn = actual}) formal;
adamc@255 3106 (str', formal, enD gs1 @ gs2)
adamc@255 3107 end
adamc@255 3108
adamc@255 3109 val (env', n) = E.pushStrNamed env x sgn'
adamc@255 3110 in
adamc@255 3111 case #1 (hnormSgn env sgn') of
adamc@255 3112 L'.SgnFun _ =>
adamc@255 3113 (case #1 str' of
adamc@255 3114 L'.StrFun _ => ()
adamc@255 3115 | _ => strError env (FunctorRebind loc))
adamc@255 3116 | _ => ();
adamc@255 3117
adamc@255 3118 ([(L'.DStr (x, n, sgn', str'), loc)], (env', denv, gs' @ gs))
adamc@255 3119 end
adamc@255 3120
adamc@255 3121 | L.DFfiStr (x, sgn) =>
adamc@255 3122 let
adamc@255 3123 val (sgn', gs') = elabSgn (env, denv) sgn
adamc@255 3124
adamc@255 3125 val (env', n) = E.pushStrNamed env x sgn'
adamc@255 3126 in
adamc@255 3127 ([(L'.DFfiStr (x, n, sgn'), loc)], (env', denv, enD gs' @ gs))
adamc@255 3128 end
adamc@255 3129
adamc@255 3130 | L.DOpen (m, ms) =>
adamc@255 3131 (case E.lookupStr env m of
adamc@255 3132 NONE => (strError env (UnboundStr (loc, m));
adamc@255 3133 ([], (env, denv, gs)))
adamc@255 3134 | SOME (n, sgn) =>
adamc@255 3135 let
adamc@255 3136 val (_, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@255 3137 case E.projectStr env {str = str, sgn = sgn, field = m} of
adamc@255 3138 NONE => (strError env (UnboundStr (loc, m));
adamc@255 3139 (strerror, sgnerror))
adamc@255 3140 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@255 3141 ((L'.StrVar n, loc), sgn) ms
adamc@255 3142
adamc@628 3143 val (ds, env') = dopen env {str = n, strs = ms, sgn = sgn}
adamc@628 3144 val denv' = dopenConstraints (loc, env', denv) {str = m, strs = ms}
adamc@255 3145 in
adamc@255 3146 (ds, (env', denv', gs))
adamc@255 3147 end)
adamc@255 3148
adamc@255 3149 | L.DConstraint (c1, c2) =>
adamc@255 3150 let
adamc@255 3151 val (c1', k1, gs1) = elabCon (env, denv) c1
adamc@255 3152 val (c2', k2, gs2) = elabCon (env, denv) c2
adamc@255 3153 val gs3 = D.prove env denv (c1', c2', loc)
adamc@255 3154
adamc@628 3155 val denv' = D.assert env denv (c1', c2')
adamc@255 3156 in
adamc@255 3157 checkKind env c1' k1 (L'.KRecord (kunif loc), loc);
adamc@255 3158 checkKind env c2' k2 (L'.KRecord (kunif loc), loc);
adamc@255 3159
adamc@628 3160 ([(L'.DConstraint (c1', c2'), loc)], (env, denv', enD gs1 @ enD gs2 @ enD gs3 @ gs))
adamc@255 3161 end
adamc@255 3162
adamc@255 3163 | L.DOpenConstraints (m, ms) =>
adamc@255 3164 let
adamc@255 3165 val denv = dopenConstraints (loc, env, denv) {str = m, strs = ms}
adamc@255 3166 in
adamc@255 3167 ([], (env, denv, gs))
adamc@255 3168 end
adamc@255 3169
adamc@255 3170 | L.DExport str =>
adamc@255 3171 let
adamc@255 3172 val (str', sgn, gs') = elabStr (env, denv) str
adamc@255 3173
adamc@255 3174 val sgn =
adamc@255 3175 case #1 (hnormSgn env sgn) of
adamc@255 3176 L'.SgnConst sgis =>
adamc@255 3177 let
adamc@255 3178 fun doOne (all as (sgi, _), env) =
adamc@255 3179 (case sgi of
adamc@255 3180 L'.SgiVal (x, n, t) =>
adamc@325 3181 let
adamc@325 3182 fun doPage (makeRes, ran) =
adamc@628 3183 case hnormCon env ran of
adamc@628 3184 (L'.CApp (tf, arg), _) =>
adamc@628 3185 (case (hnormCon env tf, hnormCon env arg) of
adamc@628 3186 ((L'.CModProj (basis, [], "transaction"), _),
adamc@628 3187 (L'.CApp (tf, arg3), _)) =>
adamc@325 3188 (case (basis = !basis_r,
adamc@628 3189 hnormCon env tf, hnormCon env arg3) of
adamc@325 3190 (true,
adamc@628 3191 (L'.CApp (tf, arg2), _),
adamc@628 3192 ((L'.CRecord (_, []), _))) =>
adamc@628 3193 (case (hnormCon env tf) of
adamc@628 3194 (L'.CApp (tf, arg1), _) =>
adamc@628 3195 (case (hnormCon env tf,
adamc@628 3196 hnormCon env arg1,
adamc@628 3197 hnormCon env arg2) of
adamc@628 3198 (tf, arg1,
adamc@628 3199 (L'.CRecord (_, []), _)) =>
adamc@325 3200 let
adamc@325 3201 val t = (L'.CApp (tf, arg1), loc)
adamc@325 3202 val t = (L'.CApp (t, arg2), loc)
adamc@325 3203 val t = (L'.CApp (t, arg3), loc)
adamc@325 3204 val t = (L'.CApp (
adamc@325 3205 (L'.CModProj
adamc@325 3206 (basis, [], "transaction"), loc),
adamc@325 3207 t), loc)
adamc@325 3208 in
adamc@325 3209 (L'.SgiVal (x, n, makeRes t), loc)
adamc@325 3210 end
adamc@325 3211 | _ => all)
adamc@325 3212 | _ => all)
adamc@325 3213 | _ => all)
adamc@325 3214 | _ => all)
adamc@325 3215 | _ => all
adamc@325 3216 in
adamc@628 3217 case hnormCon env t of
adamc@628 3218 (L'.TFun (dom, ran), _) =>
adamc@628 3219 (case hnormCon env dom of
adamc@628 3220 (L'.TRecord domR, _) =>
adamc@325 3221 doPage (fn t => (L'.TFun ((L'.TRecord domR,
adamc@325 3222 loc),
adamc@325 3223 t), loc), ran)
adamc@325 3224 | _ => all)
adamc@325 3225 | _ => doPage (fn t => t, t)
adamc@325 3226 end
adamc@255 3227 | _ => all,
adamc@255 3228 E.sgiBinds env all)
adamc@255 3229 in
adamc@255 3230 (L'.SgnConst (#1 (ListUtil.foldlMap doOne env sgis)), loc)
adamc@255 3231 end
adamc@255 3232 | _ => sgn
adamc@255 3233 in
adamc@255 3234 ([(L'.DExport (E.newNamed (), sgn, str'), loc)], (env, denv, gs' @ gs))
adamc@255 3235 end
adamc@255 3236
adamc@255 3237 | L.DTable (x, c) =>
adamc@255 3238 let
adamc@255 3239 val (c', k, gs') = elabCon (env, denv) c
adamc@255 3240 val (env, n) = E.pushENamed env x (L'.CApp (tableOf (), c'), loc)
adamc@255 3241 in
adamc@255 3242 checkKind env c' k (L'.KRecord (L'.KType, loc), loc);
adamc@255 3243 ([(L'.DTable (!basis_r, x, n, c'), loc)], (env, denv, enD gs' @ gs))
adamc@255 3244 end
adamc@338 3245 | L.DSequence x =>
adamc@338 3246 let
adamc@338 3247 val (env, n) = E.pushENamed env x (sequenceOf ())
adamc@338 3248 in
adamc@338 3249 ([(L'.DSequence (!basis_r, x, n), loc)], (env, denv, gs))
adamc@338 3250 end
adamc@255 3251
adamc@563 3252 | L.DClass (x, k, c) =>
adamc@255 3253 let
adamc@623 3254 val k = elabKind env k
adamc@563 3255 val k' = (L'.KArrow (k, (L'.KType, loc)), loc)
adamc@280 3256 val (c', ck, gs') = elabCon (env, denv) c
adamc@563 3257 val (env, n) = E.pushCNamed env x k' (SOME c')
adamc@255 3258 val env = E.pushClass env n
adamc@255 3259 in
adamc@563 3260 checkKind env c' ck k';
adamc@563 3261 ([(L'.DClass (x, n, k, c'), loc)], (env, denv, enD gs' @ gs))
adamc@255 3262 end
adamc@271 3263
adamc@280 3264 | L.DDatabase s => ([(L'.DDatabase s, loc)], (env, denv, gs))
adamc@280 3265
adamc@459 3266 | L.DCookie (x, c) =>
adamc@459 3267 let
adamc@459 3268 val (c', k, gs') = elabCon (env, denv) c
adamc@459 3269 val (env, n) = E.pushENamed env x (L'.CApp (cookieOf (), c'), loc)
adamc@459 3270 in
adamc@459 3271 checkKind env c' k (L'.KType, loc);
adamc@459 3272 ([(L'.DCookie (!basis_r, x, n, c'), loc)], (env, denv, enD gs' @ gs))
adamc@459 3273 end
adamc@459 3274
adamc@280 3275 (*val tcs = List.filter (fn TypeClass _ => true | _ => false) (#3 (#2 r))*)
adamc@255 3276 in
adamc@280 3277 (*prefaces "elabDecl" [("e", SourcePrint.p_decl dAll),
adamc@514 3278 ("t", PD.string (LargeReal.toString (Time.toReal
adamc@514 3279 (Time.- (Time.now (), befor)))))];*)
adamc@280 3280
adamc@255 3281 r
adamc@255 3282 end
adamc@211 3283
adamc@83 3284 and elabStr (env, denv) (str, loc) =
adamc@31 3285 case str of
adamc@31 3286 L.StrConst ds =>
adamc@31 3287 let
adamc@88 3288 val (ds', (_, _, gs)) = ListUtil.foldlMapConcat elabDecl (env, denv, []) ds
adamc@123 3289 val sgis = ListUtil.mapConcat sgiOfDecl ds'
adamc@63 3290
adamc@63 3291 val (sgis, _, _, _, _) =
adamc@64 3292 foldr (fn ((sgi, loc), (sgis, cons, vals, sgns, strs)) =>
adamc@63 3293 case sgi of
adamc@64 3294 L'.SgiConAbs (x, n, k) =>
adamc@64 3295 let
adamc@64 3296 val (cons, x) =
adamc@64 3297 if SS.member (cons, x) then
adamc@64 3298 (cons, "?" ^ x)
adamc@64 3299 else
adamc@64 3300 (SS.add (cons, x), x)
adamc@64 3301 in
adamc@64 3302 ((L'.SgiConAbs (x, n, k), loc) :: sgis, cons, vals, sgns, strs)
adamc@64 3303 end
adamc@64 3304 | L'.SgiCon (x, n, k, c) =>
adamc@64 3305 let
adamc@64 3306 val (cons, x) =
adamc@64 3307 if SS.member (cons, x) then
adamc@64 3308 (cons, "?" ^ x)
adamc@64 3309 else
adamc@64 3310 (SS.add (cons, x), x)
adamc@64 3311 in
adamc@64 3312 ((L'.SgiCon (x, n, k, c), loc) :: sgis, cons, vals, sgns, strs)
adamc@64 3313 end
adamc@191 3314 | L'.SgiDatatype (x, n, xs, xncs) =>
adamc@156 3315 let
adamc@156 3316 val (cons, x) =
adamc@156 3317 if SS.member (cons, x) then
adamc@156 3318 (cons, "?" ^ x)
adamc@156 3319 else
adamc@156 3320 (SS.add (cons, x), x)
adamc@156 3321
adamc@156 3322 val (xncs, vals) =
adamc@156 3323 ListUtil.foldlMap
adamc@156 3324 (fn ((x, n, t), vals) =>
adamc@156 3325 if SS.member (vals, x) then
adamc@156 3326 (("?" ^ x, n, t), vals)
adamc@156 3327 else
adamc@156 3328 ((x, n, t), SS.add (vals, x)))
adamc@156 3329 vals xncs
adamc@156 3330 in
adamc@191 3331 ((L'.SgiDatatype (x, n, xs, xncs), loc) :: sgis, cons, vals, sgns, strs)
adamc@156 3332 end
adamc@191 3333 | L'.SgiDatatypeImp (x, n, m1, ms, x', xs, xncs) =>
adamc@156 3334 let
adamc@156 3335 val (cons, x) =
adamc@156 3336 if SS.member (cons, x) then
adamc@156 3337 (cons, "?" ^ x)
adamc@156 3338 else
adamc@156 3339 (SS.add (cons, x), x)
adamc@156 3340 in
adamc@191 3341 ((L'.SgiDatatypeImp (x, n, m1, ms, x', xs, xncs), loc) :: sgis, cons, vals, sgns, strs)
adamc@156 3342 end
adamc@64 3343 | L'.SgiVal (x, n, c) =>
adamc@64 3344 let
adamc@64 3345 val (vals, x) =
adamc@64 3346 if SS.member (vals, x) then
adamc@64 3347 (vals, "?" ^ x)
adamc@64 3348 else
adamc@64 3349 (SS.add (vals, x), x)
adamc@64 3350 in
adamc@64 3351 ((L'.SgiVal (x, n, c), loc) :: sgis, cons, vals, sgns, strs)
adamc@64 3352 end
adamc@64 3353 | L'.SgiSgn (x, n, sgn) =>
adamc@64 3354 let
adamc@64 3355 val (sgns, x) =
adamc@64 3356 if SS.member (sgns, x) then
adamc@64 3357 (sgns, "?" ^ x)
adamc@64 3358 else
adamc@64 3359 (SS.add (sgns, x), x)
adamc@64 3360 in
adamc@64 3361 ((L'.SgiSgn (x, n, sgn), loc) :: sgis, cons, vals, sgns, strs)
adamc@64 3362 end
adamc@64 3363
adamc@64 3364 | L'.SgiStr (x, n, sgn) =>
adamc@64 3365 let
adamc@64 3366 val (strs, x) =
adamc@64 3367 if SS.member (strs, x) then
adamc@64 3368 (strs, "?" ^ x)
adamc@64 3369 else
adamc@64 3370 (SS.add (strs, x), x)
adamc@64 3371 in
adamc@64 3372 ((L'.SgiStr (x, n, sgn), loc) :: sgis, cons, vals, sgns, strs)
adamc@88 3373 end
adamc@203 3374 | L'.SgiConstraint _ => ((sgi, loc) :: sgis, cons, vals, sgns, strs)
adamc@563 3375 | L'.SgiClassAbs (x, n, k) =>
adamc@211 3376 let
adamc@211 3377 val (cons, x) =
adamc@211 3378 if SS.member (cons, x) then
adamc@211 3379 (cons, "?" ^ x)
adamc@211 3380 else
adamc@211 3381 (SS.add (cons, x), x)
adamc@211 3382 in
adamc@563 3383 ((L'.SgiClassAbs (x, n, k), loc) :: sgis, cons, vals, sgns, strs)
adamc@211 3384 end
adamc@563 3385 | L'.SgiClass (x, n, k, c) =>
adamc@211 3386 let
adamc@211 3387 val (cons, x) =
adamc@211 3388 if SS.member (cons, x) then
adamc@211 3389 (cons, "?" ^ x)
adamc@211 3390 else
adamc@211 3391 (SS.add (cons, x), x)
adamc@211 3392 in
adamc@563 3393 ((L'.SgiClass (x, n, k, c), loc) :: sgis, cons, vals, sgns, strs)
adamc@203 3394 end)
adamc@64 3395
adamc@63 3396 ([], SS.empty, SS.empty, SS.empty, SS.empty) sgis
adamc@31 3397 in
adamc@83 3398 ((L'.StrConst ds', loc), (L'.SgnConst sgis, loc), gs)
adamc@31 3399 end
adamc@31 3400 | L.StrVar x =>
adamc@31 3401 (case E.lookupStr env x of
adamc@31 3402 NONE =>
adamc@31 3403 (strError env (UnboundStr (loc, x));
adamc@83 3404 (strerror, sgnerror, []))
adamc@83 3405 | SOME (n, sgn) => ((L'.StrVar n, loc), sgn, []))
adamc@34 3406 | L.StrProj (str, x) =>
adamc@34 3407 let
adamc@83 3408 val (str', sgn, gs) = elabStr (env, denv) str
adamc@34 3409 in
adamc@34 3410 case E.projectStr env {str = str', sgn = sgn, field = x} of
adamc@34 3411 NONE => (strError env (UnboundStr (loc, x));
adamc@83 3412 (strerror, sgnerror, []))
adamc@83 3413 | SOME sgn => ((L'.StrProj (str', x), loc), sgn, gs)
adamc@34 3414 end
adamc@41 3415 | L.StrFun (m, dom, ranO, str) =>
adamc@41 3416 let
adamc@83 3417 val (dom', gs1) = elabSgn (env, denv) dom
adamc@41 3418 val (env', n) = E.pushStrNamed env m dom'
adamc@83 3419 val (str', actual, gs2) = elabStr (env', denv) str
adamc@41 3420
adamc@83 3421 val (formal, gs3) =
adamc@41 3422 case ranO of
adamc@83 3423 NONE => (actual, [])
adamc@41 3424 | SOME ran =>
adamc@41 3425 let
adamc@83 3426 val (ran', gs) = elabSgn (env', denv) ran
adamc@41 3427 in
adamc@628 3428 subSgn env' actual ran';
adamc@83 3429 (ran', gs)
adamc@41 3430 end
adamc@41 3431 in
adamc@41 3432 ((L'.StrFun (m, n, dom', formal, str'), loc),
adamc@83 3433 (L'.SgnFun (m, n, dom', formal), loc),
adamc@228 3434 enD gs1 @ gs2 @ enD gs3)
adamc@41 3435 end
adamc@44 3436 | L.StrApp (str1, str2) =>
adamc@44 3437 let
adamc@83 3438 val (str1', sgn1, gs1) = elabStr (env, denv) str1
adamc@325 3439 val str2 =
adamc@325 3440 case sgn1 of
adamc@325 3441 (L'.SgnFun (_, _, dom, _), _) =>
adamc@325 3442 wildifyStr env (str2, dom)
adamc@325 3443 | _ => str2
adamc@83 3444 val (str2', sgn2, gs2) = elabStr (env, denv) str2
adamc@44 3445 in
adamc@44 3446 case #1 (hnormSgn env sgn1) of
adamc@83 3447 L'.SgnError => (strerror, sgnerror, [])
adamc@44 3448 | L'.SgnFun (m, n, dom, ran) =>
adamc@628 3449 (subSgn env sgn2 dom;
adamc@44 3450 case #1 (hnormSgn env ran) of
adamc@83 3451 L'.SgnError => (strerror, sgnerror, [])
adamc@44 3452 | L'.SgnConst sgis =>
adamc@44 3453 ((L'.StrApp (str1', str2'), loc),
adamc@83 3454 (L'.SgnConst ((L'.SgiStr (m, n, selfifyAt env {str = str2', sgn = sgn2}), loc) :: sgis), loc),
adamc@83 3455 gs1 @ gs2)
adamc@44 3456 | _ => raise Fail "Unable to hnormSgn in functor application")
adamc@44 3457 | _ => (strError env (NotFunctor sgn1);
adamc@83 3458 (strerror, sgnerror, []))
adamc@44 3459 end
adamc@31 3460
adamc@325 3461 fun elabFile basis topStr topSgn env file =
adamc@56 3462 let
adamc@83 3463 val (sgn, gs) = elabSgn (env, D.empty) (L.SgnConst basis, ErrorMsg.dummySpan)
adamc@83 3464 val () = case gs of
adamc@83 3465 [] => ()
adamc@207 3466 | _ => (app (fn (_, env, _, c1, c2) =>
adamc@207 3467 prefaces "Unresolved"
adamc@207 3468 [("c1", p_con env c1),
adamc@207 3469 ("c2", p_con env c2)]) gs;
adamc@207 3470 raise Fail "Unresolved disjointness constraints in Basis")
adamc@83 3471
adamc@56 3472 val (env', basis_n) = E.pushStrNamed env "Basis" sgn
adamc@210 3473 val () = basis_r := basis_n
adamc@56 3474
adamc@628 3475 val (ds, env') = dopen env' {str = basis_n, strs = [], sgn = sgn}
adamc@56 3476
adamc@56 3477 fun discoverC r x =
adamc@56 3478 case E.lookupC env' x of
adamc@56 3479 E.NotBound => raise Fail ("Constructor " ^ x ^ " unbound in Basis")
adamc@56 3480 | E.Rel _ => raise Fail ("Constructor " ^ x ^ " bound relatively in Basis")
adamc@56 3481 | E.Named (n, (_, loc)) => r := (L'.CNamed n, loc)
adamc@56 3482
adamc@56 3483 val () = discoverC int "int"
adamc@56 3484 val () = discoverC float "float"
adamc@56 3485 val () = discoverC string "string"
adamc@203 3486 val () = discoverC table "sql_table"
adamc@56 3487
adamc@325 3488 val (topSgn, gs) = elabSgn (env', D.empty) (L.SgnConst topSgn, ErrorMsg.dummySpan)
adamc@325 3489 val () = case gs of
adamc@325 3490 [] => ()
adamc@325 3491 | _ => raise Fail "Unresolved disjointness constraints in top.urs"
adamc@325 3492 val (topStr, topSgn', gs) = elabStr (env', D.empty) (L.StrConst topStr, ErrorMsg.dummySpan)
adamc@325 3493 val () = case gs of
adamc@325 3494 [] => ()
adamc@329 3495 | _ => app (fn Disjoint (loc, env, denv, c1, c2) =>
adamc@329 3496 (case D.prove env denv (c1, c2, loc) of
adamc@329 3497 [] => ()
adamc@329 3498 | _ =>
adamc@329 3499 (prefaces "Unresolved constraint in top.ur"
adamc@329 3500 [("loc", PD.string (ErrorMsg.spanToString loc)),
adamc@329 3501 ("c1", p_con env c1),
adamc@329 3502 ("c2", p_con env c2)];
adamc@478 3503 raise Fail "Unresolved constraint in top.ur"))
adamc@564 3504 | TypeClass (env, c, r, loc) =>
adamc@564 3505 let
adamc@564 3506 val c = normClassKey env c
adamc@564 3507 in
adamc@564 3508 case E.resolveClass env c of
adamc@564 3509 SOME e => r := SOME e
adamc@564 3510 | NONE => expError env (Unresolvable (loc, c))
adamc@564 3511 end) gs
adamc@564 3512
adamc@628 3513 val () = subSgn env' topSgn' topSgn
adamc@325 3514
adamc@325 3515 val (env', top_n) = E.pushStrNamed env' "Top" topSgn
adamc@325 3516
adamc@628 3517 val (ds', env') = dopen env' {str = top_n, strs = [], sgn = topSgn}
adamc@325 3518
adamc@83 3519 fun elabDecl' (d, (env, gs)) =
adamc@76 3520 let
adamc@76 3521 val () = resetKunif ()
adamc@76 3522 val () = resetCunif ()
adamc@88 3523 val (ds, (env, _, gs)) = elabDecl (d, (env, D.empty, gs))
adamc@76 3524 in
adamc@76 3525 if ErrorMsg.anyErrors () then
adamc@76 3526 ()
adamc@76 3527 else (
adamc@76 3528 if List.exists kunifsInDecl ds then
adamc@91 3529 declError env (KunifsRemain ds)
adamc@76 3530 else
adamc@76 3531 ();
adamc@76 3532
adamc@76 3533 case ListUtil.search cunifsInDecl ds of
adamc@76 3534 NONE => ()
adamc@76 3535 | SOME loc =>
adamc@91 3536 declError env (CunifsRemain ds)
adamc@76 3537 );
adamc@76 3538
adamc@83 3539 (ds, (env, gs))
adamc@76 3540 end
adamc@76 3541
adamc@83 3542 val (file, (_, gs)) = ListUtil.foldlMapConcat elabDecl' (env', []) file
adamc@56 3543 in
adamc@84 3544 if ErrorMsg.anyErrors () then
adamc@84 3545 ()
adamc@84 3546 else
adamc@228 3547 app (fn Disjoint (loc, env, denv, c1, c2) =>
adamc@228 3548 (case D.prove env denv (c1, c2, loc) of
adamc@228 3549 [] => ()
adamc@228 3550 | _ =>
adamc@228 3551 (ErrorMsg.errorAt loc "Couldn't prove field name disjointness";
adamc@228 3552 eprefaces' [("Con 1", p_con env c1),
adamc@228 3553 ("Con 2", p_con env c2),
adamc@228 3554 ("Hnormed 1", p_con env (ElabOps.hnormCon env c1)),
adamc@228 3555 ("Hnormed 2", p_con env (ElabOps.hnormCon env c2))]))
adamc@228 3556 | TypeClass (env, c, r, loc) =>
adamc@349 3557 let
adamc@467 3558 val c = normClassKey env c
adamc@349 3559 in
adamc@349 3560 case E.resolveClass env c of
adamc@349 3561 SOME e => r := SOME e
adamc@349 3562 | NONE => expError env (Unresolvable (loc, c))
adamc@349 3563 end) gs;
adamc@83 3564
adamc@325 3565 (L'.DFfiStr ("Basis", basis_n, sgn), ErrorMsg.dummySpan)
adamc@325 3566 :: ds
adamc@325 3567 @ (L'.DStr ("Top", top_n, topSgn, topStr), ErrorMsg.dummySpan)
adamc@325 3568 :: ds' @ file
adamc@56 3569 end
adamc@2 3570
adamc@2 3571 end