Mercurial > urweb

annotate src/elaborate.sml @ 442:9095a95a1bf9

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