Package: libghc-dual-tree-prof (0.2.3.0-1) [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.13.0.0-f73fa

  virtual package provided by ghc-prof

• dep: libghc-dual-tree-dev (= 0.2.3.0-1)

  Rose trees with cached and accumulating monoidal annotations

• dep: libghc-monoid-extras-prof-0.6.1-8a688

  virtual package provided by libghc-monoid-extras-prof

• dep: libghc-newtype-generics-prof-0.6.2-99fd4

  virtual package provided by libghc-newtype-generics-prof

• dep: libghc-semigroups-prof-0.19.2-5e9ea

  Package not available

• dep: sgml-base (>= 1.28)

  SGML infrastructure and SGML catalog file support

Download libghc-dual-tree-prof

Download for all available architectures

Architecture	Package Size	Installed Size	Files
x32 (unofficial port)	66.1 kB	506.0 kB	[list of files]