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

CFLP.Constraints.Boolean

Documentation

Boolean (Var, Yes, No, Not, :&&:, :||:)

yes :: Monad m => Nondet c m Boolean Source

no :: Monad m => Nondet c m Boolean Source

neg :: Monad m => Nondet c m Boolean -> Nondet c m Boolean Source

(.&&.) :: Monad m => Nondet c m Boolean -> Nondet c m Boolean -> Nondet c m Boolean Source

(.||.) :: Monad m => Nondet c m Boolean -> Nondet c m Boolean -> Nondet c m Boolean Source

class BooleanSolver c where Source

Methods lookupBoolean :: Int -> c -> Maybe Bool Source assertBoolean :: MonadPlus m => c -> Boolean -> c -> m c Source Instances BooleanSolver (SatCtx c)

data SatCtx c Source

Instances Transformer SatCtx Solvable c => Solvable (SatCtx c) BooleanSolver (SatCtx c)

data Sat s a Source

Instances BooleanSolver c => StrategyT c Sat Monad s => Monad (Sat s) MonadPlus s => MonadPlus (Sat s) Enumerable s => Enumerable (Sat s)

satSolving :: Monad s => s c -> Sat s (SatCtx c) Source

ifThen :: (CFLP s, BooleanSolver (Ctx s)) => Data s Boolean -> Data s a -> Context (Ctx s) -> Data s a Source

ifThenElse :: (CFLP s, BooleanSolver (Ctx s)) => Data s Boolean -> Data s a -> Data s a -> Context (Ctx s) -> Data s a Source

booleanToBool :: (CFLP s, BooleanSolver (Ctx s)) => Data s Boolean -> Context (Ctx s) -> Data s Bool Source

Produced by Haddock version 2.4.2