Module FlatCurry.Transform.Utils

Exported Datatypes

This gives a monad for creating unique variable names. It's basically the State monad specilized to State Int a. I need to make my own because State is just a type synonym, and you can't make a monad out of that. ----------------------------------------------------------------------------

Constructor:

Fields:

• runRewriter :: (VarIndex -> (a, [Step], VarIndex, Bool))

Known instances:

• Functor ReWriter
• Applicative ReWriter
• Monad ReWriter

Exported Functions

recursiveFunc :: FuncDecl -> Bool   

funcCalls :: FuncDecl -> [(String, String)]   

isFunc :: CombType -> Bool   

Further infos:

• solution complete, i.e., able to compute all solutions

isCons :: CombType -> Bool   

isPart :: CombType -> Bool   

Further infos:

• solution complete, i.e., able to compute all solutions

isApp :: CombType -> Bool   

missingVars :: Expr -> Int   

ground :: Expr -> Bool   

recursive :: Int -> Expr -> Bool   

Further infos:

• partially defined

nonRecursive :: Int -> Expr -> Bool   

replace :: Expr -> [Int] -> Expr -> Expr   

Further infos:

• partially defined

max1 :: [Int] -> Int   

newVar :: Expr -> Int   

hasVar :: Int -> Expr -> Bool   

uses :: Int -> Expr -> Int   

freeVars :: Expr -> [Int]   

strict :: Int -> Expr -> Bool   

Further infos:

• partially defined

idSub :: Int -> Expr   

Further infos:

• solution complete, i.e., able to compute all solutions

(@>) :: Eq a => (a, b) -> (a -> b) -> a -> b   

(-\) :: (Int -> Expr) -> [Int] -> Int -> Expr   

sub :: (Int -> Expr) -> Expr -> Expr   

rename :: Int -> (Int -> Int) -> Expr -> (Expr, Int)   

ren :: (Int -> Int) -> Expr -> StateT Int Identity Expr   

extend :: [Int] -> (Int -> Int) -> StateT Int Identity (Int -> Int)   

Further infos:

• partially defined

primType :: String -> (String, String)   

Further infos:

• partially defined

primCon :: String -> (String, String)   

Further infos:

• partially defined

litCon :: Literal -> (String, String)   

Further infos:

• solution complete, i.e., able to compute all solutions

litBranchCon :: [BranchExpr] -> (String, String)   

Further infos:

• partially defined

isLitBranch :: [BranchExpr] -> Bool   

Further infos:

• partially defined

fork :: (a -> b) -> (c -> d) -> (a, c) -> (b, d)   

mapFst :: (a -> b) -> (a, c) -> (b, c)   

mapSnd :: (a -> b) -> (c, a) -> (c, b)   

mergeMap :: Ord b => (a -> [b]) -> [a] -> [b]   

merge :: Ord a => [[a]] -> [a]   

(++-) :: Ord a => [a] -> [a] -> [a]   

Further infos:

• defined as right-associative infix operator with precedence 5

(\\-) :: Ord a => [a] -> [a] -> [a]   

Further infos:

• defined as right-associative infix operator with precedence 5

(&&-) :: Ord a => [a] -> [a] -> [a]   

Further infos:

• defined as right-associative infix operator with precedence 5

fresh :: StateT Int Identity Int   

curVar :: ReWriter Int   

update :: a -> (String, [Int], Expr) -> Int -> ReWriter a