Package: libghc-dual-tree-prof (0.2.3.1-3) [debports]

[ Source:  ]

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.

Other Packages Related to libghc-dual-tree-prof

• dep: libghc-base-prof-4.18.2.1-c6b57

  virtual package provided by ghc-prof

• dep: libghc-dual-tree-dev (= 0.2.3.1-3)

  Rose trees with cached and accumulating monoidal annotations

• dep: libghc-monoid-extras-prof-0.6.3-8a56b

  virtual package provided by libghc-monoid-extras-prof

• dep: libghc-semigroups-prof-0.20-307a4

  virtual package provided by libghc-semigroups-prof

Download libghc-dual-tree-prof

Download for all available architectures

Architecture	Package Size	Installed Size	Files
sparc64 (unofficial port)	68.8 kB	865.0 kB	[list of files]