Hoogle Search

Within LTS Haskell 24.32 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. separateProduct :: forall (n :: Nat) (m :: Natural) . KnownNat n => Finite (n * m) -> (Finite n, Finite m)

   finite-typelits	Data.Finite

   Take a fst-biased product apart.

2. combineProduct :: forall (n :: Nat) (m :: Natural) a . (SaneIntegral a, KnownIntegral a n, Limited a (n * m)) => (Finite a n, Finite a m) -> Finite a (n * m)

   finite-typelits	Data.Finite.Integral

   fst-biased (fst is the inner, and snd is the outer iteratee) product of finite sets.

3. separateProduct :: forall (n :: Nat) (m :: Natural) a . (SaneIntegral a, KnownIntegral a n) => Finite a (n * m) -> (Finite a n, Finite a m)

   finite-typelits	Data.Finite.Integral

   Take a fst-biased product apart.

4. propPowerProduct :: (Eq a, C a) => a -> Rational -> Rational -> Bool

   numeric-prelude	Algebra.Algebraic

   No documentation available.

5. propPowerProduct :: (Eq a, C a) => a -> Integer -> Integer -> Property

   numeric-prelude	Algebra.Ring

   No documentation available.

6. scalarProduct :: C a => [a] -> [a] -> a

   numeric-prelude	Algebra.Ring

   No documentation available.

7. propExpProduct :: (Eq a, C a) => a -> a -> Bool

   numeric-prelude	Algebra.Transcendental

   No documentation available.

8. propPowerProduct :: (Eq a, C a) => a -> a -> a -> Bool

   numeric-prelude	Algebra.Transcendental

   No documentation available.

9. propAssociateProduct :: (Eq a, C a) => a -> a -> Bool

   numeric-prelude	Algebra.Units

   Currently some algorithms assume this property.

10. 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))
    

Page 122 of many | Previous | Next