Safe Haskell	Safe-Inferred
Language	Haskell2010

Weave.Strict

Description

Strict weaves are the naive implementation of the idea "what if we generalized zip to free monads?"

The resulting breadth-first unfold take quadratic time, which is slow.

The main reason for making this available is to compare it with the other variants.

Synopsis

data Weave (m :: Type -> Type) a where
- Pure :: forall a (m :: Type -> Type). a -> Weave m a
- Weft :: forall (m :: Type -> Type) a. m (Weave m a) -> Weave m a
weft :: m (Weave m a) -> Weave m a
mesh :: Monad m => Weave m a -> m a

Documentation

data Weave (m :: Type -> Type) a where Source #

Strict weaves.

The Applicative operation (liftA2) combines weaves level-wise.

Constructors

Pure :: forall a (m :: Type -> Type). a -> Weave m a
Weft :: forall (m :: Type -> Type) a. m (Weave m a) -> Weave m a

Instances details

Applicative m => Applicative (Weave m) Source #
Instance details Defined in Weave.Strict Methods pure :: a -> Weave m a # (<>) :: Weave m (a -> b) -> Weave m a -> Weave m b # liftA2 :: (a -> b -> c) -> Weave m a -> Weave m b -> Weave m c # (>) :: Weave m a -> Weave m b -> Weave m b # (<*) :: Weave m a -> Weave m b -> Weave m a #
Functor m => Functor (Weave m) Source #
Instance details Defined in Weave.Strict Methods fmap :: (a -> b) -> Weave m a -> Weave m b # (<$) :: a -> Weave m b -> Weave m a #

weft :: m (Weave m a) -> Weave m a Source #

A weft is one level of Weave. It is a computation which returns the remaining levels.

mesh :: Monad m => Weave m a -> m a Source #

Run all the wefts in a Weave sequentially.