#2754: Strictness analyzer fails on an implementation of foldl
--------------------------------------+-------------------------------------
Reporter: nimnul | Owner:
Type: run-time performance bug | Status: new
Priority: normal | Milestone:
Component: Compiler | Version: 6.8.3
Severity: normal | Resolution:
Keywords: | Difficulty: Unknown
Testcase: | Architecture: x86
Os: Windows |
--------------------------------------+-------------------------------------
Comment (by simonmar):
Could you be more clear about what behaviour you claim is wrong here? The
example code doesn't use `foldA` or `foldB`. `foldA` is just `foldl`,
which has well-known performance issues, and `foldB` is the same as
`foldl'`, available from the `Data.List` module.
--
Ticket URL: <http://hackage.haskell.org/trac/ghc/ticket/2754#comment:2>
GHC <http://www.haskell.org/ghc/>
The Glasgow Haskell Compiler
_______________________________________________
Glasgow-haskell-bugs mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs
