data-reify: Reify a recursive data structure into an explicit graph.
'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]
Flags
Automatic Flags
| Name | Description | Default |
|---|---|---|
| tests | Enable full development tree | Disabled |
Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info
Downloads
- data-reify-0.6.4.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 0.1, 0.2, 0.3, 0.4, 0.5, 0.6, 0.6.1, 0.6.2, 0.6.3, 0.6.4 (info) |
|---|---|
| Change log | CHANGELOG.md |
| Dependencies | base (>=4.9 && <5), containers (>=0.5.7.1), data-reify, hashable, unordered-containers [details] |
| Tested with | ghc ==8.0.2, ghc ==8.2.2, ghc ==8.4.4, ghc ==8.6.5, ghc ==8.8.4, ghc ==8.10.7, ghc ==9.0.2, ghc ==9.2.8, ghc ==9.4.8, ghc ==9.6.6, ghc ==9.8.2, ghc ==9.10.1 |
| 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 2024-10-27T13:58:38Z |
| Distributions | Fedora:0.6.3, LTSHaskell:0.6.4, NixOS:0.6.3, Stackage:0.6.4 |
| Reverse Dependencies | 13 direct, 72 indirect [details] |
| Executables | data-reify-test7, data-reify-test6, data-reify-test5, data-reify-test4, data-reify-test3, data-reify-test2, data-reify-test1, simplify, example1 |
| Downloads | 15865 total (200 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs pending Build status unknown [no reports yet] |
Readme for data-reify-0.6.4
[back to package description]data-reify 
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.