Ur/Web: src/elaborate.sml annotate

annotate src/elaborate.sml @ 1068:757dbac0454d

Checked-ness of radio options; Option.get

author	Adam Chlipala <adamc@hcoop.net>
date	Sat, 12 Dec 2009 11:02:20 -0500
parents	38411c2cd363
children	26197c957ad6

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

Mercurial > urweb

annotate src/elaborate.sml @ 1068:757dbac0454d