bar*_*oap 5 haskell type-inference
GHC拒绝该计划
{-# LANGUAGE GADTs #-}
{-# LANGUAGE KindSignatures #-}
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE TypeOperators #-}
import GHC.TypeLits
data Foo = Foo
data Bar = Bar
data (:::) :: * -> * -> * where
(:=) :: sy -> t -> sy ::: t
data Rec :: [*] -> * where
RNil :: Rec '[]
(:&) :: (sy ::: ty) -> Rec xs -> Rec ((sy ::: ty) ': xs)
infix 3 :=
infixr 2 :&
baz :: Num ty => Rec [Foo ::: String, Bar ::: ty]
baz = Foo := "foo" :& Bar := 1 :& RNil
--bang :: (String, Integer)
bang = case baz of
(Foo := a :& Bar := b :& RNil) -> (a, b)
Run Code Online (Sandbox Code Playgroud)
同
Rec2.hs:25:44:
Couldn't match type ?t’ with ?(String, Integer)’
?t’ is untouchable
inside the constraints (xs1 ~ '[] *)
bound by a pattern with constructor
RNil :: Rec ('[] *),
in a case alternative
at Rec2.hs:25:35-38
?t’ is a rigid type variable bound by
the inferred type of bang :: t at Rec2.hs:24:1
Expected type: t
Actual type: (ty, ty1)
Relevant bindings include bang :: t (bound at Rec2.hs:24:1)
In the expression: (a, b)
In a case alternative: (Foo := a :& Bar := b :& RNil) -> (a, b)
In the expression:
case baz of { (Foo := a :& Bar := b :& RNil) -> (a, b) }
Run Code Online (Sandbox Code Playgroud)
,使用类型注释,它工作正常.关于我在网上发现的不可接触的类型变量和GADT的所有答案断言类型推断是不可能的,或者至少是难以处理的,但在这种情况下,GHC看起来很明显(String, Integer),它只是拒绝统一.
也许您原来的 GADT 可以成为不使用 GADT 的东西的糖,如下所示(有效):
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE TypeOperators #-}
import GHC.TypeLits
data Foo = Foo
data Bar = Bar
data (:::) sy t = (:=) sy t
data RNil = RNil
data (:&) a b = a :& b
type family Rec (xs :: [*]) :: *
type instance Rec (x ': xs) = x :& Rec xs
type instance Rec '[] = RNil
infix 3 :=
infixr 2 :&
baz :: Num ty => Rec [Foo ::: String, Bar ::: ty]
baz = Foo := "foo" :& Bar := 1 :& RNil
bang = case baz of
( Foo := a :& Bar := b :& RNil) -> (a, b)
Run Code Online (Sandbox Code Playgroud)
| 归档时间: |
|
| 查看次数: |
549 次 |
| 最近记录: |