Mercurial > urweb

annotate src/elaborate.sml @ 326:950320f33232

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