The data-reify package
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 data-reify uses StableNames, and is 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.
© 2009 Andy Gill; BSD3 license.
|Versions||0.1, 0.2, 0.3, 0.4, 0.5, 0.6, 0.6.1|
|Change log||None available|
|Dependencies||base, containers [details]|
|Copyright||(c) 2009 Andy Gill|
|Maintainer||Andy Gill <firstname.lastname@example.org>|
|Category||Language, Data, Parsing, Reflection|
|Executables||data-reify-test6, data-reify-test5, data-reify-test4, data-reify-test3, data-reify-test2, data-reify-test1|
|Uploaded||Sat May 9 19:44:25 UTC 2009 by AndyGill|
|Distributions||Fedora:0.6, LTSHaskell:0.6.1, NixOS:0.6.1, Stackage:0.6.1|
|Downloads||3365 total (218 in last 30 days)|
|Status||Docs uploaded by user|
Build status unknown [no reports yet]
For package maintainers and hackage trustees