monad-tree: Tree data structure for nondeterministic computations.
This package provides monad instances for a rose tree-like data structure that can be used for nondeterministic computations. This is similar to the list monad but allows for computations to remain agnostic about the specific search procedure used.
[Skip to Readme]
Downloads
- monad-tree-0.2.0.0.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, 0.2.0.0 |
|---|---|
| Change log | CHANGELOG.md |
| Dependencies | base (>=4.9 && <=4.16), mtl, transformers [details] |
| License | MIT |
| Author | Nathan Bedell |
| Maintainer | nbedell@tulane.edu |
| Category | Control |
| Source repo | head: git clone https://github.com/Sintrastes/monad-tree |
| Uploaded | by nbedell at 2021-11-09T14:05:04Z |
| Distributions | |
| Downloads | 411 total (4 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2021-11-09 [all 1 reports] |
Readme for monad-tree-0.2.0.0
[back to package description]monad-tree
This package provides monad instances for a rose-tree-like data structure Tree, allowing for the definition of non-deterministic computations that do not depend on a specific search procedure.
When not used as a monad for nondeterministic computation, Tree can also be used as a general purpose rose tree data structure.
For more information, see the documentation for the main Control.Monad.Tree module.