All expression can now be typed.

[cc1516.git] / sem.icl

diff --git a/sem.icl b/sem.icl
index cd415c5..2dc487f 100644 (file)
--- a/sem.icl
+++ b/sem.icl
@@ -60,6 +60,10 @@ instance toString SemError where
         toString p,
         "SemError: Cannot select ", toString fs, " from type: ",
         toString t]
+       toString (OperatorError p o t) = concat [
+               toString p, 
+               "SemError: No ", toString o, " for type ",
+               toString t]
     toString (UndeclaredVariableError p ident) = concat [
         toString p, "SemError: identifier: ", ident, " undefined."]
 
@@ -69,17 +73,24 @@ sem (AST vd fd) = case runStateT m ('Map'.newMap, getRandomStream 1) of
     Right ((vds, fds), gamma) = Right ((AST vds fds), gamma)
 where 
     m :: Env ([VarDecl], [FunDecl])
-    m = (mapM semVarDecl vd) >>= \vds -> 
-        mapM semFunDecl fd >>= \fds -> 
+    m = mapM semFunDecl fd >>= \fds -> 
+        mapM semVarDecl vd >>= \vds -> 
         pure (vds, fds)
 
 semFunDecl :: FunDecl -> Env FunDecl
-semFunDecl f = pure f
+semFunDecl fd=:(FunDecl p f _ mt vds stmts) = case mt of 
+    Nothing = let t = IdType f in putIdent f t >>| pure fd
+    Just t = putIdent f t >>| pure fd
 
 semVarDecl :: VarDecl -> Env VarDecl
 semVarDecl (VarDecl pos type ident ex) = unify type ex
     >>= \t-> putIdent ident t >>| (pure $ VarDecl pos t ident ex)
 
+typeOp2 :: Expr Expr Op2 [Type] Type -> Env Type
+typeOp2 e1 e2 op ts ret = typeExpr e1 >>= \t1-> typeExpr e2 >>= \t2->
+       unify t1 t2     >>= \t3->if (isMember t3 ts) (pure ret)
+               (liftT $ Left $ OperatorError (extrPos e1) op t3)
+
 typeExpr :: Expr -> Env Type
 typeExpr (IntExpr _ _) = pure IntType
 typeExpr (CharExpr _ _) = pure CharType
@@ -88,45 +99,37 @@ 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 (Op2Expr p e1 op e2)
+| isMember op [BiPlus, BiMinus, BiTimes, BiDivide, BiMod] =
+       typeOp2 e1 e2 op [IntType] IntType
+| isMember op [BiEquals, BiUnEqual] =
+       typeOp2 e1 e2 op [IntType, BoolType, CharType] BoolType
+| isMember op [BiLesser, BiGreater, BiLesserEq, BiGreaterEq] =
+       typeOp2 e1 e2 op [IntType, CharType] BoolType
+| isMember op [BiAnd, BiOr] =
+       typeOp2 e1 e2 op [BoolType] BoolType
+| op == BiCons = 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 f es)) = gets (\(st, r)->'Map'.get f st)
     >>= \mt-> case mt of
-        Nothing = undef
+        Nothing = freshIdent >>= \frsh-> buildFunctionType frsh es 
+            >>= \ft-> putIdent f ft >>| (pure $ IdType frsh)
         Just t = unifyApp t es
-//ignore field selectors
 typeExpr (VarExpr p (VarDef ident fs)) = gets (\(st, r)->'Map'.get ident st)
     >>= \mt->case mt of
         Nothing = liftT $ Left $ UndeclaredVariableError p ident
-            //let t = IdType ident in putIdent ident t >>| pure t
         Just t = unify t fs
 
+buildFunctionType :: String [Expr] -> Env Type 
+buildFunctionType frsh [] = let t = IdType frsh in putIdent frsh t >>| pure t
+buildFunctionType frsh [e:es] = (->>) <$> typeExpr e <*> buildFunctionType frsh es
+
 unifyApp :: Type [Expr] -> Env Type
 unifyApp t [] = pure t //whoop whoop, functions can return functions
-unifyApp (tf1 ->> tf2) [t1:ts] = (->>) <$> unify tf1 t1 <*> (unifyApp tf2 ts)
-unifyApp t1 t2 = liftT $ Left $ UnifyError zero t1 (IdType "[expressions, FIXME")
+unifyApp (tf1 ->> tf2) [t1:ts] = unify tf1 t1 >>| unifyApp tf2 ts
+unifyApp t1 t2 = liftT $ Left $ UnifyError zero t1 (IdType "[expressions, FIXME]")
 
 class unify a :: Type a -> Env Type
 
@@ -177,6 +180,8 @@ instance unify Type where
     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 >>| (pure $ ListType t1)
+    unify (ta1 ->> ta2) (tb1 ->> tb2) = unify ta1 tb1 >>= \ta-> unify ta2 tb2 
+        >>= \tb-> pure (ta ->> tb)
        unify t1 t2 = liftT $ Left $ UnifyError zero t1 t2
 
 instance zero Pos where