[ Source: haskell-dual-tree ]
Paketti: libghc-dual-tree-doc (0.2.3.1-1)
Links for libghc-dual-tree-doc
Debian-palvelut:
Imuroi lähdekoodipaketti haskell-dual-tree:
- [haskell-dual-tree_0.2.3.1-1.dsc]
- [haskell-dual-tree_0.2.3.1.orig.tar.gz]
- [haskell-dual-tree_0.2.3.1-1.debian.tar.xz]
Ylläpitäjät:
- Debian Haskell Group (Laadunvalvontasivu, Mail Archive)
- Ilias Tsitsimpis (Laadunvalvontasivu)
- Clint Adams (Laadunvalvontasivu)
External Resources:
- Kotisivu [hackage.haskell.org]
Samankaltaisia paketteja:
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.
Muut pakettiin libghc-dual-tree-doc liittyvät paketit
|
|
|
|
-
- dep: haddock-interface-38
- näennäispaketti, jonka toteuttaa ghc
-
- rec: ghc-doc
- Documentation for the Glasgow Haskell Compilation system
-
- rec: libghc-dual-tree-dev
- Rose trees with cached and accumulating monoidal annotations
-
- rec: libghc-monoid-extras-doc
- Various extra monoid-related definitions and utilities; documentation
-
- rec: libjs-mathjax
- JavaScript display engine for LaTeX and MathML
-
- sug: libghc-dual-tree-prof
- Rose trees with cached and accumulating monoidal annotations; profiling libraries
Imuroi libghc-dual-tree-doc
| Arkkitehtuuri | Paketin koko | Koko asennettuna | Tiedostot |
|---|---|---|---|
| all | 55.5 kt | 447.0 kt | [tiedostoluettelo] |