Comments on: Topless data http://conal.net/blog/posts/topless-data Inspirations & experiments, mainly about denotative/functional programming in Haskell Sat, 26 Sep 2020 21:06:12 +0000 hourly 1 http://wordpress.org/?v=4.1.17 By: sz http://conal.net/blog/posts/topless-data#comment-676 Mon, 30 Aug 2010 07:55:47 +0000 http://conal.net/blog/?p=169#comment-676 Looking forward to it :-)

]]> By: conal http://conal.net/blog/posts/topless-data#comment-675 Fri, 20 Aug 2010 10:57:17 +0000 http://conal.net/blog/?p=169#comment-675 sz: I do not have such a list. Now I’m inspired to make one. Thanks!

]]> By: sz http://conal.net/blog/posts/topless-data#comment-674 Wed, 18 Aug 2010 08:09:42 +0000 http://conal.net/blog/?p=169#comment-674 Is your list of research writings that influenced you on the web somewhere? I’d be greatly interested in taking a look.

]]> By: conal http://conal.net/blog/posts/topless-data#comment-673 Thu, 05 Aug 2010 00:43:40 +0000 http://conal.net/blog/?p=169#comment-673 Thanks for the link. Yes, I think you were playing with the same idea, particularly when you frame your U type as a list zipper (as you mention). In other words, a “topless list” .

]]> By: Dan P http://conal.net/blog/posts/topless-data#comment-672 Tue, 03 Aug 2010 16:44:15 +0000 http://conal.net/blog/?p=169#comment-672 If I’m understanding the term correctly, I used topless (nice name BTW) data for my implementation of the game of life. In effect it’s a lazy bi-infinite image with a cursor that can be filtered to make another lazy bi-infinite image.

]]> By: Heinrich Apfelmus http://conal.net/blog/posts/topless-data#comment-671 Tue, 03 Aug 2010 10:19:04 +0000 http://conal.net/blog/?p=169#comment-671 There was a thread on haskell-cafe@ about generating an infinite fractal landscape once, in which I sketched a prototype of a 1D image that is both continuous and infinite.

]]> By: Jake McArthur http://conal.net/blog/posts/topless-data#comment-669 Tue, 03 Aug 2010 03:17:34 +0000 http://conal.net/blog/?p=169#comment-669 Just an aside, your QuadTree type is a perfect cofree comonad. You may have already realized it, but for the sake of other readers who might find the point interesting, it could be written like this:

type QuadTree = Cofree Quad

and you get a meaningful Comonad instance for free!

]]>