是否有任何机制可以强制 Haskell 中的约束(unsafeCoerce
我希望除此之外有效)?
{-# LANGUAGE AllowAmbiguousTypes #-}
{-# LANGUAGE ConstraintKinds #-}
{-# LANGUAGE DerivingVia #-}
{-# LANGUAGE GADTs #-}
{-# LANGUAGE RankNTypes #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE StandaloneDeriving #-}
{-# LANGUAGE StandaloneKindSignatures #-}
{-# LANGUAGE TypeApplications #-}
module CatAdjonctionsSOQuestion where
import Data.Proxy
import Data.Tagged
import Unsafe.Coerce
newtype K a ph = K {unK :: a} -- I would want c a => c ((K a) i) for any c :: Constraints
-- I could do any possible instance by hand
deriving via a instance Semigroup a => Semigroup ((K a) i)
-- I want them all
-- deriving via a instance c ((K a) i) -- Instance head is not headed by a class: c (K a i)
data Exists c where
Exists :: c a => a -> Exists c
data ExistsKai c i where
ExistsKai :: c ((K a) i) => Proxy a -> ExistsKai c i
ok :: forall x c i. (forall x. (forall a. c a => a -> x) -> x) -> (forall a. c ((K a) i) => Tagged a x) -> x
ok s k =
let e = (s Exists :: Exists c)
in let f = unsafeCoerce e :: ExistsKai c i
in case f of (ExistsKai (Proxy :: Proxy a)) -> unTagged (k @a)