Agda-2.4.2.3: A dependently typed functional programming language and proof assistant

Safe HaskellNone
LanguageHaskell98

Agda.Utils.Tuple

Contents

Synopsis

Documentation

(-*-) :: (a -> c) -> (b -> d) -> (a, b) -> (c, d) infix 2

Bifunctoriality for pairs.

mapFst :: (a -> c) -> (a, b) -> (c, b)

mapFst f = f -*- id

mapSnd :: (b -> d) -> (a, b) -> (a, d)

mapSnd g = id -*- g

(/\) :: (a -> b) -> (a -> c) -> a -> (b, c) infix 3

Lifted pairing.

swap :: (a, b) -> (b, a)

Swap. (Only in Data.Tuple from base-4.3)

Triple (stolen from Data.Tuple.HT)

fst3 :: (a, b, c) -> a

snd3 :: (a, b, c) -> b

thd3 :: (a, b, c) -> c

uncurry3 :: (a -> b -> c -> d) -> (a, b, c) -> d

uncurry4 :: (a -> b -> c -> d -> e) -> (a, b, c, d) -> e

mapPairM :: Applicative m => (a -> m c) -> (b -> m d) -> (a, b) -> m (c, d)

Monadic version of -*-.

mapFstM :: Applicative m => (a -> m c) -> (a, b) -> m (c, b)

Monadic mapFst.

mapSndM :: Applicative m => (b -> m d) -> (a, b) -> m (a, d)

Monadic mapSnd.

newtype List2 a

Constructors

List2 

Fields

list2 :: (a, a)