Ubuntu
haskell-dual-tree package

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

Changelog

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

  * New upstream release

 -- Ilias Tsitsimpis <email address hidden>  Fri, 21 Oct 2022 21:28:37 +0300

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.3.1-1.dsc 2.6 KiB 9bda0bea2b29e43c979b2bb8c07cc1402410b2a28534edb5ae23007cd124e746
haskell-dual-tree_0.2.3.1.orig.tar.gz 8.0 KiB d0394b94c312a5ae032ee72d811400e3f435138ea05f7be6a4d019131a19d5a6
haskell-dual-tree_0.2.3.1-1.debian.tar.xz 3.0 KiB fcc3b68589139f818aa49d43026f11d5f44d007de99f40145110f85dceef521b

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.