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.

History: Version 0.1 used unsafe pointer compares. 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 used Int as a synonym for Unique rather than Data.Unique for node ids, by popular demand. Version 0.5 merged the mono-typed and dynamic version again, by using DynStableName, an unphantomized version of StableName.

© 2009 Andy Gill; BSD3 license.


[Skip to Readme]

Properties

Versions 0.1, 0.2, 0.3, 0.4, 0.5, 0.6, 0.6.1
Change log CHANGELOG.md
Dependencies base (==4.*), containers, data-reify [details]
License BSD3
Copyright (c) 2009 Andy Gill
Author Andy Gill
Maintainer Andy Gill <andygill@ku.edu>
Stability alpha
Category Language, Data, Parsing, Reflection
Home page http://ku-fpg.github.io/software/data-reify/
Source repository head: git clone https://github.com/ku-fpg/data-reify
Uploaded Tue May 19 16:59:23 UTC 2015 by ryanglscott
Updated Mon Aug 24 17:12:01 UTC 2015 by ryanglscott to revision 1
Distributions Fedora:0.6, LTSHaskell:0.6.1, NixOS:0.6.1
Downloads 4091 total (20 in the last 30 days)
Votes
0 []
Status Docs available [build log]
Last success reported on 2015-05-23 [all 1 reports]

Modules

[Index]

Flags

NameDescriptionDefaultType
testsEnable full development treeDisabledAutomatic

Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info

Downloads

Maintainer's Corner

For package maintainers and hackage trustees

Readme for data-reify

Readme for data-reify-0.6.1

data-reify Hackage version Build Status

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 DSLs 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.

History: Version 0.1 used unsafe pointer compares. 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 used Int as a synonym for Unique rather than Data.Unique for node ids, by popular demand. Version 0.5 merged the mono-typed and dynamic version again, by using DynStableName, an unphantomized version of StableName.