Paket: libghc-data-reify-doc (0.6.3-6)

Länkar för libghc-data-reify-doc

Debianresurser:

Hämta källkodspaketet haskell-data-reify:

Ansvariga:

Externa resurser:

Hemsida [ku-fpg.github.io]

Liknande paket:

Reify a recursive data structure into an explicit graph.; documentation

'data-reify' provided the ability to turn recursive structures into explicit graphs. Many (implicitly or explicitly) recursive data structure can be given this ability, via a type class instance. This gives an alternative to using 'Ref' for observable sharing.

Observable sharing in general is unsafe, so we use the IO monad to bound this effect, but can be used safely even with 'unsafePerformIO' if some simple conditions are met. Typically this package will be used to tie the knot with DSL's that depend of observable sharing, like Lava.

Providing an instance for 'MuRef' is the mechanism for allowing a structure to be reified into a graph, and several examples of this are provided.

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-data-reify-doc

beror

rekommenderar

föreslår

enhances

dep: haddock-interface-42

virtuellt paket som tillhandahålls av ghc

rec: ghc-doc

Documentation for the Glasgow Haskell Compilation system
rec: libghc-data-reify-dev

Reify a recursive data structure into an explicit graph.
rec: libghc-hashable-doc

class for types that can be converted to a hash value; documentation
rec: libghc-unordered-containers-doc

Efficient hashing-based container types; documentation
rec: libjs-mathjax

JavaScript display engine for LaTeX and MathML

sug: libghc-data-reify-prof

Reify a recursive data structure into an explicit graph.; profiling libraries

Hämta libghc-data-reify-doc

Hämtningar för alla tillgängliga arkitekturer
Arkitektur	Paketstorlek	Installerad storlek	Filer
all	44,5 kbyte	206,0 kbyte	[filförteckning]