[Haskell-cafe] Code review: list-like datatype with constant time appending based on function composition.

[Tom Ellis]

On Tue, Nov 18, 2014 at 05:07:21PM +0100, Nicola Gigante wrote:
> I’m surely going to read those paper, and use Data.DList instead of 
> my own implementation, to not reinvent the wheel.
> 
> What about my doubts on why it works so lazily?

I don't know why you'd be doubtful about laziness.  It seems perfectly lazy
to me.  I wrote the post a while ago on how DList works.  Perhaps it will
help you.
         
    http://h2.jaguarpaw.co.uk/posts/demystifying-dlist/

Tom