adamc@2: (* Copyright (c) 2008, Adam Chlipala adamc@2: * All rights reserved. adamc@2: * adamc@2: * Redistribution and use in source and binary forms, with or without adamc@2: * modification, are permitted provided that the following conditions are met: adamc@2: * adamc@2: * - Redistributions of source code must retain the above copyright notice, adamc@2: * this list of conditions and the following disclaimer. adamc@2: * - Redistributions in binary form must reproduce the above copyright notice, adamc@2: * this list of conditions and the following disclaimer in the documentation adamc@2: * and/or other materials provided with the distribution. adamc@2: * - The names of contributors may not be used to endorse or promote products adamc@2: * derived from this software without specific prior written permission. adamc@2: * adamc@2: * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" adamc@2: * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE adamc@2: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE adamc@2: * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE adamc@2: * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR adamc@2: * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF adamc@2: * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS adamc@2: * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN adamc@2: * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) adamc@2: * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE adamc@2: * POSSIBILITY OF SUCH DAMAGE. adamc@2: *) adamc@2: adamc@2: structure Elaborate :> ELABORATE = struct adamc@2: adamc@2: structure L = Laconic adamc@2: structure L' = Elab adamc@2: structure E = ElabEnv adamc@2: structure U = ElabUtil adamc@2: adamc@2: fun elabKind (k, loc) = adamc@2: case k of adamc@2: L.KType => (L'.KType, loc) adamc@2: | L.KArrow (k1, k2) => (L'.KArrow (elabKind k1, elabKind k2), loc) adamc@2: | L.KName => (L'.KName, loc) adamc@2: | L.KRecord k => (L'.KRecord (elabKind k), loc) adamc@2: adamc@2: fun elabExplicitness e = adamc@2: case e of adamc@2: L.Explicit => L'.Explicit adamc@2: | L.Implicit => L'.Implicit adamc@2: adamc@2: fun occursKind r = adamc@2: U.Kind.exists (fn L'.KUnif (_, r') => r = r' adamc@2: | _ => false) adamc@2: adamc@2: datatype unify_error = adamc@2: KOccursCheckFailed of L'.kind * L'.kind adamc@2: | KIncompatible of L'.kind * L'.kind adamc@2: adamc@2: fun unifyError err = adamc@2: case err of adamc@2: KOccursCheckFailed (k1, k2) => adamc@2: ErrorMsg.errorAt (#2 k1) "Kind occurs check failed" adamc@2: | KIncompatible (k1, k2) => adamc@2: ErrorMsg.errorAt (#2 k1) "Incompatible kinds" adamc@2: adamc@2: fun unifyKinds (k1All as (k1, pos)) (k2All as (k2, _)) = adamc@2: let adamc@2: fun err f = unifyError (f (k1All, k2All)) adamc@2: in adamc@2: case (k1, k2) of adamc@2: (L'.KType, L'.KType) => () adamc@2: | (L'.KArrow (d1, r1), L'.KArrow (d2, r2)) => adamc@2: (unifyKinds d1 d2; adamc@2: unifyKinds r1 r2) adamc@2: | (L'.KName, L'.KName) => () adamc@2: | (L'.KRecord k1, L'.KRecord k2) => unifyKinds k1 k2 adamc@2: adamc@2: | (L'.KError, _) => () adamc@2: | (_, L'.KError) => () adamc@2: adamc@2: | (L'.KUnif (_, ref (SOME k1All)), _) => unifyKinds k1All k2All adamc@2: | (_, L'.KUnif (_, ref (SOME k2All))) => unifyKinds k1All k2All adamc@2: adamc@2: | (L'.KUnif (_, r1), L'.KUnif (_, r2)) => adamc@2: if r1 = r2 then adamc@2: () adamc@2: else adamc@2: r1 := SOME k2All adamc@2: adamc@2: | (L'.KUnif (_, r), _) => adamc@2: if occursKind r k2All then adamc@2: err KOccursCheckFailed adamc@2: else adamc@2: r := SOME k2All adamc@2: | (_, L'.KUnif (_, r)) => adamc@2: if occursKind r k1All then adamc@2: err KOccursCheckFailed adamc@2: else adamc@2: r := SOME k1All adamc@2: adamc@2: | _ => err KIncompatible adamc@2: end adamc@2: adamc@2: fun elabFile _ = raise Fail "" adamc@2: adamc@2: end