me
/
guix
Archived
1
0
Fork 0

gnu: Add ghc-dual-tree.

* gnu/packages/haskell-xyz.scm (ghc-dual-tree): New variable.
master
Timothy Sample 2019-11-13 00:42:50 -05:00
parent 471e77cffa
commit 577a78b779
No known key found for this signature in database
GPG Key ID: 2AC6A5EC1C357C59
1 changed files with 29 additions and 0 deletions

View File

@ -3017,6 +3017,35 @@ It is modeled after doctest for Python, see
between double precision floating point and text.") between double precision floating point and text.")
(license license:bsd-3))) (license license:bsd-3)))
(define-public ghc-dual-tree
(package
(name "ghc-dual-tree")
(version "0.2.2.1")
(source
(origin
(method url-fetch)
(uri (string-append "https://hackage.haskell.org/package/"
"dual-tree/dual-tree-" version ".tar.gz"))
(sha256
(base32
"17kdfnf0df0z5pkiifxrlmyd1xd7hjjaazd2kzyajl0gd00vbszx"))))
(build-system haskell-build-system)
(inputs
`(("ghc-semigroups" ,ghc-semigroups)
("ghc-newtype-generics" ,ghc-newtype-generics)
("ghc-monoid-extras" ,ghc-monoid-extras)))
(native-inputs
`(("ghc-quickcheck" ,ghc-quickcheck)
("ghc-testing-feat" ,ghc-testing-feat)))
(home-page "https://hackage.haskell.org/package/dual-tree")
(synopsis "Rose trees with cached and accumulating monoidal annotations")
(description "Rose (@math{n}-ary) trees with both upwards- (i.e.
cached) and downwards-traveling (i.e. accumulating) monoidal
annotations. This is used as the core data structure underlying the
@url{https://archives.haskell.org/projects.haskell.org/diagrams/,
diagrams framework}, but potentially has other applications as well.")
(license license:bsd-3)))
(define-public ghc-easy-file (define-public ghc-easy-file
(package (package
(name "ghc-easy-file") (name "ghc-easy-file")