Upstream the strictness optimisation for GHC.List.{sum,product}

1 files changed, 2 insertions, 2 deletions

diff --git a/libraries/base/GHC/List.hs b/libraries/base/GHC/List.hs
index 732ba13848..4146b68319 100644
--- a/libraries/base/GHC/List.hs
+++ b/libraries/base/GHC/List.hs
@@ -340,7 +340,7 @@ foldl1' _ []             =  errorEmptyList "foldl1'"
 -- * Hangs forever *
 sum                     :: (Num a) => [a] -> a
 {-# INLINE sum #-}
-sum                     =  foldl (+) 0
+sum                     =  foldl' (+) 0
 
 -- | The 'product' function computes the product of a finite list of numbers.
 --
@@ -356,7 +356,7 @@ sum                     =  foldl (+) 0
 -- * Hangs forever *
 product                 :: (Num a) => [a] -> a
 {-# INLINE product #-}
-product                 =  foldl (*) 1
+product                 =  foldl' (*) 1
 
 -- | \(\mathcal{O}(n)\). 'scanl' is similar to 'foldl', but returns a list of
 -- successive reduced values from the left: