language-dickinson-1.4.3.0: A language for generative literature

Safe Haskell	Safe-Inferred
Language	Haskell2010

Language.Dickinson.Rename

Synopsis

renameDickinson :: Int -> Dickinson a -> (Dickinson a, Int)
renameDickinsonM :: (MonadState s m, HasRenames s) => Dickinson a -> m (Dickinson a)
renameDeclarationsM :: (MonadState s m, HasRenames s) => [Declaration a] -> m [Declaration a]
renameDeclarationM :: (MonadState s m, HasRenames s) => Declaration a -> m (Declaration a)
renameExpressionM :: (MonadState s m, HasRenames s) => Expression a -> m (Expression a)
initRenames :: Renames
maxLens :: Lens' Renames Int
boundLens :: Lens' Renames (IntMap Int)
replaceUnique :: (MonadState s m, HasRenames s) => Unique -> m Unique
type RenameM = State Renames
data Renames = Renames {
- max_ :: Int
- bound :: IntMap Int
}
class HasRenames a where
- rename :: Lens' a Renames

Documentation

renameDickinson :: Int -> Dickinson a -> (Dickinson a, Int) Source #

renameDickinsonM :: (MonadState s m, HasRenames s) => Dickinson a -> m (Dickinson a) Source #

The renamer ensures global uniqueness and is used during evaluation to clone expressions with bound variables.

renameDeclarationsM :: (MonadState s m, HasRenames s) => [Declaration a] -> m [Declaration a] Source #

renameDeclarationM :: (MonadState s m, HasRenames s) => Declaration a -> m (Declaration a) Source #

renameExpressionM :: (MonadState s m, HasRenames s) => Expression a -> m (Expression a) Source #

Since: 0.1.1.0

initRenames :: Renames Source #

maxLens :: Lens' Renames Int Source #

boundLens :: Lens' Renames (IntMap Int) Source #

replaceUnique :: (MonadState s m, HasRenames s) => Unique -> m Unique Source #

type RenameM = State Renames Source #

data Renames Source #

Renamer state passed between various stages of compilation

Constructors

Renames
Fields max_ :: Int bound :: IntMap Int

Instances

Instances details

Generic Renames Source #
Instance details Defined in Language.Dickinson.Rename Associated Types type Rep Renames :: Type -> Type # Methods from :: Renames -> Rep Renames x # to :: Rep Renames x -> Renames #
Binary Renames Source #
Instance details Defined in Language.Dickinson.Rename Methods put :: Renames -> Put # get :: Get Renames # putList :: [Renames] -> Put #
HasRenames Renames Source #
Instance details Defined in Language.Dickinson.Rename Methods rename :: Lens' Renames Renames Source #
Pretty Renames Source #
Instance details Defined in Language.Dickinson.Rename Methods pretty :: Renames -> Doc ann # prettyList :: [Renames] -> Doc ann #
type Rep Renames Source #
Instance details Defined in Language.Dickinson.Rename type Rep Renames = D1 ('MetaData "Renames" "Language.Dickinson.Rename" "language-dickinson-1.4.3.0-u4JKvBug5L7Xak6MfKGcR-dickinson" 'False) (C1 ('MetaCons "Renames" 'PrefixI 'True) (S1 ('MetaSel ('Just "max_") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int) :*: S1 ('MetaSel ('Just "bound") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (IntMap Int))))

class HasRenames a where Source #

Since: 0.1.1.0

Methods

rename :: Lens' a Renames Source #

Instances

Instances details

HasRenames Renames Source #
Instance details Defined in Language.Dickinson.Rename Methods rename :: Lens' Renames Renames Source #
HasRenames (EvalSt a) Source #
Instance details Defined in Language.Dickinson.Eval Methods rename :: Lens' (EvalSt a) Renames Source #