homepage: ''
changelog-type: ''
hash: 24d6bce121e5f92d56e4a781c0d7db32993f88cce0b697f8046d804763525fad
test-bench-deps:
  base: -any
  lazy-priority-queue: -any
  doctest: ! '>=0.8'
  lens: -any
maintainer: mblazevic@stilo.com
synopsis: Lazy-Spined Monadic Priority Queues
changelog: ''
basic-deps:
  base: <5
  lazy-priority-queue: -any
  containers: ! '>=0.2 && <0.7'
all-versions:
- '0.1'
author: Mario Blažević
latest: '0.1'
description-type: haddock
description: |-
  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.
license-name: GPL-3.0-only

Update from Hackage at 2019-09-13T01:13:25Z
Update from Hackage at 2019-09-13T01:13:25Z
