Module "CLPR.curry"

Library for constraint programming with arithmetic constraints over reals.


 Exported names:

Functions:
*. | +. | -. | /. | <. | <=. | >. | >=. | i2f | maximize | maximumFor | minimize | minimumFor


 Summary of exported functions:

(+.)  :: Float -> Float -> Float  deterministic 
          Addition on floats in arithmetic constraints.
(-.)  :: Float -> Float -> Float  deterministic 
          Subtraction on floats in arithmetic constraints.
(*.)  :: Float -> Float -> Float  deterministic 
          Multiplication on floats in arithmetic constraints.
(/.)  :: Float -> Float -> Float  deterministic 
          Division on floats in arithmetic constraints.
(<.)  :: Float -> Float -> Success  deterministic 
          "Less than" constraint on floats.
(>.)  :: Float -> Float -> Success  deterministic 
          "Greater than" constraint on floats.
(<=.)  :: Float -> Float -> Success  deterministic 
          "Less than or equal" constraint on floats.
(>=.)  :: Float -> Float -> Success  deterministic 
          "Greater than or equal" constraint on floats.
i2f  :: Int -> Float  deterministic 
          Conversion function from integers to floats.
minimumFor  :: (a -> Success) -> (a -> Float) -> a  deterministic 
          Computes the minimum with respect to a given constraint.
minimize  :: (a -> Success) -> (a -> Float) -> a -> Success  deterministic 
          Minimization constraint.
maximumFor  :: (a -> Success) -> (a -> Float) -> a  deterministic 
          Computes the maximum with respect to a given constraint.
maximize  :: (a -> Success) -> (a -> Float) -> a -> Success  deterministic 
          Maximization constraint.

 Imported modules:

Prelude

 Exported datatypes:


 Exported functions:

(+.) :: Float -> Float -> Float  deterministic 

Addition on floats in arithmetic constraints.

Further infos:
  • defined as left-associative infix operator with precedence 6

(-.) :: Float -> Float -> Float  deterministic 

Subtraction on floats in arithmetic constraints.

Further infos:
  • defined as left-associative infix operator with precedence 6

(*.) :: Float -> Float -> Float  deterministic 

Multiplication on floats in arithmetic constraints.

Further infos:
  • defined as left-associative infix operator with precedence 7

(/.) :: Float -> Float -> Float  deterministic 

Division on floats in arithmetic constraints.

Further infos:
  • defined as left-associative infix operator with precedence 7

(<.) :: Float -> Float -> Success  deterministic 

"Less than" constraint on floats.

Further infos:
  • defined as non-associative infix operator with precedence 4

(>.) :: Float -> Float -> Success  deterministic 

"Greater than" constraint on floats.

Further infos:
  • defined as non-associative infix operator with precedence 4

(<=.) :: Float -> Float -> Success  deterministic 

"Less than or equal" constraint on floats.

Further infos:
  • defined as non-associative infix operator with precedence 4

(>=.) :: Float -> Float -> Success  deterministic 

"Greater than or equal" constraint on floats.

Further infos:
  • defined as non-associative infix operator with precedence 4

i2f :: Int -> Float  deterministic 

Conversion function from integers to floats. Rigid in the first argument, i.e., suspends until the first argument is ground.


minimumFor :: (a -> Success) -> (a -> Float) -> a  deterministic 

Computes the minimum with respect to a given constraint. (minimumFor g f) evaluates to x if (g x) is satisfied and (f x) is minimal. The evaluation fails if such a minimal value does not exist. The evaluation suspends if it contains unbound non-local variables.

Further infos:
  • externally defined

minimize :: (a -> Success) -> (a -> Float) -> a -> Success  deterministic 

Minimization constraint. (minimize g f x) is satisfied if (g x) is satisfied and (f x) is minimal. The evaluation suspends if it contains unbound non-local variables.


maximumFor :: (a -> Success) -> (a -> Float) -> a  deterministic 

Computes the maximum with respect to a given constraint. (maximumFor g f) evaluates to x if (g x) is satisfied and (f x) is maximal. The evaluation fails if such a maximal value does not exist. The evaluation suspends if it contains unbound non-local variables.

Further infos:
  • externally defined

maximize :: (a -> Success) -> (a -> Float) -> a -> Success  deterministic 

Maximization constraint. (maximize g f x) is satisfied if (g x) is satisfied and (f x) is maximal. The evaluation suspends if it contains unbound non-local variables.



Generated by CurryDoc (Version 0.4.1 of June 7, 2007) at Aug 28 15:27:25 2008