@hackage / tree-monad

Non-Determinism Monad for Tree Search

Latest0.3.2

About

Metadata

  • Last updated , by nbu
  • License BSD-3-Clause
  • Categories Monads

  • Maintained by: nbu@informatik.uni-kiel.de

  • Lottery factor: 0

Links

Installation

Readme

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.