Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Synopsis
- newtype State s a = State (((->) s :. (:*:) s) := a)
- type Stateful s t = Adaptable t (->) (State s)
- reconcile :: (Bindable (->) t, Stateful s t, Adaptable t (->) u) => (s -> u s) -> t s
- type Memorable s t = (Covariant (->) (->) t, Pointable t, Stateful s t)
- fold :: (Traversable (->) (->) t, Memorable s u) => (a -> s -> s) -> t a -> u s
Documentation
Effectful computation with a variable
Instances
fold :: (Traversable (->) (->) t, Memorable s u) => (a -> s -> s) -> t a -> u s Source #