egison-4.1.3: Programming language with non-linear pattern-matching against non-free data
LicenseMIT
Safe HaskellSafe-Inferred
LanguageHaskell2010

Language.Egison.EvalState

Description

This module defines the state during the evaluation.

Documentation

newtype EvalState Source #

Constructors

EvalState 

Fields

Instances

Instances details
MonadRuntime EvalM Source # 
Instance details

Defined in Language.Egison.Data

Methods

fresh :: EvalM String Source #

Monad m => MonadEval (StateT EvalState m) Source # 
Instance details

Defined in Language.Egison.EvalState

Methods

pushFuncName :: Var -> StateT EvalState m () Source #

topFuncName :: StateT EvalState m Var Source #

popFuncName :: StateT EvalState m () Source #

getFuncNameStack :: StateT EvalState m [Var] Source #

initialEvalState :: EvalState Source #

class (Applicative m, Monad m) => MonadEval m where Source #

Methods

pushFuncName :: Var -> m () Source #

topFuncName :: m Var Source #

popFuncName :: m () Source #

getFuncNameStack :: m [Var] Source #

Instances

Instances details
MonadEval m => MonadEval (ExceptT e m) Source # 
Instance details

Defined in Language.Egison.EvalState

Methods

pushFuncName :: Var -> ExceptT e m () Source #

topFuncName :: ExceptT e m Var Source #

popFuncName :: ExceptT e m () Source #

getFuncNameStack :: ExceptT e m [Var] Source #

Monad m => MonadEval (StateT EvalState m) Source # 
Instance details

Defined in Language.Egison.EvalState

Methods

pushFuncName :: Var -> StateT EvalState m () Source #

topFuncName :: StateT EvalState m Var Source #

popFuncName :: StateT EvalState m () Source #

getFuncNameStack :: StateT EvalState m [Var] Source #

mLabelFuncName :: MonadEval m => Maybe Var -> m a -> m a Source #