Is there a Haskell equivalent to
Clojure's partition function? I'm particularly interested in the stepwise feature, where we can select a certain `n` size of the list, then step `m` and take again.
What's returned is a list of lists. Each list being a sublist incremented by `m`. I didn't see anything in the below packages. And I wanted to check before I go about writing my own.