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

Versions0.1, 0.2, 0.2.1, 0.3
Change logNone available
Dependenciesbase (>=3 && <5) [details]
LicenseBSD3
AuthorSebastian Fischer
Maintainersebf@informatik.uni-kiel.de
Stabilityexperimental
CategoryControl, Monads
Home pagehttp://sebfisch.github.com/tree-monad
Bug trackermailto:sebf@informatik.uni-kiel.de
Source repositoryhead: git clone git://github.com/sebfisch/tree-monad.git
UploadedSat Oct 9 07:57:58 UTC 2010 by SebastianFischer
DistributionsNixOS:0.3
Downloads1212 total (37 in last 30 days)
Votes
0 []
StatusDocs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees

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.