Mercurial > urweb

annotate src/elaborate.sml @ 696:79a49c509007

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