-- | For now, converts polymorphic functions to concrete ones based on usage. -- Assumes lambdas are lifted. -- -- This step of compilation is as follows: -- -- Split all function bindings into monomorphic and polymorphic binds. The -- monomorphic bindings will be part of this compilation step. -- Apply the following monomorphization function on all monomorphic binds, with -- their type as an additional argument. -- -- The function that transforms Binds operates on both monomorphic and -- polymorphic functions, creates a context in which all possible polymorphic types -- are mapped to concrete types, created using the additional argument. -- Expressions are then recursively processed. The type of these expressions -- are changed to using the mapped generic types. The expected type provided -- in the recursion is changed depending on the different nodes. -- -- When an external bind is encountered (with EId), it is checked whether it -- exists in outputed binds or not. If it does, nothing further is evaluated. -- If not, the bind transformer function is called on it with the -- expected type in this context. The result of this computation (a monomorphic -- bind) is added to the resulting set of binds. {-# LANGUAGE LambdaCase #-} module Monomorphizer.Monomorphizer (monomorphize, morphExp, morphBind) where import qualified TypeChecker.TypeCheckerIr as T import TypeChecker.TypeCheckerIr (Ident (Ident)) import qualified Monomorphizer.MorbIr as M import qualified Monomorphizer.MonomorphizerIr as O import Monomorphizer.DataTypeRemover (removeDataTypes) import Debug.Trace import Control.Monad.State (MonadState (get), gets, modify, StateT (runStateT)) import qualified Data.Map as Map import qualified Data.Set as Set import Data.Maybe (fromJust) import Control.Monad.Reader (Reader, MonadReader (local, ask), asks, runReader) import Data.Coerce (coerce) import Grammar.Print (printTree) -- | State Monad wrapper for "Env". newtype EnvM a = EnvM (StateT Output (Reader Env) a) deriving (Functor, Applicative, Monad, MonadState Output, MonadReader Env) type Output = Map.Map Ident Outputted -- When a bind is being processed, it is Incomplete in the state, also -- called marked. data Outputted = Incomplete | Complete M.Bind | Data M.Data -- Static environment data Env = Env { -- | All binds in the program. input :: Map.Map Ident T.Bind, -- | All constructors and their respective data def. dataDefs :: Map.Map Ident T.Data, -- | Maps polymorphic identifiers with concrete types. polys :: Map.Map Ident M.Type, -- | Local variables. locals :: Set.Set Ident } localExists :: Ident -> EnvM Bool localExists ident = asks (Set.member ident . locals) -- | Gets a polymorphic bind from an id. getInputBind :: Ident -> EnvM (Maybe T.Bind) getInputBind ident = asks (Map.lookup ident . input) -- | Add monomorphic function derived from a polymorphic one, to env. addOutputBind :: M.Bind -> EnvM () addOutputBind b@(M.Bind (ident, _) _ _) = modify (Map.insert ident (Complete b)) -- | Marks a global bind as being processed, meaning that when encountered again, -- it should not be recursively processed. markBind :: Ident -> EnvM () markBind ident = modify (Map.insert ident Incomplete) -- | Check if bind has been touched or not. isBindMarked :: Ident -> EnvM Bool isBindMarked ident = gets (Map.member ident) -- | Finds main bind getMain :: EnvM T.Bind getMain = asks (\env -> fromJust $ Map.lookup (T.Ident "main") (input env)) -- NOTE: could make this function more optimized -- | Makes a kv pair list of polymorphic to monomorphic mappings, throws runtime -- error when encountering different structures between the two arguments. mapTypes :: T.Type -> M.Type -> [(Ident, M.Type)] mapTypes (T.TLit _) (M.TLit _) = [] mapTypes (T.TVar (T.MkTVar i1)) tm = [(i1, tm)] mapTypes (T.TFun pt1 pt2) (M.TFun mt1 mt2) = mapTypes pt1 mt1 ++ mapTypes pt2 mt2 mapTypes (T.TData tIdent pTs) (M.TData mIdent mTs) = if tIdent /= mIdent then error "Nuh uh" else foldl (\xs (p, m) -> mapTypes p m ++ xs) [] (zip pTs mTs) mapTypes _ _ = error "structure of types not the same!" -- | Gets the mapped monomorphic type of a polymorphic type in the current context. getMonoFromPoly :: T.Type -> EnvM M.Type getMonoFromPoly t = do env <- ask return $ getMono (polys env) t where getMono :: Map.Map Ident M.Type -> T.Type -> M.Type getMono polys t = case t of (T.TLit ident) -> M.TLit (coerce ident) (T.TFun t1 t2) -> M.TFun (getMono polys t1) (getMono polys t2) (T.TVar (T.MkTVar ident)) -> case Map.lookup ident polys of Just concrete -> concrete Nothing -> M.TLit (Ident "void") --error $ "type not found! type: " ++ show ident ++ ", error in previous compilation steps" (T.TData ident args) -> M.TData ident (map (getMono polys) args) -- TODO: TAll should work different/should not exist in this tree (T.TAll _ t) -> getMono polys t -- | If ident not already in env's output, morphed bind to output -- (and all referenced binds within this bind). -- Returns the annotated bind name. -- TODO: Redundancy? btype and t should always be the same. morphBind :: M.Type -> T.Bind -> EnvM Ident morphBind expectedType b@(T.Bind (Ident _, btype) args (exp, t)) = local (\env -> env { locals = Set.fromList (map fst args), polys = Map.fromList (mapTypes btype expectedType) }) $ do -- The "new name" is used to find out if it is already marked or not. let name' = newName expectedType b bindMarked <- isBindMarked (coerce name') -- Return with right name if already marked if bindMarked then return name' else do -- Mark so that this bind will not be processed in recursive or cyclic -- function calls markBind (coerce name') exp' <- morphExp expectedType exp -- Get monomorphic type sof args args' <- mapM convertArg args addOutputBind $ M.Bind (coerce name', expectedType) args' (exp', expectedType) return name' convertArg :: (Ident, T.Type) -> EnvM (Ident, M.Type) convertArg (ident, t) = do t' <- getMonoFromPoly t return (ident, t') -- Morphs function applications, such as EApp and EAdd morphApp :: M.Type -> T.ExpT -> T.ExpT -> EnvM M.Exp morphApp expectedType (e1, t1) (e2, t2)= do t1' <- getMonoFromPoly t1 t2' <- getMonoFromPoly t2 e2' <- morphExp t2' e2 e1' <- morphExp (M.TFun t2' expectedType) e1 return $ M.EApp (e1', t1') (e2', t2') addOutputData :: M.Data -> EnvM () addOutputData d@(M.Data (M.TData ident _) _) = modify $ Map.insert ident (Data d) -- Gets data bind from the name of a constructor getInputData :: Ident -> EnvM (Maybe T.Data) getInputData ident = do env <- ask return $ Map.lookup ident (dataDefs env) -- | Expects polymorphic types in data definition to be mapped -- in environment. morphData :: T.Data -> EnvM () morphData (T.Data t cs) = do t' <- getMonoFromPoly t output <- get cs' <- mapM (\(T.Inj ident t) -> do t' <- getMonoFromPoly t return (M.Inj ident t')) cs addOutputData $ M.Data t' cs' morphCons :: M.Type -> Ident -> EnvM () morphCons expectedType ident = do maybeD <- getInputData ident case maybeD of Nothing -> error $ "identifier '" ++ show ident ++ "' not found" Just d -> do -- Find the polymorphic type of cons case findConsType d ident of Nothing -> error "didn't find constructor" Just consType -> do -- Map polymorphic types local (\env -> env { polys = Map.fromList (mapTypes consType expectedType) }) $ do morphData d -- TODO: detect internal errors here findConsType :: T.Data -> Ident -> Maybe T.Type findConsType (T.Data _ cs) name1 = foldl (\maybe (T.Inj name2 t) -> if name2 == name1 then Just t else maybe) Nothing cs -- TODO: Change in tree so that these are the same. -- Converts Lit convertLit :: T.Lit -> M.Lit convertLit (T.LInt v) = M.LInt v convertLit (T.LChar v) = M.LChar v morphExp :: M.Type -> T.Exp -> EnvM M.Exp morphExp expectedType exp = case exp of T.ELit lit -> return $ M.ELit (convertLit lit) -- Constructor T.EInj ident -> do return $ M.EVar ident T.EApp e1 e2 -> do morphApp expectedType e1 e2 T.EAdd e1 e2 -> do morphApp expectedType e1 e2 T.EAbs ident (exp, t) -> local (\env -> env { locals = Set.insert ident (locals env) }) $ do t' <- getMonoFromPoly t morphExp t' exp T.ECase (exp, t) bs -> do t' <- getMonoFromPoly t exp' <- morphExp t' exp bs' <- mapM morphBranch bs return $ M.ECase (exp', t') bs' T.EVar ident@(Ident str) -> do isLocal <- localExists ident if isLocal then do return $ M.EVar (coerce ident) else do bind <- getInputBind ident case bind of Nothing -> do -- This is a constructor morphCons expectedType ident return $ M.EVar ident Just bind' -> do -- New bind to process newBindName <- morphBind expectedType bind' return $ M.EVar (coerce newBindName) T.ELet (T.Bind {}) _ -> error "lets not possible yet" -- Morphing case-of morphBranch :: T.Branch -> EnvM M.Branch morphBranch (T.Branch (p, pt) (e, et)) = do pt' <- getMonoFromPoly pt et' <- getMonoFromPoly et e' <- morphExp et' e p' <- morphPattern p return $ M.Branch (p', pt') (e', et') morphPattern :: T.Pattern -> EnvM M.Pattern morphPattern = \case T.PVar (ident, t) -> do t' <- getMonoFromPoly t return $ M.PVar (ident, t') T.PLit (lit, t) -> do t' <- getMonoFromPoly t return $ M.PLit (convertLit lit, t') T.PCatch -> return M.PCatch T.PEnum v -> return $ M.PEnum v T.PInj ident ps -> do ps' <- mapM morphPattern ps return $ M.PInj ident ps' -- | Creates a new identifier for a function with an assigned type newName :: M.Type -> T.Bind -> Ident newName t (T.Bind (Ident bindName, _) _ _) = if bindName == "main" then Ident bindName else Ident (bindName ++ "$" ++ newName' t) where newName' :: M.Type -> String newName' (M.TLit (Ident str)) = str newName' (M.TFun t1 t2) = newName' t1 ++ "_" ++ newName' t2 -- Monomorphization step monomorphize :: T.Program -> O.Program monomorphize (T.Program defs) = removeDataTypes $ M.Program (getDefsFromOutput (runEnvM Map.empty (createEnv defs) monomorphize')) where monomorphize' :: EnvM () monomorphize' = do main <- getMain morphBind (M.TLit $ Ident "Int") main return () -- | Runs and gives the output binds runEnvM :: Output -> Env -> EnvM () -> Output runEnvM o env (EnvM stateM) = snd $ runReader (runStateT stateM o) env -- | Creates the environment based on the input binds. createEnv :: [T.Def] -> Env createEnv defs = Env { input = Map.fromList bindPairs, dataDefs = Map.fromList dataPairs, polys = Map.empty, locals = Set.empty } where bindPairs = (map (\b -> (getBindName b, b)) . getBindsFromDefs) defs dataPairs :: [(Ident, T.Data)] dataPairs = (foldl (\acc d@(T.Data _ cs) -> map ((,d) . getConsName) cs ++ acc) [] . getDataFromDefs) defs -- Helper functions -- Gets custom data declarations form defs. getDataFromDefs :: [T.Def] -> [T.Data] getDataFromDefs = foldl (\bs -> \case T.DBind _ -> bs T.DData d -> d:bs) [] getConsName :: T.Inj -> Ident getConsName (T.Inj ident _) = ident getBindsFromDefs :: [T.Def] -> [T.Bind] getBindsFromDefs = foldl (\bs -> \case T.DBind b -> b:bs T.DData _ -> bs) [] getDefsFromOutput :: Output -> [M.Def] getDefsFromOutput outputMap = (map snd . Map.toList) $ fmap (\case Incomplete -> error "Internal bug in monomorphizer" Complete b -> M.DBind b Data d -> M.DData d) outputMap getBindName :: T.Bind -> Ident getBindName (T.Bind (ident, _) _ _) = ident