http://conal.net/blog/posts/from-tries-to-trees 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/from-tries-to-trees/comment-page-1#comment-163277 Conal Elliott » Blog Archive » Parallel speculative addition via memoization Tue, 27 Nov 2012 23:39:49 +0000 http://conal.net/blog/?p=314#comment-163277 <p>[...] Or for depth-typed perfect trees (e.g., as described in From tries to trees): [...]</p> [...] Or for depth-typed perfect trees (e.g., as described in From tries to trees): [...]

]]> http://conal.net/blog/posts/from-tries-to-trees/comment-page-1#comment-75751 Conal Elliott » Blog Archive » Composable parallel scanning Wed, 02 Mar 2011 19:25:53 +0000 http://conal.net/blog/?p=314#comment-75751 <p>[...] perfectly balanced trees, of the sort I played with in A trie for length-typed vectors and From tries to trees. The difficulty I encounter is that the functions initTs and tailTs make unbalanced trees out of [...]</p> [...] perfectly balanced trees, of the sort I played with in A trie for length-typed vectors and From tries to trees. The difficulty I encounter is that the functions initTs and tailTs make unbalanced trees out of [...]

]]> http://conal.net/blog/posts/from-tries-to-trees/comment-page-1#comment-75663 Conal Elliott » Blog Archive » Deriving parallel tree scans Tue, 01 Mar 2011 22:18:05 +0000 http://conal.net/blog/?p=314#comment-75663 <p>[...] perfectly balanced trees, of the sort I played with in A trie for length-typed vectors and From tries to trees. The functions initTs and tailTs make unbalanced trees out of balanced ones, so I don’t know [...]</p> [...] perfectly balanced trees, of the sort I played with in A trie for length-typed vectors and From tries to trees. The functions initTs and tailTs make unbalanced trees out of balanced ones, so I don’t know [...]

]]> http://conal.net/blog/posts/from-tries-to-trees/comment-page-1#comment-73176 augustss Wed, 02 Feb 2011 10:07:53 +0000 http://conal.net/blog/?p=314#comment-73176 <p>With dependent types you can encode sums as dependent pairs. The first component of the pair is the tag and the second is the data (with a type depending on the first component). I wonder if you can use this encoding for tries.</p> With dependent types you can encode sums as dependent pairs. The first component of the pair is the tag and the second is the data (with a type depending on the first component). I wonder if you can use this encoding for tries.

]]>