Mercurial > urweb

annotate src/elaborate.sml @ 1003:61c30f0742d7

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