[ Källkod: haskell-dual-tree ]
Paket: libghc-dual-tree-doc (0.2.1-1build2)
Länkar för libghc-dual-tree-doc
Trisquelresurser:
Hämta källkodspaketet haskell-dual-tree:
- [haskell-dual-tree_0.2.1-1build2.dsc]
- [haskell-dual-tree_0.2.1.orig.tar.gz]
- [haskell-dual-tree_0.2.1-1build2.debian.tar.xz]
Ansvarig:
Original Maintainers:
- Debian Haskell Group (E-postarkiv)
- Joachim Breitner
Externa resurser:
- Hemsida [hackage.haskell.org]
Liknande paket:
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.
Andra paket besläktade med libghc-dual-tree-doc
|
|
|
-
- dep: haddock-interface-28
- virtuellt paket som tillhandahålls av ghc
-
- rec: ghc-doc
- Documentation for the Glasgow Haskell Compilation system
-
- rec: libghc-monoid-extras-doc
- Various extra monoid-related definitions and utilities; documentation
-
- rec: libghc-newtype-generics-doc
- Typeclass and set of functions for working with newtypes; documentation
-
- rec: libjs-mathjax
- JavaScript display engine for LaTeX and MathML
Hämta libghc-dual-tree-doc
| Arkitektur | Paketstorlek | Installerad storlek | Filer |
|---|---|---|---|
| all | 30,5 kbyte | 277 kbyte | [filförteckning] |