http://conal.net/blog/posts/deriving-parallel-tree-scans Inspirations & experiments, mainly about denotative/functional programming in Haskell Sat, 18 May 2013 00:33:37 +0000 hourly 1 http://wordpress.org/?v=3.1 http://conal.net/blog/posts/deriving-parallel-tree-scans/comment-page-1#comment-80294 Conal Elliott » Blog Archive » Parallel tree scanning by composition Tue, 24 May 2011 20:33:21 +0000 http://conal.net/blog/?p=330#comment-80294 <p>[...] final form is as in Deriving parallel tree scans, changed for the new scan interface. The derivation saved some work in wrapping & unwrapping [...]</p> [...] final form is as in Deriving parallel tree scans, changed for the new scan interface. The derivation saved some work in wrapping & unwrapping [...]

]]> http://conal.net/blog/posts/deriving-parallel-tree-scans/comment-page-1#comment-76874 conal Fri, 18 Mar 2011 18:30:45 +0000 http://conal.net/blog/?p=330#comment-76874 <p>Thanks for the tip, Russell! I'll keep an eye out for these free theorems.</p> Thanks for the tip, Russell! I’ll keep an eye out for these free theorems.

]]> http://conal.net/blog/posts/deriving-parallel-tree-scans/comment-page-1#comment-76401 Russell O'Connor Fri, 11 Mar 2011 02:55:43 +0000 http://conal.net/blog/?p=330#comment-76401 <p>Your theorem <code>headT ∘ fmap f ≡ f ∘ headT</code> is the free theorem for <code>headT</code> (and <code>lastT</code>), so you don't even have to do anything to prove it. It follows from the type.</p> Your theorem headT ∘ fmap f ≡ f ∘ headT is the free theorem for headT (and lastT), so you don’t even have to do anything to prove it. It follows from the type.

]]> http://conal.net/blog/posts/deriving-parallel-tree-scans/comment-page-1#comment-75665 Conal Elliott » Blog Archive » Composable parallel scanning Tue, 01 Mar 2011 22:34:17 +0000 http://conal.net/blog/?p=330#comment-75665 <p>[...] About « Deriving parallel tree scans [...]</p> [...] About « Deriving parallel tree scans [...]

]]> http://conal.net/blog/posts/deriving-parallel-tree-scans/comment-page-1#comment-75660 Jake McArthur Tue, 01 Mar 2011 21:13:21 +0000 http://conal.net/blog/?p=330#comment-75660 <p>The correspondence of tailsTs with duplicate comes up if you change your tree from a free monad to a cofree comonad.</p> The correspondence of tailsTs with duplicate comes up if you change your tree from a free monad to a cofree comonad.

]]>