Data.Functor.Day

newtype Day f g a

Day convolution of two covariant functors

Instances

• Functor (Day f g)
• (Apply f, Apply g) => Apply (Day f g)
• (Applicative f, Applicative g) => Applicative (Day f g)
• (Extend f, Extend g) => Extend (Day f g)
• (Comonad f, Comonad g) => Comonad (Day f g)
• (Comonad f) => ComonadTrans (Day f)

Operator alias for Data.Functor.Day.Day (left-associative / precedence 6)

runDay :: forall r a g f. (forall y x. (x -> y -> a) -> f x -> g y -> r) -> Day f g a -> r

Unpack a value of type Day f g a.

day :: forall y x a g f. (x -> y -> a) -> f x -> g y -> Day f g a

Construct a value of type Day f g a.

dap :: forall f. Apply f => f ⊗ f ~> f

f ⊗ f whenever f is Applicative.

elimPair :: forall a g f. f ⋈ g -> Day f g a -> a

Eliminate a Day convolution of two paired functors.

pairDay :: forall g2 g1 f2 f1. f1 ⋈ f2 -> g1 ⋈ g2 -> f1 ⊗ g1 ⋈ f2 ⊗ g2

Pair two Day convolutions when their components pair.

hoistDay1 :: forall h g f. (f ~> g) -> f ⊗ h ~> g ⊗ h

Hoist a natural transformation over the left hand side of a 'Day' convolution.

hoistDay2 :: forall h g f. (f ~> g) -> h ⊗ f ~> h ⊗ g

Hoist a natural transformation over the left hand side of a 'Day' convolution.

introDay1 :: forall f. f ~> Identity ⊗ f

introDay2 :: forall f. f ~> f ⊗ Identity

elimDay1 :: forall f. Functor f => Identity ⊗ f ~> f

elimDay2 :: forall f. Functor f => f ⊗ Identity ~> f

symmDay :: forall g f. f ⊗ g ~> g ⊗ f

assoclDay :: forall h g f. f ⊗ (g ⊗ h) ~> (f ⊗ g) ⊗ h

assocrDay :: forall h g f. (f ⊗ g) ⊗ h ~> f ⊗ (g ⊗ h)