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]

Versions	0.1, 0.2, 0.2.1, 0.3
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 Sat Oct 9 07:57:58 UTC 2010
Distributions	NixOS:0.3
Downloads	2220 total (11 in the last 30 days)
Rating	(no votes yet) [estimated by rule of succession]
Your Rating	λ λ λ
Status	Docs uploaded by user Build status unknown [no reports yet] Hackage Matrix CI

Modules

[Index]

Control
- Monad
  - Control.Monad.SearchTree

Downloads

tree-monad-0.3.tar.gz [browse] (Cabal source package)
Package description (as included in the package)

Maintainer's Corner

For package maintainers and hackage trustees

edit package information

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.