Paket: libghc-dual-tree-prof (0.2.3.1-3)

[ Kaynak: haskell-dual-tree  ]

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.

libghc-dual-tree-prof ile İlgili Diğer Paketler

• dep: libghc-base-prof-4.18.2.1-8e81e

  sanal paketi sağlayan 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-80c23

  sanal paketi sağlayan libghc-monoid-extras-prof

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

  sanal paketi sağlayan libghc-semigroups-prof

libghc-dual-tree-prof indir

Tüm mevcut mimariler için indir

Mimari	Paket Boyutu	Kurulu Boyut	Dosyalar
amd64	46,3 kB	365,0 kB	[dosya listesi]