Language.Syntactic.Features.Binding

General binding constructs

Documentation

newtype VarId

Variable identifier

Constructors

VarId

Fields

varInteger :: Integer

Instances

Enum VarId

Eq VarId

Num VarId

Ord VarId

Show VarId

Ix VarId

showVar :: VarId -> String

data Variable a where

Variables

Constructors

Variable :: Typeable a => VarId -> Variable (Full a)

Instances

ToTree Variable

Render Variable

data Lambda a where

Lambda binding

Constructors

Lambda :: (Typeable a, Typeable b) => VarId -> Lambda (b :-> Full (a -> b))

Instances

ToTree Lambda

Render Lambda

eqLambdaM :: ExprEq dom => AST (Lambda :+: (Variable :+: dom)) a -> AST (Lambda :+: (Variable :+: dom)) b -> Reader [(VarId, VarId)] Bool

Alpha-equivalence on Lambda expressions. Free variables are taken to be equvalent if they have the same identifier.

eqLambda :: ExprEq dom => AST (Lambda :+: (Variable :+: dom)) a -> AST (Lambda :+: (Variable :+: dom)) b -> Bool

evalLambdaM :: (Eval dom, MonadReader [(VarId, Dynamic)] m) => ASTF (Lambda :+: (Variable :+: dom)) a -> m a

Evaluation of possibly open LambdaAST expressions

evalLambda :: Eval dom => ASTF (Lambda :+: (Variable :+: dom)) a -> a

Evaluation of closed Lambda expressions

class NAry a dom | a -> dom where

The class of n-ary binding functions

Associated Types

type NAryEval a

Methods

bindN :: (forall b c. (Typeable b, Typeable c) => (ASTF dom b -> ASTF dom c) -> ASTF dom (b -> c)) -> a -> ASTF dom (NAryEval a)

N-ary binding by nested use of the supplied binder

Instances

(Typeable a, NAry b dom, Typeable (NAryEval b)) => NAry (ASTF dom a -> b) dom

NAry (ASTF dom a) dom

data Let a where

Let binding

Constructors

Let :: Let (a :-> ((a -> b) :-> Full b))

Instances

ExprEq Let

ToTree Let

Render Let

Eval Let

ExprHash Let