bifunctors-4.2.1: Bifunctors

Copyright(C) 2011-2013 Edward Kmett,
LicenseBSD-style (see the file LICENSE)
MaintainerEdward Kmett <ekmett@gmail.com>
Stabilityprovisional
Portabilityportable
Safe HaskellSafe-Inferred
LanguageHaskell98

Data.Biapplicative

Contents

Description

 

Synopsis

Biapplicative bifunctors

class Bifunctor p => Biapplicative p where

Minimal complete definition

bipure, (<<*>>)

Methods

bipure :: a -> b -> p a b

(<<*>>) :: p (a -> b) (c -> d) -> p a c -> p b d infixl 4

(*>>) :: p a b -> p c d -> p c d infixl 4

a *> b ≡ const id <$> a <*> b

(<<*) :: p a b -> p c d -> p a b infixl 4

a <* b ≡ const <$> a <.> b

(<<$>>) :: (a -> b) -> a -> b infixl 4

(<<**>>) :: Biapplicative p => p a c -> p (a -> b) (c -> d) -> p b d infixl 4

biliftA2 :: Biapplicative w => (a -> b -> c) -> (d -> e -> f) -> w a d -> w b e -> w c f

Lift binary functions

biliftA3 :: Biapplicative w => (a -> b -> c -> d) -> (e -> f -> g -> h) -> w a e -> w b f -> w c g -> w d h

Lift ternary functions