Mercurial > urweb

annotate src/elaborate.sml @ 628:12b73f3c108e

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