Mercurial > urweb

annotate src/elaborate.sml @ 334:9601c717d2f3

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