monad-tree: Tree data structure for nondeterministic computations.
This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.
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]
Properties
Versions | 0.1.0, 0.1.0, 0.2.0.0 |
---|---|
Change log | CHANGELOG.md |
Dependencies | base (>=4.9 && <=4.16) [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-08-20T20:35:20Z |
Modules
[Index] [Quick Jump]
- Control
- Monad
Downloads
- monad-tree-0.1.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees