libghc-dual-tree-prof 0.2.2-ok1 (amd64 binary) in openkylin yangtze

 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.

Details

Package version:
0.2.2-ok1
Source:
haskell-dual-tree 0.2.2-ok1 source package in openKylin
Status:
Deleted
Component:
main
Priority:
Optional

Package relationships

Depends on:
  • libghc-base-prof-4.12.0.0-a86a1
  • libghc-dual-tree-dev (= 0.2.2-ok1)
  • libghc-monoid-extras-prof-0.5-97760
  • libghc-newtype-generics-prof-0.5.3-6b21b
  • libghc-semigroups-prof-0.18.5-24910
Provides:
  • libghc-dual-tree-prof-0.2.2-aef62