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

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, Jul 2009.

A lightly edited version of the paper above is available at:

[Skip to ReadMe]


Versions0.0.9,,, 0.1, 0.2,
Change logNone available
Dependenciesbase (>=2 && <5) [details]
AuthorLeon P Smith <>
MaintainerLeon P Smith <>
Source repositoryhead: darcs get
this: darcs get --tag 0.2
UploadedMon Mar 28 08:44:47 UTC 2011 by LeonSmith
Downloads1111 total (16 in last 30 days)
0 []
StatusDocs uploaded by user
Build status unknown [no reports yet]




Maintainers' corner

For package maintainers and hackage trustees

Readme for control-monad-queue-0.2

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

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