data-reify: Reify a recursive data structure into an explicit graph.
|Versions||0.1, 0.2, 0.3, 0.4, 0.5, 0.6, 0.6.1|
|Dependencies||base (>=3 && <4.2), containers [details]|
|Copyright||(c) 2009 Andy Gill|
|Maintainer||Andy Gill <firstname.lastname@example.org>|
|Category||Language, Data, Parsing, Reflection|
|Uploaded||by AndyGill at Tue Jun 9 03:42:18 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-test6, data-reify-test5, data-reify-test4, data-reify-test3, data-reify-test2, data-reify-test1|
|Downloads||6578 total (54 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
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.
Version 0.2 of
StableNames, and was much faster.
Version 0.3 provided two versions of
MuRef, the mono-typed version,
for trees of a single type,
and the dynamic-typed version, for trees of different types.
Version 0.4 uses
Int as a synonym for
Unique rather than
for node ids, by popular demand.
© 2009 Andy Gill; BSD3 license.
For package maintainers and hackage trustees