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

Control.CFLP

Documentation

class (MonadConstr Choice m, ConstraintStore Choice cs, ChoiceStore cs, MonadSolve cs m m) => CFLP cs m Source

Instances CFLP ChoiceStoreUnique (ConstrT ChoiceStoreUnique []) CFLP ChoiceStoreUnique (ConstrT ChoiceStoreUnique [])

class ChoiceStore cs Source

Instances ChoiceStore ChoiceStoreUnique

type Computation m a = CS -> ID -> Nondet CS (ConstrT CS m) a Source

eval :: (CFLP CS m, MonadSolve CS m m', Data a) => Strategy m' -> (CS -> ID -> Nondet CS m a) -> IO [a] Source

evalPartial :: (CFLP CS m, MonadSolve CS m m', Data a) => Strategy m' -> (CS -> ID -> Nondet CS m a) -> IO [a] Source

evalPrint :: (CFLP CS m, MonadSolve CS m m', Data a, Show a) => Strategy m' -> (CS -> ID -> Nondet CS m a) -> IO () Source

type Strategy m = forall a. m a -> [a] Source

depthFirst :: Strategy [] Source

data NormalForm Source

Instances Show NormalForm

data Nondet cs m a Source

Instances (Monad m, Data a) => MkCons cs m a (Nondet cs m t) With x (Nondet cs m a) Show (Nondet cs (ConstrT cs []) a) Show (Nondet cs [] a) WithUntyped (Nondet cs m a)

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 ChoiceStore cs => Narrow cs a where Source

Methods narrow :: MonadConstr Choice m => cs -> ID -> Nondet cs m a Source Instances ChoiceStore cs => Narrow cs Bool (ChoiceStore cs, Narrow cs a) => Narrow cs ([] a)

unknown :: (MonadConstr Choice m, Narrow cs a) => ID -> Nondet cs m a Source

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

oneOf :: (MonadConstr Choice m, ChoiceStore cs) => [Nondet cs m a] -> cs -> ID -> Nondet cs m a Source

(?) :: (MonadConstr Choice m, ChoiceStore cs) => Nondet cs m a -> Nondet cs m a -> ID -> Nondet cs m a Source

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

caseOf :: (MonadSolve cs m m, MonadConstr Choice m) => Nondet cs m a -> [Match a cs m b] -> cs -> Nondet cs m b Source

caseOf_ :: (MonadSolve cs m m, MonadConstr Choice m) => Nondet cs m a -> [Match a cs m b] -> Nondet cs m b -> cs -> Nondet cs m b Source

data Match a cs m b Source

Data (gfoldl, gunfold, toConstr, dataTypeOf, dataCast1, dataCast2, gmapT, gmapQl, gmapQr, gmapQ, gmapQi, gmapM, gmapMp, gmapMo)

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

groundNormalForm :: MonadSolve cs m m' => Nondet cs m a -> cs -> m' NormalForm Source

partialNormalForm :: (MonadSolve cs m m', ChoiceStore cs) => Nondet cs m a -> cs -> m' NormalForm Source

class ConsRep a where Source

Methods consRep :: a -> Constr Source Instances ConsRep Bool ConsRep ([] ()) ConsRep b => ConsRep (a -> b)

cons :: MkCons cs m a b => a -> b Source

match :: (ConsRep a, WithUntyped b) => a -> (C b -> b) -> Match t (C b) (M b) (T b) Source

true :: Monad m => Nondet cs m Bool Source

pTrue :: (cs -> Nondet cs m a) -> Match Bool cs m a Source

false :: Monad m => Nondet cs m Bool Source

pFalse :: (cs -> Nondet cs m a) -> Match Bool cs m a Source

not :: (MonadSolve cs m m, MonadConstr Choice m) => Nondet cs m Bool -> cs -> Nondet cs m Bool Source

(===) :: MonadSolve cs m m => Nondet cs m a -> Nondet cs m a -> cs -> Nondet cs m Bool Source

nil :: Monad m => Nondet cs m [a] Source

pNil :: (cs -> Nondet cs m b) -> Match [a] cs m b Source

(^:) :: Monad m => Nondet cs m a -> Nondet cs m [a] -> Nondet cs m [a] Source

pCons :: (cs -> Nondet cs m a -> Nondet cs m [a] -> Nondet cs m b) -> Match [a] cs m b Source

fromList :: Monad m => [Nondet cs m a] -> Nondet cs m [a] Source

null :: (MonadSolve cs m m, MonadConstr Choice m) => Nondet cs m [a] -> cs -> Nondet cs m Bool Source

head :: (MonadSolve cs m m, MonadConstr Choice m) => Nondet cs m [a] -> cs -> Nondet cs m a Source

tail :: (MonadSolve cs m m, MonadConstr Choice m) => Nondet cs m [a] -> cs -> Nondet cs m [a] Source

Produced by Haddock version 2.4.2