| CARVIEW |
Select Language
HTTP/1.1 200 OK
Connection: keep-alive
Server: nginx/1.24.0 (Ubuntu)
Content-Type: text/html; charset=utf-8
Cache-Control: public, max-age=300
Content-Encoding: gzip
Via: 1.1 varnish, 1.1 varnish
Accept-Ranges: bytes
Age: 0
Date: Sun, 18 Jan 2026 20:27:49 GMT
X-Served-By: cache-dfw-kdfw8210042-DFW, cache-bom-vanm7210046-BOM
X-Cache: MISS, MISS
X-Cache-Hits: 0, 0
X-Timer: S1768768069.899197,VS0,VE285
Vary: Accept, Accept-Encoding
transfer-encoding: chunked
tree-monad: Non-Determinism Monad for Tree Search
[Skip to Readme]
tree-monad: 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.
[Skip to Readme]
Downloads
- tree-monad-0.3.2.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
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.3) [details] |
| License | BSD-3-Clause |
| Author | Sebastian Fischer |
| Maintainer | nbu@informatik.uni-kiel.de |
| Uploaded | by nbu at 2022-07-14T11:34:53Z |
| Category | Control, Monads |
| Home page | https://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 |
| Distributions | Debian:0.3.1 |
| Reverse Dependencies | 3 direct, 1 indirect [details] |
| Downloads | 5002 total (16 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.