The data-reify package

[ Tags: 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 (hence the module path name Data.Unsafe.Reify), but can be used safely 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 four examples of this are provided.

© 2009 Andy Gill; BSD3 license.

Properties

Versions 0.1, 0.2, 0.3, 0.4, 0.5, 0.6, 0.6.1
Dependencies base (<4.7), ghc-prim [details]
License BSD3
Copyright (c) 2009 Andy Gill
Author Andy Gill
Maintainer Andy Gill <andygill@ku.edu>
Category Language, Data, Parsing, Reflection
Home page http://ittc.ku.edu/~andygill/data-reify.php
Uploaded Sat Apr 18 02:25:57 UTC 2009 by AndyGill
Updated Tue May 31 07:51:43 UTC 2016 by HerbertValerioRiedel to revision 1
Distributions Fedora:0.6.1, LTSHaskell:0.6.1, NixOS:0.6.1, Stackage:0.6.1, Tumbleweed:0.6.1
Executables data-reify-test4, data-reify-test3, data-reify-test2, data-reify-test1
Downloads 4874 total (32 in the last 30 days)
Rating 0.0 (0 ratings) [clear rating]
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees