If you don't care about the order, you may use: allNumbers = 0 : merge [1,2..] [-1,-2..] where merge (x:xs) ys = x : merge ys xs Cheers, On Tue, Dec 18, 2012 at 12:35 PM, Emanuel Koczwara wrote:

Hi,

Dnia 2012-12-18, wto o godzinie 20:30 +0600, Alexander _ pisze:

...

Hello,

Here you try to reverse infinite list. What do you expect to get?

I was trying to build infinite list from -inf to +inf.

Emanuel

_______________________________________________ Beginners mailing list Beginners@haskell.org http://www.haskell.org/mailman/listinfo/beginners

-- Felipe.

Emanuel: I was trying to build infinite list from -inf to +inf. Bob: What would you expect the number after -inf to be? Wait a minute, let's just talk about the head of the list. What type is the list element? Int? Integer? If Int, there's minBound :: Bounded Int => Int. If Integer, no such instance exists! So perhaps you want [minBound .. maxBound] :: [Int]? -- Kim-Ee On Tue, Dec 18, 2012 at 10:16 PM, Tom Davie wrote:

On 18 Dec 2012, at 14:35, Emanuel Koczwara wrote:

...

Hi,

Dnia 2012-12-18, wto o godzinie 20:30 +0600, Alexander _ pisze:

...

Hello,

Here you try to reverse infinite list. What do you expect to get?

I was trying to build infinite list from -inf to +inf.

What would you expect the number after -inf to be?

Bob

_______________________________________________ Beginners mailing list Beginners@haskell.org http://www.haskell.org/mailman/listinfo/beginners