Mercurial > urweb

annotate src/elaborate.sml @ 2048:4d64af730e35

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