Dvda.Reify

Documentation

class MuRef a where

Associated Types

type DeRef a :: * -> *

Methods

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

Instances

MuRef (Expr a)

data ReifyGraph e

Constructors

ReifyGraph [(Unique, e Unique)]

Instances

Show (e Int) => Show (ReifyGraph e)

If e is s Functor, and e is Show-able, then we can Show a Graph.

reifyGraphs :: (MuRef s, Traversable t) => [t s] -> IO (ReifyGraph (DeRef s), [t Int])

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