lazy-priority-queue: Lazy-Spined Monadic Priority Queues

This library provides a priority queue data structure that is meant to be used primarily as a control structure, in the vein of list and Logic. The PriorityQueue data structure in question is an instance of Applicative, Alternative, and Monad classes much like the standard list data type. In addition, it also tracks the cost incurred by each computation it stores, and provides operations for pruning overly expansive branches.

Modules

[Index] [Quick Jump]

Downloads

• lazy-priority-queue-0.1.1.tar.gz [browse] (Cabal source package)
• Package description (as included in the package)

Maintainer's Corner

Package maintainers

• MarioBlazevic

For package maintainers and hackage trustees

• edit package information

Candidates

• 0.1, 0.1.1