adjunctions-4.4.2: Adjunctions and representable functors

Copyright | (C) 2011-2013 Edward Kmett
License | BSD-style (see the file LICENSE)
Maintainer | Edward Kmett <ekmett@gmail.com>
Stability | provisional
Portability | MPTCs, fundeps
Safe Haskell | Safe-Inferred
Language | Haskell2010

Control.Monad.Trans.Conts

Contents

- Continuation passing style
- Multiple-continuation passing style
- Multiple-continuation passing style transformer

Description

    Cont r ~ Contravariant.Adjoint (Op r) (Op r)
    Conts r ~ Contravariant.AdjointT (Op r) (Op r)
    ContsT r w m ~ Contravariant.AdjointT (Op (m r)) (Op (m r)) w

Synopsis

- type Cont r = ContsT r Identity Identity
- cont :: ((a -> r) -> r) -> Cont r a
- runCont :: Cont r a -> (a -> r) -> r
- type Conts r (w :: Type -> Type) = ContsT r w Identity
- runConts :: Functor w => Conts r w a -> w (a -> r) -> r
- conts :: Functor w => (w (a -> r) -> r) -> Conts r w a
- newtype ContsT r (w :: Type -> Type) (m :: Type -> Type) a = ContsT {
  - runContsT :: w (a -> m r) -> m r
  }
- callCC :: forall (w :: Type -> Type) a r (m :: Type -> Type) b. Comonad w => ((a -> ContsT r w m b) -> ContsT r w m a) -> ContsT r w m a

# Continuation passing style

type Cont r = ContsT r Identity Identity #

cont :: ((a -> r) -> r) -> Cont r a #

runCont :: Cont r a -> (a -> r) -> r #

# Multiple-continuation passing style

type Conts r (w :: Type -> Type) = ContsT r w Identity #

runConts :: Functor w => Conts r w a -> w (a -> r) -> r #

conts :: Functor w => (w (a -> r) -> r) -> Conts r w a #

# Multiple-continuation passing style transformer

newtype ContsT r (w :: Type -> Type) (m :: Type -> Type) a #

Constructors

ContsT |
Fields runContsT :: w (a -> m r) -> m r

#### Instances

Instances details

Comonad w => MonadTrans (ContsT r w) # |
Instance details Defined in Control.Monad.Trans.Conts Methods lift :: Monad m => m a -> ContsT r w m a #
Comonad w => Applicative (ContsT r w m) # |
Instance details Defined in Control.Monad.Trans.Conts Methods pure :: a -> ContsT r w m a # (<*>) :: ContsT r w m (a -> b) -> ContsT r w m a -> ContsT r w m b # liftA2 :: (a -> b -> c) -> ContsT r w m a -> ContsT r w m b -> ContsT r w m c # (*>) :: ContsT r w m a -> ContsT r w m b -> ContsT r w m b # (<*) :: ContsT r w m a -> ContsT r w m b -> ContsT r w m a #
Functor w => Functor (ContsT r w m) # |
Instance details Defined in Control.Monad.Trans.Conts Methods fmap :: (a -> b) -> ContsT r w m a -> ContsT r w m b # (<$) :: a -> ContsT r w m b -> ContsT r w m a #
Comonad w => Monad (ContsT r w m) # |
Instance details Defined in Control.Monad.Trans.Conts Methods (>>=) :: ContsT r w m a -> (a -> ContsT r w m b) -> ContsT r w m b # (>>) :: ContsT r w m a -> ContsT r w m b -> ContsT r w m b # return :: a -> ContsT r w m a #
Comonad w => Apply (ContsT r w m) # |
Instance details Defined in Control.Monad.Trans.Conts Methods (<.>) :: ContsT r w m (a -> b) -> ContsT r w m a -> ContsT r w m b # (.>) :: ContsT r w m a -> ContsT r w m b -> ContsT r w m b # (<.) :: ContsT r w m a -> ContsT r w m b -> ContsT r w m a # liftF2 :: (a -> b -> c) -> ContsT r w m a -> ContsT r w m b -> ContsT r w m c #

callCC :: forall (w :: Type -> Type) a r (m :: Type -> Type) b. Comonad w => ((a -> ContsT r w m b) -> ContsT r w m a) -> ContsT r w m a #