Paket: libghc-dual-tree-doc (0.2.2.1-1)

[ Källkod: haskell-dual-tree  ]

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-35

  virtuellt paket som tillhandahålls av ghc

• 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

Hämtningar för alla tillgängliga arkitekturer

Arkitektur	Paketstorlek	Installerad storlek	Filer
all	57,7 kbyte	448,0 kbyte	[filförteckning]