diff --git a/prologue.cabal b/prologue.cabal
--- a/prologue.cabal
+++ b/prologue.cabal
@@ -1,11 +1,13 @@
--- This file has been generated from package.yaml by hpack version 0.28.2.
+cabal-version: 1.12
+
+-- This file has been generated from package.yaml by hpack version 0.31.1.
 --
 -- see: https://github.com/sol/hpack
 --
--- hash: 6c94e687b54e5280348867eb1b00999da64b80bf322aab6e0fd28238404a05bd
+-- hash: ff340b3b80cf208cef5549d38b76a93dfd31f89c26e8ab224afcc6c80ae3d9ac
 
 name:           prologue
-version:        3.2.4
+version:        3.2.6
 synopsis:       Better, more general Prelude exporting common utilities.
 description:    Replacement for the Haskell's Prelude, exposing more commonly used functions and patching old GHC ones to behave in the newest GHC's way.
 category:       control
@@ -18,19 +20,56 @@
 license:        Apache-2.0
 license-file:   LICENSE
 build-type:     Simple
-cabal-version:  >= 1.10
 
 source-repository head
   type: git
   location: git://github.com/wdanilo/prologue.git
 
 library
+  exposed-modules:
+      Data.Default.Instances.Missing
+      Data.List.Utils
+      Data.String.Class
+      Data.Tuple.Curry.Total
+      Data.Typeable.Proxy.Abbr
+      Prologue
+      Prologue.Control.DeepSeq
+      Prologue.Control.Error
+      Prologue.Control.Monad
+      Prologue.Control.Monad.IO
+      Prologue.Control.Monad.Primitive
+      Prologue.Control.Monad.Trans
+      Prologue.Data.Basic
+      Prologue.Data.Bifunctor
+      Prologue.Data.Default
+      Prologue.Data.Default1
+      Prologue.Data.Either
+      Prologue.Data.Foldable
+      Prologue.Data.Ix
+      Prologue.Data.Maybe
+      Prologue.Data.Num
+      Prologue.Data.OneTuple
+      Prologue.Data.Pointed
+      Prologue.Data.Show
+      Prologue.Data.String.QQ
+      Prologue.Data.Traversable
+      Prologue.Data.Tuple
+      Prologue.Debug.Placeholders
+      Prologue.OrphanInstances
+      Prologue.Placeholders_old
+      Prologue.Prim
+      Prologue.Text.Show
+      Prologue.Text.Show.Styled
+      Prologue.Type.Reflection
+      Prologue.Unsafe
+  other-modules:
+      Paths_prologue
   hs-source-dirs:
       src
   default-extensions: ScopedTypeVariables TypeApplications ConstraintKinds DataKinds DefaultSignatures DeriveDataTypeable DeriveFoldable DeriveFunctor DeriveGeneric DeriveTraversable DoAndIfThenElse EmptyDataDecls FlexibleContexts FlexibleInstances GeneralizedNewtypeDeriving InstanceSigs LambdaCase MultiParamTypeClasses NoImplicitPrelude OverloadedStrings StandaloneDeriving TemplateHaskell TupleSections TypeFamilies TypeOperators ViewPatterns MultiWayIf UnicodeSyntax
   ghc-options: -Wall -O2
   build-depends:
-      base >=4.10 && <4.12
+      base >=4.9 && <4.13
     , bifunctors
     , binary
     , comonad
@@ -66,42 +105,4 @@
     , transformers-base
     , typelevel
     , vector
-  exposed-modules:
-      Data.Default.Instances.Missing
-      Data.List.Utils
-      Data.String.Class
-      Data.Tuple.Curry.Total
-      Data.Typeable.Proxy.Abbr
-      Prologue
-      Prologue.Control.DeepSeq
-      Prologue.Control.Error
-      Prologue.Control.Monad
-      Prologue.Control.Monad.IO
-      Prologue.Control.Monad.Primitive
-      Prologue.Control.Monad.Trans
-      Prologue.Data.Basic
-      Prologue.Data.Bifunctor
-      Prologue.Data.Default
-      Prologue.Data.Default1
-      Prologue.Data.Either
-      Prologue.Data.Foldable
-      Prologue.Data.Ix
-      Prologue.Data.Maybe
-      Prologue.Data.Num
-      Prologue.Data.OneTuple
-      Prologue.Data.Pointed
-      Prologue.Data.Show
-      Prologue.Data.String.QQ
-      Prologue.Data.Traversable
-      Prologue.Data.Tuple
-      Prologue.Debug.Placeholders
-      Prologue.OrphanInstances
-      Prologue.Placeholders_old
-      Prologue.Prim
-      Prologue.Text.Show
-      Prologue.Text.Show.Styled
-      Prologue.Type.Reflection
-      Prologue.Unsafe
-  other-modules:
-      Paths_prologue
   default-language: Haskell2010
diff --git a/src/Prologue.hs b/src/Prologue.hs
--- a/src/Prologue.hs
+++ b/src/Prologue.hs
@@ -1,3 +1,11 @@
+{-# LANGUAGE CPP #-}
+
+#ifdef MIN_VERSION_GLASGOW_HASKELL
+#if MIN_VERSION_GLASGOW_HASKELL(8,6,1,0)
+{-# LANGUAGE NoStarIsType #-}
+#endif
+#endif
+
 module Prologue (module Prologue, module X) where
 
 
@@ -40,7 +48,7 @@
                                              )
 import Text.Read                        as X (readPrec) -- new style Read class implementation
 import Prologue.Text.Show               as X
-import Prologue.Text.Show.Styled        as X 
+import Prologue.Text.Show.Styled        as X
 import Text.Show.Functions              as X ()
 import Data.Void                        as X (Void, absurd)
 
diff --git a/src/Prologue/Control/Monad/Trans.hs b/src/Prologue/Control/Monad/Trans.hs
--- a/src/Prologue/Control/Monad/Trans.hs
+++ b/src/Prologue/Control/Monad/Trans.hs
@@ -4,12 +4,12 @@
 import Control.Monad.Trans.Class as X (MonadTrans, lift)
 
 import Control.Monad.Primitive (PrimState)
-import Data.Kind               (Constraint)
+import Data.Kind               (Constraint, Type)
 
 
 -- === Type families === --
 
-type family MonadTranses (ts :: [(* -> *) -> * -> *]) :: Constraint where
+type family MonadTranses (ts :: [(Type -> Type) -> Type -> Type]) :: Constraint where
     MonadTranses '[]       = ()
     MonadTranses (t ': ts) = (MonadTrans t, MonadTranses ts)
 
diff --git a/src/Prologue/Data/Foldable.hs b/src/Prologue/Data/Foldable.hs
--- a/src/Prologue/Data/Foldable.hs
+++ b/src/Prologue/Data/Foldable.hs
@@ -5,7 +5,7 @@
 import Prologue.Data.Traversable
 
 import Control.Monad
-import           Data.Kind       (Constraint)
+import           Data.Kind       (Constraint, Type)
 import qualified Data.Foldable      as F
 import qualified Data.Bifoldable    as F
 import qualified Control.Error.Safe as S
@@ -19,7 +19,7 @@
 import Data.Semigroup.Foldable as X (Foldable1, fold1, foldMap1, toNonEmpty)
 
 
-type family Foldables (lst :: [* -> *]) :: Constraint where
+type family Foldables (lst :: [Type -> Type]) :: Constraint where
     Foldables '[]       = ()
     Foldables (t ': ts) = (Foldable t, Foldables ts)
 
diff --git a/src/Prologue/Data/Traversable.hs b/src/Prologue/Data/Traversable.hs
--- a/src/Prologue/Data/Traversable.hs
+++ b/src/Prologue/Data/Traversable.hs
@@ -1,14 +1,14 @@
 module Prologue.Data.Traversable (module Prologue.Data.Traversable, module X) where
 
 import Prelude
-import           Data.Kind       (Constraint)
+import           Data.Kind       (Constraint, Type)
 import qualified Data.Traversable   as T
 import qualified Data.Bitraversable as T
 import           Data.Traversable   as X (Traversable  , traverse  , mapM  , for)
 import           Data.Bitraversable as X (Bitraversable, bitraverse, bimapM, bifor)
 
 
-type family Traversables (lst :: [* -> *]) :: Constraint where
+type family Traversables (lst :: [Type -> Type]) :: Constraint where
     Traversables '[]       = ()
     Traversables (t ': ts) = (Traversable t, Traversables ts)
 
diff --git a/src/Prologue/Type/Reflection.hs b/src/Prologue/Type/Reflection.hs
--- a/src/Prologue/Type/Reflection.hs
+++ b/src/Prologue/Type/Reflection.hs
@@ -30,7 +30,7 @@
     Typeables '[] = ()
     Typeables (l ': ls) = (Typeable l, Typeables ls)
 
-class TypeableMany (ls :: [*]) where someTypeReps :: [SomeTypeRep]
+class TypeableMany (ls :: [Type]) where someTypeReps :: [SomeTypeRep]
 instance (Typeable l, TypeableMany ls) => TypeableMany (l ': ls) where
     someTypeReps = someTypeRep @l : someTypeReps @ls ; {-# INLINE someTypeReps #-}
 instance TypeableMany '[] where