MagicHaskeller.ProgramGenerator

Documentation

type Options = Opt [[Primitive]]

options for limiting the hypothesis space.

data Common

Constructors

Cmn

Fields

• opt :: Opt ()
• tcl :: TyConLib
• vl :: VarLib
• pvl :: VarLib
• vpl :: VarPriorityLib
• rt :: RTrie

class WithCommon a => ProgramGeneratorIO a where

Minimal complete definition

unifyingProgramsIO

Methods

mkTrieIO :: Common -> [Typed [CoreExpr]] -> [[Typed [CoreExpr]]] -> IO a

|mkTrie| creates the generator with the default parameters.

mkTrieOptIO :: Common -> [Typed [CoreExpr]] -> [[Typed [CoreExpr]]] -> [[Typed [CoreExpr]]] -> IO a

matchingProgramsIO :: Type -> a -> RecompT IO AnnExpr

Use memoization requiring IO

unifyingProgramsIO :: Type -> a -> RecompT IO AnnExpr

Use memoization requiring IO

Instances

ProgramGeneratorIO ProgGen

Defined in MagicHaskeller.ProgGen

Methods

mkTrieIO :: Common -> [Typed [CoreExpr]] -> [[Typed [CoreExpr]]] -> IO ProgGen

mkTrieOptIO :: Common -> [Typed [CoreExpr]] -> [[Typed [CoreExpr]]] -> [[Typed [CoreExpr]]] -> IO ProgGen

matchingProgramsIO :: Type -> ProgGen -> RecompT IO AnnExpr

unifyingProgramsIO :: Type -> ProgGen -> RecompT IO AnnExpr

ProgramGeneratorIO (PGSFIOR CoreExpr)

Defined in MagicHaskeller.ProgGenSFIORef

Methods

mkTrieIO :: Common -> [Typed [CoreExpr]] -> [[Typed [CoreExpr]]] -> IO (PGSFIOR CoreExpr)

mkTrieOptIO :: Common -> [Typed [CoreExpr]] -> [[Typed [CoreExpr]]] -> [[Typed [CoreExpr]]] -> IO (PGSFIOR CoreExpr)

matchingProgramsIO :: Type -> PGSFIOR CoreExpr -> RecompT IO AnnExpr

unifyingProgramsIO :: Type -> PGSFIOR CoreExpr -> RecompT IO AnnExpr

class WithCommon a => ProgramGenerator a where

ProgramGenerator is a generalization of the old Memo type.

Minimal complete definition

unifyingPrograms

Methods

mkTrie :: Common -> [Typed [CoreExpr]] -> [[Typed [CoreExpr]]] -> a

|mkTrie| creates the generator with the default parameters.

mkTrieOpt :: Common -> [Typed [CoreExpr]] -> [[Typed [CoreExpr]]] -> [[Typed [CoreExpr]]] -> a

matchingPrograms :: Search m => Type -> a -> m AnnExpr

matchingProgramsWOAbsents :: Search m => Type -> a -> m AnnExpr

unifyingPrograms :: Search m => Type -> a -> m AnnExpr

Instances

ProgramGenerator ProgGen

Defined in MagicHaskeller.ProgGen

Methods

mkTrie :: Common -> [Typed [CoreExpr]] -> [[Typed [CoreExpr]]] -> ProgGen

mkTrieOpt :: Common -> [Typed [CoreExpr]] -> [[Typed [CoreExpr]]] -> [[Typed [CoreExpr]]] -> ProgGen

matchingPrograms :: Search m => Type -> ProgGen -> m AnnExpr

matchingProgramsWOAbsents :: Search m => Type -> ProgGen -> m AnnExpr

unifyingPrograms :: Search m => Type -> ProgGen -> m AnnExpr

Expression e => ProgramGenerator (PGSF e)

Defined in MagicHaskeller.ProgGenSF

Methods

mkTrie :: Common -> [Typed [CoreExpr]] -> [[Typed [CoreExpr]]] -> PGSF e

mkTrieOpt :: Common -> [Typed [CoreExpr]] -> [[Typed [CoreExpr]]] -> [[Typed [CoreExpr]]] -> PGSF e

matchingPrograms :: Search m => Type -> PGSF e -> m AnnExpr

matchingProgramsWOAbsents :: Search m => Type -> PGSF e -> m AnnExpr

unifyingPrograms :: Search m => Type -> PGSF e -> m AnnExpr

class WithCommon a where

Methods

extractCommon :: a -> Common

Instances

WithCommon ProgGen

Defined in MagicHaskeller.ProgGen

Methods

extractCommon :: ProgGen -> Common

Expression e => WithCommon (PGSF e)

Defined in MagicHaskeller.ProgGenSF

Methods

extractCommon :: PGSF e -> Common

Expression e => WithCommon (PGSFIOR e)

Defined in MagicHaskeller.ProgGenSFIORef

Methods

extractCommon :: PGSFIOR e -> Common

type Prim = (Int, Int, Type, TyVar, Typed [CoreExpr])

annotated 'Typed [CoreExpr]'

extractTCL :: WithCommon a => a -> TyConLib

extractVL :: WithCommon a => a -> VarLib

extractRTrie :: WithCommon a => a -> RTrie

reducer :: Common -> CoreExpr -> Dynamic

mkCommon :: Options -> [Primitive] -> [Primitive] -> [Int] -> Common

initCommon :: Options -> [Primitive] -> Common

initCommonExt :: (TyConLib -> [[(String, Dynamic)]]) -> (TyConLib -> [[(String, Dynamic)]]) -> (TyConLib -> [[(String, Dynamic)]]) -> Options -> [Primitive] -> Common

updateCommon :: [Dynamic] -> [Dynamic] -> [Int] -> Common -> Common

updateCommon can be used for incremetal learning

retsTVar :: (a, b, Type, d, e) -> Bool

annotateTCEs :: Typed [CoreExpr] -> Prim

splitPrims :: [Typed [CoreExpr]] -> ([Prim], [Prim])

splitPrimss :: [[Typed [CoreExpr]]] -> ([[Prim]], [[Prim]])

mapSum :: (MonadPlus m, Delay m) => (a -> m b) -> [[a]] -> m b

applyDo :: (Functor m, Monad m) => ([Type] -> Type -> PriorSubsts m a) -> [Type] -> Type -> PriorSubsts m a

wind :: (a -> a) -> ([Type] -> Type -> a) -> [Type] -> Type -> a

wind_ :: ([Type] -> Type -> a) -> [Type] -> Type -> a

fromAssumptions :: (Search m, Expression e) => Common -> Int -> (Type -> PriorSubsts m [e]) -> (Type -> Type -> PriorSubsts m ()) -> Type -> [Type] -> PriorSubsts m [e]

retMono :: (Search m, Expression e) => Common -> Int -> (Type -> PriorSubsts m [e]) -> (Type -> PriorSubsts m ()) -> (Int8, (Int, [Type], Type)) -> PriorSubsts m [e]

fromAvail :: [Type] -> [(Int8, (Int, [Type], Type))]

mguAssumptions :: (Functor m, MonadPlus m) => Type -> [Type] -> PriorSubsts m [CoreExpr]

mguAssumptions' :: forall (m :: Type -> Type). MonadPlus m => [Type] -> Type -> PriorSubsts m [CoreExpr]

matchAssumptions :: (Functor m, MonadPlus m, Expression e) => Common -> Int -> Type -> [Type] -> PriorSubsts m [e]

mguAssumptions_ :: (Functor m, MonadPlus m) => Type -> [Type] -> PriorSubsts m ()

mguAssumptions_' :: forall (m :: Type -> Type). MonadPlus m => [Type] -> Type -> PriorSubsts m ()

retPrimMono :: (Search m, Expression e) => Common -> Int -> (Type -> PriorSubsts m [e]) -> (Type -> PriorSubsts m [e]) -> (Type -> PriorSubsts m [e]) -> (Type -> Type -> PriorSubsts m ()) -> Type -> Prim -> PriorSubsts m [e]

funApSub :: (Search m, Expression e) => (Type -> PriorSubsts m [e]) -> (Type -> PriorSubsts m [e]) -> (Type -> PriorSubsts m [e]) -> Type -> [e] -> PriorSubsts m [e]

funApSubOp :: (Monad m1, Monad m2) => (r -> a2 -> r) -> (Type -> m1 (m2 a2)) -> (Type -> m1 (m2 a2)) -> (Type -> m1 (m2 a2)) -> Type -> m2 r -> m1 (m2 r)

fap :: (Foldable t1, Monad m1, Monad m2, Expression r) => (t2 -> m1 (m2 r)) -> t1 t2 -> m2 r -> m1 (m2 r)

mapAndFoldM :: Monad m => (t1 -> t2 -> t1) -> t1 -> (t3 -> m t2) -> [t3] -> m t1

retGen :: (Search m, Expression e) => Common -> Int -> (Type -> Type -> [e] -> [e]) -> (Type -> PriorSubsts m [e]) -> (Type -> PriorSubsts m [e]) -> (Type -> PriorSubsts m [e]) -> Type -> Prim -> PriorSubsts m [e]

retGen' :: forall (n :: Type -> Type) e i t b c. (Search n, Expression e, Integral i) => (Type -> t -> PriorSubsts n b) -> Common -> i -> (Type -> Type -> [e] -> t) -> (Type -> PriorSubsts n [e]) -> (Type -> PriorSubsts n [e]) -> (Type -> PriorSubsts n [e]) -> Type -> (Int, Int, c, TyVar, Typed [CoreExpr]) -> PriorSubsts n b

retGenOrd :: (Search m, Expression e) => Common -> Int -> (Type -> Type -> [e] -> [e]) -> (Type -> PriorSubsts m [e]) -> (Type -> PriorSubsts m [e]) -> (Type -> PriorSubsts m [e]) -> Type -> Prim -> PriorSubsts m [e]

orderedAndUsedArgs :: Type -> Bool

usedArg :: TyVar -> Type -> Bool

retGenTV1 :: (Search m, Expression e) => Common -> Int -> (Type -> Type -> [e] -> [e]) -> (Type -> PriorSubsts m [e]) -> (Type -> PriorSubsts m [e]) -> (Type -> PriorSubsts m [e]) -> Type -> Prim -> PriorSubsts m [e]

retGenTV0 :: forall (n :: Type -> Type) e j i b c. (Search n, Expression e, Integral j, Integral i) => Common -> i -> (Type -> Type -> [e] -> b) -> (Type -> PriorSubsts n [e]) -> (Type -> PriorSubsts n [e]) -> (Type -> PriorSubsts n [e]) -> Type -> (j, j, c, TyVar, Typed [CoreExpr]) -> PriorSubsts n b

filtExprs :: Expression e => Bool -> Type -> Type -> [e] -> [e]

filterExprs :: Expression e => Type -> Type -> [e] -> [e]

getArgExprs :: CoreExpr -> [CoreExpr]

gae :: CoreExpr -> [CoreExpr] -> [CoreExpr]

constEq :: Type -> [CoreExpr] -> Bool

ceq :: CoreExpr -> Type -> [CoreExpr] -> Bool

recHead :: Type -> CoreExpr -> Bool

retSameVal :: Type -> [CoreExpr] -> Bool

rsv :: Type -> [CoreExpr] -> Bool

rsv' :: CoreExpr -> Type -> [CoreExpr] -> Bool

returnsAtoA :: Type -> Bool

returnsId :: Type -> CoreExpr -> Bool

isId :: CoreExpr -> Bool

isId' :: Int8 -> CoreExpr -> Bool

isId'' :: Int8 -> Int8 -> CoreExpr -> Bool

retVal :: Type -> CoreExpr -> CoreExpr

rv :: Type -> Int8 -> CoreExpr -> CoreExpr

mapsub :: Int8 -> CoreExpr -> CoreExpr

isConstrExpr :: CoreExpr -> Bool

isClosed :: CoreExpr -> Bool

isClosed' :: Int8 -> CoreExpr -> Bool

includesStrictArg :: [CoreExpr] -> Bool

anyRec :: Type -> [CoreExpr] -> Bool

recursive :: Type -> CoreExpr -> Bool

constRec :: Int8 -> CoreExpr -> Bool

belowIsUsed :: Int8 -> CoreExpr -> Bool

isUsed :: Int8 -> CoreExpr -> Bool

mkSubsts :: Search m => Int -> TyVar -> Type -> PriorSubsts m Int

mkSubst :: Search m => Int -> TyVar -> Type -> PriorSubsts m Int

mkRetty :: Type -> (Type, Type)

reorganizer_ :: ([Type] -> a) -> [Type] -> a

hit :: Type -> [Type] -> Bool

combs :: (Eq t, Num t) => t -> [a] -> [[a]]

tails :: [a] -> [[a]]

dynamic :: ExpQ -> ExpQ -> ExpQ