haskell-dual-tree 0.2.2.1-1build1 source package in Ubuntu

Changelog

haskell-dual-tree (0.2.2.1-1build1) groovy; urgency=medium

  * Rebuild against new GHC abi.

 -- Gianfranco Costamagna <email address hidden>  Thu, 23 Jul 2020 16:18:27 +0200

Upload details

Uploaded by:
Gianfranco Costamagna
Uploaded to:
Groovy
Original maintainer:
Debian Haskell Group
Architectures:
any all
Section:
misc
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Groovy release universe misc

Downloads

File Size SHA-256 Checksum
haskell-dual-tree_0.2.2.1.orig.tar.gz 8.0 KiB fdebb501680f50a9fc9fa27da5a484a7f5d07ca5b9bb18e72d1fb8069c756d9e
haskell-dual-tree_0.2.2.1-1build1.debian.tar.xz 3.1 KiB 380de34b13fdf6d1dc7f5a087d2122f25d5efaa279f17fa401aaa11e9de32538
haskell-dual-tree_0.2.2.1-1build1.dsc 2.7 KiB c1684a371a7307ff07b9c2caf0dcacbf1d51b4d197a1680888f70b1320e15010

View changes file

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.