Package: libghc-data-reify-prof (0.6.3-2 and others)

[ Source: haskell-data-reify  ]

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

'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 a library for the Haskell programming language, compiled for profiling. See http://www.haskell.org/ for more information on Haskell.

Other Packages Related to libghc-data-reify-prof

• dep: libghc-base-prof-4.15.1.0-6a406

  virtual package provided by ghc-prof

• dep: libghc-containers-prof-0.6.4.1-31c3b

  virtual package provided by ghc-prof

• dep: libghc-data-reify-dev (= 0.6.3-2+b2)

  Reify a recursive data structure into an explicit graph.

• dep: libghc-hashable-prof-1.3.5.0-3fad8

  virtual package provided by libghc-hashable-prof

• dep: libghc-unordered-containers-prof-0.2.17.0-1d16d

  virtual package provided by libghc-unordered-containers-prof

Download libghc-data-reify-prof

Download for all available architectures

Architecture	Version	Package Size	Installed Size	Files
amd64	0.6.3-2+b2	26.3 kB	127.0 kB	[list of files]