úÎð þ(c) 2009 Andy GillBSD3Andy Gill <andygill@ku.edu>unstableghc Safe-Inferred3: 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. If e is s Functor, and e is -able, then we can  a .None=HKMs is a class that provided a way to reference into a specific type, and a way to map over the deferenced internals.$ takes a data structure that admits , and returns a ? that contains the dereferenced nodes, with their children as   rather than recursive values.       data-reify-0.6.1Data.Reify.Graph Data.ReifyUniqueGraphMuRefDeRefmapDeRef reifyGraph $fShowGraphbaseGHC.ShowShowghc-prim GHC.TypesInt DynStableName findNodesmylookup newUniquehashDynStableNamemakeDynStableName$fEqDynStableName