| MagicHaskeller-0.8.6.2: Automatic inductive functional programmer by systematic search | Contents | Index |
|
MagicHaskeller.Expression |
|
|
|
|
Documentation |
|
data AnnExpr |
Constructors | | Instances | |
|
|
data MemoExpr |
|
|
aeToME :: TyConLib -> RTrie -> Type -> AnnExpr -> MemoExpr |
|
meToAE :: MemoExpr -> AnnExpr |
|
class (Ord e, Show e) => Expression e where |
| Methods | | | Instances | |
|
|
windType :: Type -> CoreExpr -> CoreExpr |
|
mkDyn :: Int -> Int -> Dynamic |
|
getDyn :: Int -> Int -> Dynamic |
|
dynss :: [[Dynamic]] |
|
mkDyn_LambdaBoundHead :: Int -> Int -> Int -> Dynamic |
|
getDyn_LambdaBoundHead :: Int -> Int -> Int -> Dynamic |
|
dynsss :: [[[Dynamic]]] |
|
reorganizer :: Monad m => ([Type] -> m [CoreExpr]) -> [Type] -> m [CoreExpr] |
|
reorganizerId :: ([Type] -> [CoreExpr]) -> [Type] -> [CoreExpr] |
|
replaceVars :: Int -> CoreExpr -> [[Int]] -> [CoreExpr] |
|
tkr10 :: [(Type, Int)] -> [(Type, [Int])] |
|
annotate :: [Type] -> [(Type, Int)] |
|
uniqSorter :: Expression e => [(e, Int)] -> [(e, Int)] |
|
uniqSort :: Ord a => [a] -> [a] |
|
swapUniqSort :: (Ord a, Ord b) => [(a, b)] -> [(a, b)] |
|
annUniqSort :: Expression e => [(e, Int)] -> [(e, Int)] |
|
aUS :: Expression e => [e] -> [e] |
|
mkVName :: Char -> Int -> Q Name |
|
mkVNames :: Char -> Int -> Q [Name] |
|
mkAs :: Int -> Q [Name] |
|
mkXs :: Int -> Q [Name] |
|
mkEs :: Int -> Q [Name] |
|
hdmnTHEQ :: Int -> Int -> ExpQ |
|
aimnTHEQ :: Int -> Int -> Int -> ExpQ |
|
hdmnTHE :: Int -> Int -> Exp |
|
aimnTHE :: Int -> Int -> Int -> Exp |
|
hdmnty :: Int -> Int -> Type |
|
aimnty :: Int -> Int -> Int -> Type |
|
mkTV :: Int -> Type |
|
maxLenavails :: Int |
|
maxArity :: Int |
|
mkCE |
|
|
data CoreExpr |
Instances | |
|
|
Produced by Haddock version 2.7.2 |