úÎ!Ì   (c) 2009 Andy GillBSD3Andy Gill <andygill@ku.edu>unstableghcSafe>æ data-reify: is a basic graph structure over nodes of the higher kind eá, with a single root. There is an assumption that there is no Unique used in a node which does not have a corresponding entry is the association list. The idea with this structure is that it is trivial to convert into an Array, IntMap<, or into a Martin Erwig's Functional Graph, as required.  data-reifyIf e is s Functor, and e is  -able, then we can   a .Safe EHSVXÈ data-reifys is a class that provided a way to reference into a specific type, and a way to map over the deferenced internals. data-reify$ takes a data structure that admits , and returns a ? that contains the dereferenced nodes, with their children as   rather than recursive values. data-reify takes a  % container 't s' of a data structure s admitting ], and returns a 't (Graph (DeRef s))' with the graph nodes resolved within the same context.?This allows for, e.g., a list of mutually recursive structures.     'data-reify-0.6.2-JI3udIZ8oNn5tTCZbypebMData.Reify.Graph Data.ReifyUniqueGraph $fShowGraphMuRefDeRefmapDeRef reifyGraph reifyGraphs$fEqDynStableName$fHashableDynStableNamebaseGHC.ShowShowghc-prim GHC.TypesIntData.Traversable Traversable