Ur/Web: src/elaborate.sml annotate

annotate src/elaborate.sml @ 496:423a054646ec

Mention Especialize in CHANGELOG

author	Adam Chlipala <adamc@hcoop.net>
date	Tue, 18 Nov 2008 13:27:33 -0500
parents	ae03d09043c1
children	5fc269f744ee

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

Mercurial > urweb

annotate src/elaborate.sml @ 496:423a054646ec