Data.MonadicStreamFunction.Core

Monadic Stream Functions are synchronized stream functions with side effects.

MSFs are defined by a function unMSF :: MSF m a b -> a -> m (b, MSF m a b) that executes one step of a simulation, and produces an output in a monadic context, and a continuation to be used for future steps.

MSFs are a generalisation of the implementation mechanism used by Yampa, Wormholes and other FRP and reactive implementations.

When combined with different monads, they produce interesting effects. For example, when combined with the Maybe monad, they become transformations that may stop producing outputs (and continuations). The Either monad gives rise to MSFs that end with a result (akin to Tasks in Yampa, and Monadic FRP).

Flattening, that is, going from some structure MSF (t m) a b to MSF m a b for a specific transformer t often gives rise to known FRP constructs. For instance, flattening with EitherT gives rise to switching, and flattening with ListT gives rise to parallelism with broadcasting.

MSFs can be used to implement many FRP variants, including Arrowized FRP, Classic FRP, and plain reactive programming. Arrowized and applicative syntax are both supported.

For a very detailed introduction to MSFs, see: http://dl.acm.org/citation.cfm?id=2976010 (mirror: http://www.cs.nott.ac.uk/~psxip1/#FRPRefactored).

Definitions

data MSF m a b

Stepwise, side-effectful MSFs without implicit knowledge of time.

MSFs should be applied to streams or executed indefinitely or until they terminate. See reactimate and reactimateB for details. In general, calling the value constructor MSF or the function unMSF is discouraged.

Constructors

MSF

Fields

• unMSF :: a -> m (b, MSF m a b)

Instances

Monad m => Arrow (MSF m)

Arrow instance for MSFs.

Methods

arr :: (b -> c) -> MSF m b c

first :: MSF m b c -> MSF m (b, d) (c, d)

second :: MSF m b c -> MSF m (d, b) (d, c)

(***) :: MSF m b c -> MSF m b' c' -> MSF m (b, b') (c, c')

(&&&) :: MSF m b c -> MSF m b c' -> MSF m b (c, c')

Monad m => Category * (MSF m)

Instance definition for Category. Defines id and ..

Methods

id :: cat a a

(.) :: cat b c -> cat a b -> cat a c

Functor m => Functor (MSF m a)

Functor instance for MSFs.

Methods

fmap :: (a -> b) -> MSF m a a -> MSF m a b

(<$) :: a -> MSF m a b -> MSF m a a

(Functor m, Monad m) => Applicative (MSF m a)

Applicative instance for MSFs.

Methods

pure :: a -> MSF m a a

(<*>) :: MSF m a (a -> b) -> MSF m a a -> MSF m a b

(*>) :: MSF m a a -> MSF m a b -> MSF m a b

(<*) :: MSF m a a -> MSF m a b -> MSF m a a

type Groundring (MSF m a v)

type Groundring (MSF m a v) = Groundring v

Monadic computations and MSFs

Lifting point-wise computations

arrM :: Monad m => (a -> m b) -> MSF m a b

Apply a monadic transformation to every element of the input stream.

Generalisation of arr from Arrow to monadic functions.

liftS :: (Monad m2, MonadBase m1 m2) => (a -> m1 b) -> MSF m2 a b

Monadic lifting from one monad into another

Lifting MSFs

Lifting across monad stacks

liftMSFTrans :: (MonadTrans t, Monad m, Monad (t m)) => MSF m a b -> MSF (t m) a b

Lift inner monadic actions in monad stacks.

liftMSFBase :: (Monad m2, MonadBase m1 m2) => MSF m1 a b -> MSF m2 a b

Lift innermost monadic actions in a monad stacks (generalisation of liftIO).

Generic MSF Lifting

liftMSFPurer :: (Monad m2, Monad m1) => (forall c. m1 c -> m2 c) -> MSF m1 a b -> MSF m2 a b

Lifting purer monadic actions (in an arbitrary way)

MSFs within monadic actions

performOnFirstSample :: Monad m => m (MSF m a b) -> MSF m a b

Extract MSF from a monadic action.

Runs a monadic action that produces an MSF on the first iteration/step, and uses that MSF as the main signal function for all inputs (including the first one).

Delays

iPre

Arguments

:: Monad m

=> a

First output

-> MSF m a a

Delay a signal by one sample.

delay :: Monad m => a -> MSF m a a

See iPre.

Switching

switch :: Monad m => MSF m a (b, Maybe c) -> (c -> MSF m a b) -> MSF m a b

Switching applies one MSF until it produces a Just output, and then "turns on" a continuation and runs it.

A more advanced and comfortable approach to switching is given by Exceptions in Except

Feedback loops

feedback :: Monad m => c -> MSF m (a, c) (b, c) -> MSF m a b

Well-formed looped connection of an output component as a future input.

Execution/simulation

embed :: Monad m => MSF m a b -> [a] -> m [b]

Apply a monadic stream function to a list.

Because the result is in a monad, it may be necessary to traverse the whole list to evaluate the value in the results to WHNF. For example, if the monad is the maybe monad, this may not produce anything if the MSF produces Nothing at any point, so the output stream cannot consumed progressively.

To explore the output progressively, use liftMSF and '(>>>)'', together with some action that consumes/actuates on the output.

This is called runSF in Liu, Cheng, Hudak, "Causal Commutative Arrows and Their Optimization"

reactimate :: Monad m => MSF m () () -> m ()

Run an MSF indefinitely passing a unit-carrying input stream.

reactimateB :: Monad m => MSF m () Bool -> m ()

Run an MSF indefinitely passing a unit-carrying input stream. A more high-level approach to this would be the use of MaybeT in Maybe. | Run an MSF indefinitely passing a unit-carrying input stream.