Hackage :: [Package]

stream-monad: Simple, Fair and Terminating Backtracking Monad

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

This Haskell library provides an implementation of the MonadPlus type class that enumerates results of a non-deterministic computation by interleaving subcomputations in a way that has usually much better memory performance than other strategies with the same termination properties.

[Skip to Readme]

Modules

[Index]

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.1, 0.1.1, 0.1.1.0, 0.2, 0.3, 0.4, 0.4.0.1, 0.4.0.2
Dependencies base [details]
License LicenseRef-PublicDomain
Author Oleg Kiselyov
Maintainer Sebastian Fischer (sebf@informatik.uni-kiel.de)
Category Control, Monads
Home page http://github.com/sebfisch/stream-monad
Bug tracker mailto:sebf@informatik.uni-kiel.de
Source repo head: git clone git://github.com/sebfisch/stream-monad.git
Uploaded by SebastianFischer at 2009-03-01T10:44:37Z
Distributions
Reverse Dependencies 4 direct, 3 indirect [details]
Downloads 6479 total (0 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]

Readme for stream-monad-0.1.1.0

[back to package description] 
Simple, Fair and Terminating Backtracking Monad
===============================================

This Haskell library provides an implementation of the MonadPlus type
class that enumerates results of a non-deterministic computation by
interleaving subcomputations in a way that has usually much better
memory performance than other strategies with the same termination
properties.

More information is available on the authors website:

    http://okmij.org/ftp/Computation/monads.html#fair-bt-stream