The data-reify package

[Tags: bsd3, library]

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 used 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 Data.Unique for node ids, by popular demand.

© 2009 Andy Gill; BSD3 license.


Properties

Versions0.1, 0.2, 0.3, 0.4, 0.5, 0.6
Dependenciesbase (>=3 && <4.2), containers
LicenseBSD3
Copyright(c) 2009 Andy Gill
AuthorAndy Gill
MaintainerAndy Gill <andygill@ku.edu>
Stabilityalpha
CategoryLanguage, Data, Parsing, Reflection
Home pagehttp://ittc.ku.edu/~andygill/data-reify.php
Executablesdata-reify-test6, data-reify-test5, data-reify-test4, data-reify-test3, data-reify-test2, data-reify-test1
Upload dateTue Jun 9 03:42:18 UTC 2009
Uploaded byAndyGill
DistributionsFedora:0.6, NixOS:0.6
Downloads1433 total (124 in last 30 days)

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees