product package:numeric-prelude

product :: C a => [a] -> a
numeric-prelude Algebra.Ring NumericPrelude NumericPrelude.Numeric
product1 :: C a => [a] -> a
numeric-prelude Algebra.Ring NumericPrelude NumericPrelude.Numeric
propPowerProduct :: (Eq a, C a) => a -> Rational -> Rational -> Bool
numeric-prelude Algebra.Algebraic
propPowerProduct :: (Eq a, C a) => a -> Integer -> Integer -> Property
numeric-prelude Algebra.Ring
scalarProduct :: C a => [a] -> [a] -> a
numeric-prelude Algebra.Ring
propExpProduct :: (Eq a, C a) => a -> a -> Bool
numeric-prelude Algebra.Transcendental
propPowerProduct :: (Eq a, C a) => a -> a -> a -> Bool
numeric-prelude Algebra.Transcendental
propAssociateProduct :: (Eq a, C a) => a -> a -> Bool
numeric-prelude Algebra.Units
Currently some algorithms assume this property.
tensorProduct :: C a => [a] -> [a] -> [[a]]
numeric-prelude MathObj.Polynomial.Core
\(QC.NonEmpty xs) (QC.NonEmpty ys) -> PolyCore.tensorProduct xs ys == List.transpose (PolyCore.tensorProduct ys (intPoly xs))
tensorProductAlt :: C a => [a] -> [a] -> [[a]]
numeric-prelude MathObj.Polynomial.Core
parseProduct :: Parser [(String, Integer)]
numeric-prelude Number.Physical.Read
This function could also return the value, but a list of pairs (String, Integer) is easier for testing.
parseProductTail :: Parser [(String, Integer)]
numeric-prelude Number.Physical.Read
crossProduct :: C a => (a, a, a) -> (a, a, a) -> (a, a, a)
numeric-prelude Number.Quaternion
scalarProduct :: C a => (a, a, a) -> (a, a, a) -> a
numeric-prelude Number.Quaternion