【发布时间】:2014-05-27 22:09:48
【问题描述】:
Haskell 的新手,我想弄清楚这个 Monad 的东西。一元绑定运算符 -- >>= -- 有一个非常奇特的类型签名:
(>>=) :: Monad m => m a -> (a -> m b) -> m b
为了简化,让我们用Maybe 代替m:
(>>=) :: Maybe a -> (a -> Maybe b) -> Maybe b
但是,请注意,定义可以以三种不同的方式编写:
(>>=) :: Maybe a -> (Maybe a -> Maybe b) -> Maybe b
(>>=) :: Maybe a -> ( a -> Maybe b) -> Maybe b
(>>=) :: Maybe a -> ( a -> b) -> Maybe b
在这三个中,中间的那个是最不对称的。但是,我知道如果我们想避免第一个是没有意义的(LYAH 称之为样板代码)。但是,在接下来的两个中,我更喜欢最后一个。对于Maybe,这看起来像:
当这被定义为:
(>>=) :: Maybe a -> (a -> b) -> Maybe b
instance Monad Maybe where
Nothing >>= f = Nothing
(Just x) >>= f = return $ f x
这里,a -> b 是一个普通函数。另外,我没有立即看到任何不安全的东西,因为Nothing 在函数应用程序之前 捕获了异常,因此除非获得Just a,否则不会调用a -> b 函数。
所以也许有一些对我来说并不明显的东西导致(>>=) :: Maybe a -> (a -> Maybe b) -> Maybe b 定义比更简单的(>>=) :: Maybe a -> (a -> b) -> Maybe b 定义更受欢迎? (我认为是一个)更简单的定义是否存在一些固有问题?
【问题讨论】:
-
当你说 bind 的定义可能有不同的写法时,你可能是不正确的;注意
f :: Maybe a -> (Maybe a -> Maybe b) -> Maybe b == flip ($); andg :: Maybe a -> ( a -> b) -> Maybe b == flip fmap. So the other functions you listed are both useful and both exist, they just live in a place other thanMonad`。 -
Maybe a -> (a -> b) -> Maybe b不允许您绑定返回Maybe b的函数。您将无法在计算进行到一半时获得Nothing。 -
另一种可能性是
Maybe a -> Maybe (a -> b) -> Maybe b——基本上是<*>来自Applicative(一种“介于”Functor 和 Monad 之间)。
标签: haskell types monads typeclass