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
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.
[Skip to Readme]
|Versions||0.0.9, 0.0.9.1, 0.0.9.2, 0.1, 0.2, 0.2.0.1|
|Dependencies||base (>=2 && <5) [details]|
|Author||Leon P Smith <email@example.com>|
|Maintainer||Leon P Smith <firstname.lastname@example.org>|
|Uploaded||by LeonSmith at Wed Jul 29 13:33:03 UTC 2009|
|Downloads||2216 total (8 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
|Status||Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI
For package maintainers and hackage trustees