Data.Dynamic.Reify

This is a Dynamic version of Data.Reify, that can reify nodes of different types inside a sigle graph, provided they unify to a common representation.

Documentation

class MuRef a where

MuRef is a class that provided a way to reference into a specific type, and a way to map over the deferenced internals.

Associated Types

type DeRef a :: * -> *

Methods

mapDeRef :: Applicative f => (forall b. (MuRef b, Typeable b, DeRef a ~ DeRef b) => b -> f u) -> a -> f (DeRef a u)

module Data.Reify.Graph

reifyGraph :: (MuRef s, Typeable s) => s -> IO (Graph (DeRef s))

reifyGraph takes a data structure that admits MuRef, and returns a Graph that contains the dereferenced nodes, with their children as Int rather than recursive values.