-- Hoogle documentation, generated by Haddock
-- See Hoogle, http://www.haskell.org/hoogle/


-- | Set of data and type definitions of impossible types. Impossible types are useful when declaring type classes / type families instances that should not be expanded by GHC until a specific type is provided in order to keep the types nice and readable.
--   
--   Set of data and type definitions of impossible types. Impossible types
--   are useful when declaring type classes / type families instances that
--   should not be expanded by GHC until a specific type is provided in
--   order to keep the types nice and readable.
@package impossible
@version 1.0.0

module Data.Impossible
data Impossible
Impossible :: Impossible
type ImpossibleM = ImpossibleM1
type ImpossibleT = ImpossibleM2
data ImpossibleM1 t1
ImpossibleM1 :: ImpossibleM1 t1
data ImpossibleM2 t1 t2
ImpossibleM2 :: ImpossibleM2 t1 t2
data ImpossibleM3 t1 t2 t3
ImpossibleM3 :: ImpossibleM3 t1 t2 t3
data ImpossibleM4 t1 t2 t3 t4
ImpossibleM4 :: ImpossibleM4 t1 t2 t3 t4
data ImpossibleM5 t1 t2 t3 t4 t5
ImpossibleM5 :: ImpossibleM5 t1 t2 t3 t4 t5
type ImpossibleNat = 9223372036854775807
impossible :: a
impossible' :: String -> a
instance forall (k :: BOX) (k1 :: BOX) (k2 :: BOX) (k3 :: BOX) (k4 :: BOX) (t1 :: k) (t2 :: k1) (t3 :: k2) (t4 :: k3) (t5 :: k4). GHC.Show.Show (Data.Impossible.ImpossibleM5 t1 t2 t3 t4 t5)
instance forall (k :: BOX) (k1 :: BOX) (k2 :: BOX) (k3 :: BOX) (t1 :: k) (t2 :: k1) (t3 :: k2) (t4 :: k3). GHC.Show.Show (Data.Impossible.ImpossibleM4 t1 t2 t3 t4)
instance forall (k :: BOX) (k1 :: BOX) (k2 :: BOX) (t1 :: k) (t2 :: k1) (t3 :: k2). GHC.Show.Show (Data.Impossible.ImpossibleM3 t1 t2 t3)
instance forall (k :: BOX) (k1 :: BOX) (t1 :: k) (t2 :: k1). GHC.Show.Show (Data.Impossible.ImpossibleM2 t1 t2)
instance forall (k :: BOX) (t1 :: k). GHC.Show.Show (Data.Impossible.ImpossibleM1 t1)
instance GHC.Show.Show Data.Impossible.Impossible

module Data.Impossible.Compact
type I = Impossible
type IM = ImpossibleM