¤ mapstateF

Types

mapstateF :: (a -> b -> (a, [c])) -> a -> F b c

mapstateF stf s0

mapstateF creates abstract fudgets with internal state. A state transition function determines its behaviour.

will become arguments to stf.

results from applications of stf.

stf :: a -> b -> (a, [c]): a state transition function. Whenever an input message appears, stf is applied to the message and the current state. The result from the application is a new internal state and a list of output messages.
s0 :: a: initial internal state.

 countF = mapstateF count 0 where count n _ = (n+1,[n+1])

 sumF = mapstateF add 0 where add acc n = (acc+n,[acc+n])

  mapstateF stf s0 = absF (concatMapAccumlSP stf s0)