Safe Haskell | None |
---|---|
Language | Haskell2010 |
Define upper and lower bounds of program variables.
Synopsis
- data Bounds z r c
- type B rep v = (Maybe rep, v, Maybe rep)
- lowerUpperZ :: Rep c => Z c -> z -> Z c -> Bounds z r c
- lowerZ :: Rep c => Z c -> z -> Bounds z r c
- upperZ :: Rep c => z -> Z c -> Bounds z r c
- binary :: Rep c => z -> Bounds z r c
- lowerUpperR :: Rep c => R c -> r -> R c -> Bounds z r c
- lowerR :: Rep c => R c -> r -> Bounds z r c
- upperR :: Rep c => r -> R c -> Bounds z r c
Documentation
Define upper and lower bounds of program variables. Bounds may be specified multiple times: the intersection of all bounds is used.
type B rep v = (Maybe rep, v, Maybe rep) Source #
Maybe a lower bound, the variable's name, and maybe an upper bound.
lowerUpperZ :: Rep c => Z c -> z -> Z c -> Bounds z r c Source #
Create a lower and upper bound for an integer variable.
lowerZ :: Rep c => Z c -> z -> Bounds z r c Source #
Create only a lower bound for an integer variable.
upperZ :: Rep c => z -> Z c -> Bounds z r c Source #
Create only an upper bound for an integer variable.