EliminateContextArgument.hs 9.56 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148
{-# LANGUAGE ConstraintKinds, TypeFamilies #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE RebindableSyntax #-}
module FORecursiveTypes.EliminateContextArgument where

import Prelude hiding (Monad(..), (>=), (<=), lookup)
import GHC.Exts (Constraint)
import Data.List(find)
import Data.Maybe(isJust, fromJust)
import Data.Map(Map)
import qualified Data.Map as Map

import FORecursiveTypes.Language
import Util.ErrorMessages

-- is needed because we use the RebindableSyntax extension
ifThenElse :: Bool -> a -> a -> a
ifThenElse True thn _ = thn
ifThenElse False _ els = els

type Error = [String]

data Infer a
  = Inferred a
  | NotInferred Error deriving (Eq, Show)

type Check = Infer ()

instance Functor Infer where
  fmap _ (NotInferred err) = NotInferred err
  fmap f (Inferred ty) = Inferred $ f ty

instance Applicative Infer where
  pure = Inferred
  (NotInferred err) <*> _ = NotInferred err
  (Inferred a) <*> something = fmap a something

class WithTop a where
  top :: a

instance WithTop Type where
  top = AnyType

instance WithTop () where
  top = ()

instance (WithTop a, WithTop b) => WithTop (a, b) where
  top = (top, top)

instance WithTop a => WithTop [a] where
  top = [top]

instance WithTop a => WithTop (Map Name a) where
  top = Map.empty

-- Had to define an own monad type class.
-- It is not possible otherwise to get the type constraint WithTop a.
-- We use the extension ConstraintKinds to support this.
-- Could not find a simpler solution for this problem.
-- The restricted monad problem is common.
class RMonad m where
  type RMonadCtx m a :: Constraint
  return :: RMonadCtx m a => a -> m a
  (>>=) :: (RMonadCtx m a, RMonadCtx m b) => m a -> (a -> m b) -> m b
  (>>) :: (RMonadCtx m a, RMonadCtx m b) => m a ->  m b -> m b
  m >> k = m >>= \_ -> k
  fail :: [String] -> m a

instance RMonad Infer where
  type RMonadCtx Infer a = WithTop a
  return = Inferred
  (Inferred ty) >>= f = f ty
  NotInferred err1 >>= f =
    -- we know that top is Inferred AnyType, (AnyType, AnyType) or () by definition
    case f top of
      Inferred _ -> fail err1
      NotInferred err2 -> fail $ err1 ++ err2
  fail = NotInferred

-- matching functions that extract the inner types if possible
-- one problem is that we do not get as good error messages, because term is not known in these functions
matchNat :: Type -> String -> Check
matchNat Nat _ = return ()
matchNat ty err = fail [natError ty err]

matchFun :: Type -> String -> Infer (Type, Type)
matchFun (Fun ty1 ty2) _ = return (ty1, ty2)
matchFun ty err = fail [funError ty err]

matchType :: Type -> Type -> String -> Check
matchType ty1 ty2 _
  | ty1 == ty2 = return ()
matchType ty1 ty2 err = fail [generalError (show ty1) ty2 err]

matchSum :: Type -> String -> Infer (Type, Type)
matchSum (Sum ty1 ty2) _ = return (ty1, ty2)
matchSum ty err = fail [sumError ty err]

matchVariant :: Type -> String -> Infer (Map.Map Name Type)
matchVariant (Variant types) _ = return types
matchVariant ty err = fail [variantError ty err]

lookupTypeVar :: TypeMap -> Name -> Infer Type
lookupTypeVar Empty x = fail ["Unbound type variable " ++ show x]
lookupTypeVar (Bind c x t) y
  | x == y = return t
  | otherwise = lookupTypeVar c y

matchTypeVar :: TypeMap -> Type -> Infer Type
matchTypeVar tymap (TypeVar x) = lookupTypeVar tymap x
matchTypeVar _ ty = return ty

liftMaybe :: WithTop a => Maybe a -> String -> Infer a
liftMaybe (Just a) _ = return a
liftMaybe Nothing err = fail [err]

lookup :: TypeMap -> Term -> Name -> Infer Type
lookup tymap t x = case parent t of
  Just p@(Succ t _) -> do
    lookup tymap p x
  Just p@(Add t1 t2 _) | t == t1 -> do
    lookup tymap p x
  Just p@(Add t1 t2 _) | t == t2 -> do
    lookup tymap p x
  Just p@(Mult t1 t2 _) | t == t1 -> do
    lookup tymap p x
  Just p@(Mult t1 t2 _) | t == t2 -> do
    lookup tymap p x
  Just p@(Var name _) -> do
    lookup tymap p x
  Just p@(Let name term body _) | t == term -> do
    lookup tymap p x
  Just p@(Let name term body _) | t == body ->
    if name == x
    then do
      ty <- inferType tymap term
      return ty
    else lookup tymap p x
  Just p@(Anno term ty _) -> do
    lookup tymap p x
  Just p@(App t1 t2 _) | t == t1 -> do
    lookup tymap p x
  Just p@(App t1 t2 _) | t == t2 -> do
    lookup tymap p x
  Just p@(Lam name term _) ->
    if name == x
    then do
      ty <- requiredType tymap p
André Pacak's avatar
André Pacak committed
149 150
      rty <- matchTypeVar tymap ty
      (ty1, ty2) <- matchFun rty (show p)
151 152 153 154 155 156 157 158 159 160
      return ty1
    else lookup tymap p x
  Just p@(InL term _) -> do
    lookup tymap p x
  Just p@(InR term _) -> do
    lookup tymap p x
  Just p@(Case e n1 t1 n2 t2 _) | t == t1 ->
    if n1 == x
    then do
      ety <- inferType tymap e
André Pacak's avatar
André Pacak committed
161 162
      rty <- matchTypeVar tymap ety
      (ty1, ty2) <- matchSum rty (show e)
163 164 165 166 167 168
      return ty1
    else lookup tymap p x
  Just p@(Case e n1 t1 n2 t2 _) | t == t2 ->
    if n2 == x
    then do
      ety <- inferType tymap e
André Pacak's avatar
André Pacak committed
169 170
      rty <- matchTypeVar tymap ety
      (ty1, ty2) <- matchSum rty (show e)
171 172 173 174 175 176 177 178
      return ty2
    else lookup tymap p x
  Just p@(Tag n t' _) | t == t' -> do
    lookup tymap p x
  Just p@(Match m cases _) | t == m -> do
    lookup tymap p x
  Just p@(Match m cases _) | t /= m -> do
    ety <- inferType tymap m
André Pacak's avatar
André Pacak committed
179 180
    rty <- matchTypeVar tymap ety
    typeMap <- matchVariant rty (show m)
181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324
    let ml = find (\(_, x', t') -> t == t' && x == x') cases
    if isJust ml
    then do
      let (l, _, _) = fromJust ml
      liftMaybe (Map.lookup l typeMap) "Could not find labeled type"
    else lookup tymap p x
  Just p@(LetType x ty term _) | t == term -> do
    lookup tymap p x
  Just p -> do
    lookup tymap p x
  Nothing -> fail ["Unbound variable " ++ show x]

inferType :: TypeMap -> Term -> Infer Type
inferType _ (Unit _) = return UnitT
inferType _ (Zero _) = return Nat
inferType tymap (Succ t _) = do
  checkType tymap t
  return Nat
inferType tymap (Add t1 t2 _) = do
  checkType tymap t1
  checkType tymap t2
  return Nat
inferType tymap (Mult t1 t2 _) = do
  checkType tymap t1
  checkType tymap t2
  return Nat
inferType tymap p@(Var name _) = lookup tymap p name
inferType tymap (Let name t body _) = do
  tyt <- inferType tymap t
  inferType tymap body
inferType tymap (Anno term ty _) = do
  checkType tymap term
  return ty
inferType tymap (App t1 t2 _) = do
  ty <- inferType tymap t1
  rty <- matchTypeVar tymap ty
  (ty1, ty2) <- matchFun rty (show t1)
  checkType tymap t2
  return ty2
inferType tymap (LetType n ty t _) = inferType (Bind tymap n ty) t
inferType _ t = fail ["Cannot infer type of term " ++ show t]

checkType :: TypeMap -> Term -> Check
checkType tymap p@(Lam name t _) = do
  ty <- requiredType tymap p
  rty <- matchTypeVar tymap ty
  (ty1, ty2) <- matchFun rty (show p)
  checkType tymap t
checkType tymap p@(InL t _) = do
  ty <- requiredType tymap p
  rty <- matchTypeVar tymap ty
  (ty1, ty2) <- matchSum rty (show p)
  checkType tymap t
checkType tymap p@(InR t _) = do
  ty <- requiredType tymap p
  rty <- matchTypeVar tymap ty
  (ty1, ty2) <- matchSum rty (show p)
  checkType tymap t
checkType tymap p@(Case e n1 t1 n2 t2 _) = do
  ety <- inferType tymap e
  rty <- matchTypeVar tymap ety
  (ty1, ty2) <- matchSum rty (show e)
  ty <- requiredType tymap p
  checkType tymap t1
  checkType tymap t2
checkType tymap p@(Tag n t _) = do
  ty <- requiredType tymap p
  rty <- matchTypeVar tymap ty
  types <- matchVariant rty (show p)
  let lty = Map.lookup n types
  lty <- liftMaybe (Map.lookup n types) "Label not contained in Variant"
  checkType tymap t
checkType tymap p@(Match m cases _) = do
  ety <- inferType tymap m
  rty <- matchTypeVar tymap ety
  types <- matchVariant rty (show m)
  ty <- requiredType tymap p
  let subchecks =
        map (\(l, x, t) -> do
          lty <- liftMaybe (Map.lookup l types) "Could not find labeled type"
          checkType tymap t
        ) cases
  foldl (>>) (return ()) subchecks

checkType tymap t = do
  ty <- requiredType tymap t
  ty' <- inferType tymap t
  matchType ty ty' (show t)


requiredType :: TypeMap -> Term -> Infer Type
requiredType tymap t = case parent t of
  Just (Succ t' _) | t == t' -> return Nat
  Just (Add t1 t2 _) | t == t1 ->
    return Nat
  Just (Add t1 t2 _) | t == t2 ->
    return Nat
  Just (Mult t1 t2 _) | t == t1 ->
    return Nat
  Just (Mult t1 t2 _) | t == t2 ->
    return Nat
  Just (Anno term ty _) | t == term -> return ty
  Just p@(App t1 t2 _) | t == t2 -> do
    ty <- inferType tymap t1
    rty <- matchTypeVar tymap ty
    (ty1, ty2) <- matchFun rty (show t1)
    return ty1
  Just p@(Lam name term _) | t == term -> do
    ty <- requiredType tymap p
    rty <- matchTypeVar tymap ty
    (ty1, ty2) <- matchFun rty (show p)
    return ty2
  Just p@(InL term _) | t == term -> do
    ty <- requiredType tymap p
    rty <- matchTypeVar tymap ty
    (ty1, ty2) <- matchSum rty (show p)
    return ty1
  Just p@(InR term _) | t == term -> do
    ty <- requiredType tymap p
    rty <- matchTypeVar tymap ty
    (ty1, ty2) <- matchSum rty (show p)
    return ty2
  Just p@(Case e n1 t1 n2 t2 _) | t == t1 -> do
    ety <- inferType tymap e
    rty <- matchTypeVar tymap ety
    (ty1, ty2) <- matchSum rty (show e)
    ty <- requiredType tymap p
    return ty
  Just p@(Case e n1 t1 n2 t2 _) | t == t2 -> do
    ety <- inferType tymap e
    rty <- matchTypeVar tymap ety
    (ty1, ty2) <- matchSum rty (show e)
    ty <- requiredType tymap p
    return ty
  Just p@(Tag n term _) | t == term -> do
    ty <- requiredType tymap p
    rty <- matchTypeVar tymap ty
    types <- matchVariant rty (show p)
    let lty = Map.lookup n types
    liftMaybe (Map.lookup n types) "Label not contained in Variant"
  Just p@(Match m cases _) -> do
    ty <- requiredType tymap p
    return ty
  _ -> fail ["Could not determine required type"]