Hackage :: [Package]

quiver: Quiver finite stream processing library

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

Quiver is a powerful stream processing library for combinatorial and monadic representation of computations over both inductive and coinductive data streams.

It is similar to Gabriel Gonzalez's pipes and Michael Snoyman's conduit, but generalises both with support for functor-based computations and a clean support for finite (i.e., inductive) data streams, both upstream and downstream of the computation being defined.

[Skip to Readme]

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.0.0.1, 0.0.0.2, 0.0.0.3, 0.0.0.4, 0.0.0.5, 0.0.0.6, 0.0.0.7, 0.0.0.8, 0.0.0.9, 0.0.0.10, 0.0.0.11, 0.0.0.12, 1.0.0, 1.0.1, 1.0.2, 1.1.0, 1.1.1, 1.1.2, 1.1.3
Dependencies base (>=4.8 && <5), mmorph (>=1.0.4), transformers (>=0.4.2.0) [details]
License BSD-3-Clause
Copyright Copyright (c) 2015 Patryk Zadarnowski
Author Patryk Zadarnowski
Maintainer Patryk Zadarnowski <pat@jantar.org>
Category Control
Home page https://github.com/zadarnowski/quiver
Source repo head: git clone https://github.com/zadarnowski/quiver.git
this: git clone https://github.com/zadarnowski/quiver.git(tag 1.1.2)
Uploaded by patrykz at 2015-12-08T21:57:05Z
Distributions
Reverse Dependencies 10 direct, 1 indirect [details]
Downloads 10836 total (23 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]

Readme for quiver-1.1.3

[back to package description]

Quiver

Copyright © 2015 Patryk Zadarnowski «pat@jantar.org».
All rights reserved.

Quiver is a powerful stream processing library for combinatorial and monadic representation of computations over both inductive and coinductive data streams.

It is similar to Gabriel Gonzalez's pipes and Michael Snoyman's conduit, but generalises both with support for functor-based computations and a clean support for finite (i.e., inductive) data streams, both upstream and downstream of the computation being defined.

The underlying data structure, P, is almost identical to the Proxy data structure of the Pipes library, except that the Consume and Produce constructors (corresponding, respectively, to Request and Response in the Pipes' Proxy data type) include an additional argument which explicitly captures the processor's behaviour in the event of input stream depletion (for Consume) or output decoupling (for Produce). This simple mechanism subsumes Conduit's need for elaborate unconsumed-input tracking mechanisms, and allows us to provide a mathematically-clean framework for processing of finite data streams.

This library is currently very young, and users should expect significant changes to the Quiver core combinators as the underlying theory is developed and the interface stabilises asymptotically to the future version 1.0.