Mercurial > urweb

annotate src/elaborate.sml @ 707:d8217b4cb617

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