Mercurial > urweb

annotate src/elaborate.sml @ 1718:dd12d6d9e9a7

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