Mercurial > urweb

annotate src/elaborate.sml @ 210:f4033abd6ab1

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