Created
October 10, 2021 20:40
-
-
Save monadplus/3aa946ccffba425c9658c67cf027bba7 to your computer and use it in GitHub Desktop.
Coercible a b => Coercible (f a) (f b) using QuantifiedConstraints
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| {- | |
| coerceFirst :: (Coercible a b) => [f a] -> Maybe (f b) | |
| coerceFirst [] = Nothing | |
| coerceFirst (x:_) = Just (coerce x) | |
| * Couldn't match representation of type `f a' with that of `f b' | |
| arising from a use of `coerce' | |
| NB: We cannot know what roles the parameters to `f' have; | |
| we must assume that the role is nominal | |
| There is the `roles` package: https://hackage.haskell.org/package/roles | |
| which solves this issue but using an alternative (old) technique. | |
| What we want to say is: | |
| coerceFirst | |
| :: (Coercible a b, | |
| forall c d . (Coercible c d) => Coercible (f c) (f d)) | |
| coerceFirst [] = Nothing | |
| coerceFirst (x:_) = Just (coerce x) | |
| -} | |
| type Phantom :: (Type -> Type) -> Constraint | |
| type Phantom f = forall a b . Coercible (f a) (f b) | |
| type Representational :: (Type -> Type) -> Constraint | |
| type Representational f = forall a b . (Coercible a b) => Coercible (f a) (f b) :: Constraint | |
| {- | |
| type Representational3 (f :: Type -> Type -> Type) = | |
| forall a b c d . (Coercible a b, Coercible c d) => Coercible (f a c) (f b d) :: Constraint | |
| type RepresentationalPhantom (f :: Type -> Type -> Type) = | |
| forall a b c d . (Coercible a b) => Coercible (f a c) (f b d) :: Constraint | |
| -} | |
| coerceFirst | |
| :: (Coercible a b, Representational f) | |
| => [f a] | |
| -> Maybe (f b) | |
| coerceFirst [] = Nothing | |
| coerceFirst (x:_) = Just (coerce x) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment