Control.Monad.SearchTree

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.

Documentation

data SearchTree a

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

Constructors

None

One a

Choice (SearchTree a) (SearchTree a)

Instances

Monad SearchTree

MonadPlus SearchTree

Show a => Show (SearchTree a)

data Search a

Another search monad based on continuations that produce search trees.

Instances

Monad Search

MonadPlus Search

searchTree :: Search a -> SearchTree a

Computes the SearchTree representation of a Search action.