Hackage :: [Package]

tree-monad: Non-Determinism Monad for Tree Search

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.

[maintain] [Publish]

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]

Properties

Versions 0.1, 0.2, 0.2.1, 0.3, 0.3.1, 0.3.1, 0.3.2
Change log CHANGELOG.md
Dependencies base (>=4.13 && <4.15) [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 2020-10-23T09:38:42Z

Modules

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Readme for tree-monad-0.3.1

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