cflp-2009.2.1: Constraint Functional-Logic Programming in Haskell Source code Contents Index

CFLP

Documentation

class (Strategy (Ctx s) s, MonadPlus s, Solvable (Ctx s), MonadUpdate (Ctx s) s, Update (Ctx s) s s, Update (Ctx s) s (Res s), MonadPlus (Res s), Enumerable (Res s)) => CFLP s Source

Instances (MonadPlus m, Enumerable m) => CFLP (Monadic (UpdateT () m)) (MonadPlus m, Enumerable m) => CFLP (CTC (Monadic (UpdateT (StoreCTC ()) m))) (MonadPlus m, Enumerable m) => CFLP (CTC (Rnd (Monadic (UpdateT (StoreCTC (RndCtx ())) m)))) (MonadPlus m, Enumerable m) => CFLP (CTC (Rnd (Sat (Monadic (UpdateT (StoreCTC (RndCtx (SatCtx ()))) m))))) (MonadPlus m, Enumerable m) => CFLP (CTC (Depth (DepthLim (Monadic (UpdateT (StoreCTC (DepthCtx (DepthLimCtx ()))) m))))) (MonadPlus m, Enumerable m) => CFLP (CTC (Depth (DepthLim (Sat (Monadic (UpdateT (StoreCTC (DepthCtx (DepthLimCtx (SatCtx ())))) m)))))) (MonadPlus m, Enumerable m) => CFLP (CTC (Sat (Monadic (UpdateT (StoreCTC (SatCtx ())) m))))

class Enumerable s where Source

Methods enumeration :: s a -> [a] Source Instances Enumerable [] Enumerable Omega Enumerable Levels Enumerable Logic Enumerable Stream Enumerable m => Enumerable (Monadic m) Enumerable s => Enumerable (Rnd s) Enumerable s => Enumerable (Depth s) Enumerable s => Enumerable (DepthLim s) Enumerable s => Enumerable (CTC s) Enumerable s => Enumerable (Sat s)

type family Ctx s Source

type Data s a = Nondet (Ctx s) s a Source

eval :: (Monad s, CFLP s, Generic a) => [s (Ctx s)] -> (Context (Ctx s) -> ID -> Data s a) -> IO [a] Source

evalPartial :: (Monad s, CFLP s, Generic a) => [s (Ctx s)] -> (Context (Ctx s) -> ID -> Data s a) -> IO [a] Source

evalPrint :: (Monad s, CFLP s, Generic a) => [s (Ctx s)] -> (Context (Ctx s) -> ID -> Data s a) -> IO () Source

data Monadic m a Source

Instances MonadUpdate c m => MonadUpdate c (Monadic m) MonadPlus m => Strategy c (Monadic m) Update s m m' => Update s (Monadic m) (Monadic m') Monad m => Monad (Monadic m) MonadPlus m => MonadPlus (Monadic m) Enumerable m => Enumerable (Monadic m) (MonadPlus m, Enumerable m) => CFLP (Monadic (UpdateT () m))

monadic :: Monad m => Monadic (UpdateT c m) () Source

data UpdateT s m a Source

Instances MonadPlus m => MonadUpdate s (UpdateT s m) MonadPlus m => Update s (UpdateT s m) m MonadPlus m => Update s (UpdateT s m) (UpdateT s m) MonadTrans (UpdateT s) Monad m => Monad (UpdateT s m) MonadPlus m => MonadPlus (UpdateT s m) Show a => Show (UpdateT s [] a)

data NormalForm Source

Instances Show NormalForm

data Nondet cs m a Source

Instances With x (Nondet cs m a) Show (Nondet cs (UpdateT cs []) a) Show (Nondet cs [] a) Monad m => MkCons (Nondet cs m a) WithUntyped (Nondet cs m a)

newtype Context cs Source

Constructors Context cs

data ID Source

Instances With ID a => With ID (ID -> a)

initID :: IO ID Source

withUnique :: With ID a => a -> ID -> Nondet (C ID a) (M ID a) (T ID a) Source

class Narrow c a where Source

Methods narrow :: (Monad s, Strategy c s, MonadUpdate c s, Update c s s) => Context c -> ID -> Nondet c s a Source Instances Narrow c Bool BooleanSolver c => Narrow c Boolean (Narrow c a, Generic a) => Narrow c ([] a)

unknown :: (Monad s, Strategy c s, MonadUpdate c s, Update c s s, Narrow c a) => ID -> Nondet c s a Source

failure :: MonadPlus m => Nondet cs m a Source

oneOf :: (Strategy c s, MonadUpdate c s) => [Nondet c s a] -> Context c -> ID -> Nondet c s a Source

(?) :: (Monad s, Strategy c s, MonadUpdate c s) => Nondet c s a -> Nondet c s a -> ID -> Nondet c s a Source

withHNF :: (Monad m, Update cs m m) => Nondet cs m a -> (HeadNormalForm cs m -> Context cs -> Nondet cs m b) -> Context cs -> Nondet cs m b Source

caseOf :: (MonadPlus m, Update cs m m) => Nondet cs m a -> [Match a cs m b] -> Context cs -> Nondet cs m b Source

caseOf_ :: (Monad m, Update cs m m) => Nondet cs m a -> [Match a cs m b] -> Nondet cs m b -> Context cs -> Nondet cs m b Source

data Match a cs m b Source

class Generic a where Source

Methods genericOps :: GenericOps a Source constr :: Int -> GenericOps a Source Instances Generic Bool Generic Int Generic Boolean Generic a => Generic ([] a) (Generic a, Generic b) => Generic (a -> b)

primitive :: Generic a => NormalForm -> a Source

generic :: Generic a => a -> NormalForm Source

nondet :: (Monad m, Update cs m m, Generic a) => a -> Nondet cs m a Source

type Decons a = ([NormalForm] -> NormalForm) -> Result a -> Maybe NormalForm Source

class ApplyCons a where Source

Associated Types type Result a Source Methods applyCons :: a -> [NormalForm] -> Result a Source Instances ApplyCons Bool ApplyCons Int ApplyCons Boolean ApplyCons ([] a) (Generic a, ApplyCons b) => ApplyCons (a -> b)

(!) :: (Int -> GenericOps a) -> (Int -> GenericOps a) -> Int -> GenericOps a Source

cons :: ApplyCons a => String -> a -> Decons a -> Int -> GenericOps (Result a) Source

groundNormalForm :: (Monad s, Monad m, Update c s m) => s c -> Nondet c s a -> m (NormalForm, c) Source

partialNormalForm :: (Monad s, Strategy c s, Solvable c, MonadPlus m, Update c s m) => s c -> Nondet c s a -> m (NormalForm, c) Source

data ConsPatList a b Source

Constructors a :! b Instances (cs ~ C a, m ~ M a, b ~ T a, WithUntyped a, PatternList p) => PatternList (ConsPatList ((Context cs -> a) -> Match t cs m b) p) (MkCons a, ConsList b) => ConsList (ConsPatList a b)

constructors :: (ConsList a, Generic (CData a)) => a Source

patterns :: (PatternList a, Generic (PData a)) => a Source

apply :: (Monad m, Update cs m m) => Nondet cs m (a -> b) -> Nondet cs m a -> Context cs -> ID -> Nondet cs m b Source

fun :: (Monad m, LiftFun f, NestLambda cs m t (Lift f)) => f -> Nondet cs m t Source

Produced by Haddock version 2.4.2