Data.Type.Product

Type combinators for type-level lists, lifting (f :: k -> *) to (Prod f :: [k] -> *), as well as its constructions, manipulations, and eliminations.

Prod is similar in nature to a few others in the Haskell ecosystem, such as:

Oleg's HList, from http://hackage.haskell.org/package/HList, and

Kenneth Foner's ConicList, from http://hackage.haskell.org/package/IndexedList-0.1.0.1/docs/Data-List-Indexed-Conic.html.

Documentation

data Prod f :: [k] -> * where

Constructors

Ø :: Prod f Ø

(:<) :: !(f a) -> !(Prod f as) -> Prod f (a :< as) infixr 5

Instances

Witness ØC ØC (Prod k f (Ø k))

HTraversable k [k] (Prod k)

HFoldable k [k] (Prod k)

HFunctor k [k] (Prod k)

HIxFoldable [k] k (Index k) (Prod k)

HIxFunctor [k] k (Index k) (Prod k)

Known [k] (Prod k f) (Ø k)

(Known k f a, Known [k] (Prod k f) as) => Known [k] (Prod k f) ((:<) k a as)

(Witness p q (f a), Witness s t (Prod k f as)) => Witness (p, s) (q, t) (Prod k f ((:<) k a as))

type WitnessC ØC ØC (Prod k f (Ø k)) = ØC

type KnownC [k] (Prod k f) (Ø k) = ØC

type KnownC [k] (Prod k f) ((:<) k a as) = (Known k f a, Known [k] (Prod k f) as)

type WitnessC (p, s) (q, t) (Prod k f ((:<) k a as)) = (Witness p q (f a), Witness s t (Prod k f as))

pattern (:>) :: f a -> f b -> Prod k f ((:) k a ((:) k b ([] k))) infix 6

only :: f a -> Prod f `[a]`

head' :: Prod f (a :< as) -> f a

tail' :: Prod f (a :< as) -> Prod f as

(>:) :: Prod f as -> f a -> Prod f (as >: a) infixl 6

reverse' :: Prod f as -> Prod f (Reverse as)

init' :: Prod f (a :< as) -> Prod f (Init' a as)

last' :: Prod f (a :< as) -> f (Last' a as)

append' :: Prod f as -> Prod f bs -> Prod f (as ++ bs)

onHead' :: (f a -> f b) -> Prod f (a :< as) -> Prod f (b :< as)

onTail' :: (Prod f as -> Prod f bs) -> Prod f (a :< as) -> Prod f (a :< bs)

uncurry' :: (f a -> Prod f as -> r) -> Prod f (a :< as) -> r

curry' :: (l ~ (a :< as)) => (Prod f l -> r) -> f a -> Prod f as -> r

index :: Index as a -> Prod f as -> f a