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]
|Versions [RSS] [faq]||0.1, 0.2, 0.2.1, 0.3, 0.3.1|
|Dependencies||base (>=4.13 && <4.16) [details]|
|Revised||Revision 1 made by nbu at 2021-06-07T09:36:40Z|
|Source repo||head: git clone git://github.com/nbun/tree-monad.git|
|Uploaded||by nbu at 2020-10-26T12:17:27Z|
|Downloads||4006 total (33 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
Docs not available [build log]
All reported builds failed as of 2020-10-26 [all 2 reports]
- 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'.
For package maintainers and hackage trustees