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

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

This package is a (probably temporary) fork of Andy gill's data-reify package. I've tweaked it for typed syntax representations for use with GADTs.

'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' uses StableNames, and is 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.

© 2009-2014 Andy Gill & Conal Elliott; BSD3 license.


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


  • No Candidates
Versions [RSS] 0.3.1, 0.3.2, 0.3.3, 0.3.4
Dependencies base (<5), containers, ty (>=0.1.5) [details]
License BSD-3-Clause
Copyright (c) 2009-2014 Andy Gill and Conal Elliott
Author Andy Gill & Conal Elliott
Maintainer Conal Elliott <>
Category Language, Data, Parsing, Reflection
Home page
Source repo head: git clone git://
Uploaded by ConalElliott at 2014-03-18T19:28:30Z
Distributions NixOS:0.3.4
Reverse Dependencies 3 direct, 0 indirect [details]
Downloads 3453 total (12 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Successful builds reported [all 1 reports]