tree-monad: Non-Determinism Monad for Tree Search

[ bsd3, control, library, monads ] [ Propose Tags ] [ Report a vulnerability ]

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] [Quick Jump]

Control
- Monad
  - Control.Monad.SearchTree

Downloads

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

Maintainer's Corner

Package maintainers

SebastianFischer, nbu

For package maintainers and hackage trustees

edit package information

Candidates

0.3.1

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.3) [details]
License	BSD-3-Clause
Author	Sebastian Fischer
Maintainer	nbu@informatik.uni-kiel.de
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 2022-07-14T11:34:53Z
Distributions	Debian:0.3.1
Reverse Dependencies	3 direct, 1 indirect [details]
Downloads	4851 total (19 in the last 30 days)
Rating	(no votes yet) [estimated by Bayesian average]
Your Rating	λ λ λ
Status	Docs available [build log] Last success reported on 2022-07-14 [all 1 reports]

Readme for tree-monad-0.3.2

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