58 lines
2.3 KiB
Haskell
58 lines
2.3 KiB
Haskell
module Type.Inference where
|
|
|
|
import qualified Data.Map as Map
|
|
|
|
import qualified Type.Type as T
|
|
import qualified Type.Environment as Env
|
|
import qualified Type.Constrain.Expression as TcExpr
|
|
import qualified Type.Constrain.Declaration as TcDecl
|
|
import qualified Type.Solve as Solve
|
|
|
|
import SourceSyntax.Module as Module
|
|
import qualified SourceSyntax.Expression as Expr
|
|
import SourceSyntax.Location (Located, noneNoDocs)
|
|
import SourceSyntax.PrettyPrint
|
|
import SourceSyntax.Type (Type)
|
|
import Text.PrettyPrint
|
|
import qualified Type.State as TS
|
|
import Type.ExtraChecks (extraChecks)
|
|
import Control.Monad.State (execStateT, forM)
|
|
import Control.Monad.Error (runErrorT, liftIO)
|
|
import Control.Arrow (second)
|
|
import qualified Type.Alias as Alias
|
|
|
|
import System.IO.Unsafe -- Possible to switch over to the ST monad instead of
|
|
-- the IO monad. I don't think that'd be worthwhile.
|
|
|
|
|
|
infer :: Interfaces -> MetadataModule -> Either [Doc] (Map.Map String Type)
|
|
infer interfaces modul = unsafePerformIO $ do
|
|
env <- Env.initialEnvironment
|
|
(datatypes modul ++ concatMap iAdts (Map.elems interfaces))
|
|
(aliases modul ++ concatMap iAliases (Map.elems interfaces))
|
|
ctors <- forM (Map.keys (Env.constructor env)) $ \name ->
|
|
do (_, vars, args, result) <- Env.freshDataScheme env name
|
|
return (name, (vars, foldr (T.==>) result args))
|
|
|
|
attemptConstraint <- runErrorT $ do
|
|
importedVars <-
|
|
forM (concatMap (Map.toList . iTypes) $ Map.elems interfaces) $ \(name,tipe) ->
|
|
(,) name `fmap` Env.instantiateType env tipe Map.empty
|
|
|
|
let allTypes = ctors ++ importedVars
|
|
vars = concatMap (fst . snd) allTypes
|
|
header = Map.map snd (Map.fromList allTypes)
|
|
environ = noneNoDocs . T.CLet [ T.Scheme vars [] (noneNoDocs T.CTrue) header ]
|
|
|
|
fvar <- liftIO $ T.var T.Flexible
|
|
c <- TcExpr.constrain env (program modul) (T.VarN fvar)
|
|
return (header, environ c)
|
|
|
|
case attemptConstraint of
|
|
Left err -> return $ Left err
|
|
Right (header, constraint) -> do
|
|
state <- execStateT (Solve.solve constraint) TS.initialState
|
|
let rules = Alias.rules interfaces (aliases modul) (imports modul)
|
|
case TS.sErrors state of
|
|
errors@(_:_) -> Left `fmap` sequence (map ($ rules) (reverse errors))
|
|
[] -> extraChecks rules (Map.difference (TS.sSavedEnv state) header)
|