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

[Atze van der Ploeg]

Hi Tom,

Your "Tree" construction does generalize to monads. Also see my paper and
oleg's paper "reflection without remorse" referenced above.

Cheers,

Atze
On Nov 19, 2014 5:46 AM, "Tom Ellis" <
tom-lists-haskell-cafe-2013 at jaguarpaw.co.uk> wrote:

> 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
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20141119/ffe6d7ba/attachment.html>