Control.Monad.Queue.Allison

A library implementation of corecursive queues, see 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 Queue: Why Continuations Matter by Leon P Smith, in The Monad Reader issue 14.

Documentation

data Q e a

Instances

MonadQueue e (Q e)

Monad (Q e)

type LenType = Word32

enQ :: e -> Q e ()

peekQ :: Q e (Maybe e)

peekQn :: Integral index => index -> Q e (Maybe e)

peekQs :: Integral len => len -> Q e [e]

deQ :: Q e (Maybe e)

deQs :: Integral len => len -> Q e [e]

deQ_break :: Q e e

lenQ :: Integral len => Q e len

lenQ_ :: Q e LenType

runQueue :: Q e a -> [e]

callCC :: ((a -> forall b. Q e b) -> Q e a) -> Q e a