Mercurial > urweb

annotate src/elaborate.sml @ 633:03ab853c8e4b

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