Pakiet: libghc-data-reify-doc (0.6.3-5)

[ Pakiet źródłowy: haskell-data-reify  ]

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.

© 2009 Andy Gill; BSD3 license.

This package provides the documentation for a library for the Haskell programming language. See http://www.haskell.org/ for more information on Haskell.

Inne pakiety związane z libghc-data-reify-doc

• dep: haddock-interface-41

  pakiet wirtualny udostępniany przez 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

Pobieranie libghc-data-reify-doc

Pobierz dla wszystkich dostępnych architektur

Architektura	Rozmiar pakietu	Rozmiar po instalacji	Pliki
all	44,3 KiB	204,0 KiB	[lista plików]