Mercurial > urweb

annotate src/elaborate.sml @ 90:94ef20a31550

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Fancier head normalization pushed inside of Disjoint
author Adam Chlipala <adamc@hcoop.net>
date Thu, 03 Jul 2008 11:04:25 -0400
parents 7bab29834cd6
children 4327abd52997
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@3 39
adamc@62 40 structure SS = BinarySetFn(struct
adamc@62 41 type ord_key = string
adamc@62 42 val compare = String.compare
adamc@62 43 end)
adamc@62 44
adamc@2 45 fun elabExplicitness e =
adamc@2 46 case e of
adamc@2 47 L.Explicit => L'.Explicit
adamc@2 48 | L.Implicit => L'.Implicit
adamc@2 49
adamc@2 50 fun occursKind r =
adamc@76 51 U.Kind.exists (fn L'.KUnif (_, _, r') => r = r'
adamc@2 52 | _ => false)
adamc@2 53
adamc@3 54 datatype kunify_error =
adamc@2 55 KOccursCheckFailed of L'.kind * L'.kind
adamc@2 56 | KIncompatible of L'.kind * L'.kind
adamc@2 57
adamc@3 58 exception KUnify' of kunify_error
adamc@3 59
adamc@3 60 fun kunifyError err =
adamc@2 61 case err of
adamc@2 62 KOccursCheckFailed (k1, k2) =>
adamc@3 63 eprefaces "Kind occurs check failed"
adamc@3 64 [("Kind 1", p_kind k1),
adamc@3 65 ("Kind 2", p_kind k2)]
adamc@2 66 | KIncompatible (k1, k2) =>
adamc@3 67 eprefaces "Incompatible kinds"
adamc@3 68 [("Kind 1", p_kind k1),
adamc@3 69 ("Kind 2", p_kind k2)]
adamc@2 70
adamc@3 71 fun unifyKinds' (k1All as (k1, _)) (k2All as (k2, _)) =
adamc@2 72 let
adamc@3 73 fun err f = raise KUnify' (f (k1All, k2All))
adamc@2 74 in
adamc@2 75 case (k1, k2) of
adamc@2 76 (L'.KType, L'.KType) => ()
adamc@82 77 | (L'.KUnit, L'.KUnit) => ()
adamc@82 78
adamc@2 79 | (L'.KArrow (d1, r1), L'.KArrow (d2, r2)) =>
adamc@3 80 (unifyKinds' d1 d2;
adamc@3 81 unifyKinds' r1 r2)
adamc@2 82 | (L'.KName, L'.KName) => ()
adamc@3 83 | (L'.KRecord k1, L'.KRecord k2) => unifyKinds' k1 k2
adamc@2 84
adamc@2 85 | (L'.KError, _) => ()
adamc@2 86 | (_, L'.KError) => ()
adamc@2 87
adamc@76 88 | (L'.KUnif (_, _, ref (SOME k1All)), _) => unifyKinds' k1All k2All
adamc@76 89 | (_, L'.KUnif (_, _, ref (SOME k2All))) => unifyKinds' k1All k2All
adamc@2 90
adamc@76 91 | (L'.KUnif (_, _, r1), L'.KUnif (_, _, r2)) =>
adamc@2 92 if r1 = r2 then
adamc@2 93 ()
adamc@2 94 else
adamc@2 95 r1 := SOME k2All
adamc@2 96
adamc@76 97 | (L'.KUnif (_, _, r), _) =>
adamc@2 98 if occursKind r k2All then
adamc@2 99 err KOccursCheckFailed
adamc@2 100 else
adamc@2 101 r := SOME k2All
adamc@76 102 | (_, L'.KUnif (_, _, r)) =>
adamc@2 103 if occursKind r k1All then
adamc@2 104 err KOccursCheckFailed
adamc@2 105 else
adamc@2 106 r := SOME k1All
adamc@2 107
adamc@2 108 | _ => err KIncompatible
adamc@2 109 end
adamc@2 110
adamc@3 111 exception KUnify of L'.kind * L'.kind * kunify_error
adamc@3 112
adamc@3 113 fun unifyKinds k1 k2 =
adamc@3 114 unifyKinds' k1 k2
adamc@3 115 handle KUnify' err => raise KUnify (k1, k2, err)
adamc@3 116
adamc@3 117 datatype con_error =
adamc@3 118 UnboundCon of ErrorMsg.span * string
adamc@34 119 | UnboundStrInCon of ErrorMsg.span * string
adamc@3 120 | WrongKind of L'.con * L'.kind * L'.kind * kunify_error
adamc@67 121 | DuplicateField of ErrorMsg.span * string
adamc@3 122
adamc@5 123 fun conError env err =
adamc@3 124 case err of
adamc@3 125 UnboundCon (loc, s) =>
adamc@3 126 ErrorMsg.errorAt loc ("Unbound constructor variable " ^ s)
adamc@34 127 | UnboundStrInCon (loc, s) =>
adamc@34 128 ErrorMsg.errorAt loc ("Unbound structure " ^ s)
adamc@3 129 | WrongKind (c, k1, k2, kerr) =>
adamc@3 130 (ErrorMsg.errorAt (#2 c) "Wrong kind";
adamc@5 131 eprefaces' [("Constructor", p_con env c),
adamc@5 132 ("Have kind", p_kind k1),
adamc@5 133 ("Need kind", p_kind k2)];
adamc@3 134 kunifyError kerr)
adamc@67 135 | DuplicateField (loc, s) =>
adamc@67 136 ErrorMsg.errorAt loc ("Duplicate record field " ^ s)
adamc@3 137
adamc@5 138 fun checkKind env c k1 k2 =
adamc@3 139 unifyKinds k1 k2
adamc@3 140 handle KUnify (k1, k2, err) =>
adamc@5 141 conError env (WrongKind (c, k1, k2, err))
adamc@3 142
adamc@3 143 val dummy = ErrorMsg.dummySpan
adamc@3 144
adamc@3 145 val ktype = (L'.KType, dummy)
adamc@3 146 val kname = (L'.KName, dummy)
adamc@12 147 val ktype_record = (L'.KRecord ktype, dummy)
adamc@3 148
adamc@3 149 val cerror = (L'.CError, dummy)
adamc@3 150 val kerror = (L'.KError, dummy)
adamc@10 151 val eerror = (L'.EError, dummy)
adamc@31 152 val sgnerror = (L'.SgnError, dummy)
adamc@31 153 val strerror = (L'.StrError, dummy)
adamc@3 154
adamc@56 155 val int = ref cerror
adamc@56 156 val float = ref cerror
adamc@56 157 val string = ref cerror
adamc@56 158
adamc@3 159 local
adamc@3 160 val count = ref 0
adamc@3 161 in
adamc@3 162
adamc@3 163 fun resetKunif () = count := 0
adamc@3 164
adamc@76 165 fun kunif loc =
adamc@3 166 let
adamc@3 167 val n = !count
adamc@3 168 val s = if n <= 26 then
adamc@3 169 str (chr (ord #"A" + n))
adamc@3 170 else
adamc@3 171 "U" ^ Int.toString (n - 26)
adamc@3 172 in
adamc@3 173 count := n + 1;
adamc@76 174 (L'.KUnif (loc, s, ref NONE), dummy)
adamc@3 175 end
adamc@3 176
adamc@3 177 end
adamc@3 178
adamc@10 179 local
adamc@10 180 val count = ref 0
adamc@10 181 in
adamc@10 182
adamc@10 183 fun resetCunif () = count := 0
adamc@10 184
adamc@76 185 fun cunif (loc, k) =
adamc@10 186 let
adamc@10 187 val n = !count
adamc@10 188 val s = if n <= 26 then
adamc@10 189 str (chr (ord #"A" + n))
adamc@10 190 else
adamc@10 191 "U" ^ Int.toString (n - 26)
adamc@10 192 in
adamc@10 193 count := n + 1;
adamc@76 194 (L'.CUnif (loc, k, s, ref NONE), dummy)
adamc@10 195 end
adamc@10 196
adamc@10 197 end
adamc@10 198
adamc@18 199 fun elabKind (k, loc) =
adamc@18 200 case k of
adamc@18 201 L.KType => (L'.KType, loc)
adamc@18 202 | L.KArrow (k1, k2) => (L'.KArrow (elabKind k1, elabKind k2), loc)
adamc@18 203 | L.KName => (L'.KName, loc)
adamc@18 204 | L.KRecord k => (L'.KRecord (elabKind k), loc)
adamc@82 205 | L.KUnit => (L'.KUnit, loc)
adamc@76 206 | L.KWild => kunif loc
adamc@18 207
adamc@67 208 fun foldKind (dom, ran, loc)=
adamc@67 209 (L'.KArrow ((L'.KArrow ((L'.KName, loc),
adamc@67 210 (L'.KArrow (dom,
adamc@67 211 (L'.KArrow (ran, ran), loc)), loc)), loc),
adamc@67 212 (L'.KArrow (ran,
adamc@67 213 (L'.KArrow ((L'.KRecord dom, loc),
adamc@67 214 ran), loc)), loc)), loc)
adamc@67 215
adamc@83 216 fun elabCon (env, denv) (c, loc) =
adamc@3 217 case c of
adamc@3 218 L.CAnnot (c, k) =>
adamc@3 219 let
adamc@3 220 val k' = elabKind k
adamc@83 221 val (c', ck, gs) = elabCon (env, denv) c
adamc@3 222 in
adamc@5 223 checkKind env c' ck k';
adamc@83 224 (c', k', gs)
adamc@3 225 end
adamc@3 226
adamc@3 227 | L.TFun (t1, t2) =>
adamc@3 228 let
adamc@83 229 val (t1', k1, gs1) = elabCon (env, denv) t1
adamc@83 230 val (t2', k2, gs2) = elabCon (env, denv) t2
adamc@3 231 in
adamc@5 232 checkKind env t1' k1 ktype;
adamc@5 233 checkKind env t2' k2 ktype;
adamc@83 234 ((L'.TFun (t1', t2'), loc), ktype, gs1 @ gs2)
adamc@3 235 end
adamc@3 236 | L.TCFun (e, x, k, t) =>
adamc@3 237 let
adamc@3 238 val e' = elabExplicitness e
adamc@3 239 val k' = elabKind k
adamc@3 240 val env' = E.pushCRel env x k'
adamc@83 241 val (t', tk, gs) = elabCon (env', D.enter denv) t
adamc@3 242 in
adamc@5 243 checkKind env t' tk ktype;
adamc@83 244 ((L'.TCFun (e', x, k', t'), loc), ktype, gs)
adamc@3 245 end
adamc@85 246 | L.TDisjoint (c1, c2, c) =>
adamc@85 247 let
adamc@85 248 val (c1', k1, gs1) = elabCon (env, denv) c1
adamc@85 249 val (c2', k2, gs2) = elabCon (env, denv) c2
adamc@85 250
adamc@85 251 val ku1 = kunif loc
adamc@85 252 val ku2 = kunif loc
adamc@85 253
adamc@90 254 val (denv', gs3) = D.assert env denv (c1', c2')
adamc@90 255 val (c', k, gs4) = elabCon (env, denv') c
adamc@85 256 in
adamc@85 257 checkKind env c1' k1 (L'.KRecord ku1, loc);
adamc@85 258 checkKind env c2' k2 (L'.KRecord ku2, loc);
adamc@85 259
adamc@90 260 ((L'.TDisjoint (c1', c2', c'), loc), k, gs1 @ gs2 @ gs3 @ gs4)
adamc@85 261 end
adamc@3 262 | L.TRecord c =>
adamc@3 263 let
adamc@83 264 val (c', ck, gs) = elabCon (env, denv) c
adamc@3 265 val k = (L'.KRecord ktype, loc)
adamc@3 266 in
adamc@5 267 checkKind env c' ck k;
adamc@83 268 ((L'.TRecord c', loc), ktype, gs)
adamc@3 269 end
adamc@3 270
adamc@34 271 | L.CVar ([], s) =>
adamc@3 272 (case E.lookupC env s of
adamc@9 273 E.NotBound =>
adamc@5 274 (conError env (UnboundCon (loc, s));
adamc@83 275 (cerror, kerror, []))
adamc@9 276 | E.Rel (n, k) =>
adamc@83 277 ((L'.CRel n, loc), k, [])
adamc@9 278 | E.Named (n, k) =>
adamc@83 279 ((L'.CNamed n, loc), k, []))
adamc@34 280 | L.CVar (m1 :: ms, s) =>
adamc@34 281 (case E.lookupStr env m1 of
adamc@42 282 NONE => (conError env (UnboundStrInCon (loc, m1));
adamc@83 283 (cerror, kerror, []))
adamc@34 284 | SOME (n, sgn) =>
adamc@34 285 let
adamc@34 286 val (str, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@34 287 case E.projectStr env {sgn = sgn, str = str, field = m} of
adamc@34 288 NONE => (conError env (UnboundStrInCon (loc, m));
adamc@34 289 (strerror, sgnerror))
adamc@34 290 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@34 291 ((L'.StrVar n, loc), sgn) ms
adamc@34 292
adamc@34 293 val k = case E.projectCon env {sgn = sgn, str = str, field = s} of
adamc@34 294 NONE => (conError env (UnboundCon (loc, s));
adamc@34 295 kerror)
adamc@34 296 | SOME (k, _) => k
adamc@34 297 in
adamc@83 298 ((L'.CModProj (n, ms, s), loc), k, [])
adamc@34 299 end)
adamc@34 300
adamc@3 301 | L.CApp (c1, c2) =>
adamc@3 302 let
adamc@83 303 val (c1', k1, gs1) = elabCon (env, denv) c1
adamc@83 304 val (c2', k2, gs2) = elabCon (env, denv) c2
adamc@76 305 val dom = kunif loc
adamc@76 306 val ran = kunif loc
adamc@3 307 in
adamc@5 308 checkKind env c1' k1 (L'.KArrow (dom, ran), loc);
adamc@5 309 checkKind env c2' k2 dom;
adamc@83 310 ((L'.CApp (c1', c2'), loc), ran, gs1 @ gs2)
adamc@3 311 end
adamc@67 312 | L.CAbs (x, ko, t) =>
adamc@3 313 let
adamc@67 314 val k' = case ko of
adamc@76 315 NONE => kunif loc
adamc@67 316 | SOME k => elabKind k
adamc@3 317 val env' = E.pushCRel env x k'
adamc@83 318 val (t', tk, gs) = elabCon (env', D.enter denv) t
adamc@3 319 in
adamc@8 320 ((L'.CAbs (x, k', t'), loc),
adamc@83 321 (L'.KArrow (k', tk), loc),
adamc@83 322 gs)
adamc@3 323 end
adamc@3 324
adamc@84 325 | L.CDisjoint (c1, c2, c) =>
adamc@84 326 let
adamc@84 327 val (c1', k1, gs1) = elabCon (env, denv) c1
adamc@84 328 val (c2', k2, gs2) = elabCon (env, denv) c2
adamc@84 329
adamc@84 330 val ku1 = kunif loc
adamc@84 331 val ku2 = kunif loc
adamc@84 332
adamc@90 333 val (denv', gs3) = D.assert env denv (c1', c2')
adamc@90 334 val (c', k, gs4) = elabCon (env, denv') c
adamc@84 335 in
adamc@84 336 checkKind env c1' k1 (L'.KRecord ku1, loc);
adamc@84 337 checkKind env c2' k2 (L'.KRecord ku2, loc);
adamc@84 338
adamc@90 339 ((L'.CDisjoint (c1', c2', c'), loc), k, gs1 @ gs2 @ gs3 @ gs4)
adamc@84 340 end
adamc@84 341
adamc@3 342 | L.CName s =>
adamc@83 343 ((L'.CName s, loc), kname, [])
adamc@3 344
adamc@3 345 | L.CRecord xcs =>
adamc@3 346 let
adamc@76 347 val k = kunif loc
adamc@3 348
adamc@83 349 val (xcs', gs) = ListUtil.foldlMap (fn ((x, c), gs) =>
adamc@83 350 let
adamc@83 351 val (x', xk, gs1) = elabCon (env, denv) x
adamc@83 352 val (c', ck, gs2) = elabCon (env, denv) c
adamc@83 353 in
adamc@83 354 checkKind env x' xk kname;
adamc@83 355 checkKind env c' ck k;
adamc@83 356 ((x', c'), gs1 @ gs2 @ gs)
adamc@83 357 end) [] xcs
adamc@67 358
adamc@67 359 val rc = (L'.CRecord (k, xcs'), loc)
adamc@67 360 (* Add duplicate field checking later. *)
adamc@83 361
adamc@83 362 fun prove (xcs, ds) =
adamc@83 363 case xcs of
adamc@83 364 [] => ds
adamc@83 365 | xc :: rest =>
adamc@83 366 let
adamc@83 367 val r1 = (L'.CRecord (k, [xc]), loc)
adamc@83 368 val ds = foldl (fn (xc', ds) =>
adamc@83 369 let
adamc@83 370 val r2 = (L'.CRecord (k, [xc']), loc)
adamc@83 371 in
adamc@90 372 D.prove env denv (r1, r2, loc) @ ds
adamc@83 373 end)
adamc@83 374 ds rest
adamc@83 375 in
adamc@83 376 prove (rest, ds)
adamc@83 377 end
adamc@3 378 in
adamc@83 379 (rc, (L'.KRecord k, loc), prove (xcs', gs))
adamc@3 380 end
adamc@3 381 | L.CConcat (c1, c2) =>
adamc@3 382 let
adamc@83 383 val (c1', k1, gs1) = elabCon (env, denv) c1
adamc@83 384 val (c2', k2, gs2) = elabCon (env, denv) c2
adamc@76 385 val ku = kunif loc
adamc@3 386 val k = (L'.KRecord ku, loc)
adamc@3 387 in
adamc@5 388 checkKind env c1' k1 k;
adamc@5 389 checkKind env c2' k2 k;
adamc@83 390 ((L'.CConcat (c1', c2'), loc), k,
adamc@90 391 D.prove env denv (c1', c2', loc) @ gs1 @ gs2)
adamc@3 392 end
adamc@67 393 | L.CFold =>
adamc@67 394 let
adamc@76 395 val dom = kunif loc
adamc@76 396 val ran = kunif loc
adamc@67 397 in
adamc@67 398 ((L'.CFold (dom, ran), loc),
adamc@83 399 foldKind (dom, ran, loc),
adamc@83 400 [])
adamc@67 401 end
adamc@3 402
adamc@83 403 | L.CUnit => ((L'.CUnit, loc), (L'.KUnit, loc), [])
adamc@82 404
adamc@18 405 | L.CWild k =>
adamc@18 406 let
adamc@18 407 val k' = elabKind k
adamc@18 408 in
adamc@83 409 (cunif (loc, k'), k', [])
adamc@18 410 end
adamc@18 411
adamc@6 412 fun kunifsRemain k =
adamc@6 413 case k of
adamc@76 414 L'.KUnif (_, _, ref NONE) => true
adamc@6 415 | _ => false
adamc@10 416 fun cunifsRemain c =
adamc@10 417 case c of
adamc@76 418 L'.CUnif (loc, _, _, ref NONE) => SOME loc
adamc@76 419 | _ => NONE
adamc@6 420
adamc@76 421 val kunifsInDecl = U.Decl.exists {kind = kunifsRemain,
adamc@76 422 con = fn _ => false,
adamc@76 423 exp = fn _ => false,
adamc@76 424 sgn_item = fn _ => false,
adamc@76 425 sgn = fn _ => false,
adamc@76 426 str = fn _ => false,
adamc@76 427 decl = fn _ => false}
adamc@10 428
adamc@76 429 val cunifsInDecl = U.Decl.search {kind = fn _ => NONE,
adamc@76 430 con = cunifsRemain,
adamc@76 431 exp = fn _ => NONE,
adamc@76 432 sgn_item = fn _ => NONE,
adamc@76 433 sgn = fn _ => NONE,
adamc@76 434 str = fn _ => NONE,
adamc@76 435 decl = fn _ => NONE}
adamc@10 436
adamc@10 437 fun occursCon r =
adamc@10 438 U.Con.exists {kind = fn _ => false,
adamc@76 439 con = fn L'.CUnif (_, _, _, r') => r = r'
adamc@10 440 | _ => false}
adamc@10 441
adamc@10 442 datatype cunify_error =
adamc@10 443 CKind of L'.kind * L'.kind * kunify_error
adamc@10 444 | COccursCheckFailed of L'.con * L'.con
adamc@10 445 | CIncompatible of L'.con * L'.con
adamc@10 446 | CExplicitness of L'.con * L'.con
adamc@12 447 | CKindof of L'.con
adamc@12 448 | CRecordFailure
adamc@10 449
adamc@10 450 exception CUnify' of cunify_error
adamc@10 451
adamc@10 452 fun cunifyError env err =
adamc@10 453 case err of
adamc@10 454 CKind (k1, k2, kerr) =>
adamc@10 455 (eprefaces "Kind unification failure"
adamc@10 456 [("Kind 1", p_kind k1),
adamc@10 457 ("Kind 2", p_kind k2)];
adamc@10 458 kunifyError kerr)
adamc@10 459 | COccursCheckFailed (c1, c2) =>
adamc@10 460 eprefaces "Constructor occurs check failed"
adamc@10 461 [("Con 1", p_con env c1),
adamc@10 462 ("Con 2", p_con env c2)]
adamc@10 463 | CIncompatible (c1, c2) =>
adamc@10 464 eprefaces "Incompatible constructors"
adamc@10 465 [("Con 1", p_con env c1),
adamc@10 466 ("Con 2", p_con env c2)]
adamc@10 467 | CExplicitness (c1, c2) =>
adamc@10 468 eprefaces "Differing constructor function explicitness"
adamc@10 469 [("Con 1", p_con env c1),
adamc@10 470 ("Con 2", p_con env c2)]
adamc@12 471 | CKindof c =>
adamc@12 472 eprefaces "Kind unification variable blocks kindof calculation"
adamc@12 473 [("Con", p_con env c)]
adamc@12 474 | CRecordFailure =>
adamc@12 475 eprefaces "Can't unify record constructors" []
adamc@10 476
adamc@13 477 exception SynUnif = E.SynUnif
adamc@12 478
adamc@81 479 open ElabOps
adamc@43 480
adamc@12 481 type record_summary = {
adamc@12 482 fields : (L'.con * L'.con) list,
adamc@12 483 unifs : (L'.con * L'.con option ref) list,
adamc@12 484 others : L'.con list
adamc@12 485 }
adamc@12 486
adamc@12 487 fun summaryToCon {fields, unifs, others} =
adamc@12 488 let
adamc@12 489 val c = (L'.CRecord (ktype, []), dummy)
adamc@12 490 val c = List.foldr (fn (c', c) => (L'.CConcat (c', c), dummy)) c others
adamc@12 491 val c = List.foldr (fn ((c', _), c) => (L'.CConcat (c', c), dummy)) c unifs
adamc@12 492 in
adamc@12 493 (L'.CConcat ((L'.CRecord (ktype, fields), dummy), c), dummy)
adamc@12 494 end
adamc@12 495
adamc@12 496 fun p_summary env s = p_con env (summaryToCon s)
adamc@12 497
adamc@12 498 exception CUnify of L'.con * L'.con * cunify_error
adamc@12 499
adamc@12 500 fun hnormKind (kAll as (k, _)) =
adamc@12 501 case k of
adamc@76 502 L'.KUnif (_, _, ref (SOME k)) => hnormKind k
adamc@12 503 | _ => kAll
adamc@12 504
adamc@12 505 fun kindof env (c, loc) =
adamc@12 506 case c of
adamc@12 507 L'.TFun _ => ktype
adamc@12 508 | L'.TCFun _ => ktype
adamc@85 509 | L'.TDisjoint _ => ktype
adamc@12 510 | L'.TRecord _ => ktype
adamc@12 511
adamc@12 512 | L'.CRel xn => #2 (E.lookupCRel env xn)
adamc@12 513 | L'.CNamed xn => #2 (E.lookupCNamed env xn)
adamc@34 514 | L'.CModProj (n, ms, x) =>
adamc@34 515 let
adamc@34 516 val (_, sgn) = E.lookupStrNamed env n
adamc@34 517 val (str, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@34 518 case E.projectStr env {sgn = sgn, str = str, field = m} of
adamc@34 519 NONE => raise Fail "kindof: Unknown substructure"
adamc@34 520 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@34 521 ((L'.StrVar n, loc), sgn) ms
adamc@34 522 in
adamc@34 523 case E.projectCon env {sgn = sgn, str = str, field = x} of
adamc@34 524 NONE => raise Fail "kindof: Unknown con in structure"
adamc@34 525 | SOME (k, _) => k
adamc@34 526 end
adamc@34 527
adamc@12 528 | L'.CApp (c, _) =>
adamc@12 529 (case #1 (hnormKind (kindof env c)) of
adamc@12 530 L'.KArrow (_, k) => k
adamc@12 531 | L'.KError => kerror
adamc@12 532 | _ => raise CUnify' (CKindof c))
adamc@12 533 | L'.CAbs (x, k, c) => (L'.KArrow (k, kindof (E.pushCRel env x k) c), loc)
adamc@84 534 | L'.CDisjoint (_, _, c) => kindof env c
adamc@12 535
adamc@12 536 | L'.CName _ => kname
adamc@12 537
adamc@12 538 | L'.CRecord (k, _) => (L'.KRecord k, loc)
adamc@12 539 | L'.CConcat (c, _) => kindof env c
adamc@67 540 | L'.CFold (dom, ran) => foldKind (dom, ran, loc)
adamc@12 541
adamc@82 542 | L'.CUnit => (L'.KUnit, loc)
adamc@82 543
adamc@12 544 | L'.CError => kerror
adamc@76 545 | L'.CUnif (_, k, _, _) => k
adamc@12 546
adamc@90 547 val hnormCon = D.hnormCon
adamc@86 548
adamc@86 549 fun unifyRecordCons (env, denv) (c1, c2) =
adamc@12 550 let
adamc@12 551 val k1 = kindof env c1
adamc@12 552 val k2 = kindof env c2
adamc@86 553
adamc@86 554 val (r1, gs1) = recordSummary (env, denv) c1
adamc@86 555 val (r2, gs2) = recordSummary (env, denv) c2
adamc@12 556 in
adamc@12 557 unifyKinds k1 k2;
adamc@86 558 unifySummaries (env, denv) (k1, r1, r2);
adamc@86 559 gs1 @ gs2
adamc@12 560 end
adamc@12 561
adamc@86 562 and recordSummary (env, denv) c =
adamc@86 563 let
adamc@86 564 val (c, gs) = hnormCon (env, denv) c
adamc@12 565
adamc@86 566 val (sum, gs') =
adamc@86 567 case c of
adamc@86 568 (L'.CRecord (_, xcs), _) => ({fields = xcs, unifs = [], others = []}, [])
adamc@86 569 | (L'.CConcat (c1, c2), _) =>
adamc@86 570 let
adamc@86 571 val (s1, gs1) = recordSummary (env, denv) c1
adamc@86 572 val (s2, gs2) = recordSummary (env, denv) c2
adamc@86 573 in
adamc@86 574 ({fields = #fields s1 @ #fields s2,
adamc@86 575 unifs = #unifs s1 @ #unifs s2,
adamc@86 576 others = #others s1 @ #others s2},
adamc@86 577 gs1 @ gs2)
adamc@86 578 end
adamc@86 579 | (L'.CUnif (_, _, _, ref (SOME c)), _) => recordSummary (env, denv) c
adamc@86 580 | c' as (L'.CUnif (_, _, _, r), _) => ({fields = [], unifs = [(c', r)], others = []}, [])
adamc@86 581 | c' => ({fields = [], unifs = [], others = [c']}, [])
adamc@86 582 in
adamc@86 583 (sum, gs @ gs')
adamc@86 584 end
adamc@86 585
adamc@86 586 and consEq (env, denv) (c1, c2) =
adamc@86 587 (case unifyCons (env, denv) c1 c2 of
adamc@86 588 [] => true
adamc@86 589 | _ => false)
adamc@12 590 handle CUnify _ => false
adamc@12 591
adamc@80 592 and consNeq env (c1, c2) =
adamc@86 593 case (#1 (ElabOps.hnormCon env c1), #1 (ElabOps.hnormCon env c2)) of
adamc@80 594 (L'.CName x1, L'.CName x2) => x1 <> x2
adamc@80 595 | _ => false
adamc@80 596
adamc@86 597 and unifySummaries (env, denv) (k, s1 : record_summary, s2 : record_summary) =
adamc@12 598 let
adamc@14 599 (*val () = eprefaces "Summaries" [("#1", p_summary env s1),
adamc@14 600 ("#2", p_summary env s2)]*)
adamc@12 601
adamc@12 602 fun eatMatching p (ls1, ls2) =
adamc@12 603 let
adamc@12 604 fun em (ls1, ls2, passed1) =
adamc@12 605 case ls1 of
adamc@12 606 [] => (rev passed1, ls2)
adamc@12 607 | h1 :: t1 =>
adamc@12 608 let
adamc@12 609 fun search (ls2', passed2) =
adamc@12 610 case ls2' of
adamc@12 611 [] => em (t1, ls2, h1 :: passed1)
adamc@12 612 | h2 :: t2 =>
adamc@12 613 if p (h1, h2) then
adamc@12 614 em (t1, List.revAppend (passed2, t2), passed1)
adamc@12 615 else
adamc@12 616 search (t2, h2 :: passed2)
adamc@12 617 in
adamc@12 618 search (ls2, [])
adamc@12 619 end
adamc@12 620 in
adamc@12 621 em (ls1, ls2, [])
adamc@12 622 end
adamc@12 623
adamc@12 624 val (fs1, fs2) = eatMatching (fn ((x1, c1), (x2, c2)) =>
adamc@80 625 not (consNeq env (x1, x2))
adamc@86 626 andalso consEq (env, denv) (c1, c2)
adamc@86 627 andalso consEq (env, denv) (x1, x2))
adamc@79 628 (#fields s1, #fields s2)
adamc@14 629 (*val () = eprefaces "Summaries2" [("#1", p_summary env {fields = fs1, unifs = #unifs s1, others = #others s1}),
adamc@14 630 ("#2", p_summary env {fields = fs2, unifs = #unifs s2, others = #others s2})]*)
adamc@12 631 val (unifs1, unifs2) = eatMatching (fn ((_, r1), (_, r2)) => r1 = r2) (#unifs s1, #unifs s2)
adamc@86 632 val (others1, others2) = eatMatching (consEq (env, denv)) (#others s1, #others s2)
adamc@12 633
adamc@12 634 fun unifFields (fs, others, unifs) =
adamc@12 635 case (fs, others, unifs) of
adamc@12 636 ([], [], _) => ([], [], unifs)
adamc@12 637 | (_, _, []) => (fs, others, [])
adamc@12 638 | (_, _, (_, r) :: rest) =>
adamc@12 639 let
adamc@12 640 val r' = ref NONE
adamc@76 641 val cr' = (L'.CUnif (dummy, k, "recd", r'), dummy)
adamc@12 642
adamc@12 643 val prefix = case (fs, others) of
adamc@12 644 ([], other :: others) =>
adamc@12 645 List.foldl (fn (other, c) =>
adamc@12 646 (L'.CConcat (c, other), dummy))
adamc@12 647 other others
adamc@12 648 | (fs, []) =>
adamc@12 649 (L'.CRecord (k, fs), dummy)
adamc@12 650 | (fs, others) =>
adamc@12 651 List.foldl (fn (other, c) =>
adamc@12 652 (L'.CConcat (c, other), dummy))
adamc@12 653 (L'.CRecord (k, fs), dummy) others
adamc@12 654 in
adamc@12 655 r := SOME (L'.CConcat (prefix, cr'), dummy);
adamc@12 656 ([], [], (cr', r') :: rest)
adamc@12 657 end
adamc@12 658
adamc@12 659 val (fs1, others1, unifs2) = unifFields (fs1, others1, unifs2)
adamc@12 660 val (fs2, others2, unifs1) = unifFields (fs2, others2, unifs1)
adamc@12 661
adamc@86 662 val clear = case (fs1, others1, fs2, others2) of
adamc@86 663 ([], [], [], []) => true
adamc@12 664 | _ => false
adamc@12 665 val empty = (L'.CRecord (k, []), dummy)
adamc@12 666 fun pairOffUnifs (unifs1, unifs2) =
adamc@12 667 case (unifs1, unifs2) of
adamc@12 668 ([], _) =>
adamc@86 669 if clear then
adamc@12 670 List.app (fn (_, r) => r := SOME empty) unifs2
adamc@12 671 else
adamc@12 672 raise CUnify' CRecordFailure
adamc@12 673 | (_, []) =>
adamc@86 674 if clear then
adamc@12 675 List.app (fn (_, r) => r := SOME empty) unifs1
adamc@12 676 else
adamc@12 677 raise CUnify' CRecordFailure
adamc@12 678 | ((c1, _) :: rest1, (_, r2) :: rest2) =>
adamc@12 679 (r2 := SOME c1;
adamc@12 680 pairOffUnifs (rest1, rest2))
adamc@12 681 in
adamc@12 682 pairOffUnifs (unifs1, unifs2)
adamc@12 683 end
adamc@12 684
adamc@86 685 and unifyCons' (env, denv) c1 c2 =
adamc@86 686 let
adamc@86 687 val (c1, gs1) = hnormCon (env, denv) c1
adamc@86 688 val (c2, gs2) = hnormCon (env, denv) c2
adamc@90 689 val gs3 = unifyCons'' (env, denv) c1 c2
adamc@86 690 in
adamc@90 691 gs1 @ gs2 @ gs3
adamc@86 692 end
adamc@11 693
adamc@86 694 and unifyCons'' (env, denv) (c1All as (c1, _)) (c2All as (c2, _)) =
adamc@10 695 let
adamc@10 696 fun err f = raise CUnify' (f (c1All, c2All))
adamc@12 697
adamc@86 698 fun isRecord () = unifyRecordCons (env, denv) (c1All, c2All)
adamc@10 699 in
adamc@10 700 case (c1, c2) of
adamc@88 701 (L'.CUnit, L'.CUnit) => []
adamc@88 702
adamc@88 703 | (L'.TFun (d1, r1), L'.TFun (d2, r2)) =>
adamc@86 704 unifyCons' (env, denv) d1 d2
adamc@86 705 @ unifyCons' (env, denv) r1 r2
adamc@10 706 | (L'.TCFun (expl1, x1, d1, r1), L'.TCFun (expl2, _, d2, r2)) =>
adamc@10 707 if expl1 <> expl2 then
adamc@10 708 err CExplicitness
adamc@10 709 else
adamc@10 710 (unifyKinds d1 d2;
adamc@86 711 unifyCons' (E.pushCRel env x1 d1, D.enter denv) r1 r2)
adamc@86 712 | (L'.TRecord r1, L'.TRecord r2) => unifyCons' (env, denv) r1 r2
adamc@10 713
adamc@10 714 | (L'.CRel n1, L'.CRel n2) =>
adamc@10 715 if n1 = n2 then
adamc@86 716 []
adamc@10 717 else
adamc@10 718 err CIncompatible
adamc@10 719 | (L'.CNamed n1, L'.CNamed n2) =>
adamc@10 720 if n1 = n2 then
adamc@86 721 []
adamc@10 722 else
adamc@10 723 err CIncompatible
adamc@10 724
adamc@10 725 | (L'.CApp (d1, r1), L'.CApp (d2, r2)) =>
adamc@86 726 (unifyCons' (env, denv) d1 d2;
adamc@86 727 unifyCons' (env, denv) r1 r2)
adamc@10 728 | (L'.CAbs (x1, k1, c1), L'.CAbs (_, k2, c2)) =>
adamc@10 729 (unifyKinds k1 k2;
adamc@86 730 unifyCons' (E.pushCRel env x1 k1, D.enter denv) c1 c2)
adamc@10 731
adamc@10 732 | (L'.CName n1, L'.CName n2) =>
adamc@10 733 if n1 = n2 then
adamc@86 734 []
adamc@10 735 else
adamc@10 736 err CIncompatible
adamc@10 737
adamc@34 738 | (L'.CModProj (n1, ms1, x1), L'.CModProj (n2, ms2, x2)) =>
adamc@34 739 if n1 = n2 andalso ms1 = ms2 andalso x1 = x2 then
adamc@86 740 []
adamc@34 741 else
adamc@34 742 err CIncompatible
adamc@34 743
adamc@86 744 | (L'.CError, _) => []
adamc@86 745 | (_, L'.CError) => []
adamc@10 746
adamc@86 747 | (L'.CUnif (_, _, _, ref (SOME c1All)), _) => unifyCons' (env, denv) c1All c2All
adamc@86 748 | (_, L'.CUnif (_, _, _, ref (SOME c2All))) => unifyCons' (env, denv) c1All c2All
adamc@10 749
adamc@76 750 | (L'.CUnif (_, k1, _, r1), L'.CUnif (_, k2, _, r2)) =>
adamc@10 751 if r1 = r2 then
adamc@86 752 []
adamc@10 753 else
adamc@10 754 (unifyKinds k1 k2;
adamc@86 755 r1 := SOME c2All;
adamc@86 756 [])
adamc@10 757
adamc@76 758 | (L'.CUnif (_, _, _, r), _) =>
adamc@10 759 if occursCon r c2All then
adamc@10 760 err COccursCheckFailed
adamc@10 761 else
adamc@86 762 (r := SOME c2All;
adamc@86 763 [])
adamc@76 764 | (_, L'.CUnif (_, _, _, r)) =>
adamc@10 765 if occursCon r c1All then
adamc@10 766 err COccursCheckFailed
adamc@10 767 else
adamc@86 768 (r := SOME c1All;
adamc@86 769 [])
adamc@10 770
adamc@12 771 | (L'.CRecord _, _) => isRecord ()
adamc@12 772 | (_, L'.CRecord _) => isRecord ()
adamc@12 773 | (L'.CConcat _, _) => isRecord ()
adamc@12 774 | (_, L'.CConcat _) => isRecord ()
adamc@12 775
adamc@71 776 | (L'.CFold (dom1, ran1), L'.CFold (dom2, ran2)) =>
adamc@71 777 (unifyKinds dom1 dom2;
adamc@86 778 unifyKinds ran1 ran2;
adamc@86 779 [])
adamc@71 780
adamc@10 781 | _ => err CIncompatible
adamc@10 782 end
adamc@10 783
adamc@86 784 and unifyCons (env, denv) c1 c2 =
adamc@86 785 unifyCons' (env, denv) c1 c2
adamc@10 786 handle CUnify' err => raise CUnify (c1, c2, err)
adamc@10 787 | KUnify args => raise CUnify (c1, c2, CKind args)
adamc@10 788
adamc@10 789 datatype exp_error =
adamc@10 790 UnboundExp of ErrorMsg.span * string
adamc@34 791 | UnboundStrInExp of ErrorMsg.span * string
adamc@10 792 | Unify of L'.exp * L'.con * L'.con * cunify_error
adamc@11 793 | Unif of string * L'.con
adamc@11 794 | WrongForm of string * L'.exp * L'.con
adamc@10 795
adamc@10 796 fun expError env err =
adamc@10 797 case err of
adamc@10 798 UnboundExp (loc, s) =>
adamc@10 799 ErrorMsg.errorAt loc ("Unbound expression variable " ^ s)
adamc@34 800 | UnboundStrInExp (loc, s) =>
adamc@34 801 ErrorMsg.errorAt loc ("Unbound structure " ^ s)
adamc@10 802 | Unify (e, c1, c2, uerr) =>
adamc@10 803 (ErrorMsg.errorAt (#2 e) "Unification failure";
adamc@10 804 eprefaces' [("Expression", p_exp env e),
adamc@10 805 ("Have con", p_con env c1),
adamc@10 806 ("Need con", p_con env c2)];
adamc@10 807 cunifyError env uerr)
adamc@11 808 | Unif (action, c) =>
adamc@11 809 (ErrorMsg.errorAt (#2 c) ("Unification variable blocks " ^ action);
adamc@11 810 eprefaces' [("Con", p_con env c)])
adamc@11 811 | WrongForm (variety, e, t) =>
adamc@11 812 (ErrorMsg.errorAt (#2 e) ("Expression is not a " ^ variety);
adamc@11 813 eprefaces' [("Expression", p_exp env e),
adamc@11 814 ("Type", p_con env t)])
adamc@10 815
adamc@86 816 fun checkCon (env, denv) e c1 c2 =
adamc@86 817 unifyCons (env, denv) c1 c2
adamc@10 818 handle CUnify (c1, c2, err) =>
adamc@86 819 (expError env (Unify (e, c1, c2, err));
adamc@86 820 [])
adamc@10 821
adamc@14 822 fun primType env p =
adamc@56 823 case p of
adamc@56 824 P.Int _ => !int
adamc@56 825 | P.Float _ => !float
adamc@56 826 | P.String _ => !string
adamc@14 827
adamc@71 828 fun recCons (k, nm, v, rest, loc) =
adamc@71 829 (L'.CConcat ((L'.CRecord (k, [(nm, v)]), loc),
adamc@71 830 rest), loc)
adamc@71 831
adamc@71 832 fun foldType (dom, loc) =
adamc@71 833 (L'.TCFun (L'.Explicit, "ran", (L'.KArrow ((L'.KRecord dom, loc), (L'.KType, loc)), loc),
adamc@71 834 (L'.TFun ((L'.TCFun (L'.Explicit, "nm", (L'.KName, loc),
adamc@71 835 (L'.TCFun (L'.Explicit, "v", dom,
adamc@71 836 (L'.TCFun (L'.Explicit, "rest", (L'.KRecord dom, loc),
adamc@71 837 (L'.TFun ((L'.CApp ((L'.CRel 3, loc), (L'.CRel 0, loc)), loc),
adamc@71 838 (L'.CApp ((L'.CRel 3, loc),
adamc@71 839 recCons (dom,
adamc@71 840 (L'.CRel 2, loc),
adamc@71 841 (L'.CRel 1, loc),
adamc@71 842 (L'.CRel 0, loc),
adamc@71 843 loc)), loc)), loc)),
adamc@71 844 loc)), loc)), loc),
adamc@71 845 (L'.TFun ((L'.CApp ((L'.CRel 0, loc), (L'.CRecord (dom, []), loc)), loc),
adamc@71 846 (L'.TCFun (L'.Explicit, "r", (L'.KRecord dom, loc),
adamc@71 847 (L'.CApp ((L'.CRel 1, loc), (L'.CRel 0, loc)), loc)), loc)),
adamc@71 848 loc)), loc)), loc)
adamc@71 849
adamc@15 850 fun typeof env (e, loc) =
adamc@15 851 case e of
adamc@56 852 L'.EPrim p => primType env p
adamc@15 853 | L'.ERel n => #2 (E.lookupERel env n)
adamc@15 854 | L'.ENamed n => #2 (E.lookupENamed env n)
adamc@34 855 | L'.EModProj (n, ms, x) =>
adamc@34 856 let
adamc@34 857 val (_, sgn) = E.lookupStrNamed env n
adamc@34 858 val (str, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@34 859 case E.projectStr env {sgn = sgn, str = str, field = m} of
adamc@34 860 NONE => raise Fail "kindof: Unknown substructure"
adamc@34 861 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@34 862 ((L'.StrVar n, loc), sgn) ms
adamc@34 863 in
adamc@34 864 case E.projectVal env {sgn = sgn, str = str, field = x} of
adamc@34 865 NONE => raise Fail "typeof: Unknown val in structure"
adamc@34 866 | SOME t => t
adamc@34 867 end
adamc@34 868
adamc@15 869 | L'.EApp (e1, _) =>
adamc@15 870 (case #1 (typeof env e1) of
adamc@15 871 L'.TFun (_, c) => c
adamc@15 872 | _ => raise Fail "typeof: Bad EApp")
adamc@26 873 | L'.EAbs (_, _, ran, _) => ran
adamc@15 874 | L'.ECApp (e1, c) =>
adamc@15 875 (case #1 (typeof env e1) of
adamc@15 876 L'.TCFun (_, _, _, c1) => subConInCon (0, c) c1
adamc@15 877 | _ => raise Fail "typeof: Bad ECApp")
adamc@15 878 | L'.ECAbs (expl, x, k, e1) => (L'.TCFun (expl, x, k, typeof (E.pushCRel env x k) e1), loc)
adamc@15 879
adamc@29 880 | L'.ERecord xes => (L'.TRecord (L'.CRecord (ktype, map (fn (x, _, t) => (x, t)) xes), loc), loc)
adamc@15 881 | L'.EField (_, _, {field, ...}) => field
adamc@71 882 | L'.EFold dom => foldType (dom, loc)
adamc@15 883
adamc@15 884 | L'.EError => cerror
adamc@15 885
adamc@86 886 fun elabHead (env, denv) (e as (_, loc)) t =
adamc@15 887 let
adamc@15 888 fun unravel (t, e) =
adamc@86 889 let
adamc@86 890 val (t, gs) = hnormCon (env, denv) t
adamc@86 891 in
adamc@86 892 case t of
adamc@86 893 (L'.TCFun (L'.Implicit, x, k, t'), _) =>
adamc@86 894 let
adamc@86 895 val u = cunif (loc, k)
adamc@86 896
adamc@86 897 val (e, t, gs') = unravel (subConInCon (0, u) t',
adamc@86 898 (L'.ECApp (e, u), loc))
adamc@86 899 in
adamc@86 900 (e, t, gs @ gs')
adamc@86 901 end
adamc@86 902 | _ => (e, t, gs)
adamc@86 903 end
adamc@15 904 in
adamc@15 905 unravel (t, e)
adamc@15 906 end
adamc@15 907
adamc@83 908 fun elabExp (env, denv) (e, loc) =
adamc@10 909 case e of
adamc@10 910 L.EAnnot (e, t) =>
adamc@10 911 let
adamc@83 912 val (e', et, gs1) = elabExp (env, denv) e
adamc@83 913 val (t', _, gs2) = elabCon (env, denv) t
adamc@86 914 val gs3 = checkCon (env, denv) e' et t'
adamc@10 915 in
adamc@86 916 (e', t', gs1 @ gs2 @ gs3)
adamc@10 917 end
adamc@10 918
adamc@83 919 | L.EPrim p => ((L'.EPrim p, loc), primType env p, [])
adamc@34 920 | L.EVar ([], s) =>
adamc@10 921 (case E.lookupE env s of
adamc@10 922 E.NotBound =>
adamc@10 923 (expError env (UnboundExp (loc, s));
adamc@83 924 (eerror, cerror, []))
adamc@83 925 | E.Rel (n, t) => ((L'.ERel n, loc), t, [])
adamc@83 926 | E.Named (n, t) => ((L'.ENamed n, loc), t, []))
adamc@34 927 | L.EVar (m1 :: ms, s) =>
adamc@34 928 (case E.lookupStr env m1 of
adamc@42 929 NONE => (expError env (UnboundStrInExp (loc, m1));
adamc@83 930 (eerror, cerror, []))
adamc@34 931 | SOME (n, sgn) =>
adamc@34 932 let
adamc@34 933 val (str, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@34 934 case E.projectStr env {sgn = sgn, str = str, field = m} of
adamc@34 935 NONE => (conError env (UnboundStrInCon (loc, m));
adamc@34 936 (strerror, sgnerror))
adamc@34 937 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@34 938 ((L'.StrVar n, loc), sgn) ms
adamc@34 939
adamc@34 940 val t = case E.projectVal env {sgn = sgn, str = str, field = s} of
adamc@34 941 NONE => (expError env (UnboundExp (loc, s));
adamc@34 942 cerror)
adamc@34 943 | SOME t => t
adamc@34 944 in
adamc@83 945 ((L'.EModProj (n, ms, s), loc), t, [])
adamc@34 946 end)
adamc@34 947
adamc@10 948 | L.EApp (e1, e2) =>
adamc@10 949 let
adamc@83 950 val (e1', t1, gs1) = elabExp (env, denv) e1
adamc@86 951 val (e1', t1, gs2) = elabHead (env, denv) e1' t1
adamc@86 952 val (e2', t2, gs3) = elabExp (env, denv) e2
adamc@10 953
adamc@76 954 val dom = cunif (loc, ktype)
adamc@76 955 val ran = cunif (loc, ktype)
adamc@10 956 val t = (L'.TFun (dom, ran), dummy)
adamc@86 957
adamc@86 958 val gs4 = checkCon (env, denv) e1' t1 t
adamc@86 959 val gs5 = checkCon (env, denv) e2' t2 dom
adamc@10 960 in
adamc@86 961 ((L'.EApp (e1', e2'), loc), ran, gs1 @ gs2 @ gs3 @ gs4 @ gs5)
adamc@10 962 end
adamc@10 963 | L.EAbs (x, to, e) =>
adamc@10 964 let
adamc@83 965 val (t', gs1) = case to of
adamc@83 966 NONE => (cunif (loc, ktype), [])
adamc@83 967 | SOME t =>
adamc@83 968 let
adamc@83 969 val (t', tk, gs) = elabCon (env, denv) t
adamc@83 970 in
adamc@83 971 checkKind env t' tk ktype;
adamc@83 972 (t', gs)
adamc@83 973 end
adamc@83 974 val (e', et, gs2) = elabExp (E.pushERel env x t', denv) e
adamc@10 975 in
adamc@26 976 ((L'.EAbs (x, t', et, e'), loc),
adamc@83 977 (L'.TFun (t', et), loc),
adamc@83 978 gs1 @ gs2)
adamc@10 979 end
adamc@10 980 | L.ECApp (e, c) =>
adamc@10 981 let
adamc@83 982 val (e', et, gs1) = elabExp (env, denv) e
adamc@86 983 val (e', et, gs2) = elabHead (env, denv) e' et
adamc@86 984 val (c', ck, gs3) = elabCon (env, denv) c
adamc@86 985 val ((et', _), gs4) = hnormCon (env, denv) et
adamc@10 986 in
adamc@86 987 case et' of
adamc@83 988 L'.CError => (eerror, cerror, [])
adamc@11 989 | L'.TCFun (_, _, k, eb) =>
adamc@11 990 let
adamc@11 991 val () = checkKind env c' ck k
adamc@11 992 val eb' = subConInCon (0, c') eb
adamc@11 993 handle SynUnif => (expError env (Unif ("substitution", eb));
adamc@11 994 cerror)
adamc@11 995 in
adamc@86 996 ((L'.ECApp (e', c'), loc), eb', gs1 @ gs2 @ gs3 @ gs4)
adamc@11 997 end
adamc@11 998
adamc@11 999 | L'.CUnif _ =>
adamc@11 1000 (expError env (Unif ("application", et));
adamc@83 1001 (eerror, cerror, []))
adamc@11 1002
adamc@11 1003 | _ =>
adamc@11 1004 (expError env (WrongForm ("constructor function", e', et));
adamc@83 1005 (eerror, cerror, []))
adamc@10 1006 end
adamc@11 1007 | L.ECAbs (expl, x, k, e) =>
adamc@11 1008 let
adamc@11 1009 val expl' = elabExplicitness expl
adamc@11 1010 val k' = elabKind k
adamc@83 1011 val (e', et, gs) = elabExp (E.pushCRel env x k', D.enter denv) e
adamc@11 1012 in
adamc@11 1013 ((L'.ECAbs (expl', x, k', e'), loc),
adamc@83 1014 (L'.TCFun (expl', x, k', et), loc),
adamc@83 1015 gs)
adamc@11 1016 end
adamc@6 1017
adamc@85 1018 | L.EDisjoint (c1, c2, e) =>
adamc@85 1019 let
adamc@85 1020 val (c1', k1, gs1) = elabCon (env, denv) c1
adamc@85 1021 val (c2', k2, gs2) = elabCon (env, denv) c2
adamc@85 1022
adamc@85 1023 val ku1 = kunif loc
adamc@85 1024 val ku2 = kunif loc
adamc@85 1025
adamc@90 1026 val (denv', gs3) = D.assert env denv (c1', c2')
adamc@90 1027 val (e', t, gs4) = elabExp (env, denv') e
adamc@85 1028 in
adamc@85 1029 checkKind env c1' k1 (L'.KRecord ku1, loc);
adamc@85 1030 checkKind env c2' k2 (L'.KRecord ku2, loc);
adamc@85 1031
adamc@90 1032 (e', (L'.TDisjoint (c1', c2', t), loc), gs1 @ gs2 @ gs3 @ gs4)
adamc@85 1033 end
adamc@85 1034
adamc@12 1035 | L.ERecord xes =>
adamc@12 1036 let
adamc@83 1037 val (xes', gs) = ListUtil.foldlMap (fn ((x, e), gs) =>
adamc@83 1038 let
adamc@83 1039 val (x', xk, gs1) = elabCon (env, denv) x
adamc@83 1040 val (e', et, gs2) = elabExp (env, denv) e
adamc@83 1041 in
adamc@83 1042 checkKind env x' xk kname;
adamc@83 1043 ((x', e', et), gs1 @ gs2 @ gs)
adamc@83 1044 end)
adamc@83 1045 [] xes
adamc@86 1046
adamc@86 1047 val k = (L'.KType, loc)
adamc@86 1048
adamc@86 1049 fun prove (xets, gs) =
adamc@86 1050 case xets of
adamc@86 1051 [] => gs
adamc@86 1052 | (x, _, t) :: rest =>
adamc@86 1053 let
adamc@86 1054 val xc = (x, t)
adamc@86 1055 val r1 = (L'.CRecord (k, [xc]), loc)
adamc@86 1056 val gs = foldl (fn ((x', _, t'), gs) =>
adamc@86 1057 let
adamc@86 1058 val xc' = (x', t')
adamc@86 1059 val r2 = (L'.CRecord (k, [xc']), loc)
adamc@86 1060 in
adamc@90 1061 D.prove env denv (r1, r2, loc) @ gs
adamc@86 1062 end)
adamc@86 1063 gs rest
adamc@86 1064 in
adamc@86 1065 prove (rest, gs)
adamc@86 1066 end
adamc@12 1067 in
adamc@29 1068 ((L'.ERecord xes', loc),
adamc@83 1069 (L'.TRecord (L'.CRecord (ktype, map (fn (x', _, et) => (x', et)) xes'), loc), loc),
adamc@86 1070 prove (xes', gs))
adamc@12 1071 end
adamc@12 1072
adamc@12 1073 | L.EField (e, c) =>
adamc@12 1074 let
adamc@83 1075 val (e', et, gs1) = elabExp (env, denv) e
adamc@83 1076 val (c', ck, gs2) = elabCon (env, denv) c
adamc@12 1077
adamc@76 1078 val ft = cunif (loc, ktype)
adamc@76 1079 val rest = cunif (loc, ktype_record)
adamc@86 1080 val first = (L'.CRecord (ktype, [(c', ft)]), loc)
adamc@86 1081
adamc@86 1082 val gs3 =
adamc@86 1083 checkCon (env, denv) e' et
adamc@86 1084 (L'.TRecord (L'.CConcat (first, rest), loc), loc)
adamc@90 1085 val gs4 = D.prove env denv (first, rest, loc)
adamc@12 1086 in
adamc@86 1087 ((L'.EField (e', c', {field = ft, rest = rest}), loc), ft, gs1 @ gs2 @ gs3 @ gs4)
adamc@12 1088 end
adamc@71 1089
adamc@71 1090 | L.EFold =>
adamc@71 1091 let
adamc@76 1092 val dom = kunif loc
adamc@71 1093 in
adamc@83 1094 ((L'.EFold dom, loc), foldType (dom, loc), [])
adamc@71 1095 end
adamc@12 1096
adamc@12 1097
adamc@6 1098 datatype decl_error =
adamc@76 1099 KunifsRemain of ErrorMsg.span
adamc@76 1100 | CunifsRemain of ErrorMsg.span
adamc@6 1101
adamc@6 1102 fun declError env err =
adamc@6 1103 case err of
adamc@76 1104 KunifsRemain loc =>
adamc@76 1105 ErrorMsg.errorAt loc "Some kind unification variables are undetermined in declaration"
adamc@76 1106 | CunifsRemain loc =>
adamc@76 1107 ErrorMsg.errorAt loc "Some constructor unification variables are undetermined in declaration"
adamc@6 1108
adamc@31 1109 datatype sgn_error =
adamc@31 1110 UnboundSgn of ErrorMsg.span * string
adamc@31 1111 | UnmatchedSgi of L'.sgn_item
adamc@31 1112 | SgiWrongKind of L'.sgn_item * L'.kind * L'.sgn_item * L'.kind * kunify_error
adamc@31 1113 | SgiWrongCon of L'.sgn_item * L'.con * L'.sgn_item * L'.con * cunify_error
adamc@41 1114 | SgnWrongForm of L'.sgn * L'.sgn
adamc@42 1115 | UnWhereable of L'.sgn * string
adamc@75 1116 | WhereWrongKind of L'.kind * L'.kind * kunify_error
adamc@58 1117 | NotIncludable of L'.sgn
adamc@62 1118 | DuplicateCon of ErrorMsg.span * string
adamc@62 1119 | DuplicateVal of ErrorMsg.span * string
adamc@62 1120 | DuplicateSgn of ErrorMsg.span * string
adamc@62 1121 | DuplicateStr of ErrorMsg.span * string
adamc@88 1122 | NotConstraintsable of L'.sgn
adamc@31 1123
adamc@31 1124 fun sgnError env err =
adamc@31 1125 case err of
adamc@31 1126 UnboundSgn (loc, s) =>
adamc@31 1127 ErrorMsg.errorAt loc ("Unbound signature variable " ^ s)
adamc@31 1128 | UnmatchedSgi (sgi as (_, loc)) =>
adamc@31 1129 (ErrorMsg.errorAt loc "Unmatched signature item";
adamc@31 1130 eprefaces' [("Item", p_sgn_item env sgi)])
adamc@31 1131 | SgiWrongKind (sgi1, k1, sgi2, k2, kerr) =>
adamc@31 1132 (ErrorMsg.errorAt (#2 sgi1) "Kind unification failure in signature matching:";
adamc@59 1133 eprefaces' [("Have", p_sgn_item env sgi1),
adamc@59 1134 ("Need", p_sgn_item env sgi2),
adamc@31 1135 ("Kind 1", p_kind k1),
adamc@31 1136 ("Kind 2", p_kind k2)];
adamc@31 1137 kunifyError kerr)
adamc@31 1138 | SgiWrongCon (sgi1, c1, sgi2, c2, cerr) =>
adamc@31 1139 (ErrorMsg.errorAt (#2 sgi1) "Constructor unification failure in signature matching:";
adamc@59 1140 eprefaces' [("Have", p_sgn_item env sgi1),
adamc@59 1141 ("Need", p_sgn_item env sgi2),
adamc@31 1142 ("Con 1", p_con env c1),
adamc@31 1143 ("Con 2", p_con env c2)];
adamc@31 1144 cunifyError env cerr)
adamc@41 1145 | SgnWrongForm (sgn1, sgn2) =>
adamc@41 1146 (ErrorMsg.errorAt (#2 sgn1) "Incompatible signatures:";
adamc@41 1147 eprefaces' [("Sig 1", p_sgn env sgn1),
adamc@41 1148 ("Sig 2", p_sgn env sgn2)])
adamc@42 1149 | UnWhereable (sgn, x) =>
adamc@42 1150 (ErrorMsg.errorAt (#2 sgn) "Unavailable field for 'where'";
adamc@42 1151 eprefaces' [("Signature", p_sgn env sgn),
adamc@42 1152 ("Field", PD.string x)])
adamc@75 1153 | WhereWrongKind (k1, k2, kerr) =>
adamc@75 1154 (ErrorMsg.errorAt (#2 k1) "Wrong kind for 'where'";
adamc@75 1155 eprefaces' [("Have", p_kind k1),
adamc@75 1156 ("Need", p_kind k2)];
adamc@75 1157 kunifyError kerr)
adamc@58 1158 | NotIncludable sgn =>
adamc@58 1159 (ErrorMsg.errorAt (#2 sgn) "Invalid signature to 'include'";
adamc@58 1160 eprefaces' [("Signature", p_sgn env sgn)])
adamc@62 1161 | DuplicateCon (loc, s) =>
adamc@62 1162 ErrorMsg.errorAt loc ("Duplicate constructor " ^ s ^ " in signature")
adamc@62 1163 | DuplicateVal (loc, s) =>
adamc@62 1164 ErrorMsg.errorAt loc ("Duplicate value " ^ s ^ " in signature")
adamc@62 1165 | DuplicateSgn (loc, s) =>
adamc@62 1166 ErrorMsg.errorAt loc ("Duplicate signature " ^ s ^ " in signature")
adamc@62 1167 | DuplicateStr (loc, s) =>
adamc@62 1168 ErrorMsg.errorAt loc ("Duplicate structure " ^ s ^ " in signature")
adamc@88 1169 | NotConstraintsable sgn =>
adamc@88 1170 (ErrorMsg.errorAt (#2 sgn) "Invalid signature for 'open constraints'";
adamc@88 1171 eprefaces' [("Signature", p_sgn env sgn)])
adamc@31 1172
adamc@31 1173 datatype str_error =
adamc@31 1174 UnboundStr of ErrorMsg.span * string
adamc@44 1175 | NotFunctor of L'.sgn
adamc@46 1176 | FunctorRebind of ErrorMsg.span
adamc@61 1177 | UnOpenable of L'.sgn
adamc@75 1178 | NotType of L'.kind * (L'.kind * L'.kind * kunify_error)
adamc@31 1179
adamc@31 1180 fun strError env err =
adamc@31 1181 case err of
adamc@31 1182 UnboundStr (loc, s) =>
adamc@31 1183 ErrorMsg.errorAt loc ("Unbound structure variable " ^ s)
adamc@44 1184 | NotFunctor sgn =>
adamc@44 1185 (ErrorMsg.errorAt (#2 sgn) "Application of non-functor";
adamc@44 1186 eprefaces' [("Signature", p_sgn env sgn)])
adamc@46 1187 | FunctorRebind loc =>
adamc@46 1188 ErrorMsg.errorAt loc "Attempt to rebind functor"
adamc@61 1189 | UnOpenable sgn =>
adamc@61 1190 (ErrorMsg.errorAt (#2 sgn) "Un-openable structure";
adamc@61 1191 eprefaces' [("Signature", p_sgn env sgn)])
adamc@75 1192 | NotType (k, (k1, k2, ue)) =>
adamc@75 1193 (ErrorMsg.errorAt (#2 k) "'val' type kind is not 'Type'";
adamc@75 1194 eprefaces' [("Kind", p_kind k),
adamc@75 1195 ("Subkind 1", p_kind k1),
adamc@75 1196 ("Subkind 2", p_kind k2)];
adamc@75 1197 kunifyError ue)
adamc@31 1198
adamc@42 1199 val hnormSgn = E.hnormSgn
adamc@31 1200
adamc@88 1201 fun elabSgn_item ((sgi, loc), (env, denv, gs)) =
adamc@76 1202 case sgi of
adamc@76 1203 L.SgiConAbs (x, k) =>
adamc@76 1204 let
adamc@76 1205 val k' = elabKind k
adamc@31 1206
adamc@76 1207 val (env', n) = E.pushCNamed env x k' NONE
adamc@76 1208 in
adamc@88 1209 ([(L'.SgiConAbs (x, n, k'), loc)], (env', denv, gs))
adamc@76 1210 end
adamc@31 1211
adamc@76 1212 | L.SgiCon (x, ko, c) =>
adamc@76 1213 let
adamc@76 1214 val k' = case ko of
adamc@76 1215 NONE => kunif loc
adamc@76 1216 | SOME k => elabKind k
adamc@31 1217
adamc@83 1218 val (c', ck, gs') = elabCon (env, denv) c
adamc@76 1219 val (env', n) = E.pushCNamed env x k' (SOME c')
adamc@76 1220 in
adamc@76 1221 checkKind env c' ck k';
adamc@31 1222
adamc@88 1223 ([(L'.SgiCon (x, n, k', c'), loc)], (env', denv, gs' @ gs))
adamc@76 1224 end
adamc@31 1225
adamc@76 1226 | L.SgiVal (x, c) =>
adamc@76 1227 let
adamc@83 1228 val (c', ck, gs') = elabCon (env, denv) c
adamc@31 1229
adamc@76 1230 val (env', n) = E.pushENamed env x c'
adamc@76 1231 in
adamc@76 1232 (unifyKinds ck ktype
adamc@76 1233 handle KUnify ue => strError env (NotType (ck, ue)));
adamc@31 1234
adamc@88 1235 ([(L'.SgiVal (x, n, c'), loc)], (env', denv, gs' @ gs))
adamc@76 1236 end
adamc@31 1237
adamc@76 1238 | L.SgiStr (x, sgn) =>
adamc@76 1239 let
adamc@83 1240 val (sgn', gs') = elabSgn (env, denv) sgn
adamc@76 1241 val (env', n) = E.pushStrNamed env x sgn'
adamc@76 1242 in
adamc@88 1243 ([(L'.SgiStr (x, n, sgn'), loc)], (env', denv, gs' @ gs))
adamc@76 1244 end
adamc@31 1245
adamc@76 1246 | L.SgiSgn (x, sgn) =>
adamc@76 1247 let
adamc@83 1248 val (sgn', gs') = elabSgn (env, denv) sgn
adamc@76 1249 val (env', n) = E.pushSgnNamed env x sgn'
adamc@76 1250 in
adamc@88 1251 ([(L'.SgiSgn (x, n, sgn'), loc)], (env', denv, gs' @ gs))
adamc@76 1252 end
adamc@31 1253
adamc@76 1254 | L.SgiInclude sgn =>
adamc@76 1255 let
adamc@83 1256 val (sgn', gs') = elabSgn (env, denv) sgn
adamc@76 1257 in
adamc@76 1258 case #1 (hnormSgn env sgn') of
adamc@76 1259 L'.SgnConst sgis =>
adamc@88 1260 (sgis, (foldl (fn (sgi, env) => E.sgiBinds env sgi) env sgis, denv, gs' @ gs))
adamc@76 1261 | _ => (sgnError env (NotIncludable sgn');
adamc@88 1262 ([], (env, denv, [])))
adamc@88 1263 end
adamc@88 1264
adamc@88 1265 | L.SgiConstraint (c1, c2) =>
adamc@88 1266 let
adamc@88 1267 val (c1', k1, gs1) = elabCon (env, denv) c1
adamc@88 1268 val (c2', k2, gs2) = elabCon (env, denv) c2
adamc@88 1269
adamc@90 1270 val (denv, gs3) = D.assert env denv (c1', c2')
adamc@88 1271 in
adamc@88 1272 checkKind env c1' k1 (L'.KRecord (kunif loc), loc);
adamc@88 1273 checkKind env c2' k2 (L'.KRecord (kunif loc), loc);
adamc@88 1274
adamc@90 1275 ([(L'.SgiConstraint (c1', c2'), loc)], (env, denv, gs1 @ gs2 @ gs3))
adamc@76 1276 end
adamc@31 1277
adamc@83 1278 and elabSgn (env, denv) (sgn, loc) =
adamc@31 1279 case sgn of
adamc@31 1280 L.SgnConst sgis =>
adamc@31 1281 let
adamc@88 1282 val (sgis', (_, _, gs)) = ListUtil.foldlMapConcat elabSgn_item (env, denv, []) sgis
adamc@62 1283
adamc@62 1284 val _ = foldl (fn ((sgi, loc), (cons, vals, sgns, strs)) =>
adamc@62 1285 case sgi of
adamc@62 1286 L'.SgiConAbs (x, _, _) =>
adamc@62 1287 (if SS.member (cons, x) then
adamc@62 1288 sgnError env (DuplicateCon (loc, x))
adamc@62 1289 else
adamc@62 1290 ();
adamc@62 1291 (SS.add (cons, x), vals, sgns, strs))
adamc@62 1292 | L'.SgiCon (x, _, _, _) =>
adamc@62 1293 (if SS.member (cons, x) then
adamc@62 1294 sgnError env (DuplicateCon (loc, x))
adamc@62 1295 else
adamc@62 1296 ();
adamc@62 1297 (SS.add (cons, x), vals, sgns, strs))
adamc@62 1298 | L'.SgiVal (x, _, _) =>
adamc@62 1299 (if SS.member (vals, x) then
adamc@62 1300 sgnError env (DuplicateVal (loc, x))
adamc@62 1301 else
adamc@62 1302 ();
adamc@62 1303 (cons, SS.add (vals, x), sgns, strs))
adamc@62 1304 | L'.SgiSgn (x, _, _) =>
adamc@62 1305 (if SS.member (sgns, x) then
adamc@62 1306 sgnError env (DuplicateSgn (loc, x))
adamc@62 1307 else
adamc@62 1308 ();
adamc@62 1309 (cons, vals, SS.add (sgns, x), strs))
adamc@62 1310 | L'.SgiStr (x, _, _) =>
adamc@62 1311 (if SS.member (strs, x) then
adamc@62 1312 sgnError env (DuplicateStr (loc, x))
adamc@62 1313 else
adamc@62 1314 ();
adamc@88 1315 (cons, vals, sgns, SS.add (strs, x)))
adamc@88 1316 | L'.SgiConstraint _ => (cons, vals, sgns, strs))
adamc@62 1317 (SS.empty, SS.empty, SS.empty, SS.empty) sgis'
adamc@31 1318 in
adamc@83 1319 ((L'.SgnConst sgis', loc), gs)
adamc@31 1320 end
adamc@31 1321 | L.SgnVar x =>
adamc@31 1322 (case E.lookupSgn env x of
adamc@31 1323 NONE =>
adamc@31 1324 (sgnError env (UnboundSgn (loc, x));
adamc@83 1325 ((L'.SgnError, loc), []))
adamc@83 1326 | SOME (n, sgis) => ((L'.SgnVar n, loc), []))
adamc@41 1327 | L.SgnFun (m, dom, ran) =>
adamc@41 1328 let
adamc@83 1329 val (dom', gs1) = elabSgn (env, denv) dom
adamc@41 1330 val (env', n) = E.pushStrNamed env m dom'
adamc@83 1331 val (ran', gs2) = elabSgn (env', denv) ran
adamc@41 1332 in
adamc@83 1333 ((L'.SgnFun (m, n, dom', ran'), loc), gs1 @ gs2)
adamc@41 1334 end
adamc@42 1335 | L.SgnWhere (sgn, x, c) =>
adamc@42 1336 let
adamc@83 1337 val (sgn', ds1) = elabSgn (env, denv) sgn
adamc@83 1338 val (c', ck, ds2) = elabCon (env, denv) c
adamc@42 1339 in
adamc@42 1340 case #1 (hnormSgn env sgn') of
adamc@83 1341 L'.SgnError => (sgnerror, [])
adamc@42 1342 | L'.SgnConst sgis =>
adamc@75 1343 if List.exists (fn (L'.SgiConAbs (x', _, k), _) =>
adamc@75 1344 x' = x andalso
adamc@75 1345 (unifyKinds k ck
adamc@75 1346 handle KUnify x => sgnError env (WhereWrongKind x);
adamc@42 1347 true)
adamc@42 1348 | _ => false) sgis then
adamc@83 1349 ((L'.SgnWhere (sgn', x, c'), loc), ds1 @ ds2)
adamc@42 1350 else
adamc@42 1351 (sgnError env (UnWhereable (sgn', x));
adamc@83 1352 (sgnerror, []))
adamc@42 1353 | _ => (sgnError env (UnWhereable (sgn', x));
adamc@83 1354 (sgnerror, []))
adamc@42 1355 end
adamc@59 1356 | L.SgnProj (m, ms, x) =>
adamc@59 1357 (case E.lookupStr env m of
adamc@59 1358 NONE => (strError env (UnboundStr (loc, m));
adamc@83 1359 (sgnerror, []))
adamc@59 1360 | SOME (n, sgn) =>
adamc@59 1361 let
adamc@59 1362 val (str, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@59 1363 case E.projectStr env {sgn = sgn, str = str, field = m} of
adamc@59 1364 NONE => (strError env (UnboundStr (loc, m));
adamc@59 1365 (strerror, sgnerror))
adamc@59 1366 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@59 1367 ((L'.StrVar n, loc), sgn) ms
adamc@59 1368 in
adamc@59 1369 case E.projectSgn env {sgn = sgn, str = str, field = x} of
adamc@59 1370 NONE => (sgnError env (UnboundSgn (loc, x));
adamc@83 1371 (sgnerror, []))
adamc@83 1372 | SOME _ => ((L'.SgnProj (n, ms, x), loc), [])
adamc@59 1373 end)
adamc@59 1374
adamc@31 1375
adamc@66 1376 fun selfify env {str, strs, sgn} =
adamc@66 1377 case #1 (hnormSgn env sgn) of
adamc@66 1378 L'.SgnError => sgn
adamc@66 1379 | L'.SgnVar _ => sgn
adamc@66 1380
adamc@66 1381 | L'.SgnConst sgis =>
adamc@66 1382 (L'.SgnConst (map (fn (L'.SgiConAbs (x, n, k), loc) =>
adamc@66 1383 (L'.SgiCon (x, n, k, (L'.CModProj (str, strs, x), loc)), loc)
adamc@66 1384 | (L'.SgiStr (x, n, sgn), loc) =>
adamc@66 1385 (L'.SgiStr (x, n, selfify env {str = str, strs = strs @ [x], sgn = sgn}), loc)
adamc@66 1386 | x => x) sgis), #2 sgn)
adamc@66 1387 | L'.SgnFun _ => sgn
adamc@66 1388 | L'.SgnWhere _ => sgn
adamc@66 1389 | L'.SgnProj (m, ms, x) =>
adamc@66 1390 case E.projectSgn env {str = foldl (fn (m, str) => (L'.StrProj (str, m), #2 sgn))
adamc@66 1391 (L'.StrVar m, #2 sgn) ms,
adamc@66 1392 sgn = #2 (E.lookupStrNamed env m),
adamc@66 1393 field = x} of
adamc@66 1394 NONE => raise Fail "Elaborate.selfify: projectSgn returns NONE"
adamc@66 1395 | SOME sgn => selfify env {str = str, strs = strs, sgn = sgn}
adamc@66 1396
adamc@66 1397 fun selfifyAt env {str, sgn} =
adamc@66 1398 let
adamc@66 1399 fun self (str, _) =
adamc@66 1400 case str of
adamc@66 1401 L'.StrVar x => SOME (x, [])
adamc@66 1402 | L'.StrProj (str, x) =>
adamc@66 1403 (case self str of
adamc@66 1404 NONE => NONE
adamc@66 1405 | SOME (m, ms) => SOME (m, ms @ [x]))
adamc@66 1406 | _ => NONE
adamc@66 1407 in
adamc@66 1408 case self str of
adamc@66 1409 NONE => sgn
adamc@66 1410 | SOME (str, strs) => selfify env {sgn = sgn, str = str, strs = strs}
adamc@66 1411 end
adamc@66 1412
adamc@88 1413 fun dopen (env, denv) {str, strs, sgn} =
adamc@66 1414 let
adamc@66 1415 val m = foldl (fn (m, str) => (L'.StrProj (str, m), #2 sgn))
adamc@66 1416 (L'.StrVar str, #2 sgn) strs
adamc@66 1417 in
adamc@66 1418 case #1 (hnormSgn env sgn) of
adamc@66 1419 L'.SgnConst sgis =>
adamc@88 1420 ListUtil.foldlMap (fn ((sgi, loc), (env', denv')) =>
adamc@66 1421 case sgi of
adamc@66 1422 L'.SgiConAbs (x, n, k) =>
adamc@88 1423 let
adamc@88 1424 val c = (L'.CModProj (str, strs, x), loc)
adamc@88 1425 in
adamc@88 1426 ((L'.DCon (x, n, k, c), loc),
adamc@88 1427 (E.pushCNamedAs env' x n k (SOME c), denv'))
adamc@88 1428 end
adamc@66 1429 | L'.SgiCon (x, n, k, c) =>
adamc@66 1430 ((L'.DCon (x, n, k, (L'.CModProj (str, strs, x), loc)), loc),
adamc@88 1431 (E.pushCNamedAs env' x n k (SOME c), denv'))
adamc@66 1432 | L'.SgiVal (x, n, t) =>
adamc@66 1433 ((L'.DVal (x, n, t, (L'.EModProj (str, strs, x), loc)), loc),
adamc@88 1434 (E.pushENamedAs env' x n t, denv'))
adamc@66 1435 | L'.SgiStr (x, n, sgn) =>
adamc@66 1436 ((L'.DStr (x, n, sgn, (L'.StrProj (m, x), loc)), loc),
adamc@88 1437 (E.pushStrNamedAs env' x n sgn, denv'))
adamc@66 1438 | L'.SgiSgn (x, n, sgn) =>
adamc@66 1439 ((L'.DSgn (x, n, (L'.SgnProj (str, strs, x), loc)), loc),
adamc@88 1440 (E.pushSgnNamedAs env' x n sgn, denv'))
adamc@88 1441 | L'.SgiConstraint (c1, c2) =>
adamc@88 1442 ((L'.DConstraint (c1, c2), loc),
adamc@88 1443 (env', denv (* D.assert env denv (c1, c2) *) )))
adamc@88 1444 (env, denv) sgis
adamc@66 1445 | _ => (strError env (UnOpenable sgn);
adamc@88 1446 ([], (env, denv)))
adamc@66 1447 end
adamc@66 1448
adamc@88 1449 fun dopenConstraints (loc, env, denv) {str, strs} =
adamc@88 1450 case E.lookupStr env str of
adamc@88 1451 NONE => (strError env (UnboundStr (loc, str));
adamc@88 1452 denv)
adamc@88 1453 | SOME (n, sgn) =>
adamc@88 1454 let
adamc@88 1455 val (st, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@88 1456 case E.projectStr env {str = str, sgn = sgn, field = m} of
adamc@88 1457 NONE => (strError env (UnboundStr (loc, m));
adamc@88 1458 (strerror, sgnerror))
adamc@88 1459 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@88 1460 ((L'.StrVar n, loc), sgn) strs
adamc@88 1461
adamc@88 1462 val cso = E.projectConstraints env {sgn = sgn, str = st}
adamc@88 1463
adamc@88 1464 val denv = case cso of
adamc@88 1465 NONE => (strError env (UnboundStr (loc, str));
adamc@88 1466 denv)
adamc@90 1467 | SOME cs => foldl (fn ((c1, c2), denv) =>
adamc@90 1468 let
adamc@90 1469 val (denv, gs) = D.assert env denv (c1, c2)
adamc@90 1470 in
adamc@90 1471 case gs of
adamc@90 1472 [] => ()
adamc@90 1473 | _ => raise Fail "dopenConstraints: Sub-constraints remain";
adamc@90 1474
adamc@90 1475 denv
adamc@90 1476 end) denv cs
adamc@88 1477 in
adamc@88 1478 denv
adamc@88 1479 end
adamc@88 1480
adamc@31 1481 fun sgiOfDecl (d, loc) =
adamc@31 1482 case d of
adamc@59 1483 L'.DCon (x, n, k, c) => (L'.SgiCon (x, n, k, c), loc)
adamc@59 1484 | L'.DVal (x, n, t, _) => (L'.SgiVal (x, n, t), loc)
adamc@59 1485 | L'.DSgn (x, n, sgn) => (L'.SgiSgn (x, n, sgn), loc)
adamc@59 1486 | L'.DStr (x, n, sgn, _) => (L'.SgiStr (x, n, sgn), loc)
adamc@59 1487 | L'.DFfiStr (x, n, sgn) => (L'.SgiStr (x, n, sgn), loc)
adamc@88 1488 | L'.DConstraint cs => (L'.SgiConstraint cs, loc)
adamc@88 1489
adamc@88 1490 fun sgiBindsD (env, denv) (sgi, _) =
adamc@88 1491 case sgi of
adamc@90 1492 L'.SgiConstraint (c1, c2) =>
adamc@90 1493 (case D.assert env denv (c1, c2) of
adamc@90 1494 (denv, []) => denv
adamc@90 1495 | _ => raise Fail "sgiBindsD: Sub-constraints remain")
adamc@88 1496 | _ => denv
adamc@31 1497
adamc@86 1498 fun subSgn (env, denv) sgn1 (sgn2 as (_, loc2)) =
adamc@35 1499 case (#1 (hnormSgn env sgn1), #1 (hnormSgn env sgn2)) of
adamc@31 1500 (L'.SgnError, _) => ()
adamc@31 1501 | (_, L'.SgnError) => ()
adamc@31 1502
adamc@31 1503 | (L'.SgnConst sgis1, L'.SgnConst sgis2) =>
adamc@31 1504 let
adamc@88 1505 fun folder (sgi2All as (sgi, _), (env, denv)) =
adamc@31 1506 let
adamc@31 1507 fun seek p =
adamc@31 1508 let
adamc@88 1509 fun seek (env, denv) ls =
adamc@31 1510 case ls of
adamc@31 1511 [] => (sgnError env (UnmatchedSgi sgi2All);
adamc@88 1512 (env, denv))
adamc@31 1513 | h :: t =>
adamc@31 1514 case p h of
adamc@88 1515 NONE => seek (E.sgiBinds env h, sgiBindsD (env, denv) h) t
adamc@88 1516 | SOME envs => envs
adamc@31 1517 in
adamc@88 1518 seek (env, denv) sgis1
adamc@31 1519 end
adamc@31 1520 in
adamc@31 1521 case sgi of
adamc@31 1522 L'.SgiConAbs (x, n2, k2) =>
adamc@31 1523 seek (fn sgi1All as (sgi1, _) =>
adamc@31 1524 let
adamc@41 1525 fun found (x', n1, k1, co1) =
adamc@41 1526 if x = x' then
adamc@41 1527 let
adamc@41 1528 val () = unifyKinds k1 k2
adamc@41 1529 handle KUnify (k1, k2, err) =>
adamc@41 1530 sgnError env (SgiWrongKind (sgi1All, k1, sgi2All, k2, err))
adamc@41 1531 val env = E.pushCNamedAs env x n1 k1 co1
adamc@41 1532 in
adamc@41 1533 SOME (if n1 = n2 then
adamc@41 1534 env
adamc@41 1535 else
adamc@88 1536 E.pushCNamedAs env x n2 k2 (SOME (L'.CNamed n1, loc2)),
adamc@88 1537 denv)
adamc@41 1538 end
adamc@41 1539 else
adamc@41 1540 NONE
adamc@31 1541 in
adamc@31 1542 case sgi1 of
adamc@41 1543 L'.SgiConAbs (x', n1, k1) => found (x', n1, k1, NONE)
adamc@41 1544 | L'.SgiCon (x', n1, k1, c1) => found (x', n1, k1, SOME c1)
adamc@31 1545 | _ => NONE
adamc@31 1546 end)
adamc@31 1547
adamc@31 1548 | L'.SgiCon (x, n2, k2, c2) =>
adamc@31 1549 seek (fn sgi1All as (sgi1, _) =>
adamc@31 1550 case sgi1 of
adamc@41 1551 L'.SgiCon (x', n1, k1, c1) =>
adamc@41 1552 if x = x' then
adamc@41 1553 let
adamc@88 1554 fun good () = SOME (E.pushCNamedAs env x n2 k2 (SOME c2), denv)
adamc@41 1555 in
adamc@86 1556 (case unifyCons (env, denv) c1 c2 of
adamc@86 1557 [] => good ()
adamc@86 1558 | _ => NONE)
adamc@86 1559 handle CUnify (c1, c2, err) =>
adamc@86 1560 (sgnError env (SgiWrongCon (sgi1All, c1, sgi2All, c2, err));
adamc@86 1561 good ())
adamc@41 1562 end
adamc@41 1563 else
adamc@41 1564 NONE
adamc@31 1565 | _ => NONE)
adamc@31 1566
adamc@32 1567 | L'.SgiVal (x, n2, c2) =>
adamc@32 1568 seek (fn sgi1All as (sgi1, _) =>
adamc@32 1569 case sgi1 of
adamc@41 1570 L'.SgiVal (x', n1, c1) =>
adamc@41 1571 if x = x' then
adamc@86 1572 (case unifyCons (env, denv) c1 c2 of
adamc@88 1573 [] => SOME (env, denv)
adamc@86 1574 | _ => NONE)
adamc@86 1575 handle CUnify (c1, c2, err) =>
adamc@86 1576 (sgnError env (SgiWrongCon (sgi1All, c1, sgi2All, c2, err));
adamc@88 1577 SOME (env, denv))
adamc@41 1578 else
adamc@41 1579 NONE
adamc@32 1580 | _ => NONE)
adamc@32 1581
adamc@33 1582 | L'.SgiStr (x, n2, sgn2) =>
adamc@33 1583 seek (fn sgi1All as (sgi1, _) =>
adamc@33 1584 case sgi1 of
adamc@41 1585 L'.SgiStr (x', n1, sgn1) =>
adamc@41 1586 if x = x' then
adamc@66 1587 let
adamc@86 1588 val () = subSgn (env, denv) sgn1 sgn2
adamc@66 1589 val env = E.pushStrNamedAs env x n1 sgn1
adamc@66 1590 val env = if n1 = n2 then
adamc@66 1591 env
adamc@66 1592 else
adamc@66 1593 E.pushStrNamedAs env x n2
adamc@66 1594 (selfifyAt env {str = (L'.StrVar n1, #2 sgn2),
adamc@66 1595 sgn = sgn2})
adamc@66 1596 in
adamc@88 1597 SOME (env, denv)
adamc@66 1598 end
adamc@41 1599 else
adamc@41 1600 NONE
adamc@33 1601 | _ => NONE)
adamc@59 1602
adamc@59 1603 | L'.SgiSgn (x, n2, sgn2) =>
adamc@59 1604 seek (fn sgi1All as (sgi1, _) =>
adamc@59 1605 case sgi1 of
adamc@59 1606 L'.SgiSgn (x', n1, sgn1) =>
adamc@59 1607 if x = x' then
adamc@65 1608 let
adamc@86 1609 val () = subSgn (env, denv) sgn1 sgn2
adamc@86 1610 val () = subSgn (env, denv) sgn2 sgn1
adamc@65 1611
adamc@65 1612 val env = E.pushSgnNamedAs env x n2 sgn2
adamc@65 1613 val env = if n1 = n2 then
adamc@65 1614 env
adamc@65 1615 else
adamc@65 1616 E.pushSgnNamedAs env x n1 sgn2
adamc@65 1617 in
adamc@88 1618 SOME (env, denv)
adamc@65 1619 end
adamc@59 1620 else
adamc@59 1621 NONE
adamc@59 1622 | _ => NONE)
adamc@88 1623
adamc@88 1624 | L'.SgiConstraint (c2, d2) =>
adamc@88 1625 seek (fn sgi1All as (sgi1, _) =>
adamc@88 1626 case sgi1 of
adamc@88 1627 L'.SgiConstraint (c1, d1) =>
adamc@88 1628 if consEq (env, denv) (c1, c2) andalso consEq (env, denv) (d1, d2) then
adamc@90 1629 let
adamc@90 1630 val (denv, gs) = D.assert env denv (c2, d2)
adamc@90 1631 in
adamc@90 1632 case gs of
adamc@90 1633 [] => ()
adamc@90 1634 | _ => raise Fail "subSgn: Sub-constraints remain";
adamc@90 1635
adamc@90 1636 SOME (env, denv)
adamc@90 1637 end
adamc@88 1638 else
adamc@88 1639 NONE
adamc@88 1640 | _ => NONE)
adamc@31 1641 end
adamc@31 1642 in
adamc@88 1643 ignore (foldl folder (env, denv) sgis2)
adamc@31 1644 end
adamc@31 1645
adamc@41 1646 | (L'.SgnFun (m1, n1, dom1, ran1), L'.SgnFun (m2, n2, dom2, ran2)) =>
adamc@43 1647 let
adamc@43 1648 val ran1 =
adamc@43 1649 if n1 = n2 then
adamc@43 1650 ran1
adamc@43 1651 else
adamc@43 1652 subStrInSgn (n1, n2) ran1
adamc@43 1653 in
adamc@86 1654 subSgn (env, denv) dom2 dom1;
adamc@86 1655 subSgn (E.pushStrNamedAs env m2 n2 dom2, denv) ran1 ran2
adamc@43 1656 end
adamc@41 1657
adamc@41 1658 | _ => sgnError env (SgnWrongForm (sgn1, sgn2))
adamc@41 1659
adamc@61 1660
adamc@88 1661 fun elabDecl ((d, loc), (env, denv, gs)) =
adamc@76 1662 case d of
adamc@76 1663 L.DCon (x, ko, c) =>
adamc@76 1664 let
adamc@76 1665 val k' = case ko of
adamc@76 1666 NONE => kunif loc
adamc@76 1667 | SOME k => elabKind k
adamc@76 1668
adamc@83 1669 val (c', ck, gs') = elabCon (env, denv) c
adamc@76 1670 val (env', n) = E.pushCNamed env x k' (SOME c')
adamc@76 1671 in
adamc@76 1672 checkKind env c' ck k';
adamc@76 1673
adamc@88 1674 ([(L'.DCon (x, n, k', c'), loc)], (env', denv, gs' @ gs))
adamc@76 1675 end
adamc@76 1676 | L.DVal (x, co, e) =>
adamc@76 1677 let
adamc@83 1678 val (c', ck, gs1) = case co of
adamc@83 1679 NONE => (cunif (loc, ktype), ktype, [])
adamc@83 1680 | SOME c => elabCon (env, denv) c
adamc@76 1681
adamc@83 1682 val (e', et, gs2) = elabExp (env, denv) e
adamc@76 1683 val (env', n) = E.pushENamed env x c'
adamc@86 1684
adamc@86 1685 val gs3 = checkCon (env, denv) e' et c'
adamc@76 1686 in
adamc@88 1687 ([(L'.DVal (x, n, c', e'), loc)], (env', denv, gs1 @ gs2 @ gs3 @ gs))
adamc@76 1688 end
adamc@76 1689
adamc@76 1690 | L.DSgn (x, sgn) =>
adamc@76 1691 let
adamc@83 1692 val (sgn', gs') = elabSgn (env, denv) sgn
adamc@76 1693 val (env', n) = E.pushSgnNamed env x sgn'
adamc@76 1694 in
adamc@88 1695 ([(L'.DSgn (x, n, sgn'), loc)], (env', denv, gs' @ gs))
adamc@76 1696 end
adamc@76 1697
adamc@76 1698 | L.DStr (x, sgno, str) =>
adamc@76 1699 let
adamc@83 1700 val formal = Option.map (elabSgn (env, denv)) sgno
adamc@76 1701
adamc@83 1702 val (str', sgn', gs') =
adamc@78 1703 case formal of
adamc@78 1704 NONE =>
adamc@78 1705 let
adamc@83 1706 val (str', actual, ds) = elabStr (env, denv) str
adamc@78 1707 in
adamc@83 1708 (str', selfifyAt env {str = str', sgn = actual}, ds)
adamc@78 1709 end
adamc@83 1710 | SOME (formal, gs1) =>
adamc@78 1711 let
adamc@78 1712 val str =
adamc@78 1713 case #1 (hnormSgn env formal) of
adamc@78 1714 L'.SgnConst sgis =>
adamc@78 1715 (case #1 str of
adamc@78 1716 L.StrConst ds =>
adamc@78 1717 let
adamc@78 1718 val needed = foldl (fn ((sgi, _), needed) =>
adamc@78 1719 case sgi of
adamc@78 1720 L'.SgiConAbs (x, _, _) => SS.add (needed, x)
adamc@78 1721 | _ => needed)
adamc@78 1722 SS.empty sgis
adamc@78 1723
adamc@78 1724 val needed = foldl (fn ((d, _), needed) =>
adamc@78 1725 case d of
adamc@78 1726 L.DCon (x, _, _) => (SS.delete (needed, x)
adamc@78 1727 handle NotFound => needed)
adamc@78 1728 | L.DOpen _ => SS.empty
adamc@78 1729 | _ => needed)
adamc@78 1730 needed ds
adamc@78 1731 in
adamc@78 1732 case SS.listItems needed of
adamc@78 1733 [] => str
adamc@78 1734 | xs =>
adamc@78 1735 let
adamc@78 1736 val kwild = (L.KWild, #2 str)
adamc@78 1737 val cwild = (L.CWild kwild, #2 str)
adamc@78 1738 val ds' = map (fn x => (L.DCon (x, NONE, cwild), #2 str)) xs
adamc@78 1739 in
adamc@78 1740 (L.StrConst (ds @ ds'), #2 str)
adamc@78 1741 end
adamc@78 1742 end
adamc@78 1743 | _ => str)
adamc@78 1744 | _ => str
adamc@78 1745
adamc@83 1746 val (str', actual, gs2) = elabStr (env, denv) str
adamc@78 1747 in
adamc@86 1748 subSgn (env, denv) actual formal;
adamc@83 1749 (str', formal, gs1 @ gs2)
adamc@78 1750 end
adamc@76 1751
adamc@76 1752 val (env', n) = E.pushStrNamed env x sgn'
adamc@76 1753 in
adamc@76 1754 case #1 (hnormSgn env sgn') of
adamc@76 1755 L'.SgnFun _ =>
adamc@76 1756 (case #1 str' of
adamc@76 1757 L'.StrFun _ => ()
adamc@76 1758 | _ => strError env (FunctorRebind loc))
adamc@76 1759 | _ => ();
adamc@76 1760
adamc@88 1761 ([(L'.DStr (x, n, sgn', str'), loc)], (env', denv, gs' @ gs))
adamc@76 1762 end
adamc@76 1763
adamc@76 1764 | L.DFfiStr (x, sgn) =>
adamc@76 1765 let
adamc@83 1766 val (sgn', gs') = elabSgn (env, denv) sgn
adamc@76 1767
adamc@76 1768 val (env', n) = E.pushStrNamed env x sgn'
adamc@76 1769 in
adamc@88 1770 ([(L'.DFfiStr (x, n, sgn'), loc)], (env', denv, gs' @ gs))
adamc@76 1771 end
adamc@76 1772
adamc@76 1773 | L.DOpen (m, ms) =>
adamc@88 1774 (case E.lookupStr env m of
adamc@88 1775 NONE => (strError env (UnboundStr (loc, m));
adamc@88 1776 ([], (env, denv, [])))
adamc@88 1777 | SOME (n, sgn) =>
adamc@88 1778 let
adamc@88 1779 val (_, sgn) = foldl (fn (m, (str, sgn)) =>
adamc@88 1780 case E.projectStr env {str = str, sgn = sgn, field = m} of
adamc@88 1781 NONE => (strError env (UnboundStr (loc, m));
adamc@88 1782 (strerror, sgnerror))
adamc@88 1783 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
adamc@88 1784 ((L'.StrVar n, loc), sgn) ms
adamc@83 1785
adamc@88 1786 val (ds, (env', denv')) = dopen (env, denv) {str = n, strs = ms, sgn = sgn}
adamc@88 1787 val denv' = dopenConstraints (loc, env', denv') {str = m, strs = ms}
adamc@88 1788 in
adamc@88 1789 (ds, (env', denv', []))
adamc@88 1790 end)
adamc@88 1791
adamc@88 1792 | L.DConstraint (c1, c2) =>
adamc@88 1793 let
adamc@88 1794 val (c1', k1, gs1) = elabCon (env, denv) c1
adamc@88 1795 val (c2', k2, gs2) = elabCon (env, denv) c2
adamc@90 1796 val gs3 = D.prove env denv (c1', c2', loc)
adamc@88 1797
adamc@90 1798 val (denv', gs4) = D.assert env denv (c1', c2')
adamc@88 1799 in
adamc@88 1800 checkKind env c1' k1 (L'.KRecord (kunif loc), loc);
adamc@88 1801 checkKind env c2' k2 (L'.KRecord (kunif loc), loc);
adamc@88 1802
adamc@90 1803 ([(L'.DConstraint (c1', c2'), loc)], (env, denv', gs1 @ gs2 @ gs3 @ gs4))
adamc@88 1804 end
adamc@88 1805
adamc@88 1806 | L.DOpenConstraints (m, ms) =>
adamc@88 1807 let
adamc@88 1808 val denv = dopenConstraints (loc, env, denv) {str = m, strs = ms}
adamc@88 1809 in
adamc@88 1810 ([], (env, denv, []))
adamc@88 1811 end
adamc@3 1812
adamc@83 1813 and elabStr (env, denv) (str, loc) =
adamc@31 1814 case str of
adamc@31 1815 L.StrConst ds =>
adamc@31 1816 let
adamc@88 1817 val (ds', (_, _, gs)) = ListUtil.foldlMapConcat elabDecl (env, denv, []) ds
adamc@59 1818 val sgis = map sgiOfDecl ds'
adamc@63 1819
adamc@63 1820 val (sgis, _, _, _, _) =
adamc@64 1821 foldr (fn ((sgi, loc), (sgis, cons, vals, sgns, strs)) =>
adamc@63 1822 case sgi of
adamc@64 1823 L'.SgiConAbs (x, n, k) =>
adamc@64 1824 let
adamc@64 1825 val (cons, x) =
adamc@64 1826 if SS.member (cons, x) then
adamc@64 1827 (cons, "?" ^ x)
adamc@64 1828 else
adamc@64 1829 (SS.add (cons, x), x)
adamc@64 1830 in
adamc@64 1831 ((L'.SgiConAbs (x, n, k), loc) :: sgis, cons, vals, sgns, strs)
adamc@64 1832 end
adamc@64 1833 | L'.SgiCon (x, n, k, c) =>
adamc@64 1834 let
adamc@64 1835 val (cons, x) =
adamc@64 1836 if SS.member (cons, x) then
adamc@64 1837 (cons, "?" ^ x)
adamc@64 1838 else
adamc@64 1839 (SS.add (cons, x), x)
adamc@64 1840 in
adamc@64 1841 ((L'.SgiCon (x, n, k, c), loc) :: sgis, cons, vals, sgns, strs)
adamc@64 1842 end
adamc@64 1843 | L'.SgiVal (x, n, c) =>
adamc@64 1844 let
adamc@64 1845 val (vals, x) =
adamc@64 1846 if SS.member (vals, x) then
adamc@64 1847 (vals, "?" ^ x)
adamc@64 1848 else
adamc@64 1849 (SS.add (vals, x), x)
adamc@64 1850 in
adamc@64 1851 ((L'.SgiVal (x, n, c), loc) :: sgis, cons, vals, sgns, strs)
adamc@64 1852 end
adamc@64 1853 | L'.SgiSgn (x, n, sgn) =>
adamc@64 1854 let
adamc@64 1855 val (sgns, x) =
adamc@64 1856 if SS.member (sgns, x) then
adamc@64 1857 (sgns, "?" ^ x)
adamc@64 1858 else
adamc@64 1859 (SS.add (sgns, x), x)
adamc@64 1860 in
adamc@64 1861 ((L'.SgiSgn (x, n, sgn), loc) :: sgis, cons, vals, sgns, strs)
adamc@64 1862 end
adamc@64 1863
adamc@64 1864 | L'.SgiStr (x, n, sgn) =>
adamc@64 1865 let
adamc@64 1866 val (strs, x) =
adamc@64 1867 if SS.member (strs, x) then
adamc@64 1868 (strs, "?" ^ x)
adamc@64 1869 else
adamc@64 1870 (SS.add (strs, x), x)
adamc@64 1871 in
adamc@64 1872 ((L'.SgiStr (x, n, sgn), loc) :: sgis, cons, vals, sgns, strs)
adamc@88 1873 end
adamc@88 1874 | L'.SgiConstraint _ => ((sgi, loc) :: sgis, cons, vals, sgns, strs))
adamc@64 1875
adamc@63 1876 ([], SS.empty, SS.empty, SS.empty, SS.empty) sgis
adamc@31 1877 in
adamc@83 1878 ((L'.StrConst ds', loc), (L'.SgnConst sgis, loc), gs)
adamc@31 1879 end
adamc@31 1880 | L.StrVar x =>
adamc@31 1881 (case E.lookupStr env x of
adamc@31 1882 NONE =>
adamc@31 1883 (strError env (UnboundStr (loc, x));
adamc@83 1884 (strerror, sgnerror, []))
adamc@83 1885 | SOME (n, sgn) => ((L'.StrVar n, loc), sgn, []))
adamc@34 1886 | L.StrProj (str, x) =>
adamc@34 1887 let
adamc@83 1888 val (str', sgn, gs) = elabStr (env, denv) str
adamc@34 1889 in
adamc@34 1890 case E.projectStr env {str = str', sgn = sgn, field = x} of
adamc@34 1891 NONE => (strError env (UnboundStr (loc, x));
adamc@83 1892 (strerror, sgnerror, []))
adamc@83 1893 | SOME sgn => ((L'.StrProj (str', x), loc), sgn, gs)
adamc@34 1894 end
adamc@41 1895 | L.StrFun (m, dom, ranO, str) =>
adamc@41 1896 let
adamc@83 1897 val (dom', gs1) = elabSgn (env, denv) dom
adamc@41 1898 val (env', n) = E.pushStrNamed env m dom'
adamc@83 1899 val (str', actual, gs2) = elabStr (env', denv) str
adamc@41 1900
adamc@83 1901 val (formal, gs3) =
adamc@41 1902 case ranO of
adamc@83 1903 NONE => (actual, [])
adamc@41 1904 | SOME ran =>
adamc@41 1905 let
adamc@83 1906 val (ran', gs) = elabSgn (env', denv) ran
adamc@41 1907 in
adamc@86 1908 subSgn (env', denv) actual ran';
adamc@83 1909 (ran', gs)
adamc@41 1910 end
adamc@41 1911 in
adamc@41 1912 ((L'.StrFun (m, n, dom', formal, str'), loc),
adamc@83 1913 (L'.SgnFun (m, n, dom', formal), loc),
adamc@83 1914 gs1 @ gs2 @ gs3)
adamc@41 1915 end
adamc@44 1916 | L.StrApp (str1, str2) =>
adamc@44 1917 let
adamc@83 1918 val (str1', sgn1, gs1) = elabStr (env, denv) str1
adamc@83 1919 val (str2', sgn2, gs2) = elabStr (env, denv) str2
adamc@44 1920 in
adamc@44 1921 case #1 (hnormSgn env sgn1) of
adamc@83 1922 L'.SgnError => (strerror, sgnerror, [])
adamc@44 1923 | L'.SgnFun (m, n, dom, ran) =>
adamc@86 1924 (subSgn (env, denv) sgn2 dom;
adamc@44 1925 case #1 (hnormSgn env ran) of
adamc@83 1926 L'.SgnError => (strerror, sgnerror, [])
adamc@44 1927 | L'.SgnConst sgis =>
adamc@44 1928 ((L'.StrApp (str1', str2'), loc),
adamc@83 1929 (L'.SgnConst ((L'.SgiStr (m, n, selfifyAt env {str = str2', sgn = sgn2}), loc) :: sgis), loc),
adamc@83 1930 gs1 @ gs2)
adamc@44 1931 | _ => raise Fail "Unable to hnormSgn in functor application")
adamc@44 1932 | _ => (strError env (NotFunctor sgn1);
adamc@83 1933 (strerror, sgnerror, []))
adamc@44 1934 end
adamc@31 1935
adamc@56 1936 fun elabFile basis env file =
adamc@56 1937 let
adamc@83 1938 val (sgn, gs) = elabSgn (env, D.empty) (L.SgnConst basis, ErrorMsg.dummySpan)
adamc@83 1939 val () = case gs of
adamc@83 1940 [] => ()
adamc@83 1941 | _ => raise Fail "Unresolved disjointness constraints in Basis"
adamc@83 1942
adamc@56 1943 val (env', basis_n) = E.pushStrNamed env "Basis" sgn
adamc@56 1944
adamc@88 1945 val (ds, (env', _)) = dopen (env', D.empty) {str = basis_n, strs = [], sgn = sgn}
adamc@56 1946
adamc@56 1947 fun discoverC r x =
adamc@56 1948 case E.lookupC env' x of
adamc@56 1949 E.NotBound => raise Fail ("Constructor " ^ x ^ " unbound in Basis")
adamc@56 1950 | E.Rel _ => raise Fail ("Constructor " ^ x ^ " bound relatively in Basis")
adamc@56 1951 | E.Named (n, (_, loc)) => r := (L'.CNamed n, loc)
adamc@56 1952
adamc@56 1953 val () = discoverC int "int"
adamc@56 1954 val () = discoverC float "float"
adamc@56 1955 val () = discoverC string "string"
adamc@56 1956
adamc@83 1957 fun elabDecl' (d, (env, gs)) =
adamc@76 1958 let
adamc@76 1959 val () = resetKunif ()
adamc@76 1960 val () = resetCunif ()
adamc@88 1961 val (ds, (env, _, gs)) = elabDecl (d, (env, D.empty, gs))
adamc@76 1962 in
adamc@76 1963 if ErrorMsg.anyErrors () then
adamc@76 1964 ()
adamc@76 1965 else (
adamc@76 1966 if List.exists kunifsInDecl ds then
adamc@76 1967 declError env (KunifsRemain (#2 d))
adamc@76 1968 else
adamc@76 1969 ();
adamc@76 1970
adamc@76 1971 case ListUtil.search cunifsInDecl ds of
adamc@76 1972 NONE => ()
adamc@76 1973 | SOME loc =>
adamc@76 1974 declError env (CunifsRemain loc)
adamc@76 1975 );
adamc@76 1976
adamc@83 1977 (ds, (env, gs))
adamc@76 1978 end
adamc@76 1979
adamc@83 1980 val (file, (_, gs)) = ListUtil.foldlMapConcat elabDecl' (env', []) file
adamc@56 1981 in
adamc@84 1982 if ErrorMsg.anyErrors () then
adamc@84 1983 ()
adamc@84 1984 else
adamc@90 1985 app (fn (loc, env, denv, c1, c2) =>
adamc@84 1986 case D.prove env denv (c1, c2, loc) of
adamc@84 1987 [] => ()
adamc@84 1988 | _ =>
adamc@86 1989 (ErrorMsg.errorAt loc "Couldn't prove field name disjointness";
adamc@84 1990 eprefaces' [("Con 1", p_con env c1),
adamc@90 1991 ("Con 2", p_con env c2),
adamc@90 1992 ("Hnormed 1", p_con env (ElabOps.hnormCon env c1)),
adamc@90 1993 ("Hnormed 2", p_con env (ElabOps.hnormCon env c2))])) gs;
adamc@83 1994
adamc@56 1995 (L'.DFfiStr ("Basis", basis_n, sgn), ErrorMsg.dummySpan) :: ds @ file
adamc@56 1996 end
adamc@2 1997
adamc@2 1998 end