Ur/Web: src/elaborate.sml annotate

annotate src/elaborate.sml @ 261:ee51e9d35c9b

Monoize ORDER BY

author	Adam Chlipala <adamc@hcoop.net>
date	Sun, 31 Aug 2008 16:03:43 -0400
parents	e52243e20858
children	42dfb0d61cf0

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

Mercurial > urweb

annotate src/elaborate.sml @ 261:ee51e9d35c9b