Hoogle Search
Within LTS Haskell 24.34 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
propLogSum :: (Eq a, C a) => a -> a -> Boolnumeric-prelude Algebra.Transcendental No documentation available.
propSinAngleSum :: (Eq a, C a) => a -> a -> Boolnumeric-prelude Algebra.Transcendental No documentation available.
fromFractionSum :: C a => a -> [(a, [a])] -> T anumeric-prelude MathObj.PartialFraction Unchecked construction.
toFractionSum :: C a => T a -> (a, [(a, [a])])numeric-prelude MathObj.PartialFraction No documentation available.
-
For a multi-set of numbers, we describe a sequence of the sums of powers of the numbers in the set. These can be easily converted to polynomials and back. Thus they provide an easy way for computations on the roots of a polynomial.
fromPowerSums :: (C a, C a) => [a] -> [a]numeric-prelude MathObj.RootSet No documentation available.
liftPowerSum1 :: (C a, C a) => ([a] -> [a]) -> [a] -> [a]numeric-prelude MathObj.RootSet No documentation available.
liftPowerSum1Gen :: ([a] -> [a]) -> ([a] -> [a]) -> ([a] -> [a]) -> [a] -> [a]numeric-prelude MathObj.RootSet No documentation available.
liftPowerSum2 :: (C a, C a) => ([a] -> [a] -> [a]) -> [a] -> [a] -> [a]numeric-prelude MathObj.RootSet No documentation available.
liftPowerSum2Gen :: ([a] -> [a]) -> ([a] -> [a]) -> ([a] -> [a] -> [a]) -> [a] -> [a] -> [a]numeric-prelude MathObj.RootSet No documentation available.