data-reify: Reify a recursive data structure into an explicit graph.
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 (hence the module path name Data.Unsafe.Reify), but can be used safely 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 four examples of this are provided.
© 2009 Andy Gill; BSD3 license.
|Versions||0.1, 0.2, 0.3, 0.4, 0.5, 0.6, 0.6.1|
|Dependencies||base (<4.7), ghc-prim [details]|
|Copyright||(c) 2009 Andy Gill|
|Maintainer||Andy Gill <email@example.com>|
|Revised||Revision 1 made by HerbertValerioRiedel at Tue May 31 07:51:43 UTC 2016|
|Category||Language, Data, Parsing, Reflection|
|Uploaded||by AndyGill at Sat Apr 18 02:25:57 UTC 2009|
|Distributions||Fedora:0.6.1, LTSHaskell:0.6.1, NixOS:0.6.1, Stackage:0.6.1, openSUSE:0.6.1|
|Executables||data-reify-test4, data-reify-test3, data-reify-test2, data-reify-test1|
|Downloads||6713 total (61 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
|Status||Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.
For package maintainers and hackage trustees