Name: compdata-dags Version: 0.1 x-revision: 1 Synopsis: Compositional Data Types on DAGs Description: This library implements recursion schemes on directed acyclic graphs. The recursion schemes are explained in detail in the paper /Generalising Tree Traversals to DAGs/ (). Category: Generics License: BSD3 License-file: LICENSE Author: Patrick Bahr, Emil Axelsson Maintainer: paba@di.ku.dk Build-Type: Simple Cabal-Version: >=1.9.2 bug-reports: https://github.com/pa-ba/compdata-dags/issues extra-source-files: -- test files tests/Test/*.hs -- example files examples/Examples/*.hs library Exposed-Modules: Data.Comp.AG Data.Comp.Dag Data.Comp.Dag.AG Other-Modules: Data.Comp.Dag.Internal Data.Comp.AG.Internal Build-Depends: base >= 4.7, base < 5, compdata == 0.9.*, projection, unordered-containers, mtl, containers, vector hs-source-dirs: src ghc-options: -W Test-Suite test Type: exitcode-stdio-1.0 Main-is: RunTests.hs hs-source-dirs: tests examples src Build-Depends: base >= 4.7, base < 5, compdata == 0.9.*, projection, unordered-containers, mtl, containers, vector, test-framework-hunit, HUnit, test-framework, QuickCheck, test-framework-quickcheck2 source-repository head type: git location: https://github.com/pa-ba/compdata-dags