LambdaCube.Compiler.DeBruijn

Documentation

class Rearrange a where

Minimal complete definition

rearrange

Methods

rearrange :: Int -> RearrangeFun -> a -> a

Instances

Rearrange Void

Methods

rearrange :: Int -> RearrangeFun -> Void -> Void

Rearrange GuardTree

Methods

rearrange :: Int -> RearrangeFun -> GuardTree -> GuardTree

Rearrange ParPat

Methods

rearrange :: Int -> RearrangeFun -> ParPat -> ParPat

Rearrange Pat

Methods

rearrange :: Int -> RearrangeFun -> Pat -> Pat

Rearrange ExpType

Methods

rearrange :: Int -> RearrangeFun -> ExpType -> ExpType

Rearrange Neutral

Methods

rearrange :: Int -> RearrangeFun -> Neutral -> Neutral

Rearrange Exp

Methods

rearrange :: Int -> RearrangeFun -> Exp -> Exp

Rearrange a => Rearrange [a]

Methods

rearrange :: Int -> RearrangeFun -> [a] -> [a]

Rearrange a => Rearrange (SExp' a)

Methods

rearrange :: Int -> RearrangeFun -> SExp' a -> SExp' a

Rearrange a => Rearrange (Lets a)

Methods

rearrange :: Int -> RearrangeFun -> Lets a -> Lets a

(Rearrange a, Rearrange b) => Rearrange (Either a b)

Methods

rearrange :: Int -> RearrangeFun -> Either a b -> Either a b

(Rearrange a, Rearrange b) => Rearrange (a, b)

Methods

rearrange :: Int -> RearrangeFun -> (a, b) -> (a, b)

data RearrangeFun

Constructors

RFSubst Int Int

RFMove Int

RFUp Int

Instances

Show RearrangeFun

Methods

showsPrec :: Int -> RearrangeFun -> ShowS

show :: RearrangeFun -> String

showList :: [RearrangeFun] -> ShowS

rearrangeFun :: RearrangeFun -> Int -> Int

rSubst :: Rearrange a => Int -> Int -> a -> a

rMove :: Rearrange a => Int -> Int -> a -> a

rUp :: Rearrange a => Int -> Int -> a -> a

up1_ :: Rearrange a => Int -> a -> a

up :: Rearrange a => Int -> a -> a

up1 :: Rearrange a => a -> a

newtype FreeVars

Constructors

FreeVars Integer

Instances

Eq FreeVars

Methods

(==) :: FreeVars -> FreeVars -> Bool

(/=) :: FreeVars -> FreeVars -> Bool

Monoid FreeVars

Methods

mempty :: FreeVars

mappend :: FreeVars -> FreeVars -> FreeVars

mconcat :: [FreeVars] -> FreeVars

PShow FreeVars

Methods

pShow :: FreeVars -> Doc

HasFreeVars FreeVars

Methods

getFreeVars :: FreeVars -> FreeVars

freeVar :: Int -> FreeVars

delVar :: Int -> FreeVars -> FreeVars

shiftFreeVars :: Int -> FreeVars -> FreeVars

usedVar :: HasFreeVars a => Int -> a -> Bool

freeVars :: FreeVars -> [Int]

isClosed :: FreeVars -> Bool

lowerFreeVars :: FreeVars -> FreeVars

rearrangeFreeVars :: RearrangeFun -> Int -> FreeVars -> FreeVars

dbGE :: HasFreeVars a => Int -> a -> Bool

dbGE_ :: Int -> FreeVars -> Bool

class HasFreeVars a where

Minimal complete definition

getFreeVars

Methods

getFreeVars :: a -> FreeVars

Instances

HasFreeVars Void

Methods

getFreeVars :: Void -> FreeVars

HasFreeVars FreeVars

Methods

getFreeVars :: FreeVars -> FreeVars

HasFreeVars ExpType

Methods

getFreeVars :: ExpType -> FreeVars

HasFreeVars Neutral

Methods

getFreeVars :: Neutral -> FreeVars

HasFreeVars Exp

Methods

getFreeVars :: Exp -> FreeVars

HasFreeVars a => HasFreeVars (SExp' a)

Methods

getFreeVars :: SExp' a -> FreeVars

class DeBruijnify n a where

Minimal complete definition

deBruijnify_

Methods

deBruijnify_ :: Int -> [n] -> a -> a

Instances

DeBruijnify SIName Stmt

Methods

deBruijnify_ :: Int -> [SIName] -> Stmt -> Stmt

DeBruijnify SIName SExp

Methods

deBruijnify_ :: Int -> [SIName] -> SExp -> SExp

DeBruijnify SIName GuardTree

Methods

deBruijnify_ :: Int -> [SIName] -> GuardTree -> GuardTree

DeBruijnify SIName ParPat

Methods

deBruijnify_ :: Int -> [SIName] -> ParPat -> ParPat

DeBruijnify SIName PreStmt

Methods

deBruijnify_ :: Int -> [SIName] -> PreStmt -> PreStmt

DeBruijnify n a => DeBruijnify n [a]

Methods

deBruijnify_ :: Int -> [n] -> [a] -> [a]

DeBruijnify SIName a => DeBruijnify SIName (Lets a)

Methods

deBruijnify_ :: Int -> [SIName] -> Lets a -> Lets a

(DeBruijnify n a, DeBruijnify n b) => DeBruijnify n (Either a b)

Methods

deBruijnify_ :: Int -> [n] -> Either a b -> Either a b

(DeBruijnify n a, DeBruijnify n b) => DeBruijnify n (a, b)

Methods

deBruijnify_ :: Int -> [n] -> (a, b) -> (a, b)

deBruijnify :: DeBruijnify n a => [n] -> a -> a