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 [RSS] [faq]	0.1, 0.2, 0.2.1, 0.3, 0.3.1
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, NixOS:0.3.1
Downloads	4004 total (36 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]

Modules

Control
- Monad
  - Control.Monad.SearchTree

Downloads

tree-monad-0.3.1.tar.gz [browse] (Cabal source package)
Package description (revised from the package)

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

For package maintainers and hackage trustees

edit package information

Candidates

0.3.1

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.