Box.Box

A box is something that commits and emits

Documentation

data Box m c e

A Box is a product of a Committer m and an Emitter. Think of a box with an incoming wire and an outgoing wire. Now notice that the abstraction is reversable: are you looking at two wires from "inside a box"; a blind erlang grunt communicating with the outside world via the two thin wires, or are you looking from "outside the box"; interacting with a black box object. Either way, it's a box. And either way, the committer is contravariant and the emitter covariant so it forms a profunctor.

a Box can also be seen as having an input tape and output tape, thus available for turing and finite-state machine metaphorics.

Constructors

Box

Fields

• committer :: Committer m c
• emitter :: Emitter m e

Instances

Functor m => Profunctor (Box m)

Defined in Box.Box

Methods

dimap :: (a -> b) -> (c -> d) -> Box m b c -> Box m a d

lmap :: (a -> b) -> Box m b c -> Box m a c

rmap :: (b -> c) -> Box m a b -> Box m a c

(#.) :: forall a b c q. Coercible c b => q b c -> Box m a b -> Box m a c

(.#) :: forall a b c q. Coercible b a => Box m b c -> q a b -> Box m a c

(Monad m, Alternative m) => DecAlt (Box m)

Defined in Box.Box

Methods

choice :: (a -> Either b c) -> (Either d e -> f) -> Box m b d -> Box m c e -> Box m a f

loss :: Box m Void b

Applicative m => Divap (Box m)

Defined in Box.Box

Methods

divap :: (a -> (b, c)) -> ((d, e) -> f) -> Box m b d -> Box m c e -> Box m a f

conpur :: a -> Box m b a

(Alternative m, Monad m) => Semigroup (Box m c e)

Defined in Box.Box

Methods

(<>) :: Box m c e -> Box m c e -> Box m c e

sconcat :: NonEmpty (Box m c e) -> Box m c e

stimes :: Integral b => b -> Box m c e -> Box m c e

(Alternative m, Monad m) => Monoid (Box m c e)

Defined in Box.Box

Methods

mempty :: Box m c e

mappend :: Box m c e -> Box m c e -> Box m c e

mconcat :: [Box m c e] -> Box m c e

bmap :: Monad m => (a' -> m (Maybe a)) -> (b -> m (Maybe b')) -> Box m a b -> Box m a' b'

a profunctor dimapMaybe

hoistb :: Monad m => (forall a. m a -> n a) -> Box m c e -> Box n c e

Wrong signature for the MFunctor class

glue :: Monad m => Committer m a -> Emitter m a -> m ()

Connect an emitter directly to a committer of the same type.

The monadic action returns when the committer finishes.

glue_ :: Monad m => Committer m a -> Emitter m a -> m ()

Connect an emitter directly to a committer of the same type.

The monadic action returns if the committer returns False.

glueb :: Monad m => Box m a a -> m ()

Short-circuit a homophonuos box.

fuse :: Monad m => (a -> m (Maybe b)) -> Box m b a -> m ()

fuse a box

fuse (pure . pure) == glueb

dotb :: Monad m => Box m a b -> Box m b c -> m (Box m a c)

composition of monadic boxes

class Divap p where

combines divideconquer and liftA2pure

Methods

divap :: (a -> (b, c)) -> ((d, e) -> f) -> p b d -> p c e -> p a f

conpur :: a -> p b a

Instances

Applicative m => Divap (Box m)

Defined in Box.Box

Methods

divap :: (a -> (b, c)) -> ((d, e) -> f) -> Box m b d -> Box m c e -> Box m a f

conpur :: a -> Box m b a

class Profunctor p => DecAlt p where

combines Decidable and Alternative

Methods

choice :: (a -> Either b c) -> (Either d e -> f) -> p b d -> p c e -> p a f

loss :: p Void b

Instances

(Monad m, Alternative m) => DecAlt (Box m)

Defined in Box.Box

Methods

choice :: (a -> Either b c) -> (Either d e -> f) -> Box m b d -> Box m c e -> Box m a f

loss :: Box m Void b