| Copyright | (c) 2005 Amr Sabry Chung-chieh Shan Oleg Kiselyov and Daniel P. Friedman |
|---|---|
| License | GPLv2 or higher, see LICENSE.txt |
| Maintainer | Christian.Maeder@dfki.de |
| Stability | experimental |
| Portability | non-portable (RankNTypes) |
| Safe Haskell | Safe |
Common.SFKT
Description
Implementation of LogicT based on the two-continuation model of streams
Documentation
Instances
| MonadTrans SFKT Source # | |
Defined in Common.SFKT | |
| LogicT SFKT Source # | |
Defined in Common.SFKT Methods msplit :: forall (m :: Type -> Type) a. (Monad m, MonadPlus (SFKT m)) => SFKT m a -> SFKT m (Maybe (a, SFKT m a)) Source # interleave :: forall (m :: Type -> Type) a. (Monad m, MonadPlus (SFKT m)) => SFKT m a -> SFKT m a -> SFKT m a Source # gsuccess :: forall (m :: Type -> Type) a. (Monad m, MonadPlus (SFKT m)) => a -> SFKT m a Source # gfail :: forall (m :: Type -> Type) a. (Monad m, MonadPlus (SFKT m)) => SFKT m a Source # bindi :: forall (m :: Type -> Type) a b. (Monad m, MonadPlus (SFKT m)) => SFKT m a -> (a -> SFKT m b) -> SFKT m b Source # ifte :: forall (m :: Type -> Type) a b. (Monad m, MonadPlus (SFKT m)) => SFKT m a -> (a -> SFKT m b) -> SFKT m b -> SFKT m b Source # once :: forall (m :: Type -> Type) a. (Monad m, MonadPlus (SFKT m)) => SFKT m a -> SFKT m a Source # | |
| Monad m => Monad (SFKT m) Source # | |
| Monad m => Functor (SFKT m) Source # | |
| MonadFail m => MonadFail (SFKT m) Source # | |
Defined in Common.SFKT | |
| Monad m => Applicative (SFKT m) Source # | |
| Monad m => Alternative (SFKT m) Source # | |
| Monad m => MonadPlus (SFKT m) Source # | |
| MonadIO m => MonadIO (SFKT m) Source # | |
Defined in Common.SFKT | |