control-monad-queue: Reusable corecursive queues, via continuations.

[ bsd3, control, library ] [ Propose Tags ]

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]
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]
License BSD-3-Clause
Author Leon P Smith <leon@melding-monads.com>
Maintainer Leon P Smith <leon@melding-monads.com>
Category Control
Uploaded by LeonSmith at Wed Jul 29 13:33:03 UTC 2009
Distributions NixOS:0.2.0.1
Downloads 2248 total (19 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees


Readme for control-monad-queue-0.1

[back to package description]
To compile the timing program,  change to the tests/ directory, and then run

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