Mercurial > urweb

annotate src/elaborate.sml @ 329:eec65c11d3e2

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