Mercurial > urweb

annotate src/elaborate.sml @ 1930:5a7ae5acdcea

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