Data.Coerce.Util

Function coercion utils

(#.) :: Coercible b c => (b -> c) -> (a -> b) -> a -> c infixr 9

Coercive left-composition.

(.#) :: Coercible a b => (b -> c) -> (a -> b) -> a -> c infixr 9

Coercive right-composition.

Shorten coercion type signatures

type Binary a = a -> a -> a

type CoerceBinary a b = Binary a -> Binary b

type WrapBinary f a = Binary a -> WrappedBinary f a

type WrappedBinary f a = Binary (f a)

Newtype utils

showsNewtype :: Coercible b a => String -> String -> (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> b -> ShowS

A definition for liftShowsPrec, suitable for newtypes.

Given a newtype declared as:

newtype T a = T { unT :: a }

The Show1 definition can be given as:

instance Show1 T where
  liftShowsPrec = showsNewtype T "unT"

readsNewtype :: Coercible a b => String -> String -> (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS b

A definition for liftReadsPrec, suitable for newtypes.

Given a newtype declared as:

newtype T a = T { unT :: a }

The Read1 definition can be given as:

instance Read1 T where
  liftReadsPrec = readsNewtype T "unT"