exp-pairs-0.1.0.0: Linear programming over exponent pairs

Safe HaskellNone
LanguageHaskell98

Math.ExpPairs

Synopsis

Documentation

data LinearForm t Source

Constructors

LinearForm t t t 

Instances

Eq t => Eq (LinearForm t) 
Num t => Num (LinearForm t) 
(Num t, Eq t, Show t) => Show (LinearForm t) 
Num t => Monoid (LinearForm t) 

data RationalForm t Source

Constructors

RationalForm (LinearForm t) (LinearForm t) 

Instances

Num t => Fractional (RationalForm t) 
Num t => Num (RationalForm t) 
(Eq t, Num t, Show t) => Show (RationalForm t) 

data IneqType Source

Constructors

Strict 
NonStrict 

Instances

data Constraint t Source

Constructors

Constraint (LinearForm t) IneqType 

Instances

(Eq t, Num t, Show t) => Show (Constraint t) 

type InitPair = InitPair' Rational Source

data RatioInf t Source

Extends a rational type with positive and negative infinities.

Constructors

InfMinus 
Finite (Ratio t) 
InfPlus 

Instances

Eq t => Eq (RatioInf t) 
Integral t => Fractional (RatioInf t) 
Integral t => Num (RatioInf t) 
Integral t => Ord (RatioInf t) 
Integral t => Real (RatioInf t) 
(Integral t, Show t) => Show (RatioInf t) 

type RationalInf = RatioInf Integer Source

Arbitrary-precision rational numbers with positive and negative infinities