haskell-dual-tree 0.2.2-3 source package in Ubuntu

Changelog

haskell-dual-tree (0.2.2-3) unstable; urgency=medium

  * Patch for newer deps

 -- Gianfranco Costamagna <email address hidden>  Fri, 30 Aug 2019 18:37:22 +0200

Upload details

Uploaded by:
Debian Haskell Group on 2019-08-30
Uploaded to:
Sid
Original maintainer:
Debian Haskell Group
Architectures:
any all
Section:
misc
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Focal release on 2019-10-18 universe misc
Eoan release on 2019-09-09 universe misc

Downloads

File Size SHA-256 Checksum
haskell-dual-tree_0.2.2-3.dsc 2.6 KiB 3b6e259dbb0de91e1c98b5d0c33dbc104d84c6479415467b90e7d8703b354da8
haskell-dual-tree_0.2.2.orig.tar.gz 8.0 KiB 7412d70cf239da98b5a21df1cbbeab7319fd23d757427d4f5ce71b907dbaa9eb
haskell-dual-tree_0.2.2-3.debian.tar.xz 3.3 KiB df5282176671bc604a4e4e84f4d77935ef38e4a504fac0c907adf8aa8c975025

No changes file available.

Binary packages built by this source

libghc-dual-tree-dev: Rose trees with cached and accumulating monoidal annotations

 Rose (n-ary) trees with both upwards- (i.e. cached) and downwards-traveling
 (i.e. accumulating) monoidal annotations.
 .
 Abstractly, a DUALTree is a rose (n-ary) tree with data at leaves, data at
 internal nodes, and two types of monoidal annotations, one travelling "up" the
 tree and one traveling "down".
 .
 This package provides a library for the Haskell programming language.
 See http://www.haskell.org/ for more information on Haskell.

libghc-dual-tree-doc: Rose trees with cached and accumulating monoidal annotations; documentation

 Rose (n-ary) trees with both upwards- (i.e. cached) and downwards-traveling
 (i.e. accumulating) monoidal annotations.
 .
 Abstractly, a DUALTree is a rose (n-ary) tree with data at leaves, data at
 internal nodes, and two types of monoidal annotations, one travelling "up" the
 tree and one traveling "down".
 .
 This package provides the documentation for a library for the Haskell
 programming language.
 See http://www.haskell.org/ for more information on Haskell.

libghc-dual-tree-prof: Rose trees with cached and accumulating monoidal annotations; profiling libraries

 Rose (n-ary) trees with both upwards- (i.e. cached) and downwards-traveling
 (i.e. accumulating) monoidal annotations.
 .
 Abstractly, a DUALTree is a rose (n-ary) tree with data at leaves, data at
 internal nodes, and two types of monoidal annotations, one travelling "up" the
 tree and one traveling "down".
 .
 This package provides a library for the Haskell programming language, compiled
 for profiling. See http://www.haskell.org/ for more information on Haskell.