tree-monad: Non-Determinism Monad for Tree Search

The tree-monad package

[Tags:bsd3, library]

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.

[Skip to Readme]

Properties

Versions 0.1, 0.2, 0.2.1, 0.3
Dependencies base (>=3 && <5) [details]
License BSD3
Author Sebastian Fischer
Maintainer sebf@informatik.uni-kiel.de
Category Control, Monads
Home page http://sebfisch.github.com/tree-monad
Bug tracker mailto:sebf@informatik.uni-kiel.de
Source repository head: git clone git://github.com/sebfisch/tree-monad.git
Uploaded Sat Oct 9 07:57:58 UTC 2010 by SebastianFischer
Distributions NixOS:0.3
Downloads 1635 total (33 in the last 30 days)
Votes
0 []
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees

Readme for tree-monad

Readme for tree-monad-0.3

Non-Determinism Monad for Tree Search
=====================================

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.