Safe Haskell	None
Language	Haskell2010

LambdaCube.Compiler.DeBruijn

Documentation

class Rearrange a where Source #

Minimal complete definition

rearrange

Methods

rearrange :: Int -> RearrangeFun -> a -> a Source #

Instances

Rearrange Void Source #
Methods rearrange :: Int -> RearrangeFun -> Void -> Void Source #
Rearrange GuardTree Source #
Methods rearrange :: Int -> RearrangeFun -> GuardTree -> GuardTree Source #
Rearrange ParPat Source #
Methods rearrange :: Int -> RearrangeFun -> ParPat -> ParPat Source #
Rearrange Pat Source #
Methods rearrange :: Int -> RearrangeFun -> Pat -> Pat Source #
Rearrange ExpType Source #
Methods rearrange :: Int -> RearrangeFun -> ExpType -> ExpType Source #
Rearrange Neutral Source #
Methods rearrange :: Int -> RearrangeFun -> Neutral -> Neutral Source #
Rearrange Exp Source #
Methods rearrange :: Int -> RearrangeFun -> Exp -> Exp Source #
Rearrange a => Rearrange [a] Source #
Methods rearrange :: Int -> RearrangeFun -> [a] -> [a] Source #
Rearrange a => Rearrange (SExp' a) Source #
Methods rearrange :: Int -> RearrangeFun -> SExp' a -> SExp' a Source #
Rearrange a => Rearrange (Lets a) Source #
Methods rearrange :: Int -> RearrangeFun -> Lets a -> Lets a Source #
(Rearrange a, Rearrange b) => Rearrange (Either a b) Source #
Methods rearrange :: Int -> RearrangeFun -> Either a b -> Either a b Source #
(Rearrange a, Rearrange b) => Rearrange (a, b) Source #
Methods rearrange :: Int -> RearrangeFun -> (a, b) -> (a, b) Source #

data RearrangeFun Source #

Constructors

RFSubst Int Int
RFMove Int
RFUp Int

Instances

Show RearrangeFun Source #
Methods showsPrec :: Int -> RearrangeFun -> ShowS # show :: RearrangeFun -> String # showList :: [RearrangeFun] -> ShowS #

rearrangeFun :: RearrangeFun -> Int -> Int Source #

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

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

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

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

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

up1 :: Rearrange a => a -> a Source #

newtype FreeVars Source #

Constructors

FreeVars Integer

Instances

Eq FreeVars Source #
Methods (==) :: FreeVars -> FreeVars -> Bool # (/=) :: FreeVars -> FreeVars -> Bool #
Monoid FreeVars Source #
Methods mempty :: FreeVars # mappend :: FreeVars -> FreeVars -> FreeVars # mconcat :: [FreeVars] -> FreeVars #
PShow FreeVars Source #
Methods pShow :: FreeVars -> Doc Source #
HasFreeVars FreeVars Source #
Methods getFreeVars :: FreeVars -> FreeVars Source #

freeVar :: Int -> FreeVars Source #

delVar :: Int -> FreeVars -> FreeVars Source #

shiftFreeVars :: Int -> FreeVars -> FreeVars Source #

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

freeVars :: FreeVars -> [Int] Source #

isClosed :: FreeVars -> Bool Source #

lowerFreeVars :: FreeVars -> FreeVars Source #

rearrangeFreeVars :: RearrangeFun -> Int -> FreeVars -> FreeVars Source #

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

dbGE_ :: Int -> FreeVars -> Bool Source #

class HasFreeVars a where Source #

Minimal complete definition

getFreeVars

Methods

getFreeVars :: a -> FreeVars Source #

Instances

HasFreeVars Void Source #
Methods getFreeVars :: Void -> FreeVars Source #
HasFreeVars FreeVars Source #
Methods getFreeVars :: FreeVars -> FreeVars Source #
HasFreeVars ExpType Source #
Methods getFreeVars :: ExpType -> FreeVars Source #
HasFreeVars Neutral Source #
Methods getFreeVars :: Neutral -> FreeVars Source #
HasFreeVars Exp Source #
Methods getFreeVars :: Exp -> FreeVars Source #
HasFreeVars a => HasFreeVars (SExp' a) Source #
Methods getFreeVars :: SExp' a -> FreeVars Source #

class DeBruijnify n a where Source #

Minimal complete definition

deBruijnify_

Methods

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

Instances

DeBruijnify SIName Stmt Source #
Methods deBruijnify_ :: Int -> [SIName] -> Stmt -> Stmt Source #
DeBruijnify SIName SExp Source #
Methods deBruijnify_ :: Int -> [SIName] -> SExp -> SExp Source #
DeBruijnify SIName GuardTree Source #
Methods deBruijnify_ :: Int -> [SIName] -> GuardTree -> GuardTree Source #
DeBruijnify SIName ParPat Source #
Methods deBruijnify_ :: Int -> [SIName] -> ParPat -> ParPat Source #
DeBruijnify SIName PreStmt Source #
Methods deBruijnify_ :: Int -> [SIName] -> PreStmt -> PreStmt Source #
DeBruijnify n a => DeBruijnify n [a] Source #
Methods deBruijnify_ :: Int -> [n] -> [a] -> [a] Source #
DeBruijnify SIName a => DeBruijnify SIName (Lets a) Source #
Methods deBruijnify_ :: Int -> [SIName] -> Lets a -> Lets a Source #
(DeBruijnify n a, DeBruijnify n b) => DeBruijnify n (Either a b) Source #
Methods deBruijnify_ :: Int -> [n] -> Either a b -> Either a b Source #
(DeBruijnify n a, DeBruijnify n b) => DeBruijnify n (a, b) Source #
Methods deBruijnify_ :: Int -> [n] -> (a, b) -> (a, b) Source #

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