Remove redundant Typeable instances

GHC now auto-derived `Typeable` instances since GHC 7.10, making the manually
derived `Typeable` instances in this library redundant. In GHC 9.12, `-Wall`
warns about these, so let's remove them.

src/Data/Functor/Contravariant/Day.hs

@@ -3,7 +3,6 @@
 {-# LANGUAGE Rank2Types #-}
 {-# LANGUAGE MultiParamTypeClasses #-}
 {-# LANGUAGE UndecidableInstances #-}
-{-# LANGUAGE DeriveDataTypeable #-}
 {-# LANGUAGE KindSignatures #-}
 -----------------------------------------------------------------------------
 -- |
@@ -39,11 +38,9 @@ import Data.Functor.Contravariant.Adjunction
 import Data.Functor.Contravariant.Divisible
 import Data.Proxy
 import Data.Tuple (swap)
-import Data.Typeable
 
 -- | The Day convolution of two contravariant functors.
 data Day f g a = forall b c. Day (f b) (g c) (a -> (b, c))
-  deriving Typeable
 
 -- | Construct the Day convolution
 --

src/Data/Functor/Day.hs

@@ -1,7 +1,6 @@
 {-# LANGUAGE TypeFamilies #-}
 {-# LANGUAGE ExistentialQuantification #-}
 {-# LANGUAGE KindSignatures #-}
-{-# LANGUAGE DeriveDataTypeable #-}
 {-# LANGUAGE RankNTypes #-}
 {-# LANGUAGE MultiParamTypeClasses #-}
 {-# LANGUAGE UndecidableInstances #-}
@@ -49,12 +48,10 @@ import Data.Profunctor.Composition (Procompose(..))
 import Data.Functor.Adjunction
 import Data.Functor.Identity
 import Data.Functor.Rep
-import Data.Typeable
 import Prelude hiding (id,(.))
 
 -- | The Day convolution of two covariant functors.
 data Day f g a = forall b c. Day (f b) (g c) (b -> c -> a)
-  deriving Typeable
 
 -- | Construct the Day convolution
 day :: f (a -> b) -> g a -> Day f g b