License	BSD3
Maintainer	Brent Yorgey <byorgey@cis.upenn.edu>
Stability	experimental
Portability	non-portable (see .cabal)
Safe Haskell	None
Language	Haskell2010

Data.Pattern.Base.Tuple

Contents

Description

Various types defined inductively as type families or data families on type-lists.

Synopsis

type family Fun (xs :: [Type]) r
data Tuple xs
zeroT :: Tuple '[]
oneT :: a -> Tuple '[a]
(<+>) :: Tuple xs -> Tuple ys -> Tuple (xs :++: ys)
runTuple :: Tuple xs -> Fun xs r -> r
type family Map (f :: Type -> Type) (xs :: [Type]) :: [Type]
class Distribute xs where
- distribute :: Functor f => f (Tuple xs) -> Tuple (Map f xs)

Functions

type family Fun (xs :: [Type]) r Source #

Curried functions. We have

Fun '[x1, ..., xn] r   =   x1 -> ... -> xn -> r

Instances

type Fun ([] :: [Type]) r Source #
Instance details Defined in Data.Pattern.Base.Tuple type Fun ([] :: [Type]) r = r
type Fun (h ': t) r Source #
Instance details Defined in Data.Pattern.Base.Tuple type Fun (h ': t) r = h -> Fun t r

Tuples

Tuples with types given by xs.

The empty tuple

The singleton tuple

Concatenation of tuples.

Runs a tuple by applying it to a curried function.

type family Map (f :: Type -> Type) (xs :: [Type]) :: [Type] Source #

Instances

type Map f ([] :: [Type]) Source #
Instance details Defined in Data.Pattern.Base.Tuple type Map f ([] :: [Type]) = ([] :: [Type])
type Map f (h ': t) Source #
Instance details Defined in Data.Pattern.Base.Tuple type Map f (h ': t) = f h ': Map f t

Methods

Instances

Distribute ([] :: [Type]) Source #
Instance details Defined in Data.Pattern.Base.Tuple Methods distribute :: Functor f => f (Tuple []) -> Tuple (Map f []) Source #
(Uncurriable t, Tupable t, Distribute t) => Distribute (h ': t) Source #
Instance details Defined in Data.Pattern.Base.Tuple Methods distribute :: Functor f => f (Tuple (h ': t)) -> Tuple (Map f (h ': t)) Source #