CC-delcont-ref-tf: A monad transformers for multi-prompt delimited control using refercence cells

[ bsd3, control, library ] [ Propose Tags ]

This library implements the superset of the interface described in * A Monadic Framework for Delimited Continuations, R. Kent Dybvig, Simon Peyton Jones, and Amr Sabry JFP, v17, N6, pp. 687--730, 2007. http://www.cs.indiana.edu/cgi-bin/techreports/TRNNN.cgi?trnum=TR615

This library is closest to the interface of Dybvig, Peyton Jones and Sabry. Control.Monad.CC.CCRef is derived from the definitional interpreter using the implementation techniques described and justified in the FLOPS 2010 paper. The monad transformer CC implemented by Control.Monad.CC.CCRef requires the base monad to support reference cells. In other words, the base monad must be a member of the type class MonadRef: that is, must be IO, ST, STM or their transformer. Control.Monad.CC.CCRef adds to the original interface the frequently used function abortP as a primitive.

See the original article at http://okmij.org/ftp/continuations/implementations.html#CC-monads for more information.

This package uses http://hackage.haskell.org/package/ref-tf's MonadRef class instead of Mutation class what is used in http://hackage.haskell.org/package/CC-delcont-ref package.

Modules

[Index]

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.1.0.0, 0.1.0.1, 0.1.0.2
Dependencies base (>=3 && <5), ref-tf, transformers (>=0.2) [details]
License BSD-3-Clause
Author Oleg Kiselyov, shelarcy
Maintainer shelarcy <shelarcy@gmail.com>
Category Control
Uploaded by KidoTakahiro at 2011-10-18T13:32:20Z
Distributions
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 3221 total (12 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]