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

http://themonadreader.files.wordpress.com/2009/07/issue142.pdf

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

http://www.melding-monads.com/files/CorecQueues.pdf

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 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
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 2015-12-19T11:09:06Z
Distributions NixOS:0.2.0.1
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 5021 total (21 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2015-12-19 [all 1 reports]