Mercurial > urweb

annotate src/elaborate.sml @ 2187:14c45a0b6362

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