compdata-dags: Compositional Data Types on DAGs
This library implements recursion schemes on directed acyclic graphs. The recursion schemes are explained in detail in the paper Generalising Tree Traversals to DAGs (http://www.diku.dk/~paba/pubs/entries/bahr15pepm.html).
|Versions [faq]||0.1, 0.2, 0.2.1|
|Dependencies||base (>=4.7 && <5), compdata (==0.9.*), containers, mtl, projection, unordered-containers, vector [details]|
|Author||Patrick Bahr, Emil Axelsson|
|Revised||Revision 1 made by PatrickBahr at Fri Sep 12 07:46:14 UTC 2014|
|Source repo||head: git clone https://github.com/pa-ba/compdata-dags|
|Uploaded||by PatrickBahr at Fri Aug 22 09:04:28 UTC 2014|
|Downloads||1189 total (73 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
Docs uploaded by user
Build status unknown [no reports yet]
- compdata-dags-0.1.tar.gz [browse] (Cabal source package)
- Package description (revised from the package)
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.
For package maintainers and hackage trustees