2

更新：我在这里内联代码。

我正在尝试通过调用定义Data.Profunctor.Choicewhere的实例，但由于某种原因，编译器抱怨这是未知的。rightleftleft

newtype StateTrans s i o = ST (Tuple s i → Tuple s o)

instance stFunctor ∷ Functor (StateTrans s a) where
  map f (ST st) = ST $ second f <<< st

instance stProfunctor ∷ Profunctor (StateTrans s) where
  dimap f g (ST st) = ST $ second g <<< st <<< second f

instance stChoice ∷ Choice (StateTrans s) where
  left (ST f) = ST lf
    where
    lf (Tuple s (Left a)) = let (Tuple s' b) = f (Tuple s a)
                            in Tuple s' (Left b)
    lf (Tuple s (Right c)) = Tuple s (Right c)
  -- Fails to compile with: Unknown value left
  right f = arr mirror <<< left f <<< arr mirror
    where
    mirror Left x = Right x
    mirror Right x = Left x

可能是一个愚蠢的错误，但我一直在查看我的代码很长时间，我无法弄清楚出了什么问题。

（次要且不相关：在 for 的Right情况下left，我必须解包并重新打包该值以使其类型对齐。添加类型归属也无法编译。）

奇怪的是，我对 做同样的事情没有问题Strong，请参阅：

instance stStrong ∷ Strong (StateTrans s) where
  first (ST f) = ST ff
    where
    ff (Tuple s (Tuple a c)) = let (Tuple s' b) = f $ Tuple s a
                               in Tuple s' (Tuple b c)
  second f = arr swap <<< first f <<< arr swap
4

2 回答 2

3

我不是 100% 确定粘贴的代码段不包含导入，但我怀疑你有一个 import forData.Profunctor.Choice (class Choice)而不是Data.Profunctor.Choice (class Choice, left, right).

导入一个类不会隐式导入其成员，即使可以在不这样做的情况下在实例中定义它们。

于 2018-02-19T10:08:02.937 回答
0

首先，要使用，arr您需要声明Category实例StateTrans s：

instance stSemigroupoid :: Semigroupoid (StateTrans s) where
  compose (ST f1) (ST f2) = ST $ f1 <<< f2

instance stCategory :: Category (StateTrans s) where
  id = ST $ \x -> x

对于第二步，我需要添加更多类型注释（不知道为什么它们是必要的，但这样构建成功）：

choiceLeft :: forall input output a s. (StateTrans s) input output -> (StateTrans s) (Either input a) (Either output a)
choiceLeft (ST f) = ST lf
  where
    lf (Tuple s (Left a))  = let (Tuple s' b) = f (Tuple s a)
                             in Tuple s' (Left b)
    lf (Tuple s (Right c)) = Tuple s (Right c)

choiceRight :: forall input output t s. (StateTrans s) input output -> (StateTrans s) (Either t input) (Either t output)
choiceRight f = amirror <<< choiceLeft f <<< amirror
  where
    mirror :: forall a b. Either a b -> Either b a
    mirror (Left x)  = Right x
    mirror (Right x) = Left x
    amirror :: forall a b. StateTrans s (Either b a) (Either a b)
    amirror = arr mirror

instance stChoice ∷ Choice (StateTrans s) where
  left  = choiceLeft
  right = choiceRight

注意：使用的PureScript版本0.11.7和purescript-profunctor版本3.2.0。

于 2018-02-18T18:26:27.033 回答