syntactic-0.5: Generic abstract syntax, and utilities for embedded languages




Representation and manipulation of abstract syntax graphs



newtype NodeId Source

Node identifier




nodeInteger :: Integer

data Node ctx a whereSource

Placeholder for a syntax tree


Node :: Sat ctx a => NodeId -> Node ctx (Full a) 


WitnessCons (Node ctx) 
ToTree (Node ctx) 
Render (Node ctx) 

prjNode :: (Node ctx) :<: sup => Proxy ctx -> sup a -> Maybe (Node ctx a)Source

Partial Node projection with explicit context

data SomeAST dom whereSource

An ASTF with hidden result type


SomeAST :: Typeable a => ASTF dom a -> SomeAST dom 

data ASG ctx dom a Source

"Abstract Syntax Graph"

A representation of a syntax tree with explicit sharing. An ASG is valid if and only if inlineAll succeeds (and the numNodes field is correct).




topExpression :: ASTF (Node ctx :+: dom) a

Top-level expression

graphNodes :: [(NodeId, SomeAST (Node ctx :+: dom))]

Mapping from node id to sub-expression

numNodes :: NodeId

Total number of nodes

showASG :: ToTree dom => ASG ctx dom a -> StringSource

Show syntax graph using ASCII art

drawASG :: ToTree dom => ASG ctx dom a -> IO ()Source

Print syntax graph using ASCII art

reindexNodesAST :: (NodeId -> NodeId) -> AST (Node ctx :+: dom) a -> AST (Node ctx :+: dom) aSource

Update the node identifiers in an AST using the supplied reindexing function

reindexNodes :: (NodeId -> NodeId) -> ASG ctx dom a -> ASG ctx dom aSource

Reindex the nodes according to the given index mapping. The number of nodes is unchanged, so if the index mapping is not 1:1, the resulting graph will contain duplicates.

reindexNodesFrom0 :: ASG ctx dom a -> ASG ctx dom aSource

Reindex the nodes to be in the range [0 .. l-1], where l is the number of nodes in the graph

nubNodes :: ASG ctx dom a -> ASG ctx dom aSource

Remove duplicate nodes from a graph. The function only looks at the NodeId of each node. The numNodes field is updated accordingly.

liftSome2 :: (forall a b. ASTF (Node ctx :+: dom) a -> ASTF (Node ctx :+: dom) b -> c) -> SomeAST (Node ctx :+: dom) -> SomeAST (Node ctx :+: dom) -> cSource


data SyntaxPF dom a whereSource

Pattern functor representation of an AST with Nodes


AppPF :: a -> a -> SyntaxPF dom a 
NodePF :: NodeId -> a -> SyntaxPF dom a 
DomPF :: dom b -> SyntaxPF dom a 


foldGraph :: forall ctx dom a b. (SyntaxPF dom b -> b) -> ASG ctx dom a -> (b, (Array NodeId b, [(NodeId, b)]))Source

Folding over a graph

The user provides a function to fold a single constructor (an "algebra"). The result contains the result of folding the whole graph as well as the result of each internal node, represented both as an array and an association list. Each node is processed exactly once.


inlineAll :: forall ctx dom a. Typeable a => ASG ctx dom a -> ASTF dom aSource

Convert an ASG to an AST by inlining all nodes

nodeChildren :: ASG ctx dom a -> [(NodeId, [NodeId])]Source

Find the child nodes of each node in an expression. The child nodes of a node n are the first nodes along all paths from n.

occurrences :: ASG ctx dom a -> Array NodeId IntSource

Count the number of occurrences of each node in an expression

inlineSingle :: forall ctx dom a. Typeable a => ASG ctx dom a -> ASG ctx dom aSource

Inline all nodes that are not shared


hashNodes :: ExprEq dom => ASG ctx dom a -> (Array NodeId Hash, [(NodeId, Hash)])Source

Compute a table (both array and list representation) of hash values for each node

partitionNodes :: forall ctx dom a. ((Lambda ctx) :<: dom, (Variable ctx) :<: dom, ExprEq dom) => ASG ctx dom a -> [[NodeId]]Source

Partitions the nodes such that two nodes are in the same sub-list if and only if they are alpha-equivalent.

cse :: ((Lambda ctx) :<: dom, (Variable ctx) :<: dom, ExprEq dom) => ASG ctx dom a -> ASG ctx dom aSource

Common sub-expression elimination based on alpha-equivalence