data-reify: Reify a recursive data structure into an explicit graph.

[ bsd3, data, language, library, parsing, reflection ] [ Propose Tags ]

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.

© 2009 Andy Gill; BSD3 license.


[Skip to Readme]
Versions [faq] 0.1, 0.2, 0.3, 0.4, 0.5, 0.6, 0.6.1, 0.6.2
Change log CHANGELOG.md
Dependencies base (==4.*), containers, data-reify, hashable, unordered-containers [details]
License BSD-3-Clause
Copyright (c) 2009 Andy Gill
Author Andy Gill
Maintainer Andy Gill <andygill@ku.edu>
Category Language, Data, Parsing, Reflection
Home page http://ku-fpg.github.io/software/data-reify/
Source repo head: git clone https://github.com/ku-fpg/data-reify
Uploaded by ryanglscott at 2020-09-30T23:14:56Z
Distributions Fedora:0.6.1, LTSHaskell:0.6.1, NixOS:0.6.1, Stackage:0.6.1
Executables data-reify-test7, data-reify-test6, data-reify-test5, data-reify-test4, data-reify-test3, data-reify-test2, data-reify-test1
Downloads 11248 total (173 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2020-09-30 [all 1 reports]

Modules

[Index] [Quick Jump]

Flags

NameDescriptionDefaultType
tests

Enable full development tree

DisabledAutomatic

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-0.6.2

[back to package description]

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.