monus-weighted-search: Efficient search weighted by an ordered monoid with monus.
This package contains the Haskell constructions from the paper "Algebras for Weighted Search":
Donnacha Oisín Kidney and Nicolas Wu. 2021. Algebras for weighted search. Proc. ACM Program. Lang. 5, ICFP, Article 72 (August 2021), 30 pages. DOI:https://doi.org/10.1145/3473577
In particular, it contains the
HeapT monad, the
Monus class, and the
example uses of those types from the paper (see
MonusWeightedSearch.Examples.Dijkstra, in particular).
The types given here have been tested and are implemented in a way that is intended to be usable in "real" code, although the primary purpose of this package is to demonstrate that the code in the paper does in fact function.
[Skip to Readme]
|Dependencies||array (>=0.5), base (>=4.13 && <5), containers (>=0.1.0.0), deepseq (>=1.1), mtl (>=2.2), QuickCheck (>=2.10), random (>=1.0), transformers (>=0.4.2) [details]|
|Author||Donnacha Oisín Kidney|
|Source repo||head: git clone git://github.com/oisdk/monus-weighted-search.git|
|Uploaded||by oisdk at 2021-08-29T17:21:40Z|
|Downloads||88 total (8 in the last 30 days)|
|Rating||2.0 (votes: 1) [estimated by Bayesian average]|
|Status||Docs uploaded by user
Build status unknown [no reports yet]