control-monad-queue: Reusable corecursive queues, via continuations.
This library provides efficient real-time queues via self-referential lazy lists. The technique was first published in Circular Programs and Self-Referential Structures by Lloyd Allison, Software Practice and Experience, 19(2), pp.99-109, Feb 1989
http://www.csse.monash.edu.au/~lloyd/tildeFP/1989SPE/
For an explanation of the library implementation, see Lloyd Allison's Corecursive Queues: Why Continuations Matter by Leon P Smith, in The Monad Reader, Issue 14.
http://themonadreader.files.wordpress.com/2009/07/issue14.pdf
| Versions | 0.0.9, 0.0.9.1, 0.0.9.2, 0.1 |
|---|---|
| Dependencies | base (>=2 && <5) |
| License | BSD3 |
| Author | Leon P Smith <leon@melding-monads.com> |
| Maintainer | Leon P Smith <leon@melding-monads.com> |
| Category | Control |
| Upload date | Wed Jul 29 13:33:03 UTC 2009 |
| Uploaded by | LeonSmith |
| Built on | ghc-6.10, ghc-6.12 |
| Distributions | Arch: 0.1 |
Modules
Downloads
- control-monad-queue-0.1.tar.gz (Cabal source package)
- package description (included in the package)
