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, Jul 2009.
A lightly edited version of the paper above is available at:
|Versions [faq]||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>|
|Source repo||head: darcs get http://hub.darcs.net/lpsmith/control-monad-queue
this: darcs get http://hub.darcs.net/lpsmith/control-monad-queue --tag 0.2.0.1
|Uploaded||by LeonSmith at Sat Dec 19 11:09:06 UTC 2015|
|Downloads||2484 total (34 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
Docs available [build log]
Last success reported on 2015-12-19 [all 1 reports]
For package maintainers and hackage trustees