X-Git-Url: https://git.martlubbers.net/?a=blobdiff_plain;f=sem.icl;h=23fb04aa5aa1778bf3c6ed436b7898b3736600b6;hb=13a108705dbabbc75711ce9b3b29fe508262919f;hp=1bedd621ea984665f0040a52564cd74b7003353f;hpb=097dfcba775724fff22039d5895d44ac4d31d5fe;p=cc1516.git diff --git a/sem.icl b/sem.icl index 1bedd62..23fb04a 100644 --- a/sem.icl +++ b/sem.icl @@ -1,182 +1,116 @@ implementation module sem import qualified Data.Map as Map + from Data.Func import $ -import Data.Maybe -import Data.Either -import Data.Functor -import Control.Applicative +from StdFunc import o + import Control.Monad -import Control.Monad.State -import Control.Monad.Identity -import Math.Random -import Control.Monad.Trans -import StdMisc -from StdFunc import id, const, o +import Data.Either +import Data.Monoid + import StdString -import StdTuple import StdList +import StdMisc +import StdEnum +import RWST +import GenEq from Text import class Text(concat), instance Text String import AST -from parse import :: ParserOutput, :: Error - -:: Gamma :== ('Map'.Map String Type, [String]) -:: Env a :== StateT Gamma (Either SemError) a -//StateT (Gamma -> Either SemError (a, Gamma)) -//we need to redefine this even though it is in Control.Monad.State -instance MonadTrans (StateT Gamma) where - liftT m = StateT \s-> m >>= \a-> return (a, s) +:: Scheme = Forall [String] Type +:: Gamma :== 'Map'.Map String Scheme +:: Constraints :== [(Type, Type)] +:: Infer a :== RWST Gamma Constraints [String] (Either SemError) a +:: SemError + = ParseError Pos String + | UnifyError Pos Type Type + | FieldSelectorError Pos Type FieldSelector + | OperatorError Pos Op2 Type + | UndeclaredVariableError Pos String + | ArgumentMisMatchError Pos String + | Error String + +variableStream :: [String] +variableStream = map toString [1..] -get = gets id - -getRandomStream :: Int -> [String] -getRandomStream i = genIdents $ filter (isAlpha o toChar) (genRandInt i) - where - genIdents r = let (ic, r2) = splitAt 5 r in [toString ic: genIdents r2] +sem :: AST -> SemOutput +sem (AST fd) = Right (AST fd, 'Map'.newMap) -freshIdent :: Env String -freshIdent = get >>= \(st, [ident:rest])-> put (st, rest) - >>| case 'Map'.get ident st of - Nothing = pure ident - _ = freshIdent +instance toString Scheme where + toString (Forall x t) = + concat ["Forall ": map ((+++) "\n") x] +++ toString t -putIdent :: String Type -> Env Void -putIdent i t = gets (\(st, r)->'Map'.get i st) >>= \mt -> case mt of - Nothing = modify (\(st, r)->('Map'.put i t st, r)) - Just t2 = unify t t2 >>= \t3-> modify (\(st, r)->('Map'.put i t3 st, r)) +instance toString Gamma where + toString mp = + concat [concat [k, ": ", toString v, "\n"]\\(k, v)<-'Map'.toList mp] instance toString SemError where - toString (ParseError p e) = concat [ - toString p,"SemError: ParseError: ", e] - toString (Error e) = "SemError: " +++ e - toString (UnifyErrorStub t1 t2) = toString (UnifyError {line=0,col=0} t1 t2) - toString (UnifyError p t1 t2) = concat [ - toString p, - "SemError: Cannot unify types. Expected: ", - toString t1, ". Given: ", toString t2] + toString se = "SemError: " -sem :: AST -> SemOutput -sem (AST vd fd) = case runStateT m ('Map'.newMap, getRandomStream 1) of - Left e = Left [e] - Right ((vds, fds), gamma) = Right ((AST vds fds), gamma) -where - m :: Env ([VarDecl], [FunDecl]) - m = (mapM semVarDecl vd) >>= \vds -> - mapM semFunDecl fd >>= \fds -> - pure (vds, fds) - -semFunDecl :: FunDecl -> Env FunDecl -semFunDecl f = pure f - -semVarDecl :: VarDecl -> Env VarDecl -semVarDecl (VarDecl pos type ident ex) = unify type ex - >>= \t-> putIdent ident t >>| (pure $ VarDecl pos t ident ex) - -typeExpr :: Expr -> Env Type -typeExpr (IntExpr _ _) = pure IntType -typeExpr (CharExpr _ _) = pure CharType -typeExpr (BoolExpr _ _) = pure BoolType -typeExpr (Op1Expr p UnNegation expr) = unify BoolType expr -typeExpr (Op1Expr p UnMinus expr) = unify IntType expr -typeExpr (TupleExpr p (e1, e2)) = typeExpr e1 - >>= \t1-> typeExpr e2 >>= \t2-> pure $ TupleType (t1, t2) -//Int -typeExpr (Op2Expr p e1 BiPlus e2) = unify IntType e1 >>| unify IntType e2 -typeExpr (Op2Expr p e1 BiMinus e2) = unify IntType e1 >>| unify IntType e2 -typeExpr (Op2Expr p e1 BiTimes e2) = unify IntType e1 >>| unify IntType e2 -typeExpr (Op2Expr p e1 BiDivide e2) = unify IntType e1 >>| unify IntType e2 -typeExpr (Op2Expr p e1 BiMod e2) = unify IntType e1 >>| unify IntType e2 -//bool, char of int -typeExpr (Op2Expr p e1 BiEquals e2) = typeExpr e1 >>= \t1 -> unify t1 e2 - >>| pure BoolType //todo, actually check t1 in Char,Bool,Int -typeExpr (Op2Expr p e1 BiUnEqual e2) = typeExpr (Op2Expr p e1 BiEquals e2) -//char of int -typeExpr (Op2Expr p e1 BiLesser e2) = typeExpr e1 >>= \t1 -> unify t1 e2 - >>| pure BoolType //todo, actually check t1 in Char, Int -typeExpr (Op2Expr p e1 BiGreater e2) = typeExpr (Op2Expr p e1 BiLesser e2) -typeExpr (Op2Expr p e1 BiLesserEq e2) = typeExpr (Op2Expr p e1 BiLesser e2) -typeExpr (Op2Expr p e1 BiGreaterEq e2) = typeExpr (Op2Expr p e1 BiLesser e2) -//bool -typeExpr (Op2Expr p e1 BiAnd e2) = unify BoolType e1 >>| unify BoolType e2 -typeExpr (Op2Expr p e1 BiOr e2) = unify BoolType e1 >>| unify BoolType e2 -//a -typeExpr (Op2Expr p e1 BiCons e2) = typeExpr e1 >>= \t1-> typeExpr e2 - >>= \t2-> unify (ListType t1) t2 -typeExpr (EmptyListExpr p) = freshIdent >>= \frsh-> let t = IdType frsh in - putIdent frsh t >>| pure t -//typeExpr (FunExpr p FunCall) = undef -//typeExpr (VarExpr Pos VarDef) = undef //when checking var-expr, be sure to - //put the infered type in the context - -class unify a :: Type a -> Env Type - -instance unify Expr where - unify (_ ->> _) e = liftT $ Left $ ParseError (extrPos e) - "Expression cannot be a higher order function. Yet..." - unify VoidType e = liftT $ Left $ ParseError (extrPos e) - "Expression cannot be a Void type." - unify (IdType _) e = liftT $ Left $ ParseError (extrPos e) - "Expression cannot be an polymorf type." - unify VarType e = typeExpr e - unify (IdType i) e = undef - //we have to cheat to decorate the error, can be done nicer? - unify t e = StateT $ \s0 -> let res = runStateT m s0 in case res of - Left err = Left $ decErr e err - Right t = Right t //note, t :: (Type, Gamma) - where m = typeExpr e >>= \tex-> unify t tex - -replace :: String Type -> Env Void -replace ident type = get >>= \(st, fr)->put ('Map'.fromList $ - map (itupdate ident type) ('Map'.toList st), fr) - where - itupdate :: String Type (String, Type) -> (String, Type) - itupdate ident newtype ov=:(key, IdType type) = if (ident == type) - (key, newtype) ov - itupdate ident newtype (key, TupleType (t1, t2)) - # (_, t1) = itupdate ident newtype (key, t1) - # (_, t2) = itupdate ident newtype (key, t2) - = (key, TupleType (t1, t2)) - itupdate ident newtype (key, ListType t1) - # (_, t1) = itupdate ident newtype (key, t1) - = (key, ListType t1) - itupdate _ _ k = k - -instance unify Type where - unify IntType IntType = pure IntType - unify BoolType BoolType = pure BoolType - unify CharType CharType = pure CharType - unify (IdType i) t=:(IdType j) = replace i t >>| pure t - unify t (IdType i) = unify (IdType i) t - unify (IdType i) t = replace i t >>| pure t - //unify (ListType t1) (ListType t2) = unify t1 t2 - unify t1 t2 = liftT $ Left $ UnifyError zero t1 t2 - -instance zero Pos where - zero = {line=0,col=0} - -decErr :: Expr SemError -> SemError -decErr e (UnifyError _ t1 t2) = UnifyError (extrPos e) t1 t2 -decErr e (ParseError _ s) = ParseError (extrPos e) s -decErr e err = err - -dc2 :: Expr (Either SemError a) -> Either SemError a -dc2 e (Right t) = Right t -dc2 e (Left err) = Left err - -extrPos :: Expr -> Pos -extrPos (VarExpr p _) = p -extrPos (Op2Expr p _ _ _) = p -extrPos (Op1Expr p _ _) = p -extrPos (IntExpr p _) = p -extrPos (CharExpr p _) = p -extrPos (BoolExpr p _) = p -extrPos (FunExpr p _) = p -extrPos (EmptyListExpr p) = p -extrPos (TupleExpr p _) = p +uni :: Type Type -> Infer () +uni t1 t2 = tell [(t1, t2)] -instance toString Gamma where - toString (mp, _) = concat - [concat [k, ": ", toString v, "\n"]\\(k, v) <- 'Map'.toList mp] +inEnv :: (String, Scheme) (Infer a) -> (Infer a) +inEnv (x, sc) m = local scope m + where + scope e = 'Map'.put x sc ('Map'.del x e ) + +class infer a :: a -> Infer Type + +instance infer Expr where + infer (VarExpr _ vd) = undef + infer (Op2Expr _ e1 op e2) = case op of + BiPlus = pure IntType + BiMinus = pure IntType + BiTimes = pure IntType + BiDivide = pure IntType + BiMod = pure IntType + BiLesser = pure IntType + BiGreater = pure IntType + BiLesserEq = pure IntType + BiGreaterEq = pure IntType + BiAnd = pure BoolType + BiOr = pure BoolType + BiEquals = infer e1 + BiUnEqual = infer e1 // maybe check e2? + BiCons = infer e1 >>= \it1->pure $ ListType it1 + infer (Op1Expr _ op e) = case op of + UnMinus = pure IntType + UnNegation = pure BoolType + infer (IntExpr _ _) = pure IntType + infer (CharExpr _ _) = pure CharType + infer (BoolExpr _ _) = pure BoolType + infer (FunExpr _ _ _ _) = undef + infer (EmptyListExpr _) = undef + infer (TupleExpr _ (e1, e2)) = + infer e1 >>= \et1->infer e2 >>= \et2->pure $ TupleType (et1, et2) + +//:: VarDef = VarDef String [FieldSelector] +//:: FieldSelector = FieldHd | FieldTl | FieldFst | FieldSnd +//:: Op1 = UnNegation | UnMinus +//:: Op2 = BiPlus | BiMinus | BiTimes | BiDivide | BiMod | BiEquals | BiLesser | +// BiGreater | BiLesserEq | BiGreaterEq | BiUnEqual | BiAnd | BiOr | BiCons +//:: FunDecl = FunDecl Pos String [String] (Maybe Type) [VarDecl] [Stmt] +//:: FunCall = FunCall String [Expr] +//:: Stmt +// = IfStmt Expr [Stmt] [Stmt] +// | WhileStmt Expr [Stmt] +// | AssStmt VarDef Expr +// | FunStmt FunCall +// | ReturnStmt (Maybe Expr) +//:: Pos = {line :: Int, col :: Int} +//:: AST = AST [VarDecl] [FunDecl] +//:: VarDecl = VarDecl Pos Type String Expr +//:: Type +// = TupleType (Type, Type) +// | ListType Type +// | IdType String +// | IntType +// | BoolType +// | CharType +// | VarType +// | VoidType +// | (->>) infixl 7 Type Type