根据Cofree this post的说法,我正试图通过非变质作用来创造出一种this post结构。但是编译器抱怨类型不匹配:
Expected type: Base (Cofree Term E) (E, Fix Term)
Actual type: CofreeF Term E (E, Fix Term)但是在recursion-schemes包的源代码中,有一个类型实例定义:
type instance Base (Cofree f a) = CofreeF f a如何使haskell编译器成功地将该类型与此特定类型实例方程统一?
代码几乎与链接中的代码相同:
import qualified Control.Comonad.Trans.Cofree as COFREEF
type E = Int
type Term = Maybe
annotate :: E -> Fix Term -> COFREEF.Cofree Term E
annotate = curry (ana coalg)
where
coalg :: (E, Fix Term) -> COFREEF.CofreeF Term E (E, Fix Term)
coalg (environment, Fix term) = environment COFREEF.:< fmap ((,)
environment) term以及准确的错误信息:
Couldn't match type ‘COFREEF.CofreeF Term E (E, Fix Term)’
with ‘Compose
Data.Functor.Identity.Identity
(COFREEF.CofreeF Maybe Int)
(E, Fix Term)’
Expected type: (E, Fix Term)
-> Base (COFREEF.Cofree Term E) (E, Fix Term)
Actual type: (E, Fix Term)
-> COFREEF.CofreeF Term E (E, Fix Term)
• In the first argument of ‘ana’, namely ‘coalg’
In the first argument of ‘curry’, namely ‘(ana coalg)’
In the expression: curry (ana coalg)发布于 2018-07-03 17:33:40
Cofree只是一个类型的同义词
newtype CofreeT f w a = CofreeT { runCofreeT :: w (CofreeF f a (CofreeT f w a)) }
type Cofree f = CofreeT f IdentityCofreeT有一个Base实例:
type instance Base (CofreeT f w a) = Compose w (CofreeF f a)
-- Base (Cofree f a) ~ Base (CofreeT f Identity a) ~ Compose Identity (CofreeF f a)这个问题的等式在道德上是等价的,但它不是一个足够好的近似。
用Compose . Identity包装你的余代数
annotate :: E -> Fix Term -> Cofree Term E
annotate = curry $ ana $ Compose . Identity . coalg
where
coalg :: (E, Fix Term) -> CofreeF Term E (E, Fix Term)
coalg (environment, Fix term) = environment :< fmap (environment,) termhttps://stackoverflow.com/questions/51128360
复制相似问题