Mercurial > urweb

annotate src/elaborate.sml @ 647:ae374df5ccbd

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Prose for ListEdit
author Adam Chlipala <adamc@hcoop.net>
date Tue, 10 Mar 2009 13:46:45 -0400
parents fb2a0e76dcef
children fab5998b840e
rev   line source
adamc@412 1 (* Copyright (c) 2008, 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
adamc@403 41 structure IM = IntBinaryMap
adamc@403 42
adamc@403 43 structure SK = struct
adamc@403 44 type ord_key = string
adamc@403 45 val compare = String.compare
adamc@403 46 end
adamc@403 47
adamc@403 48 structure SS = BinarySetFn(SK)
adamc@403 49 structure SM = BinaryMapFn(SK)
adamc@403 50
adamc@403 51 val basis_r = ref 0
adamc@633 52 val top_r = ref 0
adamc@403 53
adamc@403 54 fun elabExplicitness e =
adamc@403 55 case e of
adamc@403 56 L.Explicit => L'.Explicit
adamc@403 57 | L.Implicit => L'.Implicit
adamc@403 58
adamc@403 59 fun occursKind r =
adamc@403 60 U.Kind.exists (fn L'.KUnif (_, _, r') => r = r'
adamc@403 61 | _ => false)
adamc@403 62
adamc@403 63 exception KUnify' of kunify_error
adamc@403 64
adamc@623 65 fun unifyKinds' env (k1All as (k1, _)) (k2All as (k2, _)) =
adamc@403 66 let
adamc@403 67 fun err f = raise KUnify' (f (k1All, k2All))
adamc@403 68 in
adamc@403 69 case (k1, k2) of
adamc@403 70 (L'.KType, L'.KType) => ()
adamc@403 71 | (L'.KUnit, L'.KUnit) => ()
adamc@403 72
adamc@403 73 | (L'.KArrow (d1, r1), L'.KArrow (d2, r2)) =>
adamc@623 74 (unifyKinds' env d1 d2;
adamc@623 75 unifyKinds' env r1 r2)
adamc@403 76 | (L'.KName, L'.KName) => ()
adamc@623 77 | (L'.KRecord k1, L'.KRecord k2) => unifyKinds' env k1 k2
adamc@403 78 | (L'.KTuple ks1, L'.KTuple ks2) =>
adamc@623 79 ((ListPair.appEq (fn (k1, k2) => unifyKinds' env k1 k2) (ks1, ks2))
adamc@403 80 handle ListPair.UnequalLengths => err KIncompatible)
adamc@403 81
adamc@623 82 | (L'.KRel n1, L'.KRel n2) =>
adamc@623 83 if n1 = n2 then
adamc@623 84 ()
adamc@623 85 else
adamc@623 86 err KIncompatible
adamc@623 87 | (L'.KFun (x, k1), L'.KFun (_, k2)) =>
adamc@623 88 unifyKinds' (E.pushKRel env x) k1 k2
adamc@623 89
adamc@403 90 | (L'.KError, _) => ()
adamc@403 91 | (_, L'.KError) => ()
adamc@403 92
adamc@623 93 | (L'.KUnif (_, _, ref (SOME k1All)), _) => unifyKinds' env k1All k2All
adamc@623 94 | (_, L'.KUnif (_, _, ref (SOME k2All))) => unifyKinds' env k1All k2All
adamc@403 95
adamc@403 96 | (L'.KUnif (_, _, r1), L'.KUnif (_, _, r2)) =>
adamc@403 97 if r1 = r2 then
adamc@403 98 ()
adamc@403 99 else
adamc@403 100 r1 := SOME k2All
adamc@403 101
adamc@403 102 | (L'.KUnif (_, _, r), _) =>
adamc@403 103 if occursKind r k2All then
adamc@403 104 err KOccursCheckFailed
adamc@403 105 else
adamc@403 106 r := SOME k2All
adamc@403 107 | (_, L'.KUnif (_, _, r)) =>
adamc@403 108 if occursKind r k1All then
adamc@403 109 err KOccursCheckFailed
adamc@403 110 else
adamc@403 111 r := SOME k1All
adamc@403 112
adamc@403 113 | _ => err KIncompatible
adamc@403 114 end
adamc@403 115
adamc@403 116 exception KUnify of L'.kind * L'.kind * kunify_error
adamc@403 117
adamc@623 118 fun unifyKinds env k1 k2 =
adamc@623 119 unifyKinds' env k1 k2
adamc@403 120 handle KUnify' err => raise KUnify (k1, k2, err)
adamc@403 121
adamc@403 122 fun checkKind env c k1 k2 =
adamc@623 123 unifyKinds env k1 k2
adamc@403 124 handle KUnify (k1, k2, err) =>
adamc@403 125 conError env (WrongKind (c, k1, k2, err))
adamc@403 126
adamc@403 127 val dummy = ErrorMsg.dummySpan
adamc@403 128
adamc@403 129 val ktype = (L'.KType, dummy)
adamc@403 130 val kname = (L'.KName, dummy)
adamc@403 131 val ktype_record = (L'.KRecord ktype, dummy)
adamc@403 132
adamc@403 133 val cerror = (L'.CError, dummy)
adamc@403 134 val kerror = (L'.KError, dummy)
adamc@403 135 val eerror = (L'.EError, dummy)
adamc@403 136 val sgnerror = (L'.SgnError, dummy)
adamc@403 137 val strerror = (L'.StrError, dummy)
adamc@403 138
adamc@403 139 val int = ref cerror
adamc@403 140 val float = ref cerror
adamc@403 141 val string = ref cerror
adamc@403 142 val table = ref cerror
adamc@403 143
adamc@403 144 local
adamc@403 145 val count = ref 0
adamc@403 146 in
adamc@403 147
adamc@403 148 fun resetKunif () = count := 0
adamc@403 149
adamc@403 150 fun kunif loc =
adamc@403 151 let
adamc@403 152 val n = !count
adamc@403 153 val s = if n <= 26 then
adamc@403 154 str (chr (ord #"A" + n))
adamc@403 155 else
adamc@403 156 "U" ^ Int.toString (n - 26)
adamc@403 157 in
adamc@403 158 count := n + 1;
adamc@403 159 (L'.KUnif (loc, s, ref NONE), dummy)
adamc@403 160 end
adamc@403 161
adamc@403 162 end
adamc@403 163
adamc@403 164 local
adamc@403 165 val count = ref 0
adamc@403 166 in
adamc@403 167
adamc@403 168 fun resetCunif () = count := 0
adamc@403 169
adamc@403 170 fun cunif (loc, k) =
adamc@403 171 let
adamc@403 172 val n = !count
adamc@403 173 val s = if n <= 26 then
adamc@403 174 str (chr (ord #"A" + n))
adamc@403 175 else
adamc@403 176 "U" ^ Int.toString (n - 26)
adamc@403 177 in
adamc@403 178 count := n + 1;
adamc@403 179 (L'.CUnif (loc, k, s, ref NONE), dummy)
adamc@403 180 end
adamc@403 181
adamc@403 182 end
adamc@403 183
adamc@623 184 fun elabKind env (k, loc) =
adamc@403 185 case k of
adamc@403 186 L.KType => (L'.KType, loc)
adamc@623 187 | L.KArrow (k1, k2) => (L'.KArrow (elabKind env k1, elabKind env k2), loc)
adamc@403 188 | L.KName => (L'.KName, loc)
adamc@623 189 | L.KRecord k => (L'.KRecord (elabKind env k), loc)
adamc@403 190 | L.KUnit => (L'.KUnit, loc)
adamc@623 191 | L.KTuple ks => (L'.KTuple (map (elabKind env) ks), loc)
adamc@403 192 | L.KWild => kunif loc
adamc@403 193
adamc@623 194 | L.KVar s => (case E.lookupK env s of
adamc@623 195 NONE =>
adamc@623 196 (kindError env (UnboundKind (loc, s));
adamc@623 197 kerror)
adamc@623 198 | SOME n => (L'.KRel n, loc))
adamc@623 199 | L.KFun (x, k) => (L'.KFun (x, elabKind (E.pushKRel env x) k), loc)
adamc@623 200
adamc@621 201 fun mapKind (dom, ran, loc)=
adamc@621 202 (L'.KArrow ((L'.KArrow (dom, ran), loc),
adamc@621 203 (L'.KArrow ((L'.KRecord dom, loc),
adamc@621 204 (L'.KRecord ran, loc)), loc)), loc)
adamc@403 205
adamc@403 206 fun hnormKind (kAll as (k, _)) =
adamc@403 207 case k of
adamc@403 208 L'.KUnif (_, _, ref (SOME k)) => hnormKind k
adamc@403 209 | _ => kAll
adamc@403 210
adamc@623 211 open ElabOps
adamc@623 212
adamc@623 213 fun elabConHead (c as (_, loc)) k =
adamc@623 214 let
adamc@623 215 fun unravel (k, c) =
adamc@623 216 case hnormKind k of
adamc@623 217 (L'.KFun (x, k'), _) =>
adamc@623 218 let
adamc@623 219 val u = kunif loc
adamc@623 220
adamc@623 221 val k'' = subKindInKind (0, u) k'
adamc@623 222 in
adamc@623 223 unravel (k'', (L'.CKApp (c, u), loc))
adamc@623 224 end
adamc@623 225 | _ => (c, k)
adamc@623 226 in
adamc@623 227 unravel (k, c)
adamc@623 228 end
adamc@623 229
adamc@403 230 fun elabCon (env, denv) (c, loc) =
adamc@403 231 case c of
adamc@403 232 L.CAnnot (c, k) =>
adamc@403 233 let
adamc@623 234 val k' = elabKind env k
adamc@403 235 val (c', ck, gs) = elabCon (env, denv) c
adamc@403 236 in
adamc@403 237 checkKind env c' ck k';
adamc@403 238 (c', k', gs)
adamc@403 239 end
adamc@403 240
adamc@403 241 | L.TFun (t1, t2) =>
adamc@403 242 let
adamc@403 243 val (t1', k1, gs1) = elabCon (env, denv) t1
adamc@403 244 val (t2', k2, gs2) = elabCon (env, denv) t2
adamc@403 245 in
adamc@403 246 checkKind env t1' k1 ktype;
adamc@403 247 checkKind env t2' k2 ktype;
adamc@403 248 ((L'.TFun (t1', t2'), loc), ktype, gs1 @ gs2)
adamc@403 249 end
adamc@403 250 | L.TCFun (e, x, k, t) =>
adamc@403 251 let
adamc@403 252 val e' = elabExplicitness e
adamc@623 253 val k' = elabKind env k
adamc@403 254 val env' = E.pushCRel env x k'
adamc@403 255 val (t', tk, gs) = elabCon (env', D.enter denv) t
adamc@403 256 in
adamc@403 257 checkKind env t' tk ktype;
adamc@403 258 ((L'.TCFun (e', x, k', t'), loc), ktype, gs)
adamc@403 259 end
adamc@623 260 | L.TKFun (x, t) =>
adamc@623 261 let
adamc@623 262 val env' = E.pushKRel env x
adamc@623 263 val (t', tk, gs) = elabCon (env', denv) t
adamc@623 264 in
adamc@623 265 checkKind env t' tk ktype;
adamc@623 266 ((L'.TKFun (x, t'), loc), ktype, gs)
adamc@623 267 end
adamc@628 268 | L.TDisjoint (c1, c2, c) =>
adamc@403 269 let
adamc@403 270 val (c1', k1, gs1) = elabCon (env, denv) c1
adamc@403 271 val (c2', k2, gs2) = elabCon (env, denv) c2
adamc@403 272
adamc@403 273 val ku1 = kunif loc
adamc@403 274 val ku2 = kunif loc
adamc@403 275
adamc@628 276 val denv' = D.assert env denv (c1', c2')
adamc@403 277 val (c', k, gs4) = elabCon (env, denv') c
adamc@403 278 in
adamc@403 279 checkKind env c1' k1 (L'.KRecord ku1, loc);
adamc@403 280 checkKind env c2' k2 (L'.KRecord ku2, loc);
adamc@403 281
adamc@628 282 ((L'.TDisjoint (c1', c2', c'), loc), k, gs1 @ gs2 @ gs4)
adamc@403 283 end
adamc@403 284 | L.TRecord c =>
adamc@403 285 let
adamc@403 286 val (c', ck, gs) = elabCon (env, denv) c
adamc@403 287 val k = (L'.KRecord ktype, loc)
adamc@403 288 in
adamc@403 289 checkKind env c' ck k;
adamc@403 290 ((L'.TRecord c', loc), ktype, gs)
adamc@403 291 end
adamc@403 292
adamc@403 293 | L.CVar ([], s) =>
adamc@403 294 (case E.lookupC env s of
adamc@403 295 E.NotBound =>
adamc@403 296 (conError env (UnboundCon (loc, s));
adamc@403 297 (cerror, kerror, []))
adamc@403 298 | E.Rel (n, k) =>
adamc@623 299 let
adamc@623 300 val (c, k) = elabConHead (L'.CRel n, loc) k
adamc@623 301 in
adamc@623 302 (c, k, [])
adamc@623 303 end
adamc@403 304 | E.Named (n, k) =>
adamc@623 305 let
adamc@623 306 val (c, k) = elabConHead (L'.CNamed n, loc) k
adamc@623 307 in
adamc@623 308 (c, k, [])
adamc@623 309 end)
adamc@403 310 | L.CVar (m1 :: ms, s) =>
adamc@403 311 (case E.lookupStr env m1 of
adamc@403 312 NONE => (conError env (UnboundStrInCon (loc, m1));
adamc@403 313 (cerror, kerror, []))
adamc@403 314 | SOME (n, sgn) =>
adamc@403 315 let
adamc@403 316 val (str, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@403 317 case E.projectStr env {sgn = sgn, str = str, field = m} of
adamc@403 318 NONE => (conError env (UnboundStrInCon (loc, m));
adamc@403 319 (strerror, sgnerror))
adamc@403 320 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@403 321 ((L'.StrVar n, loc), sgn) ms
adamc@403 322
adamc@403 323 val k = case E.projectCon env {sgn = sgn, str = str, field = s} of
adamc@403 324 NONE => (conError env (UnboundCon (loc, s));
adamc@403 325 kerror)
adamc@403 326 | SOME (k, _) => k
adamc@403 327 in
adamc@403 328 ((L'.CModProj (n, ms, s), loc), k, [])
adamc@403 329 end)
adamc@403 330
adamc@403 331 | L.CApp (c1, c2) =>
adamc@403 332 let
adamc@403 333 val (c1', k1, gs1) = elabCon (env, denv) c1
adamc@403 334 val (c2', k2, gs2) = elabCon (env, denv) c2
adamc@403 335 val dom = kunif loc
adamc@403 336 val ran = kunif loc
adamc@403 337 in
adamc@403 338 checkKind env c1' k1 (L'.KArrow (dom, ran), loc);
adamc@403 339 checkKind env c2' k2 dom;
adamc@403 340 ((L'.CApp (c1', c2'), loc), ran, gs1 @ gs2)
adamc@403 341 end
adamc@403 342 | L.CAbs (x, ko, t) =>
adamc@403 343 let
adamc@403 344 val k' = case ko of
adamc@403 345 NONE => kunif loc
adamc@623 346 | SOME k => elabKind env k
adamc@403 347 val env' = E.pushCRel env x k'
adamc@403 348 val (t', tk, gs) = elabCon (env', D.enter denv) t
adamc@403 349 in
adamc@403 350 ((L'.CAbs (x, k', t'), loc),
adamc@403 351 (L'.KArrow (k', tk), loc),
adamc@403 352 gs)
adamc@403 353 end
adamc@623 354 | L.CKAbs (x, t) =>
adamc@623 355 let
adamc@623 356 val env' = E.pushKRel env x
adamc@623 357 val (t', tk, gs) = elabCon (env', denv) t
adamc@623 358 in
adamc@623 359 ((L'.CKAbs (x, t'), loc),
adamc@623 360 (L'.KFun (x, tk), loc),
adamc@623 361 gs)
adamc@623 362 end
adamc@403 363
adamc@403 364 | L.CName s =>
adamc@403 365 ((L'.CName s, loc), kname, [])
adamc@403 366
adamc@403 367 | L.CRecord xcs =>
adamc@403 368 let
adamc@403 369 val k = kunif loc
adamc@403 370
adamc@403 371 val (xcs', gs) = ListUtil.foldlMap (fn ((x, c), gs) =>
adamc@403 372 let
adamc@403 373 val (x', xk, gs1) = elabCon (env, denv) x
adamc@403 374 val (c', ck, gs2) = elabCon (env, denv) c
adamc@403 375 in
adamc@403 376 checkKind env x' xk kname;
adamc@403 377 checkKind env c' ck k;
adamc@403 378 ((x', c'), gs1 @ gs2 @ gs)
adamc@403 379 end) [] xcs
adamc@403 380
adamc@403 381 val rc = (L'.CRecord (k, xcs'), loc)
adamc@403 382 (* Add duplicate field checking later. *)
adamc@403 383
adamc@403 384 fun prove (xcs, ds) =
adamc@403 385 case xcs of
adamc@403 386 [] => ds
adamc@403 387 | xc :: rest =>
adamc@403 388 let
adamc@403 389 val r1 = (L'.CRecord (k, [xc]), loc)
adamc@403 390 val ds = foldl (fn (xc', ds) =>
adamc@403 391 let
adamc@403 392 val r2 = (L'.CRecord (k, [xc']), loc)
adamc@403 393 in
adamc@403 394 D.prove env denv (r1, r2, loc) @ ds
adamc@403 395 end)
adamc@403 396 ds rest
adamc@403 397 in
adamc@403 398 prove (rest, ds)
adamc@403 399 end
adamc@403 400 in
adamc@403 401 (rc, (L'.KRecord k, loc), prove (xcs', gs))
adamc@403 402 end
adamc@403 403 | L.CConcat (c1, c2) =>
adamc@403 404 let
adamc@403 405 val (c1', k1, gs1) = elabCon (env, denv) c1
adamc@403 406 val (c2', k2, gs2) = elabCon (env, denv) c2
adamc@403 407 val ku = kunif loc
adamc@403 408 val k = (L'.KRecord ku, loc)
adamc@403 409 in
adamc@403 410 checkKind env c1' k1 k;
adamc@403 411 checkKind env c2' k2 k;
adamc@403 412 ((L'.CConcat (c1', c2'), loc), k,
adamc@403 413 D.prove env denv (c1', c2', loc) @ gs1 @ gs2)
adamc@403 414 end
adamc@621 415 | L.CMap =>
adamc@403 416 let
adamc@403 417 val dom = kunif loc
adamc@403 418 val ran = kunif loc
adamc@403 419 in
adamc@621 420 ((L'.CMap (dom, ran), loc),
adamc@621 421 mapKind (dom, ran, loc),
adamc@403 422 [])
adamc@403 423 end
adamc@403 424
adamc@403 425 | L.CUnit => ((L'.CUnit, loc), (L'.KUnit, loc), [])
adamc@403 426
adamc@403 427 | L.CTuple cs =>
adamc@403 428 let
adamc@403 429 val (cs', ks, gs) = foldl (fn (c, (cs', ks, gs)) =>
adamc@403 430 let
adamc@403 431 val (c', k, gs') = elabCon (env, denv) c
adamc@403 432 in
adamc@403 433 (c' :: cs', k :: ks, gs' @ gs)
adamc@403 434 end) ([], [], []) cs
adamc@403 435 in
adamc@403 436 ((L'.CTuple (rev cs'), loc), (L'.KTuple (rev ks), loc), gs)
adamc@403 437 end
adamc@403 438 | L.CProj (c, n) =>
adamc@403 439 let
adamc@403 440 val (c', k, gs) = elabCon (env, denv) c
adamc@403 441 in
adamc@403 442 case hnormKind k of
adamc@403 443 (L'.KTuple ks, _) =>
adamc@403 444 if n <= 0 orelse n > length ks then
adamc@403 445 (conError env (ProjBounds (c', n));
adamc@83 446 (cerror, kerror, []))
adamc@403 447 else
adamc@403 448 ((L'.CProj (c', n), loc), List.nth (ks, n - 1), gs)
adamc@403 449 | k => (conError env (ProjMismatch (c', k));
adamc@403 450 (cerror, kerror, []))
adamc@403 451 end
adamc@403 452
adamc@403 453 | L.CWild k =>
adamc@403 454 let
adamc@623 455 val k' = elabKind env k
adamc@403 456 in
adamc@403 457 (cunif (loc, k'), k', [])
adamc@403 458 end
adamc@403 459
adamc@403 460 fun kunifsRemain k =
adamc@403 461 case k of
adamc@403 462 L'.KUnif (_, _, ref NONE) => true
adamc@403 463 | _ => false
adamc@403 464 fun cunifsRemain c =
adamc@403 465 case c of
adamc@403 466 L'.CUnif (loc, _, _, ref NONE) => SOME loc
adamc@403 467 | _ => NONE
adamc@403 468
adamc@403 469 val kunifsInDecl = U.Decl.exists {kind = kunifsRemain,
adamc@403 470 con = fn _ => false,
adamc@403 471 exp = fn _ => false,
adamc@403 472 sgn_item = fn _ => false,
adamc@403 473 sgn = fn _ => false,
adamc@403 474 str = fn _ => false,
adamc@403 475 decl = fn _ => false}
adamc@403 476
adamc@403 477 val cunifsInDecl = U.Decl.search {kind = fn _ => NONE,
adamc@403 478 con = cunifsRemain,
adamc@403 479 exp = fn _ => NONE,
adamc@403 480 sgn_item = fn _ => NONE,
adamc@403 481 sgn = fn _ => NONE,
adamc@403 482 str = fn _ => NONE,
adamc@403 483 decl = fn _ => NONE}
adamc@403 484
adamc@403 485 fun occursCon r =
adamc@403 486 U.Con.exists {kind = fn _ => false,
adamc@403 487 con = fn L'.CUnif (_, _, _, r') => r = r'
adamc@403 488 | _ => false}
adamc@403 489
adamc@403 490 exception CUnify' of cunify_error
adamc@403 491
adamc@403 492 exception SynUnif = E.SynUnif
adamc@403 493
adamc@403 494 type record_summary = {
adamc@403 495 fields : (L'.con * L'.con) list,
adamc@403 496 unifs : (L'.con * L'.con option ref) list,
adamc@403 497 others : L'.con list
adamc@403 498 }
adamc@403 499
adamc@403 500 fun summaryToCon {fields, unifs, others} =
adamc@403 501 let
adamc@403 502 val c = (L'.CRecord (ktype, []), dummy)
adamc@403 503 val c = List.foldr (fn (c', c) => (L'.CConcat (c', c), dummy)) c others
adamc@403 504 val c = List.foldr (fn ((c', _), c) => (L'.CConcat (c', c), dummy)) c unifs
adamc@403 505 in
adamc@403 506 (L'.CConcat ((L'.CRecord (ktype, fields), dummy), c), dummy)
adamc@403 507 end
adamc@403 508
adamc@403 509 fun p_summary env s = p_con env (summaryToCon s)
adamc@403 510
adamc@403 511 exception CUnify of L'.con * L'.con * cunify_error
adamc@403 512
adamc@403 513 fun kindof env (c, loc) =
adamc@403 514 case c of
adamc@403 515 L'.TFun _ => ktype
adamc@403 516 | L'.TCFun _ => ktype
adamc@403 517 | L'.TRecord _ => ktype
adamc@628 518 | L'.TDisjoint _ => ktype
adamc@403 519
adamc@403 520 | L'.CRel xn => #2 (E.lookupCRel env xn)
adamc@403 521 | L'.CNamed xn => #2 (E.lookupCNamed env xn)
adamc@403 522 | L'.CModProj (n, ms, x) =>
adamc@403 523 let
adamc@403 524 val (_, sgn) = E.lookupStrNamed env n
adamc@403 525 val (str, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@403 526 case E.projectStr env {sgn = sgn, str = str, field = m} of
adamc@403 527 NONE => raise Fail "kindof: Unknown substructure"
adamc@403 528 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@403 529 ((L'.StrVar n, loc), sgn) ms
adamc@403 530 in
adamc@403 531 case E.projectCon env {sgn = sgn, str = str, field = x} of
adamc@403 532 NONE => raise Fail "kindof: Unknown con in structure"
adamc@403 533 | SOME (k, _) => k
adamc@403 534 end
adamc@403 535
adamc@403 536 | L'.CApp (c, _) =>
adamc@403 537 (case hnormKind (kindof env c) of
adamc@403 538 (L'.KArrow (_, k), _) => k
adamc@403 539 | (L'.KError, _) => kerror
adamc@413 540 | k => raise CUnify' (CKindof (k, c, "arrow")))
adamc@403 541 | L'.CAbs (x, k, c) => (L'.KArrow (k, kindof (E.pushCRel env x k) c), loc)
adamc@628 542
adamc@403 543
adamc@403 544 | L'.CName _ => kname
adamc@403 545
adamc@403 546 | L'.CRecord (k, _) => (L'.KRecord k, loc)
adamc@403 547 | L'.CConcat (c, _) => kindof env c
adamc@621 548 | L'.CMap (dom, ran) => mapKind (dom, ran, loc)
adamc@403 549
adamc@403 550 | L'.CUnit => (L'.KUnit, loc)
adamc@403 551
adamc@403 552 | L'.CTuple cs => (L'.KTuple (map (kindof env) cs), loc)
adamc@403 553 | L'.CProj (c, n) =>
adamc@403 554 (case hnormKind (kindof env c) of
adamc@403 555 (L'.KTuple ks, _) => List.nth (ks, n - 1)
adamc@413 556 | k => raise CUnify' (CKindof (k, c, "tuple")))
adamc@403 557
adamc@403 558 | L'.CError => kerror
adamc@403 559 | L'.CUnif (_, k, _, _) => k
adamc@403 560
adamc@623 561 | L'.CKAbs (x, c) => (L'.KFun (x, kindof (E.pushKRel env x) c), loc)
adamc@623 562 | L'.CKApp (c, k) =>
adamc@623 563 (case hnormKind (kindof env c) of
adamc@623 564 (L'.KFun (_, k'), _) => subKindInKind (0, k) k'
adamc@623 565 | k => raise CUnify' (CKindof (k, c, "kapp")))
adamc@623 566 | L'.TKFun _ => ktype
adamc@403 567
adamc@621 568 exception GuessFailure
adamc@403 569
adamc@513 570 fun isUnitCon env (c, loc) =
adamc@513 571 case c of
adamc@513 572 L'.TFun _ => false
adamc@513 573 | L'.TCFun _ => false
adamc@513 574 | L'.TRecord _ => false
adamc@628 575 | L'.TDisjoint _ => false
adamc@513 576
adamc@513 577 | L'.CRel xn => #1 (#2 (E.lookupCRel env xn)) = L'.KUnit
adamc@513 578 | L'.CNamed xn => #1 (#2 (E.lookupCNamed env xn)) = L'.KUnit
adamc@518 579 | L'.CModProj (n, ms, x) => false
adamc@518 580 (*let
adamc@513 581 val (_, sgn) = E.lookupStrNamed env n
adamc@513 582 val (str, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@513 583 case E.projectStr env {sgn = sgn, str = str, field = m} of
adamc@513 584 NONE => raise Fail "kindof: Unknown substructure"
adamc@513 585 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@513 586 ((L'.StrVar n, loc), sgn) ms
adamc@513 587 in
adamc@513 588 case E.projectCon env {sgn = sgn, str = str, field = x} of
adamc@513 589 NONE => raise Fail "kindof: Unknown con in structure"
adamc@513 590 | SOME ((k, _), _) => k = L'.KUnit
adamc@518 591 end*)
adamc@518 592
adamc@518 593 | L'.CApp (c, _) => false
adamc@518 594 (*(case hnormKind (kindof env c) of
adamc@513 595 (L'.KArrow (_, k), _) => #1 k = L'.KUnit
adamc@513 596 | (L'.KError, _) => false
adamc@518 597 | k => raise CUnify' (CKindof (k, c, "arrow")))*)
adamc@513 598 | L'.CAbs _ => false
adamc@513 599
adamc@513 600 | L'.CName _ => false
adamc@513 601
adamc@513 602 | L'.CRecord _ => false
adamc@513 603 | L'.CConcat _ => false
adamc@621 604 | L'.CMap _ => false
adamc@513 605
adamc@513 606 | L'.CUnit => true
adamc@513 607
adamc@513 608 | L'.CTuple _ => false
adamc@518 609 | L'.CProj (c, n) => false
adamc@518 610 (*(case hnormKind (kindof env c) of
adamc@513 611 (L'.KTuple ks, _) => #1 (List.nth (ks, n - 1)) = L'.KUnit
adamc@518 612 | k => raise CUnify' (CKindof (k, c, "tuple")))*)
adamc@513 613
adamc@513 614 | L'.CError => false
adamc@513 615 | L'.CUnif (_, k, _, _) => #1 k = L'.KUnit
adamc@513 616
adamc@623 617 | L'.CKAbs _ => false
adamc@623 618 | L'.CKApp _ => false
adamc@623 619 | L'.TKFun _ => false
adamc@623 620
adamc@628 621 fun unifyRecordCons env (c1, c2) =
adamc@403 622 let
adamc@403 623 fun rkindof c =
adamc@403 624 case hnormKind (kindof env c) of
adamc@403 625 (L'.KRecord k, _) => k
adamc@403 626 | (L'.KError, _) => kerror
adamc@413 627 | k => raise CUnify' (CKindof (k, c, "record"))
adamc@403 628
adamc@403 629 val k1 = rkindof c1
adamc@403 630 val k2 = rkindof c2
adamc@403 631
adamc@628 632 val r1 = recordSummary env c1
adamc@628 633 val r2 = recordSummary env c2
adamc@403 634 in
adamc@623 635 unifyKinds env k1 k2;
adamc@628 636 unifySummaries env (k1, r1, r2)
adamc@403 637 end
adamc@403 638
adamc@628 639 and recordSummary env c =
adamc@403 640 let
adamc@628 641 val c = hnormCon env c
adamc@628 642
adamc@628 643 val sum =
adamc@403 644 case c of
adamc@628 645 (L'.CRecord (_, xcs), _) => {fields = xcs, unifs = [], others = []}
adamc@403 646 | (L'.CConcat (c1, c2), _) =>
adamc@403 647 let
adamc@628 648 val s1 = recordSummary env c1
adamc@628 649 val s2 = recordSummary env c2
adamc@403 650 in
adamc@628 651 {fields = #fields s1 @ #fields s2,
adamc@628 652 unifs = #unifs s1 @ #unifs s2,
adamc@628 653 others = #others s1 @ #others s2}
adamc@403 654 end
adamc@628 655 | (L'.CUnif (_, _, _, ref (SOME c)), _) => recordSummary env c
adamc@628 656 | c' as (L'.CUnif (_, _, _, r), _) => {fields = [], unifs = [(c', r)], others = []}
adamc@628 657 | c' => {fields = [], unifs = [], others = [c']}
adamc@403 658 in
adamc@628 659 sum
adamc@403 660 end
adamc@403 661
adamc@628 662 and consEq env (c1, c2) =
adamc@628 663 (unifyCons env c1 c2;
adamc@628 664 true)
adamc@403 665 handle CUnify _ => false
adamc@403 666
adamc@403 667 and consNeq env (c1, c2) =
adamc@628 668 case (#1 (hnormCon env c1), #1 (hnormCon env c2)) of
adamc@403 669 (L'.CName x1, L'.CName x2) => x1 <> x2
adamc@403 670 | _ => false
adamc@403 671
adamc@628 672 and unifySummaries env (k, s1 : record_summary, s2 : record_summary) =
adamc@403 673 let
adamc@403 674 val loc = #2 k
adamc@403 675 (*val () = eprefaces "Summaries" [("#1", p_summary env s1),
adamc@403 676 ("#2", p_summary env s2)]*)
adamc@403 677
adamc@403 678 fun eatMatching p (ls1, ls2) =
adamc@403 679 let
adamc@403 680 fun em (ls1, ls2, passed1) =
adamc@403 681 case ls1 of
adamc@403 682 [] => (rev passed1, ls2)
adamc@403 683 | h1 :: t1 =>
adamc@403 684 let
adamc@403 685 fun search (ls2', passed2) =
adamc@403 686 case ls2' of
adamc@403 687 [] => em (t1, ls2, h1 :: passed1)
adamc@403 688 | h2 :: t2 =>
adamc@403 689 if p (h1, h2) then
adamc@403 690 em (t1, List.revAppend (passed2, t2), passed1)
adamc@403 691 else
adamc@403 692 search (t2, h2 :: passed2)
adamc@403 693 in
adamc@403 694 search (ls2, [])
adamc@403 695 end
adamc@403 696 in
adamc@403 697 em (ls1, ls2, [])
adamc@403 698 end
adamc@403 699
adamc@403 700 val (fs1, fs2) = eatMatching (fn ((x1, c1), (x2, c2)) =>
adamc@403 701 not (consNeq env (x1, x2))
adamc@628 702 andalso consEq env (c1, c2)
adamc@628 703 andalso consEq env (x1, x2))
adamc@403 704 (#fields s1, #fields s2)
adamc@403 705 (*val () = eprefaces "Summaries2" [("#1", p_summary env {fields = fs1, unifs = #unifs s1, others = #others s1}),
adamc@403 706 ("#2", p_summary env {fields = fs2, unifs = #unifs s2, others = #others s2})]*)
adamc@646 707
adamc@403 708 val (unifs1, unifs2) = eatMatching (fn ((_, r1), (_, r2)) => r1 = r2) (#unifs s1, #unifs s2)
adamc@646 709
adamc@628 710 val (others1, others2) = eatMatching (consEq env) (#others s1, #others s2)
adamc@403 711 (*val () = eprefaces "Summaries3" [("#1", p_summary env {fields = fs1, unifs = unifs1, others = others1}),
adamc@403 712 ("#2", p_summary env {fields = fs2, unifs = unifs2, others = others2})]*)
adamc@403 713
adamc@403 714 fun unifFields (fs, others, unifs) =
adamc@403 715 case (fs, others, unifs) of
adamc@403 716 ([], [], _) => ([], [], unifs)
adamc@403 717 | (_, _, []) => (fs, others, [])
adamc@403 718 | (_, _, (_, r) :: rest) =>
adamc@403 719 let
adamc@403 720 val r' = ref NONE
adamc@403 721 val kr = (L'.KRecord k, dummy)
adamc@403 722 val cr' = (L'.CUnif (dummy, kr, "recd", r'), dummy)
adamc@403 723
adamc@403 724 val prefix = case (fs, others) of
adamc@403 725 ([], other :: others) =>
adamc@403 726 List.foldl (fn (other, c) =>
adamc@403 727 (L'.CConcat (c, other), dummy))
adamc@403 728 other others
adamc@403 729 | (fs, []) =>
adamc@403 730 (L'.CRecord (k, fs), dummy)
adamc@403 731 | (fs, others) =>
adamc@403 732 List.foldl (fn (other, c) =>
adamc@403 733 (L'.CConcat (c, other), dummy))
adamc@403 734 (L'.CRecord (k, fs), dummy) others
adamc@403 735 in
adamc@403 736 r := SOME (L'.CConcat (prefix, cr'), dummy);
adamc@403 737 ([], [], (cr', r') :: rest)
adamc@403 738 end
adamc@403 739
adamc@403 740 val (fs1, others1, unifs2) = unifFields (fs1, others1, unifs2)
adamc@403 741 val (fs2, others2, unifs1) = unifFields (fs2, others2, unifs1)
adamc@403 742
adamc@403 743 (*val () = eprefaces "Summaries4" [("#1", p_summary env {fields = fs1, unifs = unifs1, others = others1}),
adamc@403 744 ("#2", p_summary env {fields = fs2, unifs = unifs2, others = others2})]*)
adamc@403 745
adamc@403 746 fun isGuessable (other, fs) =
adamc@628 747 (guessMap env (other, (L'.CRecord (k, fs), loc), GuessFailure);
adamc@628 748 true)
adamc@621 749 handle GuessFailure => false
adamc@403 750
adamc@403 751 val (fs1, fs2, others1, others2) =
adamc@403 752 case (fs1, fs2, others1, others2) of
adamc@403 753 ([], _, [other1], []) =>
adamc@403 754 if isGuessable (other1, fs2) then
adamc@403 755 ([], [], [], [])
adamc@403 756 else
adamc@403 757 (fs1, fs2, others1, others2)
adamc@403 758 | (_, [], [], [other2]) =>
adamc@403 759 if isGuessable (other2, fs1) then
adamc@403 760 ([], [], [], [])
adamc@403 761 else
adamc@403 762 (fs1, fs2, others1, others2)
adamc@403 763 | _ => (fs1, fs2, others1, others2)
adamc@403 764
adamc@403 765 (*val () = eprefaces "Summaries5" [("#1", p_summary env {fields = fs1, unifs = unifs1, others = others1}),
adamc@646 766 ("#2", p_summary env {fields = fs2, unifs = unifs2, others = others2})]*)
adamc@403 767
adamc@403 768 val clear = case (fs1, others1, fs2, others2) of
adamc@403 769 ([], [], [], []) => true
adamc@403 770 | _ => false
adamc@403 771 val empty = (L'.CRecord (k, []), dummy)
adamc@403 772
adamc@403 773 fun unsummarize {fields, unifs, others} =
adamc@403 774 let
adamc@403 775 val c = (L'.CRecord (k, fields), loc)
adamc@403 776
adamc@403 777 val c = foldl (fn ((c1, _), c2) => (L'.CConcat (c1, c2), loc))
adamc@403 778 c unifs
adamc@403 779 in
adamc@403 780 foldl (fn (c1, c2) => (L'.CConcat (c1, c2), loc))
adamc@403 781 c others
adamc@403 782 end
adamc@403 783
adamc@403 784 fun pairOffUnifs (unifs1, unifs2) =
adamc@403 785 case (unifs1, unifs2) of
adamc@403 786 ([], _) =>
adamc@403 787 if clear then
adamc@403 788 List.app (fn (_, r) => r := SOME empty) unifs2
adamc@403 789 else
adamc@403 790 raise CUnify' (CRecordFailure (unsummarize s1, unsummarize s2))
adamc@403 791 | (_, []) =>
adamc@403 792 if clear then
adamc@403 793 List.app (fn (_, r) => r := SOME empty) unifs1
adamc@403 794 else
adamc@403 795 raise CUnify' (CRecordFailure (unsummarize s1, unsummarize s2))
adamc@403 796 | ((c1, _) :: rest1, (_, r2) :: rest2) =>
adamc@403 797 (r2 := SOME c1;
adamc@403 798 pairOffUnifs (rest1, rest2))
adamc@403 799 in
adamc@403 800 pairOffUnifs (unifs1, unifs2)
adamc@403 801 (*before eprefaces "Summaries'" [("#1", p_summary env s1),
adamc@403 802 ("#2", p_summary env s2)]*)
adamc@403 803 end
adamc@403 804
adamc@628 805 and guessMap env (c1, c2, ex) =
adamc@403 806 let
adamc@403 807 val loc = #2 c1
adamc@403 808
adamc@621 809 fun unfold (dom, ran, f, r, c) =
adamc@403 810 let
adamc@621 811 fun unfold (r, c) =
adamc@628 812 case #1 c of
adamc@628 813 L'.CRecord (_, []) => unifyCons env r (L'.CRecord (dom, []), loc)
adamc@628 814 | L'.CRecord (_, [(x, v)]) =>
adamc@628 815 let
adamc@628 816 val v' = case dom of
adamc@628 817 (L'.KUnit, _) => (L'.CUnit, loc)
adamc@628 818 | _ => cunif (loc, dom)
adamc@628 819 in
adamc@628 820 unifyCons env v (L'.CApp (f, v'), loc);
adamc@628 821 unifyCons env r (L'.CRecord (dom, [(x, v')]), loc)
adamc@628 822 end
adamc@628 823 | L'.CRecord (_, (x, v) :: rest) =>
adamc@628 824 let
adamc@628 825 val r1 = cunif (loc, (L'.KRecord dom, loc))
adamc@628 826 val r2 = cunif (loc, (L'.KRecord dom, loc))
adamc@628 827 in
adamc@628 828 unfold (r1, (L'.CRecord (ran, [(x, v)]), loc));
adamc@628 829 unfold (r2, (L'.CRecord (ran, rest), loc));
adamc@628 830 unifyCons env r (L'.CConcat (r1, r2), loc)
adamc@628 831 end
adamc@628 832 | L'.CConcat (c1', c2') =>
adamc@628 833 let
adamc@628 834 val r1 = cunif (loc, (L'.KRecord dom, loc))
adamc@628 835 val r2 = cunif (loc, (L'.KRecord dom, loc))
adamc@628 836 in
adamc@628 837 unfold (r1, c1');
adamc@628 838 unfold (r2, c2');
adamc@628 839 unifyCons env r (L'.CConcat (r1, r2), loc)
adamc@628 840 end
adamc@628 841 | _ => raise ex
adamc@403 842 in
adamc@621 843 unfold (r, c)
adamc@403 844 end
adamc@632 845 handle _ => raise ex
adamc@403 846 in
adamc@403 847 case (#1 c1, #1 c2) of
adamc@621 848 (L'.CApp ((L'.CApp ((L'.CMap (dom, ran), _), f), _), r), _) =>
adamc@621 849 unfold (dom, ran, f, r, c2)
adamc@621 850 | (_, L'.CApp ((L'.CApp ((L'.CMap (dom, ran), _), f), _), r)) =>
adamc@621 851 unfold (dom, ran, f, r, c1)
adamc@403 852 | _ => raise ex
adamc@403 853 end
adamc@403 854
adamc@628 855 and unifyCons' env c1 c2 =
adamc@628 856 if isUnitCon env c1 andalso isUnitCon env c2 then
adamc@628 857 ()
adamc@628 858 else
adamc@403 859 let
adamc@628 860 (*val befor = Time.now ()
adamc@628 861 val old1 = c1
adamc@628 862 val old2 = c2*)
adamc@628 863 val c1 = hnormCon env c1
adamc@628 864 val c2 = hnormCon env c2
adamc@403 865 in
adamc@628 866 unifyCons'' env c1 c2
adamc@628 867 handle ex => guessMap env (c1, c2, ex)
adamc@403 868 end
adamc@628 869
adamc@628 870 and unifyCons'' env (c1All as (c1, loc)) (c2All as (c2, _)) =
adamc@403 871 let
adamc@403 872 fun err f = raise CUnify' (f (c1All, c2All))
adamc@403 873
adamc@628 874 fun isRecord () = unifyRecordCons env (c1All, c2All)
adamc@403 875 in
adamc@403 876 (*eprefaces "unifyCons''" [("c1All", p_con env c1All),
adamc@403 877 ("c2All", p_con env c2All)];*)
adamc@403 878
adamc@403 879 case (c1, c2) of
adamc@632 880 (L'.CError, _) => ()
adamc@632 881 | (_, L'.CError) => ()
adamc@632 882
adamc@647 883 | (L'.CRecord _, _) => isRecord ()
adamc@647 884 | (_, L'.CRecord _) => isRecord ()
adamc@647 885 | (L'.CConcat _, _) => isRecord ()
adamc@647 886 | (_, L'.CConcat _) => isRecord ()
adamc@647 887
adamc@632 888 | (L'.CUnif (_, k1, _, r1), L'.CUnif (_, k2, _, r2)) =>
adamc@632 889 if r1 = r2 then
adamc@632 890 ()
adamc@632 891 else
adamc@632 892 (unifyKinds env k1 k2;
adamc@632 893 r1 := SOME c2All)
adamc@632 894
adamc@632 895 | (L'.CUnif (_, _, _, r), _) =>
adamc@632 896 if occursCon r c2All then
adamc@632 897 err COccursCheckFailed
adamc@632 898 else
adamc@632 899 r := SOME c2All
adamc@632 900 | (_, L'.CUnif (_, _, _, r)) =>
adamc@632 901 if occursCon r c1All then
adamc@632 902 err COccursCheckFailed
adamc@632 903 else
adamc@632 904 r := SOME c1All
adamc@632 905
adamc@632 906 | (L'.CUnit, L'.CUnit) => ()
adamc@403 907
adamc@403 908 | (L'.TFun (d1, r1), L'.TFun (d2, r2)) =>
adamc@628 909 (unifyCons' env d1 d2;
adamc@628 910 unifyCons' env r1 r2)
adamc@403 911 | (L'.TCFun (expl1, x1, d1, r1), L'.TCFun (expl2, _, d2, r2)) =>
adamc@403 912 if expl1 <> expl2 then
adamc@403 913 err CExplicitness
adamc@403 914 else
adamc@623 915 (unifyKinds env d1 d2;
adamc@514 916 let
adamc@514 917 (*val befor = Time.now ()*)
adamc@514 918 val env' = E.pushCRel env x1 d1
adamc@514 919 in
adamc@514 920 (*TextIO.print ("E.pushCRel: "
adamc@514 921 ^ LargeReal.toString (Time.toReal (Time.- (Time.now (), befor)))
adamc@514 922 ^ "\n");*)
adamc@628 923 unifyCons' env' r1 r2
adamc@514 924 end)
adamc@628 925 | (L'.TRecord r1, L'.TRecord r2) => unifyCons' env r1 r2
adamc@628 926 | (L'.TDisjoint (c1, d1, e1), L'.TDisjoint (c2, d2, e2)) =>
adamc@628 927 (unifyCons' env c1 c2;
adamc@628 928 unifyCons' env d1 d2;
adamc@628 929 unifyCons' env e1 e2)
adamc@403 930
adamc@403 931 | (L'.CRel n1, L'.CRel n2) =>
adamc@403 932 if n1 = n2 then
adamc@628 933 ()
adamc@403 934 else
adamc@403 935 err CIncompatible
adamc@403 936 | (L'.CNamed n1, L'.CNamed n2) =>
adamc@403 937 if n1 = n2 then
adamc@628 938 ()
adamc@403 939 else
adamc@403 940 err CIncompatible
adamc@403 941
adamc@403 942 | (L'.CApp (d1, r1), L'.CApp (d2, r2)) =>
adamc@628 943 (unifyCons' env d1 d2;
adamc@628 944 unifyCons' env r1 r2)
adamc@403 945 | (L'.CAbs (x1, k1, c1), L'.CAbs (_, k2, c2)) =>
adamc@623 946 (unifyKinds env k1 k2;
adamc@628 947 unifyCons' (E.pushCRel env x1 k1) c1 c2)
adamc@403 948
adamc@403 949 | (L'.CName n1, L'.CName n2) =>
adamc@403 950 if n1 = n2 then
adamc@628 951 ()
adamc@403 952 else
adamc@403 953 err CIncompatible
adamc@403 954
adamc@403 955 | (L'.CModProj (n1, ms1, x1), L'.CModProj (n2, ms2, x2)) =>
adamc@403 956 if n1 = n2 andalso ms1 = ms2 andalso x1 = x2 then
adamc@628 957 ()
adamc@403 958 else
adamc@403 959 err CIncompatible
adamc@403 960
adamc@403 961 | (L'.CTuple cs1, L'.CTuple cs2) =>
adamc@628 962 ((ListPair.appEq (fn (c1, c2) => unifyCons' env c1 c2) (cs1, cs2))
adamc@403 963 handle ListPair.UnequalLengths => err CIncompatible)
adamc@403 964
adamc@632 965 | (L'.CProj (c1, n1), _) =>
adamc@403 966 let
adamc@632 967 fun trySnd () =
adamc@632 968 case #1 (hnormCon env c2All) of
adamc@632 969 L'.CProj (c2, n2) =>
adamc@632 970 let
adamc@632 971 fun tryNormal () =
adamc@632 972 if n1 = n2 then
adamc@632 973 unifyCons' env c1 c2
adamc@632 974 else
adamc@632 975 err CIncompatible
adamc@632 976 in
adamc@632 977 case #1 (hnormCon env c2) of
adamc@632 978 L'.CUnif (_, k, _, r) =>
adamc@632 979 (case #1 (hnormKind k) of
adamc@632 980 L'.KTuple ks =>
adamc@632 981 let
adamc@632 982 val loc = #2 c2
adamc@632 983 val us = map (fn k => cunif (loc, k)) ks
adamc@632 984 in
adamc@632 985 r := SOME (L'.CTuple us, loc);
adamc@632 986 unifyCons' env c1All (List.nth (us, n2 - 1))
adamc@632 987 end
adamc@632 988 | _ => tryNormal ())
adamc@632 989 | _ => tryNormal ()
adamc@632 990 end
adamc@632 991 | _ => err CIncompatible
adamc@403 992 in
adamc@632 993 case #1 (hnormCon env c1) of
adamc@632 994 L'.CUnif (_, k, _, r) =>
adamc@632 995 (case #1 (hnormKind k) of
adamc@632 996 L'.KTuple ks =>
adamc@632 997 let
adamc@632 998 val loc = #2 c1
adamc@632 999 val us = map (fn k => cunif (loc, k)) ks
adamc@632 1000 in
adamc@632 1001 r := SOME (L'.CTuple us, loc);
adamc@632 1002 unifyCons' env (List.nth (us, n1 - 1)) c2All
adamc@632 1003 end
adamc@632 1004 | _ => trySnd ())
adamc@632 1005 | _ => trySnd ()
adamc@403 1006 end
adamc@632 1007
adamc@632 1008 | (_, L'.CProj (c2, n2)) =>
adamc@632 1009 (case #1 (hnormCon env c2) of
adamc@632 1010 L'.CUnif (_, k, _, r) =>
adamc@632 1011 (case #1 (hnormKind k) of
adamc@632 1012 L'.KTuple ks =>
adamc@632 1013 let
adamc@632 1014 val loc = #2 c2
adamc@632 1015 val us = map (fn k => cunif (loc, k)) ks
adamc@632 1016 in
adamc@632 1017 r := SOME (L'.CTuple us, loc);
adamc@632 1018 unifyCons' env c1All (List.nth (us, n2 - 1))
adamc@632 1019 end
adamc@632 1020 | _ => err CIncompatible)
adamc@632 1021 | _ => err CIncompatible)
adamc@403 1022
adamc@623 1023 | (L'.CMap (dom1, ran1), L'.CMap (dom2, ran2)) =>
adamc@623 1024 (unifyKinds env dom1 dom2;
adamc@628 1025 unifyKinds env ran1 ran2)
adamc@623 1026
adamc@623 1027 | (L'.CKAbs (x, c1), L'.CKAbs (_, c2)) =>
adamc@628 1028 unifyCons' (E.pushKRel env x) c1 c2
adamc@623 1029 | (L'.CKApp (c1, k1), L'.CKApp (c2, k2)) =>
adamc@623 1030 (unifyKinds env k1 k2;
adamc@628 1031 unifyCons' env c1 c2)
adamc@623 1032 | (L'.TKFun (x, c1), L'.TKFun (_, c2)) =>
adamc@628 1033 unifyCons' (E.pushKRel env x) c1 c2
adamc@628 1034
adamc@403 1035 | _ => err CIncompatible
adamc@403 1036 end
adamc@403 1037
adamc@628 1038 and unifyCons env c1 c2 =
adamc@628 1039 unifyCons' env c1 c2
adamc@403 1040 handle CUnify' err => raise CUnify (c1, c2, err)
adamc@403 1041 | KUnify args => raise CUnify (c1, c2, CKind args)
adamc@403 1042
adamc@628 1043 fun checkCon env e c1 c2 =
adamc@628 1044 unifyCons env c1 c2
adamc@403 1045 handle CUnify (c1, c2, err) =>
adamc@628 1046 expError env (Unify (e, c1, c2, err))
adamc@628 1047
adamc@628 1048 fun checkPatCon env p c1 c2 =
adamc@628 1049 unifyCons env c1 c2
adamc@403 1050 handle CUnify (c1, c2, err) =>
adamc@628 1051 expError env (PatUnify (p, c1, c2, err))
adamc@71 1052
adamc@403 1053 fun primType env p =
adamc@403 1054 case p of
adamc@403 1055 P.Int _ => !int
adamc@403 1056 | P.Float _ => !float
adamc@403 1057 | P.String _ => !string
adamc@623 1058
adamc@403 1059 datatype constraint =
adamc@403 1060 Disjoint of D.goal
adamc@403 1061 | TypeClass of E.env * L'.con * L'.exp option ref * ErrorMsg.span
adamc@403 1062
adamc@403 1063 val enD = map Disjoint
adamc@403 1064
adamc@634 1065 fun isClassOrFolder env cl =
adamc@634 1066 E.isClass env cl
adamc@634 1067 orelse case hnormCon env cl of
adamc@634 1068 (L'.CKApp (cl, _), _) =>
adamc@634 1069 (case hnormCon env cl of
adamc@634 1070 (L'.CModProj (top_n, [], "folder"), _) => top_n = !top_r
adamc@634 1071 | _ => false)
adamc@634 1072 | _ => false
adamc@634 1073
adamc@629 1074 fun elabHead (env, denv) infer (e as (_, loc)) t =
adamc@403 1075 let
adamc@403 1076 fun unravel (t, e) =
adamc@628 1077 case hnormCon env t of
adamc@628 1078 (L'.TKFun (x, t'), _) =>
adamc@628 1079 let
adamc@628 1080 val u = kunif loc
adamc@628 1081
adamc@628 1082 val t'' = subKindInCon (0, u) t'
adamc@628 1083 in
adamc@628 1084 unravel (t'', (L'.EKApp (e, u), loc))
adamc@628 1085 end
adamc@628 1086 | (L'.TCFun (L'.Implicit, x, k, t'), _) =>
adamc@628 1087 let
adamc@628 1088 val u = cunif (loc, k)
adamc@628 1089
adamc@628 1090 val t'' = subConInCon (0, u) t'
adamc@628 1091 in
adamc@628 1092 unravel (t'', (L'.ECApp (e, u), loc))
adamc@628 1093 end
adamc@633 1094 | (L'.TFun (dom, ran), _) =>
adamc@628 1095 let
adamc@633 1096 fun default () = (e, t, [])
adamc@628 1097 in
adamc@633 1098 case #1 (hnormCon env dom) of
adamc@633 1099 L'.CApp (cl, x) =>
adamc@628 1100 let
adamc@633 1101 val cl = hnormCon env cl
adamc@628 1102 in
adamc@633 1103 if infer <> L.TypesOnly then
adamc@634 1104 if isClassOrFolder env cl then
adamc@633 1105 let
adamc@633 1106 val r = ref NONE
adamc@633 1107 val (e, t, gs) = unravel (ran, (L'.EApp (e, (L'.EUnif r, loc)), loc))
adamc@633 1108 in
adamc@633 1109 (e, t, TypeClass (env, dom, r, loc) :: gs)
adamc@633 1110 end
adamc@633 1111 else
adamc@634 1112 default ()
adamc@633 1113 else
adamc@633 1114 default ()
adamc@628 1115 end
adamc@633 1116 | _ => default ()
adamc@628 1117 end
adamc@629 1118 | (L'.TDisjoint (r1, r2, t'), loc) =>
adamc@629 1119 if infer <> L.TypesOnly then
adamc@629 1120 let
adamc@629 1121 val gs = D.prove env denv (r1, r2, loc)
adamc@629 1122 val (e, t, gs') = unravel (t', e)
adamc@629 1123 in
adamc@629 1124 (e, t, enD gs @ gs')
adamc@629 1125 end
adamc@629 1126 else
adamc@629 1127 (e, t, [])
adamc@628 1128 | t => (e, t, [])
adamc@15 1129 in
adamc@403 1130 case infer of
adamc@403 1131 L.DontInfer => (e, t, [])
adamc@403 1132 | _ => unravel (t, e)
adamc@15 1133 end
adamc@15 1134
adamc@628 1135 fun elabPat (pAll as (p, loc), (env, bound)) =
adamc@171 1136 let
adamc@171 1137 val perror = (L'.PWild, loc)
adamc@171 1138 val terror = (L'.CError, loc)
adamc@171 1139 val pterror = (perror, terror)
adamc@171 1140 val rerror = (pterror, (env, bound))
adamc@171 1141
adamc@191 1142 fun pcon (pc, po, xs, to, dn, dk) =
adamc@188 1143 case (po, to) of
adamc@188 1144 (NONE, SOME _) => (expError env (PatHasNoArg loc);
adamc@188 1145 rerror)
adamc@188 1146 | (SOME _, NONE) => (expError env (PatHasArg loc);
adamc@188 1147 rerror)
adamc@191 1148 | (NONE, NONE) =>
adamc@191 1149 let
adamc@191 1150 val k = (L'.KType, loc)
adamc@191 1151 val unifs = map (fn _ => cunif (loc, k)) xs
adamc@191 1152 val dn = foldl (fn (u, dn) => (L'.CApp (dn, u), loc)) dn unifs
adamc@191 1153 in
adamc@191 1154 (((L'.PCon (dk, pc, unifs, NONE), loc), dn),
adamc@191 1155 (env, bound))
adamc@191 1156 end
adamc@188 1157 | (SOME p, SOME t) =>
adamc@188 1158 let
adamc@628 1159 val ((p', pt), (env, bound)) = elabPat (p, (env, bound))
adamc@191 1160
adamc@191 1161 val k = (L'.KType, loc)
adamc@191 1162 val unifs = map (fn _ => cunif (loc, k)) xs
adamc@194 1163 val nxs = length unifs - 1
adamc@194 1164 val t = ListUtil.foldli (fn (i, u, t) => subConInCon (nxs - i, u) t) t unifs
adamc@191 1165 val dn = foldl (fn (u, dn) => (L'.CApp (dn, u), loc)) dn unifs
adamc@188 1166 in
adamc@628 1167 ignore (checkPatCon env p' pt t);
adamc@191 1168 (((L'.PCon (dk, pc, unifs, SOME p'), loc), dn),
adamc@188 1169 (env, bound))
adamc@188 1170 end
adamc@171 1171 in
adamc@171 1172 case p of
adamc@171 1173 L.PWild => (((L'.PWild, loc), cunif (loc, (L'.KType, loc))),
adamc@171 1174 (env, bound))
adamc@171 1175 | L.PVar x =>
adamc@171 1176 let
adamc@171 1177 val t = if SS.member (bound, x) then
adamc@171 1178 (expError env (DuplicatePatternVariable (loc, x));
adamc@171 1179 terror)
adamc@171 1180 else
adamc@171 1181 cunif (loc, (L'.KType, loc))
adamc@171 1182 in
adamc@182 1183 (((L'.PVar (x, t), loc), t),
adamc@171 1184 (E.pushERel env x t, SS.add (bound, x)))
adamc@171 1185 end
adamc@173 1186 | L.PPrim p => (((L'.PPrim p, loc), primType env p),
adamc@173 1187 (env, bound))
adamc@171 1188 | L.PCon ([], x, po) =>
adamc@171 1189 (case E.lookupConstructor env x of
adamc@174 1190 NONE => (expError env (UnboundConstructor (loc, [], x));
adamc@171 1191 rerror)
adamc@191 1192 | SOME (dk, n, xs, to, dn) => pcon (L'.PConVar n, po, xs, to, (L'.CNamed dn, loc), dk))
adamc@174 1193 | L.PCon (m1 :: ms, x, po) =>
adamc@174 1194 (case E.lookupStr env m1 of
adamc@174 1195 NONE => (expError env (UnboundStrInExp (loc, m1));
adamc@174 1196 rerror)
adamc@174 1197 | SOME (n, sgn) =>
adamc@174 1198 let
adamc@174 1199 val (str, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@174 1200 case E.projectStr env {sgn = sgn, str = str, field = m} of
adamc@182 1201 NONE => raise Fail "elabPat: Unknown substructure"
adamc@174 1202 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@174 1203 ((L'.StrVar n, loc), sgn) ms
adamc@174 1204 in
adamc@174 1205 case E.projectConstructor env {str = str, sgn = sgn, field = x} of
adamc@174 1206 NONE => (expError env (UnboundConstructor (loc, m1 :: ms, x));
adamc@174 1207 rerror)
adamc@191 1208 | SOME (dk, _, xs, to, dn) => pcon (L'.PConProj (n, ms, x), po, xs, to, dn, dk)
adamc@174 1209 end)
adamc@174 1210
adamc@175 1211 | L.PRecord (xps, flex) =>
adamc@175 1212 let
adamc@175 1213 val (xpts, (env, bound, _)) =
adamc@175 1214 ListUtil.foldlMap (fn ((x, p), (env, bound, fbound)) =>
adamc@175 1215 let
adamc@628 1216 val ((p', t), (env, bound)) = elabPat (p, (env, bound))
adamc@175 1217 in
adamc@175 1218 if SS.member (fbound, x) then
adamc@175 1219 expError env (DuplicatePatField (loc, x))
adamc@175 1220 else
adamc@175 1221 ();
adamc@175 1222 ((x, p', t), (env, bound, SS.add (fbound, x)))
adamc@175 1223 end)
adamc@175 1224 (env, bound, SS.empty) xps
adamc@175 1225
adamc@175 1226 val k = (L'.KType, loc)
adamc@175 1227 val c = (L'.CRecord (k, map (fn (x, _, t) => ((L'.CName x, loc), t)) xpts), loc)
adamc@176 1228 val c =
adamc@175 1229 if flex then
adamc@176 1230 (L'.CConcat (c, cunif (loc, (L'.KRecord k, loc))), loc)
adamc@175 1231 else
adamc@176 1232 c
adamc@175 1233 in
adamc@182 1234 (((L'.PRecord xpts, loc),
adamc@175 1235 (L'.TRecord c, loc)),
adamc@175 1236 (env, bound))
adamc@175 1237 end
adamc@175 1238
adamc@171 1239 end
adamc@171 1240
adamc@172 1241 datatype coverage =
adamc@172 1242 Wild
adamc@173 1243 | None
adamc@172 1244 | Datatype of coverage IM.map
adamc@175 1245 | Record of coverage SM.map list
adamc@172 1246
adamc@243 1247 fun c2s c =
adamc@243 1248 case c of
adamc@243 1249 Wild => "Wild"
adamc@243 1250 | None => "None"
adamc@243 1251 | Datatype _ => "Datatype"
adamc@243 1252 | Record _ => "Record"
adamc@243 1253
adamc@629 1254 fun exhaustive (env, t, ps, loc) =
adamc@172 1255 let
adamc@402 1256 fun depth (p, _) =
adamc@402 1257 case p of
adamc@402 1258 L'.PWild => 0
adamc@402 1259 | L'.PVar _ => 0
adamc@402 1260 | L'.PPrim _ => 0
adamc@402 1261 | L'.PCon (_, _, _, NONE) => 1
adamc@402 1262 | L'.PCon (_, _, _, SOME p) => 1 + depth p
adamc@402 1263 | L'.PRecord xps => foldl (fn ((_, p, _), n) => Int.max (depth p, n)) 0 xps
adamc@402 1264
adamc@402 1265 val depth = 1 + foldl (fn (p, n) => Int.max (depth p, n)) 0 ps
adamc@402 1266
adamc@172 1267 fun pcCoverage pc =
adamc@172 1268 case pc of
adamc@172 1269 L'.PConVar n => n
adamc@174 1270 | L'.PConProj (m1, ms, x) =>
adamc@174 1271 let
adamc@174 1272 val (str, sgn) = E.chaseMpath env (m1, ms)
adamc@174 1273 in
adamc@174 1274 case E.projectConstructor env {str = str, sgn = sgn, field = x} of
adamc@174 1275 NONE => raise Fail "exhaustive: Can't project constructor"
adamc@191 1276 | SOME (_, n, _, _, _) => n
adamc@174 1277 end
adamc@172 1278
adamc@172 1279 fun coverage (p, _) =
adamc@172 1280 case p of
adamc@172 1281 L'.PWild => Wild
adamc@172 1282 | L'.PVar _ => Wild
adamc@173 1283 | L'.PPrim _ => None
adamc@191 1284 | L'.PCon (_, pc, _, NONE) => Datatype (IM.insert (IM.empty, pcCoverage pc, Wild))
adamc@191 1285 | L'.PCon (_, pc, _, SOME p) => Datatype (IM.insert (IM.empty, pcCoverage pc, coverage p))
adamc@182 1286 | L'.PRecord xps => Record [foldl (fn ((x, p, _), fmap) =>
adamc@182 1287 SM.insert (fmap, x, coverage p)) SM.empty xps]
adamc@176 1288
adamc@172 1289 fun merge (c1, c2) =
adamc@172 1290 case (c1, c2) of
adamc@173 1291 (None, _) => c2
adamc@173 1292 | (_, None) => c1
adamc@173 1293
adamc@173 1294 | (Wild, _) => Wild
adamc@172 1295 | (_, Wild) => Wild
adamc@172 1296
adamc@172 1297 | (Datatype cm1, Datatype cm2) => Datatype (IM.unionWith merge (cm1, cm2))
adamc@172 1298
adamc@175 1299 | (Record fm1, Record fm2) => Record (fm1 @ fm2)
adamc@175 1300
adamc@175 1301 | _ => None
adamc@175 1302
adamc@172 1303 fun combinedCoverage ps =
adamc@172 1304 case ps of
adamc@172 1305 [] => raise Fail "Empty pattern list for coverage checking"
adamc@172 1306 | [p] => coverage p
adamc@172 1307 | p :: ps => merge (coverage p, combinedCoverage ps)
adamc@172 1308
adamc@402 1309 fun enumerateCases depth t =
adamc@402 1310 if depth = 0 then
adamc@402 1311 [Wild]
adamc@402 1312 else
adamc@402 1313 let
adamc@402 1314 fun dtype cons =
adamc@402 1315 ListUtil.mapConcat (fn (_, n, to) =>
adamc@402 1316 case to of
adamc@402 1317 NONE => [Datatype (IM.insert (IM.empty, n, Wild))]
adamc@402 1318 | SOME t => map (fn c => Datatype (IM.insert (IM.empty, n, c)))
adamc@402 1319 (enumerateCases (depth-1) t)) cons
adamc@402 1320 in
adamc@628 1321 case #1 (hnormCon env t) of
adamc@402 1322 L'.CNamed n =>
adamc@402 1323 (let
adamc@402 1324 val dt = E.lookupDatatype env n
adamc@402 1325 val cons = E.constructors dt
adamc@175 1326 in
adamc@402 1327 dtype cons
adamc@402 1328 end handle E.UnboundNamed _ => [Wild])
adamc@402 1329 | L'.TRecord c =>
adamc@628 1330 (case #1 (hnormCon env c) of
adamc@402 1331 L'.CRecord (_, xts) =>
adamc@402 1332 let
adamc@628 1333 val xts = map (fn (x, t) => (hnormCon env x, t)) xts
adamc@402 1334
adamc@402 1335 fun exponentiate fs =
adamc@402 1336 case fs of
adamc@402 1337 [] => [SM.empty]
adamc@402 1338 | ((L'.CName x, _), t) :: rest =>
adamc@402 1339 let
adamc@402 1340 val this = enumerateCases depth t
adamc@402 1341 val rest = exponentiate rest
adamc@402 1342 in
adamc@402 1343 ListUtil.mapConcat (fn fmap =>
adamc@402 1344 map (fn c => SM.insert (fmap, x, c)) this) rest
adamc@402 1345 end
adamc@402 1346 | _ => raise Fail "exponentiate: Not CName"
adamc@402 1347 in
adamc@402 1348 if List.exists (fn ((L'.CName _, _), _) => false
adamc@402 1349 | (c, _) => true) xts then
adamc@402 1350 [Wild]
adamc@402 1351 else
adamc@402 1352 map (fn ls => Record [ls]) (exponentiate xts)
adamc@402 1353 end
adamc@402 1354 | _ => [Wild])
adamc@402 1355 | _ => [Wild]
adamc@402 1356 end
adamc@175 1357
adamc@175 1358 fun coverageImp (c1, c2) =
adamc@243 1359 let
adamc@243 1360 val r =
adamc@243 1361 case (c1, c2) of
adamc@243 1362 (Wild, _) => true
adamc@243 1363
adamc@243 1364 | (Datatype cmap1, Datatype cmap2) =>
adamc@243 1365 List.all (fn (n, c2) =>
adamc@243 1366 case IM.find (cmap1, n) of
adamc@243 1367 NONE => false
adamc@243 1368 | SOME c1 => coverageImp (c1, c2)) (IM.listItemsi cmap2)
adamc@243 1369 | (Datatype cmap1, Wild) =>
adamc@243 1370 List.all (fn (n, c1) => coverageImp (c1, Wild)) (IM.listItemsi cmap1)
adamc@243 1371
adamc@243 1372 | (Record fmaps1, Record fmaps2) =>
adamc@243 1373 List.all (fn fmap2 =>
adamc@243 1374 List.exists (fn fmap1 =>
adamc@243 1375 List.all (fn (x, c2) =>
adamc@243 1376 case SM.find (fmap1, x) of
adamc@243 1377 NONE => true
adamc@243 1378 | SOME c1 => coverageImp (c1, c2))
adamc@243 1379 (SM.listItemsi fmap2))
adamc@243 1380 fmaps1) fmaps2
adamc@243 1381
adamc@243 1382 | (Record fmaps1, Wild) =>
adamc@243 1383 List.exists (fn fmap1 =>
adamc@243 1384 List.all (fn (x, c1) => coverageImp (c1, Wild))
adamc@243 1385 (SM.listItemsi fmap1)) fmaps1
adamc@243 1386
adamc@243 1387 | _ => false
adamc@243 1388 in
adamc@243 1389 (*TextIO.print ("coverageImp(" ^ c2s c1 ^ ", " ^ c2s c2 ^ ") = " ^ Bool.toString r ^ "\n");*)
adamc@243 1390 r
adamc@243 1391 end
adamc@175 1392
adamc@172 1393 fun isTotal (c, t) =
adamc@172 1394 case c of
adamc@628 1395 None => false
adamc@628 1396 | Wild => true
adamc@172 1397 | Datatype cm =>
adamc@172 1398 let
adamc@628 1399 val (t, _) = hnormCon env t
adamc@628 1400
adamc@628 1401 val dtype =
adamc@628 1402 List.all (fn (_, n, to) =>
adamc@628 1403 case IM.find (cm, n) of
adamc@628 1404 NONE => false
adamc@628 1405 | SOME c' =>
adamc@628 1406 case to of
adamc@628 1407 NONE => true
adamc@628 1408 | SOME t' => isTotal (c', t'))
adamc@191 1409
adamc@191 1410 fun unapp t =
adamc@191 1411 case t of
adamc@191 1412 L'.CApp ((t, _), _) => unapp t
adamc@191 1413 | _ => t
adamc@172 1414 in
adamc@191 1415 case unapp t of
adamc@172 1416 L'.CNamed n =>
adamc@172 1417 let
adamc@172 1418 val dt = E.lookupDatatype env n
adamc@172 1419 val cons = E.constructors dt
adamc@172 1420 in
adamc@174 1421 dtype cons
adamc@174 1422 end
adamc@174 1423 | L'.CModProj (m1, ms, x) =>
adamc@174 1424 let
adamc@174 1425 val (str, sgn) = E.chaseMpath env (m1, ms)
adamc@174 1426 in
adamc@174 1427 case E.projectDatatype env {str = str, sgn = sgn, field = x} of
adamc@174 1428 NONE => raise Fail "isTotal: Can't project datatype"
adamc@191 1429 | SOME (_, cons) => dtype cons
adamc@172 1430 end
adamc@628 1431 | L'.CError => true
adamc@341 1432 | c =>
adamc@629 1433 (prefaces "Not a datatype" [("loc", PD.string (ErrorMsg.spanToString loc)),
adamc@629 1434 ("c", p_con env (c, ErrorMsg.dummySpan))];
adamc@341 1435 raise Fail "isTotal: Not a datatype")
adamc@172 1436 end
adamc@628 1437 | Record _ => List.all (fn c2 => coverageImp (c, c2)) (enumerateCases depth t)
adamc@172 1438 in
adamc@172 1439 isTotal (combinedCoverage ps, t)
adamc@172 1440 end
adamc@172 1441
adamc@217 1442 fun unmodCon env (c, loc) =
adamc@217 1443 case c of
adamc@217 1444 L'.CNamed n =>
adamc@217 1445 (case E.lookupCNamed env n of
adamc@217 1446 (_, _, SOME (c as (L'.CModProj _, _))) => unmodCon env c
adamc@217 1447 | _ => (c, loc))
adamc@217 1448 | L'.CModProj (m1, ms, x) =>
adamc@217 1449 let
adamc@217 1450 val (str, sgn) = E.chaseMpath env (m1, ms)
adamc@217 1451 in
adamc@217 1452 case E.projectCon env {str = str, sgn = sgn, field = x} of
adamc@217 1453 NONE => raise Fail "unmodCon: Can't projectCon"
adamc@217 1454 | SOME (_, SOME (c as (L'.CModProj _, _))) => unmodCon env c
adamc@217 1455 | _ => (c, loc)
adamc@217 1456 end
adamc@217 1457 | _ => (c, loc)
adamc@217 1458
adamc@467 1459 fun normClassKey envs c =
adamc@467 1460 let
adamc@628 1461 val c = hnormCon envs c
adamc@467 1462 in
adamc@467 1463 case #1 c of
adamc@467 1464 L'.CApp (c1, c2) =>
adamc@467 1465 let
adamc@467 1466 val c1 = normClassKey envs c1
adamc@467 1467 val c2 = normClassKey envs c2
adamc@467 1468 in
adamc@467 1469 (L'.CApp (c1, c2), #2 c)
adamc@467 1470 end
adamc@467 1471 | _ => c
adamc@467 1472 end
adamc@467 1473
adamc@467 1474 fun normClassConstraint env (c, loc) =
adamc@217 1475 case c of
adamc@217 1476 L'.CApp (f, x) =>
adamc@217 1477 let
adamc@467 1478 val f = unmodCon env f
adamc@467 1479 val x = normClassKey env x
adamc@217 1480 in
adamc@467 1481 (L'.CApp (f, x), loc)
adamc@217 1482 end
adamc@467 1483 | L'.CUnif (_, _, _, ref (SOME c)) => normClassConstraint env c
adamc@467 1484 | _ => (c, loc)
adamc@216 1485
adamc@92 1486 fun elabExp (env, denv) (eAll as (e, loc)) =
adamc@91 1487 let
adamc@280 1488 (*val () = eprefaces "elabExp" [("eAll", SourcePrint.p_exp eAll)];*)
adamc@514 1489 (*val befor = Time.now ()*)
adamc@280 1490
adamc@280 1491 val r = case e of
adamc@91 1492 L.EAnnot (e, t) =>
adamc@91 1493 let
adamc@91 1494 val (e', et, gs1) = elabExp (env, denv) e
adamc@91 1495 val (t', _, gs2) = elabCon (env, denv) t
adamc@91 1496 in
adamc@628 1497 checkCon env e' et t';
adamc@628 1498 (e', t', gs1 @ enD gs2)
adamc@91 1499 end
adamc@34 1500
adamc@91 1501 | L.EPrim p => ((L'.EPrim p, loc), primType env p, [])
adamc@403 1502 | L.EVar ([], s, infer) =>
adamc@91 1503 (case E.lookupE env s of
adamc@91 1504 E.NotBound =>
adamc@91 1505 (expError env (UnboundExp (loc, s));
adamc@91 1506 (eerror, cerror, []))
adamc@629 1507 | E.Rel (n, t) => elabHead (env, denv) infer (L'.ERel n, loc) t
adamc@629 1508 | E.Named (n, t) => elabHead (env, denv) infer (L'.ENamed n, loc) t)
adamc@403 1509 | L.EVar (m1 :: ms, s, infer) =>
adamc@91 1510 (case E.lookupStr env m1 of
adamc@91 1511 NONE => (expError env (UnboundStrInExp (loc, m1));
adamc@91 1512 (eerror, cerror, []))
adamc@91 1513 | SOME (n, sgn) =>
adamc@91 1514 let
adamc@91 1515 val (str, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@91 1516 case E.projectStr env {sgn = sgn, str = str, field = m} of
adamc@91 1517 NONE => (conError env (UnboundStrInCon (loc, m));
adamc@91 1518 (strerror, sgnerror))
adamc@91 1519 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@91 1520 ((L'.StrVar n, loc), sgn) ms
adamc@10 1521
adamc@91 1522 val t = case E.projectVal env {sgn = sgn, str = str, field = s} of
adamc@91 1523 NONE => (expError env (UnboundExp (loc, s));
adamc@91 1524 cerror)
adamc@91 1525 | SOME t => t
adamc@91 1526 in
adamc@629 1527 elabHead (env, denv) infer (L'.EModProj (n, ms, s), loc) t
adamc@91 1528 end)
adamc@86 1529
adamc@349 1530 | L.EWild =>
adamc@210 1531 let
adamc@349 1532 val r = ref NONE
adamc@349 1533 val c = cunif (loc, (L'.KType, loc))
adamc@210 1534 in
adamc@349 1535 ((L'.EUnif r, loc), c, [TypeClass (env, c, r, loc)])
adamc@210 1536 end
adamc@210 1537
adamc@91 1538 | L.EApp (e1, e2) =>
adamc@91 1539 let
adamc@91 1540 val (e1', t1, gs1) = elabExp (env, denv) e1
adamc@403 1541 val (e2', t2, gs2) = elabExp (env, denv) e2
adamc@71 1542
adamc@91 1543 val dom = cunif (loc, ktype)
adamc@91 1544 val ran = cunif (loc, ktype)
adamc@91 1545 val t = (L'.TFun (dom, ran), dummy)
adamc@91 1546 in
adamc@628 1547 checkCon env e1' t1 t;
adamc@628 1548 checkCon env e2' t2 dom;
adamc@628 1549 ((L'.EApp (e1', e2'), loc), ran, gs1 @ gs2)
adamc@91 1550 end
adamc@91 1551 | L.EAbs (x, to, e) =>
adamc@91 1552 let
adamc@91 1553 val (t', gs1) = case to of
adamc@91 1554 NONE => (cunif (loc, ktype), [])
adamc@91 1555 | SOME t =>
adamc@91 1556 let
adamc@91 1557 val (t', tk, gs) = elabCon (env, denv) t
adamc@91 1558 in
adamc@91 1559 checkKind env t' tk ktype;
adamc@91 1560 (t', gs)
adamc@91 1561 end
adamc@467 1562 val dom = normClassConstraint env t'
adamc@467 1563 val (e', et, gs2) = elabExp (E.pushERel env x dom, denv) e
adamc@91 1564 in
adamc@91 1565 ((L'.EAbs (x, t', et, e'), loc),
adamc@91 1566 (L'.TFun (t', et), loc),
adamc@467 1567 enD gs1 @ gs2)
adamc@91 1568 end
adamc@91 1569 | L.ECApp (e, c) =>
adamc@91 1570 let
adamc@91 1571 val (e', et, gs1) = elabExp (env, denv) e
adamc@328 1572 val oldEt = et
adamc@403 1573 val (c', ck, gs2) = elabCon (env, denv) c
adamc@628 1574 val (et', _) = hnormCon env et
adamc@91 1575 in
adamc@91 1576 case et' of
adamc@91 1577 L'.CError => (eerror, cerror, [])
adamc@328 1578 | L'.TCFun (_, x, k, eb) =>
adamc@91 1579 let
adamc@91 1580 val () = checkKind env c' ck k
adamc@91 1581 val eb' = subConInCon (0, c') eb
adamc@339 1582 handle SynUnif => (expError env (Unif ("substitution", loc, eb));
adamc@91 1583 cerror)
adamc@91 1584 in
adamc@328 1585 (*prefaces "Elab ECApp" [("e", SourcePrint.p_exp eAll),
adamc@328 1586 ("et", p_con env oldEt),
adamc@328 1587 ("x", PD.string x),
adamc@328 1588 ("eb", p_con (E.pushCRel env x k) eb),
adamc@328 1589 ("c", p_con env c'),
adamc@328 1590 ("eb'", p_con env eb')];*)
adamc@628 1591 ((L'.ECApp (e', c'), loc), eb', gs1 @ enD gs2)
adamc@91 1592 end
adamc@91 1593
adamc@91 1594 | _ =>
adamc@91 1595 (expError env (WrongForm ("constructor function", e', et));
adamc@91 1596 (eerror, cerror, []))
adamc@91 1597 end
adamc@91 1598 | L.ECAbs (expl, x, k, e) =>
adamc@91 1599 let
adamc@91 1600 val expl' = elabExplicitness expl
adamc@623 1601 val k' = elabKind env k
adamc@328 1602
adamc@328 1603 val env' = E.pushCRel env x k'
adamc@328 1604 val (e', et, gs) = elabExp (env', D.enter denv) e
adamc@91 1605 in
adamc@91 1606 ((L'.ECAbs (expl', x, k', e'), loc),
adamc@91 1607 (L'.TCFun (expl', x, k', et), loc),
adamc@91 1608 gs)
adamc@91 1609 end
adamc@623 1610 | L.EKAbs (x, e) =>
adamc@623 1611 let
adamc@623 1612 val env' = E.pushKRel env x
adamc@623 1613 val (e', et, gs) = elabExp (env', denv) e
adamc@623 1614 in
adamc@623 1615 ((L'.EKAbs (x, e'), loc),
adamc@623 1616 (L'.TKFun (x, et), loc),
adamc@623 1617 gs)
adamc@623 1618 end
adamc@91 1619
adamc@91 1620 | L.EDisjoint (c1, c2, e) =>
adamc@91 1621 let
adamc@91 1622 val (c1', k1, gs1) = elabCon (env, denv) c1
adamc@91 1623 val (c2', k2, gs2) = elabCon (env, denv) c2
adamc@91 1624
adamc@91 1625 val ku1 = kunif loc
adamc@91 1626 val ku2 = kunif loc
adamc@91 1627
adamc@628 1628 val denv' = D.assert env denv (c1', c2')
adamc@628 1629 val (e', t, gs3) = elabExp (env, denv') e
adamc@91 1630 in
adamc@91 1631 checkKind env c1' k1 (L'.KRecord ku1, loc);
adamc@91 1632 checkKind env c2' k2 (L'.KRecord ku2, loc);
adamc@91 1633
adamc@628 1634 (e', (L'.TDisjoint (c1', c2', t), loc), enD gs1 @ enD gs2 @ gs3)
adamc@91 1635 end
adamc@629 1636 | L.EDisjointApp e =>
adamc@629 1637 let
adamc@629 1638 val (e', t, gs1) = elabExp (env, denv) e
adamc@629 1639
adamc@629 1640 val k1 = kunif loc
adamc@629 1641 val c1 = cunif (loc, (L'.KRecord k1, loc))
adamc@629 1642 val k2 = kunif loc
adamc@629 1643 val c2 = cunif (loc, (L'.KRecord k2, loc))
adamc@629 1644 val t' = cunif (loc, ktype)
adamc@629 1645 val () = checkCon env e' t (L'.TDisjoint (c1, c2, t'), loc)
adamc@629 1646 val gs2 = D.prove env denv (c1, c2, loc)
adamc@629 1647 in
adamc@629 1648 (e', t', enD gs2 @ gs1)
adamc@629 1649 end
adamc@91 1650
adamc@91 1651 | L.ERecord xes =>
adamc@91 1652 let
adamc@91 1653 val (xes', gs) = ListUtil.foldlMap (fn ((x, e), gs) =>
adamc@91 1654 let
adamc@91 1655 val (x', xk, gs1) = elabCon (env, denv) x
adamc@91 1656 val (e', et, gs2) = elabExp (env, denv) e
adamc@91 1657 in
adamc@91 1658 checkKind env x' xk kname;
adamc@228 1659 ((x', e', et), enD gs1 @ gs2 @ gs)
adamc@91 1660 end)
adamc@91 1661 [] xes
adamc@91 1662
adamc@91 1663 val k = (L'.KType, loc)
adamc@91 1664
adamc@91 1665 fun prove (xets, gs) =
adamc@91 1666 case xets of
adamc@91 1667 [] => gs
adamc@91 1668 | (x, _, t) :: rest =>
adamc@91 1669 let
adamc@91 1670 val xc = (x, t)
adamc@91 1671 val r1 = (L'.CRecord (k, [xc]), loc)
adamc@91 1672 val gs = foldl (fn ((x', _, t'), gs) =>
adamc@91 1673 let
adamc@91 1674 val xc' = (x', t')
adamc@91 1675 val r2 = (L'.CRecord (k, [xc']), loc)
adamc@91 1676 in
adamc@91 1677 D.prove env denv (r1, r2, loc) @ gs
adamc@91 1678 end)
adamc@91 1679 gs rest
adamc@91 1680 in
adamc@91 1681 prove (rest, gs)
adamc@91 1682 end
adamc@228 1683
adamc@228 1684 val gsD = List.mapPartial (fn Disjoint d => SOME d | _ => NONE) gs
adamc@228 1685 val gsO = List.filter (fn Disjoint _ => false | _ => true) gs
adamc@91 1686 in
adamc@255 1687 (*TextIO.print ("|gsO| = " ^ Int.toString (length gsO) ^ "\n");*)
adamc@91 1688 ((L'.ERecord xes', loc),
adamc@91 1689 (L'.TRecord (L'.CRecord (ktype, map (fn (x', _, et) => (x', et)) xes'), loc), loc),
adamc@228 1690 enD (prove (xes', gsD)) @ gsO)
adamc@91 1691 end
adamc@91 1692
adamc@91 1693 | L.EField (e, c) =>
adamc@91 1694 let
adamc@91 1695 val (e', et, gs1) = elabExp (env, denv) e
adamc@91 1696 val (c', ck, gs2) = elabCon (env, denv) c
adamc@91 1697
adamc@91 1698 val ft = cunif (loc, ktype)
adamc@91 1699 val rest = cunif (loc, ktype_record)
adamc@91 1700 val first = (L'.CRecord (ktype, [(c', ft)]), loc)
adamc@629 1701 val () = checkCon env e' et
adamc@629 1702 (L'.TRecord (L'.CConcat (first, rest), loc), loc);
adamc@628 1703 val gs3 = D.prove env denv (first, rest, loc)
adamc@91 1704 in
adamc@628 1705 ((L'.EField (e', c', {field = ft, rest = rest}), loc), ft, gs1 @ enD gs2 @ enD gs3)
adamc@91 1706 end
adamc@91 1707
adamc@445 1708 | L.EConcat (e1, e2) =>
adamc@339 1709 let
adamc@339 1710 val (e1', e1t, gs1) = elabExp (env, denv) e1
adamc@445 1711 val (e2', e2t, gs2) = elabExp (env, denv) e2
adamc@445 1712
adamc@445 1713 val r1 = cunif (loc, ktype_record)
adamc@445 1714 val r2 = cunif (loc, ktype_record)
adamc@445 1715
adamc@629 1716 val () = checkCon env e1' e1t (L'.TRecord r1, loc)
adamc@629 1717 val () = checkCon env e2' e2t (L'.TRecord r2, loc)
adamc@629 1718
adamc@628 1719 val gs3 = D.prove env denv (r1, r2, loc)
adamc@339 1720 in
adamc@445 1721 ((L'.EConcat (e1', r1, e2', r2), loc),
adamc@445 1722 (L'.TRecord ((L'.CConcat (r1, r2), loc)), loc),
adamc@628 1723 gs1 @ gs2 @ enD gs3)
adamc@339 1724 end
adamc@149 1725 | L.ECut (e, c) =>
adamc@149 1726 let
adamc@149 1727 val (e', et, gs1) = elabExp (env, denv) e
adamc@149 1728 val (c', ck, gs2) = elabCon (env, denv) c
adamc@149 1729
adamc@149 1730 val ft = cunif (loc, ktype)
adamc@149 1731 val rest = cunif (loc, ktype_record)
adamc@149 1732 val first = (L'.CRecord (ktype, [(c', ft)]), loc)
adamc@629 1733
adamc@629 1734 val () = checkCon env e' et
adamc@629 1735 (L'.TRecord (L'.CConcat (first, rest), loc), loc)
adamc@149 1736
adamc@628 1737 val gs3 = D.prove env denv (first, rest, loc)
adamc@149 1738 in
adamc@228 1739 ((L'.ECut (e', c', {field = ft, rest = rest}), loc), (L'.TRecord rest, loc),
adamc@628 1740 gs1 @ enD gs2 @ enD gs3)
adamc@149 1741 end
adamc@493 1742 | L.ECutMulti (e, c) =>
adamc@493 1743 let
adamc@493 1744 val (e', et, gs1) = elabExp (env, denv) e
adamc@493 1745 val (c', ck, gs2) = elabCon (env, denv) c
adamc@493 1746
adamc@493 1747 val rest = cunif (loc, ktype_record)
adamc@629 1748
adamc@629 1749 val () = checkCon env e' et
adamc@629 1750 (L'.TRecord (L'.CConcat (c', rest), loc), loc)
adamc@493 1751
adamc@628 1752 val gs3 = D.prove env denv (c', rest, loc)
adamc@493 1753 in
adamc@493 1754 ((L'.ECutMulti (e', c', {rest = rest}), loc), (L'.TRecord rest, loc),
adamc@628 1755 gs1 @ enD gs2 @ enD gs3)
adamc@493 1756 end
adamc@149 1757
adamc@171 1758 | L.ECase (e, pes) =>
adamc@171 1759 let
adamc@171 1760 val (e', et, gs1) = elabExp (env, denv) e
adamc@171 1761 val result = cunif (loc, (L'.KType, loc))
adamc@171 1762 val (pes', gs) = ListUtil.foldlMap
adamc@171 1763 (fn ((p, e), gs) =>
adamc@171 1764 let
adamc@628 1765 val ((p', pt), (env, _)) = elabPat (p, (env, SS.empty))
adamc@628 1766
adamc@629 1767 val (e', et', gs1) = elabExp (env, denv) e
adamc@171 1768 in
adamc@628 1769 checkPatCon env p' pt et;
adamc@629 1770 checkCon env e' et' result;
adamc@628 1771 ((p', e'), gs1 @ gs)
adamc@171 1772 end)
adamc@171 1773 gs1 pes
adamc@171 1774 in
adamc@629 1775 if exhaustive (env, et, map #1 pes', loc) then
adamc@172 1776 ()
adamc@172 1777 else
adamc@172 1778 expError env (Inexhaustive loc);
adamc@172 1779
adamc@628 1780 ((L'.ECase (e', pes', {disc = et, result = result}), loc), result, gs)
adamc@171 1781 end
adamc@447 1782
adamc@447 1783 | L.ELet (eds, e) =>
adamc@447 1784 let
adamc@447 1785 val (eds, (env, gs1)) = ListUtil.foldlMap (elabEdecl denv) (env, []) eds
adamc@447 1786 val (e, t, gs2) = elabExp (env, denv) e
adamc@447 1787 in
adamc@447 1788 ((L'.ELet (eds, e), loc), t, gs1 @ gs2)
adamc@447 1789 end
adamc@280 1790 in
adamc@513 1791 (*prefaces "elabExp" [("e", SourcePrint.p_exp eAll),
adamc@514 1792 ("t", PD.string (LargeReal.toString (Time.toReal (Time.- (Time.now (), befor)))))];*)
adamc@280 1793 r
adamc@91 1794 end
adamc@31 1795
adamc@628 1796 and elabEdecl denv (dAll as (d, loc), (env, gs)) =
adamc@447 1797 let
adamc@447 1798 val r =
adamc@447 1799 case d of
adamc@447 1800 L.EDVal (x, co, e) =>
adamc@447 1801 let
adamc@447 1802 val (c', _, gs1) = case co of
adamc@447 1803 NONE => (cunif (loc, ktype), ktype, [])
adamc@447 1804 | SOME c => elabCon (env, denv) c
adamc@447 1805
adamc@447 1806 val (e', et, gs2) = elabExp (env, denv) e
adamc@628 1807
adamc@629 1808 val () = checkCon env e' et c'
adamc@629 1809
adamc@467 1810 val c' = normClassConstraint env c'
adamc@447 1811 val env' = E.pushERel env x c'
adamc@447 1812 in
adamc@628 1813 ((L'.EDVal (x, c', e'), loc), (env', enD gs1 @ gs2 @ gs))
adamc@447 1814 end
adamc@447 1815 | L.EDValRec vis =>
adamc@447 1816 let
adamc@447 1817 fun allowable (e, _) =
adamc@447 1818 case e of
adamc@447 1819 L.EAbs _ => true
adamc@447 1820 | L.ECAbs (_, _, _, e) => allowable e
adamc@623 1821 | L.EKAbs (_, e) => allowable e
adamc@447 1822 | L.EDisjoint (_, _, e) => allowable e
adamc@447 1823 | _ => false
adamc@447 1824
adamc@447 1825 val (vis, gs) = ListUtil.foldlMap
adamc@447 1826 (fn ((x, co, e), gs) =>
adamc@447 1827 let
adamc@447 1828 val (c', _, gs1) = case co of
adamc@447 1829 NONE => (cunif (loc, ktype), ktype, [])
adamc@447 1830 | SOME c => elabCon (env, denv) c
adamc@447 1831 in
adamc@447 1832 ((x, c', e), enD gs1 @ gs)
adamc@447 1833 end) gs vis
adamc@447 1834
adamc@447 1835 val env = foldl (fn ((x, c', _), env) => E.pushERel env x c') env vis
adamc@447 1836
adamc@447 1837 val (vis, gs) = ListUtil.foldlMap (fn ((x, c', e), gs) =>
adamc@447 1838 let
adamc@447 1839 val (e', et, gs1) = elabExp (env, denv) e
adamc@447 1840 in
adamc@628 1841 checkCon env e' et c';
adamc@447 1842 if allowable e then
adamc@447 1843 ()
adamc@447 1844 else
adamc@447 1845 expError env (IllegalRec (x, e'));
adamc@628 1846 ((x, c', e'), gs1 @ gs)
adamc@447 1847 end) gs vis
adamc@447 1848 in
adamc@447 1849 ((L'.EDValRec vis, loc), (env, gs))
adamc@447 1850 end
adamc@447 1851 in
adamc@447 1852 r
adamc@447 1853 end
adamc@447 1854
adamc@42 1855 val hnormSgn = E.hnormSgn
adamc@31 1856
adamc@210 1857 fun tableOf () = (L'.CModProj (!basis_r, [], "sql_table"), ErrorMsg.dummySpan)
adamc@338 1858 fun sequenceOf () = (L'.CModProj (!basis_r, [], "sql_sequence"), ErrorMsg.dummySpan)
adamc@459 1859 fun cookieOf () = (L'.CModProj (!basis_r, [], "http_cookie"), ErrorMsg.dummySpan)
adamc@205 1860
adamc@469 1861 fun dopenConstraints (loc, env, denv) {str, strs} =
adamc@469 1862 case E.lookupStr env str of
adamc@469 1863 NONE => (strError env (UnboundStr (loc, str));
adamc@469 1864 denv)
adamc@469 1865 | SOME (n, sgn) =>
adamc@469 1866 let
adamc@469 1867 val (st, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@469 1868 case E.projectStr env {str = str, sgn = sgn, field = m} of
adamc@469 1869 NONE => (strError env (UnboundStr (loc, m));
adamc@469 1870 (strerror, sgnerror))
adamc@469 1871 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@469 1872 ((L'.StrVar n, loc), sgn) strs
adamc@469 1873
adamc@469 1874 val cso = E.projectConstraints env {sgn = sgn, str = st}
adamc@469 1875 in
adamc@628 1876 case cso of
adamc@628 1877 NONE => (strError env (UnboundStr (loc, str));
adamc@628 1878 denv)
adamc@628 1879 | SOME cs => foldl (fn ((c1, c2), denv) =>
adamc@628 1880 D.assert env denv (c1, c2)) denv cs
adamc@469 1881 end
adamc@469 1882
adamc@88 1883 fun elabSgn_item ((sgi, loc), (env, denv, gs)) =
adamc@76 1884 case sgi of
adamc@76 1885 L.SgiConAbs (x, k) =>
adamc@76 1886 let
adamc@623 1887 val k' = elabKind env k
adamc@31 1888
adamc@76 1889 val (env', n) = E.pushCNamed env x k' NONE
adamc@76 1890 in
adamc@88 1891 ([(L'.SgiConAbs (x, n, k'), loc)], (env', denv, gs))
adamc@76 1892 end
adamc@31 1893
adamc@76 1894 | L.SgiCon (x, ko, c) =>
adamc@76 1895 let
adamc@76 1896 val k' = case ko of
adamc@76 1897 NONE => kunif loc
adamc@623 1898 | SOME k => elabKind env k
adamc@31 1899
adamc@83 1900 val (c', ck, gs') = elabCon (env, denv) c
adamc@76 1901 val (env', n) = E.pushCNamed env x k' (SOME c')
adamc@76 1902 in
adamc@76 1903 checkKind env c' ck k';
adamc@31 1904
adamc@88 1905 ([(L'.SgiCon (x, n, k', c'), loc)], (env', denv, gs' @ gs))
adamc@76 1906 end
adamc@31 1907
adamc@191 1908 | L.SgiDatatype (x, xs, xcs) =>
adamc@157 1909 let
adamc@157 1910 val k = (L'.KType, loc)
adamc@191 1911 val k' = foldl (fn (_, k') => (L'.KArrow (k, k'), loc)) k xs
adamc@191 1912 val (env, n) = E.pushCNamed env x k' NONE
adamc@157 1913 val t = (L'.CNamed n, loc)
adamc@194 1914 val nxs = length xs - 1
adamc@194 1915 val t = ListUtil.foldli (fn (i, _, t) => (L'.CApp (t, (L'.CRel (nxs - i), loc)), loc)) t xs
adamc@157 1916
adamc@284 1917 val (env', denv') = foldl (fn (x, (env', denv')) =>
adamc@284 1918 (E.pushCRel env' x k,
adamc@284 1919 D.enter denv')) (env, denv) xs
adamc@284 1920
adamc@157 1921 val (xcs, (used, env, gs)) =
adamc@157 1922 ListUtil.foldlMap
adamc@157 1923 (fn ((x, to), (used, env, gs)) =>
adamc@157 1924 let
adamc@157 1925 val (to, t, gs') = case to of
adamc@157 1926 NONE => (NONE, t, gs)
adamc@157 1927 | SOME t' =>
adamc@157 1928 let
adamc@284 1929 val (t', tk, gs') = elabCon (env', denv') t'
adamc@157 1930 in
adamc@284 1931 checkKind env' t' tk k;
adamc@157 1932 (SOME t', (L'.TFun (t', t), loc), gs' @ gs)
adamc@157 1933 end
adamc@191 1934 val t = foldl (fn (x, t) => (L'.TCFun (L'.Implicit, x, k, t), loc)) t xs
adamc@157 1935
adamc@157 1936 val (env, n') = E.pushENamed env x t
adamc@157 1937 in
adamc@157 1938 if SS.member (used, x) then
adamc@157 1939 strError env (DuplicateConstructor (x, loc))
adamc@157 1940 else
adamc@157 1941 ();
adamc@157 1942 ((x, n', to), (SS.add (used, x), env, gs'))
adamc@157 1943 end)
adamc@157 1944 (SS.empty, env, []) xcs
adamc@191 1945
adamc@191 1946 val env = E.pushDatatype env n xs xcs
adamc@157 1947 in
adamc@191 1948 ([(L'.SgiDatatype (x, n, xs, xcs), loc)], (env, denv, gs))
adamc@157 1949 end
adamc@156 1950
adamc@158 1951 | L.SgiDatatypeImp (_, [], _) => raise Fail "Empty SgiDatatypeImp"
adamc@158 1952
adamc@158 1953 | L.SgiDatatypeImp (x, m1 :: ms, s) =>
adamc@158 1954 (case E.lookupStr env m1 of
adamc@158 1955 NONE => (strError env (UnboundStr (loc, m1));
adamc@158 1956 ([], (env, denv, gs)))
adamc@158 1957 | SOME (n, sgn) =>
adamc@158 1958 let
adamc@158 1959 val (str, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@158 1960 case E.projectStr env {sgn = sgn, str = str, field = m} of
adamc@158 1961 NONE => (conError env (UnboundStrInCon (loc, m));
adamc@158 1962 (strerror, sgnerror))
adamc@158 1963 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@158 1964 ((L'.StrVar n, loc), sgn) ms
adamc@158 1965 in
adamc@628 1966 case hnormCon env (L'.CModProj (n, ms, s), loc) of
adamc@628 1967 (L'.CModProj (n, ms, s), _) =>
adamc@161 1968 (case E.projectDatatype env {sgn = sgn, str = str, field = s} of
adamc@161 1969 NONE => (conError env (UnboundDatatype (loc, s));
adamc@628 1970 ([], (env, denv, [])))
adamc@191 1971 | SOME (xs, xncs) =>
adamc@161 1972 let
adamc@161 1973 val k = (L'.KType, loc)
adamc@191 1974 val k' = foldl (fn (_, k') => (L'.KArrow (k, k'), loc)) k xs
adamc@191 1975
adamc@161 1976 val t = (L'.CModProj (n, ms, s), loc)
adamc@191 1977 val (env, n') = E.pushCNamed env x k' (SOME t)
adamc@191 1978 val env = E.pushDatatype env n' xs xncs
adamc@158 1979
adamc@161 1980 val t = (L'.CNamed n', loc)
adamc@161 1981 val env = foldl (fn ((x, n, to), env) =>
adamc@161 1982 let
adamc@161 1983 val t = case to of
adamc@161 1984 NONE => t
adamc@161 1985 | SOME t' => (L'.TFun (t', t), loc)
adamc@191 1986
adamc@191 1987 val t = foldr (fn (x, t) =>
adamc@191 1988 (L'.TCFun (L'.Implicit, x, k, t), loc))
adamc@191 1989 t xs
adamc@161 1990 in
adamc@161 1991 E.pushENamedAs env x n t
adamc@161 1992 end) env xncs
adamc@161 1993 in
adamc@628 1994 ([(L'.SgiDatatypeImp (x, n', n, ms, s, xs, xncs), loc)], (env, denv, []))
adamc@161 1995 end)
adamc@161 1996 | _ => (strError env (NotDatatype loc);
adamc@161 1997 ([], (env, denv, [])))
adamc@158 1998 end)
adamc@156 1999
adamc@76 2000 | L.SgiVal (x, c) =>
adamc@76 2001 let
adamc@83 2002 val (c', ck, gs') = elabCon (env, denv) c
adamc@31 2003
adamc@76 2004 val (env', n) = E.pushENamed env x c'
adamc@467 2005 val c' = normClassConstraint env c'
adamc@76 2006 in
adamc@623 2007 (unifyKinds env ck ktype
adamc@76 2008 handle KUnify ue => strError env (NotType (ck, ue)));
adamc@31 2009
adamc@467 2010 ([(L'.SgiVal (x, n, c'), loc)], (env', denv, gs' @ gs))
adamc@76 2011 end
adamc@31 2012
adamc@76 2013 | L.SgiStr (x, sgn) =>
adamc@76 2014 let
adamc@83 2015 val (sgn', gs') = elabSgn (env, denv) sgn
adamc@76 2016 val (env', n) = E.pushStrNamed env x sgn'
adamc@76 2017 in
adamc@88 2018 ([(L'.SgiStr (x, n, sgn'), loc)], (env', denv, gs' @ gs))
adamc@76 2019 end
adamc@31 2020
adamc@76 2021 | L.SgiSgn (x, sgn) =>
adamc@76 2022 let
adamc@83 2023 val (sgn', gs') = elabSgn (env, denv) sgn
adamc@76 2024 val (env', n) = E.pushSgnNamed env x sgn'
adamc@76 2025 in
adamc@88 2026 ([(L'.SgiSgn (x, n, sgn'), loc)], (env', denv, gs' @ gs))
adamc@76 2027 end
adamc@31 2028
adamc@76 2029 | L.SgiInclude sgn =>
adamc@76 2030 let
adamc@83 2031 val (sgn', gs') = elabSgn (env, denv) sgn
adamc@76 2032 in
adamc@76 2033 case #1 (hnormSgn env sgn') of
adamc@76 2034 L'.SgnConst sgis =>
adamc@88 2035 (sgis, (foldl (fn (sgi, env) => E.sgiBinds env sgi) env sgis, denv, gs' @ gs))
adamc@76 2036 | _ => (sgnError env (NotIncludable sgn');
adamc@88 2037 ([], (env, denv, [])))
adamc@88 2038 end
adamc@88 2039
adamc@88 2040 | L.SgiConstraint (c1, c2) =>
adamc@88 2041 let
adamc@88 2042 val (c1', k1, gs1) = elabCon (env, denv) c1
adamc@88 2043 val (c2', k2, gs2) = elabCon (env, denv) c2
adamc@88 2044
adamc@628 2045 val denv = D.assert env denv (c1', c2')
adamc@88 2046 in
adamc@88 2047 checkKind env c1' k1 (L'.KRecord (kunif loc), loc);
adamc@88 2048 checkKind env c2' k2 (L'.KRecord (kunif loc), loc);
adamc@88 2049
adamc@628 2050 ([(L'.SgiConstraint (c1', c2'), loc)], (env, denv, gs1 @ gs2))
adamc@76 2051 end
adamc@31 2052
adamc@563 2053 | L.SgiClassAbs (x, k) =>
adamc@211 2054 let
adamc@623 2055 val k = elabKind env k
adamc@563 2056 val k' = (L'.KArrow (k, (L'.KType, loc)), loc)
adamc@563 2057 val (env, n) = E.pushCNamed env x k' NONE
adamc@211 2058 val env = E.pushClass env n
adamc@211 2059 in
adamc@563 2060 ([(L'.SgiClassAbs (x, n, k), loc)], (env, denv, []))
adamc@211 2061 end
adamc@211 2062
adamc@563 2063 | L.SgiClass (x, k, c) =>
adamc@211 2064 let
adamc@623 2065 val k = elabKind env k
adamc@563 2066 val k' = (L'.KArrow (k, (L'.KType, loc)), loc)
adamc@211 2067 val (c', ck, gs) = elabCon (env, denv) c
adamc@563 2068 val (env, n) = E.pushCNamed env x k' (SOME c')
adamc@211 2069 val env = E.pushClass env n
adamc@211 2070 in
adamc@563 2071 checkKind env c' ck k';
adamc@563 2072 ([(L'.SgiClass (x, n, k, c'), loc)], (env, denv, []))
adamc@211 2073 end
adamc@211 2074
adamc@83 2075 and elabSgn (env, denv) (sgn, loc) =
adamc@31 2076 case sgn of
adamc@31 2077 L.SgnConst sgis =>
adamc@31 2078 let
adamc@88 2079 val (sgis', (_, _, gs)) = ListUtil.foldlMapConcat elabSgn_item (env, denv, []) sgis
adamc@62 2080
adamc@62 2081 val _ = foldl (fn ((sgi, loc), (cons, vals, sgns, strs)) =>
adamc@62 2082 case sgi of
adamc@62 2083 L'.SgiConAbs (x, _, _) =>
adamc@62 2084 (if SS.member (cons, x) then
adamc@62 2085 sgnError env (DuplicateCon (loc, x))
adamc@62 2086 else
adamc@62 2087 ();
adamc@62 2088 (SS.add (cons, x), vals, sgns, strs))
adamc@62 2089 | L'.SgiCon (x, _, _, _) =>
adamc@62 2090 (if SS.member (cons, x) then
adamc@62 2091 sgnError env (DuplicateCon (loc, x))
adamc@62 2092 else
adamc@62 2093 ();
adamc@62 2094 (SS.add (cons, x), vals, sgns, strs))
adamc@191 2095 | L'.SgiDatatype (x, _, _, xncs) =>
adamc@156 2096 let
adamc@156 2097 val vals = foldl (fn ((x, _, _), vals) =>
adamc@156 2098 (if SS.member (vals, x) then
adamc@156 2099 sgnError env (DuplicateVal (loc, x))
adamc@156 2100 else
adamc@156 2101 ();
adamc@156 2102 SS.add (vals, x)))
adamc@156 2103 vals xncs
adamc@156 2104 in
adamc@156 2105 if SS.member (cons, x) then
adamc@156 2106 sgnError env (DuplicateCon (loc, x))
adamc@156 2107 else
adamc@156 2108 ();
adamc@156 2109 (SS.add (cons, x), vals, sgns, strs)
adamc@156 2110 end
adamc@191 2111 | L'.SgiDatatypeImp (x, _, _, _, _, _, _) =>
adamc@156 2112 (if SS.member (cons, x) then
adamc@156 2113 sgnError env (DuplicateCon (loc, x))
adamc@156 2114 else
adamc@156 2115 ();
adamc@156 2116 (SS.add (cons, x), vals, sgns, strs))
adamc@62 2117 | L'.SgiVal (x, _, _) =>
adamc@62 2118 (if SS.member (vals, x) then
adamc@62 2119 sgnError env (DuplicateVal (loc, x))
adamc@62 2120 else
adamc@62 2121 ();
adamc@62 2122 (cons, SS.add (vals, x), sgns, strs))
adamc@62 2123 | L'.SgiSgn (x, _, _) =>
adamc@62 2124 (if SS.member (sgns, x) then
adamc@62 2125 sgnError env (DuplicateSgn (loc, x))
adamc@62 2126 else
adamc@62 2127 ();
adamc@62 2128 (cons, vals, SS.add (sgns, x), strs))
adamc@62 2129 | L'.SgiStr (x, _, _) =>
adamc@62 2130 (if SS.member (strs, x) then
adamc@62 2131 sgnError env (DuplicateStr (loc, x))
adamc@62 2132 else
adamc@62 2133 ();
adamc@88 2134 (cons, vals, sgns, SS.add (strs, x)))
adamc@203 2135 | L'.SgiConstraint _ => (cons, vals, sgns, strs)
adamc@563 2136 | L'.SgiClassAbs (x, _, _) =>
adamc@211 2137 (if SS.member (cons, x) then
adamc@211 2138 sgnError env (DuplicateCon (loc, x))
adamc@211 2139 else
adamc@211 2140 ();
adamc@211 2141 (SS.add (cons, x), vals, sgns, strs))
adamc@563 2142 | L'.SgiClass (x, _, _, _) =>
adamc@211 2143 (if SS.member (cons, x) then
adamc@211 2144 sgnError env (DuplicateCon (loc, x))
adamc@211 2145 else
adamc@211 2146 ();
adamc@460 2147 (SS.add (cons, x), vals, sgns, strs)))
adamc@62 2148 (SS.empty, SS.empty, SS.empty, SS.empty) sgis'
adamc@31 2149 in
adamc@83 2150 ((L'.SgnConst sgis', loc), gs)
adamc@31 2151 end
adamc@31 2152 | L.SgnVar x =>
adamc@31 2153 (case E.lookupSgn env x of
adamc@31 2154 NONE =>
adamc@31 2155 (sgnError env (UnboundSgn (loc, x));
adamc@83 2156 ((L'.SgnError, loc), []))
adamc@83 2157 | SOME (n, sgis) => ((L'.SgnVar n, loc), []))
adamc@41 2158 | L.SgnFun (m, dom, ran) =>
adamc@41 2159 let
adamc@83 2160 val (dom', gs1) = elabSgn (env, denv) dom
adamc@41 2161 val (env', n) = E.pushStrNamed env m dom'
adamc@469 2162 val denv' = dopenConstraints (loc, env', denv) {str = m, strs = []}
adamc@469 2163 val (ran', gs2) = elabSgn (env', denv') ran
adamc@41 2164 in
adamc@83 2165 ((L'.SgnFun (m, n, dom', ran'), loc), gs1 @ gs2)
adamc@41 2166 end
adamc@42 2167 | L.SgnWhere (sgn, x, c) =>
adamc@42 2168 let
adamc@83 2169 val (sgn', ds1) = elabSgn (env, denv) sgn
adamc@83 2170 val (c', ck, ds2) = elabCon (env, denv) c
adamc@42 2171 in
adamc@42 2172 case #1 (hnormSgn env sgn') of
adamc@83 2173 L'.SgnError => (sgnerror, [])
adamc@42 2174 | L'.SgnConst sgis =>
adamc@75 2175 if List.exists (fn (L'.SgiConAbs (x', _, k), _) =>
adamc@75 2176 x' = x andalso
adamc@623 2177 (unifyKinds env k ck
adamc@75 2178 handle KUnify x => sgnError env (WhereWrongKind x);
adamc@42 2179 true)
adamc@42 2180 | _ => false) sgis then
adamc@83 2181 ((L'.SgnWhere (sgn', x, c'), loc), ds1 @ ds2)
adamc@42 2182 else
adamc@42 2183 (sgnError env (UnWhereable (sgn', x));
adamc@83 2184 (sgnerror, []))
adamc@42 2185 | _ => (sgnError env (UnWhereable (sgn', x));
adamc@83 2186 (sgnerror, []))
adamc@42 2187 end
adamc@59 2188 | L.SgnProj (m, ms, x) =>
adamc@59 2189 (case E.lookupStr env m of
adamc@59 2190 NONE => (strError env (UnboundStr (loc, m));
adamc@83 2191 (sgnerror, []))
adamc@59 2192 | SOME (n, sgn) =>
adamc@59 2193 let
adamc@59 2194 val (str, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@59 2195 case E.projectStr env {sgn = sgn, str = str, field = m} of
adamc@59 2196 NONE => (strError env (UnboundStr (loc, m));
adamc@59 2197 (strerror, sgnerror))
adamc@59 2198 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@59 2199 ((L'.StrVar n, loc), sgn) ms
adamc@59 2200 in
adamc@59 2201 case E.projectSgn env {sgn = sgn, str = str, field = x} of
adamc@59 2202 NONE => (sgnError env (UnboundSgn (loc, x));
adamc@83 2203 (sgnerror, []))
adamc@83 2204 | SOME _ => ((L'.SgnProj (n, ms, x), loc), [])
adamc@59 2205 end)
adamc@59 2206
adamc@31 2207
adamc@66 2208 fun selfify env {str, strs, sgn} =
adamc@66 2209 case #1 (hnormSgn env sgn) of
adamc@66 2210 L'.SgnError => sgn
adamc@66 2211 | L'.SgnVar _ => sgn
adamc@66 2212
adamc@66 2213 | L'.SgnConst sgis =>
adamc@66 2214 (L'.SgnConst (map (fn (L'.SgiConAbs (x, n, k), loc) =>
adamc@66 2215 (L'.SgiCon (x, n, k, (L'.CModProj (str, strs, x), loc)), loc)
adamc@191 2216 | (L'.SgiDatatype (x, n, xs, xncs), loc) =>
adamc@191 2217 (L'.SgiDatatypeImp (x, n, str, strs, x, xs, xncs), loc)
adamc@563 2218 | (L'.SgiClassAbs (x, n, k), loc) =>
adamc@563 2219 (L'.SgiClass (x, n, k, (L'.CModProj (str, strs, x), loc)), loc)
adamc@66 2220 | (L'.SgiStr (x, n, sgn), loc) =>
adamc@66 2221 (L'.SgiStr (x, n, selfify env {str = str, strs = strs @ [x], sgn = sgn}), loc)
adamc@66 2222 | x => x) sgis), #2 sgn)
adamc@66 2223 | L'.SgnFun _ => sgn
adamc@66 2224 | L'.SgnWhere _ => sgn
adamc@66 2225 | L'.SgnProj (m, ms, x) =>
adamc@66 2226 case E.projectSgn env {str = foldl (fn (m, str) => (L'.StrProj (str, m), #2 sgn))
adamc@66 2227 (L'.StrVar m, #2 sgn) ms,
adamc@66 2228 sgn = #2 (E.lookupStrNamed env m),
adamc@66 2229 field = x} of
adamc@66 2230 NONE => raise Fail "Elaborate.selfify: projectSgn returns NONE"
adamc@66 2231 | SOME sgn => selfify env {str = str, strs = strs, sgn = sgn}
adamc@66 2232
adamc@66 2233 fun selfifyAt env {str, sgn} =
adamc@66 2234 let
adamc@66 2235 fun self (str, _) =
adamc@66 2236 case str of
adamc@66 2237 L'.StrVar x => SOME (x, [])
adamc@66 2238 | L'.StrProj (str, x) =>
adamc@66 2239 (case self str of
adamc@66 2240 NONE => NONE
adamc@66 2241 | SOME (m, ms) => SOME (m, ms @ [x]))
adamc@66 2242 | _ => NONE
adamc@66 2243 in
adamc@66 2244 case self str of
adamc@66 2245 NONE => sgn
adamc@66 2246 | SOME (str, strs) => selfify env {sgn = sgn, str = str, strs = strs}
adamc@66 2247 end
adamc@66 2248
adamc@628 2249 fun dopen env {str, strs, sgn} =
adamc@66 2250 let
adamc@66 2251 val m = foldl (fn (m, str) => (L'.StrProj (str, m), #2 sgn))
adamc@66 2252 (L'.StrVar str, #2 sgn) strs
adamc@66 2253 in
adamc@66 2254 case #1 (hnormSgn env sgn) of
adamc@66 2255 L'.SgnConst sgis =>
adamc@628 2256 ListUtil.foldlMap (fn ((sgi, loc), env') =>
adamc@162 2257 let
adamc@162 2258 val d =
adamc@162 2259 case sgi of
adamc@162 2260 L'.SgiConAbs (x, n, k) =>
adamc@162 2261 let
adamc@162 2262 val c = (L'.CModProj (str, strs, x), loc)
adamc@162 2263 in
adamc@162 2264 (L'.DCon (x, n, k, c), loc)
adamc@162 2265 end
adamc@162 2266 | L'.SgiCon (x, n, k, c) =>
adamc@162 2267 (L'.DCon (x, n, k, (L'.CModProj (str, strs, x), loc)), loc)
adamc@191 2268 | L'.SgiDatatype (x, n, xs, xncs) =>
adamc@191 2269 (L'.DDatatypeImp (x, n, str, strs, x, xs, xncs), loc)
adamc@191 2270 | L'.SgiDatatypeImp (x, n, m1, ms, x', xs, xncs) =>
adamc@191 2271 (L'.DDatatypeImp (x, n, m1, ms, x', xs, xncs), loc)
adamc@162 2272 | L'.SgiVal (x, n, t) =>
adamc@162 2273 (L'.DVal (x, n, t, (L'.EModProj (str, strs, x), loc)), loc)
adamc@162 2274 | L'.SgiStr (x, n, sgn) =>
adamc@162 2275 (L'.DStr (x, n, sgn, (L'.StrProj (m, x), loc)), loc)
adamc@162 2276 | L'.SgiSgn (x, n, sgn) =>
adamc@162 2277 (L'.DSgn (x, n, (L'.SgnProj (str, strs, x), loc)), loc)
adamc@162 2278 | L'.SgiConstraint (c1, c2) =>
adamc@162 2279 (L'.DConstraint (c1, c2), loc)
adamc@563 2280 | L'.SgiClassAbs (x, n, k) =>
adamc@211 2281 let
adamc@563 2282 val k' = (L'.KArrow (k, (L'.KType, loc)), loc)
adamc@211 2283 val c = (L'.CModProj (str, strs, x), loc)
adamc@211 2284 in
adamc@563 2285 (L'.DCon (x, n, k', c), loc)
adamc@211 2286 end
adamc@563 2287 | L'.SgiClass (x, n, k, _) =>
adamc@211 2288 let
adamc@563 2289 val k' = (L'.KArrow (k, (L'.KType, loc)), loc)
adamc@211 2290 val c = (L'.CModProj (str, strs, x), loc)
adamc@211 2291 in
adamc@563 2292 (L'.DCon (x, n, k', c), loc)
adamc@211 2293 end
adamc@162 2294 in
adamc@628 2295 (d, E.declBinds env' d)
adamc@162 2296 end)
adamc@628 2297 env sgis
adamc@66 2298 | _ => (strError env (UnOpenable sgn);
adamc@628 2299 ([], env))
adamc@66 2300 end
adamc@66 2301
adamc@31 2302 fun sgiOfDecl (d, loc) =
adamc@31 2303 case d of
adamc@123 2304 L'.DCon (x, n, k, c) => [(L'.SgiCon (x, n, k, c), loc)]
adamc@156 2305 | L'.DDatatype x => [(L'.SgiDatatype x, loc)]
adamc@156 2306 | L'.DDatatypeImp x => [(L'.SgiDatatypeImp x, loc)]
adamc@123 2307 | L'.DVal (x, n, t, _) => [(L'.SgiVal (x, n, t), loc)]
adamc@123 2308 | L'.DValRec vis => map (fn (x, n, t, _) => (L'.SgiVal (x, n, t), loc)) vis
adamc@123 2309 | L'.DSgn (x, n, sgn) => [(L'.SgiSgn (x, n, sgn), loc)]
adamc@123 2310 | L'.DStr (x, n, sgn, _) => [(L'.SgiStr (x, n, sgn), loc)]
adamc@123 2311 | L'.DFfiStr (x, n, sgn) => [(L'.SgiStr (x, n, sgn), loc)]
adamc@123 2312 | L'.DConstraint cs => [(L'.SgiConstraint cs, loc)]
adamc@123 2313 | L'.DExport _ => []
adamc@460 2314 | L'.DTable (tn, x, n, c) => [(L'.SgiVal (x, n, (L'.CApp (tableOf (), c), loc)), loc)]
adamc@460 2315 | L'.DSequence (tn, x, n) => [(L'.SgiVal (x, n, sequenceOf ()), loc)]
adamc@563 2316 | L'.DClass (x, n, k, c) => [(L'.SgiClass (x, n, k, c), loc)]
adamc@271 2317 | L'.DDatabase _ => []
adamc@460 2318 | L'.DCookie (tn, x, n, c) => [(L'.SgiVal (x, n, (L'.CApp (cookieOf (), c), loc)), loc)]
adamc@88 2319
adamc@628 2320 fun subSgn env sgn1 (sgn2 as (_, loc2)) =
adamc@469 2321 ((*prefaces "subSgn" [("sgn1", p_sgn env sgn1),
adamc@469 2322 ("sgn2", p_sgn env sgn2)];*)
adamc@35 2323 case (#1 (hnormSgn env sgn1), #1 (hnormSgn env sgn2)) of
adamc@31 2324 (L'.SgnError, _) => ()
adamc@31 2325 | (_, L'.SgnError) => ()
adamc@31 2326
adamc@31 2327 | (L'.SgnConst sgis1, L'.SgnConst sgis2) =>
adamc@31 2328 let
adamc@362 2329 (*val () = prefaces "subSgn" [("sgn1", p_sgn env sgn1),
adamc@362 2330 ("sgn2", p_sgn env sgn2),
adamc@362 2331 ("sgis1", p_sgn env (L'.SgnConst sgis1, loc2)),
adamc@362 2332 ("sgis2", p_sgn env (L'.SgnConst sgis2, loc2))]*)
adamc@362 2333
adamc@628 2334 fun folder (sgi2All as (sgi, loc), env) =
adamc@31 2335 let
adamc@362 2336 (*val () = prefaces "folder" [("sgis1", p_sgn env (L'.SgnConst sgis1, loc2))]*)
adamc@362 2337
adamc@31 2338 fun seek p =
adamc@31 2339 let
adamc@628 2340 fun seek env ls =
adamc@31 2341 case ls of
adamc@31 2342 [] => (sgnError env (UnmatchedSgi sgi2All);
adamc@628 2343 env)
adamc@31 2344 | h :: t =>
adamc@469 2345 case p (env, h) of
adamc@469 2346 NONE =>
adamc@469 2347 let
adamc@469 2348 val env = case #1 h of
adamc@469 2349 L'.SgiCon (x, n, k, c) =>
adamc@471 2350 if E.checkENamed env n then
adamc@471 2351 env
adamc@471 2352 else
adamc@471 2353 E.pushCNamedAs env x n k (SOME c)
adamc@469 2354 | L'.SgiConAbs (x, n, k) =>
adamc@471 2355 if E.checkENamed env n then
adamc@471 2356 env
adamc@471 2357 else
adamc@471 2358 E.pushCNamedAs env x n k NONE
adamc@469 2359 | _ => env
adamc@469 2360 in
adamc@628 2361 seek (E.sgiBinds env h) t
adamc@469 2362 end
adamc@88 2363 | SOME envs => envs
adamc@31 2364 in
adamc@628 2365 seek env sgis1
adamc@31 2366 end
adamc@31 2367 in
adamc@31 2368 case sgi of
adamc@31 2369 L'.SgiConAbs (x, n2, k2) =>
adamc@469 2370 seek (fn (env, sgi1All as (sgi1, _)) =>
adamc@31 2371 let
adamc@41 2372 fun found (x', n1, k1, co1) =
adamc@41 2373 if x = x' then
adamc@41 2374 let
adamc@623 2375 val () = unifyKinds env k1 k2
adamc@41 2376 handle KUnify (k1, k2, err) =>
adamc@41 2377 sgnError env (SgiWrongKind (sgi1All, k1, sgi2All, k2, err))
adamc@41 2378 val env = E.pushCNamedAs env x n1 k1 co1
adamc@41 2379 in
adamc@41 2380 SOME (if n1 = n2 then
adamc@41 2381 env
adamc@41 2382 else
adamc@628 2383 E.pushCNamedAs env x n2 k2 (SOME (L'.CNamed n1, loc2)))
adamc@41 2384 end
adamc@41 2385 else
adamc@41 2386 NONE
adamc@31 2387 in
adamc@31 2388 case sgi1 of
adamc@41 2389 L'.SgiConAbs (x', n1, k1) => found (x', n1, k1, NONE)
adamc@41 2390 | L'.SgiCon (x', n1, k1, c1) => found (x', n1, k1, SOME c1)
adamc@191 2391 | L'.SgiDatatype (x', n1, xs, _) =>
adamc@191 2392 let
adamc@191 2393 val k = (L'.KType, loc)
adamc@191 2394 val k' = foldl (fn (_, k') => (L'.KArrow (k, k'), loc)) k xs
adamc@191 2395 in
adamc@191 2396 found (x', n1, k', NONE)
adamc@191 2397 end
adamc@191 2398 | L'.SgiDatatypeImp (x', n1, m1, ms, s, xs, _) =>
adamc@191 2399 let
adamc@191 2400 val k = (L'.KType, loc)
adamc@191 2401 val k' = foldl (fn (_, k') => (L'.KArrow (k, k'), loc)) k xs
adamc@191 2402 in
adamc@191 2403 found (x', n1, k', SOME (L'.CModProj (m1, ms, s), loc))
adamc@191 2404 end
adamc@563 2405 | L'.SgiClassAbs (x', n1, k) => found (x', n1,
adamc@563 2406 (L'.KArrow (k,
adamc@563 2407 (L'.KType, loc)), loc),
adamc@563 2408 NONE)
adamc@563 2409 | L'.SgiClass (x', n1, k, c) => found (x', n1,
adamc@563 2410 (L'.KArrow (k,
adamc@563 2411 (L'.KType, loc)), loc),
adamc@563 2412 SOME c)
adamc@31 2413 | _ => NONE
adamc@31 2414 end)
adamc@31 2415
adamc@31 2416 | L'.SgiCon (x, n2, k2, c2) =>
adamc@469 2417 seek (fn (env, sgi1All as (sgi1, _)) =>
adamc@211 2418 let
adamc@211 2419 fun found (x', n1, k1, c1) =
adamc@211 2420 if x = x' then
adamc@211 2421 let
adamc@327 2422 fun good () =
adamc@327 2423 let
adamc@327 2424 val env = E.pushCNamedAs env x n2 k2 (SOME c2)
adamc@327 2425 val env = if n1 = n2 then
adamc@327 2426 env
adamc@327 2427 else
adamc@327 2428 E.pushCNamedAs env x n1 k1 (SOME c1)
adamc@327 2429 in
adamc@628 2430 SOME env
adamc@327 2431 end
adamc@211 2432 in
adamc@628 2433 (unifyCons env c1 c2;
adamc@628 2434 good ())
adamc@211 2435 handle CUnify (c1, c2, err) =>
adamc@211 2436 (sgnError env (SgiWrongCon (sgi1All, c1, sgi2All, c2, err));
adamc@211 2437 good ())
adamc@211 2438 end
adamc@211 2439 else
adamc@211 2440 NONE
adamc@211 2441 in
adamc@211 2442 case sgi1 of
adamc@211 2443 L'.SgiCon (x', n1, k1, c1) => found (x', n1, k1, c1)
adamc@563 2444 | L'.SgiClass (x', n1, k1, c1) =>
adamc@563 2445 found (x', n1, (L'.KArrow (k1, (L'.KType, loc)), loc), c1)
adamc@211 2446 | _ => NONE
adamc@211 2447 end)
adamc@31 2448
adamc@191 2449 | L'.SgiDatatype (x, n2, xs2, xncs2) =>
adamc@469 2450 seek (fn (env, sgi1All as (sgi1, _)) =>
adamc@160 2451 let
adamc@191 2452 fun found (n1, xs1, xncs1) =
adamc@160 2453 let
adamc@160 2454 fun mismatched ue =
adamc@160 2455 (sgnError env (SgiMismatchedDatatypes (sgi1All, sgi2All, ue));
adamc@628 2456 SOME env)
adamc@156 2457
adamc@191 2458 val k = (L'.KType, loc)
adamc@191 2459 val k' = foldl (fn (_, k') => (L'.KArrow (k, k'), loc)) k xs1
adamc@191 2460
adamc@160 2461 fun good () =
adamc@160 2462 let
adamc@471 2463 val env = E.sgiBinds env sgi1All
adamc@160 2464 val env = if n1 = n2 then
adamc@160 2465 env
adamc@160 2466 else
adamc@471 2467 E.pushCNamedAs env x n2 k'
adamc@471 2468 (SOME (L'.CNamed n1, loc))
adamc@160 2469 in
adamc@628 2470 SOME env
adamc@160 2471 end
adamc@156 2472
adamc@397 2473 val env = E.pushCNamedAs env x n1 k' NONE
adamc@397 2474 val env = if n1 = n2 then
adamc@397 2475 env
adamc@397 2476 else
adamc@397 2477 E.pushCNamedAs env x n2 k' (SOME (L'.CNamed n1, loc))
adamc@191 2478 val env = foldl (fn (x, env) => E.pushCRel env x k) env xs1
adamc@160 2479 fun xncBad ((x1, _, t1), (x2, _, t2)) =
adamc@160 2480 String.compare (x1, x2) <> EQUAL
adamc@160 2481 orelse case (t1, t2) of
adamc@160 2482 (NONE, NONE) => false
adamc@160 2483 | (SOME t1, SOME t2) =>
adamc@628 2484 (unifyCons env t1 t2; false)
adamc@160 2485 | _ => true
adamc@160 2486 in
adamc@191 2487 (if xs1 <> xs2
adamc@191 2488 orelse length xncs1 <> length xncs2
adamc@160 2489 orelse ListPair.exists xncBad (xncs1, xncs2) then
adamc@160 2490 mismatched NONE
adamc@160 2491 else
adamc@160 2492 good ())
adamc@160 2493 handle CUnify ue => mismatched (SOME ue)
adamc@160 2494 end
adamc@160 2495 in
adamc@160 2496 case sgi1 of
adamc@191 2497 L'.SgiDatatype (x', n1, xs, xncs1) =>
adamc@160 2498 if x' = x then
adamc@191 2499 found (n1, xs, xncs1)
adamc@160 2500 else
adamc@160 2501 NONE
adamc@191 2502 | L'.SgiDatatypeImp (x', n1, _, _, _, xs, xncs1) =>
adamc@162 2503 if x' = x then
adamc@191 2504 found (n1, xs, xncs1)
adamc@162 2505 else
adamc@162 2506 NONE
adamc@160 2507 | _ => NONE
adamc@160 2508 end)
adamc@156 2509
adamc@191 2510 | L'.SgiDatatypeImp (x, n2, m12, ms2, s2, xs, _) =>
adamc@469 2511 seek (fn (env, sgi1All as (sgi1, _)) =>
adamc@158 2512 case sgi1 of
adamc@191 2513 L'.SgiDatatypeImp (x', n1, m11, ms1, s1, _, _) =>
adamc@158 2514 if x = x' then
adamc@158 2515 let
adamc@158 2516 val k = (L'.KType, loc)
adamc@191 2517 val k' = foldl (fn (_, k') => (L'.KArrow (k, k'), loc)) k xs
adamc@158 2518 val t1 = (L'.CModProj (m11, ms1, s1), loc)
adamc@158 2519 val t2 = (L'.CModProj (m12, ms2, s2), loc)
adamc@158 2520
adamc@158 2521 fun good () =
adamc@158 2522 let
adamc@191 2523 val env = E.pushCNamedAs env x n1 k' (SOME t1)
adamc@191 2524 val env = E.pushCNamedAs env x n2 k' (SOME t2)
adamc@158 2525 in
adamc@628 2526 SOME env
adamc@158 2527 end
adamc@158 2528 in
adamc@628 2529 (unifyCons env t1 t2;
adamc@628 2530 good ())
adamc@158 2531 handle CUnify (c1, c2, err) =>
adamc@158 2532 (sgnError env (SgiWrongCon (sgi1All, c1, sgi2All, c2, err));
adamc@158 2533 good ())
adamc@158 2534 end
adamc@158 2535 else
adamc@158 2536 NONE
adamc@158 2537
adamc@158 2538 | _ => NONE)
adamc@156 2539
adamc@32 2540 | L'.SgiVal (x, n2, c2) =>
adamc@469 2541 seek (fn (env, sgi1All as (sgi1, _)) =>
adamc@32 2542 case sgi1 of
adamc@41 2543 L'.SgiVal (x', n1, c1) =>
adamc@41 2544 if x = x' then
adamc@628 2545 (unifyCons env c1 c2;
adamc@628 2546 SOME env)
adamc@86 2547 handle CUnify (c1, c2, err) =>
adamc@86 2548 (sgnError env (SgiWrongCon (sgi1All, c1, sgi2All, c2, err));
adamc@628 2549 SOME env)
adamc@41 2550 else
adamc@41 2551 NONE
adamc@32 2552 | _ => NONE)
adamc@32 2553
adamc@33 2554 | L'.SgiStr (x, n2, sgn2) =>
adamc@469 2555 seek (fn (env, sgi1All as (sgi1, _)) =>
adamc@33 2556 case sgi1 of
adamc@41 2557 L'.SgiStr (x', n1, sgn1) =>
adamc@41 2558 if x = x' then
adamc@66 2559 let
adamc@628 2560 val () = subSgn env sgn1 sgn2
adamc@66 2561 val env = E.pushStrNamedAs env x n1 sgn1
adamc@66 2562 val env = if n1 = n2 then
adamc@66 2563 env
adamc@66 2564 else
adamc@66 2565 E.pushStrNamedAs env x n2
adamc@66 2566 (selfifyAt env {str = (L'.StrVar n1, #2 sgn2),
adamc@66 2567 sgn = sgn2})
adamc@66 2568 in
adamc@628 2569 SOME env
adamc@66 2570 end
adamc@41 2571 else
adamc@41 2572 NONE
adamc@33 2573 | _ => NONE)
adamc@59 2574
adamc@59 2575 | L'.SgiSgn (x, n2, sgn2) =>
adamc@469 2576 seek (fn (env, sgi1All as (sgi1, _)) =>
adamc@59 2577 case sgi1 of
adamc@59 2578 L'.SgiSgn (x', n1, sgn1) =>
adamc@59 2579 if x = x' then
adamc@65 2580 let
adamc@628 2581 val () = subSgn env sgn1 sgn2
adamc@628 2582 val () = subSgn env sgn2 sgn1
adamc@65 2583
adamc@65 2584 val env = E.pushSgnNamedAs env x n2 sgn2
adamc@65 2585 val env = if n1 = n2 then
adamc@65 2586 env
adamc@65 2587 else
adamc@65 2588 E.pushSgnNamedAs env x n1 sgn2
adamc@65 2589 in
adamc@628 2590 SOME env
adamc@65 2591 end
adamc@59 2592 else
adamc@59 2593 NONE
adamc@59 2594 | _ => NONE)
adamc@88 2595
adamc@88 2596 | L'.SgiConstraint (c2, d2) =>
adamc@469 2597 seek (fn (env, sgi1All as (sgi1, _)) =>
adamc@88 2598 case sgi1 of
adamc@88 2599 L'.SgiConstraint (c1, d1) =>
adamc@628 2600 if consEq env (c1, c2) andalso consEq env (d1, d2) then
adamc@628 2601 SOME env
adamc@88 2602 else
adamc@88 2603 NONE
adamc@88 2604 | _ => NONE)
adamc@203 2605
adamc@563 2606 | L'.SgiClassAbs (x, n2, k2) =>
adamc@469 2607 seek (fn (env, sgi1All as (sgi1, _)) =>
adamc@211 2608 let
adamc@563 2609 fun found (x', n1, k1, co) =
adamc@211 2610 if x = x' then
adamc@211 2611 let
adamc@623 2612 val () = unifyKinds env k1 k2
adamc@563 2613 handle KUnify (k1, k2, err) =>
adamc@563 2614 sgnError env (SgiWrongKind (sgi1All, k1, sgi2All, k2, err))
adamc@563 2615
adamc@563 2616 val k = (L'.KArrow (k1, (L'.KType, loc)), loc)
adamc@211 2617 val env = E.pushCNamedAs env x n1 k co
adamc@211 2618 in
adamc@211 2619 SOME (if n1 = n2 then
adamc@211 2620 env
adamc@211 2621 else
adamc@628 2622 E.pushCNamedAs env x n2 k (SOME (L'.CNamed n1, loc2)))
adamc@211 2623 end
adamc@211 2624 else
adamc@211 2625 NONE
adamc@211 2626 in
adamc@211 2627 case sgi1 of
adamc@563 2628 L'.SgiClassAbs (x', n1, k1) => found (x', n1, k1, NONE)
adamc@563 2629 | L'.SgiClass (x', n1, k1, c) => found (x', n1, k1, SOME c)
adamc@211 2630 | _ => NONE
adamc@211 2631 end)
adamc@563 2632 | L'.SgiClass (x, n2, k2, c2) =>
adamc@469 2633 seek (fn (env, sgi1All as (sgi1, _)) =>
adamc@211 2634 let
adamc@563 2635 val k = (L'.KArrow (k2, (L'.KType, loc)), loc)
adamc@563 2636
adamc@563 2637 fun found (x', n1, k1, c1) =
adamc@211 2638 if x = x' then
adamc@211 2639 let
adamc@623 2640 val () = unifyKinds env k1 k2
adamc@563 2641 handle KUnify (k1, k2, err) =>
adamc@563 2642 sgnError env (SgiWrongKind (sgi1All, k1, sgi2All, k2, err))
adamc@563 2643
adamc@218 2644 fun good () =
adamc@218 2645 let
adamc@218 2646 val env = E.pushCNamedAs env x n2 k (SOME c2)
adamc@218 2647 val env = if n1 = n2 then
adamc@218 2648 env
adamc@218 2649 else
adamc@218 2650 E.pushCNamedAs env x n1 k (SOME c1)
adamc@218 2651 in
adamc@628 2652 SOME env
adamc@218 2653 end
adamc@211 2654 in
adamc@628 2655 (unifyCons env c1 c2;
adamc@628 2656 good ())
adamc@211 2657 handle CUnify (c1, c2, err) =>
adamc@211 2658 (sgnError env (SgiWrongCon (sgi1All, c1, sgi2All, c2, err));
adamc@211 2659 good ())
adamc@211 2660 end
adamc@211 2661 else
adamc@211 2662 NONE
adamc@211 2663 in
adamc@211 2664 case sgi1 of
adamc@563 2665 L'.SgiClass (x', n1, k1, c1) => found (x', n1, k1, c1)
adamc@211 2666 | _ => NONE
adamc@211 2667 end)
adamc@31 2668 end
adamc@31 2669 in
adamc@628 2670 ignore (foldl folder env sgis2)
adamc@31 2671 end
adamc@31 2672
adamc@41 2673 | (L'.SgnFun (m1, n1, dom1, ran1), L'.SgnFun (m2, n2, dom2, ran2)) =>
adamc@43 2674 let
adamc@480 2675 val ran2 =
adamc@43 2676 if n1 = n2 then
adamc@480 2677 ran2
adamc@43 2678 else
adamc@480 2679 subStrInSgn (n2, n1) ran2
adamc@43 2680 in
adamc@628 2681 subSgn env dom2 dom1;
adamc@628 2682 subSgn (E.pushStrNamedAs env m1 n1 dom2) ran1 ran2
adamc@43 2683 end
adamc@41 2684
adamc@469 2685 | _ => sgnError env (SgnWrongForm (sgn1, sgn2)))
adamc@41 2686
adamc@61 2687
adamc@312 2688 fun positive self =
adamc@312 2689 let
adamc@312 2690 open L
adamc@312 2691
adamc@312 2692 fun none (c, _) =
adamc@312 2693 case c of
adamc@312 2694 CAnnot (c, _) => none c
adamc@312 2695
adamc@312 2696 | TFun (c1, c2) => none c1 andalso none c2
adamc@312 2697 | TCFun (_, _, _, c) => none c
adamc@312 2698 | TRecord c => none c
adamc@312 2699
adamc@312 2700 | CVar ([], x) => x <> self
adamc@312 2701 | CVar _ => true
adamc@312 2702 | CApp (c1, c2) => none c1 andalso none c2
adamc@312 2703 | CAbs _ => false
adamc@628 2704 | TDisjoint (c1, c2, c3) => none c1 andalso none c2 andalso none c3
adamc@312 2705
adamc@623 2706 | CKAbs _ => false
adamc@623 2707 | TKFun _ => false
adamc@623 2708
adamc@312 2709 | CName _ => true
adamc@312 2710
adamc@312 2711 | CRecord xcs => List.all (fn (c1, c2) => none c1 andalso none c2) xcs
adamc@312 2712 | CConcat (c1, c2) => none c1 andalso none c2
adamc@621 2713 | CMap => true
adamc@312 2714
adamc@312 2715 | CUnit => true
adamc@312 2716
adamc@312 2717 | CTuple cs => List.all none cs
adamc@312 2718 | CProj (c, _) => none c
adamc@312 2719
adamc@312 2720 | CWild _ => false
adamc@312 2721
adamc@312 2722 fun pos (c, _) =
adamc@312 2723 case c of
adamc@312 2724 CAnnot (c, _) => pos c
adamc@312 2725
adamc@312 2726 | TFun (c1, c2) => none c1 andalso pos c2
adamc@312 2727 | TCFun (_, _, _, c) => pos c
adamc@312 2728 | TRecord c => pos c
adamc@312 2729
adamc@312 2730 | CVar _ => true
adamc@312 2731 | CApp (c1, c2) => pos c1 andalso none c2
adamc@312 2732 | CAbs _ => false
adamc@628 2733 | TDisjoint (c1, c2, c3) => none c1 andalso none c2 andalso none c3
adamc@312 2734
adamc@623 2735 | CKAbs _ => false
adamc@623 2736 | TKFun _ => false
adamc@623 2737
adamc@312 2738 | CName _ => true
adamc@312 2739
adamc@312 2740 | CRecord xcs => List.all (fn (c1, c2) => none c1 andalso pos c2) xcs
adamc@312 2741 | CConcat (c1, c2) => pos c1 andalso pos c2
adamc@621 2742 | CMap => true
adamc@312 2743
adamc@312 2744 | CUnit => true
adamc@312 2745
adamc@312 2746 | CTuple cs => List.all pos cs
adamc@312 2747 | CProj (c, _) => pos c
adamc@312 2748
adamc@312 2749 | CWild _ => false
adamc@312 2750 in
adamc@312 2751 pos
adamc@312 2752 end
adamc@312 2753
adamc@325 2754 fun wildifyStr env (str, sgn) =
adamc@325 2755 case #1 (hnormSgn env sgn) of
adamc@325 2756 L'.SgnConst sgis =>
adamc@325 2757 (case #1 str of
adamc@325 2758 L.StrConst ds =>
adamc@325 2759 let
adamc@493 2760 fun decompileKind (k, loc) =
adamc@493 2761 case k of
adamc@493 2762 L'.KType => SOME (L.KType, loc)
adamc@493 2763 | L'.KArrow (k1, k2) =>
adamc@493 2764 (case (decompileKind k1, decompileKind k2) of
adamc@493 2765 (SOME k1, SOME k2) => SOME (L.KArrow (k1, k2), loc)
adamc@493 2766 | _ => NONE)
adamc@493 2767 | L'.KName => SOME (L.KName, loc)
adamc@493 2768 | L'.KRecord k =>
adamc@493 2769 (case decompileKind k of
adamc@493 2770 SOME k => SOME (L.KRecord k, loc)
adamc@493 2771 | _ => NONE)
adamc@493 2772 | L'.KUnit => SOME (L.KUnit, loc)
adamc@493 2773 | L'.KTuple ks =>
adamc@493 2774 let
adamc@493 2775 val ks' = List.mapPartial decompileKind ks
adamc@493 2776 in
adamc@493 2777 if length ks' = length ks then
adamc@493 2778 SOME (L.KTuple ks', loc)
adamc@493 2779 else
adamc@493 2780 NONE
adamc@493 2781 end
adamc@493 2782
adamc@493 2783 | L'.KError => NONE
adamc@493 2784 | L'.KUnif (_, _, ref (SOME k)) => decompileKind k
adamc@493 2785 | L'.KUnif _ => NONE
adamc@493 2786
adamc@623 2787 | L'.KRel _ => NONE
adamc@623 2788 | L'.KFun _ => NONE
adamc@623 2789
adamc@325 2790 fun decompileCon env (c, loc) =
adamc@325 2791 case c of
adamc@325 2792 L'.CRel i =>
adamc@325 2793 let
adamc@325 2794 val (s, _) = E.lookupCRel env i
adamc@325 2795 in
adamc@325 2796 SOME (L.CVar ([], s), loc)
adamc@325 2797 end
adamc@325 2798 | L'.CNamed i =>
adamc@325 2799 let
adamc@325 2800 val (s, _, _) = E.lookupCNamed env i
adamc@325 2801 in
adamc@325 2802 SOME (L.CVar ([], s), loc)
adamc@325 2803 end
adamc@325 2804 | L'.CModProj (m1, ms, x) =>
adamc@325 2805 let
adamc@325 2806 val (s, _) = E.lookupStrNamed env m1
adamc@325 2807 in
adamc@325 2808 SOME (L.CVar (s :: ms, x), loc)
adamc@325 2809 end
adamc@325 2810 | L'.CName s => SOME (L.CName s, loc)
adamc@325 2811 | L'.CRecord (_, xcs) =>
adamc@325 2812 let
adamc@325 2813 fun fields xcs =
adamc@325 2814 case xcs of
adamc@325 2815 [] => SOME []
adamc@325 2816 | (x, t) :: xcs =>
adamc@325 2817 case (decompileCon env x, decompileCon env t, fields xcs) of
adamc@325 2818 (SOME x, SOME t, SOME xcs) => SOME ((x, t) :: xcs)
adamc@325 2819 | _ => NONE
adamc@325 2820 in
adamc@325 2821 Option.map (fn xcs => (L.CRecord xcs, loc))
adamc@325 2822 (fields xcs)
adamc@325 2823 end
adamc@325 2824 | L'.CConcat (c1, c2) =>
adamc@325 2825 (case (decompileCon env c1, decompileCon env c2) of
adamc@325 2826 (SOME c1, SOME c2) => SOME (L.CConcat (c1, c2), loc)
adamc@325 2827 | _ => NONE)
adamc@325 2828 | L'.CUnit => SOME (L.CUnit, loc)
adamc@325 2829
adamc@325 2830 | _ => NONE
adamc@325 2831
adamc@469 2832 val (neededC, constraints, neededV, _) =
adamc@469 2833 foldl (fn ((sgi, loc), (neededC, constraints, neededV, env')) =>
adamc@325 2834 let
adamc@469 2835 val (needed, constraints, neededV) =
adamc@325 2836 case sgi of
adamc@493 2837 L'.SgiConAbs (x, _, k) => (SM.insert (neededC, x, k), constraints, neededV)
adamc@469 2838 | L'.SgiConstraint cs => (neededC, (env', cs, loc) :: constraints, neededV)
adamc@469 2839
adamc@469 2840 | L'.SgiVal (x, _, t) =>
adamc@469 2841 let
adamc@469 2842 fun default () = (neededC, constraints, neededV)
adamc@469 2843
adamc@469 2844 val t = normClassConstraint env' t
adamc@469 2845 in
adamc@469 2846 case #1 t of
adamc@469 2847 L'.CApp (f, _) =>
adamc@634 2848 if isClassOrFolder env' f then
adamc@469 2849 (neededC, constraints, SS.add (neededV, x))
adamc@469 2850 else
adamc@469 2851 default ()
adamc@469 2852 | _ => default ()
adamc@469 2853 end
adamc@469 2854
adamc@469 2855 | _ => (neededC, constraints, neededV)
adamc@325 2856 in
adamc@469 2857 (needed, constraints, neededV, E.sgiBinds env' (sgi, loc))
adamc@325 2858 end)
adamc@493 2859 (SM.empty, [], SS.empty, env) sgis
adamc@325 2860
adamc@634 2861 val (neededC, neededV) =
adamc@634 2862 foldl (fn ((d, _), needed as (neededC, neededV)) =>
adamc@634 2863 case d of
adamc@634 2864 L.DCon (x, _, _) => ((#1 (SM.remove (neededC, x)), neededV)
adamc@634 2865 handle NotFound =>
adamc@634 2866 needed)
adamc@634 2867 | L.DClass (x, _, _) => ((#1 (SM.remove (neededC, x)), neededV)
adamc@634 2868 handle NotFound => needed)
adamc@634 2869 | L.DVal (x, _, _) => ((neededC, SS.delete (neededV, x))
adamc@634 2870 handle NotFound => needed)
adamc@634 2871 | L.DOpen _ => (SM.empty, SS.empty)
adamc@634 2872 | _ => needed)
adamc@634 2873 (neededC, neededV) ds
adamc@469 2874
adamc@469 2875 val ds' = List.mapPartial (fn (env', (c1, c2), loc) =>
adamc@325 2876 case (decompileCon env' c1, decompileCon env' c2) of
adamc@325 2877 (SOME c1, SOME c2) =>
adamc@325 2878 SOME (L.DConstraint (c1, c2), loc)
adamc@325 2879 | _ => NONE) constraints
adamc@469 2880
adamc@469 2881 val ds' =
adamc@469 2882 case SS.listItems neededV of
adamc@469 2883 [] => ds'
adamc@469 2884 | xs =>
adamc@469 2885 let
adamc@469 2886 val ewild = (L.EWild, #2 str)
adamc@469 2887 val ds'' = map (fn x => (L.DVal (x, NONE, ewild), #2 str)) xs
adamc@469 2888 in
adamc@469 2889 ds'' @ ds'
adamc@469 2890 end
adamc@469 2891
adamc@469 2892 val ds' =
adamc@493 2893 case SM.listItemsi neededC of
adamc@469 2894 [] => ds'
adamc@469 2895 | xs =>
adamc@469 2896 let
adamc@493 2897 val ds'' = map (fn (x, k) =>
adamc@493 2898 let
adamc@493 2899 val k =
adamc@493 2900 case decompileKind k of
adamc@493 2901 NONE => (L.KWild, #2 str)
adamc@493 2902 | SOME k => k
adamc@493 2903 val cwild = (L.CWild k, #2 str)
adamc@493 2904 in
adamc@493 2905 (L.DCon (x, NONE, cwild), #2 str)
adamc@493 2906 end) xs
adamc@469 2907 in
adamc@469 2908 ds'' @ ds'
adamc@469 2909 end
adamc@325 2910 in
adamc@469 2911 (L.StrConst (ds @ ds'), #2 str)
adamc@325 2912 end
adamc@325 2913 | _ => str)
adamc@325 2914 | _ => str
adamc@325 2915
adamc@628 2916 fun elabDecl (dAll as (d, loc), (env, denv, gs)) =
adamc@255 2917 let
adamc@255 2918 (*val () = preface ("elabDecl", SourcePrint.p_decl (d, loc))*)
adamc@514 2919 (*val befor = Time.now ()*)
adamc@255 2920
adamc@255 2921 val r =
adamc@255 2922 case d of
adamc@255 2923 L.DCon (x, ko, c) =>
adamc@255 2924 let
adamc@255 2925 val k' = case ko of
adamc@255 2926 NONE => kunif loc
adamc@623 2927 | SOME k => elabKind env k
adamc@255 2928
adamc@255 2929 val (c', ck, gs') = elabCon (env, denv) c
adamc@255 2930 val (env', n) = E.pushCNamed env x k' (SOME c')
adamc@255 2931 in
adamc@255 2932 checkKind env c' ck k';
adamc@255 2933
adamc@255 2934 ([(L'.DCon (x, n, k', c'), loc)], (env', denv, enD gs' @ gs))
adamc@255 2935 end
adamc@255 2936 | L.DDatatype (x, xs, xcs) =>
adamc@255 2937 let
adamc@312 2938 val positive = List.all (fn (_, to) =>
adamc@312 2939 case to of
adamc@312 2940 NONE => true
adamc@312 2941 | SOME t => positive x t) xcs
adamc@312 2942
adamc@255 2943 val k = (L'.KType, loc)
adamc@255 2944 val k' = foldl (fn (_, k') => (L'.KArrow (k, k'), loc)) k xs
adamc@255 2945 val (env, n) = E.pushCNamed env x k' NONE
adamc@255 2946 val t = (L'.CNamed n, loc)
adamc@255 2947 val nxs = length xs - 1
adamc@255 2948 val t = ListUtil.foldli (fn (i, _, t) => (L'.CApp (t, (L'.CRel (nxs - i), loc)), loc)) t xs
adamc@255 2949
adamc@255 2950 val (env', denv') = foldl (fn (x, (env', denv')) =>
adamc@255 2951 (E.pushCRel env' x k,
adamc@255 2952 D.enter denv')) (env, denv) xs
adamc@255 2953
adamc@255 2954 val (xcs, (used, env, gs')) =
adamc@255 2955 ListUtil.foldlMap
adamc@255 2956 (fn ((x, to), (used, env, gs)) =>
adamc@255 2957 let
adamc@255 2958 val (to, t, gs') = case to of
adamc@255 2959 NONE => (NONE, t, gs)
adamc@255 2960 | SOME t' =>
adamc@255 2961 let
adamc@255 2962 val (t', tk, gs') = elabCon (env', denv') t'
adamc@255 2963 in
adamc@255 2964 checkKind env' t' tk k;
adamc@255 2965 (SOME t', (L'.TFun (t', t), loc), enD gs' @ gs)
adamc@255 2966 end
adamc@255 2967 val t = foldr (fn (x, t) => (L'.TCFun (L'.Implicit, x, k, t), loc)) t xs
adamc@255 2968
adamc@255 2969 val (env, n') = E.pushENamed env x t
adamc@255 2970 in
adamc@255 2971 if SS.member (used, x) then
adamc@255 2972 strError env (DuplicateConstructor (x, loc))
adamc@255 2973 else
adamc@255 2974 ();
adamc@255 2975 ((x, n', to), (SS.add (used, x), env, gs'))
adamc@255 2976 end)
adamc@255 2977 (SS.empty, env, []) xcs
adamc@255 2978
adamc@255 2979 val env = E.pushDatatype env n xs xcs
adamc@312 2980 val d' = (L'.DDatatype (x, n, xs, xcs), loc)
adamc@255 2981 in
adamc@601 2982 (*if positive then
adamc@312 2983 ()
adamc@312 2984 else
adamc@601 2985 declError env (Nonpositive d');*)
adamc@312 2986
adamc@312 2987 ([d'], (env, denv, gs' @ gs))
adamc@255 2988 end
adamc@255 2989
adamc@255 2990 | L.DDatatypeImp (_, [], _) => raise Fail "Empty DDatatypeImp"
adamc@255 2991
adamc@255 2992 | L.DDatatypeImp (x, m1 :: ms, s) =>
adamc@255 2993 (case E.lookupStr env m1 of
adamc@255 2994 NONE => (expError env (UnboundStrInExp (loc, m1));
adamc@255 2995 ([], (env, denv, gs)))
adamc@255 2996 | SOME (n, sgn) =>
adamc@255 2997 let
adamc@255 2998 val (str, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@255 2999 case E.projectStr env {sgn = sgn, str = str, field = m} of
adamc@255 3000 NONE => (conError env (UnboundStrInCon (loc, m));
adamc@255 3001 (strerror, sgnerror))
adamc@255 3002 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@255 3003 ((L'.StrVar n, loc), sgn) ms
adamc@255 3004 in
adamc@628 3005 case hnormCon env (L'.CModProj (n, ms, s), loc) of
adamc@628 3006 (L'.CModProj (n, ms, s), _) =>
adamc@255 3007 (case E.projectDatatype env {sgn = sgn, str = str, field = s} of
adamc@255 3008 NONE => (conError env (UnboundDatatype (loc, s));
adamc@255 3009 ([], (env, denv, gs)))
adamc@255 3010 | SOME (xs, xncs) =>
adamc@255 3011 let
adamc@255 3012 val k = (L'.KType, loc)
adamc@255 3013 val k' = foldl (fn (_, k') => (L'.KArrow (k, k'), loc)) k xs
adamc@255 3014 val t = (L'.CModProj (n, ms, s), loc)
adamc@255 3015 val (env, n') = E.pushCNamed env x k' (SOME t)
adamc@255 3016 val env = E.pushDatatype env n' xs xncs
adamc@255 3017
adamc@255 3018 val t = (L'.CNamed n', loc)
adamc@255 3019 val env = foldl (fn ((x, n, to), env) =>
adamc@255 3020 let
adamc@255 3021 val t = case to of
adamc@255 3022 NONE => t
adamc@255 3023 | SOME t' => (L'.TFun (t', t), loc)
adamc@255 3024
adamc@255 3025 val t = foldr (fn (x, t) =>
adamc@255 3026 (L'.TCFun (L'.Implicit, x, k, t), loc))
adamc@255 3027 t xs
adamc@255 3028 in
adamc@255 3029 E.pushENamedAs env x n t
adamc@255 3030 end) env xncs
adamc@255 3031 in
adamc@628 3032 ([(L'.DDatatypeImp (x, n', n, ms, s, xs, xncs), loc)], (env, denv, gs))
adamc@255 3033 end)
adamc@255 3034 | _ => (strError env (NotDatatype loc);
adamc@255 3035 ([], (env, denv, [])))
adamc@255 3036 end)
adamc@255 3037
adamc@255 3038 | L.DVal (x, co, e) =>
adamc@255 3039 let
adamc@255 3040 val (c', _, gs1) = case co of
adamc@255 3041 NONE => (cunif (loc, ktype), ktype, [])
adamc@255 3042 | SOME c => elabCon (env, denv) c
adamc@255 3043
adamc@255 3044 val (e', et, gs2) = elabExp (env, denv) e
adamc@629 3045
adamc@629 3046 val () = checkCon env e' et c'
adamc@629 3047
adamc@467 3048 val c = normClassConstraint env c'
adamc@255 3049 val (env', n) = E.pushENamed env x c'
adamc@255 3050 in
adamc@255 3051 (*prefaces "DVal" [("x", Print.PD.string x),
adamc@362 3052 ("c'", p_con env c')];*)
adamc@628 3053 ([(L'.DVal (x, n, c', e'), loc)], (env', denv, enD gs1 @ gs2 @ gs))
adamc@255 3054 end
adamc@255 3055 | L.DValRec vis =>
adamc@255 3056 let
adamc@255 3057 fun allowable (e, _) =
adamc@255 3058 case e of
adamc@255 3059 L.EAbs _ => true
adamc@255 3060 | L.ECAbs (_, _, _, e) => allowable e
adamc@623 3061 | L.EKAbs (_, e) => allowable e
adamc@255 3062 | L.EDisjoint (_, _, e) => allowable e
adamc@255 3063 | _ => false
adamc@255 3064
adamc@255 3065 val (vis, gs) = ListUtil.foldlMap
adamc@255 3066 (fn ((x, co, e), gs) =>
adamc@255 3067 let
adamc@255 3068 val (c', _, gs1) = case co of
adamc@255 3069 NONE => (cunif (loc, ktype), ktype, [])
adamc@255 3070 | SOME c => elabCon (env, denv) c
adamc@255 3071 in
adamc@255 3072 ((x, c', e), enD gs1 @ gs)
adamc@280 3073 end) gs vis
adamc@255 3074
adamc@255 3075 val (vis, env) = ListUtil.foldlMap (fn ((x, c', e), env) =>
adamc@255 3076 let
adamc@255 3077 val (env, n) = E.pushENamed env x c'
adamc@255 3078 in
adamc@255 3079 ((x, n, c', e), env)
adamc@255 3080 end) env vis
adamc@255 3081
adamc@255 3082 val (vis, gs) = ListUtil.foldlMap (fn ((x, n, c', e), gs) =>
adamc@255 3083 let
adamc@255 3084 val (e', et, gs1) = elabExp (env, denv) e
adamc@255 3085 in
adamc@628 3086 checkCon env e' et c';
adamc@255 3087 if allowable e then
adamc@255 3088 ()
adamc@255 3089 else
adamc@255 3090 expError env (IllegalRec (x, e'));
adamc@628 3091 ((x, n, c', e'), gs1 @ gs)
adamc@255 3092 end) gs vis
adamc@255 3093 in
adamc@255 3094 ([(L'.DValRec vis, loc)], (env, denv, gs))
adamc@255 3095 end
adamc@255 3096
adamc@255 3097 | L.DSgn (x, sgn) =>
adamc@255 3098 let
adamc@255 3099 val (sgn', gs') = elabSgn (env, denv) sgn
adamc@255 3100 val (env', n) = E.pushSgnNamed env x sgn'
adamc@255 3101 in
adamc@255 3102 ([(L'.DSgn (x, n, sgn'), loc)], (env', denv, enD gs' @ gs))
adamc@255 3103 end
adamc@255 3104
adamc@255 3105 | L.DStr (x, sgno, str) =>
adamc@255 3106 let
adamc@255 3107 val () = if x = "Basis" then
adamc@255 3108 raise Fail "Not allowed to redefine structure 'Basis'"
adamc@255 3109 else
adamc@255 3110 ()
adamc@255 3111
adamc@255 3112 val formal = Option.map (elabSgn (env, denv)) sgno
adamc@255 3113
adamc@255 3114 val (str', sgn', gs') =
adamc@255 3115 case formal of
adamc@255 3116 NONE =>
adamc@255 3117 let
adamc@255 3118 val (str', actual, gs') = elabStr (env, denv) str
adamc@255 3119 in
adamc@255 3120 (str', selfifyAt env {str = str', sgn = actual}, gs')
adamc@255 3121 end
adamc@255 3122 | SOME (formal, gs1) =>
adamc@255 3123 let
adamc@325 3124 val str = wildifyStr env (str, formal)
adamc@255 3125 val (str', actual, gs2) = elabStr (env, denv) str
adamc@255 3126 in
adamc@628 3127 subSgn env (selfifyAt env {str = str', sgn = actual}) formal;
adamc@255 3128 (str', formal, enD gs1 @ gs2)
adamc@255 3129 end
adamc@255 3130
adamc@255 3131 val (env', n) = E.pushStrNamed env x sgn'
adamc@255 3132 in
adamc@255 3133 case #1 (hnormSgn env sgn') of
adamc@255 3134 L'.SgnFun _ =>
adamc@255 3135 (case #1 str' of
adamc@255 3136 L'.StrFun _ => ()
adamc@255 3137 | _ => strError env (FunctorRebind loc))
adamc@255 3138 | _ => ();
adamc@255 3139
adamc@255 3140 ([(L'.DStr (x, n, sgn', str'), loc)], (env', denv, gs' @ gs))
adamc@255 3141 end
adamc@255 3142
adamc@255 3143 | L.DFfiStr (x, sgn) =>
adamc@255 3144 let
adamc@255 3145 val (sgn', gs') = elabSgn (env, denv) sgn
adamc@255 3146
adamc@255 3147 val (env', n) = E.pushStrNamed env x sgn'
adamc@255 3148 in
adamc@255 3149 ([(L'.DFfiStr (x, n, sgn'), loc)], (env', denv, enD gs' @ gs))
adamc@255 3150 end
adamc@255 3151
adamc@255 3152 | L.DOpen (m, ms) =>
adamc@255 3153 (case E.lookupStr env m of
adamc@255 3154 NONE => (strError env (UnboundStr (loc, m));
adamc@255 3155 ([], (env, denv, gs)))
adamc@255 3156 | SOME (n, sgn) =>
adamc@255 3157 let
adamc@255 3158 val (_, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@255 3159 case E.projectStr env {str = str, sgn = sgn, field = m} of
adamc@255 3160 NONE => (strError env (UnboundStr (loc, m));
adamc@255 3161 (strerror, sgnerror))
adamc@255 3162 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@255 3163 ((L'.StrVar n, loc), sgn) ms
adamc@255 3164
adamc@628 3165 val (ds, env') = dopen env {str = n, strs = ms, sgn = sgn}
adamc@628 3166 val denv' = dopenConstraints (loc, env', denv) {str = m, strs = ms}
adamc@255 3167 in
adamc@255 3168 (ds, (env', denv', gs))
adamc@255 3169 end)
adamc@255 3170
adamc@255 3171 | L.DConstraint (c1, c2) =>
adamc@255 3172 let
adamc@255 3173 val (c1', k1, gs1) = elabCon (env, denv) c1
adamc@255 3174 val (c2', k2, gs2) = elabCon (env, denv) c2
adamc@255 3175 val gs3 = D.prove env denv (c1', c2', loc)
adamc@255 3176
adamc@628 3177 val denv' = D.assert env denv (c1', c2')
adamc@255 3178 in
adamc@255 3179 checkKind env c1' k1 (L'.KRecord (kunif loc), loc);
adamc@255 3180 checkKind env c2' k2 (L'.KRecord (kunif loc), loc);
adamc@255 3181
adamc@628 3182 ([(L'.DConstraint (c1', c2'), loc)], (env, denv', enD gs1 @ enD gs2 @ enD gs3 @ gs))
adamc@255 3183 end
adamc@255 3184
adamc@255 3185 | L.DOpenConstraints (m, ms) =>
adamc@255 3186 let
adamc@255 3187 val denv = dopenConstraints (loc, env, denv) {str = m, strs = ms}
adamc@255 3188 in
adamc@255 3189 ([], (env, denv, gs))
adamc@255 3190 end
adamc@255 3191
adamc@255 3192 | L.DExport str =>
adamc@255 3193 let
adamc@255 3194 val (str', sgn, gs') = elabStr (env, denv) str
adamc@255 3195
adamc@255 3196 val sgn =
adamc@255 3197 case #1 (hnormSgn env sgn) of
adamc@255 3198 L'.SgnConst sgis =>
adamc@255 3199 let
adamc@255 3200 fun doOne (all as (sgi, _), env) =
adamc@255 3201 (case sgi of
adamc@255 3202 L'.SgiVal (x, n, t) =>
adamc@325 3203 let
adamc@325 3204 fun doPage (makeRes, ran) =
adamc@628 3205 case hnormCon env ran of
adamc@628 3206 (L'.CApp (tf, arg), _) =>
adamc@628 3207 (case (hnormCon env tf, hnormCon env arg) of
adamc@628 3208 ((L'.CModProj (basis, [], "transaction"), _),
adamc@628 3209 (L'.CApp (tf, arg3), _)) =>
adamc@325 3210 (case (basis = !basis_r,
adamc@628 3211 hnormCon env tf, hnormCon env arg3) of
adamc@325 3212 (true,
adamc@628 3213 (L'.CApp (tf, arg2), _),
adamc@628 3214 ((L'.CRecord (_, []), _))) =>
adamc@628 3215 (case (hnormCon env tf) of
adamc@628 3216 (L'.CApp (tf, arg1), _) =>
adamc@628 3217 (case (hnormCon env tf,
adamc@628 3218 hnormCon env arg1,
adamc@628 3219 hnormCon env arg2) of
adamc@628 3220 (tf, arg1,
adamc@628 3221 (L'.CRecord (_, []), _)) =>
adamc@325 3222 let
adamc@325 3223 val t = (L'.CApp (tf, arg1), loc)
adamc@325 3224 val t = (L'.CApp (t, arg2), loc)
adamc@325 3225 val t = (L'.CApp (t, arg3), loc)
adamc@325 3226 val t = (L'.CApp (
adamc@325 3227 (L'.CModProj
adamc@325 3228 (basis, [], "transaction"), loc),
adamc@325 3229 t), loc)
adamc@325 3230 in
adamc@325 3231 (L'.SgiVal (x, n, makeRes t), loc)
adamc@325 3232 end
adamc@325 3233 | _ => all)
adamc@325 3234 | _ => all)
adamc@325 3235 | _ => all)
adamc@325 3236 | _ => all)
adamc@325 3237 | _ => all
adamc@325 3238 in
adamc@628 3239 case hnormCon env t of
adamc@628 3240 (L'.TFun (dom, ran), _) =>
adamc@628 3241 (case hnormCon env dom of
adamc@628 3242 (L'.TRecord domR, _) =>
adamc@325 3243 doPage (fn t => (L'.TFun ((L'.TRecord domR,
adamc@325 3244 loc),
adamc@325 3245 t), loc), ran)
adamc@325 3246 | _ => all)
adamc@325 3247 | _ => doPage (fn t => t, t)
adamc@325 3248 end
adamc@255 3249 | _ => all,
adamc@255 3250 E.sgiBinds env all)
adamc@255 3251 in
adamc@255 3252 (L'.SgnConst (#1 (ListUtil.foldlMap doOne env sgis)), loc)
adamc@255 3253 end
adamc@255 3254 | _ => sgn
adamc@255 3255 in
adamc@255 3256 ([(L'.DExport (E.newNamed (), sgn, str'), loc)], (env, denv, gs' @ gs))
adamc@255 3257 end
adamc@255 3258
adamc@255 3259 | L.DTable (x, c) =>
adamc@255 3260 let
adamc@255 3261 val (c', k, gs') = elabCon (env, denv) c
adamc@255 3262 val (env, n) = E.pushENamed env x (L'.CApp (tableOf (), c'), loc)
adamc@255 3263 in
adamc@255 3264 checkKind env c' k (L'.KRecord (L'.KType, loc), loc);
adamc@255 3265 ([(L'.DTable (!basis_r, x, n, c'), loc)], (env, denv, enD gs' @ gs))
adamc@255 3266 end
adamc@338 3267 | L.DSequence x =>
adamc@338 3268 let
adamc@338 3269 val (env, n) = E.pushENamed env x (sequenceOf ())
adamc@338 3270 in
adamc@338 3271 ([(L'.DSequence (!basis_r, x, n), loc)], (env, denv, gs))
adamc@338 3272 end
adamc@255 3273
adamc@563 3274 | L.DClass (x, k, c) =>
adamc@255 3275 let
adamc@623 3276 val k = elabKind env k
adamc@563 3277 val k' = (L'.KArrow (k, (L'.KType, loc)), loc)
adamc@280 3278 val (c', ck, gs') = elabCon (env, denv) c
adamc@563 3279 val (env, n) = E.pushCNamed env x k' (SOME c')
adamc@255 3280 val env = E.pushClass env n
adamc@255 3281 in
adamc@563 3282 checkKind env c' ck k';
adamc@563 3283 ([(L'.DClass (x, n, k, c'), loc)], (env, denv, enD gs' @ gs))
adamc@255 3284 end
adamc@271 3285
adamc@280 3286 | L.DDatabase s => ([(L'.DDatabase s, loc)], (env, denv, gs))
adamc@280 3287
adamc@459 3288 | L.DCookie (x, c) =>
adamc@459 3289 let
adamc@459 3290 val (c', k, gs') = elabCon (env, denv) c
adamc@459 3291 val (env, n) = E.pushENamed env x (L'.CApp (cookieOf (), c'), loc)
adamc@459 3292 in
adamc@459 3293 checkKind env c' k (L'.KType, loc);
adamc@459 3294 ([(L'.DCookie (!basis_r, x, n, c'), loc)], (env, denv, enD gs' @ gs))
adamc@459 3295 end
adamc@459 3296
adamc@280 3297 (*val tcs = List.filter (fn TypeClass _ => true | _ => false) (#3 (#2 r))*)
adamc@255 3298 in
adamc@280 3299 (*prefaces "elabDecl" [("e", SourcePrint.p_decl dAll),
adamc@514 3300 ("t", PD.string (LargeReal.toString (Time.toReal
adamc@514 3301 (Time.- (Time.now (), befor)))))];*)
adamc@280 3302
adamc@255 3303 r
adamc@255 3304 end
adamc@211 3305
adamc@83 3306 and elabStr (env, denv) (str, loc) =
adamc@31 3307 case str of
adamc@31 3308 L.StrConst ds =>
adamc@31 3309 let
adamc@88 3310 val (ds', (_, _, gs)) = ListUtil.foldlMapConcat elabDecl (env, denv, []) ds
adamc@123 3311 val sgis = ListUtil.mapConcat sgiOfDecl ds'
adamc@63 3312
adamc@63 3313 val (sgis, _, _, _, _) =
adamc@64 3314 foldr (fn ((sgi, loc), (sgis, cons, vals, sgns, strs)) =>
adamc@63 3315 case sgi of
adamc@64 3316 L'.SgiConAbs (x, n, k) =>
adamc@64 3317 let
adamc@64 3318 val (cons, x) =
adamc@64 3319 if SS.member (cons, x) then
adamc@64 3320 (cons, "?" ^ x)
adamc@64 3321 else
adamc@64 3322 (SS.add (cons, x), x)
adamc@64 3323 in
adamc@64 3324 ((L'.SgiConAbs (x, n, k), loc) :: sgis, cons, vals, sgns, strs)
adamc@64 3325 end
adamc@64 3326 | L'.SgiCon (x, n, k, c) =>
adamc@64 3327 let
adamc@64 3328 val (cons, x) =
adamc@64 3329 if SS.member (cons, x) then
adamc@64 3330 (cons, "?" ^ x)
adamc@64 3331 else
adamc@64 3332 (SS.add (cons, x), x)
adamc@64 3333 in
adamc@64 3334 ((L'.SgiCon (x, n, k, c), loc) :: sgis, cons, vals, sgns, strs)
adamc@64 3335 end
adamc@191 3336 | L'.SgiDatatype (x, n, xs, xncs) =>
adamc@156 3337 let
adamc@156 3338 val (cons, x) =
adamc@156 3339 if SS.member (cons, x) then
adamc@156 3340 (cons, "?" ^ x)
adamc@156 3341 else
adamc@156 3342 (SS.add (cons, x), x)
adamc@156 3343
adamc@156 3344 val (xncs, vals) =
adamc@156 3345 ListUtil.foldlMap
adamc@156 3346 (fn ((x, n, t), vals) =>
adamc@156 3347 if SS.member (vals, x) then
adamc@156 3348 (("?" ^ x, n, t), vals)
adamc@156 3349 else
adamc@156 3350 ((x, n, t), SS.add (vals, x)))
adamc@156 3351 vals xncs
adamc@156 3352 in
adamc@191 3353 ((L'.SgiDatatype (x, n, xs, xncs), loc) :: sgis, cons, vals, sgns, strs)
adamc@156 3354 end
adamc@191 3355 | L'.SgiDatatypeImp (x, n, m1, ms, x', xs, xncs) =>
adamc@156 3356 let
adamc@156 3357 val (cons, x) =
adamc@156 3358 if SS.member (cons, x) then
adamc@156 3359 (cons, "?" ^ x)
adamc@156 3360 else
adamc@156 3361 (SS.add (cons, x), x)
adamc@156 3362 in
adamc@191 3363 ((L'.SgiDatatypeImp (x, n, m1, ms, x', xs, xncs), loc) :: sgis, cons, vals, sgns, strs)
adamc@156 3364 end
adamc@64 3365 | L'.SgiVal (x, n, c) =>
adamc@64 3366 let
adamc@64 3367 val (vals, x) =
adamc@64 3368 if SS.member (vals, x) then
adamc@64 3369 (vals, "?" ^ x)
adamc@64 3370 else
adamc@64 3371 (SS.add (vals, x), x)
adamc@64 3372 in
adamc@64 3373 ((L'.SgiVal (x, n, c), loc) :: sgis, cons, vals, sgns, strs)
adamc@64 3374 end
adamc@64 3375 | L'.SgiSgn (x, n, sgn) =>
adamc@64 3376 let
adamc@64 3377 val (sgns, x) =
adamc@64 3378 if SS.member (sgns, x) then
adamc@64 3379 (sgns, "?" ^ x)
adamc@64 3380 else
adamc@64 3381 (SS.add (sgns, x), x)
adamc@64 3382 in
adamc@64 3383 ((L'.SgiSgn (x, n, sgn), loc) :: sgis, cons, vals, sgns, strs)
adamc@64 3384 end
adamc@64 3385
adamc@64 3386 | L'.SgiStr (x, n, sgn) =>
adamc@64 3387 let
adamc@64 3388 val (strs, x) =
adamc@64 3389 if SS.member (strs, x) then
adamc@64 3390 (strs, "?" ^ x)
adamc@64 3391 else
adamc@64 3392 (SS.add (strs, x), x)
adamc@64 3393 in
adamc@64 3394 ((L'.SgiStr (x, n, sgn), loc) :: sgis, cons, vals, sgns, strs)
adamc@88 3395 end
adamc@203 3396 | L'.SgiConstraint _ => ((sgi, loc) :: sgis, cons, vals, sgns, strs)
adamc@563 3397 | L'.SgiClassAbs (x, n, k) =>
adamc@211 3398 let
adamc@211 3399 val (cons, x) =
adamc@211 3400 if SS.member (cons, x) then
adamc@211 3401 (cons, "?" ^ x)
adamc@211 3402 else
adamc@211 3403 (SS.add (cons, x), x)
adamc@211 3404 in
adamc@563 3405 ((L'.SgiClassAbs (x, n, k), loc) :: sgis, cons, vals, sgns, strs)
adamc@211 3406 end
adamc@563 3407 | L'.SgiClass (x, n, k, c) =>
adamc@211 3408 let
adamc@211 3409 val (cons, x) =
adamc@211 3410 if SS.member (cons, x) then
adamc@211 3411 (cons, "?" ^ x)
adamc@211 3412 else
adamc@211 3413 (SS.add (cons, x), x)
adamc@211 3414 in
adamc@563 3415 ((L'.SgiClass (x, n, k, c), loc) :: sgis, cons, vals, sgns, strs)
adamc@203 3416 end)
adamc@64 3417
adamc@63 3418 ([], SS.empty, SS.empty, SS.empty, SS.empty) sgis
adamc@31 3419 in
adamc@83 3420 ((L'.StrConst ds', loc), (L'.SgnConst sgis, loc), gs)
adamc@31 3421 end
adamc@31 3422 | L.StrVar x =>
adamc@31 3423 (case E.lookupStr env x of
adamc@31 3424 NONE =>
adamc@31 3425 (strError env (UnboundStr (loc, x));
adamc@83 3426 (strerror, sgnerror, []))
adamc@83 3427 | SOME (n, sgn) => ((L'.StrVar n, loc), sgn, []))
adamc@34 3428 | L.StrProj (str, x) =>
adamc@34 3429 let
adamc@83 3430 val (str', sgn, gs) = elabStr (env, denv) str
adamc@34 3431 in
adamc@34 3432 case E.projectStr env {str = str', sgn = sgn, field = x} of
adamc@34 3433 NONE => (strError env (UnboundStr (loc, x));
adamc@83 3434 (strerror, sgnerror, []))
adamc@83 3435 | SOME sgn => ((L'.StrProj (str', x), loc), sgn, gs)
adamc@34 3436 end
adamc@41 3437 | L.StrFun (m, dom, ranO, str) =>
adamc@41 3438 let
adamc@83 3439 val (dom', gs1) = elabSgn (env, denv) dom
adamc@41 3440 val (env', n) = E.pushStrNamed env m dom'
adamc@83 3441 val (str', actual, gs2) = elabStr (env', denv) str
adamc@41 3442
adamc@83 3443 val (formal, gs3) =
adamc@41 3444 case ranO of
adamc@83 3445 NONE => (actual, [])
adamc@41 3446 | SOME ran =>
adamc@41 3447 let
adamc@83 3448 val (ran', gs) = elabSgn (env', denv) ran
adamc@41 3449 in
adamc@628 3450 subSgn env' actual ran';
adamc@83 3451 (ran', gs)
adamc@41 3452 end
adamc@41 3453 in
adamc@41 3454 ((L'.StrFun (m, n, dom', formal, str'), loc),
adamc@83 3455 (L'.SgnFun (m, n, dom', formal), loc),
adamc@228 3456 enD gs1 @ gs2 @ enD gs3)
adamc@41 3457 end
adamc@44 3458 | L.StrApp (str1, str2) =>
adamc@44 3459 let
adamc@83 3460 val (str1', sgn1, gs1) = elabStr (env, denv) str1
adamc@325 3461 val str2 =
adamc@325 3462 case sgn1 of
adamc@325 3463 (L'.SgnFun (_, _, dom, _), _) =>
adamc@325 3464 wildifyStr env (str2, dom)
adamc@325 3465 | _ => str2
adamc@83 3466 val (str2', sgn2, gs2) = elabStr (env, denv) str2
adamc@44 3467 in
adamc@44 3468 case #1 (hnormSgn env sgn1) of
adamc@83 3469 L'.SgnError => (strerror, sgnerror, [])
adamc@44 3470 | L'.SgnFun (m, n, dom, ran) =>
adamc@628 3471 (subSgn env sgn2 dom;
adamc@44 3472 case #1 (hnormSgn env ran) of
adamc@83 3473 L'.SgnError => (strerror, sgnerror, [])
adamc@44 3474 | L'.SgnConst sgis =>
adamc@44 3475 ((L'.StrApp (str1', str2'), loc),
adamc@83 3476 (L'.SgnConst ((L'.SgiStr (m, n, selfifyAt env {str = str2', sgn = sgn2}), loc) :: sgis), loc),
adamc@83 3477 gs1 @ gs2)
adamc@44 3478 | _ => raise Fail "Unable to hnormSgn in functor application")
adamc@44 3479 | _ => (strError env (NotFunctor sgn1);
adamc@83 3480 (strerror, sgnerror, []))
adamc@44 3481 end
adamc@31 3482
adamc@325 3483 fun elabFile basis topStr topSgn env file =
adamc@56 3484 let
adamc@83 3485 val (sgn, gs) = elabSgn (env, D.empty) (L.SgnConst basis, ErrorMsg.dummySpan)
adamc@83 3486 val () = case gs of
adamc@83 3487 [] => ()
adamc@207 3488 | _ => (app (fn (_, env, _, c1, c2) =>
adamc@207 3489 prefaces "Unresolved"
adamc@207 3490 [("c1", p_con env c1),
adamc@207 3491 ("c2", p_con env c2)]) gs;
adamc@207 3492 raise Fail "Unresolved disjointness constraints in Basis")
adamc@83 3493
adamc@56 3494 val (env', basis_n) = E.pushStrNamed env "Basis" sgn
adamc@210 3495 val () = basis_r := basis_n
adamc@56 3496
adamc@628 3497 val (ds, env') = dopen env' {str = basis_n, strs = [], sgn = sgn}
adamc@56 3498
adamc@56 3499 fun discoverC r x =
adamc@56 3500 case E.lookupC env' x of
adamc@56 3501 E.NotBound => raise Fail ("Constructor " ^ x ^ " unbound in Basis")
adamc@56 3502 | E.Rel _ => raise Fail ("Constructor " ^ x ^ " bound relatively in Basis")
adamc@56 3503 | E.Named (n, (_, loc)) => r := (L'.CNamed n, loc)
adamc@56 3504
adamc@56 3505 val () = discoverC int "int"
adamc@56 3506 val () = discoverC float "float"
adamc@56 3507 val () = discoverC string "string"
adamc@203 3508 val () = discoverC table "sql_table"
adamc@56 3509
adamc@325 3510 val (topSgn, gs) = elabSgn (env', D.empty) (L.SgnConst topSgn, ErrorMsg.dummySpan)
adamc@325 3511 val () = case gs of
adamc@325 3512 [] => ()
adamc@325 3513 | _ => raise Fail "Unresolved disjointness constraints in top.urs"
adamc@325 3514 val (topStr, topSgn', gs) = elabStr (env', D.empty) (L.StrConst topStr, ErrorMsg.dummySpan)
adamc@325 3515 val () = case gs of
adamc@325 3516 [] => ()
adamc@329 3517 | _ => app (fn Disjoint (loc, env, denv, c1, c2) =>
adamc@329 3518 (case D.prove env denv (c1, c2, loc) of
adamc@329 3519 [] => ()
adamc@329 3520 | _ =>
adamc@329 3521 (prefaces "Unresolved constraint in top.ur"
adamc@329 3522 [("loc", PD.string (ErrorMsg.spanToString loc)),
adamc@329 3523 ("c1", p_con env c1),
adamc@329 3524 ("c2", p_con env c2)];
adamc@478 3525 raise Fail "Unresolved constraint in top.ur"))
adamc@564 3526 | TypeClass (env, c, r, loc) =>
adamc@564 3527 let
adamc@564 3528 val c = normClassKey env c
adamc@564 3529 in
adamc@564 3530 case E.resolveClass env c of
adamc@564 3531 SOME e => r := SOME e
adamc@564 3532 | NONE => expError env (Unresolvable (loc, c))
adamc@634 3533 end) gs
adamc@564 3534
adamc@628 3535 val () = subSgn env' topSgn' topSgn
adamc@325 3536
adamc@325 3537 val (env', top_n) = E.pushStrNamed env' "Top" topSgn
adamc@633 3538 val () = top_r := top_n
adamc@325 3539
adamc@628 3540 val (ds', env') = dopen env' {str = top_n, strs = [], sgn = topSgn}
adamc@325 3541
adamc@83 3542 fun elabDecl' (d, (env, gs)) =
adamc@76 3543 let
adamc@76 3544 val () = resetKunif ()
adamc@76 3545 val () = resetCunif ()
adamc@88 3546 val (ds, (env, _, gs)) = elabDecl (d, (env, D.empty, gs))
adamc@76 3547 in
adamc@76 3548 if ErrorMsg.anyErrors () then
adamc@76 3549 ()
adamc@76 3550 else (
adamc@76 3551 if List.exists kunifsInDecl ds then
adamc@91 3552 declError env (KunifsRemain ds)
adamc@76 3553 else
adamc@76 3554 ();
adamc@76 3555
adamc@76 3556 case ListUtil.search cunifsInDecl ds of
adamc@76 3557 NONE => ()
adamc@76 3558 | SOME loc =>
adamc@91 3559 declError env (CunifsRemain ds)
adamc@76 3560 );
adamc@76 3561
adamc@83 3562 (ds, (env, gs))
adamc@76 3563 end
adamc@76 3564
adamc@83 3565 val (file, (_, gs)) = ListUtil.foldlMapConcat elabDecl' (env', []) file
adamc@56 3566 in
adamc@84 3567 if ErrorMsg.anyErrors () then
adamc@84 3568 ()
adamc@84 3569 else
adamc@228 3570 app (fn Disjoint (loc, env, denv, c1, c2) =>
adamc@228 3571 (case D.prove env denv (c1, c2, loc) of
adamc@228 3572 [] => ()
adamc@228 3573 | _ =>
adamc@228 3574 (ErrorMsg.errorAt loc "Couldn't prove field name disjointness";
adamc@228 3575 eprefaces' [("Con 1", p_con env c1),
adamc@228 3576 ("Con 2", p_con env c2),
adamc@228 3577 ("Hnormed 1", p_con env (ElabOps.hnormCon env c1)),
adamc@228 3578 ("Hnormed 2", p_con env (ElabOps.hnormCon env c2))]))
adamc@228 3579 | TypeClass (env, c, r, loc) =>
adamc@349 3580 let
adamc@634 3581 fun default () = expError env (Unresolvable (loc, c))
adamc@634 3582
adamc@467 3583 val c = normClassKey env c
adamc@349 3584 in
adamc@349 3585 case E.resolveClass env c of
adamc@349 3586 SOME e => r := SOME e
adamc@634 3587 | NONE =>
adamc@634 3588 case #1 (hnormCon env c) of
adamc@634 3589 L'.CApp (f, x) =>
adamc@634 3590 (case (#1 (hnormCon env f), #1 (hnormCon env x)) of
adamc@634 3591 (L'.CKApp (f, _), L'.CRecord (k, xcs)) =>
adamc@634 3592 (case #1 (hnormCon env f) of
adamc@634 3593 L'.CModProj (top_n', [], "folder") =>
adamc@634 3594 if top_n' = top_n then
adamc@634 3595 let
adamc@634 3596 val e = (L'.EModProj (top_n, ["Folder"], "nil"), loc)
adamc@634 3597 val e = (L'.EKApp (e, k), loc)
adamc@634 3598
adamc@634 3599 val (folder, _) = foldr (fn ((x, c), (folder, xcs)) =>
adamc@634 3600 let
adamc@634 3601 val e = (L'.EModProj (top_n, ["Folder"],
adamc@634 3602 "cons"), loc)
adamc@634 3603 val e = (L'.EKApp (e, k), loc)
adamc@634 3604 val e = (L'.ECApp (e,
adamc@634 3605 (L'.CRecord (k, xcs),
adamc@634 3606 loc)), loc)
adamc@634 3607 val e = (L'.ECApp (e, x), loc)
adamc@634 3608 val e = (L'.ECApp (e, c), loc)
adamc@634 3609 val e = (L'.EApp (e, folder), loc)
adamc@634 3610 in
adamc@634 3611 (e, (x, c) :: xcs)
adamc@634 3612 end)
adamc@634 3613 (e, []) xcs
adamc@634 3614 in
adamc@634 3615 r := SOME folder
adamc@634 3616 end
adamc@634 3617 else
adamc@634 3618 default ()
adamc@634 3619 | _ => default ())
adamc@634 3620 | _ => default ())
adamc@634 3621 | _ => default ()
adamc@349 3622 end) gs;
adamc@83 3623
adamc@325 3624 (L'.DFfiStr ("Basis", basis_n, sgn), ErrorMsg.dummySpan)
adamc@325 3625 :: ds
adamc@325 3626 @ (L'.DStr ("Top", top_n, topSgn, topStr), ErrorMsg.dummySpan)
adamc@325 3627 :: ds' @ file
adamc@56 3628 end
adamc@2 3629
adamc@2 3630 end