Copyright	Sebastian Fischer
License	BSD3
Maintainer	Niels Bunkenburg (nbu@informatik.uni-kiel.de)
Stability	experimental
Portability	portable
Safe Haskell	Safe-Inferred
Language	Haskell2010

Control.Monad.SearchTree

Description

This Haskell library provides an implementation of the MonadPlus type class that represents the search space as a tree whose constructors represent mzero, return, and mplus.

Such a tree can be used to implement different search strategies, e.g., by using a queue. It can also be used as a basis for parallel search strategies that evaluate different parts of the search space concurrently.

Synopsis

data SearchTree a
- = None
- | One a
- | Choice (SearchTree a) (SearchTree a)
data Search a
searchTree :: Search a -> SearchTree a

Documentation

data SearchTree a Source #

The type SearchTree a represents non-deterministic computations as a tree structure.

Constructors

None
One a
Choice (SearchTree a) (SearchTree a)

Instances

Instances details

MonadFail SearchTree Source #
Instance details Defined in Control.Monad.SearchTree Methods fail :: String -> SearchTree a Source #
MonadFix SearchTree Source #
Instance details Defined in Control.Monad.SearchTree Methods mfix :: (a -> SearchTree a) -> SearchTree a Source #
Alternative SearchTree Source #
Instance details Defined in Control.Monad.SearchTree Methods empty :: SearchTree a Source # (<\|>) :: SearchTree a -> SearchTree a -> SearchTree a Source # some :: SearchTree a -> SearchTree [a] Source # many :: SearchTree a -> SearchTree [a] Source #
Applicative SearchTree Source #
Instance details Defined in Control.Monad.SearchTree Methods pure :: a -> SearchTree a Source # (<>) :: SearchTree (a -> b) -> SearchTree a -> SearchTree b Source # liftA2 :: (a -> b -> c) -> SearchTree a -> SearchTree b -> SearchTree c Source # (>) :: SearchTree a -> SearchTree b -> SearchTree b Source # (<*) :: SearchTree a -> SearchTree b -> SearchTree a Source #
Functor SearchTree Source #
Instance details Defined in Control.Monad.SearchTree Methods fmap :: (a -> b) -> SearchTree a -> SearchTree b Source # (<$) :: a -> SearchTree b -> SearchTree a Source #
Monad SearchTree Source #
Instance details Defined in Control.Monad.SearchTree Methods (>>=) :: SearchTree a -> (a -> SearchTree b) -> SearchTree b Source # (>>) :: SearchTree a -> SearchTree b -> SearchTree b Source # return :: a -> SearchTree a Source #
MonadPlus SearchTree Source #
Instance details Defined in Control.Monad.SearchTree Methods mzero :: SearchTree a Source # mplus :: SearchTree a -> SearchTree a -> SearchTree a Source #
Show a => Show (SearchTree a) Source #
Instance details Defined in Control.Monad.SearchTree Methods showsPrec :: Int -> SearchTree a -> ShowS Source # show :: SearchTree a -> String Source # showList :: [SearchTree a] -> ShowS Source #

data Search a Source #

Another search monad based on continuations that produce search trees.

Instances

Instances details

MonadFail Search Source #
Instance details Defined in Control.Monad.SearchTree Methods fail :: String -> Search a Source #
MonadFix Search Source #
Instance details Defined in Control.Monad.SearchTree Methods mfix :: (a -> Search a) -> Search a Source #
Alternative Search Source #
Instance details Defined in Control.Monad.SearchTree Methods empty :: Search a Source # (<\|>) :: Search a -> Search a -> Search a Source # some :: Search a -> Search [a] Source # many :: Search a -> Search [a] Source #
Applicative Search Source #
Instance details Defined in Control.Monad.SearchTree Methods pure :: a -> Search a Source # (<>) :: Search (a -> b) -> Search a -> Search b Source # liftA2 :: (a -> b -> c) -> Search a -> Search b -> Search c Source # (>) :: Search a -> Search b -> Search b Source # (<*) :: Search a -> Search b -> Search a Source #
Functor Search Source #
Instance details Defined in Control.Monad.SearchTree Methods fmap :: (a -> b) -> Search a -> Search b Source # (<$) :: a -> Search b -> Search a Source #
Monad Search Source #
Instance details Defined in Control.Monad.SearchTree Methods (>>=) :: Search a -> (a -> Search b) -> Search b Source # (>>) :: Search a -> Search b -> Search b Source # return :: a -> Search a Source #
MonadPlus Search Source #
Instance details Defined in Control.Monad.SearchTree Methods mzero :: Search a Source # mplus :: Search a -> Search a -> Search a Source #

searchTree :: Search a -> SearchTree a Source #

Computes the SearchTree representation of a Search action.