Data.Vinyl.Curry

Provides combinators for currying and uncurrying functions over arbitrary vinyl records.

Currying

class RecordCurry ts where

Minimal complete definition

rcurry, rcurry'

Methods

rcurry :: (Rec f ts -> a) -> CurriedF f ts a

N-ary version of curry over functorial records.

Example specialized signatures:

 rcurry :: (Rec Maybe '[Int, Double] -> Bool) -> Maybe Int -> Maybe Double -> Bool
 rcurry :: (Rec (Either Int) '[Double, String, ()] -> Int) -> Either Int Double -> Either Int String -> Either Int () -> Int
 rcurry :: (Rec f '[] -> Bool) -> Bool
 

rcurry' :: (Rec Identity ts -> a) -> Curried ts a

N-ary version of curry over pure records.

Example specialized signatures:

 rcurry' :: (Rec Identity '[Int, Double] -> Bool) -> Int -> Double -> Bool
 rcurry' :: (Rec Identity '[Double, String, ()] -> Int) -> Double -> String -> () -> Int
 rcurry' :: (Rec Identity '[] -> Bool) -> Bool
 

Instances

RecordCurry ([] :: [*])

Defined in Data.Vinyl.Curry

Methods

rcurry :: (Rec f [] -> a) -> CurriedF f [] a

rcurry' :: (Rec Identity [] -> a) -> Curried [] a

RecordCurry ts => RecordCurry (t ': ts)

Defined in Data.Vinyl.Curry

Methods

rcurry :: (Rec f (t ': ts) -> a) -> CurriedF f (t ': ts) a

rcurry' :: (Rec Identity (t ': ts) -> a) -> Curried (t ': ts) a

Uncurrying

runcurry :: CurriedF f ts a -> Rec f ts -> a

N-ary version of uncurry over functorial records.

Example specialized signatures:

runcurry :: (Maybe Int -> Maybe Double -> String) -> Rec Maybe '[Int, Double] -> String
runcurry :: (IO FilePath -> String) -> Rec IO '[FilePath] -> String
runcurry :: Int -> Rec f '[] -> Int

runcurry' :: Curried ts a -> Rec Identity ts -> a

N-ary version of uncurry over pure records.

Example specialized signatures:

runcurry' :: (Int -> Double -> String) -> Rec Identity '[Int, Double] -> String
runcurry' :: Int -> Rec Identity '[] -> Int

Example usage:

f :: Rec Identity '[Bool, Int, Double] -> Either Int Double
f = runcurry' $ b x y -> if b then Left x else Right y

Applicative Combinators

runcurryA' :: Applicative f => Curried ts a -> Rec f ts -> f a

Lift an N-ary function to work over a record of Applicative computations.

>>> runcurryA' (+) (Just 2 :& Just 3 :& RNil)
Just 5

>>> runcurryA' (+) (Nothing :& Just 3 :& RNil)
Nothing

runcurryA :: Applicative f => CurriedF g ts a -> Rec (Compose f g) ts -> f a

Lift an N-ary function over types in g to work over a record of Composed Applicative computations. A more general version of runcurryA'.

Example specialized signatures:

runcurryA :: (g x -> g y -> a) -> Rec (Compose Maybe g) '[x, y] -> Maybe a

Curried Function Types

type family Curried ts a where ...

For the list of types ts, Curried ts a is a curried function type from arguments of types in ts to a result of type a.

>>> :kind! Curried '[Int, Bool, String] Int
Curried '[Int, Bool, String] Int :: *
= Int -> Bool -> [Char] -> Int

Equations

Curried '[] a = a

Curried (t ': ts) a = t -> Curried ts a

type family CurriedF (f :: u -> *) (ts :: [u]) a where ...

For the type-level list ts, CurriedF f ts a is a curried function type from arguments of type f t for t in ts, to a result of type a.

>>> :kind! CurriedF Maybe '[Int, Bool, String] Int
CurriedF Maybe '[Int, Bool, String] Int :: *
= Maybe Int -> Maybe Bool -> Maybe [Char] -> Int

Equations

CurriedF f '[] a = a

CurriedF f (t ': ts) a = f t -> CurriedF f ts a