monadiccp-0.7.7: Constraint Programming

Safe HaskellSafe
LanguageHaskell98

Control.Search.Language

Documentation

data GenMode Source #

Constructors

ModeUnk 
ModeGecode 
ModeFZ 
ModeMCP 

Instances

data Type Source #

Instances

Eq Type Source # 

Methods

(==) :: Type -> Type -> Bool #

(/=) :: Type -> Type -> Bool #

Ord Type Source # 

Methods

compare :: Type -> Type -> Ordering #

(<) :: Type -> Type -> Bool #

(<=) :: Type -> Type -> Bool #

(>) :: Type -> Type -> Bool #

(>=) :: Type -> Type -> Bool #

max :: Type -> Type -> Type #

min :: Type -> Type -> Type #

Show Type Source # 

Methods

showsPrec :: Int -> Type -> ShowS #

show :: Type -> String #

showList :: [Type] -> ShowS #

Pretty Type Source # 

data Value Source #

Instances

Eq Value Source # 

Methods

(==) :: Value -> Value -> Bool #

(/=) :: Value -> Value -> Bool #

Num Value Source # 
Ord Value Source # 

Methods

compare :: Value -> Value -> Ordering #

(<) :: Value -> Value -> Bool #

(<=) :: Value -> Value -> Bool #

(>) :: Value -> Value -> Bool #

(>=) :: Value -> Value -> Bool #

max :: Value -> Value -> Value #

min :: Value -> Value -> Value #

Show Value Source # 

Methods

showsPrec :: Int -> Value -> ShowS #

show :: Value -> String #

showList :: [Value] -> ShowS #

Simplifiable Value Source # 

Methods

simplify :: Value -> Value Source #

Pretty Value Source # 
Eq (Value -> Value -> Value) Source # 

Methods

(==) :: (Value -> Value -> Value) -> (Value -> Value -> Value) -> Bool #

(/=) :: (Value -> Value -> Value) -> (Value -> Value -> Value) -> Bool #

Eq (Value -> Value) Source # 

Methods

(==) :: (Value -> Value) -> (Value -> Value) -> Bool #

(/=) :: (Value -> Value) -> (Value -> Value) -> Bool #

Ord (Value -> Value -> Value) Source # 

Methods

compare :: (Value -> Value -> Value) -> (Value -> Value -> Value) -> Ordering #

(<) :: (Value -> Value -> Value) -> (Value -> Value -> Value) -> Bool #

(<=) :: (Value -> Value -> Value) -> (Value -> Value -> Value) -> Bool #

(>) :: (Value -> Value -> Value) -> (Value -> Value -> Value) -> Bool #

(>=) :: (Value -> Value -> Value) -> (Value -> Value -> Value) -> Bool #

max :: (Value -> Value -> Value) -> (Value -> Value -> Value) -> Value -> Value -> Value #

min :: (Value -> Value -> Value) -> (Value -> Value -> Value) -> Value -> Value -> Value #

Ord (Value -> Value) Source # 

Methods

compare :: (Value -> Value) -> (Value -> Value) -> Ordering #

(<) :: (Value -> Value) -> (Value -> Value) -> Bool #

(<=) :: (Value -> Value) -> (Value -> Value) -> Bool #

(>) :: (Value -> Value) -> (Value -> Value) -> Bool #

(>=) :: (Value -> Value) -> (Value -> Value) -> Bool #

max :: (Value -> Value) -> (Value -> Value) -> Value -> Value #

min :: (Value -> Value) -> (Value -> Value) -> Value -> Value #

Show (Value -> Value -> Value) Source # 

Methods

showsPrec :: Int -> (Value -> Value -> Value) -> ShowS #

show :: (Value -> Value -> Value) -> String #

showList :: [Value -> Value -> Value] -> ShowS #

Show (Value -> Value) Source # 

Methods

showsPrec :: Int -> (Value -> Value) -> ShowS #

show :: (Value -> Value) -> String #

showList :: [Value -> Value] -> ShowS #

lex :: [Value -> Value -> Value] -> [Value] -> [Value] -> Value Source #

data Statement Source #

class Simplifiable a where Source #

Minimal complete definition

simplify

Methods

simplify :: a -> a Source #