Hoogle Search
Within LTS Haskell 24.41 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
Allows bidirectional communication between two MachineT. Exposed the same interface of Pipes library.
type
Proxy a' a b' b (m :: Type -> Type) c = MachineT m Exchange a' a b' b cmachines Data.Machine.Pipe No documentation available.
-
No documentation available.
type
Plan (k :: Type -> Type) o a = forall (m :: Type -> Type) . () => PlanT k o m amachines Data.Machine.Plan A Plan k o a is a specification for a pure Machine, that reads inputs selected by k with types based on i, writes values of type o, and has intermediate results of type a. A Plan k o a can be used as a PlanT k o m a for any Monad m. It is perhaps easier to think of Plan in its un-cps'ed form, which would look like:
data Plan k o a = Done a | Yield o (Plan k o a) | forall z. Await (z -> Plan k o a) (k z) (Plan k o a) | Fail
newtype
PlanT (k :: Type -> Type) o (m :: Type -> Type) amachines Data.Machine.Plan You can construct a Plan (or PlanT), turning it into a Machine (or MachineT).
-
machines Data.Machine.Plan No documentation available.
-
No documentation available.
type
Process a b = Machine Is a bmachines Data.Machine.Process A Process a b is a stream transducer that can consume values of type a from its input, and produce values of type b for its output.
type
ProcessT (m :: Type -> Type) a b = MachineT m Is a bmachines Data.Machine.Process A ProcessT m a b is a stream transducer that can consume values of type a from its input, and produce values of type b and has side-effects in the Monad m.
-
machines Data.Machine.Stack No documentation available.