> One of the major elements that sets Elixir apart from most other programming languages is immutability.

It's interesting to compare Elixir to that other immutable programming language: Haskell.

In Elixir, a binding

    counter = counter + 1

binds counter to the old value of counter, plus 1. In Haskell it instead binds counter to the new value plus 1.

Of course that doesn't make sense, and indeed this causes an infinite loop when Haskell tries to evaluate counter.

BUT it does make sense for certain recursive data structures, like an infinite list of 1s:

    ones = 1 : ones

We can check this by taking some finite prefix:

    ghci> take 5 ones
    [1,1,1,1,1]

Another example is making a list of all primes, where you don't need to decide in advance how many elements to limit yourself to.

Can you define such lazy infinite data structures in Elixir?