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

Control.CFLP

Documentation

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

Instances CFLP ChoiceStore (ConstrT ChoiceStore []) CFLP ChoiceStore (ConstrT ChoiceStore [])

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

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

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

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

depthFirst :: Strategy [] Source

data NormalForm Source

Instances Show NormalForm

data HeadNormalForm m Source

Constructors Cons DataType ConIndex [Untyped m] Instances Show (HeadNormalForm []) Show (HeadNormalForm (ConstrT cs []))

mkHNF :: Constr -> [Untyped m] -> HeadNormalForm m Source

newtype Nondet m a Source

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

data ID Source

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

initID :: IO ID Source

withUnique :: With ID a => a -> ID -> Nondet (Mon ID a) (Typ ID a) Source

class Unknown a where Source

Methods unknown :: MonadConstr Choice m => ID -> Nondet m a Source Instances Unknown Bool Unknown a => Unknown ([] a)

failure :: MonadPlus m => Nondet m a Source

oneOf :: MonadConstr Choice m => [Nondet m a] -> ID -> Nondet m a Source

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

caseOf :: MonadSolve cs m m => Nondet m a -> [Match cs m b] -> cs -> Nondet m b Source

caseOf_ :: MonadSolve cs m m => Nondet m a -> [Match cs m b] -> Nondet m b -> cs -> Nondet m b Source

data Match cs m a Source

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

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

normalForm :: (MonadSolve cs m m', Data a) => Nondet m a -> cs -> m' a Source

class ConsRep a where Source

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

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

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

prim_eq :: MonadSolve cs m m => Untyped m -> Untyped m -> StateT cs m Bool Source

true :: Monad m => Nondet m Bool Source

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

false :: Monad m => Nondet m Bool Source

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

not :: MonadSolve cs m m => Nondet m Bool -> cs -> Nondet m Bool Source

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

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

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

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

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

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

null :: MonadSolve cs m m => Nondet m [a] -> cs -> Nondet m Bool Source

head :: MonadSolve cs m m => Nondet m [a] -> cs -> Nondet m a Source

tail :: MonadSolve cs m m => Nondet m [a] -> cs -> Nondet m [a] Source

Produced by Haddock version 2.4.2