| Stability | experimental |
|---|---|
| Maintainer | conal@conal.net |
Shady.Language.Reify
Description
Discover representation sharing in expressions Variation on Andy Gill's Data.Reify.
- reifyGraph :: HasType a => E a -> IO (Graph a)
Documentation
reifyGraph :: HasType a => E a -> IO (Graph a)Source
reifyGraph takes a data structure that admits MuRef, and returns
a Graph that contains the dereferenced nodes, with their children as
integers rather than recursive values.