Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Synopsis
- newtype State s a = State (((->) s :. (:*:) s) >>> a)
- type Stateful s t = Adaptable t (->) (State s)
- current :: Stateful s t => t s
- change :: Stateful s t => (s -> s) -> t 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
Monoidal (-->) (-->) (:*:) (:*:) (State s) Source # | |
Semimonoidal (-->) (:*:) (:*:) (State s :: Type -> Type) Source # | |
Invariant (Flip State r) Source # | |
Gettable State Source # | |
Settable State Source # | |
Modifiable State Source # | |
Defined in Pandora.Paradigm.Inventory.Some.State type Modification State e r Source # modify :: Modification State e r Source # | |
Bindable ((->) :: Type -> Type -> Type) (State s) Source # | |
Defined in Pandora.Paradigm.Inventory.Some.State (=<<) :: (a -> State s b) -> State s a -> State s b Source # (==<<) :: (a -> State s b) -> State s a -> State s b Source # (===<<) :: (a -> State s b) -> State s a -> State s b Source # (====<<) :: (a -> State s b) -> State s a -> State s b Source # (=====<<) :: (a -> State s b) -> State s a -> State s b Source # (======<<) :: (a -> State s b) -> State s a -> State s b Source # (=======<<) :: (a -> State s b) -> State s a -> State s b Source # | |
Interpreted ((->) :: Type -> Type -> Type) (State s) Source # | |
Defined in Pandora.Paradigm.Inventory.Some.State run :: ((->) < State s a) < Primary (State s) a Source # unite :: ((->) < Primary (State s) a) < State s a Source # (<~~~~~~~~) :: ((->) < State s a) < Primary (State s) a Source # (<~~~~~~~) :: ((->) < State s a) < Primary (State s) a Source # (<~~~~~~) :: ((->) < State s a) < Primary (State s) a Source # (<~~~~~) :: ((->) < State s a) < Primary (State s) a Source # (<~~~~) :: ((->) < State s a) < Primary (State s) a Source # (<~~~) :: ((->) < State s a) < Primary (State s) a Source # (<~~) :: ((->) < State s a) < Primary (State s) a Source # (<~) :: ((->) < State s a) < Primary (State s) a Source # (=#-) :: (Semigroupoid (->), Interpreted (->) u) => (((->) < Primary (State s) a) < Primary u b) -> ((->) < State s a) < u b Source # (-#=) :: (Semigroupoid (->), Interpreted (->) u) => (((->) < State s a) < u b) -> ((->) < Primary (State s) a) < Primary u b Source # (<$=#-) :: (Semigroupoid (->), Covariant (->) (->) j, Interpreted (->) u) => (((->) < Primary (State s) a) < Primary u b) -> (j > State s a) -> (j > u b) Source # (-#=$>) :: (Covariant (->) (->) j, Interpreted (->) u) => (((->) < State s a) < u b) -> (j > Primary (State s) a) -> (j > Primary u b) Source # | |
Monad ((->) :: Type -> Type -> Type) (State s) Source # | |
Defined in Pandora.Paradigm.Inventory.Some.State | |
Monadic ((->) :: Type -> Type -> Type) (State s) Source # | |
Covariant ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) (State s) Source # | |
Defined in Pandora.Paradigm.Inventory.Some.State (<-|-) :: (a -> b) -> State s a -> State s b Source # (<-|--) :: (a -> b) -> State s a -> State s b Source # (<-|---) :: (a -> b) -> State s a -> State s b Source # (<-|----) :: (a -> b) -> State s a -> State s b Source # (<-|-----) :: (a -> b) -> State s a -> State s b Source # (<-|------) :: (a -> b) -> State s a -> State s b Source # (<-|-------) :: (a -> b) -> State s a -> State s b Source # (<-|--------) :: (a -> b) -> State s a -> State s b Source # (<-|-|-) :: (Covariant (->) (Betwixt (->) (->)) u, Covariant (Betwixt (->) (->)) (->) (State s)) => (a -> b) -> State s (u a) -> State s (u b) Source # (<-|-|--) :: (Covariant (->) (Betwixt (->) (->)) u, Covariant (Betwixt (->) (->)) (->) (State s)) => (a -> b) -> State s (u a) -> State s (u b) Source # (<-|-|---) :: (Covariant (->) (Betwixt (->) (->)) u, Covariant (Betwixt (->) (->)) (->) (State s)) => (a -> b) -> State s (u a) -> State s (u b) Source # (<-|-|----) :: (Covariant (->) (Betwixt (->) (->)) u, Covariant (Betwixt (->) (->)) (->) (State s)) => (a -> b) -> State s (u a) -> State s (u b) Source # (<-|-|-----) :: (Covariant (->) (Betwixt (->) (->)) u, Covariant (Betwixt (->) (->)) (->) (State s)) => (a -> b) -> State s (u a) -> State s (u b) Source # (<-|-|------) :: (Covariant (->) (Betwixt (->) (->)) u, Covariant (Betwixt (->) (->)) (->) (State s)) => (a -> b) -> State s (u a) -> State s (u b) Source # (<-|-|-------) :: (Covariant (->) (Betwixt (->) (->)) u, Covariant (Betwixt (->) (->)) (->) (State s)) => (a -> b) -> State s (u a) -> State s (u b) Source # (<-|-|-|-) :: (Covariant (->) (Betwixt (->) (Betwixt (->) (->))) v, Covariant (Betwixt (->) (Betwixt (->) (->))) (Betwixt (Betwixt (->) (->)) (->)) u, Covariant (Betwixt (Betwixt (->) (->)) (->)) (->) (State s)) => (a -> b) -> State s (u (v a)) -> State s (u (v b)) Source # | |
Adjoint ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) (Store s) (State s) Source # | |
Defined in Pandora.Paradigm.Inventory (-|) :: (Store s a -> b) -> a -> State s b Source # (|-) :: (a -> State s b) -> Store s a -> b Source # (|--------) :: (a -> State s b) -> Store s a -> b Source # (|-------) :: (a -> State s b) -> Store s a -> b Source # (|------) :: (a -> State s b) -> Store s a -> b Source # (|-----) :: (a -> State s b) -> Store s a -> b Source # (|----) :: (a -> State s b) -> Store s a -> b Source # (|---) :: (a -> State s b) -> Store s a -> b Source # (|--) :: (a -> State s b) -> Store s a -> b Source # (--------|) :: (Store s a -> b) -> a -> State s b Source # (-------|) :: (Store s a -> b) -> a -> State s b Source # (------|) :: (Store s a -> b) -> a -> State s b Source # (-----|) :: (Store s a -> b) -> a -> State s b Source # (----|) :: (Store s a -> b) -> a -> State s b Source # | |
type Schematic Monad (State s) Source # | |
type Primary (State s) a Source # | |
type Getting State state ouput Source # | |
Defined in Pandora.Paradigm.Inventory.Some.State | |
type Setting State state output Source # | |
Defined in Pandora.Paradigm.Inventory.Some.State | |
type Modification State state output Source # | |
Defined in Pandora.Paradigm.Inventory.Some.State |
fold :: (Traversable (->) (->) t, Memorable s u) => (a -> s -> s) -> t a -> u s Source #