Functional

μ

forall void a n m. MonadEffect n => MonadAff m => MonadEffect m => Plus m => m a -> n (Tuple (m a) (m void))

flatmap

functors

public <A, B, C, D> FunctionType<App2<Grate.Mu<A2, B2>, A, B>, App2<Grate.Mu<A2, B2>, C, D>> dimap(final Function<C, A> g, final Function<B, D> h)

public interface Applicative<F extends K1, Mu extends Applicative.Mu> extends Functor<F, Mu>

functors

>>==

category theory

Natural Transformations

Natural Transformations

λ

The λ-cube sees all

flatmap

λ

list.map(…).map(…).map(…).map(…).map(…).map(…).map(…).map(…).map(…).map(…).map(…).map(…).map(…).map(…).map(…).map(…).map(…).map(…).map(…)

public <A, B, C, D> FunctionType<App2<Grate.Mu<A2, B2>, A, B>, App2<Grate.Mu<A2, B2>, C, D>> dimap(final Function<C, A> g, final Function<B, D> h)

default Function15<T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, Function<T16, R>> curry15()

public interface Applicative<F extends K1, Mu extends Applicative.Mu> extends Functor<F, Mu>

profunctors

filter

flatmap

upgrades.flatMapIndexed { idx, entry -> entry.map { Pair(it.key.position.add(-2.0*idx, 0.0, 0.0), Pair(it.value, it.value.data)) } }

public interface Applicative<F extends K1, Mu extends Applicative.Mu> extends Functor<F, Mu>

Category Theory

λ

std::reduce(std::execution::seq, v.cbegin(), v.cend())

functors

default Function15<T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, Function<T16, R>> curry15()

map

>>==

filter

public interface Applicative<F extends K1, Mu extends Applicative.Mu> extends Functor<F, Mu>

filter

filter

() -> a -> b -> (c, d, e) -> f -> a(b)(c)[d](e, f)

public interface Applicative<F extends K1, Mu extends Applicative.Mu> extends Functor<F, Mu>

interface Mu extends Profunctor.Mu {}

functors

reduce

functors

map

std::reduce(std::execution::seq, v.cbegin(), v.cend())

forall void a n m. MonadEffect n => MonadAff m => MonadEffect m => Plus m => m a -> n (Tuple (m a) (m void))

reduce

profunctors

functors

filter

profunctors

map