Ur/Web: src/elaborate.sml annotate

annotate src/elaborate.sml @ 848:e8594cfa3236

Fix MonoReduce unsoundness with lets and fns

author	Adam Chlipala <adamc@hcoop.net>
date	Sat, 13 Jun 2009 15:42:24 -0400
parents	74a1e3bdf430
children	e571fb150a9f

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

Mercurial > urweb

annotate src/elaborate.sml @ 848:e8594cfa3236