Mercurial > urweb

annotate src/elaborate.sml @ 1741:d6e233db97c8

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