+////----- Inference for Statements -----
+applySubst :: Substitution -> Typing Gamma
+applySubst s = changeGamma (subst s)
+
+instance infer Stmt where
+ infer s = case s of
+ IfStmt e th el =
+ infer e >>= \(s1, et)->
+ lift (unify et BoolType) >>= \s2 ->
+ applySubst (compose s2 s1) >>|
+ infer th >>= \(s3, tht)->
+ applySubst s3 >>|
+ infer el >>= \(s4, elt)->
+ applySubst s4 >>|
+ lift (unify tht elt) >>= \s5->
+ pure (compose s5 $ compose s4 $ compose s3 $ compose s2 s1, subst s5 tht)
+
+ WhileStmt e wh =
+ infer e >>= \(s1, et)->
+ lift (unify et BoolType) >>= \s2 ->
+ applySubst (compose s2 s1) >>|
+ infer wh >>= \(s3, wht)->
+ pure (compose s3 $ compose s2 s1, subst s3 wht)
+
+ AssStmt (VarDef k fs) e =
+ infer e >>= \(s1, et)->
+ applySubst s1 >>|
+ changeGamma (extend k (Forall [] et)) >>| //todo: fieldselectors
+ pure (s1, VoidType)
+
+ FunStmt f es = undef //what is this?
+
+ ReturnStmt Nothing = pure (zero, VoidType)
+ ReturnStmt (Just e) = infer e
+
+//The type of a list of statements is either an encountered
+//return, or VoidType
+instance infer [a] | infer a where
+ infer [] = pure (zero, VoidType)
+ infer [stmt:ss] =
+ infer stmt >>= \(s1, t1) ->
+ applySubst s1 >>|
+ infer ss >>= \(s2, t2) ->
+ applySubst s2 >>|
+ case t1 of
+ VoidType = pure (compose s2 s1, t2)
+ _ = case t2 of
+ VoidType = pure (compose s2 s1, t1)
+ _ = lift (unify t1 t2) >>= \s3 ->
+ pure (compose s3 $ compose s2 s1, t1)
+
+//the type class inferes the type of an AST element (VarDecl or FunDecl)
+//and adds it to the AST element
+class type a :: a -> Typing a
+
+instance type VarDecl where
+ type (VarDecl p expected k e) =
+ infer e >>= \(s, given) ->
+ applySubst s >>|
+ case expected of
+ Nothing = pure zero
+ Just expected_ = lift (unify expected_ given)
+ >>|
+ generalize given >>= \t ->
+ changeGamma (extend k t) >>|
+ pure (VarDecl p (Just given) k e)
+
+instance type FunDecl where
+ type (FunDecl p f args expected vds stmts) =
+ introduce f >>|
+ mapM introduce args >>= \argTs->
+ type vds >>= \tVds->
+ infer stmts >>= \(s1, result)->
+ let given = foldr (->>) result argTs in
+ applySubst s1 >>|
+ (case expected of
+ Nothing = pure zero
+ Just expected_ = lift (unify expected_ given))
+ >>= \s2 ->
+ let ftype = subst (compose s2 s1) given in
+ generalize ftype >>= \t->
+ changeGamma (extend f t) >>|
+ pure (FunDecl p f args (Just ftype) tVds stmts)
+
+instance toString (Maybe a) | toString a where
+ toString Nothing = "Nothing"
+ toString (Just e) = concat ["Just ", toString e]
+
+instance type [a] | type a where
+ type dcls = mapM type dcls
+
+introduce :: String -> Typing Type
+introduce k =
+ fresh >>= \tv ->
+ changeGamma (extend k (Forall [] tv)) >>|
+ pure tv