Ubuntu
haskell-dual-tree package

haskell-dual-tree 0.2.0.8-1 source package in Ubuntu

Changelog

haskell-dual-tree (0.2.0.8-1) unstable; urgency=medium

  * New upstream release

 -- Clint Adams <email address hidden>  Fri, 04 Dec 2015 00:00:04 -0500

Upload details

Uploaded by:
Debian Haskell Group
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

Downloads

File Size SHA-256 Checksum
haskell-dual-tree_0.2.0.8-1.dsc 2.7 KiB 9882d979ada0728022f8f8798b2052f2849c4e33541f2838db227c69db246165
haskell-dual-tree_0.2.0.8-1.debian.tar.xz 2.6 KiB 6447c5d98df7aac68099e202c8997c824f4194722392e5e8e146d477bf93a8e5
haskell-dual-tree_0.2.0.8.orig.tar.gz 6.9 KiB 53c5829fc5567f6e76adc3666c9db2755d17f606e0c5789bc00e0d6b7b97c273

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.