Mercurial > urweb

annotate src/elaborate.sml @ 1264:79b2bcac6200

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