我正在尝试实现一个多态函数,它本质上遍历一个类型,累积一个Tag
值。我希望用户能够做例如rec ((1,2), ('a', 3))
.
{-# LANGUAGE KindSignatures, PolyKinds, FlexibleInstances #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE UndecidableInstances #-}
import Data.Proxy
newtype Tag (a :: k) = Tag Int
deriving (Eq, Read, Show)
-- My users only have to define their own instances of this class...
class Tagged (a :: k) where
tag :: Tag a
-- ...like these:
instance Tagged Int where
tag = Tag 1
instance Tagged Char where
tag = Tag 2
instance Tagged (,) where
tag = Tag 3
-- While this is a morally "closed" class; implementing recursion over
-- components of types. This is what I'm struggling with:
class Rec (a :: k) where
rec :: proxy a -> Tag a
instance (Rec ab, Rec c)=> Rec (ab c) where
rec _ = let Tag ab = rec Proxy :: Tag ab
Tag c = rec Proxy :: Tag c
in Tag (ab * c)
instance {-# OVERLAPPABLE #-} Tagged a=> Rec a where
rec _ = tag :: Tag a
我已经以各种方式摆弄了这个,并且在当前的化身中得到了错误(对于ab
和c
,在第一个实例中):
• Could not deduce (Tagged ab) arising from a use of ‘rec’
from the context: (Rec ab, Rec c)
bound by the instance declaration at flook.hs:26:10-37
• In the expression: rec Proxy :: Tag ab
In a pattern binding: Tag ab = rec Proxy :: Tag ab
In the expression:
let
Tag ab = rec Proxy :: Tag ab
Tag c = rec Proxy :: Tag c
in Tag (ab * c)
|
27 | rec _ = let Tag ab = rec Proxy :: Tag ab
| ^^^^^^^^^
我对这个错误有点惊讶,因为它似乎表明第二个基本案例实例是在第一个实例的主体中先验选择的。
有没有办法让它工作,或者更好的方法?