Functional

interface Mu extends Profunctor.Mu {}

flatmap

map

filter

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

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

μ

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>

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)

filter

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

Natural Transformations

map

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

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

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

filter

Int -> Int -> Int -> Int -> Int -> Int -> Int -> Int -> Int

reduce

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

category theory

flatmap

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

functors

filter

flatmap

filter

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

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

filter

>>==

map

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

Int -> Int -> Int -> Int -> Int -> Int -> Int -> Int -> Int

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))

μ

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

λ

>>==

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

(+ 1 1)

profunctors

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)

category theory

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

map

The λ-cube sees all