http://conal.net/blog/posts/deriving-parallel-tree-scans 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 http://conal.net/blog/posts/deriving-parallel-tree-scans#comment-823 Tue, 24 May 2011 20:33:21 +0000 http://conal.net/blog/?p=330#comment-823 […] 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-822 Fri, 18 Mar 2011 18:30:45 +0000 http://conal.net/blog/?p=330#comment-822 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-821 Fri, 11 Mar 2011 02:55:43 +0000 http://conal.net/blog/?p=330#comment-821 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-820 Tue, 01 Mar 2011 22:34:17 +0000 http://conal.net/blog/?p=330#comment-820 […] About « Deriving parallel tree scans […]

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

]]>