machines: Networked stream transducers

[ bsd3, control, enumerator, library ] [ Propose Tags ]

Networked stream transducers


[Skip to Readme]
Versions [RSS] [faq] 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
Change log CHANGELOG.markdown
Dependencies base (==4.5.*), comonad (==3.0.*), containers (>=0.3 && <0.6), free (>=3.1.1 && <3.2), mtl (>=2.1.1 && <2.2), profunctors (==3.0.*), semigroups (>=0.8.3 && <0.9), transformers (==0.3.*) [details]
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-21T13:31:34Z
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 2012-09-03T16:32:31Z
Distributions LTSHaskell:0.7.2, NixOS:0.7.2, Stackage:0.7.2
Downloads 23984 total (89 in the last 30 days)
Rating 2.5 (votes: 4) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

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

For package maintainers and hackage trustees

Candidates


Readme for machines-0.1.1

[back to package description]

machines

Build Status

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.

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