How can I make a shorter binary rule in haskell?
I'm a little out of practice with haskell, but I'm quite fond of it. I want to address your &quot;extra&quot; question first.

wich one of the 2 version is more readable for an haskell programmer, and why ? [sic]

Haskell programmers aren't a special magic kind of people. They tend to take the benefits of brevity more seriously than folks in love with python, but I think they'll still agree that golfed code is not readable/smarter/better. The basic rule of good (code) writing applies: Write what you mean.


create a list starting with [0]
each step, concatenate all the current elements in the list, put the next number at the beginning and add at the end.


Neither of your proposed solutions is obviously doing that, although it only takes a minute to see that your first solution is doing that.
Noughtmare's suggestion is based on a different construction of the OEIS sequence, although the OEIS presents this as an invariant, not a construction, so the reader still needs to think the matter through (a little).
Give-or-take efficiency, write code that obviously does what you're saying it does. Unfortunately, the OEIS entry doesn't describe the sequence in terms that translate directly to a lazy infinite list declaration, so you need to provide some documentation of your own.
-- https://oeis.org/A007814
rulerSequence :: [Integer]
rulerSequence = concat halfs
  where seed = [0, 1]
        -- The sequence is built by concatenating with itself
        -- and incrementing the last index. `nextHalf` builds
        -- the right-hand-side of each such concatenation.
        nextHalf priorHalfs = let priors = concat priorHalfs
                              in (init priors) ++ [(last priors) + 1]
        halfs = seed:[nextHalf (take iteration halfs) | iteration &lt;- [1..]]