Hackage :: [Package]

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

[Last Documentation]

  • Control
    • Monad
      • Control.Monad.SearchTree

Downloads

Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

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
Change log CHANGELOG.md
Dependencies base (>=4.13 && <4.16) [details]
License BSD-3-Clause
Author Sebastian Fischer
Maintainer nbu@informatik.uni-kiel.de
Revised Revision 1 made by nbu at 2021-06-07T09:36:40Z
Category Control, Monads
Home page http://sebfisch.github.com/tree-monad
Bug tracker https://github.com/nbun/tree-monad/issues
Source repo head: git clone git://github.com/nbun/tree-monad.git
Uploaded by nbu at 2020-10-26T12:17:27Z
Distributions Debian:0.3.1
Reverse Dependencies 3 direct, 1 indirect [details]
Downloads 4650 total (24 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs not available [build log]
All reported builds failed as of 2020-10-26 [all 2 reports]

Readme for tree-monad-0.3.1

[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.