Copyright	Sebastian Fischer
License	BSD3
Maintainer	Sebastian Fischer (sebf@informatik.uni-kiel.de)
Stability	experimental
Portability	portable
Safe Haskell	Safe
Language	Haskell98

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

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

Monad SearchTree Source #
Methods (>>=) :: SearchTree a -> (a -> SearchTree b) -> SearchTree b # (>>) :: SearchTree a -> SearchTree b -> SearchTree b # return :: a -> SearchTree a # fail :: String -> SearchTree a #
Functor SearchTree Source #
Methods fmap :: (a -> b) -> SearchTree a -> SearchTree b # (<$) :: a -> SearchTree b -> SearchTree a #
Applicative SearchTree Source #
Methods pure :: a -> SearchTree a # (<>) :: SearchTree (a -> b) -> SearchTree a -> SearchTree b # (>) :: SearchTree a -> SearchTree b -> SearchTree b # (<*) :: SearchTree a -> SearchTree b -> SearchTree a #
Alternative SearchTree Source #
Methods empty :: SearchTree a # (<\|>) :: SearchTree a -> SearchTree a -> SearchTree a # some :: SearchTree a -> SearchTree [a] # many :: SearchTree a -> SearchTree [a] #
MonadPlus SearchTree Source #
Methods mzero :: SearchTree a # mplus :: SearchTree a -> SearchTree a -> SearchTree a #
Show a => Show (SearchTree a) Source #
Methods showsPrec :: Int -> SearchTree a -> ShowS # show :: SearchTree a -> String # showList :: [SearchTree a] -> ShowS #

data Search a Source #

Another search monad based on continuations that produce search trees.

Instances

Monad Search Source #
Methods (>>=) :: Search a -> (a -> Search b) -> Search b # (>>) :: Search a -> Search b -> Search b # return :: a -> Search a # fail :: String -> Search a #
Functor Search Source #
Methods fmap :: (a -> b) -> Search a -> Search b # (<$) :: a -> Search b -> Search a #
Applicative Search Source #
Methods pure :: a -> Search a # (<>) :: Search (a -> b) -> Search a -> Search b # (>) :: Search a -> Search b -> Search b # (<*) :: Search a -> Search b -> Search a #
Alternative Search Source #
Methods empty :: Search a # (<\|>) :: Search a -> Search a -> Search a # some :: Search a -> Search [a] # many :: Search a -> Search [a] #
MonadPlus Search Source #
Methods mzero :: Search a # mplus :: Search a -> Search a -> Search a #

searchTree :: Search a -> SearchTree a Source #

Computes the SearchTree representation of a Search action.