The control-monad-queue package

[Tags: bsd3, library]

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


[Skip to ReadMe]

Properties

Versions0.0.9, 0.0.9.1, 0.0.9.2, 0.1, 0.2
Change logNone available
Dependenciesbase (>=2 && <5) [details]
LicenseBSD3
AuthorLeon P Smith <leon@melding-monads.com>
MaintainerLeon P Smith <leon@melding-monads.com>
CategoryControl
UploadedWed Jul 29 13:33:03 UTC 2009 by LeonSmith
DistributionsNixOS:0.2
Downloads888 total (47 in last 30 days)
Votes
0 []
StatusDocs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees

Readme for control-monad-queue-0.1

To compile the timing program,  change to the tests/ directory, and then run

ghc --make -O2 Time.hs -i..