tree-monad: Non-Determinism Monad for Tree Search

[ bsd3, control, library, monads ] [ Propose Tags ]

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]

Modules

[Index]

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

Versions [RSS] 0.1, 0.2, 0.2.1, 0.3, 0.3.1, 0.3.2
Dependencies base (>=3 && <5) [details]
License BSD-3-Clause
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 repo head: git clone git://github.com/sebfisch/tree-monad.git
Uploaded by SebastianFischer at 2010-10-09T07:57:58Z
Distributions Debian:0.3.1, NixOS:0.3.2
Reverse Dependencies 3 direct, 1 indirect [details]
Downloads 4393 total (31 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]

Readme for tree-monad-0.3

[back to package description]
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.