Shady.Language.Graph

Based on a typed variant of Andy Gill's data-reify. After several tries, I wasn't able to reuse data-reify or my typed variant of it. The problem was that I need my HasType class and Type type, but I couldn't parameterize data-reify by the class HasType.

Typed identifiers

type NodeId = Int

Node Identifiers

data Tid a

Typed variables

Constructors

Tid NodeId (Type a)

Instances

Eq (Tid a)

Show (Tid a)

Graph nodes

data N where

Constructors

VN :: V a -> N a

ON :: Op a -> N a

App :: (HasType a, HasType b) => Tid (a -> b) -> Tid a -> N b

Instances

Show (N a)

mapDeRef :: Applicative m => (forall a. HasType a => E a -> m NodeId) -> forall a. HasType a => E a -> m (N a)

Bindings

data Bind

Binding pair

Constructors

forall a . HasType a => Bind NodeId (N a)

Instances

Show Bind

Graphs

data Graph a

Graph, described by bindings and a root variable

Constructors

Graph [Bind] (Tid a)

Instances

Show (Graph a)