#3053: Modular arithmetic bug?
----------------------+-----------------------------------------------------
Reporter: vlaad | Owner:
Type: bug | Status: reopened
Priority: normal | Milestone:
Component: GHCi | Version: 6.10.1
Severity: critical | Resolution:
Keywords: | Testcase:
Os: Windows | Architecture: x86
----------------------+-----------------------------------------------------
Changes (by vlaad):
* status: closed => reopened
* resolution: invalid =>
Comment:
> Otherwise, GHC will happily try and dismiss all those numbers in
`[200..]`, which will keep it busy for a while!-)
Why then we forget about infinite series support, if we have to wait the
GHCi to approach the infinity?
Here is another one NOT WORKING:
take 2 [x | x <- [1,2..], x < 195, x > 188, mod x 6 == 2]
Please don't tell me that GHCi will enumerate from 1 to infinity, what
about this WORKING example:
take 2 [x | x <- [255255..], mod x 15 == 2]
--
Ticket URL: <http://hackage.haskell.org/trac/ghc/ticket/3053#comment:4>
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
