Data.Syntax.Node

Documentation

module Data.Syntax

data Node k b a

Constructors

ValList [a]

Dictionary (Map k a)

Quote (Node k b a)

Text k

Function b

Instances

Eq k => NodeFunctor (Node k) m

Functor (Node k b)

Foldable (Node k b)

Eq k => Traversable (Node k b)

(Show k, Show b, Show a) => Show (Node k b a)

type ThunkN k m = ThunkT (Node k) m ()

type Env k m = Map k (ThunkT (Node k) m ())

nil :: SyntaxT (Node k) m a

shape :: Node k b a -> String

dict :: Traversal' (Node k b a) (Map k a)

funcall :: (Eq k, Unit m) => ThunkT (Node k) m a -> ThunkT (Node k) m a -> ThunkT (Node k) m a

builtin :: (Eq k, Unit m) => (ThunkN k m -> ThunkN k m) -> ThunkN k m

builtin2 :: (Eq k, Unit m) => (ThunkN k m -> ThunkN k m -> ThunkN k m) -> ThunkN k m

builtin3 :: (Eq k, Unit m) => (ThunkN k m -> ThunkN k m -> ThunkN k m -> ThunkN k m) -> ThunkN k m

lambda :: (Matching k, MonadReader (Env k m) m) => ThunkN k m -> ThunkN k m -> ThunkN k m

lambdaSum :: (Eq k, Monad m) => [ThunkN k m -> ThunkN k m] -> ThunkN k m -> ThunkN k m

reduce :: (Ord k, MonadReader (Env k m) m) => ThunkN k m -> ThunkN k m