machines: Networked stream transducers

[ bsd3, control, enumerator, library ] [ Propose Tags ] [ Report a vulnerability ]

Networked stream transducers

Modules

Data
- Data.Machine

Downloads

machines-0.2.2.tar.gz [browse] (Cabal source package)
Package description (revised from the package)

Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

Maintainer's Corner

Package maintainers

EdwardKmett, EricMertens, ryanglscott

For package maintainers and hackage trustees

edit package information

Candidates

No Candidates

Versions [RSS]	0.1, 0.1.1, 0.1.2, 0.2.1, 0.2.1.1, 0.2.1.2, 0.2.1.3, 0.2.2, 0.2.3, 0.2.3.1, 0.2.4, 0.2.5, 0.4, 0.4.0.1, 0.4.1, 0.5.1, 0.6, 0.6.1, 0.6.2, 0.6.3, 0.6.4, 0.7, 0.7.1, 0.7.2, 0.7.3, 0.7.4
Change log	CHANGELOG.markdown
Dependencies	base (>=4.5 && <5), comonad (>=3), containers (>=0.3 && <0.6), free (>=3.1.1), mtl (>=2.1.1 && <2.2), pointed (>=3), profunctors (>=3), semigroups (>=0.8.3), transformers (>=0.3 && <0.4) [details]
Tested with	ghc ==7.4.1
License	BSD-3-Clause
Copyright	Copyright (C) 2012 Edward A. Kmett
Author	Edward A. Kmett, Rúnar Bjarnason
Maintainer	Edward A. Kmett <ekmett@gmail.com>
Revised	Revision 1 made by AdamBergmark at 2015年05月21日T13:33:07Z
Category	Control, Enumerator
Home page	http://github.com/ekmett/machines/
Bug tracker	http://github.com/ekmett/machines/issues
Source repo	head: git clone git://github.com/ekmett/machines.git
Uploaded	by EdwardKmett at 2013年01月06日T23:06:54Z
Distributions	LTSHaskell:0.7.4, NixOS:0.7.4, Stackage:0.7.4
Reverse Dependencies	33 direct, 3 indirect [details]
Downloads	28599 total (37 in the last 30 days)
Rating	2.5 (votes: 4) [estimated by Bayesian average]
Your Rating	λ λ λ
Status	Docs uploaded by user Build status unknown [no reports yet]

Readme for machines-0.2.2

[back to package description]

machines

Build Status

Ceci n'est pas une pipe

Machines are demand driven input sources like pipes or conduits, but can support multiple inputs.

You design a Machine by writing a Plan. You then construct the machine.

Simple machines that take one input are called a Process and processes form a Category. More generally you can attach a Process to the output of any type of Machine, yielding a new Machine.

More complicated machines provide other ways of connecting to them.

Typically the use of machines proceeds by using simple plans into machine Tees and Wyes, capping many of the inputs to those with possibly monadic sources, feeding the rest input (possibly repeatedly) and calling run or runT to get the answers out.

There is a lot of flexibility when building a machine in choosing between empowering the machine to run its own monadic effects or delegating that responsibility to a custom driver.

A port of this design to scala is available from runarorama/machines

Contact Information

Contributions and bug reports are welcome!

Please feel free to contact me through github or on the #haskell IRC channel on irc.freenode.net.

-Edward Kmett