Safe Haskell  None 

Language  Haskell2010 
Univariate polynomials
 newtype Poly coeff = Poly {}
 newtype RisingPoly coeff = RisingPoly {
 fromRisingPoly :: FreeMod coeff RisingF
 newtype FallingPoly coeff = FallingPoly {
 fromFallingPoly :: FreeMod coeff FallingF
 newtype X = X Int
 newtype RisingF = RF Int
 newtype FallingF = FF Int
 risingPoly :: RisingF > Poly Integer
 fallingPoly :: FallingF > Poly Integer
 lagrangeInterp :: [(Rational, Rational)] > Poly Rational
 lagrangeInterp' :: [(Rational, Rational)] > QMod X
 lagrangePoly' :: [Rational] > Int > QMod X
Polynomials
Standard univariate polynomials
newtype RisingPoly coeff Source #
Univariate polynomials using rising factorials as a basis function
RisingPoly  

newtype FallingPoly coeff Source #
Univariate polynomials using falling factorials as a basis function
FallingPoly  

Monomials
A power of x
(that is, a monomial of the form x^i
)
Rising and falling factorials
Rising factorial x^(k) = x(x+1)(x+2)...(x+k1)
Falling factorial x_(k) = x(x1)(x2)...(xk+1)