BindRec

The product of BindRec F and G, [x](F[x], G[x]]), is a BindRec

Flipped variant of ap.

Alias for map.

Add a unit to any Apply to form an Applicative.

The composition of Functor F and Bifunctor G, [x, y]F[G[x, y]], is a Bifunctor

Equivalent to join(map(fa)(f)).

The composition of Applys F and G, [x]F[G[x]], is a Apply

The composition of Functors F and G, [x]F[G[x]], is a Functor

Combine fa and fb according to Apply[F] with a function that discards the A(s)

Combine fa and fb according to Apply[F] with a function that discards the B(s)

An Apply for F in which effects happen in the opposite order.

Twin all As in fa.

Pair all As in fa with the result of function application.

The composition of Functor F and Contravariant G, [x]F[G[x]], is contravariant.

if lifted into a binding. Unlike lift3((t,c,a)=>if(t)c else a), this will only include context from the chosen of ifTrue and ifFalse, not the other.

Sequence the inner F of FFA after the outer F, forming a single F[A].

Lift f into F.

Lift f into F and apply to F[A].

Lift apply(a), and apply the result to f.

Pair A with the result of function application.

The product of Bind F and G, [x](F[x], G[x]]), is a Bind

The product of Applys F and G, [x](F[x], G[x]]), is a Apply

The product of Functors F and G, [x](F[x], G[x]]), is a Functor

Inject a to the left of Bs in f.

Inject b to the right of As in f.

Empty fa of meaningful pure values, preserving its structure.

Functors are covariant by nature, so we can treat an F[A] as an F[B] if A is a subtype of B.

Converts ma to a value of type F[B] using the provided bijection.

Converts ma to a value of type F[B] using the provided isomorphism.