Ubuntu
haskell-dual-tree package

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

Changelog

haskell-dual-tree (0.2.1-1build1) bionic; urgency=medium

  * No-change rebuild for new GHC ABIs

 -- Steve Langasek <email address hidden>  Mon, 06 Nov 2017 20:35:28 +0000

Upload details

Uploaded by:
Steve Langasek
Uploaded to:
Bionic
Original maintainer:
Ubuntu Developers
Architectures:
any all
Section:
misc
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
haskell-dual-tree_0.2.1.orig.tar.gz 7.9 KiB 2465247dab91c799a06feccc3598c4c25a15bb17e80da102e22a45caa9605f19
haskell-dual-tree_0.2.1-1build1.debian.tar.xz 2.8 KiB 63f40b6a7eef847c96647d45a9e7bbf344c816f7f249b28d319d0efe80120582
haskell-dual-tree_0.2.1-1build1.dsc 2.7 KiB d43cc147fdfdb76af2cfe82c468b6db72c0553027ab9fc2c0fd138f70eb9813c

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.